a044: 空間切割 FYI: https://yunlinsong.blogspot.com/2016/02/blog-post_13.html

a044.cpp

#include <iostream>
#include <cmath>

using namespace std;

int numD( short n )
{
    if( n <= 3 )
        return pow(2.0, n);
    else
    {
        int k = n - 1;
        int c = (k * k + k + 2)/2;
        n = n -1;
        return numD(n) + c;
    }
}

int main()
{
    int n;
    int d;

    while( cin >> n )
    {
        d = numD(n);
        cout << d << endl;
    }

    return 0;
}