PTRI - primes triangle (I)
primes triangle is a triangle that contain all prime numbers .
7 11 13
17 19 23 29
you task is very easy given an integer from 1 to 10^8 prints its place in the primes triangle .
in the first line integer 1<= T <= 10^5 , followed by T lines each line contain integer 1 <= n <= 10^8 .
one line contain pair of integers i , j .where i is the row number and j is the column number , 1 base . or -1 if n not exist in the primes triangle .
Output: 2 1
if you find Time limit is small here you can solve the tutorial version here :
@abdou 00 Time Limit is very strict it should be at least .5s ?
Tutorial version link is dead.
@fitcat: The time limit is strict, but changing it now is a bad idea, as some people have already worked hard to pass within it. The tutorial version does have different data from this one, I don't know why; my recommendation is to focus more on the 0.2s than on the overall time.
Even my program ran in 0.70s (better than the 3rd AC one) in the tutorial version, still got TLE. Are the test cases different? If not, is it possible to relax the time limit on the total time instead of the individual time?