#include<stdio.h>
int main()
{
char a[][14]={"#############","#GG.GGG#GGG.#","###.#G#G#G#G#","#.......#..G#","#G#.###.#G#G#","#GG.GGG.#.GG#","#G#.#G#.#.###","##G...G.....#","#G#.#G###.#G#","#...G#GGG.GG#","#G#.#G#G#.#G#","#GG.GGG#G.GG#","#############"};
int i,j,sum,map=0,x,y,p,q,m=13,n=13;
//地图由n行m列组成
for(i=0;i<n;i++)
for(j=0;j<m;j++)
{
//如果是空地,可以安放炸弹
if(a[i][j]=='.')
{
sum=0; //统计消灭敌人的数量
//向上统计可以消灭敌人的数量
x=i; y=j;
while(a[x][y]!='#')
{
if(a[x][y]=='G')
sum++;
x--;
}
//向下统计可以消灭敌人的数量
x=i; y=j;
while(a[x][y]!='#')
{
if(a[x][y]=='G')
sum++;
x++;
}
//向左统计可以消灭敌人的数量
x=i; y=j;
while(a[x][y]!='#')
{
if(a[x][y]=='G')
sum++;
y--;
}
//向右统计可以消灭敌人的数量
x=i; y=j;
while(a[x][y]!='#')
{
if(a[x][y]=='G')
sum++;
y++;
}
if(sum>map)
{
map=sum;
p=i;
q=j;
}
}
}
printf("将炸弹安放到(%d,%d),最多可消灭%d个敌人\n",p,q,map);
}