• HDU 1073 Online Judge (字符串处理)


    题目链接

    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

    分析:
    首先是对于数据的输入部分,只能够用gets()来一行一行的读入,不能用scanf(),也不能一个字符一个字符的读入(scanf()是因为遇到空格就自动结束了,最后字符串中间的空格都没有读进去;如果一个字符一个字符的读的话,可能中间会出现"END"子串,让输入在不该结束的地方提前结束了),这样才能保证读到完全正确的data数据部分。

    最主要的是运用一些字符串处理的函数,就很容易了。

    代码:

    #include<iostream>
    #include<stdio.h>
    #include<string.h>
    #include<string>
    using namespace std;
    char a[5009],b[5009];
    void trim(char *s)//对字符串进行处理,去掉里面的空格、换行和tabs
    {
        char temp[5009];
        int j=0;
        for(int i=0; i<strlen(s); i++)
        {
            if(s[i]!=' '&&s[i]!='	'&&s[i]!='
    ')
            {
                temp[j]=s[i];
                j++;
            }
        }
        temp[j]='';
        strcpy(s,temp);
    }
    void Compare(char *a,char *b)
    {
        if (strcmp(a,b)==0)
        {
            printf("Accepted
    ");
            return ;
        }
        trim(a);
        trim(b);
        if (strcmp(a,b)==0)//去掉空格、换行、tabs后相等
        {
            printf("Presentation Error
    ");
            return ;
        }
        else
        {
            printf("Wrong Answer
    ");
            return ;
        }
    }
    void input(char * s)
    {
        char temp[5009];
        gets(temp);
        if(strcmp(temp,"START")==0)//从此处才开始得到data部分
        {
            gets(temp);//注意这里一定要用gets()来进行读入,因为scanf()不能读入空格
            while(strcmp(temp,"END")!=0)
            {
                if(strlen(temp)==0)
                    strcat(s,"
    ");//字符串追加
                else
                    strcat(s,temp);
                gets(temp);
            }
        }
    }
    int main()
    {
        int T;
        scanf("%d",&T);
        getchar();
        while(T--)
        {
            strcpy(a,"");//对a字符串进行刷新
            strcpy(b,"");//对b字符串进行刷新
            input(a);
            input(b);
            Compare(a,b);
        }
        return 0;
    }
    
  • 相关阅读:
    3.6 批量维护来源准则/查看来源准则
    3.5 供货比例(来源准则)控制
    3.4 新供应商引入
    3.3 集团化采购管理
    3.2 采购管理目标
    3.1 采购管理规划
    2.8 生产辅料管理
    2.7 车间任务的批量移动和批量完工入库
    2.6 自动更新车间任务的供应类型和完工子库
    2.5 总装与部装跟单任务的同步发放
  • 原文地址:https://www.cnblogs.com/cmmdc/p/7671349.html
Copyright © 2020-2023  润新知