OpenJudge - 29:Divisor Problem
描述
Find the minimum positive number A, so that both A and (M minus A) are divisors of N.
输入
Two positive integers N (N <= 10000) and M (M <= 10000).
输出
Two integers A and (M-A).
翻译:
找到最小正整数A,使得A和M-A都能整除N
输入:
两个正整数N和M
输出:
两个数A和M-A。