problem 1000: A+B problem

原创 2012年03月29日 02:12:57

又趁着兴趣,把这个problem 1000看了看,发觉这道题纯粹是为了介绍acm代码提交方面问题的example,但还是用C做了一下,题目在这里(摸我),代码如下:

#include <stdio.h>

int main()
{
    int a,b;
    scanf("%d %d",&a, &b);
    printf("%d\n",a+b);
    return 0;
}
没想到的是提交之后,提示“Wrong Answer”,检查了之后再提交,发现还是提示“Wrong Answer”,截图如下,甚是气恼:


于是,开始仔细的把题目看了几遍,发现ustcpku的题目不同,zju给出了正确的答案:

#include <stdio.h>

int main()
{
    int a,b;
    while(scanf("%d %d",&a, &b) != EOF) //注意此处的循环输入!
        printf("%d\n",a+b);
    return 0;
}


最后,提交,终于成功了!

这里提醒了我要注意scanf函数的用法,scanf函数返回从键盘缓冲区读取的字符数,如果在与其格式化输入参数不匹配的时候会返回EOF(-1);

同样的道理,当键盘缓冲区无数据时,scanf函数会阻塞,直到用户从键盘中输入,(回车符);

注意第二段代码中的循环输入!


PS:关于acm代码提交,ustc没找到说明,可以参考zju(点我)的说明,以下是摘录的一些错误说明:

Q:What is the meaning of the judge's reply XXXXX?
A:Here is a list of the judge's replies and their meaning:

Queuing : The judge is so busy that it can't judge your submit at the moment, usualy you just need to wait a minute and your submit will be judged.

Accepted : OK! Your program is correct!.

Presentation Error : Your output format is not exactly the same as the judge's output, although your answer to the problem is correct. Check your output for spaces, blank lines,etc against the problem output specification.

Wrong Answer : Correct solution not reached for the inputs. The inputs and outputs that we use to test the programs are not public (it is recomendable to get accustomed to a true contest dynamic ;-).

Time Limit Exceeded : Your program tried to run during too much time.

Memory Limit Exceeded : Your program tried to use more memory than the judge default settings.

Output Limit Exceeded: Your program tried to write too much information. This usually occurs if it goes into a infinite loop. Currently the output limit is 1M bytes.

Non-zero Exit Code: Your program exited returning a non-zero value to the shell. For languages such as C, this probably means you forgot to add "return 0" at the end of the program. For interpreted languages NZEC will usually mean that your program either crashed or raised an uncaught exception.

Compile Error : The compiler (gcc, g++, fpc, etc) could not compile your program. Of course, warning messages are not error messages. Click the link at the judge reply to see the actual error message.

Out Of Contest Time: this message can only appear during a contest, if a program is submitted out of contest time.

No such problem: Either you have submitted a wrong problem id or the problem is unavailable.

Segmentation Fault : The possible cases of your encountering this error are:

  • 1.buffer overflow --- usually caused by a pointer reference out of range.
  • 2.stack overflow --- please keep in mind that the default stack size is 8192K.

Floating Point Error : Divide by 0

Runtime Error : See FAQ below

版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

HDU 1000 A + B Problem

作为经典的ACM入门题,这应该是很多人入坑时做的第一道题,可以说,A+B问题对ACMer的意义相当于Hello World对于程序员的意义。很多题目很简单,但是有些人知道做法也不一定能AC,因此借这道...

Problem 1000

  • 2013-02-04 20:14
  • 197B
  • 下载

数据结构实验之二叉树一:树的同构数据结构实验之二叉树一:树的同构 Time Limit: 1000MS Memory Limit: 65536KB Submit Statistic Problem D

数据结构实验之二叉树一:树的同构 Time Limit: 1000MS Memory Limit: 65536KB Submit Statistic Problem Descript...

贪心算法 Problem A 1000

STL Problem A  Problem ID:1000  题意:共有编号为1-400的房间,400个房间分布在一条走廊的两边,从左到右按编号大小依次排开,且1和2相对,3和4相对,依次类推。...

Problem 1:Find the sum of all the multiples of 3 or 5 below 1000.

Problem 1: Multiples of 3 and 5If we list all the natural numbers below 10 that are multiples of 3 o...

FOJ Problem 1075 分解素因子 (筛法求素数Problem 1075 分解素因子 Accept: 1650 Submit: 3102 Time Limit: 1000 mSe)

Problem 1075 分解素因子 Accept: 1650 Submit: 3102 Time Limit: 1000 mSec Memory Limit : 32768 KB ...

NYOJ 513 & HDU 1753 A+B Problem IV(模拟)

题目链接:Click here~~ 一道高精度加法的题目。 由于数据中可能既有小数又有整数,所以我把整数变成小数(后面加".0"),从而化为两个小数相加的问题。 找小数点的时候,先判断它...

A + B Problem II

A + B Problem II Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others...

[ACMcoder] A + B Problem II

Problem Description I have a very simple problem for you. Given two integers A and B, your job is t...

NYOJ513 A+B Problem IV

原题链接 和HDOJ1753一样的题。 #include #include #define MAX 400 + 10 char a0[MAX], b0[MAX], s[MAX], aa[MAX...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

(最多只允许输入30个字)