primes code example

Example 1: 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<<" ";
	}
}

Example 2: prime number

#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(){
	long long x;
	cin>>x;
	if(Is_Prime(x))cout<<"Is Prime";
	else cout<<"Is not Prime";
}

Example 3: first prime numbers less than

#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(){
	//primes less than n
	int n;
	cin>>n;
	int primes=0,i=1;
	while(primes++<n){
		while(!Is_Prime(++i));
		cout<<i<<" ";
	}
}

Example 4: prime

Sieve of Eratosthenes Shows whether index is prime or     not. Helps to find the prime numbers     smaller than the given number    .XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

Example 5: prime

This platform is addictive as hell. Stay away if you wanna be productive