#include<bits/stdc++.h>
using namespace std;
const int N = ((int)(1e6))+50;
int n;
int sums[10][6];
int main(){
ios_base::sync_with_stdio( 0 ); cin.tie( 0 ); cout.tie( 0 );
cin>>n;
string t;
for (int i = 0; i < n; i++){
cin>>t;
int round = int(t[0]) - int('0');
int div = int(t[1]) - int('A');
sums[round][div]++;
}
for (int i = 1; i <= 4; i++){
for (int j = 0; j < 3; j++){
if(sums[i][j] == 0){
cout<<"NIE";
return 0;
}
}
}
if((sums[5][0] >= 2)&&(sums[5][1] >= 2)&&(sums[5][2] >= 2)) cout<<"TAK";
else cout<<"NIE";
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 | #include<bits/stdc++.h> using namespace std; const int N = ((int)(1e6))+50; int n; int sums[10][6]; int main(){ ios_base::sync_with_stdio( 0 ); cin.tie( 0 ); cout.tie( 0 ); cin>>n; string t; for (int i = 0; i < n; i++){ cin>>t; int round = int(t[0]) - int('0'); int div = int(t[1]) - int('A'); sums[round][div]++; } for (int i = 1; i <= 4; i++){ for (int j = 0; j < 3; j++){ if(sums[i][j] == 0){ cout<<"NIE"; return 0; } } } if((sums[5][0] >= 2)&&(sums[5][1] >= 2)&&(sums[5][2] >= 2)) cout<<"TAK"; else cout<<"NIE"; return 0; } |
English