zoj 2679 Old Bill
Old Bill
Time Limit: 2 Seconds Memory Limit: 65536 KB
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
3
72
6 7 9
5
2 3 7
78
0 0 5
Sample Output
3 2 511
9 5 18475
0
#include <iostream>
#include <cstdio>
using namespace std;
int main(){
int x, y, z;
int i, j;
int n, t;
scanf("%d", &t);
while(t--){
scanf("%d %d %d %d", &n, &x, &y, &z);
for(i = ; i > ; i--){
for(j = ; j >= ; j--){
int p = i * + x * + y * + z * + j;
if(p / n * n == p){
printf("%d %d %d\n", i, j, p / n);
goto RL;
}
}
}
printf("0\n");
RL: continue;
}
return ;
}
最新文章
- redis 源码阅读 内部数据结构--字符串
- C#进阶系列——DDD领域驱动设计初探(七):Web层的搭建
- Qt qml 单例模式
- Android OpenGL 编写简单滤镜
- linux 下恢复后台程序的方法
- poj 1562
- 自定义EL
- django上传下载大文件
- swift基础--运算符
- 在 Java 应用程序中使用 Elasticsearch
- 谈一谈EasyUI的TreeGrid的过滤功能
- Google Interview University 一套完整的学习手册帮助自己准备 Google 的面试
- Node.js 命令行工具的编写
- TMS320DM642学习----第六篇(CCS中.dat文件类型详解)
- AX2009 批处理作业中使用多线程---独立任务模式
- thinkphp 3.2 去除调试模式后报错,怎么解决
- 用H5开发微信还是开发APP?
- 傻瓜式搭建私人网络硬盘——owncloud安装指南
- [ZJOI2013]K大数查询
- ES6_入门(4)_数组的解构赋值