Rejudge Progress:

1008: Prime Numbers(简单)

Time Limit: 1000 MS Memory Limit: 65536 KB
Total Submit: 7168 Accepted: 1006 Page View: 12873
Submit Status Discuss
Given an integer number, you are required to find out whether it's a prime number.
The first line contains the number of test cases T (1 <= T <= 20 ), then the following T lines each contains an integer number N (0 < N < 4,000,000,000).
For each test case, if N is a prime number, output a line containing the word "Prime", otherwise, output the word "No".
3 5 10 3999999997
Prime No No