HDOJ2_Sum Problem
来源:互联网 发布:网络大电影营销 编辑:程序博客网 时间:2024/06/03 21:08
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.
import java.util.Scanner;class Main{ private static Scanner scanner; public static void main(String[] args) { scanner = new Scanner(System.in); while (scanner.hasNext()) { int n = scanner.nextInt(); int sum = 0; for(int i = 1;i <= n;i++){ sum += i; } System.out.println(sum); System.out.println(); } }}
阅读全文
0 0
- HDOJ2_Sum Problem
- problem
- Problem
- problem
- Problem
- Problem
- Problem
- Problem
- Problem
- Problem
- problem
- Problem
- Problem
- Problem
- Problem
- Problem
- Problem
- Problem
- [新手题]reverse_factorial(python)
- 怎样解题:写题解思考问题的原则
- AR相机的实现
- OpenCV实现Matlab的circshift、fftshift、ifftshift函数
- Android ORM数据库--ActiveAndroid的使用
- HDOJ2_Sum Problem
- java语言基础(97)——匿名内部类实现多线程
- js原生图片轮播
- 如何优化tomcat配置(从内存、并发、缓存)优化
- Gitlab配置ssh连接
- Guard
- 你真的知道Java中boolean类型占用多少个字节吗?
- JavaWeb中cookie的使用
- 对pthread_create未定义的引用