UVA11401 Triangle Counting【递推】

最新推荐文章于 2024-05-29 00:50:24 发布

海岛Blog

最新推荐文章于 2024-05-29 00:50:24 发布

阅读量474

点赞数 1

本文链接：https://blog.csdn.net/tigerisland45/article/details/79262732

版权

ICPC-UVA 同时被 2 个专栏收录

1050 篇文章 9 订阅

订阅专栏

ICPC-递推与组合

51 篇文章 5 订阅

订阅专栏

You are given n rods of length 1, 2, . . . , n. You have to pick any 3 of them and build a triangle. Howmany distinct triangles can you make? Note that, two triangles will be considered different if they haveat 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 inputwill 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

Sample Output

问题链接：UVA11401 Triangle Counting

问题简述：（略）

问题分析：这是一个递推组合的问题，关键是找出递推函数来。不解释！

程序说明：打表是必要的！还需要注意变量类型！！！

题记：（略）

参考链接：（略）

AC的C++语言程序如下：

/* UVA11401 Triangle Counting  */

#include <iostream>
#include <stdio.h>

using namespace std;

typedef long long LL;

const int N = 1e6;
LL f[N + 1];

void maketable()
{
    f[0] = 0;
    f[1] = 0;
    f[2] = 0;
    f[3] = 0;

    for(LL i=4; i<=N; i++)
        f[i] = f[i - 1] + ((i - 1) * (i - 2) / 2 - (i - 1) / 2) / 2;
}


int main()
{
    maketable();

    LL n;
    while(~scanf("%lld", &n) && n) {
        if(n < 3)
            break;

        printf("%lld\n", f[n]);
    }

    return 0;
}