#include<initializer_list> #include<iostream> #include<queue> #include<list> #include<stdio.h> #include<vector> #include<map> #include<set> #include <cstdlib> using namespace std; #define ull long long int #define ll long long #define FOR(i, n) for(int i=0;i<n;++i) #define FORI(f, i, n) for(int i=(f);i<(n);++i) #define FORD(i, n) for(int i=(n)-1;i>=0;--i) #define znakow 26 #define dcout 1 && cout int inline min(int a, int b) { return a > b ? b : a; } int inline max(int a, int b) { return a < b ? b : a; } int main() { ios::sync_with_stdio(false); int n, m; cin >> n; cin >> m; if(n<=m){ cout<<"TAK\n"; }else{ if(n%2==1){ cout<<"TAK\n"; }else{ cout<<"NIE\n"; } } }
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 | #include<initializer_list> #include<iostream> #include<queue> #include<list> #include<stdio.h> #include<vector> #include<map> #include<set> #include <cstdlib> using namespace std; #define ull long long int #define ll long long #define FOR(i, n) for(int i=0;i<n;++i) #define FORI(f, i, n) for(int i=(f);i<(n);++i) #define FORD(i, n) for(int i=(n)-1;i>=0;--i) #define znakow 26 #define dcout 1 && cout int inline min(int a, int b) { return a > b ? b : a; } int inline max(int a, int b) { return a < b ? b : a; } int main() { ios::sync_with_stdio(false); int n, m; cin >> n; cin >> m; if(n<=m){ cout<<"TAK\n"; }else{ if(n%2==1){ cout<<"TAK\n"; }else{ cout<<"NIE\n"; } } } |