提交时间:2024-04-06 11:27:19
运行 ID: 141812
#include <iostream> #define ll long long using namespace std; ll a[1000100]; int main() { int s, n; while(cin >> s >> n) { int cur = 2; a[1] = s; int p1 = 1, p2 = 1; while(cur <= n) { ll tmp1 = a[p1] * 2 + 1, tmp2 = a[p2] * 3 + 1; ll num = min(tmp1, tmp2); if(tmp1 < tmp2) p1++; else p2++; if(num == a[cur - 1]) continue; a[cur++] = num; } cout << a[n] << endl; } return 0; }