uva 11401 Triangle Counting

Problem G
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                                                  Output for Sample Input

5 8 0

3 22

解析

数学。先推一个公式，cal[i]表示以i为最大边的三角形个数。那么输出的时候只要输出c[i]的前缀和就可以了。

当三角形的最大边固定为c的时候：另外两边必须满足c-b<a<c

b=1时，a有0种选择

b=2时，a有1种选择

……

b=c-2时，a有c-3种选择

b=c-1时，a有c-2种选择

似乎可以得到：

cal[i]=0+1+...+c-1

        =(n-1)*(n-2)/2

但是a!=b  所以cal[i] = (n-1)*(n-2)/2 - (n-1)/2  这里的(n-1)/2是整除

这样算出来的cal[i]刚好把每个三角形算了两次。所以dp[i]=dp[i-1]+cal(i) / 2;

注意计算cal的时候会爆int（被坑了好几次），然后终止条件是n<3

#include<cstdio>

using namespace std;

typedef long long LL;
LL dp[1000100],N;

LL cal(LL x)
{
	return (x-1)*(x-2)/2-(x-1)/2;
}

int main()
{
#ifdef LOCAL
	//freopen("uva11401.out","w",stdout);
#endif

	for(int i=1;i<=1000000;i++)
		dp[i]=dp[i-1]+cal((long long)i)/2;

#ifdef LOCAL
	printf("prework done!\n");
	for(int i=1;i<=10;i++) printf("dp[%d]=%lld\n",i,dp[i]);
#endif
	while(scanf("%lld",&N)==1)
	{
		if(N<3) break;
		printf("%lld\n",dp[N]);
	}
#ifdef LOCAL
	while(1);
#endif
	return 0;
}