hdu 1073 字符串函数的应用

题目来源：

http://acm.hdu.edu.cn/showproblem.php?pid=1073

Online Judge

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

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(' '), or enters(' '), 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

 

 代码如下：

#include<iostream>
#include<stdio.h>
#include<string>
#include<string.h>
#include<map>
#include<math.h>
#include<algorithm>
#define N 5020
using namespace std;
void input(char *s)
{
    char tmp[N];
    while(gets(tmp) && strcmp(tmp,"END"))
    {
        if(strlen(tmp)) strcat(s,tmp);
        strcat(s,"
");
    }
}
void Delchar(char *s,int len)
{
    char tmp[N];
    int t=0;
    for(int i=0;i<len;i++)
    {
        if(s[i]!= ' ' && s[i]!= '	' && s[i] != '
')
            tmp[t++]=s[i];
    }
    tmp[t]= '';
    strcpy(s,tmp);
}
int main()
{
    int t;
    scanf("%d",&t);
    getchar();      //不能少  ，获得 输入的数字后的 回车
    while(t--)
    {
        char str1[N];
        char str2[N];
        memset(str1,0,sizeof(str1));
        memset(str2,0,sizeof(str2));
        int len1,len2;
        input(str1);
        input(str2);
        len1=strlen(str1);
        len2=strlen(str2);
        if(len1 == len2 && !strcmp(str1, str2)){
            printf("Accepted
");
            continue;
        }
        Delchar(str1,len1);
        Delchar(str2,len2);
        if(!strcmp(str1,str2))
            puts("Presentation Error");
        else
            puts("Wrong Answer");

    }

    return 0 ;
}