sgu 135. Drawing Lines 找规律

最新推荐文章于 2021-08-11 21:59:48 发布

superkunn

最新推荐文章于 2021-08-11 21:59:48 发布

阅读量157

点赞数

CC 4.0 BY-SA版权

分类专栏： sgu !!!!!!!!!! 水--------------------

本文链接：https://blog.youkuaiyun.com/superkunn/article/details/80196408

sgu !!!!!!!!!! 同时被 2 个专栏收录

50 篇文章

订阅专栏

水--------------------

24 篇文章

订阅专栏

本文探讨了通过绘制N条直线可以将无限大的纸张分割成的最大区域数量问题，并提供了一个简洁的C++代码示例来解决该问题。文章介绍了如何根据输入的直线数量计算可能的最大区域数。

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

135. Drawing Lines

time limit per test: 0.25 sec.
memory limit per test: 4096 KB

Little Johnny likes to draw a lot. A few days ago he painted lots of straight lines on his sheet of paper. Then he counted in how many zones the sheet of paper was split by these lines. He noticed that this number is not always the same. For instance, if he draws 2lines, the sheet of paper could be split into 4, 3 or even 2 (if the lines are identical) zones. Since he is a very curious kid, he would like to know which is the maximum number of zones into which he can split the sheet of paper, if he draws N lines. The sheet of paper is to be considered a very large (=infinite) rectangle.

Input

The input file will contain an integer number: N (0<=N<=65535).

Output

You should output one integer: the maximum number of zones into which the sheet of paper can be split if Johnny draws N lines.

Sample Input #1

Sample Output #1

Sample Input #2

Sample Output #2

#include <bits/stdc++.h>

using namespace std;

void solve(){
    long long n;
    scanf("%lld",&n);
    printf("%lld",1+(1+n)*n/2);

}

int main(){
    solve();
    return 0;
}