UVa 11401 Triangle Counting (组合计数)
来源:互联网 发布:kindlepc阅读软件 编辑:程序博客网 时间:2024/05/01 05:07
11401 - Triangle Counting
Time limit: 1.000 seconds
http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=469&page=show_problem&problem=2396
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
首先算出当最大边为x的符合题意的个数有多少,再用递推式累加即可。(因为题目要算的是边长不超过n的个数)
完整代码:
/*0.029s*/#include<cstdio>long long f[1000010];int main(){f[3] = 0;for (long long x = 4; x <= 1000000; ++x)f[x] = f[x - 1] + ((x - 1) * (x - 2) / 2 - (x - 1) / 2) / 2;int n;while (scanf("%d", &n), n >= 3)printf("%lld\n", f[n]);return 0;}
- UVa 11401 Triangle Counting (组合计数)
- 【组合计数dp】UVA 11401Triangle Counting
- UVa 11401 - Triangle Counting//计数
- UVA 11401 - Triangle Counting 组合
- UVa 11401 - Triangle Counting (组合数学)
- Uva 11401 - Triangle Counting 解题报告(计数)
- UVA 11401 - Triangle Counting(数论+计数问题)
- uva 11401 Triangle Counting 数三角形 (计数问题)
- 7_4_K题 Triangle Counting 题解 [uva 11401](计数)
- UVA 11401 Triangle Counting——计数原理
- UVA 11401 Triangle Counting
- Uva 11401 - Triangle Counting
- UVA 11401 Triangle Counting
- UVA 11401 - Triangle Counting
- UVA 11401 - Triangle Counting
- uva 11401 - Triangle Counting
- UVA - 11401 Triangle Counting
- UVA 11401 Triangle Counting
- 教你如何用代码从程序里面打开 控制面板【2013.10.9 小记】
- win7+ArcGIS10+注册机
- 编程名言名句
- excel公式
- ifstream打开含中文路径文件时失败的问题
- UVa 11401 Triangle Counting (组合计数)
- ANE Toolkit
- MFC中IPADDRESS控件的使用
- 你好吗
- 理财专题(8)——典当行
- Jquery menu 插件
- 通过View 的android:layout_weight属性占用多余的空间
- 静态链接库与动态链接库
- Delphi中TDateTime使用心得