uva 11401

Triangle Counting

Input: Standard Input

Output: Standard Output

 

You are given n rods of length 1, 2…, n. You have to pick any 3 of them & build a triangle. How many distinct triangles can you make? Note that, two triangles will be considered different if they have at least 1 pair of arms with different length.

 

Input

 

The input for each case will have only a single positive integer n (3<=n<=1000000). The end of input will be indicated by a case with n<3. This case should not be processed.

 

Output

 

For each test case, print the number of distinct triangles you can make.

 

Sample Input                                                 

5

8

0

 Output for Sample Input

4

22

刘汝佳的算法竞赛训练指南里有详细介绍

<pre name="code" class="cpp">#include<iostream>
using namespace std;
long long f[1000010];
void init(){
    f[3]=0;
    for(long long i=4;i<=1000000;i++)                 //边长i为最大边长是有 ( (i-1)*(i-2)/2 - (i-1)/2)/2个三角形 
        f[i]=f[i-1]+((i-1)*(i-2)/2-(i-1)/2)/2; //f[i]表示边长最长为i时总共用多少个三角形 
}
int main(){
    init();
    int n;
    while(cin>>n){
        if(n<3)
            break;
        cout<<f[n]<<endl;
    }
    return 0;
}