CF 732A Buy a Shovel

题目地址：http://codeforces.com/problemset/problem/732/A
A. 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
inputCopy
117 3
outputCopy
9
inputCopy
237 7
outputCopy
1
inputCopy
15 2
outputCopy
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.
题目翻译：这个人有一张A元的纸币，还有无数张10元纸币，他要去买铲子，输入铲子的单价和A，求这个人不需要商店找零的情况下最少能买多少铲子。
解题思路：注意有两种情况，一种是铲子总价的个位数上数字正好是A，另一种情况是铲子总价个位数上数字是0，这两种情况都不需要找零。代码里优化了一下铲子总价的计算，因为题目只需要个位数的判断，而影响个位数的只有单价的个位数，稍微优化一下怕爆了，(:3J∠)

#include<iostream>
using namespace std;
int main()
{
	long long a,b,ans,i;
	cin >> a >> b;
	a = a%10;
	for(i = 1;;i++)
	{
	ans = i*a%10;
	if(ans == b||ans == 0)break;	
	}
	cout << i << endl;
	return 0;
 }