Submission #1865479

---

Source Code Expand

#include <iomanip>
#include <random>
#include <time.h>
#include <vector>
#include <queue>
#include <functional>
#include <map>
#include <string>
#include <cstdlib>
#include <typeinfo>
#include <math.h>
#include <algorithm>
#include <iostream>
#include <list>
#include <stack>
#include <set>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;

int main() {
	ll m, n, dp[4][65] = {};
	cin >> m >> n;
	for (int i = 0; i <65; i++) dp[0][i] = i + 1;
	dp[1][0] = 2; dp[2][0] = 3; dp[3][0] = 5;
	for (int i = 1; i <= 3; i++) {
		for (int j = 1; j <= 60; j++) {
			dp[i][j] = dp[i - 1][dp[i][j - 1]];
		}
	}
	cout << dp[m][n] << endl;
	return 0;
}

Submission Info

Judge Result