A. Add and Divide(思维+数学)

https://codeforces.com/contest/1485/problem/A

---

思路:

和上一次的B类似，也是达不到1e9的数据范围的。

当b至少为2的时候，1e9的除法也就最多几十次除到了0.所以最后答案必然不会很大。那固定一个+100次的小范围枚举出一个最小值就好。

 

#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=1e5;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL solve(LL a,LL b){
    LL num=0;
    while(a>0){
        a/=b;
        num++;
    }
    return num;
}
int main(void)
{
  cin.tie(0);std::ios::sync_with_stdio(false);
  LL t;cin>>t;
  while(t--){
    LL a,b;cin>>a>>b;
    if(a==b){
        cout<<"2"<<"\n";
    }
    else if(a<b){
        cout<<"1"<<"\n";
    }
    else{
        LL ans=0x3f3f3f3f;
        for(LL i=b;i<=b+1000;i++){
            if(i==1) continue;
            LL temp=a;
            LL times=solve(a,i);
          ///  debug(times);
            ans=min(ans,times+i-b);
        }
        cout<<ans<<"\n";
    }
  }
return 0;
}