内部赛3 B Black and white painti…
来源:互联网 发布:java 判断日期相等 编辑:程序博客网 时间:2024/06/03 15:55
Time Limit: 1000MS Memory limit:65536K
题目描述
You are visitingthe Centre Pompidou which contains a lot of modern paintings. Inparticular you notice one painting which consists solely of blackand white squares, arranged in rows and columns like in a chessboard (no two adjacent squares have the same colour). By the way,the artist did not use the tool of problem A to create thepainting.
Since you are bored, you wonder howmany
输入
The inputcontains several test cases. Each test case consists of one linewith three integers
The last test case is followed by a linecontaining three zeros.
输出
For each testcase, print the number of chess boards embedded within the givenpainting.
示例输入
8 8 08 8 19 9 140000 39999 00 0 0
示例输出
012799700028
代码:
#include<iostream>
#include <cstdio>
using namespace std;
int main()
{
}
- 内部赛3 B Black and white painti…
- 内部赛 3 D Deli Deli
- HDOJ 1312 Red and Black
-  
- DFS--Red and Black
- 内部赛3 F Frequent values
- PROCESS J000 And …
- ZZULI_SummerPractice(3) HDU 1…
-
- Why ASMLIB and why not? <转载…
- How to Disable and Turn Off UAC …
- Simulate and use real GPS in WM …
- How do I get default date and ti…
- HDOJ 1028 Ignatius and the Pri…
- HDOJ 2101 A + B Problem Too
- Problem 81 » Red and Black
- 集线器 交换机 路由器 网桥 …
- GSM900 and GSM1800 ARFCN Frequen…
- 卫哲的3+1产品法
- DOS命令大全系列四
- poj 1062 昂贵的聘礼
- poj 2253 Frogger
- poj 1125 Stockbroker Grapevine
- 内部赛3 B Black and white painti…
- 内部赛 3 D Deli Deli
- 内部赛3 F Frequent values
- poj 1789 Truck History
- poj 2485 Highways
- poj 3041 Asteroids
- poj 3020 Antenna Placement
- 显卡对决 NVIDIA GT 555M VS…
- 自己的集训队生活