## Next Prime (Hard)

View as PDF

Points:15
Time limit:2.0s
Memory limit:64M

Problem type

Allowed languages
Ada, Assembly, Awk, Brain****, C, C++, COBOL, CommonLisp, Dart, Erlang, Forth, Fortran, Intercal, Octave, Pascal, Prolog, R, Racket, Rust, Scheme, Sed, TCL, Text, Turing, VB

##### Brute Force Practice 3 — Hard Version

You love prime numbers. You own a number, but you suspect it might not be prime. You want a prime number, but it must be at least as large as the number you currently own. Find the smallest number that satisfies those conditions.

#### Input

The first line will have the integer ()

#### Output

Print the number you want.

#### Sample Input

4

#### Sample Output

5

• cranberrysauce26
commented on April 16, 2017

I think there might be a problem with the online grader cuz I got the results for test cases 1 to 10:

1. 0.007s
2. 0.008s
3. 0.006s
4. 0.008s
5. 0.008s
6. 0.009s
7. 0.010s
8. 0.011s
9. 0.010s
10. 0.013s

and in my submissions, it says my time is 0.09s. I calculated the average to be 0.009s, so I think the grader is multiplying by 10 for some reason.

I did not misread the decimal places btw. Thanks!

• wleung_bvg
commented on April 16, 2017

The time is the total time, not the average

• println_hi_
commented on Oct. 15, 2016
Python disabled?

What is submitting code in python not allowed for this problem?

• xxX_V1Ct0R_Xxx
commented on Jan. 21, 2017

Cus we dont liek python........ its bad... :P

• parkjs814
commented on Sept. 18, 2016
aa

• FatalEagle
commented on March 23, 2015
No partial output

Partial output is disabled for this problem.