[1155] Find the Prime Number Again
- 时间限制: 1500 ms 内存限制: 65535 K
- 问题描述
-
This is a simple problem. Give you a number N. You should tell me it is not a prime number.
- 输入
-
This problem has several cases.The case is less than 550000.
For each case just contain one integer N (N <= 5000000).
When the N is a non-postive number end of the input. - 输出
-
If the number is a prime number print "Yes", otherwise print "No"
- 样例输入
-
2 3 4 5 0
- 样例输出
-
Yes Yes No Yes
- 提示
-
无
- 来源
-
Monkeyde17
- 操作
-
