奋斗青年的专栏

Generalized Matrioshkas Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 1816   Accepted: 528 Description Vladimir worked for years making matrioshkas, thos

#include using namespace std; struct num_strT{ int num; char s; bool status;//status ==0 represent s, else num; }; class screenC{ //用于接受后缀表达式 public: int total,status; num

左括号入栈，右括号就

#include #include #include using namespace std; struct num_strT { //0代表数字 1 代表字符 bool flag; int num; char str; }; class stack1 { public: char wait[1005]; int count;

Parentheses Balance  You are given a string consisting of parentheses () and []. A string of this type is said to be correct: (a)if it is the empty string(b)if A and B are correct, AB is c