习题2.3 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.

示例1

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

思路:

从大到小枚举万位和各位数,当发现可以整除,输出结果

#include<iostream>
using namespace std;
int n,x,y,z;
int main(){
    while(cin>>n){
        cin>>x>>y>>z;
            int a = 9;
            for(int j=9;j>=1;j--){
                if(a==1) break;
                for(int k=9;k>=0;k--){
                    if(a==1)break;
                    if((10000*j+1000*x+100*y+10*z+k)%n==0){
                        cout<<j<<" "<<k<<" "<<(10000*j+1000*x+100*y+10*z+k)/n<<endl;
                        a = 1;
                    }
                }
           
        }
        if(a==9)
        cout<<0<<endl;
    }
    
    return 0;
}
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值