Codeforces Round #133 (Div. 2) A. Tiling with Hexagons(数学)

最新推荐文章于 2022-11-22 23:15:14 发布

御史大夫

最新推荐文章于 2022-11-22 23:15:14 发布

阅读量704

点赞数

文章标签： output c input each

本文链接：https://blog.csdn.net/cs_zlg/article/details/7877654

版权

Several ages ago Berland was a kingdom. The King of Berland adored math. That's why, when he first visited one of his many palaces, he first of all paid attention to the floor in one hall. The floor was tiled with hexagonal tiles.

The hall also turned out hexagonal in its shape. The King walked along the perimeter of the hall and concluded that each of the six sides has a, b, c, a, b and c adjacent tiles, correspondingly.

To better visualize the situation, look at the picture showing a similar hexagon for a = 2, b = 3 and c = 4.

$\text{[math]}$

According to the legend, as the King of Berland obtained the values a, b and c, he almost immediately calculated the total number of tiles on the hall floor. Can you do the same?

Input

The first line contains three integers: a, b and c (2 ≤ a, b, c ≤ 1000).

Output

Print a single number — the total number of tiles on the hall floor.

       Sample test(s) 
     
         input 
       
2 3 4

         output 
       
18

采用“补形”的方法，将六边形补全为平行四边形，如题中所示的例子，延长边a和c使之相交，要延长多少？答案是a-1。即将原六边形补全为一个（c + a - 1）× （b + a -1）的平行四边形，只要再减去多出的部分即可。

于是n = (b + a - 1) * (c + a - 1) - 2 * ((a - 1) + 1) * (a - 1) / 2 = (b + a - 1) * (c + a - 1) - a * (a - 1);

AC CODE：

#include <iostream>
using namespace std;

int main()
{
    int a, b, c, n;
    while(cin >> a >> b >> c)
    {
        n = (b + a - 1) * (c + a - 1) - a * (a - 1);
        cout << n << endl;
    }
    return 0;
}