Toistot

#include <iostream>
#include <algorithm>
using namespace std;
typedef long long ll;
ll rep(ll x, int n) {
	ll k=1;
	while(k<=x) k*=10;
	ll r=0;
	const ll M = 2e18;
	ll mk = M/k;
	for(int i=0; i<n; ++i) {
		//if (k*r > M)
		if (r > mk) return M;
		r = k*r + x;
	}
	return r;
}
ll maxV(ll t, int n) {
	ll hi=1;
	while(rep(hi,n)<=t) hi*=2;
	ll low=0;
	while(hi-low>1) {
		ll m=(low+hi)/2;
		if (rep(m,n)<=t) low=m;
		else hi=m;
	}
	return low;
}
ll minV(ll t, int n) {
	ll hi=1;
	while(rep(hi,n)<t) hi*=2;
	ll low=0;
	while(hi-low>1) {
		ll m=(low+hi)/2;
		if (rep(m,n)<t) low=m;
		else hi=m;
	}
	return hi;
}
const int ps[] = {2,3,5,7,11,13,17};
int main() {
	int t;cin>>t;
	while(t--) {
		ll a,b;cin>>a>>b;
		ll res=0;
		for(int k: ps) {
			ll x = minV(a,k);
			ll y = maxV(b,k);
			if (y>=x) res += y-x+1;
		}
		cout<<res<<'\n';
	}
}

Test 1

Group: 1, 2, 3, 4

Verdict: ACCEPTED

Test 2

Group: 2, 3, 4

Verdict: WRONG ANSWER

Test 3

Group: 3, 4

Verdict: WRONG ANSWER

Test 4

Group: 4

Verdict: WRONG ANSWER

Test 5

Group: 1, 2, 3, 4

Verdict: ACCEPTED

Test 6

Group: 4

Verdict: WRONG ANSWER