素数判定
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 113999 Accepted Submission(s): 40076
Total Submission(s): 113999 Accepted Submission(s): 40076
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
import java.util.*; import java.math.*; import java.io.*; public class Main { public static void main(String[] args) { // TODO Auto-generated method stub Scanner in =new Scanner(System.in); while(in.hasNext()) { int x,y,k=0; x=in.nextInt(); y=in.nextInt(); if(x==0&&y==0) break; if(-39<=x&&x<y&&y<=50) { for(int i=x;i<=y;i++) { int n; n=i*i+i+41; for(int t=2;t<n;t++) { if(n%t==0) k++; } } } if(k==0) System.out.println("OK"); else System.out.println("Sorry"); } } }