Pat class B 1013

Hello everyone , I meet you again , I'm your friend, Quan Jun .

Realization

#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;
}

Copy

Publisher ： Full stack programmer stack length , Reprint please indicate the source ：https://javaforall.cn/133170.html Link to the original text ：https://javaforall.cn