CodeForces - 560C Gerald's Hexagon
2016-07-23 18:56
393 查看
题目大意:给出六边型六条边的长度,计算六边型内的小三角形有几个。
解题思路:找规律。补成大三角形,用大三角形内的小三角形总数(连续三边之和的平方)减去补上的三角形(补的边长的平方)
解题思路:找规律。补成大三角形,用大三角形内的小三角形总数(连续三边之和的平方)减去补上的三角形(补的边长的平方)
#include<iostream> #include<cstdio> #include<cstdlib> #include<cstring> #include<cmath> #include<ctype.h> using namespace std; int a[10]; int main() { int sum = 0; for (int i = 0; i < 6; i++) scanf("%d", &a[i]); sum = a[0] + a[1] + a[2]; sum = sum * sum - a[0] * a[0] - a[2] * a[2] - a[4] * a[4]; printf("%d\n", sum); return 0; }
相关文章推荐
- Codeforces Round #197 (Div. 2)
- Codeforces Round #198 (Div. 1)
- Codeforces 405E Codeforces Round #238 (Div. 2)E
- Codeforces 407C Codeforces Round #239 (Div. 1)C
- CodeForces 449A - Jzzhu and Chocolate
- CodeForces 449 B. Jzzhu and Cities
- codeforces 618C. Constellation
- Codeforces Round #349 (Div. 2) - C
- Codeforces Round #361 (Div. 2)
- 7.13Codeforces Round #360 (Div. 2)
- Codeforces Round #363 (Div. 2)
- Codeforces Round #265 (Div. 2)
- Codeforces #310 div2 C. Case of Matryoshkas
- 状态压缩DP codeforces 244 Problem C. The Brand New Function 和 codeforces 165 E. Compatible Numbers
- codeforces 16 Problem E fish
- Codeforces Round332 部分题解
- CodeForces 603A_Alternative Thinking (DP)
- CodeForces 602B_Approximating a Constant Range_DP
- Codeforces round #247 for Div. 2
- Codeforces Round #246 (Div. 2)