A New Change Problem
Now given two kinds of coins A and B,which satisfy that GCD(A,B)=1.Here you can assume that there are enough coins for both kinds.Please calculate the maximal value that you cannot pay and the total number that you cannot pay.
Input
The input will consist of a series of pairs of integers A and B, separated by a space, one pair of integers per line.
Output
For each pair of input integers A and B you should output the the maximal value that you cannot pay and the total number that you cannot pay, and with one line of output for each line in input.
Sample Input
2 3 3 4
Sample Output
1 1 5 3
题意:给定两个数A和B,保证 gcd(A,B) = 1,A 和 B 有无数个,问不能组成的最大数和个数。
思路:不能组成的最大数 n * m - n - m,个数 (n - 1) * (m - 1) / 2
最大不能组成:
假设有 m 个数为 0 , n , 2 * n , 3 * n ... (m - 1) * n ,这 m 个数对 m 取余一定不同,且为 {0,1,2,3 , ... , m - 1} 中的一个数。
所以当 一个数 x > (m - 1) * n 时,他一定能够被组成。 (m - 1) * n % n == 0,所以 x >= (m - 1) * n 时一定能被组成。
当 x < (m - 1) * n 时,显然 (m - 1) * n - m 是最大的无法组成的数,因为 (m - 1) * n - m 与 (m - 1) * n 对 m 同余。
个数:
①对于(m - 1) * n,不符合要求的是比(m - 1) * n小且与它同余的数,就是(m - 1) * n - m , (m - 1) * n - 2 * m...
②对于(m-2)*n,不符合要求的是(m - 2) * n - m,(m - 2) * n - 2 * m...
③对于n,不符合要求的就是,n - m..
所以ans = n / m + (2 * n) / m + (3 * n) / m ... + ((m - 1) * n) / m = (m - 1) * (n - 1) / 2
对于n * m / m = n,这个是整除的,所以(i * n + (m - i) * n) / m = n
由于i * n / m必定不整除,所以 i * n % m + (m - i) * n % m = m;
因而(i * n) / m + ((m - i) * n) / m = n - 1,得出:ans = n / m + (2 * n) / m + ... ((m - 1) * n) / m = (n / m + (m - 1) * n / m) + (2 * n / m + (m - 2) * n / m) + ... = (n - 1) * (m - 1) / 2