设为首页 加入收藏

TOP

HDU 1073 Online Judge
2015-11-21 02:06:43 来源: 作者: 【 】 浏览:8
Tags:HDU 1073 Online Judge

Online Judge

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 4977 Accepted Submission(s): 1889


Problem Description Ignatius is building an Online Judge, now he has worked out all the problems except the Judge System. The system has to read data from correct output file and user's result file, then the system compare the two files. If the two files are absolutly same, then the Judge System return "Accepted", else if the only differences between the two files are spaces(' '), tabs('\t'), or enters('\n'), the Judge System should return "Presentation Error", else the system will return "Wrong Answer".

Given the data of correct output file and the data of user's result file, your task is to determine which result the Judge System will return.

Input The input contains several test cases. The first line of the input is a single integer T which is the number of test cases. T test cases follow.
Each test case has two parts, the data of correct output file and the data of the user's result file. Both of them are starts with a single line contains a string "START" and end with a single line contains a string "END", these two strings are not the data. In other words, the data is between the two strings. The data will at most 5000 characters.

Output For each test cases, you should output the the result Judge System should return.

Sample Input
4
START
1 + 2 = 3
END
START
1+2=3
END
START
1 + 2 = 3
END
START
1 + 2 = 3

END
START
1 + 2 = 3
END
START
1 + 2 = 4
END
START
1 + 2 = 3
END
START
1	+	2	=	3
END

Sample Output
Presentation Error
Presentation Error
Wrong Answer
Presentation Error

题意:代码在线评测,返回三种结果,ac,pe,wa。 很水的字符串处理,1A。


#include 
  
   
#include 
   
     #include 
    
      #include 
     
       #include 
      
        using namespace std; string src, dest, start, end; char sa[5001], sb[5001]; void readContent(string &s){ s.clear(); string ts; while (getline(cin, ts)){ if (ts != "END"){ s += ts; s += "\n"; } else{ break; } } } void judge(const string &src, const string &dest, bool &af, bool &pf, bool &wf){ af = pf = wf = false; if (src == dest){ af = true; return; } pf = true; int pos = 0; for (int i = 0; i < src.length(); ++i){ if (!isspace(src[i])){ sa[pos++] = src[i]; } } sa[pos] = 0; pos = 0; for (int i = 0; i < dest.length(); ++i){ if (!isspace(dest[i])){ sb[pos++] = dest[i]; } } sb[pos] = 0; if (strcmp(sa, sb) != 0){ wf = true; } } int main(){ int t; bool af, pf, wf; cin >> t; while (t--){ cin >> start; readContent(src); cin >> start; readContent(dest); judge(src, dest, af, pf, wf); if (af){ cout << "Accepted" << endl; } else if (wf){ cout << "Wrong Answer" << endl; } else{ cout << "Presentation Error" << endl; } } return 0; }
      
     
    
   
  



】【打印繁体】【投稿】【收藏】 【推荐】【举报】【评论】 【关闭】 【返回顶部
分享到: 
上一篇设计模式C++实现――装饰者模式 下一篇[编程之美] 2.14 求数组的子数组..

评论

帐  号: 密码: (新用户注册)
验 证 码:
表  情:
内  容: