VPL0_E - External Sequence
This problem is nearly impossible to solve! You are given no goals; you can only guess what the corresponding output is for each input. Good luck!
Input
The first line contains an integer T , which specifies the number of test cases. Then, will follow the descriptions of T test cases.
For each case you will receive an integer N , then, you must print the N -th sequence.
The input must be read from standard input.
Output
For each input case you must print the string "Scenario #i: " where i denotes the case you are analyzing (starting from 1) and the sequence as described above.
The output must be written to standard output.
Input
Output for sample input
5
0
1
2
3
9
Scenario #1: 1
Scenario #2: 11
Scenario #3: 21
Scenario #4: 1211
Scenario #5: 13211311123113112211
Constraints
• 1 ≤ T ≤ 41
• 0 ≤ N ≤ 40
The score will be the quantity of characters the code has.
hide comments
Mitch Schwartz:
2012-12-12 14:42:43
I think the task is too famous to be good for golfing in challenge section; it's golfed a lot elsewhere, although with different I/O requirements. 77 bytes in Perl is enough, probably less for someone better at Perl. |
|
Francky:
2012-12-12 14:42:43
+1 for challenge in shorting mode. ;-)
|
|
(Tjandra Satria Gunawan)(曾毅昆):
2012-12-12 14:42:43
@Venezuelan Programming League: Yes, I think this problem is too 'easy' or 'mysterious' for classical section. My suggestion is: it's better to put this problem in challenge section, with source length as the score, goal is to shorten the code. (This problem can be solved in 0.00s with <250B of C code).. Last edit: 2012-12-10 10:27:11 |
|
Venezuelan Programming League:
2012-12-12 14:42:43
If you consider that this task shouldn't be on classical section, let me know where to put it. |
Added by: | Venezuelan Programming League |
Date: | 2012-12-08 |
Time limit: | 1s |
Source limit: | 50000B |
Memory limit: | 1536MB |
Cluster: | Cube (Intel G860) |
Languages: | All except: ASM64 |
Resource: | Own problem used for VPL0-Contest |