HLP_RAMS - Topper Rama Rao
Rama Rao is the topper of his branch. One of his friends was jealous of it. So, he poses a question to test Rama Rao and is as follows:
For a given n, find the number of even and odd numbers among the set, { nC0, nC1 ... nCn }.
Rama Rao was having hard time solving it. He hopes you can help him.
Input
First line contains t (1 ≤ t ≤ 105), the number of test cases. Next t lines contain one integer per line, denoting n (0 ≤ n ≤ 1012).
Output
For each test case, output two space separated integers specifying the number of even numbers and odd numbers respectively.
Example
Input: 2 3 4 Output: 0 4 3 2
Explanation:
for 3, values are: 1 3 3 1. All are odd. Hence 0 4.
for 4, values are: 1 4 6 4 1. Hence 3 2.
hide comments
|
Apoorv Jindal:
2014-03-08 14:41:43
@nitish rao I guess the CHALLENGE section will suit this problem better as the fun is really only in its implementation. The algorithm is either trivial or readily available on the net.Consider moving it to the CHALLENGE section. A strict source limit maybe 80-100 B and a strict time limit would make this problem fun to solve. Please, consider moving it to CHALLENGE section. :) |
|
Bhavik:
2014-03-07 14:17:54
once again nice way of presenting the problem:) |
| Added by: | nitish rao |
| Date: | 2014-03-06 |
| Time limit: | 1s |
| Source limit: | 50000B |
| Memory limit: | 1536MB |
| Cluster: | Cube (Intel G860) |
| Languages: | All except: ASM64 |
| Resource: | My own Problem |
RSS