#include <iostream> using namespace std; int main() { int Men[9]; int Sum = 0; for (int i = 0; i < 9; i++) { cin >> Men[i]; Sum += Men[i]; } for (int i = 0; i < 9; i++) { for (int j = 0; j < 9; j++) { if (i != j) { if (Sum - Men[i] - Men[j] == 100) { Men[i] = -1; Men[j] = -1; } } } } for (int i = 0; i < 9; i++) { int least = i; for (int j = i + 1; j < 9; j++) { if (Men[least] > Men[j]) least = j; } int Temp = Men[i]; Men[i] = Men[least]; Men[least] = Temp; } for (int i = 0; i < 9; i++) { if (Men[i] != -1) cout << Men[i] << 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 ...
댓글
댓글 쓰기