小编yip*_*ing的帖子

#include <stdio.h>
#include <math.h>
int prime (long n);
long reverse(long n);
int main(void)
{
    long n;
    long i, j;
    puts("Enter n dight number, and we will help you find symmetrical prime number");
    scanf("%ld", &n);
    for (i = 11; i < (pow(10, n) - 1); i+= 2)
    {
        if (prime(i))
        {
            j = reverse(i);
            if (i == j)
            {
                printf("%ld\n", i);
            }
        }        
    }
}

int prime (long n) //estimate whether the number n is primer number
{
    int status = …