UVA - 201 Squares

代码如下：

#include <bits/stdc++.h>
using namespace std;
int main()
{
    int t=0,s,n;
    while(cin>>s)
    {
        if(t!=0) cout<<endl<<"**********************************"<<endl<<endl;
        int ans[11],H[21][21],V[21][21];
        memset(V,0,sizeof(V));memset(H,0,sizeof(H));memset(ans,0,sizeof(ans));
        cin>>n;
        for(int k=0;k<n;k++)
        {
            char s1[5];
            int i,j;
            cin>>s1>>i>>j;
            if(s1[0]=='H') H[i][j]=1;
            else V[j][i]=1;
        }
        for(int k=1;k<=s;k++)
        {
            for(int i=1;i<=s;i++)
            for(int j=1;j<=s;j++)
            {
                int flag=1;
                for(int h=j;h<j+k;h++)
                    if(!H[i][h] || !H[i+k][h]) flag=0;
                for(int h=i;h<i+k;h++)
                    if(!V[h][j] || !V[h][j+k]) flag=0;
                ans[k]+=flag;
            }
        }
        cout<<"Problem #"<<++t<<endl<<endl;
        bool flag=true;
        for(int i=1;i<=s;i++)
        {
            if(ans[i]>0)
            {
                flag=false;
                cout<<ans[i]<<" square (s) of size "<<i<<endl;
            }
        }
        if(flag) cout<<"No completed squares can be found."<<endl;
    }
    return 0;
}