Hdu1073 online judge

Online judgetime limit: 2000/1000 MS (Java/others) memory limit: 65536/32768 K (Java/Others) Total submission (s): 5373 accepted submission (s): 2054

Problem descriptionignatius is building an online judge, now he has worked out all the problems handle t 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 shoshould 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.

Inputthe 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.

Outputfor each test cases, you shocould output the result judge system shocould return.

Sample Input

4START1 + 2 = 3ENDSTART1+2=3ENDSTART1 + 2 = 3ENDSTART1 + 2 = 3ENDSTART1 + 2 = 3ENDSTART1 + 2 = 4ENDSTART1 + 2 = 3ENDSTART1+2=3END

Sample output

Presentation ErrorPresentation ErrorWrong AnswerPresentation Error

Authorignatius. L

#include <stdio.h>#include <string.h>#define maxn 5010char str0[maxn], str1[maxn], buf[maxn];bool isKong(char ch) {return ch == ' ' || ch == '\n' || ch == '\t';}int main() {//freopen("stdin.txt", "r", stdin);int t, mode, id0, id1, i, j;bool PE, WA;scanf("%d", &t);while(t--) {mode = id1 = id0 = 0;PE = WA = false;while(gets(buf)) {if(!strcmp(buf, "START"))continue;else if(!strcmp(buf, "END")) {if(++mode == 2) break;else continue;}if(0 == mode) {for(i = 0; buf[i]; ++i)str0[id0++] = buf[i];str0[id0++] = '\n';str0[id0] = '\0';} else {for(i = 0; buf[i]; ++i)str1[id1++] = buf[i];str1[id1++] = '\n';str1[id1] = '\0';}}if(id0 != id1) PE = true;for(i = j = 0; i < id0 && j < id1; ) {bool flag = 0;if(str0[i] != str1[j] && !PE)PE = true;if(isKong(str0[i])) {++i; flag = 1;}if(isKong(str1[j])) {++j; flag = 1;}if(flag) continue;if(str0[i++] != str1[j++]) {if(t == 1) printf("%c%c\n", str0[i-1]);WA = true; break;}}if(WA) {printf("Wrong Answer\n");continue;} while(i < id0) {PE = true;if(isKong(str0[i++]))continue;WA = true; break;}while(j < id1) {PE = true;if(isKong(str1[j++]))continue;WA = true; break;}if(WA) {printf("Wrong Answer\n");continue;} else if(PE) {printf("Presentation Error\n");continue;}printf("Accepted\n");}return 0;}

Hdu1073 online judge