zoukankan      html  css  js  c++  java
  • 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
     1 #include <iostream>
     2 #include <cstdio>
     3 using namespace std;
     4 int main(){
     5     int x, y, z;
     6     int i, j;
     7     int n, t;
     8     scanf("%d", &t);
     9     while(t--){
    10         scanf("%d %d %d %d", &n, &x, &y, &z);
    11         for(i = 9; i > 0; i--){
    12             for(j = 9; j >= 0; j--){
    13                 int p = i * 10000 + x * 1000 + y * 100 + z * 10 + j;
    14                 if(p / n * n == p){
    15                     printf("%d %d %d
    ", i, j, p / n); 
    16                     goto RL;
    17                 }
    18             }
    19         }
    20         printf("0
    ");
    21         RL: continue;
    22     }
    23     return 0;
    24 }
     
  • 相关阅读:
    浏览器是怎样工作的二:渲染引擎 HTML解析(1)(转)
    凯文.都迪的超级记忆力训练教程
    程序员的修炼之道
    我编程我快乐——程序员的职业规划
    SQL Server 数据库备份和还原认识和总结(一)
    SQL Server 管理数据收集
    汇总SQL Server里的相关运算符、子句、谓词等
    SQL Server 数据库备份和还原认识和总结(二)
    解决报表控件报CS0433错误
    通过笔记本配件,理解抽象类接口和委托事件
  • 原文地址:https://www.cnblogs.com/qinduanyinghua/p/6536067.html
Copyright © 2011-2022 走看看