UVA 155 - All Squares

/***
Md. Namzul Hasan
Shahjalal University of Science & Technology,Sylhet.
hasan08sust@gmail.com
***/
#include<bits/stdc++.h>
using namespace std ;
typedef long long ll ;
typedef int in ;
typedef unsigned long long ull ;
const double pi = 2*acos(0) ;
#define maxi 40000
#define pf printf
#define sc scanf
#define pb push_back
#define MEM(x,y) (memset((x),(y),sizeof(x)))
#define MIN(x,y) ((x) < (y) ? (x) : (y))
#define MAX(x,y) ((x) > (y) ? (x) : (y))
#define load(array,size)  for(int i=0 ; i<size ; i++) cin>>array[i]  ;
#define new_line  pf("\n")
#define clear_data(array) memset(array,0,sizeof(array))
#define highest_int 2147483647

int n,m ;
int ans =0 ;

void count_squre(int x,int y,int k)
{
    if(k==0)
        return  ;
    if(x-k<=n && x+k>=n && y-k<=m && y+k>=m)
        ans++ ;
    count_squre(x+k,y+k,k/2) ;
    count_squre(x-k,y+k,k/2) ;
    count_squre(x-k,y-k,k/2) ;
    count_squre(x+k,y-k,k/2) ;
}

int main()
{
    int k ;
    while(sc("%d %d %d",&k,&n,&m))
    {
        if(k==0 && n==0 && m==0)
            break ;
        ans =0 ;
        count_squre(1024,1024,k) ;
        pf("%3d\n",ans) ;

    }
    return 0;
}