迴圈
輸入地圖
判別其對擲點是否相同
是
輸出go forward
否
輸出keep defending
#include<iostream>
using namespace std;
int main()
{
int T, N, M;
int i, j;
int Map[11][11];
bool change;
while(cin >> T)
{
while(T--)
{
cin >> N >> M;
for(i = 0; i<N; i++)
for(j = 0; j<M; j++)
cin >> Map[i][j];
change = false;
for(i = 0; i<N; i++)
for(j = 0; j<M; j++)
if(Map[i][j] != Map[N-1-i][M - 1 - j])
{
change = true;
break;
}
if(!change)
cout << "go forward" << endl;
else
cout << "keep defending" << endl;
}
}
return 0;
}
留言列表