题解 | #素数回文#

#include <stdio.h>
#include<math.h>
long long turn_number(long long t);
int is_prime(long long n);
int main()
 {  
    long long t = 0,turn = 0;
    scanf("%lld",&t);
    turn =turn_number(t);
    //生成回文数
    // printf("%lld",turn);
    if(is_prime(turn))
    {
        printf("prime\n");
    }
    else {
        printf("noprime\n");
        
    }
    //判断素数

    return 0;
}
long long turn_number(long long t)
{
    long long turn = t,tem = t/10;
    while(tem>0)
    {
        turn *=10;
        turn +=tem%10;
        tem /=10;
    }
    return turn;
}
int is_prime(long long n)
{
    int i = 2, j= 0;
    int exit = 1;
    for(i=2;i<sqrt(n);i++)
    {
        if(0 == n%i)
        {
            exit = 0;
            break;
        }
    }
    return exit;
}