ZOJ 2679 Old Bill(数学题)
来源:互联网 发布:优兑商城知乎 编辑:程序博客网 时间:2024/06/05 07:02
题目链接:http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=2679
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 now 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 turkey 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.
Input
The input consists of T test cases. The number of test cases (T) is given on the first line of the input file. The first line of each test case 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_.
Output
For each test case, your program has to do the following. For a test case, there may be more than one candidate for the original price or there is none. In the latter case your program is to report 0. Otherwise, if there is more than one candidate for the original price, the program is to report the two faded digits and the maximum price per turkey for the turkeys. The following shows sample input and output for three test cases.
Sample Input
3726 7 952 3 7780 0 5
Sample Output
3 2 5119 5 184750
Source: Asia 2003, Seoul (South Korea)
题意:
给出一个n和一个三位数!
要你在这个三位数的首和尾个添加一个数字!组成五位数!要这个五位数能整除 n ,并且要最大!
PS:
直接for两层,枚举首和尾的数字即可!首尾不能为0!
代码如下:
#include <cstdio>int main(){ int t; int n; int a, b, c; int flag; scanf("%d",&t); while(t--) { flag = 0; scanf("%d",&n); scanf("%d%d%d",&a,&b,&c); for(int i = 9; i > 0; i--) { for(int j = 9; j >= 0; j--) { int tt = i*10000+a*1000+b*100+c*10+j; if(tt%n == 0) { flag = 1; printf("%d %d %d\n",i,j,tt/n); break; } } if(flag) { break; } } if(!flag) printf("0\n"); } return 0;}
- ZOJ 2679 Old Bill(数学题)
- zoj 2679 Old Bill
- zoj 2679 Old Bill
- ZOJ 2679 Old Bill(STL应用)
- Solution of ZOJ 2679 Old Bill
- ZOJ Problem Set - 2679 Old Bill
- ZOJ.2679 Old Bill【水】 2015/10/12
- ZOJ 2679 Old Bill ||ZOJ 2952 Find All M^N Please 两题水题
- old bill
- 题目1036:Old Bill
- 1036.Old Bill
- 题目1036:Old Bill
- 题目1036:Old Bill
- 题目1036:Old Bill
- 题目1036:Old Bill
- 九度OJ 1036 Old Bill (模拟)
- 上交复试07年机考题(old bill)
- zoj 2975 Kinds of Fuwas(数学题)
- Phoenix Tips (4) 提升效率的方法
- 思维导图总结 Android知识点大全
- PHP编程效率
- java-web-j2e学习建议路线
- C中的scanf fscanf sscanf
- ZOJ 2679 Old Bill(数学题)
- Uboot启动全过程
- [Python]网络爬虫学习笔记,爬取豆瓣妹子上妹子的照片
- openCV2 第一讲 图像的读写和显示
- 轻松周赛赛题:能否被8整除
- 关于微信处理模块阅读
- GoLang之再谈Gvim/Vim配置——使用Vundle安装vim-go
- matlab中元胞数组cell的赋值与访问方法
- 技术方案选择