CF560C Gerald's Hexagon 六边形能切成多少正三角形
来源:互联网 发布:红色网络教育家园 编辑:程序博客网 时间:2024/05/29 11:02
http://codeforces.com/contest/560/problem/C
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:
分析:
把六边形补全成正三角形,正三角减去补上的三角形
边长为x三角形包含x*x个小三角
#include <bits/stdc++.h>using namespace std;int p(int x){return x*x;}int main(){ int n,ans,a[10]; for(int i=0;i<6;i++) scanf("%d",&a[i]); printf("%d\n",p(a[0]+a[1]+a[2])-p(a[0])-p(a[2])-p(a[4])); return 0;}
方法二:
计算总面积,除以每个小三角形的面积
- CF560C Gerald's Hexagon 六边形能切成多少正三角形
- Codeforces Round #313 (Div. 2) C. Geralds Hexagon (六边形最多划分多少个正三角形)
- A. Gerald's Hexagon
- E - Gerald's Hexagon
- CF 560 Gerald's Hexagon
- codeforces559A--Gerald's Hexagon(计算几何)
- codeforces Gerald's Hexagon 找规律
- Codeforces 560C Gerald's Hexagon(几何)
- codeforces 560 C Gerald's Hexagon
- CodeForces#313 C. Gerald's Hexagon
- CodeForces 560C Gerald's Hexagon
- Codeforces Round 313- Gerald's Hexagon
- codeforces-559A-Gerald's Hexagon
- CodeForces 559A Gerald's Hexagon
- CodeForces 559A Gerald's Hexagon
- CodeForces 560C Gerald's Hexagon
- CodeForces - 560C Gerald's Hexagon
- CodeForces 560C Gerald's Hexagon
- 创建二维数组
- dom解析
- 绝密原型档案:看看专业产品经理的原型是什麽
- Thinking in Java 笔记(第三章 控制程序流程)
- Hdu 5301 Buildings 2015 Multi-University Training Contest 2
- CF560C Gerald's Hexagon 六边形能切成多少正三角形
- 2015 Multi-University Training Contest 2 B Buildings(脑洞题)
- HELLOWIN程式---HELLOWIN.C
- HDU 1431 素数回文-暴力枚举
- 如何组装配置属于自己的台式机
- SAX解析XML文档
- Visual Studio 2013崩溃问题解决
- java常用的交互信息获取
- 计蒜客第6题---泥塑课