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

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

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

  • 0
    点赞
  • 2
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值