素数判定
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 47715 Accepted Submission(s): 16301
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
JGShining
#include <iostream>
#include <math.h>
using namespace std;
int is_prime(int p)//whether the number is prime number or not yes return 1 otherwise return 0
{
int j , k = 0;
for (j = 2; j <= sqrt(p); j++)
{
if (p % j == 0)
{
k++;
break;
}
}
if(k > 0)
return 0;
else return 1;
}
int main(){
int m,n,i;
while(cin>>m>>n)
{
if (m == 0 && n == 0) break;
if (m > n)
{
int temp = n;
n = m;
m = temp;
}
bool flag = false;
for (i = m; i <= n; i++)
{
int p = i*i + i + 41;
if (is_prime(p) == 0)
{
flag = true ;
break;
}
}
if(flag)
cout<<"Sorry"<<endl;
else cout<<"OK"<<endl;
}
return 0;
}