素数判定
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 129528 Accepted Submission(s): 45422
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
Source
Recommend
import java.util.Scanner;
public class Main {
public static void main(String args[])
{
Scanner in = new Scanner(System.in);
while(in.hasNext())
{
int a = in.nextInt();
int b = in.nextInt();
if(a == 0 && b == 0)
{
break;
}
int flag = 0;
for( int i = a; i<= b; i++)
{
int ans = i * i + i + 41;
if(prim(ans) == 0)
{
flag = 1;
}
}
if (flag == 1)
System.out.println("Sorry");
else
{
System.out.println("OK");
}
}
}
public static int prim(int n)
{
for( int i = 2; i * i <= n; i++)
{
if(n%i==0)
return 0;
}
return 1;
}
}