-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathtask143.py
More file actions
41 lines (31 loc) · 2.41 KB
/
task143.py
File metadata and controls
41 lines (31 loc) · 2.41 KB
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
# best: 127(Code Golf International) / others: 130(ox jam), 135(jailctf merger), 140(biz), 142(FuunAgent), 150(ALE-Agent)
# ============================================================ 127 ============================================================
# p=lambda g,R=range(10):[[((f:=[(t:=[i for i in range(100)if g[i//10][i%10]==c])and[v-min(t)for v in t]for c in R]).count(f[v:=g[i][j]])>1<4<i+j)*5or v for j in R]for i in R]
# def p(g,R=range(10)):
# f=[(t:=[i for i in range(100)if g[i//10][i%10]==c])and[v-min(t)for v in t]for c in R]
# return[[(f.count(f[v:=g[i][j]])>1<4<i+j)*5or v for j in R]for i in R]
# p=lambda g:[[((f:=lambda c:(t:=[i for i in range(100)if g[i//10][i%10]==c])and[v-min(t)for v in t])(v)==f(c:=max(g[0][:3]+g[1][:3]))!=v!=c)*5or v for v in s]for s in g]
# p=lambda g:[[((f:=lambda c:[i-sum(g,[]).index(c)for i in range(100)if g[i//10][i%10]==c])(v)==f(c:=max(g[0][:3]+g[1][:3]))!=v!=c)*5or v for v in s]for s in g]
# p=lambda g:[[((f:=lambda c:[i-sum(g,[]).index(c)for i,v in enumerate(sum(g,[]))if v==c])(v)==f(c:=max(g[0][:3]+g[1][:3]))!=v!=c)*5or v for v in s]for s in g]
p=lambda g:[[((f:=lambda c,t=0:[~i-(t:=t or~i)for i,v in enumerate(sum(g,[]))if v==c])(v)==f(c:=max(g[0][:3]+g[1][:3]))!=v!=c)*5or v for v in s]for s in g]
# p=lambda g:[[((f:=lambda c:[i for i,v in enumerate(sum(g,[])[sum(g,[]).index(c):])if v==c])(v)==f(c:=max(g[0][:3]+g[1][:3]))!=v!=c)*5or v for v in s]for s in g]
# p=lambda g:(u:=sum(g,[]))and[[((f:=lambda c:[i-u.index(c)for i,v in enumerate(u)if v==c])(v)==f(c:=max(g[0][:3]+g[1][:3]))!=v!=c)*5or v for v in s]for s in g]
# def p(g):
# f=lambda c:(t:=[i for i in range(100)if g[i//10][i%10]==c])and[v-min(t)for v in t]
# return[[(f(v)==f(c:=max(g[0][:3]+g[1][:3]))!=v!=c)*5or v for v in s]for s in g]
# def p(g):
# f=[(t:=[i for i in range(100)if g[i//10][i%10]==c])and[v-min(t)for v in t]for c in range(10)]
# c=max(g[0][:3]+g[1][:3])
# return[[(f[v]==f[c]!=v!=c)*5or v for v in s]for s in g]
# def p(g):
# f=[[i for i in range(100)if g[i//10][i%10]==c]for c in range(10)]
# c=max(g[0][:3]+g[1][:3])
# return [[(len({x-y for x,y in zip(f[c],f[v])})==1 and len(f[c])==len(f[v]) and v!=c)*5 or v for v in s]for s in g]
# def p(g):
# f=[[i for i in range(100)if g[i//10][i%10]==c+1]for c in range(9)]
# c=max(g[0][:3]+g[1][:3])-1
# for i in range(9):
# if len({x-y for x,y in zip(f[c],f[i])})==1 and len(f[c])==len(f[i]) and i!=c:
# for k in f[i]:
# g[k//10][k%10]=5
# return g