素数判定
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 72749 Accepted Submission(s): 25334
Problem Description
对于表达式n^2+n+41,当n在(x,y)范围内取整数值时(包括x,y)(-39<=x<y<=50),判定该表达式的值是否都为素数。
Input
输入数据有多组,每组占一行,由两个整数x,y组成,当x=0,y=0时,表示输入结束,该行不做处理。
Output
对于每个给定范围内的取值,如果表达式的值都为素数,则输出"OK",否则请输出“Sorry”,每组输出占一行。
Sample Input
0 1 0 0
Sample Output
OK
Author
lcy
代码:
#include <stdio.h>
int main ()
{
int x,y,num,i;
while (scanf ("%d%d",&x,&y)&&(x||y))
{
for (;x<=y;x++)
{
num=x*x+x+41;
for (i=2;i<num;i++)
{
if (num%i==0) break;
}
if (i!=num) break;
}
if (i!=num) printf ("Sorry\n");
else printf ("OK\n");
}
return 0;
}
Run ID | Submit Time | Judge Status | Pro.ID | Exe.Time | Exe.Memory | Code Len. | Language | Author |
11168247 | 2014-07-24 15:25:17 | Accepted | 2012 | 0MS | 228K | 414 B | C++ | Hidden Secret |