#include<cstdio>
#include<cmath>
using namespace std;
bool isprime(int n)
{
int sqr = (int)sqrt(1.0*n);
for (int i = 2; i <= sqr; i++)
{
if (n%i == 0) return false;
}
return true;
}
int main()
{
int m,n;
scanf("%d%d",&m, &n);
int i = 2,count=0,el=0;
while (count < n)
{
while (count < m-1)
{
if (isprime(i)) count++;
i++;
}
if (isprime(i))
{
count++;
el++;
printf("%d", i);
if (el % 10 != 0 && count != n) printf(" ");
else if (el % 10 == 0) printf("\n");
}
i++;
}
return 0;
}
B1013 数素数 (20 分)
最新推荐文章于 2023-11-04 22:20:08 发布