#include<stdio.h>
#include<math.h>
void primeJudge(int minNumber,int maxNumber)
{
int i, sum = 0/*第几个素数*/, number = 2/*素数的定义*/,printfNumber=0/*已经输出的数量*/;
while (sum != maxNumber) /*开始判断函数*/{
for (i = 2; i <= sqrt(number); i++) {
if (number%i == 0)
break;
}
if (i > sqrt(number)) /*如果是素数*/{
sum++;//素数数量+1
if (sum >= minNumber && sum <= maxNumber)/*如果是目标素数*/{
printf("%d", number);
printfNumber++;//输出数量+1
if (printfNumber % 10 != 0 && printfNumber!=maxNumber-minNumber+1)//如果不是最后一排(第10个)且不是最后面的那一个
printf(" ");
else if(printfNumber % 10 == 0)//每一排最后一个
printf("\n");
}
}
number++;//判断一次自然数+1
}
}
int main() {
int minNumber, maxNumber;
scanf("%d%d", &minNumber, &maxNumber);
primeJudge(minNumber, maxNumber);
//system("pause");
return 0;
}
PAT-乙级 1013 数素数(C语言)
猜你喜欢
转载自blog.csdn.net/tothk/article/details/104212297
今日推荐
周排行