HDU 1028: Ignatius and the Princess III

///@author Sycamore, ZJNU
///@date 7/28/2017
#include<bits/stdc++.h>
using namespace std;
const int MAXN=125;
int main()
{
    int n;
    while(cin>>n)
    {
        vector<int>p(n+1),q(n+1);
        for(int i=0;i<=n;i++)
        {
            p[i]=1;
            q[i]=0;
        }

        for(int i=2;i<=n;i++)//q
        {
            for(int j=0;j<=n;j++)
                for(int k=0;k+j<=n;k+=i)
                    q[j+k]+=p[j];
            p=move(q);
            q.resize(n+1);
        }

        cout<<p[n]<<‘\n‘;
    }
    return 0;
}