Submission #69793646

---

Source Code Expand

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#define ll long long
#define getchar() (p1==p2&&(p2=(p1=buf)+fread(buf,1,1<<21,stdin),p1==p2)?EOF:*p1++)
using namespace std;
const int N = 1e5+5;
int p[10];
inline int get(int x)
{int s = 0;while(x)x /= 10,s++;return s;}
inline int solve(int l,int r)
{
    int x = get(l),y = get(r);
    if(x == y)return r-l+1;
    int s1 = p[y-1]-max(p[y-2],l),s2 = r-p[y-1]+1;
    if(r < 2*p[y-1])
        s2 += p[y-1]-1-max({r%p[y-1],r/10,l-1});
    return max(s1,s2);
}
char buf[1<<21],*p1,*p2;
inline int rd()
{
    char c;int f = 1;
    while(!isdigit(c = getchar()))if(c=='-')f = -1;
    int x = c-'0';
    while(isdigit(c = getchar()))x = x*10+(c^48);
    return x*f;
}
int main()
{
    // freopen(".in","r",stdin);
    // freopen(".out","w",stdout);
    for(int i = p[0] = 1;i <= 9;i++)p[i] = p[i-1]*10;
    for(int t = rd();t--;)
    {
        int l = rd(),r = rd();
        printf("%d\n",solve(l,r));
    }
    return 0;
}

Submission Info

Judge Result