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
Rishabh Dugar:
2013-07-16 02:51:33
nice branie problem..amazing constraints |
|
Rana Saha:
2013-07-02 22:41:06
Good one! AC at 1st try..! :) |
|
pika_pika:
2013-06-29 19:45:56
i had a strange problem.I solved MAY99_2 before this problem and got AC in python the first attempt.But now in C++ i had a lot of WA. I just ported the prev problem to this and again AC in 1st attempt. |
|
Code Geass:
2013-05-26 13:13:03
very nice problem... :) .. finally AC after so many mistakes.. :P
|
|
apsdehal:
2013-03-31 08:40:43
After this try similar but higher level version of this: MAY99_2 |
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 |