wyjwyl的专栏

#include #include int main() { int n,i,j,k,l,p[100];//在哪定义都一样，  char m[100],s1[100],s2[100]; while(scanf("%d",&n)!=EOF) { scanf("%s%s",s1,s2); memset(p,0,sizeof(p)); //int i,j,k,l; k=i=l=-1

前缀式计算 时间限制：1000 ms  |  内存限制：65535 KB 难度：3 描述 先说明一下什么是中缀式： 如2+(3+4)*5这种我们最常见的式子就是中缀式。 而把中缀式按运算顺序加上括号就是：(2+((3+4)*5)) 然后把运算符写到括号前面就是+(2 *( +(3 4) 5) ) 把括号去掉就是：+ 2 * + 3 4 5

中缀式变后缀式 时间限制：1000 ms  |  内存限制：65535 KB 难度：3 描述人们的日常习惯是把算术表达式写成中缀式，但对于机器来说更“习惯于”后缀式，关于算术表达式的中缀式和后缀式的论述一般的数据结构书都有相关内容可供参看，这里不再赘述，现在你的任务是将中缀式变为后缀式。 输入第一行输入一个整数n，共有n组测试数据（n 每组测试数据只有一行，是

表达式求值 时间限制：3000 ms  |  内存限制：65535 KB 难度：4 描述ACM队的mdd想做一个计算器，但是，他要做的不仅仅是一计算一个A+B的计算器，他想实现随便输入一个表达式都能求出它的值的计算器，现在请你帮助他来实现这个计算器吧。 比如输入：“1+2/4=”，程序就输出1.50（结果保留两位小数） 输入第一行输入一个整数n，共有n组测试数

B. Beautiful Paintings time limit per test 1 second memory limit per test 256 megabytes input standard input output standard output There are n pictures delivered for th

Assignment Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 2894    Accepted Submission(s): 1350 Problem Description Tom owns a comp

Bad Hair Day Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 15952   Accepted: 5387 Description Some of Farmer John's N cows (1 ≤ N ≤ 80,000) are having a ba

Obstacle Course Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 269    Accepted Submission(s): 164 Problem Description You are work

Rescue Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 20846    Accepted Submission(s): 7446 Problem Description Angel was caught by the

Knight Moves Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 8349    Accepted Submission(s): 4910 Problem Description A friend of you is

Fence Repair Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 32257   Accepted: 10372 Description Farmer John wants to repair a small length of the fence arou

Windows Message Queue Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 4461    Accepted Submission(s): 1777 Problem Description Message qu

Stones Time Limit: 5000/3000 MS (Java/Others)    Memory Limit: 65535/32768 K (Java/Others) Total Submission(s): 1396    Accepted Submission(s): 873 Problem Description Because of the wrong statu

The kth great number Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65768/65768 K (Java/Others) Total Submission(s): 8343    Accepted Submission(s): 3292 Problem Description Xiao Ming a

看病要排队 Time Limit: 3000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 6012    Accepted Submission(s): 2474 Problem Description 看病要排队这个是地球人都知道的常识。 不过经过细心

括号配对问题 时间限制：3000 ms  |  内存限制：65535 KB 难度：3 描述 现在，有一行括号序列，请你检查这行括号是否配对。 输入第一行输入一个数N（0输出每组输入数据的输出占一行，如果该字符串中所含的括号是配对的，则输出Yes,如果不配对则输出No样例输入 3 [(]) (]) ([[]()]) 样例输出 No No Yes 嗯，

I’m out of stories. For years I’ve been writing stories, some rather silly, just to make simple problems look difficult and complex problems look easy. But, alas, not for this one. You’re given a non

Queueing at Bank (25)Suppose a bank has K windows open for service. There is a yellow line in front of the windows which devides the waiting area into two parts. All the customers have to wait in line