SPOJ Problem Set (classical)

3587. Prime Again

In this problem, you have to find the nearest prime number smaller than N. (3 <= N <= 2^32)

The first line contains an integer T specifying the number of test cases. (T <= 10000)

T lines follow, each line contains an integer N.

For each test case, output the result on one line.

Input:
3
5 
10
17

Output:
3
7
13

Added by:	Race with time
Date:	2008-12-25
Time limit:	5s
Source limit:	50000B
Languages:	All except: CLOJ ERL F# JS PERL 6 TECS


2010-06-07 17:39:15 .::: Debanjan :::. I used a slight different version of Miller-Rabin test to get an accepted verdict. Last edit: 2010-06-07 17:39:32
2010-04-26 21:05:40 XeRon!X @Debanjan I think there are more than 1 input sets with t test cases each. For each of them time limit is 5s. Time which is shown in result is the total time taken to print output for all input sets.
2010-04-09 14:05:43 .::: Debanjan :::. The time limit is of 5 secs,then how come 8+ secs solution got accepted ? EDIT:Old solutions should be rejudged. Last edit: 2010-04-09 16:57:32