#include <bits/stdc++.h> using namespace std; typedef vector<int> VI; typedef long long LL; typedef pair<int,int> PI; typedef pair<LL,LL> PLL; typedef unsigned long long ULL; #define IOSWORK ios::sync_with_stdio(0); cin.tie(0) #define FOR(x, b, e) for(int x = b; x<= (e); x++) #define FORD(x, b, e) for(int x = b; x>= (e); x--) #define REP(x, n) for(int x = 0; x<(n); ++x) #define ALL(c) (c).begin(), (c).end() #define SIZE(x) ((int)(x).size()) #define VAR(v, n) typeof(n) v = (n) #define FOREACH(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i) #define SCAN_INT(n) scanf("%i",&n) #define SCAN_P_INT(n,m) scanf("%i %i",&n,&m) #define PRINT_P_INT(n,m) printf("%i %i\n",n,m); #define PRINT_INT(n) printf("%i\n",n) #define PB push_back #define IN insert #define ST first #define ND second #define INF 1000000007 #define MAXSIZE LL n; LL liczba_cyfr(LL p){ LL d = 1; while(p){ p/=10; d*=10; } return d/10; } bool czy_pierwsza(LL p){ if(p==1) return false; if(p<4) return true; if(p%2==0) return false; if(p<9) return true; if(p%3==0) return false; LL r = floor(sqrt(p)); LL f=5; while(f<=r){ if(p%f==0) return false; if(p%(f+2)==0) return false; f+=6; } return true; } int main(){ scanf("%lld",&n); LL catched = liczba_cyfr(n); bool mozna = false; for(LL p =10;p<=catched;p*=10){ if((n/(p/10))%10!=0){ LL t1=n%p; LL t2=n/p; if(czy_pierwsza(t1)&&czy_pierwsza(t2)){ mozna = true; } } } if(mozna) printf("TAK\n"); else printf("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 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 | #include <bits/stdc++.h> using namespace std; typedef vector<int> VI; typedef long long LL; typedef pair<int,int> PI; typedef pair<LL,LL> PLL; typedef unsigned long long ULL; #define IOSWORK ios::sync_with_stdio(0); cin.tie(0) #define FOR(x, b, e) for(int x = b; x<= (e); x++) #define FORD(x, b, e) for(int x = b; x>= (e); x--) #define REP(x, n) for(int x = 0; x<(n); ++x) #define ALL(c) (c).begin(), (c).end() #define SIZE(x) ((int)(x).size()) #define VAR(v, n) typeof(n) v = (n) #define FOREACH(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i) #define SCAN_INT(n) scanf("%i",&n) #define SCAN_P_INT(n,m) scanf("%i %i",&n,&m) #define PRINT_P_INT(n,m) printf("%i %i\n",n,m); #define PRINT_INT(n) printf("%i\n",n) #define PB push_back #define IN insert #define ST first #define ND second #define INF 1000000007 #define MAXSIZE LL n; LL liczba_cyfr(LL p){ LL d = 1; while(p){ p/=10; d*=10; } return d/10; } bool czy_pierwsza(LL p){ if(p==1) return false; if(p<4) return true; if(p%2==0) return false; if(p<9) return true; if(p%3==0) return false; LL r = floor(sqrt(p)); LL f=5; while(f<=r){ if(p%f==0) return false; if(p%(f+2)==0) return false; f+=6; } return true; } int main(){ scanf("%lld",&n); LL catched = liczba_cyfr(n); bool mozna = false; for(LL p =10;p<=catched;p*=10){ if((n/(p/10))%10!=0){ LL t1=n%p; LL t2=n/p; if(czy_pierwsza(t1)&&czy_pierwsza(t2)){ mozna = true; } } } if(mozna) printf("TAK\n"); else printf("NIE\n"); return 0; } |