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
|
vunnamtej:
2017-03-09 15:47:19
little math |
|
herkeyrefugee:
2017-01-05 15:49:13
be careful with the input all inputs are taken before the outputting the answer to previous cases |
|
suvro_datta:
2016-09-15 17:58:15
try to get logic in string+recursion
|
|
tni_mdixit:
2016-08-07 15:38:51
m stuck here in this...help someone please
|
|
agarwalg271:
2016-08-06 21:46:37
easy tricky question ac in one go! feeling happy!!!
|
|
piyushbharti:
2016-07-31 06:21:51
binary as well as p&c both logics can be applied..... used p&c AC in 0.00
|
|
hwb_worwa:
2016-07-26 23:23:21
Love to recycle code. |
|
dwij28:
2016-03-07 08:11:54
Nice. One line in python. I love python. <3 |
|
prateek1985:
2016-02-27 21:44:45
ekdum jhakas!! |
|
lakshay_v06:
2016-01-24 19:18:48
After you get the logic.... use bitset to implement it. AC -> 0.00 |
| 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