OJ Board

why are you interested in primes only?
for even numbers, -> ok, can be done with 4 squares
what about 15 for example? it is odd and not prime, why is it easier than 3, 5 or any other prime number?

also, there are going to be very big numbers (being 64 bit ) after k becomes 70-80

nick

hey
use an array saveF[10001], to save already the computed values of f(k)

otherwise you compute the same values over and over, and it is veeeery slow

huh
for k points
is it the answer something like 2^k
can you suggest some recurrence relation

thanks!

nick