当前你的浏览器版本过低,网站已在兼容模式下运行,兼容模式仅提供最小功能支持,网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器:

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

5621:KK's Point

题目描述
Our lovely KK has a difficult mathematical problem:He points $N\left(2\leq N\leq {10}^{5} \right)$ points on a circle,there are all different.Now he's going to connect the $N$ points with each other(There are no three lines in the circle to hand over a point.).KK wants to know how many points are there in the picture(Including the dots of boundary).
输入解释
The first line of the input file contains an integer $T\left( 1\leq T\leq 10\right)$, which indicates the number of test cases.

For each test case, there are one lines,includes a integer $N\left(2\leq N\leq {10}^{5} \right)$,indicating the number of dots of the polygon.
输出解释
For each test case, there are one lines,includes a integer,indicating the number of the dots.
输入样例
2
3
4
输出样例
3
5
来自杭电HDUOJ的附加信息
Recommend hujie

该题目是Virtual Judge题目,来自 杭电HDUOJ

源链接: HDU-5621

最后修改于 2020-10-25T23:24:16+00:00 由爬虫自动更新

共提交 0

通过率 --%
时间上限 内存上限
2000/1000MS(Java/Others) 65536/65536K(Java/Others)