杭电OJ 1165（C++）

#include <iostream>
using namespace std;
const int MAXN = 1000000;
int d[4][MAXN + 5];

int main()
{
    d[0][0] = 1; //m = 0
    d[1][0] = 2; d[2][0] = 3; d[3][0] = 5; //m > 0, n = 0
    for (int i = 1; i <= MAXN; i++)
        d[0][i] = i + 1;
    for (int i = 1; i <= MAXN; i++)
        d[1][i] = i + 2;
    for (int i = 1; i <= MAXN; i++)
        d[2][i] = 2 * i + 3;
    for (int i = 1; i <= 26; i++)
        d[3][i] = 2 * d[3][i - 1] + 3;
    int m, n;
    while (cin >> m >> n)
    {
        cout << d[m][n] << endl;
    }
    return 0;
}