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!
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.
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.
Output for sample input
Scenario #1: 1
Scenario #2: 11
Scenario #3: 21
Scenario #4: 1211
Scenario #5: 13211311123113112211
• 1 ≤ T ≤ 41
• 0 ≤ N ≤ 40
The score will be the quantity of characters the code has.
ans for n=40 is 82350 digits long..take care:)
Ok, 74 bytes solution with standard scoring is possible in Perl.
1. why is whitespace not counted?
Information on the bottom of the ranks site:
I got no points after submitting it...Why????
I didn't test extensively, but it's not only whitespace that isn't counted; it apparently uses a judge much like SIZECON but *before* a certain fix to the judge. So it seems altogether likely that the problem can be solved in 0 bytes in Bash, although I don't know the trickery involved. Having 0 as the top score could break the scoring system. And even if this issue is dealt with (e.g. by adding a 1 to the score), the problem is in some sense a duplicate of SIZECON. @problem setter: What is your intent? Are you aware of these issues?
Currently the judge don't count whitespace characters. Why? Or is it intended?Last edit: 2012-12-12 18:41:25
(Tjandra Satria Gunawan)(æ›¾æ¯…æ˜†):
Thanks for moving this problem to challenge section :-)