CareerCup

public class rock{
public static void main(String[] args){
int num;
for(int n:num)
{
if(n==0)
n=1
else n=0;
}
for(int i=num.length; i>=0; i--)
{
if(i==num.length)
num[i]=get(add(i,1));
num1[i]=get1(add(num[i],1);
else if(i!=0)
num[i]=get(add(num1[i+1],num[i]));
num1[i]=add1(add(num1[i+1], num[i]));
else
num1[i]=0;
num1[i]=add1(add(num1[i+1], num[i]));


}
}
static int add(int x, int y)
{
if(x=0 && y=0)
return 0;
if(x=1 && y=1)
return 10;
if(x=0 && y=1)
return 01;
if(x=1 && y=0)
return 01;

}
int static get1( int s)
{
switch(s)
case 00: return 0; break;
case 10: return 1; break;
case 01: return 0; break;
case 11: return 1; break;
}
int static get( int s)
{
switch(s)
case 00: return 0; break;
case 10: return 0; break;
case 01: return 1; break;
case 11: return 1; break;
}
}

public class rock{
public static void main(String[] args){
int num;
for(int n:num)
{
if(n==0)
n=1
else n=0;
}
for(int i=num.length; i>=0; i--)
{
if(i==num.length)
num[i]=get(add(i,1));
num1[i]=get1(add(num[i],1);
else if(i!=0)
num[i]=get(add(num1[i+1],num[i]));
num1[i]=add1(add(num1[i+1], num[i]));
else
num1[i]=0;
num1[i]=add1(add(num1[i+1], num[i]));


}
}
static int add(int x, int y)
{
if(x=0 && y=0)
return 0;
if(x=1 && y=1)
return 10;
if(x=0 && y=1)
return 01;
if(x=1 && y=0)
return 01;

}
static int get1( int s)
{
switch(s)
case 00: return 0; break;
case 10: return 1; break;
case 01: return 0; break;
case 11: return 1; break;
}
static int get( int s)
{
switch(s)
case 00: return 0; break;
case 10: return 0; break;
case 01: return 1; break;
case 11: return 1; break;
}
}

Either you people are not thinking simple or I have gone smarter than Deniss Ritchie lately:

int main()
    {
        // n = number whose 2's complement you wish to take
       int n;
       int twoComplementOfN = (~n) & 0x00000001;
       
       return twoComplementOfN ;
    }

just flip the bits and add 1

int cmpl(int n){
	return ~(n)+1;	
   }

int cmpl(int n){ 
        return 0 - n;
}