#include<stdio.h>
#include<math.h>
int primeJudge(int number) {
int i;
if (number < 2)
return 0;
else {
for (i = 2; i <= sqrt((double)number); i++)
if (number % i == 0)
return 0;
return 1;
}
}
void countJudge(int minNumber, int maxNumber){
int sum = 0/*第几个素数*/, number = 2/*素数的定义*/, printfNumber = 0/*已经输出的数量*/;
while (sum != maxNumber) /*开始判断函数*/ {
if (primeJudge(number)==1) /*如果是素数*/ {
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);
countJudge(minNumber, maxNumber);
//system("pause");
return 0;
}
2020年5月19日19:07:26