$Hyperlink$

https://dev.xjoi.net/contest/1289/problem/1

---

$Description$

若一个数$a$通过旋转之后可以得到$b$，则称$(a,b)$是友好数对，给定$L,R$求$L\sim R$之间的友好数对个数

数据范围：$L\le R\le 2\times 10^6$

---

$Solution$

暴力

时间复杂度：$O(Tlo{g}_{10}R(R-L+1))$

---

$Code$

#pragma GCC optimize(2)
#include<cstdio>
#include<cctype>
#include<algorithm>
#define LL long long
#define N 2000000
using namespace std;int t,pw,l,r,ans;
inline LL read()
{char c;LL d=1,f=0;while(c=getchar(),!isdigit(c)) if(c=='-') d=-1;f=(f<<3)+(f<<1)+c-48;while(c=getchar(),isdigit(c)) f=(f<<3)+(f<<1)+c-48;return d*f;
}
signed main()
{t=read();while(t--){l=read();r=read();ans=0;for(register int i=l;i<=r;i++){int x=i,pw=1,j=0;while(x) x/=10,j++,pw=(pw<<3)+(pw<<1);pw/=10;x=i;do{int high=x/pw;x%=pw;x=(x<<3)+(x<<1)+high;if(x<=r&&x>i) ans++;}while(x!=i);}printf("%d\n",ans);}
}