...
parent
e7cdf0de45
commit
92f4613489
@ -0,0 +1,25 @@
|
||||
from __future__ import print_function
|
||||
import sys
|
||||
|
||||
n, m = sys.stdin.readline().split()
|
||||
n, m = int(n), int(m)
|
||||
n, m = max(n, m), min(n, m)
|
||||
|
||||
l = []
|
||||
l.append((n, m))
|
||||
while m != 0:
|
||||
n, m = m, n % m
|
||||
l.append((n, m))
|
||||
l.reverse()
|
||||
|
||||
wins = [False]
|
||||
|
||||
for i in range(len(l) - 1):
|
||||
if not wins[i]:
|
||||
wins.append(True)
|
||||
elif l[i + 1][0] == l[i][0] + l[i][1]:
|
||||
wins.append(False)
|
||||
else:
|
||||
wins.append(True)
|
||||
|
||||
print("win" if wins[-1] else "lose")
|
Loading…
Reference in New Issue