杭电acmP1001
来源:互联网 发布:王候将相宁有种乎翻译 编辑:程序博客网 时间:2024/06/05 05:19
Sum Problem
Time Limit: 1000/500 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 517949 Accepted Submission(s): 131365
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
import java.util.Scanner;public class Main { public static void main(String[] args) { Scanner sc=new Scanner(System.in); while(sc.hasNext()){ int n=sc.nextInt(); int sum=0; for(int i=1;i<=n;i++){ sum+=i; } System.out.println(sum); System.out.println(); } }}
阅读全文
0 0
- 杭电acmP1001
- 杭电
- 杭电
- 杭电
- 杭电 1234 和 杭电 2115
- 杭电2056之Rectangles 杭电
- 杭电ACM1061Rightmost Digit
- 杭电2099 7.11
- 杭电ACM 1003
- 杭电 ACM 2016
- 杭电ACM1466
- 杭电ACM1003
- 杭电ACM1225
- 杭电ACM2023
- 杭电ACM2602
- 杭电ACM2955
- 杭电ACM3198
- 杭电ACM2028 求教
- synchronized修饰普通方法,修饰静态方法比较
- NIFI概览
- Vue写一个验证码输入组件
- 通知的简单实现
- 广泛解释js中的类 与 对象
- 杭电acmP1001
- 8、Mybatis表关联----一对多
- javaweb request转发
- leetcode 107. Binary Tree Level Order Traversal II(BFS)(Java和C++)
- python 内置__str__作用
- Centos + Python3.5 + pip + uwsgi + django环境搭建
- Arduino语音天气预报(二)
- go基础算法思想
- Linux运行Eclipse的java项目