Twisted Prime Number

Twisted Prime Number is a number which itself is a Prime Number and it’s reverse is also a Prime Number.

Example 1: 13. When reversed it is 31. Both of them are Prime Number. Hence it is a Twisted Prime Number.

Example 2: 19. When reversed it is 91. Here only 19 is a Prime Number but it’s reverse 91 is not a Prime Number since it is divisible by 7 and 13 also. Hence it is not a Twisted Prime Number.

C
#include <stdio.h>
int main() 
{
    int n=0,r=0,rev=0,nCopy=0,flag=0;
    printf("Enter a number: ");
    scanf("%d",&n);
    nCopy=n;
    while(n>0)
    {
        r=n%10;
        rev=(rev*10)+r;
        n=n/10;
    }
    n=nCopy;
    for(int i=1;i<=n;i++)
    {
        if(n%i==0)
        {
            flag++;
        }
    }
    if(flag==2)
    {
        flag=0;
        for(int i=1;i<=rev;i++)
        {
            if(rev%i==0)
            {
                flag++;
            }
        }
    }
    if(flag==2)
    {
        printf("%d is a Twisted Prime Number", n);
    }
    else
    {
        printf("%d is not a Twisted Prime Number", n);
    }
    return 0;
}
C