Toistot

#include <bits/stdc++.h>
using namespace std;

#ifdef LOCAL
#define D(x) {x;}
#else
#define D(x)
#endif
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()

using ll = long long;
using pii = pair<int, int>;
using vi = vector<int>;

const int N = 19;
int pr[N], pr2[N];

ll f(ll x) {
    if (x >= 1000'000'000'000'000'000) x--;
    if (x <= 10) return 0;
    ll base = 1;
    ll a9 = 0;
    ll res = 0;
    for (int l = 1; l < N; ++l) {
        ll pbase = base;
        base *= 10;
        a9 *= 10;
        a9 += 9;
        ll pat = 1;
        for (int r = 2; l * r < N; ++r) {
            ll mult;
            if (pr[r]) mult = 1;
            else if (pr2[r]) mult = -1;
            else mult = 0;
            pat *= base;
            pat += 1;
            ll hi = x / pat;
            hi = min(hi, a9);
            ll lo = pbase;
            if (mult) {
                D(cout << l*r << " " << l << " " << r << " " << mult << endl);
                D(cout << pat << " " << pbase << " " << a9 << endl);
            }
            if (lo <= hi) res += mult*(hi-lo+1);
        }
    }
    return res;
}

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cin.exceptions(cin.failbit);
    for (int x = 2; x < N; ++x) pr[x] = 1;
    for (int x = 2; x < N; ++x) {
        for (int y = 2*x; y < N; ++y) pr[y] = 0;
    }
    for (int x = 2; x < N; ++x) {
        for (int y = 2; x*y < N; ++y) {
            if (pr[x] && pr[y] && x != y) pr2[x*y] = 1;
        }
    }
    int t;
    cin >> t;
    for (int ti = 0; ti < t; ++ti) {
        ll a, b;
        cin >> a >> b;
        cout << f(b) - f(a-1) << '\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