Codeforces Round #133 (Div. 2) A题
来源:互联网 发布:百叶窗算法 编辑:程序博客网 时间:2024/05/16 04:45
分成几个平行四边形,再减去相邻平行四边形重合的面积。
代码就如下:
#include <iostream>
#include <cstdio>
using namespace std;
int main()
{
int a,b,c;
while(scanf("%d%d%d",&a,&b,&c)!=EOF)
{
int ans;
ans=a*b+b*c+c*a-(a+b+c)+1;
printf("%d\n",ans);
}
return 0;
}
- Codeforces Round #133 (Div. 2) A题
- Codeforces Round #181 (Div. 2) A题
- Codeforces Round #184 (Div. 2) A题
- Codeforces Round #172 (Div. 2) A题
- Codeforces Round #166 (Div. 2) A题
- Codeforces Round #132 (Div. 2) A题
- Codeforces Round #131 (Div. 2) A题
- Codeforces Round #137 (Div. 2) A题
- Codeforces Round #138 (Div. 2) A题
- Codeforces Round #147 (Div. 2) A题
- Codeforces Round #141 (Div. 2) A题
- Codeforces Round #143 (Div. 2) A题
- Codeforces Round #135 (Div. 2) A题
- Codeforces Round #163 (Div. 2) A题
- Codeforces Round #146 (Div. 2) A题
- Codeforces Round #111 (Div. 2) A题
- Codeforces Round #103 (Div. 2) A题
- Codeforces Round #101 (Div. 2) A题
- Process Monitor 简介
- POJ2828:Buy Tickets
- summer的java二货debug血泪史~
- python访问纯真IP数据库
- Qt设置按钮的图标
- Codeforces Round #133 (Div. 2) A题
- 简约而不简单的单例模式
- spring4使用时发生的错误
- 译到IOS 5.0的设备上时,出现很多
- Java .net c#
- ObjectiveC回调
- Qt mvc四
- java编程
- Oracle Java JDK 7 on Ubuntu Linux