Educational Codeforces Round 80 (Rated for Div. 2) B. Yet Another Meme Problem

time limit per test1 second
memory limit per test256 megabytes
inputstandard input
outputstandard output
Try guessing the statement from this picture http://tiny.cc/ogyoiz.

You are given two integers A and B, calculate the number of pairs (a,b) such that 1≤a≤A, 1≤b≤B, and the equation a⋅b+a+b=conc(a,b) is true; conc(a,b) is the concatenation of a and b (for example, conc(12,23)=1223, conc(100,11)=10011). a and b should not contain leading zeroes.

Input
The first line contains t (1≤t≤100) — the number of test cases.

Each test case contains two integers A and B (1≤A,B≤109).

Output
Print one integer — the number of pairs (a,b) such that 1≤a≤A, 1≤b≤B, and the equation a⋅b+a+b=conc(a,b) is true.

Example
inputCopy
3
1 11
4 2
191 31415926
outputCopy
1
0
1337
Note
There is only one suitable pair in the first test case: a=1, b=9 (1+9+1⋅9=19).

#include<iostream>
#include<cmath>
using namespace std;
typedef long long ll;
int main() {
    ll t,n,d;
    cin>>t;
    while(t--) {
        cin>>n>>d;
        ll x=sqrt(d);
        if(x+ceil((1.0)*d/(x+1))<=n)
            cout<<"YES"<<endl;
        else {
            x=sqrt(d)-1;
            if(x+ceil((1.0)*d/(x+1))<=n)
                cout<<"YES"<<endl;
            else
                cout<<"NO"<<endl;
        }
    }
    return 0;
}