#include<stdio.h>
#include<math.h>
int isprime (long int x);
int rev(unsigned int n);
int main()
{
long int n;
while(scanf("%ld",&n)==1 )
{
if (isprime(n)!=1)
printf ("%ld is not prime.\n", n);
else
{
int n1=rev(n);
if ( isprime(n1)==1 && n1!=n )
printf ("%ld is emirp.\n",n);
else
printf ("%ld is prime.\n",n);
}
}
return 0;
}
int isprime (long int x)
{
int i;
for ( i = 2; i * i <= x; i++)
{
if (x % i == 0)
return 0;
}
return 1;
}
int rev(unsigned int n)
{
unsigned int r = 0;
do
r = r * 10 + n % 10;
while ((n /= 10) > 0);
return r;
}
#include<math.h>
int isprime (long int x);
int rev(unsigned int n);
int main()
{
long int n;
while(scanf("%ld",&n)==1 )
{
if (isprime(n)!=1)
printf ("%ld is not prime.\n", n);
else
{
int n1=rev(n);
if ( isprime(n1)==1 && n1!=n )
printf ("%ld is emirp.\n",n);
else
printf ("%ld is prime.\n",n);
}
}
return 0;
}
int isprime (long int x)
{
int i;
for ( i = 2; i * i <= x; i++)
{
if (x % i == 0)
return 0;
}
return 1;
}
int rev(unsigned int n)
{
unsigned int r = 0;
do
r = r * 10 + n % 10;
while ((n /= 10) > 0);
return r;
}
No comments:
Post a Comment