Submission #3782880

---

Source Code Expand

def gcd(a,b):
    if a == 0:
        return b
    return gcd(b%a, a)
x,y = map(int, input().split("/"))
g = gcd(x,y)
x //= g
y //= g
ans = []
k = (y+2*x)/y**2
l = (2*x/y-1)/y
for i in range(int(l),int(k)+1):
    if i*y*(i*y+1)//2-i*x > 0:
        ans.append([i*y, i*y*(i*y+1)//2-i*x])
if len(ans) == 0:
    print("Impossible")
    quit()
for n,m in ans:
    print(n,m)

Submission Info

Judge Result