Winter-1-B Sum 解题报告及测试数据

Time Limit:500MS

Memory Limit:32768KB

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

100

Sample Output

5050

以下是代码：

#include <cstdio>

using namespace std;

int main(){

int n,sum;

while(scanf("%d",&n)!=EOF){

sum=0;

for(int i=1;i<=n;i++)sum+=i;

printf("%d\n\n",sum);

}

时间： 2024-10-15 01:25:10

Winter-1-B Sum 解题报告及测试数据的相关文章

Winter-1-D Max Sum 解题报告及测试数据

Time Limit:1000MS Memory Limit:32768KB Description Given a sequence a[1],a[2],a[3]......a[n], your job is to calculate the max sum of a sub-sequence. For example, given (6,-1,5,4,-7), the max sum in this sequence is 6 + (-1) + 5 + 4 = 14. Input The f

Winter-2-STL-E Andy's First Dictionary 解题报告及测试数据

use stringstream Time Limit:3000MS Memory Limit:0KB Description Andy, 8, has a dream - he wants to produce his very own dictionary. This is not an easy task for him, as the number of words that he knows is, well, not quite enough. Instead of thin

LeetCode: Combination Sum 解题报告

Combination Sum Combination Sum Total Accepted: 25850 Total Submissions: 96391 My Submissions Question Solution Given a set of candidate numbers (C) and a target number (T), find all unique combinations in C where the candidate numbers sums to T. The

USACO Section2.3 Zero Sum 解题报告【icedream61】

zerosum解题报告------------------------------------------------------------------------------------------------------------------------------------------------[题目] 给你N. 把1到N依次写出,每相邻两个数字中间加上一个字符,三选一:'+','-',' '. 如此,便可形成很多表达式,把其中计算结果为0的按字典序输出.[数据范围] 3<=N<

LeetCode: Binary Tree Maximum Path Sum 解题报告

Binary Tree Maximum Path SumGiven a binary tree, find the maximum path sum. The path may start and end at any node in the tree. For example:Given the below binary tree, 1 / \ 2 3 SOLUTION 1: 计算树的最长path有2种情况: 1. 通过根的path. (1)如果左子树从左树根到任何一个N

Spring-1-H Number Sequence（HDU 5014）解题报告及测试数据

Number Sequence Time Limit:2000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64u Problem Description There is a special number sequence which has n+1 integers. For each number in sequence, we have two rules: ● a i ∈ [0,n] ● a i ≠ a j ( i

Winter-2-STL-B Brackets 解题报告及测试数据

Time Limit:2000MS Memory Limit:65536KB Description Given a string consisting of brackets of two types find its longest substring that is a regular brackets sequence. Input There are mutiple cases in the input file. Each case contains a string con

Winter-2-STL-D The Blocks Problem 解题报告及测试数据

Time Limit:3000MS Memory Limit:0KB Description Background Many areas of Computer Science use simple, abstract domains for both analytical and empirical studies. For example, an early AI study of planning and robotics (STRIPS) used a block world i

Spring-2-H Array Diversity（SPOJ AMR11H）解题报告及测试数据

Array Diversity Time Limit:404MS Memory Limit:0KB 64bit IO Format:%lld & %llu Description Here we go! Let's define the diversity of a list of numbers to be the difference between the largest and smallest number in the list. For example, the d