check prime in c++
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
#define ll long long
bool checkPrime(int number){
for(int i=2; i<=sqrt(number); i++){
if(number%i==0){
return false;
}
}
return true;
}
check prime in c++
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
#define ll long long
bool checkPrime(int number){
for(int i=2; i<=sqrt(number); i++){
if(number%i==0){
return false;
}
}
return true;
}
prime factorisation of a number in c++
// Function that returns a vector containing all the prime factors of n (25 --> 5, 5)
vector<long long> prime_factorisation(long long n)
{
//spf is smallest prime factor
map<long long, long long> spf;
vector<long long> ans(0);
for(long long i = 2; i <= n; i++) spf[i] = i;
for (long long i = 2; i <= n; i++)
if (spf[i] == i)
for (long long j = i * i; j <= n; j += i)
if (spf[j] == j)
spf[j] = i;
while (n != 1)
{
ans.push_back(spf[n]);
n /= spf[n];
}
return ans;
}
check prime in c++
#include <bits/stdc++.h>
using namespace std;
#define ll long long
bool isPrime(ll number){
for(ll i = 2; i <= number / 2; i++){
if(number % i == 0)
{
return false;
break;
}
}
return true;
}
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