Stack = [] def push(num): Stack.append(int(num)) def pop(): if len(Stack) > 0: print(Stack.pop()) else: print(-1) def size(): print(len(Stack)) def empty(): if len(Stack) == 0: print(1) else: print(0) def top(): if len(Stack) > 0: print(Stack[len(Stack) - 1]) else: print(-1) TestCase = int(input()) while TestCase > 0: Command = input() if Command == 'top': top() elif Command == 'pop': pop() elif Command == 'empty': empty() elif Command == 'size': size() else: push(Command[5:]) TestCase -= 1
# include < iostream > # include < vector > using namespace std ; int main ( ) { vector < int > Stick ; Stick . push_back ( 64 ) ; int Target ; cin > > Target ; int Last = 0 ; while ( true ) { if ( Target = = 64 ) break ; int Sum = 0 ; for ( int i = 0 ; i < Stick . size ( ) ; i + + ) Sum + = Stick [ i ] ; if ( Target = = Sum ) break ; else if ( Target < Sum ) { Stick [ Last ] / = 2 ; Sum = 0 ; for ( int i = 0 ; i < Stick . size ( ) ; i + + ) Sum + = Stick [ i ] ; if ( Target < = Sum ) continue ; else Stick . push_back ( Stick [ Last + + ] ) ; } } cout < < Stick . size ( ) ; ...
댓글
댓글 쓰기