Programing Puzzles

BCS ao at pathlink.com
Fri Aug 8 13:42:17 PDT 2008


Reply to Benjamin,

> Reply to janderson,
> 
>> What are you trying to say?  I imagine your validating Koroskin
>> solution.
>> 
>> 10000000  == byte.min
>> 01111111  == byte.min - 1
>> =
>> 00000000  == is power of 2
>> -Joel
> byte.min < 0, all powers of 2 are gratter than zero
> 

OTOH my solution fails in the same case :(




More information about the Digitalmars-d-learn mailing list