//No.227 簡単ポーカー #pragma GCC optimize("O3") #pragma GCC target("avx") #include #define rep(i ,n) for(int i=0;i<(int)(n);++i) #define repr(i ,n) for(int i=n;i>(int)(n);--i) #define rep1(i ,n) for(int i=1;i<=(int)(n);++i) #define ALL(a) a.begin(), a.end() #define RSORT(a) sort(ALL(a),greater<>()) #define SORT(a) sort(ALL(a)) #define bit_check(bit, i) ((bit>>(i)) & 1) #define PRINT(x) cout << (x) << endl; #define ENDL cout << endl; using namespace std; typedef long long int i64; typedef unsigned long long u64; template using V = vector; using VI = V; const int INF = 2e9; const i64 MOD = 1e9 + 7; template inline bool chmin(T& a, T b){if(a>b){a=b; return true;} return false;} template inline bool chmax(T& a, T b){if(a> card[i]; } VI table(13 + 1); rep( i , 5){ ++table[card[i]]; } int tmp; bool b = true; rep1( i , 13){ if ( b && table[i] >= 4 ) { cout << "NO HAND" << endl; b = false; } else if( b && table[i] == 3){ tmp = i; rep1( j , 13){ if( b && table[j] == 2 && j != tmp ) { cout << "FULL HOUSE" << endl; b = false; } else if (b && table[i] <= 1 ) continue; } if( b ) { cout << "THREE CARD" << endl; b = false; } } else if( b && table[i] == 2){ tmp = i; rep1( j , 13){ if( b && table[j] == 2 && j != tmp ) { cout << "TWO PAIR" << endl; b = false; } else if( b && table[j] == 3 ) { cout << "FULL HOUSE" << endl; b = false; } else if( table[j] <= 1 ) continue; } if ( b ) { cout << "ONE PAIR" << endl; b = false;} } else continue; } if (b) cout << "NO HAND" << endl; }