Masoud FCBتابع اعداد آیینه ای
int MirrorNum(int n)
{
m = (int)(log(n)/log(10))+1;
int[] x = new int[m];
for(int i = 0;i < m;i++)
{
x[i] = n%10;
n /= 10;
}
for(int i = 0;i < m/2;i++)
if(x[i] != x[m-i-1])
return 0; // No. n isn't mirror number
return 1; // Yes. n is mirror number
}
int IsPrime(int x)
{
if(x % 2 == 0) return 0;
int y = sqrt(x);
for (int i = 1;i < y / 2;i++)
if(x % (2*i+1) == 0)
return 0; // No prime number
return 1; // Prime number
}
int[] Primes(int n)
{
int[] p = new int[n];
int i = 0, x = 2;
while(i < n)
if(IsPrime(x))
p[i++] = x;
return p;
}
int main()
{
int x = 0;
scanf("Please enter an integer %d : ", &x);
if(MirrorNum(x) == 1)
printf("The entered number '%d' is mirrored number!\n", x);
else
printf("The entered number '%d' isn't mirrored number!\n", x);
int n = 0;
scanf("How many prime integers %d : ", &n);
int[] p = Primes(n);
for (int i = 0;i < n;i++)
printf("Prime[%d] = %d\n", i+1,p[i]);
return 0;
}
