prime number in c++
#include<iostream>
using namespace std;
int main()
{
int n;
bool c=1;
cin >> n;
if (n <= 1)
{
cout << "NO\n";
}
else
{
for (int i = 2; i < n; i++)
{
if (n % i == 0)
{
c=0;
break;
}
}
if (!c)
cout << "NO\n";
else
cout << "YES\n";
}
return 0;
}prime number c++
template<class T> bool isPrime(T n)
{
T i;
if(i<2) return false;
for(i = 2; i * i <= n; i++) {
if(n % i == 0) return false;
}
return true;
}C++ prime number
// A optimized school method based C++ program to check
// if a number is prime
#include <bits/stdc++.h>
using namespace std;
bool isPrime(int n)
{
// Corner cases
if (n <= 1)
return false;
if (n <= 3)
return true;
// This is checked so that we can skip
// middle five numbers in below loop
if (n % 2 == 0 || n % 3 == 0)
return false;
for (int i = 5; i * i <= n; i = i + 6)
if (n % i == 0 || n % (i + 2) == 0)
return false;
return true;
}
// Driver Program to test above function
int main()
{
isPrime(11) ? cout << " true\n" : cout << " false\n";
isPrime(15) ? cout << " true\n" : cout << " false\n";
return 0;
}Copyright © 2021 Codeinu
Forgot your account's password or having trouble logging into your Account? Don't worry, we'll help you to get back your account. Enter your email address and we'll send you a recovery link to reset your password. If you are experiencing problems resetting your password contact us
