题目

#include <iostream>
#include <algorithm>
#include <math.h>
using namespace std;
int a[10000000+1];
int basic=1,num=1,t=0;
int dfs(int basic){
    if (t==num){
        return 0;
    }
    a[t]=2*basic+1;
    t++;
    a[t]=3*basic+1;
    t++;
    dfs(a[t-1]);
    dfs(a[t]);
    return 0;
}
int main()
{
    while (true){
        cin>>basic>>num;
        a[0]=basic;
        dfs(basic);
        sort(a,a+num);
        cout<<a[num-1];
        t=0;
    }
    return 0;
}