#include <iostream> using namespace std; int main() { int Alphabet[26] = { 0, }; char Input[1000001]; cin >> Input; for (int i = 0; Input[i] != NULL; i++) { if (Input[i] >= 'a') Alphabet[(int)(Input[i] - 'a')]++; else if (Input[i] >= 'A') Alphabet[(int)(Input[i] - 'A')]++; else continue; } int Most = 0; for (int i = 0; i < 2; i++) { for (int j = 0; j < 26; j++) { if (Most == j) continue; else if (Alphabet[Most] <= Alphabet[j]) { Most = j; if (i > 0) { Most = -1; break; } } } } if (Most == -1) cout << "?" << endl; else cout << (char)(Most+'A') << endl; }
# include < iostream > # include < vector > using namespace std ; int Num_of_Divisor ( int n ) { int Count = 0 ; for ( int i = 1 ; i < = n ; i + + ) if ( n % i = = 0 ) Count + + ; return Count ; } int main ( ) { int Testcase ; cin > > Testcase ; while ( Testcase - - ) { int Rooms ; cin > > Rooms ; vector < int > Prisons ; for ( int i = 0 ; i < Rooms ; i + + ) Prisons . push_back ( 0 ) ; for ( int i = 1 ; i < Prisons . size ( ) + 1 ; i + + ) { if ( ( Num_of_Divisor ( i ) % 2 ) = = 0 ) Prisons [ i - 1 ] = 0 ; else Prisons [ i - 1 ] = 1 ; } int Fleer = 0 ; for ( int i = 0 ; i < Prisons . size ( ) ; i + + ) if ( Prisons ...
댓글
댓글 쓰기