Codeforces Round #313 (Div. 1) A. Gerald's Hexagon
来源:互联网 发布:pic单片机控制板多少钱 编辑:程序博客网 时间:2024/05/16 23:59
Gerald's Hexagon
Problem's Link: http://codeforces.com/contest/559/problem/A
Mean:
按顺时针顺序给出一个六边形的各边长(且保证每个内角都是120度),求能够分解成多少个边长为1的小正三角形。
analyse:
由于每个内角都是120度,那么把三条边延长相交,一定能够得到一个正三角形。
求出正三角形的面积S1和补上的小三角形的面积S2,则answer=S1-S2.
这里不是真正意义上求正三角形的面积,而是直接求内部可以包含多少个边长为1的小正三角形。
设正三角形边长为L,则内部可包含L*L个边长为1的小正三角形。
[以下图片为外链引用,并无实意,请忽略]
Time complexity: O(1)
Source code:
/*
* this code is made by crazyacking
* Verdict: Accepted
* Submission Date: 2015-07-23-08.20
* Time: 0MS
* Memory: 137KB
*/
#include <queue>
#include <cstdio>
#include <set>
#include <string>
#include <stack>
#include <cmath>
#include <climits>
#include <map>
#include <cstdlib>
#include <iostream>
#include <vector>
#include <algorithm>
#include <cstring>
#define LL long long
#define ULL unsigned long long
using namespace std;
int a, b, c, d, e, f;
int main()
{
scanf( "%d%d%d%d%d%d", &a, &b, &c, &d, &e, &f );
int t = a + b + f;
cout << t*t - b*b - d*d - f*f << endl;
return 0;
}
* this code is made by crazyacking
* Verdict: Accepted
* Submission Date: 2015-07-23-08.20
* Time: 0MS
* Memory: 137KB
*/
#include <queue>
#include <cstdio>
#include <set>
#include <string>
#include <stack>
#include <cmath>
#include <climits>
#include <map>
#include <cstdlib>
#include <iostream>
#include <vector>
#include <algorithm>
#include <cstring>
#define LL long long
#define ULL unsigned long long
using namespace std;
int a, b, c, d, e, f;
int main()
{
scanf( "%d%d%d%d%d%d", &a, &b, &c, &d, &e, &f );
int t = a + b + f;
cout << t*t - b*b - d*d - f*f << endl;
return 0;
}
0 0
- Codeforces Round #313 (Div. 1) A. Gerald's Hexagon
- Codeforces Round #313 (Div. 1) 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) 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) C. Gerald's Hexagon
- Codeforces Round #313 (Div. 2)--C. Gerald's Hexagon
- Codeforces Round 313- 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)-Gerald's Hexagon 找规律-几何规律-
- Codeforces Round #313 (Div. 2) 560C Gerald's Hexagon(脑洞)
- Codeforces Round #313 C. Gerald's Hexagon(放三角形)
- Codeforces Round #313 Gerald's Hexagon (数论)
- codeforces-559A-Gerald's Hexagon
- CodeForces 559A Gerald's Hexagon
- 2015 Multi-University Training Contest 1
- 2015 Multi-University Training Contest 1
- IEEE754浮点数表示,为什么偏移码是127?为什么偏移码范围是1~254?
- ACM中的浮点数精度处理
- Python学习心得
- Codeforces Round #313 (Div. 1) A. Gerald's Hexagon
- Codeforces Round #313 (Div. 1) B. Equivalent Strings
- impala的介绍以及与hbase的区别
- dp
- 2015 Multi-University Training Contest 2 1002 Buildings
- 2015 Multi-University Training Contest 2 1006 Friends
- dp
- Linux
- 实现字符串反转的函数