23 lines
464 B
C++
23 lines
464 B
C++
|
//#include <iostream>
|
|||
|
|
//#include <vector>
|
|||
|
|
//
|
|||
|
|
//using namespace std;
|
|||
|
|
//
|
|||
|
|
//int dfs(int x, vector<int>& memo) {
|
|||
|
|
// if (memo[x] != -1) return memo[x];
|
|||
|
|
// int total = 1; // <20>Լ<EFBFBD><D4BC><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>һ<EFBFBD><D2BB><EFBFBD>Ϸ<EFBFBD><CFB7><EFBFBD><EFBFBD><EFBFBD>
|
|||
|
|
// for (int i = 1; i <= x / 2; ++i) {
|
|||
|
|
// total += dfs(i, memo);
|
|||
|
|
// }
|
|||
|
|
// memo[x] = total;
|
|||
|
|
// return total;
|
|||
|
|
//}
|
|||
|
|
//
|
|||
|
|
//int main() {
|
|||
|
|
// int n;
|
|||
|
|
// cin >> n;
|
|||
|
|
// vector<int> memo(n + 1, -1);
|
|||
|
|
// cout << dfs(n, memo) << endl;
|
|||
|
|
// return 0;
|
|||
|
|
//}
|