A. Gerald's Hexagon
Time Limit: 20 Sec
Memory Limit: 256 MB
题目连接
http://codeforces.com/contest/559/problem/A
Description
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.
Sample Input
1 1 1 1 1 1
Sample Output
6
HINT
题意
给你一个角都是120度的六边形，然后问你里面有多少个边长为1的正三角形
题解：
简单分析一下，我们可以把这个三角形，扩展成一个大的正三角形，然后减去边上的小三角形就好了~
代码
#include <iostream> #include <cstdio> using namespace std; int a,b,c,d,e,f; int main(){ scanf("%d%d%d%d%d%d",&a,&b,&c,&d,&e,&f); int t=a+b+f; cout<<t*t-b*b-d*d-f*f<<endl; return 0; }