ZOJ 2679 Old Bill（数学）

主题链接：

problemCode=2679" target="_blank">http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=2679

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 now 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 turkey 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.

Input

The input consists of T test cases. The number of test cases (T) is given on the first line of the input file. The first line of each test case 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_.

Output

For each test case, your program has to do the following. For a test case, there may be more than one candidate for the original price or there is none. In the latter case your program
is to report 0. Otherwise, if there is more than one candidate for the original price, the program is to report the two faded digits and the maximum price per turkey for the turkeys. The following shows sample input and output for three test cases.

Sample Input

3
72
6 7 9
5
2 3 7
78
0 0 5

Sample Output

3 2 511
9 5 18475
0

---

Source: Asia 2003, Seoul (South Korea)

题意：

给出一个n和一个三位数！

要你在这个三位数的首和尾个加入一个数字！组成五位数！要这个五位数能整除 n ，而且要最大！

PS:

直接for两层，枚举首和尾的数字就可以！首尾不能为0！

代码例如以下：

#include <cstdio>
int main()
{
    int t;
    int n;
    int a, b, c;
    int flag;
    scanf("%d",&t);
    while(t--)
    {
        flag = 0;
        scanf("%d",&n);
        scanf("%d%d%d",&a,&b,&c);
        for(int i = 9; i > 0; i--)
        {
            for(int j = 9; j >= 0; j--)
            {
                int tt = i*10000+a*1000+b*100+c*10+j;
                if(tt%n == 0)
                {
                    flag = 1;
                    printf("%d %d %d\n",i,j,tt/n);
                    break;
                }
            }
            if(flag)
            {
                break;
            }
        }
        if(!flag)
            printf("0\n");
    }
    return 0;
}

版权声明：本文博客原创文章。博客，未经同意，不得转载。