-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmain.py
289 lines (278 loc) · 10.6 KB
/
main.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
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
import copy
import math
# 递归全排列
def Permutation(l, beg, endl, result):
if beg == endl - 1:
res = l[:]
result.append(res)
return
for i in range(beg, endl):
if l[i] in l[beg:i]:
continue
l[i], l[beg] = l[beg], l[i]
Permutation(l, beg+1, endl, result)
l[beg], l[i] = l[i], l[beg]
# 求一个正数的各位数字之和
def summary(num):
temp = num
summer = 0
while temp:
summer += temp % 10
temp = temp // 10
return summer
# 将一个数字镜像翻转并与原数字拼接在一起
def M(num):
if num < 0:
num = -1 * num
num = list(str(num))
temp = copy.deepcopy(num)
for enum in range(len(temp)):
num.insert(len(num), temp[len(temp) - enum - 1])
return -1*int(''.join(num))
else:
num = list(str(num))
temp = copy.deepcopy(num)
for enum in range(len(temp)):
num.insert(len(num), temp[len(temp)-enum-1])
return int(''.join(num))
# init_num = int(input('Initial number: '))
# moves = int(input('MOVES: '))
# goal = int(input('GOAL: '))
# ops_num = int(input('Input the number of operations: '))
#
# init_ops = []
# for i in range(ops_num):
# init_ops.append(input('Input all the operations given: '))
init_num = 4
moves = 7
goal = 750
ops_num = 4
init_ops = ['+6', 'I4', '*3', 'Inv']
patrol_flag = 0
patrol_l = 4
patrol_r = 2
beg = 0
endl = moves
all_ops = []
if moves > ops_num:
if moves - ops_num == 1:
for i in range(ops_num):
ops = copy.copy(init_ops)
ops.append(init_ops[i])
Permutation(ops, beg, endl, all_ops)
if moves - ops_num == 2:
for i in range(ops_num):
for j in range(ops_num):
ops = copy.copy(init_ops)
ops.append(init_ops[i])
ops.append(init_ops[j])
Permutation(ops, beg, endl, all_ops)
if moves - ops_num == 3:
for i in range(ops_num):
for j in range(ops_num):
for k in range(ops_num):
ops = copy.copy(init_ops)
ops.append(init_ops[i])
ops.append(init_ops[j])
ops.append(init_ops[k])
Permutation(ops, beg, endl, all_ops)
if moves - ops_num == 4:
for i in range(ops_num):
for j in range(ops_num):
for k in range(ops_num):
for q in range(ops_num):
ops = copy.copy(init_ops)
ops.append(init_ops[i])
ops.append(init_ops[j])
ops.append(init_ops[k])
ops.append(init_ops[q])
Permutation(ops, beg, endl, all_ops)
if moves - ops_num == 5:
for i in range(ops_num):
for j in range(ops_num):
for k in range(ops_num):
for q in range(ops_num):
for p in range(ops_num):
ops = copy.copy(init_ops)
ops.append(init_ops[i])
ops.append(init_ops[j])
ops.append(init_ops[k])
ops.append(init_ops[q])
ops.append(init_ops[p])
Permutation(ops, beg, endl, all_ops)
if moves - ops_num == 6:
for i in range(ops_num):
for j in range(ops_num):
for k in range(ops_num):
for q in range(ops_num):
for p in range(ops_num):
for w in range(ops_num):
ops = copy.copy(init_ops)
ops.append(init_ops[i])
ops.append(init_ops[j])
ops.append(init_ops[k])
ops.append(init_ops[q])
ops.append(init_ops[p])
ops.append(init_ops[w])
Permutation(ops, beg, endl, all_ops)
elif moves == ops_num:
Permutation(init_ops, beg, endl, all_ops)
store_index = []
for i in range(len(all_ops)):
for it in all_ops[i]:
if it == 'Store':
store_index.append(i)
break
for i in range(len(store_index)): # 插入一个Store_S
temp = copy.deepcopy(all_ops[store_index[i]])
for index in range(len(temp)):
temp_a = copy.deepcopy(temp)
temp_a.insert(index, 'Store_S')
all_ops.insert(len(all_ops), temp_a)
for i in range(len(store_index)): # 插入两个Store_S
temp = copy.deepcopy(all_ops[store_index[i]])
for index in range(len(temp)-1):
temp_a = copy.deepcopy(temp)
temp_a.insert(index, 'Store_S')
for ttt in range(3-index):
temp_b = copy.deepcopy(temp_a)
temp_b.insert(index + ttt + 2, 'Store_S')
all_ops.insert(len(all_ops), temp_b)
for i in range(len(store_index)):
all_ops.pop(0)
# print(all_ops)
for i in range(len(all_ops)):
# pre process of the keyword 'Store'
Store_num = 0
# pre process of the keyword '[+]' or '[-]'
influence = 0
calc_num = copy.deepcopy(init_num)
for j in all_ops[i]:
if j[0] == '[':
if j[1] == '+':
influence += int(j[3:])
elif j[1] == '-':
influence -= int(j[3:])
elif j == 'Store_S':
Store_num = calc_num
elif j == 'Store':
if calc_num >= 0:
if Store_num + influence == 0:
calc_num = calc_num * 10
else:
calc_num = calc_num * pow(10, int(math.log10(Store_num + influence)) + 1) + Store_num+influence
else:
if int(j[1:]) == 0:
calc_num = calc_num * 10
else:
calc_num = calc_num * pow(10, int(math.log10(Store_num + influence)) + 1) - Store_num-influence
elif j == 'Inv':
if calc_num < 0:
calc_num = list(str(-1 * calc_num))
for ppp in range(len(calc_num)):
if calc_num[ppp] == '0':
continue
calc_num[ppp] = str(10 - int(calc_num[ppp]))
calc_num = -1 * int(''.join(calc_num))
else:
calc_num = list(str(calc_num))
for ppp in range(len(calc_num)):
if calc_num[ppp] == '0':
continue
calc_num[ppp] = str(10 - int(calc_num[ppp]))
calc_num = int(''.join(calc_num))
elif j == 'Sign':
calc_num *= -1
elif j == 'Mirror':
calc_num = M(calc_num)
elif j == 'SUM':
if calc_num < 0:
calc_num = -1 * summary(-1 * calc_num)
else:
calc_num = summary(calc_num)
elif j == 'Cube':
calc_num = calc_num * calc_num * calc_num
elif j == 'LS':
if calc_num < 0:
calc_num = list(str(-1 * calc_num))
calc_num.insert(len(calc_num), calc_num[0])
calc_num.remove(calc_num[0])
calc_num = -1 * int(''.join(calc_num))
else:
calc_num = list(str(calc_num))
calc_num.insert(len(calc_num), calc_num[0])
calc_num.remove(calc_num[0])
calc_num = int(''.join(calc_num))
elif j == 'RS':
if calc_num < 0:
calc_num = list(str(-1 * calc_num))
calc_num.insert(0, calc_num.pop())
calc_num = -1 * int(''.join(calc_num))
else:
calc_num = list(str(calc_num))
calc_num.insert(0, calc_num.pop())
calc_num = int(''.join(calc_num))
elif j == 'Re':
if calc_num < 0:
calc_num = list(str(-1 * calc_num))
calc_num.reverse()
calc_num = -1 * int(''.join(calc_num))
else:
calc_num = list(str(calc_num))
calc_num.reverse()
calc_num = int(''.join(calc_num))
elif j == 'D':
if calc_num >= 0:
calc_num = calc_num // 10
else:
calc_num = calc_num // 10 + 1
elif j[0] == 'C':
arowPos = j.index('>')
if calc_num < 0:
calc_num = str(-1 * calc_num)
calc_num = calc_num.replace(j[1:arowPos], j[(arowPos+1):])
calc_num = -1 * int(''.join(calc_num))
else:
calc_num = str(calc_num)
calc_num = calc_num.replace(j[1:arowPos], j[(arowPos+1):])
calc_num = int(''.join(calc_num))
elif j[0] == 'I':
if calc_num >= 0:
if int(j[1:]) + influence == 0:
calc_num = calc_num * 10
else:
calc_num = calc_num * pow(10, int(math.log10(int(j[1:]) + influence)) + 1) + int(j[1:])+influence
else:
if int(j[1:]) == 0:
calc_num = calc_num * 10
else:
calc_num = calc_num * pow(10, int(math.log10(int(j[1:]) + influence)) + 1) - int(j[1:])-influence
elif j[0] == '+':
calc_num += (int(j[1:]) + influence)
elif j[0] == '-':
calc_num -= (int(j[1:]) + influence)
elif j[0] == '*':
calc_num *= (int(j[1:]) + influence)
elif j[0] == '/':
if math.modf(calc_num/(int(j[1:])+influence))[0] != 0:
break
calc_num = calc_num // (int(j[1:])+influence)
if patrol_flag == 1:
ss = calc_num//abs(calc_num)
calc_num = list(str(abs(calc_num)))
while len(calc_num) >= patrol_l:
patrol_sum = (int(calc_num[len(calc_num)-patrol_l])+int(calc_num[len(calc_num)-patrol_r]))*pow(10, patrol_r-1)
patrol_else_sum = 0
for zzz in range(len(calc_num)):
if zzz != patrol_l-1 and zzz != patrol_r-1 and zzz < patrol_l:
patrol_else_sum += int(calc_num[len(calc_num) - zzz - 1]) * pow(10, zzz)
if zzz >= patrol_l:
patrol_else_sum += int(calc_num[len(calc_num) - zzz - 1]) * pow(10, zzz - 1)
calc_num = patrol_sum + patrol_else_sum
calc_num = list(str(calc_num))
calc_num = ss * int(''.join(calc_num))
if calc_num > 999999: # 最多6位数
continue
if calc_num == goal:
print(all_ops[i])
break