国王的宝盒
2023-08-06 14:57:42
发布于:浙江
using namespace std;
const long long N = 1000005;
long long q2[N],q3[N],a,n,h2,t2,h3,t3;
int main(){
while(cin>>a>>n){
h2 = t2 = h3 = t3 = 0;
long long count = 1;
q2[++t2] = 2 * a + 1;
q3[++t3] = 3 * a + 1;
while(count < n){
if(q2[h2 + 1] < q3[h3 + 1]) a = q2[++h2];
else if(q2[h2 + 1] > q3[h3 + 1]) a = q3[++h3];
else a = q3[++h3],++h2;
q2[++t2] = 2 * a + 1;
q3[++t3] = 3 * a + 1;
count++;
}
cout<<a<<endl;
}
return 0;
}
这里空空如也
有帮助,赞一个