hdu--5621KK's Point(排列组合）

KK's Point

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

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

  
  

   
   2
3
4
  
  

 

Sample Output

  
  

   
   3
5
  
  

 

我们先撇开边界上的点不管，那么所有的点都是有两条线所构成的

手算得出N=4的时候，能形成一个点

那么，我们只要知道N个点可以构成几个四边形即可

即求CN4{{C}^{4}_{N}}C​N​4​​

最后我们再把边界上的N个点加上，最后的结果是CN4−N{{C}^{4}_{N}}-NC​N​4​​ +N

1. #include<iostream>  
2. #include<cstdio>  
3. #include<cstdlib>  
4. #include<cmath>  
5. using namespace std;  
6. int main()  
7. {   
8.     int t;  
9.     cin>>t;  
10.     while(t--)  
11.     {   
12.         unsigned long long n;  
13.         cin>>n;  
14.         unsigned long long temp=n*(n-1)*(n-2)/6*(n-3)/4+n;  
15.         cout<<temp<<endl;  
16.     }  
17.     return 0;  
18. }