hdoj1001--Sum Problem
In this problem, your task is to calculate SUM(n) = 1 + 2 + 3 + ... + n.
import java.util.*;
import java.io.*; class Main
{
public static int sum(int n) {
if(n % 2 == 0) return n/2*(n+1);
else return (n+1)/2*n; }
public static void main(String args[])
{
Scanner cin = new Scanner(System.in);
int n;
while(cin.hasNextInt()) {
n = cin.nextInt();
System.out.println(sum(n));
System.out.println();
}
}
}
code(C):
#include <stdio.h> int sum(int n)
{
if(n % 2)
return (n + 1) / 2 * n;
else
return (n / 2) * (n + 1);
} int main()
{
int n;
while(scanf("%d",&n) != EOF){
printf("%d\n\n",sum(n));
}
return 0;
}
hdoj1001--Sum Problem的更多相关文章
- summary of k Sum problem and solutions in leetcode
		
I found summary of k Sum problem and solutions in leetcode on the Internet. http://www.sigmainfy.com ...
 - Subset sum problem
		
https://en.wikipedia.org/wiki/Subset_sum_problem In computer science, the subset sum problem is an i ...
 - HDu 1001 Sum Problem                                                    分类:            ACM             2015-06-19 23:38    12人阅读    评论(0)    收藏
		
Sum Problem Time Limit: 1000/500 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total ...
 - HD2058The sum problem
		
The sum problem Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Tot ...
 - Maxmum subsequence sum problem
		
We have a lot of ways to solve the maximum subsequence sum problem, but different ways take differen ...
 - HDU 2058 The sum problem(枚举)
		
The sum problem Problem Description Given a sequence 1,2,3,......N, your job is to calculate all the ...
 - NYOJ--927--dfs--The partial sum problem
		
/* Name: NYOJ--927--The partial sum problem Author: shen_渊 Date: 15/04/17 19:41 Description: DFS,和 N ...
 - 动态规划法(三)子集和问题(Subset sum problem)
		
继续讲故事~~ 上次讲到我们的主人公丁丁,用神奇的动态规划法解决了杂货店老板的两个找零钱问题,得到了老板的肯定.之后,他就决心去大城市闯荡了,看一看外面更大的世界. 这天,丁丁刚回到家,他 ...
 - HDU 2058:The sum problem(数学)
		
The sum problem Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) ...
 - Problem-1001:Sum Problem
		
Sum Problem Sample code : #include <stdio.h> int main() { int i,n; int sum; while(scanf(" ...
 
随机推荐
- 修改eclipse的repository路径
			
(1)首先修改你的settings.xml文件,(如果没有settings.xml文件,可以下载maven的官网把maven的插件下载下来,在apache-maven-3.5.0\conf\ 目录下有 ...
 - CAN协议学习(一)协议介绍
			
一.简介 CAN 是 Controller Area Network 的缩写(以下称为 CAN),是 ISO 国际标准化的串行通信协议. 在当前的汽车产业中,出于对安全性.舒适性.方便性.低公害.低成 ...
 - spring boot配置文件
			
1.spring boot通常打成一个jar文件发布,想修改配置文件比较麻烦,但他提供了一种读取外部配置文件的方式.在代码的主类中增加如下代码 System.setProperty("spr ...
 - 详细的linux目录结构详细介绍
			
详细的linux目录结构详细介绍 --树状目录结构图 下面红色字体为比较重要的目录 1./目录 目录 描述 / 第一层次结构的根,整个文件系统层次结构的根目录 /bin/ 需要在单用户模式可用的必要命 ...
 - Idea中优化Markdown Support显示效果
			
转自:https://www.jianshu.com/p/d093c42a8c29 因为工作中为提高工作效率,我一般习惯于直接在`idea`中使用`markdow support`插件来进行相关文档的 ...
 - ios上ZXing库的配置流程
			
本文转载至 http://blog.csdn.net/louercab/article/details/26448587 步骤 首先,用Xcode创建我们的demo, 取名TestZXing(根据自己 ...
 - 7.FactoryBean 和BeanFactory去区别
			
FactoryBean源码: /* * Copyright 2002-2012 the original author or authors. * * Licensed under the Apach ...
 - phpstorm+xdebug, 实现断点调试: xdebug如何配置
			
[XDebug] xdebug.profiler_output_dir="D:\phpStudy\tmp\xdebug" xdebug.trace_output_dir=" ...
 - DDD开源框架
			
DDD开源框架: ABP ENODE https://github.com/VirtoCommerce/vc-community APWorks https://github.com/daxnet/B ...
 - linux c编程:进程控制(四)进程关系
			
每一个进程除了有一个进程ID外,还属于一个进程组. 进程组是一个或多个进程的集合,通常情况下,他们是在同一作业中结合起来的,同一进程组的个进程接受来自同一终端的各种信号. 每一个进程组有一个唯一的进 ...