Thursday, December 2, 2010

TJU - 1477 - binary numbers

problem statement

bits - binary presentation of N

Easily in this problem you have to find out the locations of 1's in the binary presentation of a number N.
I iterate from i=0 to 2^i <= 1000000 and each time check whether ( N & 2^i != 0 ) or not and print i if result is true.
1 << i
00000001
00000010
00000100
00001000
00010000
00100000
01000000
10000000
at
Labels:

No comments:

Post a Comment

Subscribe to: Post Comments (Atom)

USACO - Prime Palindromes

I just skimmed the problem statement and panicked of the high boundary of the input, but something inside told me don't worry everyth...

  • 11388 - GCD LCM - UVA
    Mathematics As you can see in the problem description, you have to find numbers a & b such that (a, b) = G and [a, b] = L and also it ...
  • USACO - Arithmetic Progressions
    Let's think about it, Have you noticed the small boundary of N & M, What can we do with this small boundary? Isn't producing al...
  • USACO - Prime Cryptarithm
    Prime Cryptarithm The following cryptarithm is a multiplication problem that can be solved by substituting digits from a specified set ...