**题意:**数的个个位拆分组成的数字能被3整除,则就+1, 问你从L到R中所有数中,有多少数符合当前定义。
题解:
- 因为是%3的关系,所以,数总共有3中状态0,1,2
- 当是3位数的时候,包含0的全符合题意
- 不包含0的数,111,112,122,222这种都符合定义,所已推广到4位的时候,我们可以看成是1+3位,所以4位的全符合
- 所以我们暴力1-100范围,然后分块,其余都可以满足条件
code:
/*
* @Author: 0iq
* @LastEditTime: 2021-07-17 18:06:17
* @CSDN blog: https://blog.csdn.net/acm_durante
* @E-mail: 1055323152@qq.com
* @ProbTitle:
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i, a, n) for (int i = a; i <= n; i++)
#define per(i, a, n) for (int i = n; i >= a; i--)
#define lowbit(x) ((x) & -(x))
#define lson p << 1, l, mid
#define rson p << 1 | 1, mid + 1, r
#define mem(a, b) memset(a, b, sizeof(a))
#define IOS \
ios::sync_with_stdio(false); \
cin.tie(0); \
cout.tie(0);
const double PI = acos(-1.0);
int dp[1005];
int main()
{
IOS int t;
for (int i = 1; i <= 100; i++)
{
int tmp = i;
int cnt = 0;
bool flag = 0;
while (tmp)
{
cnt += (tmp % 10);
if ((tmp % 10) % 3 == 0)
{
flag = 1;
break;
}
tmp /= 10;
}
if (flag)
dp[i] = dp[i - 1] + 1;
else
{
if (cnt % 3 == 0)
dp[i] = dp[i - 1] + 1;
else
dp[i] = dp[i - 1];
}
}
cin >> t;
while (t--)
{
ll l, r;
cin >> l >> r;
ll ans = 0;
if (l <= 100 && r <= 100)
ans = dp[r] - dp[l - 1];
else if (l <= 100 && r > 100)
{
ans = dp[100] - dp[l - 1] + (r - 100);
}
else
{
ans = (r - l + 1);
}
cout << ans << "\n";
}
return 0;
}