codeforces Gerald's Hexagon 找规律
2015-07-23 09:48
429 查看
点击打开链接
C. Gerald's Hexagon
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
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 test(s)
input
output
input
output
Note
This is what Gerald's hexagon looks like in the first sample:
And that's what it looks like in the second sample:
按照顺时针的方向给出一个内角都是120°的六边形,让你求此六边形能够分解成多少个边长为1的正三角形。
只要求出正六边形的面积然后和小正三角形一比就是答案,化简一下就是求正六边形面积,延长三条不相邻的边长,形成一个大的正三角形,然后减去形成的三个小正三角形即为所求。
C. Gerald's Hexagon
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
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 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:
And that's what it looks like in the second sample:
按照顺时针的方向给出一个内角都是120°的六边形,让你求此六边形能够分解成多少个边长为1的正三角形。
只要求出正六边形的面积然后和小正三角形一比就是答案,化简一下就是求正六边形面积,延长三条不相邻的边长,形成一个大的正三角形,然后减去形成的三个小正三角形即为所求。
//31 ms 0 KB #include<stdio.h> int s[1007]; using namespace std; int main() { for(int i=1;i<=6;i++) scanf("%d",&s[i]); int a=(s[1]+s[2]+s[3]); printf("%d\n",a*a-s[1]*s[1]-s[3]*s[3]-s[5]*s[5]); return 0; }
相关文章推荐
- Codeforces Round #313 (Div. 2)——C数学题——Gerald's Hexagon
- Codeforces Round #313 (Div. 2) C. Gerald's Hexagon
- django 1.8 官方文档翻译: 2-5-4 聚合 (初稿)
- 在Django的视图(View)外使用Session的方法
- codeforces559A--Gerald's Hexagon(计算几何)
- Codeforces Round #313 C. Gerald's Hexagon(放三角形)
- Codeforces Round #313 (Div. 1) A. Gerald's Hexagon
- Codeforces Round #313 (Div. 2) C. Gerald's Hexagon 数学
- codeforces 560C Gerald's Hexagon(找规律)
- Codeforces 559A Gerald's Hexagon 数三角形
- Codeforces Round #313 (Div. 1) A. Gerald's Hexagon 数学题
- PCB中加入logo
- 在Django的视图(View)外使用Session的方法
- Django的session中对于用户验证的支持
- 在Django的session中使用User对象的方法
- 详解Django框架中用户的登录和退出的实现
- 在Django中限制已登录用户的访问的方法
- Django中对通过测试的用户进行限制访问的方法
- 在Django中管理Users和Permissions以及Groups的方法
- 在Django的模板中使用认证数据的方法