mirror of
https://github.com/Kiritow/OJ-Problems-Source.git
synced 2024-03-22 13:11:29 +08:00
46 lines
1015 B
C++
46 lines
1015 B
C++
|
#include<iostream>
|
||
|
using namespace std;
|
||
|
char mp[60][60];
|
||
|
int num;
|
||
|
void bfs(int x,int y)
|
||
|
{
|
||
|
if(x<0||x>51||y<0||y>51) return;
|
||
|
if('*'==mp[x][y]) return;
|
||
|
mp[x][y]='*';
|
||
|
bfs(x-1,y);
|
||
|
bfs(x,y-1); bfs(x,y+1);
|
||
|
bfs(x+1,y);
|
||
|
}
|
||
|
bool readin()
|
||
|
{
|
||
|
bool flag=1;
|
||
|
int i,j,n;
|
||
|
char temp;
|
||
|
for(i=0;i<=51;i++)
|
||
|
for(j=0;j<=51;j++)
|
||
|
mp[i][j]=' ';
|
||
|
if(scanf("%c",&temp)==EOF) return 0;
|
||
|
else mp[1][1]=temp;
|
||
|
for(j=2;scanf("%c",&temp)&&temp!=10;mp[1][j++]=temp);
|
||
|
for(n=2;j!=1;n++)
|
||
|
for(j=1;scanf("%c",&temp)&&temp!=10;mp[n][j++]=temp);
|
||
|
return 1;
|
||
|
}
|
||
|
int main()
|
||
|
{
|
||
|
int i,j,k,n;
|
||
|
char temp;
|
||
|
while(readin())
|
||
|
{
|
||
|
for(num=0,i=0;i<=51;i++)
|
||
|
for(j=0;j<=51;j++)
|
||
|
if(' '==mp[i][j])
|
||
|
{
|
||
|
num++;
|
||
|
bfs(i,j);
|
||
|
}
|
||
|
printf("%c\n",num==2?'A':'C');
|
||
|
}
|
||
|
return 0;
|
||
|
}
|