Submission #2150595

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
using Int = long long;
//INSERT ABOVE HERE
signed main(){
  Int m,n;
  cin>>m>>n;
  map<Int,Int> dp[3];
  function<Int(Int, Int)> dfs=[&](Int m,Int n){
    if(dp[m].count(n)) return dp[m][n];
    if(m==0) return dp[m][n]=n+1;
    if(n==0) return dp[m][n]=dfs(m-1,1);
    return dp[m][n]=dfs(m-1,dfs(m,n-1));
  };
  if(m<=2) cout<<dfs(m,n)<<endl;
  if(m==3) cout<<(1LL<<(n+3))-3<<endl;
  return 0;
}

Submission Info

Judge Result