UVA 10010-where ' s Waldorf?

#include <iostream> #include <cctype> #include <algorithm>using namespace Std;char a[55][55];string s [22];int t,m,n,k;int mx[] = {1, 1, 1, 0, 0,-1,-1, -1};int my[] = {1, 0,-1, 1,-1, 1, 0, -1};bool in (int x,int y) {re Turn x>=1&&x<=m&&y>=1&&y<=n;}    void GetLocation (string s) {int flag;                for (int i = 1, i <= m; i++) {for (int j = 1; J <= N; j + +) {if (a[i][j] = = ToLower (S[0])) {                    for (int k = 0; k < 8; k++) {flag = 1;                    int T1 = I,t2 = j;                        for (int p = 1; p < s.length (); p++) {T1 + = Mx[k];                        T2 + = My[k];                            if (a[t1][t2]! = ToLower (s[p]) | |!in (T1,T2)) {flag = 0;                        Break }} if (flag) {cout << i << "" <<                        J << Endl;                    Return    }}}}}}int main () {cin >> T;        while (t--) {cin >> m >> N;        Cin.ignore ();                for (int i = 1; i<= m, i++) for (int j = 1; J <= N; j + +) {cin >> a[i][j];            A[I][J] = ToLower (A[i][j]);        } cin >> K;        Cin.ignore ();        for (int i = 0; i < K; i++) cin >> S[i];        for (int i = 0; i < K; i++) {getLocation (s[i]);    } if (t>0) cout << Endl; } return 0;}

UVA 10010-where ' s Waldorf?