I have solution which take 1.001 sec for work...
It's - retrieval =)...
But - i can't make it faster... =(...

>

I wrote program that work 1.001 sec, but i can't make it
faster.
It's retrieval (searching)

> I wrote program that work 1.001 sec, but i can't make it
> faster.
> It's retrieval (searching)
You program have not work just 1.001 sec. The test system
stopped your program when it had been runned more than 1
sec.

Thanx - i didn't know it =)

Use Tonelli algo for root(a,p) with precalculations
for all primes in [1..33000] and you will be first as I.
I don't say about evedent: basic number algos as
pow(a,n,p),inv(a,p) must be effectively implemented.
Also: there is simple Tonelli pseudocodes without
algebraic proves.