/***
Md. Namzul Hasan
Shahjalal University of Science & Technology,Sylhet.
hasan08sust@gmail.com
***/
#include<bits/stdc++.h>
using namespace std ;
typedef long long ll ;
typedef int in ;
typedef unsigned long long ull ;
const double pi = 2*acos(0) ;
#define maxi 40000
#define pf printf
#define sc scanf
#define pb push_back
#define MEM(x,y) (memset((x),(y),sizeof(x)))
#define MIN(x,y) ((x) < (y) ? (x) : (y))
#define MAX(x,y) ((x) > (y) ? (x) : (y))
#define load(array,size) for(int i=0 ; i<size ; i++) cin>>array[i] ;
#define new_line pf("\n")
#define clear_data(array) memset(array,0,sizeof(array))
#define highest_int 2147483647
class exam
{
public:
int p ;
bool isPrime(int m)
{
if(m<2)
return false ;
else if(m==2)
return true ;
else if(m%2==0)
return false ;
else
{
int i ;
for(i=2 ; i<=sqrt(m) ; i++)
{
if(m%i==0)
return false ;
}
return true ;
}
}
};
int main()
{
int n ;
sc("%d",&n) ;
exam ob ;
bool t = ob.isPrime(n) ;
if(t)
pf("%d is Prime\n",n) ;
else
pf("%d in not Prime\n",n) ;
return 0;
}
Md. Namzul Hasan
Shahjalal University of Science & Technology,Sylhet.
hasan08sust@gmail.com
***/
#include<bits/stdc++.h>
using namespace std ;
typedef long long ll ;
typedef int in ;
typedef unsigned long long ull ;
const double pi = 2*acos(0) ;
#define maxi 40000
#define pf printf
#define sc scanf
#define pb push_back
#define MEM(x,y) (memset((x),(y),sizeof(x)))
#define MIN(x,y) ((x) < (y) ? (x) : (y))
#define MAX(x,y) ((x) > (y) ? (x) : (y))
#define load(array,size) for(int i=0 ; i<size ; i++) cin>>array[i] ;
#define new_line pf("\n")
#define clear_data(array) memset(array,0,sizeof(array))
#define highest_int 2147483647
class exam
{
public:
int p ;
bool isPrime(int m)
{
if(m<2)
return false ;
else if(m==2)
return true ;
else if(m%2==0)
return false ;
else
{
int i ;
for(i=2 ; i<=sqrt(m) ; i++)
{
if(m%i==0)
return false ;
}
return true ;
}
}
};
int main()
{
int n ;
sc("%d",&n) ;
exam ob ;
bool t = ob.isPrime(n) ;
if(t)
pf("%d is Prime\n",n) ;
else
pf("%d in not Prime\n",n) ;
return 0;
}
No comments:
Post a Comment