#include <bits/stdc++.h> using namespace std; bool prime(long long w) { if (w == 1) return false; for (int i = 2; (long long)i * i <= w; i++) { if (w % i == 0) return false; } return true; } bool good(string s) { for (int i = 0; i < s.size() - 1; i++) { if (s[i + 1] == '0') continue; long long val1 = 0; long long val2 = 0; for (int j = 0; j <= i; j++) { val1 = 10 * val1 + s[j] - '0'; } for (int j = i + 1; j < s.size(); j++) { val2 = 10 * val2 + s[j] - '0'; } if (prime(val1) && prime(val2)) return true; } return false; } int main() { string s; cin >> s; if (good(s)) { cout << "TAK\n"; } else { cout << "NIE\n"; } 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 34 35 36 37 38 39 40 41 | #include <bits/stdc++.h> using namespace std; bool prime(long long w) { if (w == 1) return false; for (int i = 2; (long long)i * i <= w; i++) { if (w % i == 0) return false; } return true; } bool good(string s) { for (int i = 0; i < s.size() - 1; i++) { if (s[i + 1] == '0') continue; long long val1 = 0; long long val2 = 0; for (int j = 0; j <= i; j++) { val1 = 10 * val1 + s[j] - '0'; } for (int j = i + 1; j < s.size(); j++) { val2 = 10 * val2 + s[j] - '0'; } if (prime(val1) && prime(val2)) return true; } return false; } int main() { string s; cin >> s; if (good(s)) { cout << "TAK\n"; } else { cout << "NIE\n"; } return 0; } |