Balloons

Balloons

Num : 3 Time Limit : 1000ms Memory Limit : 65536K

description

Both Saya and Kudo like balloons. One day, they heard that in the central park, there will be thousands of people fly balloons to pattern a big image. They were very interested about this event, and also curious about the image. Since there are too many balloons, it is very hard for them to compute anything they need. Can you help them? You can assume that the image is an N*N matrix, while each element can be either balloons or blank. Suppose element A and element B are both balloons. They are connected if: i) They are adjacent; ii) There is a list of element C1, C2, … , Cn, while A and C1 are connected, C1 and C2 are connected …Cn and B are connected. And a connected block means that every pair of elements in the block is connected, while any element in the block is not connected with any element out of the block. To Saya, element A（xa,ya) and B(xb,yb) is adjacent if |xa-xb|+|ya-yb|<=1 ; But to Kudo, element A（xa,ya) and element B(xb,yb) is adjacent if |xa-xb|<=1 and |ya-yb|<=1; They want to know that there’s how many connected blocks with there own definition of adjacent?

input

The input consists of several test cases. The first line of input in each test case contains one integer N (0 < N ≤ 100), which represents the size of the matrix. Each of the next N lines contains a string whose length is N, represents the elements of the matrix. The string only consists of 0 and 1, while 0 represents a block and 1represents balloons. The last case is followed by a line containing one zero.

output

For each case, print the case number (1, 2 …) and the connected block’s numbers with Saya and Kudo’s definition. Your output format should imitate the sample output. Print a blank line after each test case.

sample_input

5 11001 00100 11111 11010 10010 0

sample_output

Case 1: 3 2

hint

source

代码如下： #include <iostream> #include <cstring> #include <cstdio> using namespace std; char data1[102][102]; char data2[102][102]; int f1x[4]={1,-1,0,0}; int f1y[4]={0,0,1,-1}; int f2x[8]={1,1,1,-1,-1,-1,0,0}; int f2y[8]={0,-1,1,0,-1,1,1,-1}; int n; void find1(int x,int y) { if(x<0||x>n-1||y<0||y>n-1) return ; if(data1[x][y]=='0') return ; data1[x][y]='0'; int xx=0,yy=0; for(int m=0;m<4;m++) { xx=x+f1x[m]; yy=y+f1y[m]; find1(xx,yy); } } void find2(int x,int y) { if(x<0||x>n-1||y<0||y>n-1) return ; if(data2[x][y]=='0') return ; data2[x][y]='0'; int xx=0,yy=0; for(int m=0;m<8;m++) { xx=x+f2x[m]; yy=y+f2y[m]; find2(xx,yy); } } int main() { int k=1; while(scanf("%d",&n)!=EOF) { if(n==0) break; for(int i=0;i<n;i++) { scanf("%s",data1[i]); strcpy(data2[i],data1[i]); } int ans1=0,ans2=0; for(int i=0;i<n;i++) { for(int j=0;j<n;j++) { if(data1[i][j]=='1') { find1(i,j); ans1++; } } } for(int i=0;i<n;i++) { for(int j=0;j<n;j++) { if(data2[i][j]=='1') { find2(i,j); ans2++; } } } printf("Case %d: %d %d\n",k,ans1,ans2); printf("\n"); k++; } //cout << "Hello world!" << endl; return 0; }