#ENGLISHP29. Divisor Problem
Divisor Problem
Description
Find the minimum positive number A, so that both A and (M minus A) are divisors of N.
Input Format
Two positive integers N (N <= 10000) and M (M <= 10000).
Output Format
Two integers A and (M-A).
20 9
4 5