zoukankan      html  css  js  c++  java
  • 【71.76%】【codeforces 732A】Buy a Shovel

    time limit per test1 second
    memory limit per test256 megabytes
    inputstandard input
    outputstandard output
    Polycarp urgently needs a shovel! He comes to the shop and chooses an appropriate one. The shovel that Policarp chooses is sold for k burles. Assume that there is an unlimited number of such shovels in the shop.

    In his pocket Polycarp has an unlimited number of “10-burle coins” and exactly one coin of r burles (1 ≤ r ≤ 9).

    What is the minimum number of shovels Polycarp has to buy so that he can pay for the purchase without any change? It is obvious that he can pay for 10 shovels without any change (by paying the requied amount of 10-burle coins and not using the coin of r burles). But perhaps he can buy fewer shovels and pay without any change. Note that Polycarp should buy at least one shovel.

    Input
    The single line of input contains two integers k and r (1 ≤ k ≤ 1000, 1 ≤ r ≤ 9) — the price of one shovel and the denomination of the coin in Polycarp’s pocket that is different from “10-burle coins”.

    Remember that he has an unlimited number of coins in the denomination of 10, that is, Polycarp has enough money to buy any number of shovels.

    Output
    Print the required minimum number of shovels Polycarp has to buy so that he can pay for them without any change.

    Examples
    input
    117 3
    output
    9
    input
    237 7
    output
    1
    input
    15 2
    output
    2
    Note
    In the first example Polycarp can buy 9 shovels and pay 9·117 = 1053 burles. Indeed, he can pay this sum by using 10-burle coins and one 3-burle coin. He can’t buy fewer shovels without any change.

    In the second example it is enough for Polycarp to buy one shovel.

    In the third example Polycarp should buy two shovels and pay 2·15 = 30 burles. It is obvious that he can pay this sum without any change.

    【题解】

    枚举要买j个Shovel就好;
    j*price 或者j*price-r 如果%10==0则输出
    (从1到10枚举)

    #include <cstdio>
    
    int k, r;
    
    int main()
    {
        //freopen("F:\rush.txt", "r", stdin);
        scanf("%d%d", &k, &r);
        for (int i = 1; i <= 10; i++)
        {
            int temp = i*k;
            int temp1 = temp - r;
            if ((temp % 10) == 0 || (temp1%10)==0)
            {
                printf("%d
    ", i);
                return 0;
            }
        }
        return 0;
    }
  • 相关阅读:
    数据预处理之中心化(零均值化)与标准化(归一化)
    机器学习入门篇——感知器
    JAVA实现QQ聊天气泡
    设计模式学习笔记—策略模式
    JComboBox实现时间控件
    JTree实现QQ好友列表
    JAVA实现带图片的列表——JList
    JAVA与数据库MySQL相连接
    SQL语句
    HTML学习笔记——标签(二)
  • 原文地址:https://www.cnblogs.com/AWCXV/p/7632141.html
Copyright © 2011-2022 走看看