CF 560 Gerald's Hexagon
2015-08-05 09:52
453 查看
Gerald got a very curious hexagon for his birthday. The boy found out that all the angles of the hexagon are equal to
![](http://codeforces.com/predownloaded/dc/7b/dc7bf370dd61f03eda680c0d25e2b2944ef11290.png)
.
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 test(s)
input
output
input
output
Note
This is what Gerald's hexagon looks like in the first sample:
![](http://codeforces.com/predownloaded/68/ad/68ad42ee5bd755c3bdc3882fa16f49767cac0544.png)
And that's what it looks like in the second sample:
![](http://codeforces.com/predownloaded/c8/88/c888b890119f18644ad25f57613b8d522d7b8152.png)
yiyi:
zhe份是看了题解后,写的。大体的意思是:(正三角形的面积公式:s = 1/2*sin60度 *a(边长)的平方)
按照顺时针的方向给出一个内角都是120°的六边形,让你求此六边形能够分解成多少个边长为1的正三角形。
只要求出正六边形的面积然后和小正三角形一比就是答案,化简一下就是求正六边形面积,延长三条不相邻的边长,形成一个大的正三角形,然后减去形成的三个小正三角形即为所求。
答案:
![](http://codeforces.com/predownloaded/dc/7b/dc7bf370dd61f03eda680c0d25e2b2944ef11290.png)
.
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 test(s)
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:
![](http://codeforces.com/predownloaded/68/ad/68ad42ee5bd755c3bdc3882fa16f49767cac0544.png)
And that's what it looks like in the second sample:
![](http://codeforces.com/predownloaded/c8/88/c888b890119f18644ad25f57613b8d522d7b8152.png)
yiyi:
zhe份是看了题解后,写的。大体的意思是:(正三角形的面积公式:s = 1/2*sin60度 *a(边长)的平方)
按照顺时针的方向给出一个内角都是120°的六边形,让你求此六边形能够分解成多少个边长为1的正三角形。
只要求出正六边形的面积然后和小正三角形一比就是答案,化简一下就是求正六边形面积,延长三条不相邻的边长,形成一个大的正三角形,然后减去形成的三个小正三角形即为所求。
答案:
#include <stdio.h> #include <string.h> //#include<cctype> int main () { int a, sum; int s[1010]; for (int i = 1; i <= 6; i++) { scanf("%d", &s[i]); } a = s[1] + s[2] +s[3]; sum = a * a -s[1] * s[1] - s[3] * s[3] - s[5] * s[5]; printf("%d", sum); return 0; }
相关文章推荐
- Algorithms—166.Fraction to Recurring Decimal
- VIEWGOOD(远古)中小学图书馆用户教育探究
- CF_148D_BagOfMice
- uwsgi启动并与django关联
- Qualcomm 如何修改lk 开机logo
- CodeForces 560C Gerald's Hexagon
- [笔记]遗传算法 genetic algorithm
- 【转】终极 Web 应用性能和压力测试工具 Gor
- 安装VNC(使用gonme桌面环境)
- django1.8 view(1):URLconf part1
- Mongoose操作schema时默认表名添加s以及解决
- goto,END
- Algorithm Description
- Google浏览器 隐身模式 -incognito
- google地图引入网页
- ubuntu14.04重装sogou
- ubuntu14.04重装sogou 分类: 软件插件学习 2015-08-04 15:00 7人阅读 评论(0) 收藏
- django学习笔记之开发功能之前的准备
- .bat文件中start, pause,goto以及rem的用法
- Algorithms—199.Binary Tree Right Side View