Problem hidden on 2014-07-22 02:57:10 by Mitch Schwartz
JCHOC - Count Chocolates
Julie likes chocolates.Jerry is too smart ,He does not want to give julie any of the chocolates that's why instead of giving chocolates he gives a code to julie .Now it is the task of julie to find how much chocolates jerry has left for her.
Code cosists of 0 and 1 and No. of chocolates are the no. of bits which are 1 in binary representation of data.
Constraints:
1<=t<=10000000
1<=n<=256
Input
3
1
2
3
Output
1
1
2
hide comments
|
siddharth jain:
2014-07-28 06:26:46
when will be the submission to this problem be allowed?
|
|
Mitch Schwartz:
2014-07-22 02:56:27
Aside from that issue, it is a trivial task, hidden. |
|
[Lakshman]:
2014-07-21 15:26:41
@Ashish Kumar Only publish the problem when it is ready. If done Please allow submission. |
|
Shailendra Verma:
2014-07-21 11:53:34
Getting error , problem can't be tested |
| Added by: | Ashish Kumar |
| Date: | 2014-07-21 |
| Time limit: | 2s |
| Source limit: | 50000B |
| Memory limit: | 1536MB |
| Cluster: | Cube (Intel G860) |
| Languages: | All except: ASM64 |
RSS