# from http://c...content-available-to-author-only...e.com/recipes/474088-tail-call-optimization-decorator/
import sys
sys .setrecursionlimit ( 10 ) # set low limit to demonstrate that there is no stack overflow (tail call version)
class TailRecurseException:
def __init__ ( self , args, kwargs) :
self .args = args
self .kwargs = kwargs
def tail_call_optimized( g) :
"""
This function decorates a function with tail call
optimization. It does this by throwing an exception
if it is it's own grandparent, and catching such
exceptions to fake the tail call optimization.
This function fails if the decorated
function recurses in a non-tail context.
"""
def func( *args, **kwargs) :
f = sys ._getframe( )
if f.f_back and f.f_back .f_back \
and f.f_back .f_back .f_code == f.f_code :
raise TailRecurseException( args, kwargs)
else :
while 1 :
try :
return g( *args, **kwargs)
except TailRecurseException, e:
args = e.args
kwargs = e.kwargs
func.__doc__ = g.__doc__
return func
@ tail_call_optimized
def countup( N, n= 0 ) :
print ( n)
if n < N:
countup( N, n + 1 )
n = int ( raw_input ( ) )
countup( n)
def countdown( n) :
if n != 0 :
countdown( n-1 )
print ( n)
countdown( n)
CiMgZnJvbSBodHRwOi8vYy4uLmNvbnRlbnQtYXZhaWxhYmxlLXRvLWF1dGhvci1vbmx5Li4uZS5jb20vcmVjaXBlcy80NzQwODgtdGFpbC1jYWxsLW9wdGltaXphdGlvbi1kZWNvcmF0b3IvCmltcG9ydCBzeXMKc3lzLnNldHJlY3Vyc2lvbmxpbWl0KDEwKSAjIHNldCBsb3cgbGltaXQgdG8gZGVtb25zdHJhdGUgdGhhdCB0aGVyZSBpcyBubyBzdGFjayBvdmVyZmxvdyAodGFpbCBjYWxsIHZlcnNpb24pCgpjbGFzcyBUYWlsUmVjdXJzZUV4Y2VwdGlvbjoKICBkZWYgX19pbml0X18oc2VsZiwgYXJncywga3dhcmdzKToKICAgIHNlbGYuYXJncyA9IGFyZ3MKICAgIHNlbGYua3dhcmdzID0ga3dhcmdzCgpkZWYgdGFpbF9jYWxsX29wdGltaXplZChnKToKICAiIiIKICBUaGlzIGZ1bmN0aW9uIGRlY29yYXRlcyBhIGZ1bmN0aW9uIHdpdGggdGFpbCBjYWxsCiAgb3B0aW1pemF0aW9uLiBJdCBkb2VzIHRoaXMgYnkgdGhyb3dpbmcgYW4gZXhjZXB0aW9uCiAgaWYgaXQgaXMgaXQncyBvd24gZ3JhbmRwYXJlbnQsIGFuZCBjYXRjaGluZyBzdWNoCiAgZXhjZXB0aW9ucyB0byBmYWtlIHRoZSB0YWlsIGNhbGwgb3B0aW1pemF0aW9uLgogIAogIFRoaXMgZnVuY3Rpb24gZmFpbHMgaWYgdGhlIGRlY29yYXRlZAogIGZ1bmN0aW9uIHJlY3Vyc2VzIGluIGEgbm9uLXRhaWwgY29udGV4dC4KICAiIiIKICBkZWYgZnVuYygqYXJncywgKiprd2FyZ3MpOgogICAgZiA9IHN5cy5fZ2V0ZnJhbWUoKQogICAgaWYgZi5mX2JhY2sgYW5kIGYuZl9iYWNrLmZfYmFjayBcCiAgICAgICAgYW5kIGYuZl9iYWNrLmZfYmFjay5mX2NvZGUgPT0gZi5mX2NvZGU6CiAgICAgIHJhaXNlIFRhaWxSZWN1cnNlRXhjZXB0aW9uKGFyZ3MsIGt3YXJncykKICAgIGVsc2U6CiAgICAgIHdoaWxlIDE6CiAgICAgICAgdHJ5OgogICAgICAgICAgcmV0dXJuIGcoKmFyZ3MsICoqa3dhcmdzKQogICAgICAgIGV4Y2VwdCBUYWlsUmVjdXJzZUV4Y2VwdGlvbiwgZToKICAgICAgICAgIGFyZ3MgPSBlLmFyZ3MKICAgICAgICAgIGt3YXJncyA9IGUua3dhcmdzCiAgZnVuYy5fX2RvY19fID0gZy5fX2RvY19fCiAgcmV0dXJuIGZ1bmMKCkB0YWlsX2NhbGxfb3B0aW1pemVkCmRlZiBjb3VudHVwKE4sIG49MCk6CiAgICBwcmludChuKQogICAgaWYgbiA8IE46CiAgICAgICAgY291bnR1cChOLCBuICsgMSkKCm4gPSBpbnQocmF3X2lucHV0KCkpCmNvdW50dXAobikKCgpkZWYgY291bnRkb3duKG4pOgogICAgaWYgbiAhPSAwOgogICAgICAgIGNvdW50ZG93bihuLTEpCiAgICBwcmludChuKQoKY291bnRkb3duKG4p
stdout
0
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
stderr
Traceback (most recent call last):
File "prog.py", line 51, in <module>
countdown(n)
File "prog.py", line 48, in countdown
countdown(n-1)
File "prog.py", line 48, in countdown
countdown(n-1)
File "prog.py", line 48, in countdown
countdown(n-1)
File "prog.py", line 48, in countdown
countdown(n-1)
File "prog.py", line 48, in countdown
countdown(n-1)
File "prog.py", line 48, in countdown
countdown(n-1)
File "prog.py", line 48, in countdown
countdown(n-1)
File "prog.py", line 48, in countdown
countdown(n-1)
File "prog.py", line 48, in countdown
countdown(n-1)
RuntimeError: maximum recursion depth exceeded