int main()
{
int m, n;
int i=0; //标记已找到质数的个数
int flag=0; //标记是否为质数
cin >> m >> n;
if(m<=0)
{
return;
}
if(m==1 || m==2 || m==3)
{
cout << m << endl;
i++;
m++;
}
while(i<n)
{
for(int j=2;j<m;j++)
{
if(m%j == 0)
{
flag++; //标记m为质数
break;
}
}
if(flag != 1)
{
i++;
cout << m << endl;
}
m++;
flag = 0;
}
return 0;
}
c ++ realize from the m start looking prime number n
Guess you like
Origin blog.csdn.net/dcjmessi/article/details/104579339
Ranking