#include<cstdio> typedef long long i64; bool is_prime(i64 n){ for(i64 i=2;i*i<=n;i++) { if(n % i == 0)return false; } return true; } bool is_secondary(i64 n) { i64 a = n, b = 0, m = 1, d; while(a > 0) { d = a%10; b += m*d; m *= 10; a /= 10; if(a == 0 || d == 0) continue; if(is_prime(a) && is_prime(b)) return true; } return false; } int main() { i64 n; scanf("%lld", &n); printf("%s\n", is_secondary(n) ? "TAK" : "NIE"); return 0; }
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 | #include<cstdio> typedef long long i64; bool is_prime(i64 n){ for(i64 i=2;i*i<=n;i++) { if(n % i == 0)return false; } return true; } bool is_secondary(i64 n) { i64 a = n, b = 0, m = 1, d; while(a > 0) { d = a%10; b += m*d; m *= 10; a /= 10; if(a == 0 || d == 0) continue; if(is_prime(a) && is_prime(b)) return true; } return false; } int main() { i64 n; scanf("%lld", &n); printf("%s\n", is_secondary(n) ? "TAK" : "NIE"); return 0; } |