若是凉夜已成梦

青春里 总有些事情要努力去做 总有些梦想要拼命去追。


  • 运维

  • 前端

  • 编程

  • 随笔

  • hust-oj

1656: Old Bill

发表于 2017-10-06   |   分类于 HUSTOJ   |   阅读次数 1,472

题目描述

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.

输入

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_.

输出

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.

样例输入

3
72
6 7 9
5
2 3 7
78
0 0 5

样例输出

3 2 511
9 5 18475
0

参考代码

#include <stdio.h>
int main() 
{
    int t, n, x, y, z, num;
    int a, b, price, s, first, last;
    scanf("%d", &t);
    while (t--) 
    {
        scanf("%d", &n);
        scanf("%d %d %d", &x,&y,&z);
        price = 0;
        for (a = 1; a <= 9; a++)
               for (b = 0; b <= 9; b++) 
        {
            s = 10000*a + 1000*x + 100*y + 10*z + b;
            if (s % n == 0 && s / n > price) 
            {
                first = a;
                last = b;
                num = s;
                price = num / n;
            }
        }
        if (price == 0)
               printf("0"); else
               printf("%d %d %d", first, last, price);
        if (t) 
               printf("n");
 }
 return 0;
}

解析

暂无

hustoj

发表评论 取消回复

邮箱地址不会被公开。 必填项已用*标注

*
*


hoxis wechat
著作权归作者所有
站点更新说明
  • 文章目录
  • 站点概览
若是凉夜已成梦

若是凉夜已成梦

青春里 总有些事情要努力去做 总有些梦想要拼命去追。

1904 日志
6 分类
12 标签
RSS
weibo github twitter facebook

友情链接

原站点 Skip Dreams孤独患者
© 2017 若是凉夜已成梦
Powered by WordPress | 已运行
Theme By NexT.Mist