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
|
Soma:
2014-06-19 20:47:42
really amazing...../ |
|
Gaurav Agrawal:
2014-04-11 21:10:09
can any1 explain the problem ? |
|
Piyush Nirmal:
2014-03-03 10:25:01
nice one...loved solving it. |
|
harsh:
2013-11-10 14:28:54
fresh one..:) |
|
P_Quantum:
2013-08-23 17:41:35
Easy one..!! same as MAY99_2.. :) |
|
@Shish:
2013-08-13 19:52:36
Yeahh..green in 1st attempt |
|
hiddenman:
2013-08-11 16:42:50
same as MAY99_2....:)
|
|
Rishabh Dugar:
2013-07-16 02:51:33
nice branie problem..amazing constraints |
|
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. |
| 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