[hdu-] Sum Problem
来源:互联网 发布:中国最大的unity3d论坛 编辑:程序博客网 时间:2024/05/22 09:05
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.
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
1100
Sample Output
15050
import java.util.Scanner;public class Main {public static void main(String[] args) {int n = 0;int sum = 0;Scanner scanner = new Scanner(System.in);while (scanner.hasNext()) {n = scanner.nextInt();for (int i = 1; i <= n; i++) {sum += i;}System.out.println(sum);System.out.println();sum = 0;}}}
0 0
- HDU 1001 Sum Problem
- HDU--1001--Sum Problem
- hdu 1001 Sum Problem
- hdu 1001 Sum Problem
- hdu 1001 Sum Problem
- hdu 1001 sum problem
- HDU 1001 Sum Problem
- hdu 1001 Sum Problem
- [hdu-] Sum Problem
- HDU 1001 Sum Problem
- hdu 1001 Sum Problem
- hdu 1001 sum problem
- HDU 1001 sum problem
- Sum Problem-hdu-1001
- HDu 1001 Sum Problem
- hdu 1001 sum problem
- HDU 1001 Sum Problem
- HDU 1001 Sum Problem
- 二叉树的层次遍历,从上到下和从下到上分层打印
- new/delete与malloc/free区别
- uva10010 - Where's Waldorf?
- 引用和指针
- jfreechat
- [hdu-] Sum Problem
- MapReduce工作原理图文详解
- android 图片处理
- 成功人的共同特点
- poj 3185 The Water Bowls(高斯消元)
- 【InversionCount 逆序对数 + MergeSort】
- mapreduce程序实现排序
- dojo小例子(12)form转换成带内部对象的json数据
- j2ee规范13种