Search found 3 matches

by magicalan
Sun Feb 16, 2003 5:06 am
Forum: Volume 104 (10400-10499)
Topic: 10450 - World Cup Noise
Replies: 42
Views: 19986

code : array [1..50] of longint; zeros : longint; when n = 1 there are only two possibilities '1' and '0' for n = 2 we try to add '0' and '1' after them (code[1] = 2 , zeros = 1(one number end with zero)) for number end with '1' , we can add '0' only for '0' , we can add both '0' and '1' so '10' , '...
by magicalan
Thu Jan 30, 2003 6:04 am
Forum: Volume 104 (10400-10499)
Topic: 10426 - Knights' Nightmare
Replies: 17
Views: 7779

8)
I have read the pascal program,
for each set , he has performed BFS for 8 times.
My method need only 5 times, I think It can reduce the run time.

Go to advanced search