题目:
C++代码:
#includeusing namespace std; const int N = 1010; int f[N]; int n; int main() { cin >> n; f[1] = 1; for (int i = 2; i <= n; i++) { f[i] = 1; for (int j = 1; j <= i / 2; j++) f[i] += f[j]; } cout << f[n] << endl; return 0; }
算法:递归

题目:
C++代码:
#includeusing namespace std; const int N = 1010; int f[N]; int n; int main() { cin >> n; f[1] = 1; for (int i = 2; i <= n; i++) { f[i] = 1; for (int j = 1; j <= i / 2; j++) f[i] += f[j]; } cout << f[n] << endl; return 0; }
算法:递归