Describe AnEasyProblem/정진경 here
Source Code ¶
main(n,a,b){for(;a=b=scanf("%d",&n),n;printf("%d\n",n+a*b-b/2)){for(;a&~n;a*=2);for(;(b|a*b)&n;n+=b-a*b,b*=2);}}
// 164K 0MS C 112B
(define (mod a b)
(if (< a b)
a
(mod(- a b) b)
)
)
(define (quot a b)
(/ (- a (mod a b)) b)
)
(define (BitCount n)
(if (< n 1)
0
(+ (BitCount (quot n 2)) (mod n 2))
)
)
(define (SearchBitN n m)
(if (= n (BitCount m))
m
(SearchBitN n (+ m 1))
)
)
(define (AnEasyProblem n)
(SearchBitN (BitCount n) (+ n 1))
)
