1072 -- Sum Problem

最新推荐文章于 2020-04-14 03:24:06 发布

jtahstu_akoj

最新推荐文章于 2020-04-14 03:24:06 发布

阅读量3.1k

点赞数

CC 4.0 BY-SA版权

分类专栏： akoj 文章标签： akoj

本文链接：https://blog.youkuaiyun.com/jtahstu_akoj/article/details/48088719

akoj 专栏收录该内容

250 篇文章

订阅专栏

本文介绍了一个简单的算法用于计算从1到n的整数累加和，并提供了使用C#实现的示例代码。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Sum Problem

Time Limit:1000MS Memory Limit:65536K
Total Submit:504 Accepted:268

Description

Hey, welcome to ahstu oj.

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. You may assume the result will be in the range of 32-bit signed integer.

Sample Input

1
100

Sample Output

1
5050

Source

    using System;
    using System.Collections.Generic;
    using System.Linq;
    using System.Text;
    namespace AK1072 {
        class Program {
            static void Main(string[] args) {
                string sb;
                while ((sb = Console.ReadLine()) != null) {
                    long n = long.Parse(sb);
                    long sum = (1 + n) * n / 2;
                    Console.WriteLine(sum);
                }
            }
        }
    }