超级会员免费看
该博客介绍了UVA在线判题系统中的11401题——Triangle Counting。博客详细说明了问题内容，即给定n根长度为1到n的杆子，询问能组成多少种不同的三角形。输入是一个正整数n（3≤n≤1000000），当n<3时输入结束。对于每个测试用例，输出可能的不同三角形数量。
Triangle Counting
来源：UVA
标签：
参考资料：
相似题目：
题目
You are given n rods of length 1, 2, . . . , n. You have to pick any 3 of them and 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.
输入
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.
输出
For each test case, print the num
订阅专栏 解锁全文
扫一扫
1万+
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
