BITCNTR  Bit counts
You are a detective working with Scotland Yard on a highprofile bank robbery case. The robber has left some trails in the form of numbers, which you believe will give you important clues about the robbery. Since you are genius, you know that the clues can obtained by converting the number in binary and counting the number of 1's.
Input
The first line has a number t followed by t lines. Each line contains a number < 512.
Output
Output t lines corresponding to each number, such that each of the line contains the clue obtained from the number.
Example
Input: 5
2
3
1
0
11
Output: 1
2
1
0
3
Added by:  Siddharth Kothari 
Date:  20110907 
Time limit:  0.222s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel Pentium G860 3GHz) 
Languages:  All except: SCM chicken 
Resource:  Own 
hide comments
(Tjandra Satria Gunawan)(æ›¾æ¯…æ˜†):
20130710 16:35:54
Seems that if BF code length is too long it'll increase memory usage and slow down the running time. Before I submit my code, I predict that my code will be 0.00s (Because I hardcoded all possible answer and just simply print the answer to stdout) and using 1.6M mem usage (because I only use max 5 BF cell on this problem). But in fact it's not like that.. My code run in 0.36s and using 2.5M memory usage.. Seems that the running time of (preprocess) on bff interpreter is also counted too.. and mem usage is not only BF cell used but also compiled BF code length, just like my own BF interpreter used on BFK_AUTO problem. 

Rocker3011:
20130126 23:48:13
very simple bitmask problem :D 

Paul Draper:
20121119 23:18:49
That is, a number satisfying 0<= number < 512 