#include <iostream> #include <vector> #include <string> #include <cmath> using namespace std; bool is_prime(long long n) { if(n%2==0 && n>2) return false; for(int i = 3; i <= sqrt(n); i+=2) { if(n%i == 0) { return false; } } return true; } bool split(string n) { for(int i = 1; i < n.size(); ++i) { //cout << i << endl; if(n[i] != '0') { long long f = stoll(n.substr(0, i)); long long s = stoll(n.substr(i, n.size() - i)); //cout << i << ": " << f << ", " << s << endl; if(is_prime(f) && is_prime(s)) { return true; } } } return false; } int main() { string n; cin >> n; cout << (split(n) ? "TAK" : "NIE") << endl; 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 | #include <iostream> #include <vector> #include <string> #include <cmath> using namespace std; bool is_prime(long long n) { if(n%2==0 && n>2) return false; for(int i = 3; i <= sqrt(n); i+=2) { if(n%i == 0) { return false; } } return true; } bool split(string n) { for(int i = 1; i < n.size(); ++i) { //cout << i << endl; if(n[i] != '0') { long long f = stoll(n.substr(0, i)); long long s = stoll(n.substr(i, n.size() - i)); //cout << i << ": " << f << ", " << s << endl; if(is_prime(f) && is_prime(s)) { return true; } } } return false; } int main() { string n; cin >> n; cout << (split(n) ? "TAK" : "NIE") << endl; return 0; } |