Brust Link

POJ-1004 Financial ManagementDescription Larry graduated this year and finally has a job. He’s making a lot of money, but somehow never seems to have enough. Larry has decided that he needs to grab

#include int main () { int a; while (scanf("%d",&a)!=EOF) { switch (a/10) { case 0:if (a!=0)   {    printf("Score is error!\n");    break;   }   case 1: case 2: case 3: case 4: case 5

括号配对问题描述 现在，有一行括号序列，请你检查这行括号是否配对。 输入 第一行输入一个数N（0<N<=100）（0<N<=100）,表示有N组测试数据。后面的N行输入多组输入数据，每组输入数据都是一个字符串S(S的长度小于10000，且S不是空串），测试数据组数少于5组。数据保证S中只含有”[“,”]”,”(“,”)”四种字符 输出 每组输入数据的输出占一行，如果该字符串中所含的括号是