UVA10493 Cats, with or without Hats【组合】

A cat wears a hat if and only if it has N cats in its hat. There is exactly one cat that is not inside any other cat’s hat. If there are M cats without hats, how many cats are there?
Input
Input consists of several test cases. For each case, there would be two integers, N and M, where 1 ≤ N < 100000 and 1 ≤ M < 100000. The input ends with a case where N = 0. You must not process this test case.
Output
For each test case, print N and M. Then if the total number of cats can be expressible uniquely in an integer, print the number. If the case is impossible print the word ‘Impossible’ without quotes. If there are multiple answers, print the word ‘Multiple’ without the quotes.
Sample Input
2 5
3 4
3 3
0 0
Sample Output
2 5 9
3 4 Impossible
3 3 4

问题链接：UVA10493 Cats, with or without Hats
问题简述：（略）
问题分析：
    先占个位置。
程序说明：（略）
参考链接：（略）
题记：（略）

AC的C++语言程序如下：

/* UVA10493 Cats, with or without Hats */

#include <bits/stdc++.h>

using namespace std;

int main()
{
    int n, m;
    while(~scanf("%d %d",&n, &m) && (n || m)) {
        if(n == 1) {
            if(m == 1)
                printf("%d %d Multiple\n", n, m);
            else
                printf("%d %d Impossible\n", n, m);
        } else {
            if((m - n) % (n - 1) == 0)
                printf("%d %d %d\n", n, m, (n + 1) + n * ((m - n) / (n - 1)));
            else
                printf("%d %d Impossible\n", n, m);
        }
    }

    return 0;
}