A. Buy a Shovel

藤蔓疯长

于 2022-07-11 18:37:23 发布

阅读量143

点赞数

分类专栏： codeforce 文章标签： c++

本文链接：https://blog.csdn.net/qq_62079079/article/details/125727571

版权

codeforce 专栏收录该内容

87 篇文章 1 订阅

订阅专栏

该博客讨论了一个关于找零问题的算法题目，其中Polycarp需要购买铲子并用有限种类的硬币支付。题目要求找出最小的铲子数量使得支付金额可以被10整除或减去一个特定面额的硬币后被整除，从而无需找零。通过遍历不同购买数量，检查是否满足条件，博主给出了一个简单的C++解决方案。

摘要由CSDN通过智能技术生成

Problem - A - Codeforces

A. Buy a Shovel

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard 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

Copy

117 3

output

Copy

input

Copy

237 7

output

Copy

input

Copy

15 2

output

Copy

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

题意：你有无限个的10块和一个r元的，你最少买几把铲子可以不用找零钱，所以要么被10整除，要么减去零钱r后被整除，正好整除就行。

#include<iostream>
using namespace std;
int k,r;
int main()
{
    cin>>k>>r;
    for(int i=1;;i++)
    {
        if((i*k)%10==0||(i*k-r)%10==0)
        {
            cout<<i;
            return 0;
            
        }
    }
}