Cheating a Boolean Tree solutions

Cheating a Boolean Tree was solved using Pascal by 24 contestants. Solution sizes: average 2255 bytes (shortest: 1222; longest: 5130).

The list below is sorted by ranking. You can also sort by solution size.

tourist (S, L) (1222 B)
30.

vepifanov (S, L) (1353 B)
88.

ZhouErjin (S, L) (1532 B)
111.

Jby (S, L) (1310 B)
204.

yangzhe1990 (S, L) (1500 B)
253.

i.bogatyi (S, L) (1750 B)

350.

VadimK (S, L) (3527 B)
354.

ulyanick (S, L) (1626 B)
357.

agh (S, L) (1573 B)
374.

hesibo (S, L) (1656 B)
443.

marspeople (S, L) (1813 B)
525.

ShangJingbo (S, L) (3704 B)

650.

microbrain (S, L) (1676 B)
773.

FAndy (S, L) (1344 B)
824.

w0nder (S, L) (3540 B)
839.

Lazarev (S, L) (2656 B)
1118.

Hedgehog (S, L) (1720 B)
1168.

Amir (S, L) (5130 B)

1234.

SleepyOverlord (S) (3745 B)
1287.

zxbodya (S, L) (3339 B)
1294.

lyj (S, L) (1574 B)
1306.

YzhEver (S, L) (1667 B)
1386.

pdwd (S) (2136 B)
1543.

spiker (S) (2908 B)