UVA - 201 Squares

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
using namespace std;
int table[10][10];

//判断是否存在以table[x][y]为左上顶点、length为边长的正方形
int square(int x,int y,int length)
{
    int count=0;
    for(int i=0;i<length;i++){
        if(table[x][y+i]==1||table[x][y+i]==3)
            count++;
        if(table[x+i][y]>=2)
            count++;
        if(table[x+length][y+i]==1||table[x+length][y+i]==3)
            count++;
        if(table[x+i][y+length]>=2)
            count++;
    }
    return (count==4*length)?1:0;
}
int main()
{
    //freopen("input.txt","r",stdin);
    int dots,lines,Case=0;
    while(cin>>dots>>lines){
        Case++;
        int count[10],a,b,i,j,k;
        char c;
        memset(table,0,sizeof(table));
        memset(count,0,sizeof(count));
        for(i=0;i<lines;i++){
            cin>>c>>a>>b;
            if(c=='H')
                table[a][b]+=1;
            else
                table[b][a]+=2;
        }

        //遍历table[i][j]
        for(i=1;i<dots;i++){
            for(j=1;j<dots;j++){
                //正方形边长有min(dots-i,dots-j)种可能
                for(k=1;k<=min(dots-i,dots-j);k++){
                    if(square(i,j,k))
                        count[k]++;
                }
            }
        }
        if(Case!=1)
            cout<<endl<<"**********************************"<<endl<<endl;
        cout<<"Problem #"<<Case<<endl<<endl;
        int flag=1;
        for(i=1;i<dots;i++){
            if(count[i]){
                cout<<count[i]<<" square (s) of size "<<i<<endl;
                flag=0;
            }
        }
        if(flag)
            cout<<"No completed squares can be found."<<endl;
    }
    return 0;
}