摘要： c++string sum(string s1,string s2) { if(s1.length()=0;i--,j--) { s1[i]=char(s1[i]+(j>=0?s2[j]-'0':0)); if(s1[i]-'0'>=10) { s1[i]=char((s1[i]-'0')%10+'0'... 阅读全文

摘要： 2016湖南省赛 G - Parenthesis （括号匹配） Bobo has a balanced parenthesis sequence P=p 1 p 2…p n of length n and q questions. The i-th question is whether P rem 阅读全文