// mrozik[@]gmail #include <cstdio> #include <algorithm> #include <vector> #include <string> using namespace std; vector<string> oioio { "1A", "1B", "1C", "2A", "2B", "2C", "3A", "3B", "3C", "4A", "4B", "4C", "5A", "5B", "5C", "5A", "5B", "5C", }; int main() { sort(oioio.begin(), oioio.end()); int N; scanf("%d", &N); vector<string> pomy; while (N--) { char s[3]; scanf("%s", s); pomy.push_back(s); } sort(pomy.begin(), pomy.end()); includes(pomy.begin(), pomy.end(), oioio.begin(), oioio.end()) ? printf("TAK\n") : 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 | // mrozik[@]gmail #include <cstdio> #include <algorithm> #include <vector> #include <string> using namespace std; vector<string> oioio { "1A", "1B", "1C", "2A", "2B", "2C", "3A", "3B", "3C", "4A", "4B", "4C", "5A", "5B", "5C", "5A", "5B", "5C", }; int main() { sort(oioio.begin(), oioio.end()); int N; scanf("%d", &N); vector<string> pomy; while (N--) { char s[3]; scanf("%s", s); pomy.push_back(s); } sort(pomy.begin(), pomy.end()); includes(pomy.begin(), pomy.end(), oioio.begin(), oioio.end()) ? printf("TAK\n") : printf("NIE\n"); return 0; } |