HDU 1001

最新推荐文章于 2024-07-17 11:30:00 发布

番薯IT

最新推荐文章于 2024-07-17 11:30:00 发布

阅读量929

点赞数

分类专栏： ACM JAVA 文章标签： ACM 基础

本文链接：https://blog.csdn.net/fanshujuntuan/article/details/8848985

版权

ACM JAVA 专栏收录该内容

30 篇文章 1 订阅

订阅专栏

Sum Problem

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

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

Sample Output

Author

DOOM III

package hdu1001;

import java.util.*;
import java.io.*;

public class Main {
	public static void main(String[] args) {
		int sum;
		//int flag = 0;
		Scanner cin = new Scanner(new BufferedInputStream(System.in));
		while (cin.hasNext()) {
			//if ((flag++) != 0)
			//	System.out.println();
			sum = 0;
			int num = cin.nextInt();
			for (int i = 1; i <= num; i++) {
				sum += i;
			}
			System.out.println(sum);
			System.out.println();
		}
	}
}