首页 > ACM题库 > HDU-杭电 > HDU 1073 Online Judge-字符串-[解题报告] C++
2013
11-26

HDU 1073 Online Judge-字符串-[解题报告] C++

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.

样例输入:

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

样例输出:

Presentation Error
Presentation Error
Wrong Answer
Presentation Error

题目链接:Click
here~~

题意:

很有意思的一道题,给你两个文件,判断是AC还是PE还是WA。

解题思路:

只需要判断两个文件中不同的地方是不是都是空格或者换行或者\t就好了。其他的是一些细节问题,比如数据的输入,换行的处理。

主要练习下字符串的处理~O(∩_∩)O~。

#include <stdio.h>
#include <string.h>
char str[5010];
void Ready()
{
	while(gets(str),strcmp(str,"START"));
}
void Deal(char* c)
{
	while(gets(str),strcmp(str,"END"))
	{
		if(str[0]=='\0')
			strcat(c," ");
		else
			strcat(c,str);
	}
}
int main()
{
	int z,i,j,Li,Lj;
	bool PE,WA;
	char ac[5010],my[5010];
	scanf("%d",&z);
	while(z--)
	{
		PE = WA = false;
		ac[0] = my[0] = '\0';
		Ready();
		Deal(ac);
		Ready();
		Deal(my);
		i = j = 0;
		Li = strlen(ac);
		Lj = strlen(my);
		while(i<Li || j<Lj)
		{
			if(ac[i] == my[j])
			{
				i ++;j ++;
				continue;
			}
			PE = true;
			if(ac[i]==' ' || ac[i]=='\t')
			{
				i ++;
				continue;
			}
			if(my[j]==' ' || my[j]=='\t')
			{
				j ++;
				continue;
			}
			WA = true;
			break;
		}
		puts(WA?"Wrong Answer":(PE?"Presentation Error":"Accepted"));
	}
	return 0;
}