-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathEuler_Problem-027.py
198 lines (182 loc) · 3.86 KB
/
Euler_Problem-027.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
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
#!/usr/bin/env python3
# transpiled with BefunCompile v1.3.0 (c) 2017
import gzip, base64
_g = ("Ah+LCAAAAAAABACT7+ZgAAEWhrc3HLsvO4gwPNg/ybdMn3Pr5JTbtzaw6N+zrdLIDTzdsEZC7O1J+fchYbp5u7vWeJTv57eacOaM9tJ+c/2badaPC7+9evb499nb/jdP"
+ "n78+e3bOlt11xXt/Trjqy8bQH8rIQBPwwSP1A/+Xn7trospKJW7tOXl6HaezJb/z5bZEo5k2+qc/GfEsXNv+duLbyHutZStuK3NXzPpnIb2O726MbncpTy7P58OfbUJr"
+ "/1nlO/uwasfpXDLIW60Y+/1lcOlnAfHXt1uPlpXu2x0dHrsq9ffr5FWRi9+c/v9HdE7H04CtjyVeHXWV2nX03RZv1szK83xfu2z5r4t66tQ9ztv01XXb349vLFoiw68a"
+ "nqlbFjTf6renlcrrRKmk4jWn7eXqz+u96E5PXTNbxG/TvBV2MW0Wq1Z7VrHNaVvIf1enN3bmpBSxpJmblqzaVTV31/J/fv6hOuGZvtevFf7NLr+6/K/v1aUrNP/80jFN"
+ "/33/iv/+r5mXmWtvRXLNStv/ftf7J09LZH7LB++14mefJl79+ejCzujw+q+LfLZaRcYzHtq6S3BDNSMDABHvrYXvAQAA")
g = base64.b64decode(_g)[1:]
for i in range(base64.b64decode(_g)[0]):
g = gzip.decompress(g)
g=list(g)
def gr(x,y):
if(x>=0 and y>=0 and x<600 and y<162):
return g[y*600 + x];
return 0;
def gw(x,y,v):
if(x>=0 and y>=0 and x<600 and y<162):
g[y*600 + 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,0,600)
gw(2,0,150)
gw(9,0,90000)
gw(3,0,2)
gw(4,0,1000)
gw(3,1,0)
return 1
def _1():
gw(tm(gr(3,0),gr(1,0)),(td(gr(3,0),gr(1,0)))+3,88)
sa(gr(3,0)+gr(3,0))
sa((1)if((gr(3,0)+gr(3,0))<gr(9,0))else(0))
return 2
def _2():
return (22)if(sp()!=0)else(3)
def _3():
sp();
return 4
def _4():
global t0
sa(gr(3,0)+1)
sa(gr(3,0)+1)
gw(3,0,gr(3,0)+1)
sa(tm(sp(),gr(1,0)))
v0=sp()
v1=sp()
sa(v0)
sa(v1)
sa(td(sp(),gr(1,0)))
sa(sp()+3)
v0=sp()
t0=gr(sp(),v0)
t0=t0-32
return 5
def _5():
global t0
return (6)if((t0)!=0)else(4)
def _6():
return (1)if(gr(9,0)>gr(3,0))else(7)
def _7():
gw(0,3,32)
gw(1,3,32)
gw(5,0,1-gr(4,0))
gw(6,0,2)
return 8
def _8():
gw(7,0,0)
sa((gr(5,0)*gr(7,0))+gr(6,0))
sa((1)if(((gr(5,0)*gr(7,0))+gr(6,0))>1)else(0))
return 9
def _9():
return (10)if(sp()!=0)else(21)
def _10():
global t0
sa(tm(sr(),gr(1,0)))
v0=sp()
v1=sp()
sa(v0)
sa(v1)
sa(td(sp(),gr(1,0)))
sa(sp()+3)
v0=sp()
t0=gr(sp(),v0)
t0=t0-32
return (20)if((t0)!=0)else(11)
def _11():
global t0
t0=gr(7,0)
return (19)if(gr(7,0)>gr(3,1))else(12)
def _12():
global t0
t0=gr(5,0)+2
gw(5,0,gr(5,0)+2)
t0=(1)if(t0>gr(4,0))else(0)
return (13)if((t0)!=0)else(18)
def _13():
gw(5,0,1-gr(4,0))
return 14
def _14():
global t0
sa(gr(6,0)+1)
sa(gr(6,0)+1)
gw(6,0,gr(6,0)+1)
sa(tm(sp(),gr(1,0)))
v0=sp()
v1=sp()
sa(v0)
sa(v1)
sa(td(sp(),gr(1,0)))
sa(sp()+3)
v0=sp()
t0=gr(sp(),v0)
t0=t0-32
return 15
def _15():
global t0
return (16)if((t0)!=0)else(14)
def _16():
return (17)if(gr(6,0)>gr(4,0))else(18)
def _17():
print(gr(1,1)*gr(2,1),end=" ",flush=True)
return 23
def _18():
global t0
t0=0
return 8
def _19():
global t0
gw(3,1,t0)
gw(1,1,gr(5,0))
gw(2,1,gr(6,0))
return 12
def _20():
sa((gr(7,0)+1)*(gr(7,0)+1))
gw(7,0,gr(7,0)+1)
sa(sp()+(gr(5,0)*gr(7,0))+gr(6,0))
sa((1)if(sr()>1)else(0))
return 9
def _21():
sp();
return 11
def _22():
sa(sr());
sa(32)
v0=sp()
v1=sp()
sa(v0)
sa(v1)
sa(tm(sr(),gr(1,0)))
v0=sp()
v1=sp()
sa(v0)
sa(v1)
sa(td(sp(),gr(1,0)))
sa(sp()+3)
v0=sp()
v1=sp()
gw(v1,v0,sp())
sa(sp()+gr(3,0))
sa((1)if(sr()<gr(9,0))else(0))
return 2
m=[_0,_1,_2,_3,_4,_5,_6,_7,_8,_9,_10,_11,_12,_13,_14,_15,_16,_17,_18,_19,_20,_21,_22]
c=0
while c<23:
c=m[c]()