#define ATCODER #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; using ll = long long; #define FOR(i, a, b) for(ll i=(a); i<(b);i++) #define REP(i, n) for(ll i=0; i<(n);i++) #define ROF(i, a, b) for(ll i=(b-1); i>=(a);i--) #define PER(i, n) for(ll i=n-1; i>=0;i--) #define VL vector #define VVL vector> #define VP vector< pair > #define VVP vector>> #define all(i) begin(i),end(i) #define SORT(i) sort(all(i)) #define EXISTBIT(x,i) (((x>>i) & 1) != 0) #define MP(a,b) make_pair(a,b) #ifdef ATCODER #include using namespace atcoder; using mint = modint1000000007; using mint2 = modint998244353; #endif template vector read(size_t n) { vector ts(n); for (size_t i = 0; i < n; i++) cin >> ts[i]; return ts; } template void read_tuple_impl(TV&) {} template void read_tuple_impl(TV& ts) { get(ts).emplace_back(*(istream_iterator(cin))); read_tuple_impl(ts); } template decltype(auto) read_tuple(size_t n) { tuple...> ts; for (size_t i = 0; i < n; i++) read_tuple_impl(ts); return ts; } template T det2(array ar) { return ar[0] * ar[3] - ar[1] * ar[2]; } template T det3(array ar) { return ar[0] * ar[4] * ar[8] + ar[1] * ar[5] * ar[6] + ar[2] * ar[3] * ar[7] - ar[0] * ar[5] * ar[7] - ar[1] * ar[3] * ar[8] - ar[2] * ar[4] * ar[6]; } template bool chmax(T& tar, T src) { return tar < src ? tar = src, true : false; } template bool chmin(T& tar, T src) { return tar > src ? tar = src, true : false; } template void inc(vector& ar) { for (auto& v : ar) v++; } template void dec(vector& ar) { for (auto& v : ar) v--; } template vector> id_sort(vector& a) { vector res(a.size()); for (int i = 0; i < a.size(); i++)res[i] = MP(a[i], i); SORT(res); return res; } using val = ll; using func = ll; val op(val a, val b) { return max(a, b); } val e() { return 0; } val mp(func f, val a) { return a + f; } func comp(func f, func g) { return f + g; } func id() { return 0; } // Rook ll dxr[4] = { 1,0,-1,0 }; ll dyr[4] = { 0,1,0,-1 }; // Bishop ll dxb[4] = { -1,-1,1,1 }; ll djb[4] = { -1,1,-1,1 }; // qween ll dxq[8] = { 0,-1,-1,-1,0,1,1,1 }; ll dyq[8] = { -1,-1,0,1,1,1,0,-1 }; // コードメモがめんどくさいのでとりあえず出しちゃう void solve() { ll q; cin >> q; auto [l, r] = read_tuple(q); ll mx = 1000000; VL border = { 1 }; ll add = 1; VL ans(q); while (border.back() < mx) { border.push_back(border.back() + add); add++; } ll bs = border.size() - 1; vector>> rli(bs); REP(i, q) { ll id = lower_bound(all(border), l[i] + 1) - border.begin() - 1; rli[id].emplace_back(r[i] + 1, l[i], i); } REP(i, bs)SORT(rli[i]); REP(i, bs) { ll nl = border[i]; ll nr = border[i]; VL c(mx + 1); c[0] = 1; ll tmp = 0; for (auto& [r0, l0, i0] : rli[i]) { while (nr < r0) { if (c[nr] != 0) { nr++; continue; } tmp++; ll vv = nr * 2; while (vv <= mx) { c[vv]++; vv += nr; } nr++; } while (nl < l0) { queue que0, que1; que0.push(nl); tmp -= c[nl] == 0; c[nl] = 0; while (!que0.empty() || !que1.empty()) { while (!que0.empty()) { ll v = que0.front(); que0.pop(); if (c[v] != 0)continue; ll vv = v * 2; if (v != nl)tmp++; while (vv <= mx) { c[vv]++; if (c[vv] == 1) { que1.push(vv); } vv += v; } } while (!que1.empty()) { ll v = que1.front(); que1.pop(); ll vv = v * 2; if (v != nl)tmp--; while (vv <= mx) { c[vv]--; if (c[vv] == 0) { que0.push(vv); } vv += v; } } } nl++; } while (nl > l0) { queue que0,que1; que1.push(nl-1); tmp++; nl--; while (!que0.empty() || !que1.empty()) { while (!que0.empty()) { ll v = que0.front(); que0.pop(); if (c[v] != 0)continue; ll vv = v * 2; if (v != nl)tmp++; while (vv <= mx) { c[vv]++; if (c[vv] == 1) { que1.push(vv); } vv += v; } } while (!que1.empty()) { ll v = que1.front(); que1.pop(); ll vv = v * 2; if (v != nl)tmp--; while (vv <= mx) { c[vv]--; if (c[vv] == 0) { que0.push(vv); } vv += v; } } } } ans[i0] = tmp; } } REP(i, q) { cout << ans[i] << "\n"; } return; } int main() { ll t = 1; //cin >> t; while (t--) { solve(); } return 0; }