REVORDER(Shorten) in PYTH

[DebanjanC]

Hi I have been trying to solve REVORDER using python, as this is a shortening task hence I am trying to use various ways to solve this,but there are some problems that i am facing while trying to use a recursive approach:

def f(n):
    if n == 0:
        return
    a = input()
    f(n-1)
    print a
f(input())

This works fine in ideone (http://ideone.com/MtQIu) but in the judge gives me NZEC.I asked the problem setter to have a look,but unfortunately he is not able to figure out the problem, he had sent me the error file :

Unfortunately, I don't know why You get NZEC. Everything seems ok.
If You want, that's the error which is displayed:
Traceback (most recent call last):
  File "/sources/tested.py", line 8, in <module>
  File "/sources/tested.py", line 5, in f
  File "/sources/tested.py", line 5, in f
  File "/sources/tested.py", line 5, in f
  File "/sources/tested.py", line 5, in f
  File "/sources/tested.py", line 5, in f
  File "/sources/tested.py", line 5, in f
  File "/sources/tested.py", line 5, in f
  File "/sources/tested.py", line 5, in f
  File "/sources/tested.py", line 5, in f
  File "/sources/tested.py", line 5, in f
  File "/sources/tested.py", line 5, in f
  File "/sources/tested.py", line 5, in f
  File "/sources/tested.py", line 5, in f
  File "/sources/tested.py", line 5, in f
  File "/sources/tested.py", line 5, in f
  File "/sources/tested.py", line 5, in f
  File "/sources/tested.py", line 5, in f
  File "/sources/tested.py", line 5, in f
  File "/sources/tested.py", line 5, in f
  File "/sources/tested.py", line 5, in f
  File "/sources/tested.py", line 5, in f
  File "/sources/tested.py", line 5, in f

Does anybody know what is the problem ? I am very new to python hence I don't have much idea to interpret this result.

Regards,

[numerix]

As the relevant part of the traceback is missing (i.e. last line), I can only guess:
The standard recursionlimit of Python is set to 1000, which is also the max. number of testcases in REVORDER.
I checked your program with t = 1000 - it worked. I tried with t = 1001 - it gives NZEC because of max. recursion depth exceeded.
Solution: Avoid recursion or set recursionlimit to a higher value:

[bbone=Python,121]import sys
sys.setrecursionlimit(1200)[/bbone]

[DebanjanC]

Thank you numerix. I guess the problem setter is not pertaining with his own constraints ?!

[kokosek]

I am.
(at least I try to be )
Here's how You can check it in C/C++:
[bbone=C,128]#include

include

int main(void)
{
int t;
scanf("%d",&t);
assert(t<1001);
return 0;
}[/bbone]
If t>1000 result would be SIGABRT, if not WA.
(You can either see my last submission for the problem which got WA or submit it on Your own)

[DebanjanC]

I am.
(at least I try to be )
Here's how You can check it in C/C++:

If t>1000 result would be SIGABRT, if not WA.
(You can either see my last submission for the problem which got WA or submit it on Your own)

Hm like you are right. Do you read numerix answer ? He is just guessing since the last line is not available, could you please post the entire error ?

Also there is no need of simple return -1 when the condition fails.

[kokosek]

Yes, i read.
I just can't paste the entire error because it's so long that only part of it is available.

PS I know that return -1 is enough but assert would also work on other contests and I don't know if return -1 would.