题意:给定l,r,问l,r内有多少个数满足:将数字转换为字符串后,存在子串化为数字后模3为0
解析:
1.一个数模3的结果有0,1,2。
2.一个1位数a,只有a%30时符合条件。
3.一个两位数,个位为a,十位为b,如果满足题目要求,只需满足下述条件之一即可:①a%30,②b%30,③(a%3+b%3)3。
4.一个三位数,个位为a,十位为b,百位为c,如果满足题目要求,只需满足下述条件之一即可:①a%30,②b%30,③c%30,④(a%3+b%3+c%3)3。此时发现当不满足条件①②③时必满足条件④:a%3>=1,b%3>=1,c%3>=1,所以(b*10+a)%30,(c100+b10)%30,(c100+b10+a)%3==0必有一个符合
5.由于三位数必定符合要求,所以位数大于三时也一定符合要求
AcCode
#include<algorithm>
#include<iostream>
#define int long long
using namespace std;
int T;
int l, r;
int a[105];
int sum[105];
signed main() {
cin >> T;
for(int i = 0; i <= 100; i++)
a[i] = 1, sum[i] = 0;
a[1] = 0, a[2] = 0, a[4] = 0, a[5] = 0, a[7] = 0, a[8] = 0;
a[11] = 0, a[14] = 0, a[17] = 0;
a[22] = 0, a[25] = 0, a[28] = 0;
a[41] = 0, a[44] = 0, a[47] = 0;
a[52] = 0, a[55] = 0, a[58] = 0;
a[71] = 0, a[74] = 0, a[77] = 0;
a[82] = 0, a[85] = 0, a[88] = 0;
sum[0] = 0;
for(int i = 1; i <= 100; i++)
sum[i] = sum[i - 1] + a[i];
while(T--) {
cin >> l >> r;
if(l <= 100 && r <= 100)
cout << sum[r] - sum[l-1] << endl;
else if(l <= 100 && r > 100)
cout << r - 100 + sum[100] - sum[l-1] << endl;
else
cout << r - l + 1 << endl;
}
}