Submission #70364105

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

ll T, c, d;

ll f(ll x)
{
	ll res = sqrt(x);
	while (res * res > x) res--;
	while ((res + 1) * (res + 1) <= x) res++;
	return res;
}

int main()
{
	cin >> T;
	
	while (T--)
	{
		cin >> c >> d;
		
		ll x = 10, mn = 1, mx = 9, ans = 0;
		while (mn <= c + d)
		{
			ll l = max(c + 1, mn);
			ll r = min(c + d, mx);
			if (l <= r)
			{
				ll tl = c * x + l;
				ll tr = c * x + r;
				ans += (f(tr) - f(tl - 1));
			}
			
			mn *= 10;
			mx = (mx + 1) * 10 - 1;
			x *= 10;
		}
		cout << ans << endl;
	}
	
	return 0;
}

Submission Info

Judge Result