HDU 1073 Online Judge
2015-07-29 13:15
441 查看
Online Judge
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 6186 Accepted Submission(s): 2318
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
Author
Ignatius.L
题目大意,给你输出和答案啊,问你错误类型
思路 字符串处理
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 6186 Accepted Submission(s): 2318
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
Author
Ignatius.L
题目大意,给你输出和答案啊,问你错误类型
思路 字符串处理
#include<iostream> #include<cstring> #include<cstdio> using namespace std; char s1[5050],s2[5050],c,s3[5050],s4[5050],s[5050]; char q1[10]={"START"},q2[10]={"END"};///判断是否开始输入和结束 int main() { int l1,l2,t,i,j; cin>>t; while(t--) { memset(s1,0,sizeof(s1)); memset(s2,0,sizeof(s2)); memset(s3,0,sizeof(s3)); memset(s4,0,sizeof(s4)); while(cin>>s&&strcmp(s,q1)); while(1){ memset(s,0,sizeof(s)); gets(s); if(strcmp(s,q2)==0){ break; } if(strlen(s)) strcat(s1,s); else strcat(s1,"\n"); } while(cin>>s&&strcmp(s,q1)); while(1){ memset(s,0,sizeof(s)); gets(s); if(strcmp(s,q2)==0){ break; } if(strlen(s)) strcat(s2,s); else strcat(s2,"\n"); } l1=strlen(s1); l2=strlen(s2); if(strcmp(s1,s2)==0){ cout<<"Accepted"<<endl; continue; } for(i=0,j=0;i<l1;i++){ if(s1[i]!=' '&&s1[i]!='\t'&&s1[i]!='\n') s3[j++]=s1[i]; } for(i=0,j=0;i<l2;i++){ if(s2[i]!=' '&&s2[i]!='\t'&&s2[i]!='\n') s4[j++]=s2[i]; } if(strcmp(s3,s4)) cout<<"Wrong Answer"<<endl; else cout<<"Presentation Error"<<endl; } return 0; }
相关文章推荐
- 目录
- [leetcode-30]Substring with Concatenation of All Words(java)
- 电源管理之——battery选型
- 第17周项目6 阅读文件,多文件
- 微软MSDN订阅用户已可提前手工下载Windows 10安装包
- VS中lib和dll
- 十大紧缺行业发布,近半工作机会在一线
- 视频显示分辨率标准大全
- 表、栈和队列
- Client访问控制和Cyrus sasl认证.doc
- RadGridView
- HDU 1029 Ignatius and the Princess IV
- 第一个mysql存储过程
- 数据结构(三):非线性逻辑结构-树
- 基于Html5的移动端(APP)开发框架的优缺点
- Java实现不同的类的属性之间相互赋值
- 字符识别OCR研究 字符识别,字符区域定位
- hdu 1009 FatMouse' Trade
- [CareerCup] 4.1 Balanced Binary Tree 平衡二叉树
- java基础知识整理