| Problem ID | 1068 |
|---|---|
| Title | Give me the answer |
| Description | Farmer John commanded his cows to search for different sets of numbers that sum to a given number.
The cows use only numbers that are an integer power of 2. Here are the possible sets of numbers that
sum to 7:
1) 1+1+1+1+1+1+1
2) 1+1+1+1+1+2
3) 1+1+1+2+2
4) 1+1+1+4
5) 1+2+2+2
6) 1+2+4
Help FJ count all possible representations for a given integer N (1 <= N <= 1 ,000,000)
|
| Input | The first line of the input contains the number of test cases in the file. And t he first line of each case
contains one integer numbers n
|
| Output | For each test case, output a line with the ans % 1000000000. |
| Sample Input | 1 7 |
| Sample Output | 6 |
| Hint | |
| Last Modified | 2012-04-11 00:34:13 |
| Time Limit | 1 seconds |
| Memory Limit | 32 MB |
| Accepted Solutions | 1 |
| Submitted Solutions | 1 |
| Difficulty Factor | 0 |
Facebook