TSHOW1 - Amusing numbers
Amusing numbers are numbers consisting only of digits 5 and 6. Given an integer k, display the k-th amusing number.
Input
The first line consists of integer N representing number of test cases.
Next N lines consist of N integers (1 ≤ k ≤ 1015).
Output
N lines each displaying corresponding k-th amusing number.
Example
Input: 2 1 5 Output: 5 65
hide comments
|
sharath_111:
2016-01-22 21:52:57
nice question,my 9 th (superb logic linked with convertion into binary numbers) :)
|
|
Siddharth Singh:
2015-12-13 08:56:30
Solved Manku Word Before It, This Is Way More tricky Than That,
|
|
satyamsingh:
2015-12-05 22:32:14
easy question :D |
|
ROHIT Kumar:
2015-09-25 21:47:21
bunch of logic in doing this ..NICE one AC in 1 go :P
|
|
rahul_verma:
2015-09-25 16:13:48
nice problem...........AC in 1st go!!!!!!!
|
|
prakash_reddy:
2015-09-22 21:38:26
Loved solving this question... AC in one go :) |
|
impossible_1:
2015-09-21 13:56:23
it is easy one.
|
|
dhumketu:
2015-09-03 06:21:30
A BIT of logic :P !!
|
|
abhinav vinci:
2015-08-18 18:27:35
good question ,feeling satisfied after thinking for days for it....() |
|
atulshanbhag:
2015-08-15 18:34:15
simple stack question |
| Added by: | Pandian |
| Date: | 2012-04-10 |
| Time limit: | 1s |
| Source limit: | 50000B |
| Memory limit: | 1536MB |
| Cluster: | Cube (Intel G860) |
| Languages: | All |
| Resource: | AOL code contest |
RSS