Tsinsen A1130 数的计算

http://oj.tsinsen.com/A1130

分析：裸的dp

代码：

#include "bits/stdc++.h"using namespace std;int dp[1050];int main() {    for (int i = 1; i < 1050; ++i) {        dp[i] = 1;        for (int k = 0, sup = i / 2; k <= sup; ++k)            dp[i] += dp[k];    }    int q; scanf("%d", &q);    printf("%d\n", dp[q]);    return 0;}