题目1036:Old Bill
来源:互联网 发布:怎么看iphone的mac地址 编辑:程序博客网 时间:2024/05/16 17:14
- 题目描述:
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.
- 样例输入:
726 7 952 3 7780 0 5
- 样例输出:
3 2 5119 5 184750
C++代码:
#include<iostream>using namespace std;int n;int a,b,c;int main(){ while(cin>>n>>a>>b>>c){ int f=1; for(int i=9;i>=1;i--){ for(int j=9;j>=0;j--){ if((i*10000+a*1000+b*100+c*10+j)%n==0){ f=0; cout<<i<<" "<<j<<" "<<(i*10000+a*1000+b*100+c*10+j)/n<<endl; break; } } if(f==0) break; } if(f) cout<<0<<endl; } return 0;}
- 题目1036:Old Bill
- 题目1036:Old Bill
- 题目1036:Old Bill
- 题目1036:Old Bill
- 题目1036:Old Bill
- 九度OJ题目1036:Old Bill
- 九度OJ题目1036:Old Bill
- 题目1036 Old Bill 九度Online Judge
- old bill
- 九度OnlineJudge之1036:Old Bill
- 九度oj-1036-Old Bill
- 九度OJ-1036:Old Bill
- 九度oj-1036-old bill
- 九度OJ 1036:Old Bill
- zoj 2679 Old Bill
- zoj 2679 Old Bill
- 1036.Old Bill
- 九度OJ 1036 Old Bill (模拟)
- 支持FPGA的LabVIEW的算子
- MySQL之explain 的type列 & Extra列
- Unity和C#有关Time的函数
- Ascii
- MFC单文档图像处理代码--句柄图像实现
- 题目1036:Old Bill
- VMware的三种网络连接方式区别
- springboot中关于JPA的坑
- Vue.js——vue-resource全攻略
- 聊一聊数据仓库中的元数据管理系统
- jedis连接redis
- Eclipse中如何自定义类、方法等的注释
- 人形时钟,和仓鼠flash
- android studio 插件 gradle view 查看gradle依赖树