4619 Warm up 2

#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
bool point1[][];
bool xf[][];
bool yf[][];

int tmp,ans;

//int d[4][2]={{0,-1},{0,1},{1,0},{-1,0}};
int dfs(int i,int j)
{
    if(i<||j<||i>||j>)return ;
    if(xf[i][j]&&point1[i+][j])
    {
        point1[i+][j]=false;
        tmp++;
        dfs(i+,j);
    }
    if(i>=&&point1[i-][j])
    {
        if(xf[i-][j])
        {
            point1[i-][j]=false;
            tmp++;
            dfs(i-,j);
        }
    }
    if(yf[i][j]&&point1[i][j+])
    {
        point1[i][j+]=false;
        tmp++;
        dfs(i,j+);
    }
    if(j>=&&point1[i][j-]&&yf[i][j-])
    {
        point1[i][j-]=false;
        tmp++;
        dfs(i,j-);
    }
    return ;
}

int main()
{
    int n,m;
    int i,j,k;
    int x,y;
    while(scanf("%d%d",&n,&m)!=EOF)
    {
        if(n==&&m==)break;
        memset(point1,false,sizeof(point1));
        memset(xf,false,sizeof(xf));
        memset(yf,false,sizeof(yf));
        for(i=; i<n; i++)
        {
            scanf("%d %d",&x,&y);
            point1[x][y]=point1[x+][y]=true;
            xf[x][y]=true;
        }
        for(i=;i<m;i++)
        {
            scanf("%d %d",&x,&y);
            point1[x][y]=point1[x][y+]=true;
            yf[x][y]=true;
        }
        ans=;
        for(i=;i<;i++)
        {
            for(j=;j<;j++)
            {
                tmp=;
                if(point1[i][j])
                    dfs(i,j);
                //if(tmp!=0)printf("@%d@\n",tmp);
                ans+=(tmp/);
            }
        }
        printf("%d\n",ans);
    }
    return ;
}

XXXXXX欲哭无泪的感觉！！！！！！！！！！！！！！！！！！！！！！！！！！