double F(int a, int b)
{
     int c, d = a ^ b;

     for (c = 0; d; c++)
          d &= d - 1;

     if ((c / 2) > 1)
          return 0.0;
     
     return 0.5;
}

int [] returnBinary(int mynum){
current_bit = 128;
int array[8];
int i = 0;
while(not at end of array)
{
     if(mynum >= current_bit){
     //set the  spot in the array at i  to 1
     current_bit = current_bit/2;
     mynum = mynum - current_bit;}
     else{
     // set the spot in this array at i to 0
     }
i++;
}

return array;

}

union MyByte
{ char TheByte;
  struct TheBits
  { bit0 : 1;
    bit1 : 1;
    bit2 : 1;
    bit3 : 1;
    bit4 : 1;
    bit5 : 1;
    bit6 : 1;
    bit7 : 1;
  }
};

float F(int a,int b,int N)
{
//xor the two numbers
int temp=a^b;

//if the temp equals 0, all bits are 0, no diff pair found
if(temp==0)
return 0;

int test=temp%2;
int counter=0;

//remove all left 0 until 1 found
while(test!=1)
{
temp=temp>>1;
test=temp%2;
counter++;
}

//if the value is equal to 3, one pair exists
if(temp==3)
{
if(fetch(a,counter+1)==fetch(b,cou  nter))
return 0.5;
else
{
return 0.0;
}
}else
{
return 0.0;
}
}

unsigned short fetch(unsigned short i,unsigned short j)
{
unsigned short temp = i;
unsigned short t = 0;

while(temp>0)
{
if(j==t)
return temp % 2;
t++;
temp/=2;
}

return 0;

}