本文主要是介绍九度oj-1036-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.
- 样例输入：
-
72 6 7 9 5 2 3 7 78 0 0 5
- 样例输出：
-
3 2 511 9 5 18475 0
- 来源：
- 2007年上海交通大学计算机研究生机试真题
-
-
#include<iostream> using namespace std; int main() {int n,x,y,z,i,j,t;while(cin>>n>>x>>y>>z){bool flag;for(i=9;i>0;i--){flag=false;for(j=9;j>=0;j--){t=i*10000+x*1000+y*100+z*10+j;if(t%n==0){flag=true;cout<<i<<" "<<j<<" "<<t/n<<endl;break;}}if(flag) break;}if(! flag)cout<<'0'<<endl;}return 0; }
这篇关于九度oj-1036-Old Bill的文章就介绍到这儿，希望我们推荐的文章对编程师们有所帮助！
