鲁公网安备 37132102371533号xxxxxxxxxx
-- 7 Billion Humans (2235) --
-- 51: 公司职级 --
pickup s
a:
mem1 = calc mem1 + 1
if w != worker:
step s
write mem1
drop
endif
jump a
xxxxxxxxxx
-- 7 Billion Humans (2235) --
-- 52: 统计众数 --
mem1 = nearest datacube
a:
step w
if s != nothing:
mem2 = calc mem2 + 1
jump a
endif
step n
step n
b:
if c == datacube and
c == mem2:
mem3 = calc mem3 + 1
endif
if e == nothing or
e == wall or
e == hole:
step n
if c == nothing and
n == wall:
pickup mem1
write mem3
drop
end
endif
c:
if w != wall and
w != hole:
if c == datacube and
c == mem2:
mem3 = calc mem3 + 1
endif
step w
jump c
endif
step n
endif
step e
jump b
xxxxxxxxxx
-- 7 Billion Humans (2235) --
-- 53: 地上的100个方块 --
if n == wall:
a:
if w != wall:
step w
pickup c
write mem1
drop
mem1 = calc mem1 + 1
else:
step se
b:
if c == datacube:
step e
jump b
endif
endif
jump a
endif
xxxxxxxxxx
-- 7 Billion Humans (2235) --
-- 53: 地上的100个方块 --
if n == worker:
mem1 = set 10
endif
if nw == worker:
mem1 = set 20
endif
if e == wall and
s == nothing:
mem1 = set 30
endif
if w == datacube and
s == nothing and
n != worker:
mem1 = set 40
endif
if sw == worker and
e == nothing:
mem1 = set 50
endif
if ne == worker and
s == nothing:
mem1 = set 60
endif
if se == wall and
s == wall and
w == nothing:
mem1 = set 70
endif
if e == wall and
sw == worker:
mem1 = set 80
endif
if s == wall and
w == datacube:
mem1 = set 90
endif
a:
if w != wall:
step w
if c == datacube:
pickup c
write mem1
drop
mem1 = calc mem1 + 1
endif
jump a
endif
xxxxxxxxxx
-- 7 Billion Humans (2235) --
-- 54: 平整地形 --
a:
b:
if n != wall:
step n
pickup c
write mem1
drop
jump b
endif
mem1 = calc mem1 + 1
c:
if s != nothing or
c != nothing:
step s
jump c
endif
jump a
xxxxxxxxxx
-- 7 Billion Humans (2235) --
-- 54: 平整地形 --
a:
if c == nothing:
step n
jump a
endif
b:
if n != wall:
mem1 = calc mem1 + c
step n
jump b
endif
step s
pickup c
write mem1
drop
if w == nothing:
c:
if e != nothing:
step e
mem1 = calc mem1 + c
jump c
endif
mem1 = calc mem1 / 49
d:
if w != nothing:
pickup c
write mem1
drop
step w
jump d
else:
pickup c
write mem1
drop
endif
step s
tell everyone coffeetime
else:
step n
listenfor coffeetime
step s
mem1 = set c
e:
step s
endif
pickup c
write mem1
drop
jump e
xxxxxxxxxx
-- 7 Billion Humans (2235) --
-- 55: 数据之花 --
pickup s
a:
step n
if n != datacube or
s != datacube:
jump a
endif
mem1 = foreachdir nw,w,sw,n,s,ne,e,se:
mem2 = calc mem2 + mem1
endfor
write mem2
drop
xxxxxxxxxx
-- 7 Billion Humans (2235) --
-- 56: 局部最大值 --
mem3 = nearest shredder
step w
step w
mem1 = foreachdir nw,w,sw,n,s,ne,e,se:
if mem1 > mem2:
mem2 = set mem1
endif
endfor
pickup mem2
giveto mem3
xxxxxxxxxx
-- 7 Billion Humans (2235) --
-- 57: 扫雷邻居 --
if e == wall:
mem3 = set 1
endif
a:
if mem3 == 1:
step w
else:
step e
endif
if c == datacube:
mem1 = foreachdir nw,w,sw,n,s,ne,e,se:
if mem1 == datacube:
mem2 = calc mem2 + 1
endif
endfor
pickup c
write mem2
drop
mem2 = set 0
endif
jump a
xxxxxxxxxx
-- 7 Billion Humans (2235) --
-- 58: 好邻居 --
a:
step nw,w,sw,n,s,ne,e,se
mem2 = foreachdir nw,w,sw,n,s,ne,e,se:
if mem2 == datacube:
mem3 = calc mem3 + 1
endif
endfor
if mem3 > 3:
pickup c
endif
mem3 = set 0
step nw,w,sw,n,s,ne,e,se
drop
jump a
xxxxxxxxxx
-- 7 Billion Humans (2235) --
-- 58: 好邻居 --
a:
mem1 = nearest datacube
step mem1
if w != wall and
n != wall and
s != wall and
e != wall:
pickup c
mem2 = nearest wall
step mem2
b:
c:
d:
e:
if c != nothing:
if w == wall and
s != wall:
step s
jump b
endif
if s == wall and
e != wall:
step e
jump c
endif
if e == wall and
n != wall:
step n
jump d
endif
if n == wall and
w != wall:
step w
jump e
endif
endif
drop
endif
mem3 = foreachdir nw,w,sw,n,s,ne,e,se:
step nw,w,sw,n,s,ne,e,se
endfor
jump a
xxxxxxxxxx
-- 7 Billion Humans (2235) --
-- 59: 荣耀洞穴 --
mem1 = nearest datacube
mem3 = calc mem1 + 1
a:
mem3 = calc mem3 - 1
mem2 = foreachdir nw,w,sw,n,s,ne,e,se:
if mem3 == 0 and
mem2 == hole or
mem2 == mem3:
step mem2
jump a
endif
endfor
xxxxxxxxxx
-- 7 Billion Humans (2235) --
-- 59: 荣耀洞穴 --
if w == 12 or
w == 11 or
w == 10:
step sw
a:
b:
if w != hole:
step s
jump b
endif
step sw
c:
step w
d:
step nw
step w
jump d
endif
if s == 11 and
w == hole:
step se
step se
step s
step sw
jump c
endif
if s == 11:
step se
step s
jump a
endif
if e == 2:
step e
step e
if s == 1:
step s
endif
if n == 1:
step n
endif
mem1 = foreachdir nw,w,sw,n,s,ne,e,se:
if mem1 == hole:
step mem1
endif
endfor
endif
if n == wall:
e:
if w == hole:
f:
step s
jump f
else:
step w
jump e
endif
endif
step n
step n
if se == 3:
g:
step ne
jump g
endif
h:
if w != nothing:
step w
jump h
endif
step n
step n
step n
step ne
xxxxxxxxxx
-- 7 Billion Humans (2235) --
-- 60: 排序人手紧缺 --
a:
step w,e
if s > se and
w != worker and
sw != worker and
e != worker and
se != worker:
pickup s
drop
step s
pickup e
drop
step e
pickup nw
drop
step n
endif
jump a
xxxxxxxxxx
-- 7 Billion Humans (2235) --
-- 60: 排序人手紧缺 --
if e == worker:
step w
step w
endif
a:
b:
if s > se and
w != worker and
sw != worker and
s == datacube and
se == datacube:
pickup s
drop
step s
pickup e
drop
step e
pickup nw
drop
step n
jump b
endif
if e != wall:
step e
else:
c:
if w != wall:
step w
jump c
endif
endif
jump a
鲁公网安备 37132102371533号