Submission #23922

---

Source Code Expand

main = interact (f . map read . words . map g)

g '/' = ' '
g x = x

f :: [Integer] -> String
f [x,y] = f' $ map (`div` gcd x y) [x,y]

f' [x,y] = case candidates of
            [] -> "Impossible\n"
            _ -> unlines $ map (unwords . map show) candidates
    where
      candidates = [[n, m] |
                     n <- take 10 [2 * x `div` y - 1 .. ],
                     1 < n, mod n y < 1,
                     let total = n * (n + 1) `div` 2,
                     let m = total - x * n `div` y,
                     0 < m, m <= n]

Submission Info

Judge Result