Divisor Problem
https://acs.jxnu.edu.cn/problem/NOIOPJENGLISH29
1000ms 65536K
描述:
Find the minimum positive number A, so that both A and (M minus A) are divisors of N.
找到最小的正整数a使得a和m减a都是n的因数
输入:
Two positive integers N (N <= 10000) and M (M <= 10000).
两个正整数表示n和m
输出:
One integer A.
一个数a
样例输入:
20 9
样例输出:
4 5