九度OnlineJudge之1036:Old Bill
来源:互联网 发布:linux奶瓶破解wifi 编辑:程序博客网 时间:2024/04/30 06:41
- 题目描述:
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
#include<iostream>using namespace std;int main(){int n,x,y,z,i,j,t;while(cin>>n>>x>>y>>z){bool flag = false;int tmp = 1000*x+100*y+10*z;for ( i=9;i>0;i--){for ( j=9;j>=0;j--){t = tmp + i*10000 +j;if (t%n==0) {flag = true;break;} }if (flag) break;}if (flag)cout<<i<<" "<<j<<" "<<t/n<<endl;elsecout<<"0"<<endl;}//system("pause");return 0;}
- 九度OnlineJudge之1036:Old Bill
- 九度OJ题目1036:Old Bill
- 九度oj-1036-Old Bill
- 九度OJ-1036:Old Bill
- 九度oj-1036-old bill
- 九度OJ 1036:Old Bill
- 九度OJ题目1036:Old Bill
- 九度OJ 1036 Old Bill (模拟)
- 题目1036 Old Bill 九度Online Judge
- 九度OJ 1036:Old Bill (老比尔) (基础题)
- 题目1036:Old Bill
- 题目1036:Old Bill
- 题目1036:Old Bill
- 题目1036:Old Bill
- 题目1036:Old Bill
- 九度OnlineJudge之1468:Sharing
- 九度OnlineJudge之1002:Grading
- 九度OnlineJudge之1003:A+B
- Android中shape的使用
- float除0
- 【Java工程师之路】[1-2.6]Java面向对象详解5
- hdu3555
- A Chess Game
- 九度OnlineJudge之1036:Old Bill
- PB安装包,PB安装程序,PB开发工具,powerbuilder安装包,powerbuilder安装程序,powerbuilder开发工具下载地址
- 二叉树
- MyEclipse maven的内置Tomcat
- ios开发-UIColor的使用。
- 怎么将GPT转换为MBR格式分区
- 图像特征提取与匹配之SIFT算法
- 拷贝构造函数
- POJ 2817 WordStack (暴力)