Day02-Old Bill

作者水平有限，此篇博客仅作个人纪录和分享。

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.

示例

输入数据	输出数据
72 6 7 9 5 2 3 7 78 0 0 5	3 2 511 9 5 18475 0

解题过程

• 首先题目使用英文描述的，需要清楚的了解题目的需求
• 题目大意： 现在已经知道了买到的火鸡的数量是78只，但是由于种种原因，仅知道总价格的中间3位数，即$-679-，最高位不得为0，最高位与最低位均未知。要求我们用程序实现得出符合要求的总价格的最高位、最低位以及最大单价，当没有符合要求的结果时，输出0。
• 解题思路： 采用枚举的思想，由于题目要求求得最大单价（单价记作PerPrice），因此在数量不变时，总价最高。所以由最大的总价（总价记作AllPrice，火鸡的数量记作NumberTurkeys）开始递减遍历，当遍历至 第一个满足条件 PerPrice = AllPrice / NumberTurkeys 的总价时，即可得到满足题目条件的解。否则输出0，表示无解。

AC代码

#include <iostream>
using namespace std;

int GetPerPrice(int NumberTurkeys, int X,int Y, int Z){
    int AllPrice;
    int PerPrice;
    for(int i = 9;i > 0; i--){//AllPrice是五位数，所以i>0
        for(int j = 9; j >= 0; j--){
            AllPrice = i*10000+X*1000+Y*100+Z*10+j;
            if (AllPrice % NumberTurkeys == 0){//总价正好被火鸡数目整除
                PerPrice = AllPrice / NumberTurkeys;
                std::cout << i << " " << j << " " << PerPrice <<std::endl;
                return 0;
            }
        }
    }
    std::cout << 0 << std::endl;//没有符合要求的单价
    return 0;
}
int main(){
    int NumberTurkeys, X, Y, Z;
    while(std::cin >> NumberTurkeys >> X >> Y >> Z){
        GetPerPrice(NumberTurkeys, X, Y, Z);
    }
    return 0;
}