UVA 11401 Triangle Counting(数学)

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

FinalFantacy~

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

阅读量1.2k

点赞数

分类专栏： C/C++ 算法编程文章标签：数学 uva

本文链接：https://blog.csdn.net/keshacookie/article/details/21831627

版权

C/C++ 算法编程专栏收录该内容

143 篇文章 1 订阅

订阅专栏

Problem GTriangle Counting

Input: StandardInput

Output: StandardOutput

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

Input

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

Output

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

Sample Input Output for Sample Input

Problemsetter: Mohammad Mahmudur Rahman

每次做这种三角形的题的时候，我就想到了三角恋，然后就有一种想挖别人墙角的感觉，世界观啊，情商啊，更年期啊。。。看电视剧的时候也是一样，总是支持反派，这情况好像不太正常。。。。（飙泪中。。。）

代码：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#define MAXN 1000000+10
using namespace std;

typedef unsigned long long ULL;
ULL a[MAXN];

int main()
{
    a[3] = 0;
    for(ULL i=4; i<MAXN; i++) {
        a[i] = a[i-1] + ((i-1)*(i-2)/2-(i-1)/2)/2;
    }
    ULL n;
    while(~scanf("%lld", &n)) {
        if(n < 3) break;
        printf("%lld\n", a[n]);
    }
    return 0;
}
代码有点短是吧，没办法啦，水平有限+更年期，真是不容易啊。。。