#include <iostream> #include <vector> #include <utility> using namespace std; int main() { int TestCase; cin >> TestCase; while (TestCase--) { int Stick, Ant; cin >> Stick >> Ant; vector<pair<int, int>> Ants; for (int i = 0; i < Ant; i++) { int t; cin >> t; pair<int, int> Temp = make_pair(t, t); Temp.first = (Temp.first - 0); Temp.second = (Stick - Temp.second); if (Temp.first >= Temp.second) { int swap = Temp.first; Temp.first = Temp.second; Temp.second = swap; } Ants.push_back(Temp); } int Least = Ants[0].first; int Most = Ants[0].second; for (int i = 0; i < Ant; i++) { if(Least <= Ants[i].first) Least = Ants[i].first; if (Most <= Ants[i].second) Most = Ants[i].second; } cout << Least << " "<< Most << 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 ...
댓글
댓글 쓰기