考研机试真题--Old Bill--上海交通大学

最新推荐文章于 2026-02-05 03:56:55 发布

原创最新推荐文章于 2026-02-05 03:56:55 发布 · 901 阅读

2 ·

本内容遵循CC 4.0 BY-SA版权协议

算法同时被 3 个专栏收录

137 篇文章

订阅专栏

机试

78 篇文章

订阅专栏

枚举

3 篇文章

订阅专栏

这是一篇关于计算机编程的考研题目，涉及到枚举和暴力求解算法。题目要求通过给定的中间三位数字，找出缺失的首尾两位数字，以及每只火鸡的最高单价。输入包含火鸡数量N和价格的中间三位数字，输出缺失的数字和最高单价。文章提供了示例输入输出和相关代码链接。

关键字：枚举；暴力
题目：
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

链接：
https://www.nowcoder.com/practice/17a30153e092493e8b4d13f321343927?tpId=40&tqId=21426&tPage=1&rp=1&ru=/ta/kaoyan&qru=/ta/kaoyan/question-ranking

代码：

#include <iostream>
#include <fstream>
using namespace std;
const int num = 100;

int main(){
    int n, x, y, z;
//    freopen("a.txt", "r", stdin);
    while(cin >> n >> x >> y >> z){
        bool flag = false;
        for(int i = 9; i > 0; --i){
            for(int j = 9; j >= 0; --j){
                int sum = i * 10000 + x * 1000 + y * 100 + z * 10 + j;
                if(sum % n == 0){
                    cout << i << " " << j << " " << sum / n << endl;
                    flag = true;
                    break;
                }
            }
            if(flag) break;
        }
        if(!flag) cout << "0" << endl;
    }

    return 0;
}