CodeForces 732 A.Buy a Shovel（水~）

Description
有无限个10元硬币和一个r元金币，一件物品k元，问至少需要几件物品才不要找零
Input
两个整数k和r(1<=k<=1000,1<=r<=9)
Output
Sample Input
117 3
Sample Output
9
Solution
枚举件数，至多10件
Code

#include<cstdio>#include<iostream>#include<cstring>#include<algorithm>#include<cmath>#include<vector>#include<queue>#include<map>#include<set>#include<ctime>using namespace std;typedef long long ll;#define INF 0x3f3f3f3f#define maxn 1111int k,r;int main(){    while(~scanf("%d%d",&k,&r))    {        for(int i=1;i<=10;i++)            if(i*k%10==0||i*k%10==r)            {                printf("%d\n",i);                break;            }    }    return 0;}