Codeforces Round #313 (Div. 2) C. Gerald's Hexagon 几何
来源:互联网 发布:淘宝开店虚拟产品 编辑:程序博客网 时间:2024/06/05 06:47
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.
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.
Print a single integer — the number of triangles with the sides of one 1 centimeter, into which the hexagon is split.
1 1 1 1 1 1
6
1 2 1 2 1 2
13
This is what Gerald's hexagon looks like in the first sample:
And that's what it looks like in the second sample:
题意是,给个六角形的六条边,要求里面可以分割成几个三角形,六角形六个角都是120度。直接求总面积再除三角形面积就可以了。
如图面积为可由黄色的矩形减去四个三角形就可以了。
int main(){ while(S(a[0]) != EOF) { for(int i =1;i<=5;i++) S(a[i]); int s = (((a[5] + a[1] + 2 * a[0])) * (a[1] + a[2]) * 2.0 - a[1] * a[1] - a[2] * a[2] - a[4] * a[4] - a[5] * a[5])/2; printf("%d\n",s); } return 0;}
第二种方法,如图
- Codeforces Round #313 (Div. 2) C. Gerald's Hexagon 几何
- Codeforces Round #313 (Div. 2) C. Gerald's Hexagon
- Codeforces Round #313 (Div. 2) C Gerald's Hexagon 计数
- Codeforces Round #313 (Div. 2) C. Gerald's Hexagon
- Codeforces Round #313 (Div. 2)--C. Gerald's Hexagon
- Codeforces Round #313 (Div. 2)-Gerald's Hexagon 找规律-几何规律-
- Codeforces Round #313 (Div. 2) Gerald's Hexagon
- Codeforces Round #313 (Div. 2) Gerald's Hexagon
- 【打CF,学算法——三星级】Codeforces Round #313 (Div. 2) C. Gerald's Hexagon
- Codeforces Round #313 (Div. 2) C. Gerald's Hexagon(补大三角形)
- Codeforces Round #313 (Div. 2) 560C Gerald's Hexagon(脑洞)
- Codeforces 560C Gerald's Hexagon(几何)
- Codeforces Round #313 (Div. 1) Gerald's Hexagon
- Codeforces Round #313 (Div. 1) A. Gerald's Hexagon
- Codeforces Round #313 C. Gerald's Hexagon(放三角形)
- Codeforces Round 313- Gerald's Hexagon
- CodeForces#313 C. Gerald's Hexagon
- Codeforces 560C Gerald's Hexagon【计算几何】
- SQL Server查询分页
- 搭建开发板nfs文件系统
- JavaScript基础1:JavaScript 错误 - Throw、Try 和 Catch
- 辛弃疾 《青玉案》
- android--UI介绍(未更新完)
- Codeforces Round #313 (Div. 2) C. Gerald's Hexagon 几何
- 算法思想:枚举与剪枝
- Core Animations一些常用常忘的吧
- 135 、137、139端口等主要用途
- Linux下Patch的应用和制作方法
- C# 过滤html标签,保留要指定标签的做法
- [ISA]部署ISA防火墙策略的十六条守则
- c语言 求两个整数的最大公约数
- UIimageView 动画