杭电5621 KK's Point

最新推荐文章于 2018-11-16 16:39:00 发布

原创最新推荐文章于 2018-11-16 16:39:00 发布 · 408 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#数学题 #杭电

数学专栏收录该内容

92 篇文章

订阅专栏

KK's Point

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 938 Accepted Submission(s): 307

Problem Description

Our lovely KK has a difficult mathematical problem:He points

N(2≤N≤105) 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).

Input

The first line of the input file contains an integer

T(1≤T≤10) , which indicates the number of test cases.

For each test case, there are one lines,includes a integer

N(2≤N≤105) ,indicating the number of dots of the polygon.

Output

For each test case, there are one lines,includes a integer,indicating the number of the dots.

Sample Input

Sample Output

3
5

Source

BestCoder Round #71 (div.2)

Recommend

hujie | We have carefully selected several similar problems for you: 5634 5633 5632 5631 5630

每四个会出现一个交点，本题数据较大long long 过不去，需要加unsigned:

#include<stdio.h>
unsigned long long int i,j,k,l,m,n,p,ans;
int main()
{
	scanf("%I64u",&p);
	while(p--)
	{
		scanf("%I64u",&n);
		k=n; 
		if(n>=4)
		k=k+n*(n-1)/2*(n-2)/3*(n-3)/4;
		printf("%I64u\n",k);
	}
}