-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathEuler_Problem-041.py
151 lines (142 loc) · 2.78 KB
/
Euler_Problem-041.py
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
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
#!/usr/bin/env python2
# transpiled with BefunCompile v1.3.0 (c) 2017
import sys
import zlib, base64
_g = ("AR+LCAAAAAAABACNksFqwzAMhl9FzZpLTYYktxmIYPYYOwSTm646+eSHn9zQkZaQTmAhWd8fS3bKz93gnZV/cue3xGrpC4DYAJPgTCbSURfKgaAOyiSBDGeYdvrzZRzp"
+ "vFM76CKykh4d2wjuKxTj65QaTcG3yrYupEtdM2w+52io7G6iB5cfPLYjraQrK2pszqNsf5wPEcjFa7qZxjuI+DxdGWVwdrwEuN0mNB79jjbI9+eaJPZ+OuyGMLLWvTFf"
+ "n+3DRZIishUP0O9gkMsCp1fxXZdOM/cQam+MgUQZZfcV8sLilaNfJG/ip2/8AoE9XKOoAgAA")
g = base64.b64decode(_g)[1:]
for i in range(ord(base64.b64decode(_g)[0])):
g = zlib.decompress(g, 16+zlib.MAX_WBITS)
g=list(map(ord, g))
def gr(x,y):
if(x>=0 and y>=0 and x<40 and y<17):
return g[y*40 + x];
return 0;
def gw(x,y,v):
if(x>=0 and y>=0 and x<40 and y<17):
g[y*40 + x]=v;
def td(a,b):
return ((0)if(b==0)else(a//b))
def tm(a,b):
return ((0)if(b==0)else(a%b))
s=[]
def sp():
global s
if (len(s) == 0):
return 0
return s.pop()
def sa(v):
global s
s.append(v)
def sr():
global s
if (len(s) == 0):
return 0
return s[-1]
def _0():
gw(1,2,7)
gw(0,1,0)
gw(0,0,49)
sp();
sa(1)
sa(1-gr(1,2))
return 1
def _1():
return (2)if(sp()!=0)else(3)
def _2():
sa(sr());
sa(0)
v0=sp()
v1=sp()
sa(v0)
sa(v1)
sa(1)
v0=sp()
v1=sp()
gw(v1,v0,sp())
sa(sr());
sa(sr()+49)
v0=sp()
v1=sp()
sa(v0)
sa(v1)
sa(0)
v0=sp()
v1=sp()
gw(v1,v0,sp())
sa(sp()+1)
sa(sr()-gr(1,2))
return 1
def _3():
gw(3,2,1)
sp();
return 4
def _4():
return (7)if(gr(3,2)>gr(gr(3,2),1))else(5)
def _5():
gw(gr(3,2),1,0)
return 6
def _6():
gw(3,2,gr(3,2)+1)
return 4
def _7():
return (17)if((gr(3,2)%2)!=0)else(8)
def _8():
gw(4,2,0)
return 9
def _9():
sa(gr(gr(4,2),0))
gw(gr(4,2),0,gr(gr(3,2),0))
gw(gr(3,2),0,sp())
gw(gr(3,2),1,gr(gr(3,2),1)+1)
gw(3,2,0)
gw(6,2,gr(1,2))
sa(0)
return 10
def _10():
sa(gr(6,2)-1)
gw(6,2,gr(6,2)-1)
sa(0)
v0=sp()
sa(gr(sp(),v0))
sa(sp()-48)
sa(sp()+sp());
return (16)if((gr(6,2))!=0)else(11)
def _11():
gw(0,2,3)
sa(sr());
sa(sr());
sa((1)if(sr()<=2)else(0))
v0=sp()
v1=sp()
sa(v0)
sa(v1)
sa(sp()%2);
sa(sp()+sp());
return (13)if(sp()!=0)else(12)
def _12():
sp();
sp();
return 6
def _13():
return (14)if(sr()>((gr(0,2)-2)*(gr(0,2)-2)))else(15)
def _14():
sa(tm(sr(),gr(0,2)))
gw(0,2,gr(0,2)+1)
return (13)if(sp()!=0)else(12)
def _15():
sp();
sys.stdout.write(str(sp())+" ")
sys.stdout.flush()
return 18
def _16():
sa(sp()*10)
return 10
def _17():
gw(4,2,gr(gr(3,2),1))
return 9
m=[_0,_1,_2,_3,_4,_5,_6,_7,_8,_9,_10,_11,_12,_13,_14,_15,_16,_17]
c=0
while c<18:
c=m[c]()