A.cpp

/* ************************************************************************** */
/*                                                                            */
/*                                                        :::      ::::::::   */
/*   solve.cpp                                          :+:      :+:    :+:   */
/*                                                    +:+ +:+         +:+     */
/*   By: ychaaibi <[email protected]>          +#+  +:+       +#+        */
/*                                                +#+#+#+#+#+   +#+           */
/*   Created: 2022/11/20 14:06:33 by ychaaibi          #+#    #+#             */
/*   Updated: 2022/12/01 09:37:14 by ychaaibi         ###   ########.fr       */
/*                                                                            */
/* ************************************************************************** */

//__________Includes__________________//
 
# include               <iostream>
# include               <algorithm>
# include               <vector>
# include               <string>
# include               <map>
# include               <unordered_map>
# include               <set>
# include               <unordered_set>
# include               <bitset>
# include               <queue>
# include               <stack>
# include               <complex>
# include               <cmath>
# include               <climits>
# include               <cstring>
 
//____________Containers_Define__________//
 
# define    vi          vector<int>
# define    vll         vector<long long>
# define    vull        vector<unsigned long long>
# define    vvi         vector<vector<int> >
# define    vvll        vector<vector<long long> >
# define    vvull       vector<vector<unsigned long long> >
# define    vs          vector<string>
# define    vvs         vector<vector<string> >
# define    vpi         vector<pair<int, int> >
# define    vvpi        vector<vector<pair<int, int> > >
# define    pii         pair<int, int>
# define    pis         pair<int, string>
# define    psi         pair<string, int>
# define    mpii        map<int, int>
# define    mpis        map<int, string>
# define    mpsi        map<string, int>
# define    mpiv        map<int, vector<int> >
# define    umpii       unordered_map<int, int>
# define    umpis       unordered_map<int, string>
# define    umpsi       unordered_map<string, int>
# define    umpiv       unordered_map<int, vector<int> >
 
//_____________Data_type________________//
 
# define    ll          long long
# define    ull         unsigned long long
# define    str         string
 
//_____________Methods__________________//
 
# define    mp          make_pair 
# define    pb          push_back 
# define    pf          push_front
# define    ub          upper_bound
# define    lb          lower_bound
# define    f           first    
# define    s           second
# define    bg          begin
# define    ed          end
# define    len         length

# define    srt(b)     sort(b.begin(), b.end())
# define    ln(s)       s.length()

using namespace std;
 
//______________Functions________________//
 
int isInt(double d)
{
    return ((double)(int)d - d == (double)0.00);
} 
 
ull     fact(ull n)
{
    ull res = 1;
    
    while (n--) res *= (n + 1);
    return (res);
}

ull     sum(ull start, ull end)
{
    return (((end - start + 1) * (2 * start + (end - start))) / 2);
}

ull     sum_n(ull n)
{
    return ((ull)((n * (n + 1)) / 2));
}

ull     C(ull n, ull k)
{
    vull    dpp(n + 1);
    vvull   dp(k + 1, dpp);
 
    for (int i=1; i<=n; i++) dp[1][i] = i;
    for (int i=2; i<=k; i++)
    {
        for (int j=1; j<=n; j++)
        {
            if (i > j)
                dp[i][j] = 0;
            else
                dp[i][j] = dp[i - 1][j - 1] + dp[i][j - 1];
        }
    }
    return (dp[k][n]);
}
 
vvull   C_Tab(ull n, ull k)
{
    vull    dpp(n + 1);
    vvull   dp(k + 1, dpp);
 
    for (int i=1; i<=n; i++) dp[1][i] = i;
    for (int i=2; i<=k; i++)
    {
        for (int j=1; j<=n; j++)
        {
            if (i > j)
                dp[i][j] = 0;
            else
                dp[i][j] = dp[i - 1][j - 1] + dp[i][j - 1];
        }
    }
    return (dp);
}
 
vpi merge_intervals(vpi   intervals)
{
    pair<int, int>  v;
    vpi             ans;
    
    if (!intervals.size()) return (ans);
    sort(intervals.begin(), intervals.end());
    v.f = intervals[0].f;
    v.s = intervals[0].s;
    for (int i=1; i<intervals.size(); i++)
    {
        if (intervals[i].f > v.s)
        {
            ans.push_back(v);
            v.f = intervals[i].f;
            v.s = intervals[i].s;
        }
        else
        {
            v.f = min(v.f, intervals[i].f);
            v.s = max(v.s, intervals[i].s);
        }
    }
    ans.push_back(v);
    return (ans);
}
 
#define mod ULONG_MAX

ull sum_ten(int s, int e)
{
    ull ans = 0;

    while (s <= e) ans = (ans + (ull)pow(10, s++)) % mod;
    return (ans % mod);
}

int eucli(int x1, int x2, int y1, int y2)
{
    double res = sqrt(pow(x1 - x2, 2) + pow(y1 - y2, 2));
    
    return ((int)res + !isInt(res));
}

bool    is_divisor(string s, string div)
{
    if (s.length() % div.length()) return (false);

    for (int i=0; i<s.length(); i += div.length())
        if (s.compare(i, div.length(), div)) return (false);
    return (true);
}

ll  operation(ll a, ll b)
{
    ll  ans = 0;
    while (a and ++ans) a /= b;
    return (ans);
}

void    solve()
{
    ll  a, b;

    cin >> a >> b;
    ll  ans = LONG_MAX;
    ll  res = 0;
    int save = (b == 1);
    b += (b == 1);
    ll  t = b;
    while (true)
    {
        ll  res = operation(a, t) + (t - b);
        if (res >= 32) break ;
        ans = min(ans, res);
        t++;
    }
    cout << ans + save << endl;
}

int main()
{
    int     cases = 1;
    
    cin >> cases;
    while (cases--) solve();
    return (0);
}