zoukankan      html  css  js  c++  java
  • 杭电OJ-1073_Online Judge

    Online Judge

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


    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.


    题意:

    比较两个字符串,

          完全一样输出Accepted

          除去‘ ’ , ‘ ’,‘ ',其它都一样输出Presentation Error

          else 输出 Wrong Answer

    要点:

        1.字符串的输入循环的跳出判断(’ ‘,’ ‘,’ ' 都不跳过),

        2.data部分的截取(因为输入格式都一样,不截取也可以,只不过耗时多一些)

    #include<iostream>
    #include<string>
    using namespace std;
    int T,i,j;
    char a[5000], b[5000];
    bool flag1, flag2;			//flag1答案正确(true代表错误),flag2格式正确(true代表错误)
    
    int input(char *a)
    {
    	int i = 0;
    	while (true)
    	{
    		a[i] = cin.get();
    		if (a[i - 3] == '
    '&&a[i - 2] == 'E'&&a[i - 1] == 'N'&&a[i] == 'D')  //当'
    ','E','N','D'相连时跳出循环
    			break;
    		i++;
    	}
    	return i;
    }
    void judge()
    {
    	for (int x = 5, y = 5; x < i-2 || y<j-2;)
    	{
    		if (a[x] == b[y])
    		{
    			x++;y++;
    		}
    		else if (a[x] == ' ' || a[x] == '	' || a[x] == '
    ')
    		{
    			x++;flag2 = true;
    		}
    		else if (b[y] == ' ' || b[y] == '	' || b[y] == '
    ')
    		{
    			y++;flag2 = true;
    		}
    		else
    		{
    			flag1 = true;
    			break;
    		}
    	}
    }
    
    int main(void)
    {
    	cin >> T;
    	while (T--)
    	{
    		flag1 = false, flag2 = false;
    		i = input(a);
    		j = input(b);
    		judge();
    		if (flag1)
    			cout << "Wrong Answer" << endl;
    		else
    		{	
    			if (flag2)
    				cout << "Presentation Error" << endl;
    			else
    				cout << "Accepted" << endl;
    		}
    	}
    	return 0;
    }


  • 相关阅读:
    css flex布局应用
    Java 中 List、HashTable、HashMap、TreeMap
    Java 面向对象的三大特征
    Java-冒泡排序算法
    单例模式- 实现方式
    Mac
    Appium DesiredCapabilities 参数设置
    Mac- appium 环境配置
    PHP安装+使用
    mac 安装protobuf,并编译
  • 原文地址:https://www.cnblogs.com/A-yes/p/9894253.html
Copyright © 2011-2022 走看看