uva-201

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<math.h>
#define MAX_SIZE 9+9+1
void GETS_MARK(int ROW[][MAX_SIZE],int LINE[][MAX_SIZE]);
void CALCULATE(int ROW[][MAX_SIZE],int LINE[][MAX_SIZE],int COUNT[],int SIZE);
void OUTPUT(int SIZE,int COUNT[]);
int CALCULATE_1(int ROW[][MAX_SIZE],int LINE[][MAX_SIZE],int i,int j,int count);
int CALCULATE_2(int ROW[][MAX_SIZE],int LINE[][MAX_SIZE],int i,int j,int count);
int CALCULATE_3(int ROW[][MAX_SIZE],int LINE[][MAX_SIZE],int i,int j,int count);
int CALCULATE_4(int ROW[][MAX_SIZE],int LINE[][MAX_SIZE],int i,int j,int count);
int main()
{
    int ROW[MAX_SIZE][MAX_SIZE],LINE[MAX_SIZE][MAX_SIZE],COUNT[MAX_SIZE];
    int SIZE,i,j,count=0;
    char ch;
    while(scanf("%d",&SIZE)!=EOF)
    {
        memset(ROW,0,sizeof(ROW));
        memset(LINE,0,sizeof(LINE));
        memset(COUNT,0,sizeof(COUNT));
        GETS_MARK(ROW,LINE);
        CALCULATE(ROW,LINE,COUNT,SIZE);
        if(count!=0)
            printf("\n**********************************\n\n");
        printf("Problem #%d\n\n",++count);
        OUTPUT(SIZE,COUNT);
    }
     return 0;
}
void GETS_MARK(int ROW[][MAX_SIZE],int LINE[][MAX_SIZE])
{
    int i,j,k,N;
    char ch;
    scanf("%d",&N);getchar();
    for(k=1;k<=N;k++)
    {
        scanf("%c %d %d",&ch,&i,&j);getchar();
        if(ch=='H')LINE[j][i]=1;
        if(ch=='V')ROW[i][j]=1;
    }
}
void CALCULATE(int ROW[][MAX_SIZE],int LINE[][MAX_SIZE],int COUNT[],int SIZE)
{
    int i,j,count;
     for(i=1;i<SIZE;i++){
            for(j=1;j<SIZE;j++){
                for(count=1;count<SIZE;count++){
                    int UP_ROW_RIGHT = CALCULATE_1(ROW,LINE,i,j,count);
                    if(UP_ROW_RIGHT){
                        int UP_LINE_DOWN = CALCULATE_2(ROW,LINE,i,j,count);
                        if(UP_LINE_DOWN){
                            int DOWN_LINE_UP = CALCULATE_3(ROW,LINE,i+count-1,j+count,count);
                            if(DOWN_LINE_UP){
                                int DOWN_ROW_LEFT = CALCULATE_4(ROW,LINE,i+count,j+count-1,count);
                                if(DOWN_ROW_LEFT){
                                    COUNT[count]++;
                                }
                            }
                        }
                    }
                }
            }
        }
}
int CALCULATE_1(int ROW[][MAX_SIZE],int LINE[][MAX_SIZE],int i,int j,int count)
{
    int MARK=0,END = j+count;
    while(j<END)
    {
        if(ROW[i][j]==1)MARK++;j++;
    }
    if(MARK==count)return 1;
    return 0;
}
int CALCULATE_2(int ROW[][MAX_SIZE],int LINE[][MAX_SIZE],int i,int j,int count)
{
    int MARK=0,END = i+count;
    while(i<END)
    {
        if(LINE[i][j]==1)MARK++;i++;
    }
    if(MARK==count)return 1;
    return 0;
}
int CALCULATE_3(int ROW[][MAX_SIZE],int LINE[][MAX_SIZE],int i,int j,int count)
{
    int MARK=0,END = i-count;
    while(i>END)
    {
        if(LINE[i][j]==1)MARK++;i--;
    }
    if(MARK==count)return 1;
    return 0;
}
int CALCULATE_4(int ROW[][MAX_SIZE],int LINE[][MAX_SIZE],int i,int j,int count)
{
    int MARK=0,END = j-count;
    while(j>END)
    {
        if(ROW[i][j]==1)MARK++;j--;
    }
    if(MARK==count)return 1;
    return 0;
}
void OUTPUT(int SIZE,int COUNT[])
{
    int MARK=0;
    int i;
    for(i=1;i<SIZE;i++)
    {
        if(COUNT[i]!=0){printf("%d square (s) of size %d\n",COUNT[i],i);MARK=1;}
    }
    if(MARK==0)printf("No completed squares can be found.\n");
}