PAT乙级1013

最新推荐文章于 2025-07-06 21:05:29 发布

原创最新推荐文章于 2025-07-06 21:05:29 发布 · 357 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#PAT

PAT乙级专栏收录该内容

90 篇文章

订阅专栏

实现


#include <iostream>
#include <cmath>
using namespace std;


bool isPrime(int num)
{

	int i;
	for (i = 2; i <= sqrt(num); i++)
	{
		if (num%i == 0)
			return false;
	}
	return true;
}
int main(int argc, char* argv[])
{
	int count=1,num=2;
	int PM,PN,n,m,hang=1;
	cin>>PN>>PM;
	n=PN;m=PM;
	while(count<=m)
	{
		if(isPrime(num))
		{
			//cout<<num<<" ";
			if(count>=PN)
			{
				if(hang%10==0)
				{
					if(count!=PM)
						cout<<num<<endl;
					else
						cout<<num;
				}
				else
				{
					if(count==m)
						cout<<num;
					else
						cout<<num<<" ";
				}
				hang++;
			}
				
			count++;
		}
		//PN--;
		num++;
	
	}
	//cout<<isPrime(4);
	return 0;
}