59 Prime Number Code Example

Example: first prime numbers

#include<bits/stdc++.h> using namespace std; bool Is_Prime(long long x){ 	if(x%2==0)return false; 	for(int i=3;i*i<=x;i+=2) 		if(x%i==0)return false; 	return true; } int main(){ 	//first n prime numbers 	int n; 	cin>>n; 	int i=1; 	while(n--){ 		while(!Is_Prime(++i)); 		cout<<i<<" "; 	} }