题目详情 - Splittingplane - 南阳理工学院OJ

ID: 416

远端评测题

1000ms

128MiB

尝试: 0

已通过: 0

难度: (无)

上传者:

Hydro

We have seen many problems about straight line splitting plane.Today ours problem has little difference with before.Because this time we don't use a straight line to splitting plane,we use a broken line to splitting plane.

For example , a broken line can divided a plane to two parts, two broken line can divided a plane to seven parts.

Input

The first line input an integer N(1<N<10000)
Then N trip test data
Each test data have a integer M. M represents the number of broken lines.(0<M<=10000)

Output

For each test case, please output plane's biggest segmentation number, the output of each instance of one line.

Sample Input

2
1
2

Sample Output

</p>

2
7

HINT

Source

NYOJ

#P1415. Splittingplane

Splittingplane

Input

Output

Sample Input

Sample Output

HINT

Source

统计

状态

开发

支持

#P1415. Splittingplane

Splittingplane

Input

Output

Sample Input

Sample Output

HINT

Source

统计

状态

开发

支持

还没有账户？

登录