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
|
noju:
2012-04-21 08:56:51
why people try to show them as if they are the most intelligent.
|
|
Munkhtsogt.Ts:
2012-04-20 03:57:19
@Benjamin Like |
|
Benjamin Pinaya:
2012-04-20 00:40:17
Come on guy! If you say this is a tutorial problem just DON'T solve it! Solve something else! |
|
|
noju:
2012-04-19 22:49:30
not a tutorial but quite logical and simple ...
|
|
maaz:
2012-04-15 23:07:42
think in terms of binary no.s
|
|
avinash:
2012-04-13 19:52:46
very easy prob... :) |
|
Devil D:
2012-04-13 04:46:43
Not tutorial,, but ya easy enuf |
|
Zhouxing Shi:
2012-04-13 02:31:21
Don't say that. |
|
Siarhei Kulik:
2012-04-12 21:20:18
tutorial... |
| 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