Submission #457845

---

Source Code Expand

import math
def gcd(m, n):
    if m<n:
        return gcd(n, m)
    r = m%n
    return gcd(n, r) if r else n
x, y = map(int, raw_input().split('/'))
g = gcd(x, y)
x /= g; y /= g
exist = False
pmin = int((2*x-y + math.sqrt((y-2*x)**2 + 8*y**2)) / (2*y**2))
pmax = int((2*x+y)/y**2)
for p in xrange(pmin,pmax+1):
    n = p*y
    m = p*(y*(p*y+1) - 2*x)/2
    if 1<=m<=n:
        print n, m
        exist = True
if not exist:
    print "Impossible"

Submission Info

Judge Result