思路:
- 如果只判断子串是否有13的话非常简单,这题还加了一个条件就是要被13整除;
- 这里就要用到模运算的性质,即(a+b+c)%d = (a%d + b%d + c%d)%d。
Code:
#include<bits/stdc++.h>
#define M(a, b) memset(a, b, sizeof(a))
using namespace std;
typedef long long ll;
int a[15], dp[15][14][3];
ll dfs(int cur, int mod, int sta, bool limit){
if (cur == 0) return sta == 2 && !mod;
if (!limit && ~dp[cur][mod][sta]) return dp[cur][mod][sta];
int up = limit ? a[cur] : 9;
ll ans = 0;
for (int i = 0; i <= up; ++i){
int m = (mod * 10 + i) % 13;
if (sta == 2 || (sta == 1 && i == 3)) ans += dfs(cur-1, m, 2, limit && a[cur] == i);
else if (i == 1) ans += dfs(cur-1, m, 1, limit && a[cur] == i);
else ans += dfs(cur-1, m, 0, limit && a[cur] == i);
}
if (!limit) dp[cur][mod][sta] = ans;
return ans;
}
ll cal(ll n){
int len = 0;
while(n){
a[++len] = n % 10;
n /= 10;
}
return dfs(len, 0, 0, 1);
}
int main()
{
ll n;
while(~scanf("%lld", &n)){
M(dp, -1);
printf("%lld\n", cal(n));
}
return 0;
}