Sphere Online Judge

SPOJ Problem Set (classical)

3587. Prime Again

Problem code: PAGAIN

Tìm số nguyên tố gần nhất nhỏ hơn N.(3 <= N <= 2^32)

Dữ liệu

Dòng ðầu tiên chứa số nguyên T là số lượng test. (T <= 10000)

T dòng tiếp theo, mỗi dòng chứa một số nguyên N.

Kết quả

Với mỗi test, in kết quả trên một dòng.

Ví dụ

Dữ liệu:
3
5 
10
17

Kết quả:
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

hide comments
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
SPOJ System © 2010 Sphere Research Labs. All Rights Reserved.