Description: The correctness of the stack operation Time Limit: 1000 ms | Memory of the implementation of a set of input sequences stack operation, determine whether the operation is correct. Input Each line is a test case that an action sequence. Operation sequence from the P and Q are two symbols, P said stack, Q expressed stack. Operation sequence length not exceeding 1000. Output for each action sequence, if the correct sequence of operation, that operation is just the end of the stack is empty, the output Y if the operation sequence of errors, such as the implementation of the stack when the stack space operation, or operation at the end of the stack is not empty, the output N.
To Search:
File list (Check if you may need any files):
栈操作的正确性oj.cpp
acm算法分析.rar
Download