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 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include //UWAGA - w czasie kompilacji musi byc znany rozmiar wektora - nie mozna go zmienic #include #include //do setprecision #include #include using namespace std; #define FOR(i,b,e) for(int i=(b);i<(e);++i) #define FORQ(i,b,e) for(int i=(b);i<=(e);++i) #define FORD(i,b,e) for(int i=(b)-1;i>=(e);--i) #define REP(x, n) for(int x = 0; x < (n); ++x) #define ALL(u) (u).begin(),(u).end() #define ST first #define ND second #define PB push_back #define MP make_pair #define LL long long #define ULL unsigned LL #define LD long double typedef pair PII; const double pi = 3.141592653589793238462643383279502884197169399375105820974944592307816406286208998628034825342; const int MR = 3162300; bool notPrime[MR]; int primes[MR], ilep; bool isPrime(LL x) { if (x < 2) return 0; int end = sqrt(x); REP(i, ilep) { if (primes[i] > end) break; if (x % primes[i] == 0) return 0; } return 1; } int main() { notPrime[0] = notPrime[1] = 1; int end = sqrt(MR); for (int i = 2; i <= end; i++) if (!notPrime[i]) for (int j = i*i; j < MR; j += i) notPrime[j] = 1; FOR(i, 2, MR) if (!notPrime[i]) primes[ilep++] = i; LL n; scanf("%lld", &n); LL l1 = n, l2 = 0, mn = 1; while (l1) { while (l1 && l1 % 10 == 0) { l1 /= 10; mn *= 10; } l2 += mn*(l1 % 10); l1 /= 10; mn *= 10; if (!l1) break; if (isPrime(l1) && isPrime(l2)) { printf("TAK\n"); return 0; } } printf("NIE\n"); return 0; }