UVA 11401 Triangle Counting

作者: ElbaOrtasopc 分类: 未分类 发布时间: 2014-10-25 03:26 阅读: 1,984

 中文详解请访问我的博客:http://xiaoshig.sinaapp.com/?p=128

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 (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

 

This article is automatically posted by WP-AutoPost : WordPress自动采集发布插件
HTML标签过滤,WP-AutoPost

如果觉得我的文章对您有用,请随意打赏。您的支持将鼓励我继续创作!

发表评论

电子邮件地址不会被公开。 必填项已用*标注