admin管理员组

文章数量:1612408

Gerald got a very curious hexagon for his birthday. The boy found out that all the angles of the hexagon are equal to . Then he measured the length of its sides, and found that each of them is equal to an integer number of centimeters. There the properties of the hexagon ended and Gerald decided to draw on it.

He painted a few lines, parallel to the sides of the hexagon. The lines split the hexagon into regular triangles with sides of 1 centimeter. Now Gerald wonders how many triangles he has got. But there were so many of them that Gerald lost the track of his counting. Help the boy count the triangles.

Input
The first and the single line of the input contains 6 space-separated integers a1, a2, a3, a4, a5 and a6 (1 ≤ ai ≤ 1000) — the lengths of the sides of the hexagons in centimeters in the clockwise order. It is guaranteed that the hexagon with the indicated properties and the exactly such sides exists.

Output
Print a single integer — the number of triangles with the sides of one 1 centimeter, into which the hexagon is split.

Examples
Input
1 1 1 1 1 1
Output
6
Input
1 2 1 2 1 2
Output
13
Note
This is what Gerald’s hexagon looks like in the first sample:

And that’s what it looks like in the second sample:

题意： 给出六边形的各边长，求里面有多少个正三角形。
思路： 将其补全为正三角形就可以了。正三角形边长为x，里面所含的边长为1三角形数目为x*x。

#include <cstdio>
#include <iostream>
#include <algorithm>
using namespace std;

int main()
{
    int a,b,c,d,e,f;cin >> a >> b >> c >> d >> e >> f;
    int t = a + f + e;
    cout << t * t - a * a - e * e - c * c << endl;
}

本文标签： 规律数学公式hexagonGeraldcodeforces

版权声明：本文标题：Gerald's Hexagon CodeForces - 559A（数学公式，推规律） 内容由热心网友自发贡献，该文观点仅代表作者本人， 转载请联系作者并注明出处：https://www.elefans.com/xitong/1728632195a1167206.html， 本站仅提供信息存储空间服务，不拥有所有权，不承担相关法律责任。如发现本站有涉嫌抄袭侵权/违法违规的内容，一经查实，本站将立刻删除。