题目描述
给出两个数a,b,求出[a,b]中各位数字之和能整除原数的数的个数。
输入输出格式
输入格式:
一行,两个整数a和b
输出格式:
一个整数,表示答案
输入输出样例
输入样例#1: 复制
10 19
输出样例#1: 复制
3
明显的数位dp;
我们要求的是每位数字和可以被原数整除的数个数;
但范围达到,数组范围肯定开不下;
怎么办?考虑模数;
我们枚举模数,如果此时的总和可以整除模数且当前的模数就是各位数字之和,那么答案就+1;
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstdlib>
#include<cstring>
#include<string>
#include<cmath>
#include<map>
#include<set>
#include<vector>
#include<queue>
#include<bitset>
#include<ctime>
#include<deque>
#include<stack>
#include<functional>
#include<sstream>
//#include<cctype>
//#pragma GCC optimize("O3")
using namespace std;
#define maxn 100005
#define inf 0x3f3f3f3f
#define INF 999999999999999
#define rdint(x) scanf("%d",&x)
#define rdllt(x) scanf("%lld",&x)
#define rdult(x) scanf("%lu",&x)
#define rdlf(x) scanf("%lf",&x)
#define rdstr(x) scanf("%s",x)
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int U;
#define ms(x) memset((x),0,sizeof(x))
const long long int mod = 1e9 + 7;
#define Mod 100003
#define sq(x) (x)*(x)
#define eps 1e-3
typedef pair<int, int> pii;
#define pi acos(-1.0)
const int N = 1005;
#define REP(i,n) for(int i=0;i<(n);i++)
inline ll rd() {
ll x = 0;
char c = getchar();
bool f = false;
while (!isdigit(c)) {
if (c == '-') f = true;
c = getchar();
}
while (isdigit(c)) {
x = (x << 1) + (x << 3) + (c ^ 48);
c = getchar();
}
return f ? -x : x;
}
ll gcd(ll a, ll b) {
return b == 0 ? a : gcd(b, a%b);
}
ll sqr(ll x) { return x * x; }
/*ll ans;
ll exgcd(ll a, ll b, ll &x, ll &y) {
if (!b) {
x = 1; y = 0; return a;
}
ans = exgcd(b, a%b, x, y);
ll t = x; x = y; y = t - a / b * y;
return ans;
}
*/
ll dp[30][200][200];
int a[30];
ll sum;
ll MOD;
ll dfs(int pos, int lead, int limit, ll sum, ll mod) {
ll ans = 0;
if (pos == 0 && lead) {
if (sum == MOD && mod == 0)return 1;
return 0;
}
if (limit == 0 && lead&&dp[pos][sum][mod] != -1)return dp[pos][sum][mod];
int up = limit ? a[pos] : 9;
for (int i = 0; i <= up; i++) {
ans += dfs(pos - 1, lead || i, limit && (i == up), sum + i, (mod * 10 + i) % MOD);
}
if (lead&&limit == 0)dp[pos][sum][mod] = ans;
return ans;
}
ll sol(ll x) {
int pos = 0;
while (x) {
a[++pos] = x % 10; x /= 10;
}
ll ans = 0;
for (MOD = 1; MOD <= 9 * pos; MOD++) {
memset(dp, -1, sizeof(dp));
ans += dfs(pos, 1, 1, 0, 0);
}
return ans;
}
int main()
{
//ios::sync_with_stdio(false);
ll a, b; rdllt(a); rdllt(b);
cout << sol(b) - sol(a - 1) << endl;
return 0;
}