HDU - 1073 Online Judge

HDU-1073 Online Judge

问题描述：

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.

输入说明：

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.

输出说明：

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

思路：

题意就是让我们去写一个oj的判断，判断是AC还是WA还是PE，主要需要处理的东西是输入和比较。输入比较特殊，无论标准的还是需要进行比较的，都有START和END作为起始标志和终止标志，可以使用strcmp函数进行比较，判断什么时候是一组输入的结束，由于一行中有空格的存在，所以输入时用gets或者getline直接读入一整行，进行比较时，AC最简单，直接strcmp函数比较，如果返回0，表明一模一样，PE和WA的区别在于WA在换行前的最后一个字符与正确的不一致，可以利用这一点进行判断。

AC代码：

#include <bits/stdc++.h>
using namespace std;
char ch[2][10000],s[10000];
int main()
{
    
    
	int i,j,k,t,len;
	cin>>t;
	getchar();
	while(t--)
	{
    
    
		for(i=0;i<2;++i)
		{
    
    
			strcpy(ch[i],""/**/);
			gets(s)；
			while(strcmp(s,"START")!=0)
			{
    
    
				gets(s);
			}
			gets(s);
			while(strcmp(s,"END")!=0)
			{
    
    
				strcat(ch[i],s);
				strcat(ch[i],"\n");
				gets(s);
			}
		}

		if(strcmp(ch[0],ch[1])==0)
            cout<<"Accepted"<<endl;

		else
		{
    
    

			for(i=0;i<2;++i)
			{
    
    
				k=0;
				len=strlen(ch[i]);
				for(j=0;j<len;++j)
				{
    
    
					if(ch[i][j]==' '||ch[i][j]=='\t'||ch[i][j]=='\n')
					{
    
    
						continue;
					}
					ch[i][k++]=ch[i][j];
				}
				ch[i][k]='\0';
			}
			if(strcmp(ch[0],ch[1])==0)
				cout<<"Presentation Error"<<endl;
			else
				cout<<"Wrong Answer"<<endl;
		}
	}
	return 0;
}