题意:找出满足conc(a,b)的a,b关系对数量;
思路:规律题,发现只要b是9,99,999等等的都满足条件
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int main()
{
int T;
ll a,b,cnt;
scanf("%d",&T);
while(T--)
{
cnt=0;
scanf("%lld %lld",&a,&b);
ll num=0;
while(b>=num)
{
num=num*10+9;
cnt++;
}
printf("%lld\n",a*(cnt-1));
}
}