User:Ledrug/bits

<lang c>#include <stdio.h>

1. include <string.h>

int b = 99, u = 1; char *d[16], y[] = "#:ottle/ of:eer_ a_Go<o5st>y some6_Take8;do" "wn4pa=1rou7_17 _<h;_ m?_nd_ on_085wall_ b_e _" " t_ss it_?4bu_ore_9, 0.@, 9$";

1. define eq ==
2. define ne =!
3. define xor ^=
4. define nz(x) !(x=0)
5. define or(x, z) else if (c eq x && nz(c) &&(c ne z));

int p(char *x) { char *s = x; unsigned char c; for (d[c=0]=y; !x && (d[c+1] = strchr(s=d[c], '_')); *(d[++c]++)=0);

for (x = s?:x; (c = *s++); c?putchar(c):0) { if (!(((c xor 48) & ~0xf) &&(c xor 48))) p(d[c]), c = 0; or('$', p(b-99 ? ".\n":".") && p(b-99 ? x : "")) or('@', c && p(d[!!b--+2])) or('/', c && p(b^1?"s":"")) or('#', b++ ? p("So6"+--b): !printf("%d", b?--b:(b += 99))) or('S', !(++u%3)*32 + 78) or('.', puts(".")) } return c; }

int main() { return p(0); }</lang> <lang c>#include <stdio.h>

1. include <stdlib.h>

1. define S 10

typedef struct { double v; int fixed; } node;

1. define each(i, x) for(i = 0; i < x; i++)

node **alloc2(int w, int h) { int i; node **a = calloc(1, sizeof(node*)*h + sizeof(node)*w*h); a[0] = (node*)(a + h); each(i, h) if (i) a[i] = a[i-1] + w; return a; }

void set_boundary(node **m) { m[1][1].fixed = 1; m[1][1].v = 1; m[6][7].fixed = -1; m[6][7].v = -1; }

double calc_diff(node **m, node **d, int w, int h) { int i, j, n; double v, total = 0; each(i, h) each(j, w) { v = 0; n = 0; if (i) v += m[i-1][j].v, n++; if (j) v += m[i][j-1].v, n++; if (i+1 < h) v += m[i+1][j].v, n++; if (j+1 < w) v += m[i][j+1].v, n++;

v = m[i][j].v - v / n; d[i][j].v = v; if (!m[i][j].fixed) total += v * v; } return total; }

double iter(node **m, int w, int h) { node **d = alloc2(w, h); int i, j; double diff = 1e10; while (diff > 1e-24) { set_boundary(m); diff = calc_diff(m, d, w, h); each(i,h) each(j, w) m[i][j].v -= d[i][j].v; }

double cur[] = {0, 0, 0}; each(i, h) each(j, w) cur[ m[i][j].fixed + 1 ] += d[i][j].v * (!!i + !!j + (i < h-1) + (j < w -1));

//char *name = "+g-"; //each(i, 3) printf("I%c = %g\n", name[i], current[i]); free(d);

return (cur[2] - cur[0])/2; }

int main() { node **mesh = alloc2(S, S); printf("R = %g\n", 2 / iter(mesh, S, S)); // free(mesh); return 0; }</lang>