HDOJ 1001 Sum Problem

原创 2015年07月10日 21:10:31

Sum Problem

Time Limit: 1000/500 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 339300    Accepted Submission(s): 85485


Problem Description
Hey, welcome to HDOJ(Hangzhou Dianzi University Online Judge).

In this problem, your task is to calculate SUM(n) = 1 + 2 + 3 + ... + n.
 

Input
The input will consist of a series of integers n, one integer per line.
 

Output
For each case, output SUM(n) in one line, followed by a blank line. You may assume the result will be in the range of 32-bit signed integer.
 

Sample Input
1 100
 

Sample Output
1 5050
 

Author
DOOM III
 

Recommend
We have carefully selected several similar problems for you:  1002 1090 1003 1091 1004

正确但超时码:
#include<stdio.h>
int main(){
	while(EOF){
		int n,i,num=0;
		scanf("%d",&n);
		for(i=1;i<=n;i++)
			num+=i;
		printf("%d\n\n",num);
	}
	return 0;
}
用公式AC:

 用整型还超时,必须得用double型,我也是服惹
#include<stdio.h>
int main(){
	double n;
	while(scanf("%lf",&n)!=EOF)
		printf("%.0lf\n\n",n*(n+1)/2);
	return 0;
}


版权声明:转载请注明出处

相关文章推荐

杭电OJ-1001-(Sum Problem大整数求和问题)

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

[1001]:Sum Problem(前n项和)

这道题应该注意:①这道题可以考察运用高斯前n项和的方法求解,因为题目没有界定n的范围,当直接循环计算时,n->无穷大,计算会中断②“You may assume the result will be ...

(Java实现) HDOJ 2058 The sum problem 高斯求和

Problem Description Given a sequence 1,2,3,......N, your job is to calculate all the possible sub-s...

HDOJ sum problem 问题

Sum ProblemTime Limit: 1000/500 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total...

HDOJ1001

  • 2007-07-26 15:47
  • 298B
  • 下载

hdoj1001标程

  • 2011-11-27 10:54
  • 259B
  • 下载

hdoj 1001(C实现)

problem:hdoj 1001 Problem Description:In this problem, your task is to calculate SUM(n) = 1 + 2 + 3 ...

Problem 1001

  • 2013-02-04 20:45
  • 282B
  • 下载

http://poj.org/problem?id=1001

Exponentiation Time Limit: 500MS   Memory Limit: 10000K Total Submissions: 134006  ...

http://cdn.ac.nbutoj.com/Problem/view.xhtml?id=1001&&纸牌游戏

问题描述 玩家1和玩家2各出一张牌,看谁大。如果两张牌都不是王牌花色或则都是王牌花色,则牌面大的牌大,如果牌面一样大则一样大。若其中一张牌是王牌而另一张不是,则无论牌面如何都是王牌花色大。 ...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

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