UVA11723 Numbering Roads【数学】

In my country, streets dont have names, each of them are just given a number as name. These numbers are supposed
to be unique but that is not always the case. The local government allocates some integers to name the roads and
in many case the number of integers allocated is less that the total number of roads. In that case to make road
names unique some single character suffixes are used. So roads are named as 1, 2, 3, 1A, 2B, 3C, etc. Of course the
number of suffixes is also always limited to 26 (A, B, . . . , Z). For example if there are 4 roads and 2 different integers
are allocated for naming then some possible assignments of names can be:

    Given the number of roads ® and the numbers of integers allocated for naming (N), your job is to determine minimum how many different suffixes will be required (of all possible namings) to name the streets assuming that no two streets can have same names.

Input
The input file can contain up to 10002 lines of inputs. Each line contains two integers R and N (0 < N, R < 10001). Here R is the total number of streets to be named and N denotes number integers allocated for naming.
Output
For each line of input produce one line of output. This line contains the serial of output followed by an integer D which denotes the minimum number of suffixes required to name the streets. If it is not possible to name all the streets print ‘impossible’ instead (without the quotes).
Sample Input
8 5
100 2
0 0
Sample Output
Case 1: 1
Case 2: impossible

问题链接：UVA11723 Numbering Roads
问题简述：（略）
问题分析：
    有R条街道和N个数字编号，数字前面可以有0-1个大写字母，问最少要几个字母才能给出R个不同的编号。
    如果有k个字母则n*(k+1)就能够生成的不同编号数。所以，(R-1)/N就是字母的个数。若超过26个字母则输出impossible。
程序说明：（略）
参考链接：（略）
题记：（略）

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

/* UVA11723 Numbering Roads */

#include <bits/stdc++.h>

using namespace std;

int main()
{
    int r, n, caseno = 0;
    while(~scanf("%d%d", &r, &n) && (r || n)) {
        int tmp = (r - 1) / n;

        printf("Case %d: ", ++caseno);
        if(tmp <= 26) printf("%d\n", tmp);
        else printf("impossible\n");
    }

    return 0;
}