VPL0_E - External Sequence

no tags 

 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.

hide comments
Bhavik: 2014-07-21 16:41:04

ans for n=40 is 82350 digits long..take care:)

Mitch Schwartz: 2013-02-04 05:17:01

Ok, 74 bytes solution with standard scoring is possible in Perl.

Aditya Pande: 2012-12-23 16:24:29

1. why is whitespace not counted?
2. why are there more than specified lines in the input file?

:D: 2012-12-14 10:08:57

Information on the bottom of the ranks site:

for a top score in any challenge: 3 points,
for any lower score in a challenge: (user's_score relative_to_the top_score) points.

So you probably got 12/613 (0.02) points :)

DINESH JANGID: 2012-12-14 10:00:35

I got no points after submitting it...Why????

Aditya Pande: 2012-12-14 05:08:35

woah 12 Bytes. you seam to have somehow exploited the spaces not being counted.

Whitespace should be restricted or spaces should be counted. A zero score on top is not what golfing is supposed to be. Then there will be only one language worth solving the problem in.

Mitch Schwartz: 2012-12-13 22:34:19

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?

And my Whitespace solution is way too slow, I have some doubt whether it can be sped up enough for the constraints. It's 781 bytes (I didn't try to reduce), and can print from 0 to 25 in under 1s, so e.g. 1000 byte source limit and reduced input constraints would prevent precomputation and allow it to pass.

I don't know, it seems very strangely designed to me.

Last edit: 2012-12-13 23:49:57
Aditya Pande: 2012-12-13 16:28:30

@problem setter
there are more lines in the input file than T specified following the T line
can you please fix that. I have got 2 WA
because of that 1 in RUBY, 1 in PERL

i have already got AC in RUBY so i am not doing it wrong
i can save few bytes if u check that and rejudge the submissions

Last edit: 2012-12-13 16:29:49
Robert Gerbicz: 2012-12-12 18:41:01

Currently the judge don't count whitespace characters. Why? Or is it intended?

Last edit: 2012-12-12 18:41:25
(Tjandra Satria Gunawan)(曾毅昆): 2012-12-12 15:59:01

Thanks for moving this problem to challenge section :-)

Added by:Venezuelan Programming League
Time limit:1s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ASM64
Resource:Own problem used for VPL0-Contest