Java Programming

Make a program that reads and writes a positive value in the decomposition of sums of powers of 2, in descending order. Consider that the reading is less than 2 ^ 31.

is not allowed to use methods of the Arrays class of java.lang package and Math.

example:

Value? 45
45 = 2 ^ 5 + 2 ^ 3 + 2 ^ 2 + 2 ^ 0

any ideas or tips? rly need this bros

programming on eclipse

>>1
>> 2011
progrsmming on eclipse
http://dis.4chan.org/read/prog/1321531728/1-40

AbstractLampOilFactorySellerProxy

in binary 1,10,100,1000,... represent the decimal numbers 1,2,4,8,...

so consider whether or not the value of 45&b is 0 or not for b = 1,2,4,8,...

this tells you whether or not the i'th bit is 0 or 1 for b = 2^i.


static String hurr(int durr, int derp) {
 return (durr)? hurr(durr>>1, derp+1) + ((durr&1)? " + 2 ^ " + derp : "") : "";
}

pubic static void main(String argv) {
 System.out.println(hurr(System.libc.atoi(argv[1],0)));
}

>>1,5
ENTERPRISE PROGRAMMERS

>>2
>1-40
>only has 5 replies

oh haxus, will you ever learn

First, generate all the partitions of a number. Then filter the results for just those which have powers of 2 in them. This should be reasonably fast for numbers less than 50.

>>4,5
answer
>>1
translate it to java

pubic