Image Transformation

描述

The image stored on a computer can be represented as a matrix of pixels. In the RGB (Red-Green-Blue) color system, a pixel can be described as a triplex integer numbers. That is, the color of a pixel is in the format “r g b” where r, g and b are integers ranging from 0 to 255(inclusive) which represent the Red, Green and Blue level of that pixel.

Sometimes however, we may need a gray picture instead of a colorful one. One of the simplest way to transform a RGB picture into gray: for each pixel, we set the Red, Green and Blue level to a same value which is usually the average of the Red, Green and Blue level of that pixel (that is (r + g + b)/3, here we assume that the sum of r, g and b is always dividable by 3).

You decide to write a program to test the effectiveness of this method.

输入

The input contains multiple test cases!

Each test case begins with two integer numbers N and M (1 <= N, M <= 100) meaning the height and width of the picture, then three N * M matrices follow; respectively represent the Red, Green and Blue level of each pixel.

A line with N = 0 and M = 0 signals the end of the input, which should not be proceed.

输出

For each test case, output “Case #:” first. “#” is the number of the case, which starts from 1. Then output a matrix of N * M integers which describe the gray levels of the pixels in the resultant grayed picture. There should be N lines with M integers separated by a comma.
样例输入

2 2
1 4
6 9
2 5
7 10
3 6
8 11
2 3
0 1 2
3 4 2
0 1 2
3 4 3
0 1 2
3 4 4
0 0
样例输出
Case 1:
2,5
7,10
Case 2:
0,1,2
3,4,3
分析：模拟 矩阵相加除以三就行，也不用矩阵快速幂。
代码：
#include<bits/stdc++.h>
using namespace std;
int main()
{
int N,M,R[101][101],G[101][101],B[101][101];
int T=1;
while(scanf("%d%d",&N,&M),N!=0||M!=0)
{
for (int i=0;i<N;i++)
for (int j=0;j<M;j++)
{
scanf("%d",&R[i][j]);
}
for (int i=0;i<N;i++)
for (int j=0;j<M;j++)
{
scanf("%d",&G[i][j]);
}
for (int i=0;i<N;i++)
for (int j=0;j<M;j++)
{
scanf("%d",&B[i][j]);
}
cout<<“Case “<<T++<<”:”<<endl;
for (int i=0;i<N;i++)
{
for (int j=0;j<M;j++)
{
if (j) cout<<’,’;
cout<<(R[i][j]+G[i][j]+B[i][j])/3;
}
cout<<endl;
}
}
return 0;
}