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
FIrst line consists of integer N representing number of test cases
Next N lines consist of N integers (1 <= k <= 10^15)
Output
N lines each displaying corresponding k-th amusing number
Example
Input: 2 1 5 Output: 5 65
hide comments
|
manish_thakur:
2020-05-27 09:45:39
bit manipulation would do! |
|
vikash:
2019-10-15 12:15:11
Submitted the same solution in Java and scala.
|
|
nitin_uniyal21:
2019-07-13 06:50:53
I did it using binary tree..
|
|
tanav_shah1:
2019-05-15 00:03:26
Excellent question, brilliant concept ! |
|
raftar2097:
2018-10-30 08:28:27
nice go
|
|
salman3007:
2018-10-27 20:04:38
think binary!!! |
|
karan_yadav:
2018-06-29 17:56:24
Hints
|
|
sonorous:
2017-09-29 07:52:52
AC in one go!!! Very good question! |
|
vi1:
2017-07-16 13:15:39
Easy, but fun :) |
|
epsilonalpha:
2017-06-12 13:10:25
Stupid mistake in first submission, AC in second go using bits.
|
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 |