Submission #70304209

---

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <deque>
#include <queue>
#include <numeric>
#include <stack>
#include <cassert>
#include <cstring>
#include <cmath>
#include <random>
#include <unordered_map>
#include <unordered_set>
#include <iomanip>
#include <chrono>
#include <sstream>
#include <limits>
#include <functional>
using namespace std;
#define endl '\n'
// #define LOCAL

using int64 = int64_t;
using uint64 = unsigned long long;
using int128 = __int128_t;

#ifdef LOCAL
#include "src/debug.h"
#else
#define debug(...) 42
#endif

int64 C, D;

int64 flSqrt(int64 x) {
    int64 y = sqrt(x);
    while (y * y > x) y--;
    while ((y + 1) * (y + 1) <= x) y++;
    return y;
}

void solve() {
    cin >> C >> D;
    int64 ans = 0;
    int64 xmin = 1, xmax = 9, k = 10;
    while (xmin <= C + D) {
        int64 l = max(xmin, C + 1);
        int64 r = min(xmax, C + D);
        if (l <= r) {
            int64 candL = C * k + l, candR = C * k + r;
            ans += flSqrt(candR) - flSqrt(candL - 1);
        }
        xmin *= 10;
        xmax = xmax * 10 + 9;
        k *= 10;
    }
    cout << ans << endl;
}

signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int T;
    cin >> T;
    while (T--) {
        solve();
    }
    return 0;
}

Submission Info

Judge Result