【打CF,学算法——三星级】Codeforces Round #313 (Div. 2) C. Gerald's Hexagon
来源:互联网 发布:知乎 贫困生 人肉 编辑:程序博客网 时间:2024/05/16 15:44
【CF简介】
提交链接: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 integersa1, a2, a3, a4, a5 anda6 (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
解题:
画着画着发现,每一个六边形可以用相邻两条边构成的平行四边形分割,有些情况恰可以分割,有些不可,中间存在一个三角形。不可以的是,相隔2条的边的边长之差不为0。然后根据这个差,就可以算出中间还有几个未分割的三角形。
代码:
#include <iostream>#include <algorithm>#include <cstdio>using namespace std;int main(){ int a,b,c,d,e,f,sum,ans; sum=ans=0; scanf("%d%d%d%d%d%d",&a,&b,&c,&d,&e,&f); ans+=2*(a*b+c*d+e*f); sum=abs(a-d); sum=sum*sum; ans+=sum; printf("%d\n",ans); return 0;}
- 【打CF,学算法——三星级】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)--C. Gerald's Hexagon
- 【打CF,学算法——二星级】Codeforces Round #313 (Div. 2) B. Gerald is into Art(水题)
- 【打CF,学算法——三星级】Codeforces 9C Hexadecimal's Numbers (解法汇总)
- Codeforces Round #313 (Div. 2) Gerald's Hexagon
- Codeforces Round #313 (Div. 2) Gerald's Hexagon
- Codeforces Round #313 (Div. 2) C. Gerald's Hexagon(补大三角形)
- Codeforces Round #313 (Div. 2) 560C Gerald's Hexagon(脑洞)
- Codeforces Round #313 (Div. 1) Gerald's Hexagon
- Codeforces Round #313 (Div. 1) A. Gerald's Hexagon
- 【打CF,学算法——三星级】CodeForces 689C Mike and Chocolate Thieves (二分)
- 【打CF,学算法——三星级】CodeForces 645C Enduring Exodus (二分+贪心)
- 【打CF,学算法——三星级】CodeForces 701C They Are Everywhere
- Codeforces Round #313 C. Gerald's Hexagon(放三角形)
- Div和Span的区别
- bg配置问题解决
- 【从零开始学NGUI 】 (四)Slider
- 第5章 图论算法与模型(更新中)
- Python执行Linux系统命令的4种方法
- 【打CF,学算法——三星级】Codeforces Round #313 (Div. 2) C. Gerald's Hexagon
- 在Visual studi C#的“///”注释内容生成XML文档
- acm解题报告 HDU 2141 Can you find it?
- GDB命令
- 关于Blocking IO, Non-Blocking IO 和 Asynchronous I/O的理解
- 使用nRF51822/nRF51422创建一个简单的BLE应用 ---入门实例手册(中文)之一
- 关于nginx的Transfer-Encoding: chunked
- 与阳光相拥
- Android ActionBar完全解析,使用官方推荐的最佳导航栏(下)