I have tried 2 different (completely) different algorithms for the ACODE, problem.
I can't see what is wrong, any special cases in this problem ?
These are some tests I ran, same answer with diff algorithms.
(of course, they might both be wrong !, but I don't think so...)
How sensitive is the judge to NL/CR characters at the beginning or end of the solution ?
input:
25114
1111111111
3333333333
181292321118743131219236834956616923925
61247812412412123124579127212412435689
1798235697156912783569836129273561725378612378635613059612634513257896128935618263
0
output:
6
89
1
10240
19440
147456