思路： 就是简单的模拟一下，不用特殊处理中间的0(我又菜到被卡了，呜呜呜~)。
代码实现：
#include<bits/stdc++.h>
#define endl '\n'
#define null NULL
#define ll long long
#define int long long
#define pii pair<int, int>
#define lowbit(x) (x &(-x))
#define ls(x) x<<1
#define rs(x) (x<<1+1)
#define me(ar) memset(ar, 0, sizeof ar)
#define mem(ar,num) memset(ar, num, sizeof ar)
#define rp(i, n) for(int i = 0, i < n; i ++)
#define rep(i, a, n) for(int i = a; i <= n; i ++)
#define pre(i, n, a) for(int i = n; i >= a; i --)
#define IOS ios::sync_with_stdio(0); cin.tie(0);cout.tie(0);
const int way[4][2] = {{1, 0}, {-1, 0}, {0, 1}, {0, -1}};
using namespace std;
const int inf = 0x7fffffff;
const double PI = acos(-1.0);
const double eps = 1e-6;
const ll mod = 1e9 + 7;
const int N = 2e5 + 5;
int b;
char aa[N];
signed main()
{
IOS;
cin >> aa >> b;
int ans = 0, tmp = 1, len = strlen(aa);
for(int i = 1; i <= len; i ++) tmp *= 10LL;
int x = atoll(aa);
for(int i = 100; i <= 999; i ++) if((i*tmp+x)%b == 0) ans ++;
cout << ans << endl;
return 0;
}