Daffodil International University
Problem Link
//Please follow from main function
#include<bits/stdc++.h>
using namespace std;
/// Typedef
typedef long long int ll;
//Int data type
#define sc1(a) scanf("%d", &a)
#define sc2(a, b) scanf("%d %d", &a, &b)
#define sc3(a, b, c) scanf("%d %d %d", &a, &b, &c)
#define sc4(a, b, c, d) scanf("%d %d %d %d", &a, &b, &c, &d)
//Long Data type
#define scl1(a) scanf("%lld", &a)
#define scl2(a, b) scanf("%lld %lld", &a, &b)
#define scl3(a, b, c) scanf("%lld %lld %lld", &a, &b, &c)
#define scl4(a, b, c, d) scanf("%lld %lld %lld %lld", &a, &b, &c, &d)
bool prime(ll n)
{
if(n<2)
return false;
for(ll i=2; i*i<=n; i++)
if(n%i==0)
return false;
return true;
}
ll rev(ll n)
{
ll b=0;
while(n!=0){
b = b*10 + n%10;
n/=10;
}
return b;
}
int main()
{
ll aa,bb,a,n,m,b=0,i=0,j,dk,ck=0;
while(scl1(n)==1){
if(prime(n)==false)
printf("%lld is not prime.\n", n);
else{
if(prime(rev(n))==true && rev(n)!=n)
printf("%lld is emirp.\n", n);
else
printf("%lld is prime.\n", n);
}
}
}
0 Comments