题目大意
定义一个“3友好数”,把一个十进制数的任意连续子串之和模3等于0,则这个数是一个“3友好数”,每次问你 [ l , r ] [l, r] [l,r]区间内有多少个“3友好数”
解题思路
思路1
主要有两种思路,第一种是数位DP,我们记录从前面的数位到目前为止,各数位之和是否出现过模3等于0,1,2的情况
Code1
#include <bits/stdc++.h>
#define ll long long
#define qc ios::sync_with_stdio(false); cin.tie(0);cout.tie(0)
#define fi first
#define se second
#define PII pair<int, int>
#define PLL pair<ll, ll>
#define pb push_back
using namespace std;
const int MAXN = 2e5 + 7;
const int inf = 0x3f3f3f3f;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const ll mod = 1e9 + 7;
inline int read()
{
int x=0,f=1;char ch=getchar();
while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}
while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;
}
ll l, r;
int a[70];
ll dp[70][2][2][2];
ll dfs(int pos, int st1, int st2, int st3, int lead, int limit){
if(pos == -1)
return st3 == 1;
if(!limit && !lead && dp[pos][st1][st2][st3] != -1)
return dp[pos][st1][st2][st3];
int up = limit ? a[pos] : 9;
ll tmp = 0;
for(int i = 0; i <= up; i++){
if(lead && i == 0){
tmp += dfs(pos-1, st1, st2, st3, lead && i == 0, limit && i == up);
continue;
}
int j = i % 3;
int c[3] = {0};
if(st1)
c[(i+1) % 3]++;
if(st2)
c[(i+2) % 3]++;
c[i%3]++;
tmp += dfs(pos-1, st1 || c[1], st2 || c[2], st3 || c[0], lead && i == 0, limit && i == up);
}
if(!limit && !lead)
dp[pos][st1][st2][st3] = tmp;
return tmp;
}
ll cal(ll x){
int p = 0;
while(x){
a[p++] = x % 10;
x /= 10;
}
return dfs(p-1, 0, 0, 0, 1, 1);
}
void solve(){
cin >> l >> r;
cout << cal(r) - cal(l-1) << endl;
}
int main()
{
#ifdef ONLINE_JUDGE
#else
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
#endif
qc;
int T;
memset(dp, -1, sizeof dp);
cin >> T;
// T = 1;
while(T--){
solve();
}
return 0;
}
思路二
我们发现,只要是一个数是大于等于三位数,就一定是“3友好数”
为什么呢?
我们假设第一位模3等于1,那么第二位模3也必须等于1(如果模3等于0则一定不行,如果模3等于2,那么与第一位相加模3就等于0),那么要满足不与前两位之和冲突,第三位模3一定等于2,但是这样第二位第三位之和一定是模3等于0,所以三位数一定是“3友好数”,所以我们暴力出0到99哪些不是3友好数即可
Code2
#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int MAXN = 2e5 + 7;
string s;
ll dp[100];
int main(){
for(int i = 1; i < 100; i++){
int k = i;
vector<int> v;
while(k){
v.push_back(k%10);
k /= 10;
}
int len = v.size();
int flag = 0;
int sum = 0;
for(int j = 0; j < v.size(); j++){
if(v[j] % 3 == 0)
flag = 1;
sum += v[j];
}
if(sum % 3 == 0)
flag = 1;
dp[i] = dp[i-1] + flag;
}
// for(int i = 1; i < 100; i++)
// cout << "i: " << i << " dp: " << dp[i] << endl;
int t;
cin >> t;
while(t--){
ll l, r;
cin >> l >> r;
ll ans1 = 0, ans2 = 0;
l--;
if(l < 100)
ans1 = dp[l];
else
ans1 = l - 100 + 1 + dp[99];
if(r < 100)
ans2 = dp[r];
else
ans2 = r - 100 + 1 + dp[99];
cout << ans2 - ans1 << endl;
}
return 0;
}
// zk