首页 > 试题广场 >

Old Bill

[编程题]Old Bill
  • 热度指数：28879 时间限制：C/C++ 1秒，其他语言2秒 空间限制：C/C++ 64M，其他语言128M
  • 算法知识视频讲解
    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
算法知识视频讲解
添加回答
Python
Sydukee头像 Sydukee 
n = int(input())
x,y,z = map(int,input().split())
price,a,b = 0,0,0
for a in range(1,10):
    for b in range(0,10):
        amount = a*10000+x*1000+y*100+z*10+b
        if amount % n == 0 and amount / n > price:
            price = amount // n
            first = a
            last = b
if price != 0:
    print(first,last,price)
else : print(0)

发表于 2020-02-27 15:33:24 回复(0)
Python
TimeMac头像 TimeMac 
#因为要找到最大的火鸡单价，所以从最大的火鸡总价开始找
while True:
    try:
        numTurkey = int(input())
        midNum = int(input().replace(' ',''))
        whetherFind = False                #设置一个bool值来确认是否找到
        for i in range(9,0,-1):            #最高位不能为0
            for j in range(9,-1,-1):       
                tempTotal = i*10000+midNum*10+j
                if tempTotal % numTurkey == 0:
                    leftNum = i
                    rightNum = j
                    whetherFind = True
                    price = tempTotal//numTurkey
                    break
            if whetherFind:
                break
        if whetherFind:
            print('%d %d %d'%(leftNum,rightNum,price))
        else:                             #未找到输出为0
            print(0)
    except Exception:
        break

编辑于 2018-10-14 13:19:47 回复(1)
提交观点

问题信息

数组 模拟 穷举
难度：
2条回答 11877浏览

热门推荐

通过挑战的用户

查看代码

相关试题

Old Bill

扫一扫，把题目装进口袋

求职之前，先上牛客

扫描二维码，进入QQ群

扫描二维码，关注牛客公众号