SOJ.Cannonball Pyramids

最新推荐文章于 2017-07-23 12:07:00 发布

骚然勿外

最新推荐文章于 2017-07-23 12:07:00 发布

阅读量491

点赞数

分类专栏：刷题人生文章标签： C++ OJ

本文链接：https://blog.csdn.net/a576699534/article/details/46548785

版权

刷题人生专栏收录该内容

49 篇文章 0 订阅

订阅专栏

1701. Cannonball Pyramids

时间限制：1秒内存限制：32兆

题目描述

If you visit historical battlegrounds from periods when cannon were used, you may see cannonballs (metal spheres) stacked in various ways. In this problem we're interested in the number of cannonballs in such pyramids with triangular bases -- that is, with cannonballs arranged in an equilateral triangle on the base, then similar equilateral triangles of cannonballs stacked on top of that, until a single cannonball is placed on the top. This three-sided pyramid is, in fact, one of the Platonic solids, a tetrahedron.

For example, suppose we begin with a base containing 6 cannonballs arranged in an equilateral triangle as shown in the figure on the left; this equilateral triangle has 3 cannonballs on each edge. The next layer will contain 3 cannonballs, 2 on each edge -- as shown in the middle. The final layer always contains just one cannonball. The total number of cannonballs in this pyramid is thus 6 + 3 + 1 = 10. In general, each layer of such a pyramid will have one fewer cannonballs on each edge of the triangle than the next lower layer.

The number of cannonballs in a layer is just the sum of the integers from 1 to N, where N is the number of cannonballs on one side of the layer.

Given the number of cannonballs on each side of the base, compute the total number of cannonballs in the entire tetrahedral pyramid.

输入格式

The first line of the input contains a single integer N giving the number of cases posed, for a maximum of 100 cases. Following that are exactly N lines, each with a single integer giving the number of cannonballs on each side of the base for a tetrahedron of cannonballs, a number less than 1000.

输出格式

For each input case, display the case number (1, 2, ...), a colon and a blank, the number of cannonballs on each side of the base, one blank, and finally the total number of cannonballs in the tetrahedron.

样例输入

样例输出

1: 3 10
2: 5 35
3: 27 3654
4: 999 166666500
5: 1 1

         
         
          
          #include "iostream"
using namespace std;
int a[1000];
int op(int b)
{
	int ans=0;
	double i=1;
	while(i
            
            
             
             >n;
	for(int i=0;i
             
             
              
              >a[i];
	for(int i=0;i
              
              
               
               <
               
               
                
                <<": "<
                
                
                  <<" "< 
                 
                   <