OJ Board

Looks like you have a space after the last 0.

Beside this bug, You may have a precision problem too Your program output 2^-14 = 6.103E-5 [evan@enigma 545] $ bc -l bc 1.06 Copyright 1991-1994, 1997, 1998, 2000 Free Software Foundation, Inc. This is free software with ABSOLUTELY NO WARRANTY. For details type `warranty'. 2^-14 .0000610351562500000...

Try n = 137,138,6461,

your program output
2^-137 = 5.73:E-42
2^-138 = 2.86:E-42
2^-6461 = 1.10:E-1945

I got accepted, not good speed also. Maybe it's because I precalculate all the solutions

I use a modifiication of sieve and calculate the number of terms as it goes.
Then for all i, calculate all the sum of terms[2] to terms..

I have the answer[] arrays before I even start reading the input.

Can a path reuse a visited position?
Is this a valid path?

-evan

Check your pile_onto() function. Try this input 24 pile 0 over 23 pile 1 over 23 pile 2 over 23 pile 3 over 23 pile 4 over 23 pile 5 over 23 pile 6 over 23 pile 7 over 23 pile 8 over 23 pile 9 over 23 pile 10 over 23 pile 11 over 23 pile 12 over 23 pile 13 over 23 pile 14 over 23 pile 15 over 23 pil...

You got division by zero in this line while(j%primes[pm]==0)

This function is deprecated -- use memset in new programs.

program problem_100; var N1,N2,count,solve1:longint; mass1,mass2,mass3:array[1..100] of longint; function Solve(N,k:longint):longint; var i,j,res:longint; begin solve1:=0; FOR j:=n TO k DO begin i:=j; Res:=0; while i>1 do begin if odd(i) then i:=i*3+1 else I:=I div 2; Inc(res); end; if res>solve1 t...

Your sorting part is incorrect.

Try this case
2 3
TG
CA
AA

Answer should be
AA
TG
CA

Maybe it's because you print a blank line after the last solution.