枚举法|Old Bill

描述
Among grandfather’s papers a bill was found. 72 turkeys $679 The first and the last digits of the number that obviously represented the total price of those turkeys are replaced here by blanks (denoted _), for they are faded and are illegible. What are the two faded digits and what was the price of one turkey? We want to write a program that solves a general version of the above problem. N turkeys $XYZ The total number of turkeys, N, is between 1 and 99, including both. The total price originally consisted of five digits, but we can see only the three digits in the middle. We assume that the first digit is nonzero, that the price of one turkeys is an integer number of dollars, and that all the turkeys cost the same price. Given N, X, Y, and Z, write a program that guesses the two faded digits and the original price. In case that there is more than one candidate for the original price, the output should be the most expensive one. That is, the program is to report the two faded digits and the maximum price per turkey for the turkeys.
输入描述：
The first line of the input file contains an integer N (0<N<100), which represents the number of turkeys. In the following line, there are the three decimal digits X, Y, and Z., separated by a space, of the original price $XYZ.
输出描述：
For each case, output the two faded digits and the maximum price per turkey for the turkeys.
示例1
输入：
72
6 7 9
5
2 3 7
78
0 0 5
复制
输出：
3 2 511
9 5 18475
0

代码

#include<iostream>
#include<cstdio>

using namespace std;

bool check1(int n) {//检查n是否刚好五位数
    int len = 0;
    while (n) {
        len++;
        n /= 10;
    }
    if (len == 5) return true;
    else return false;
}

bool check2(int n, int x, int y, int z) {
    n /= 10;
    if (n % 10 != z) return false;
    else {
        n /= 10;
        if (n % 10 != y) return false;
        else {
            n /= 10;
            if (n % 10 != x) return false;
            else {
                n /= 10;
                if (n == 0) return false;
            }
        }
    }
    return true;
}

int main() {
    int N, x, y, z;
    int a, b;//分别代表最高位和最低位
    while (scanf("%d", &N) != EOF) {
        scanf("%d%d%d", &x, &y, &z);
        int i;
        for (i = 99999; i > 0; i--) {
            if (check1(N * i) && check2(N * i, x, y, z)) {
                int sum = N * i;
                b = sum % 10;
                a = sum / 10000;
                printf("%d %d %d\n", a, b, i);
                break;
            }
        }
        if (i == 0) printf("0\n");
    }
    return 0;
}