UVa 201 测试样例，udebug测试数据都可以通过，还是WA

[gladinum]

https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=137题目链接
下面是我的代码：
#include <iostream>
#include <cstring>
using namespace std;

int main()
{
int kase = 0,n,m;
while(cin>>n>>m)
{
int A[12][12]={0},B[12][12]={0};
char ch[100]={0};
int num[100][2]={0};

for(int i=0; i<m; i++)
cin>>ch[i]>>num[i][0]>>num[i][1];
for(int j=0; j<m; j++)
{
if(ch[j] == 'H')
A[num[j][0]][num[j][1]] = 1;
if(ch[j] == 'V')
B[num[j][1]][num[j][0]] = 1;
}

int a=1;
int az[100]={0},found=0;
while(a<n)
{
for(int i=1; i<=n; i++)
{
for(int j=1; j<=n; j++)
{
int ok=1;
for(int k=0; k<a; k++)
{
if(!A[i][j+k]) ok=0;
if(!A[i+a][j+k]) ok=0;
if(!B[i+k][j]) ok=0;
if(!B[i+k][j+a]) ok=0;
}
if(ok)
{
found=1;
az[a]++;
}
}
}
a++;
}
if(kase)
cout<<endl<<"**********************************"<<endl;
if(!kase)
cout<<"Problem #"<<++kase<<endl<<endl;
else
cout<<endl<<"Problem #"<<++kase<<endl<<endl;
if(found)
{
for(int i=1; az[i]; i++)
cout<<az[i]<<" square (s) of size "<<i<<endl;
}
else
cout<<"No completed squares can be found."<<endl;
}

return 0;
}