NOVICE24 - Problem 4
Given an integer N you have to find smallest prime number which comes after N, means smalltest prime which is greater than N.
First line contains T the number of test cases. Each of next T lines contain one integer N. 1<=N<=10^9
For each test case print the answer in a new line.
There is some issue with the IO file My haskell code is giving NZEC but accepted for similar problem (8360. Prime After N AU12)
John and the cows:
easy one :)
Mahesh Chandra Sharma:
There was a problem in the "checker" option. It has been fixed now!
Plz check the judge ...
Is there input set for this problem?
There seems to be some "waiting" problem in Judge
|Added by:||Mahesh Chandra Sharma|
|Cluster:||Cube (Intel G860)|
|Languages:||All except: ASM32-GCC GAWK MAWK BC C-CLANG CPP14 CPP14-CLANG COBOL COFFEE D-CLANG D-DMD DART ELIXIR FANTOM FORTH GOSU GRV JS-MONKEY KTLN NIM NODEJS OBJC OBJC-CLANG OCT PICO PROLOG PYPY PY_NBC R RACKET RUST CHICKEN SED SQLITE SWIFT UNLAMBDA VB.NET|
|Resource:||NSIT Noivce contest #2|