Advertisement
Guest User

Untitled

a guest
Nov 21st, 2019
155
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.67 KB | None | 0 0
  1. #define loop(i,from,to) for (int i = from; i < to; ++i)
  2. #include <bits/stdc++.h>
  3.  
  4. using std::cin;
  5. using std::cout;
  6. using std::endl;
  7. using std::vector;
  8. using std::string;
  9. using std::map;
  10. using std::pair;
  11.  
  12. const int INF = 1e9+7;
  13. const double eps = 1e-6;
  14.  
  15. vector<long long> dyn;
  16. long long Ladder(int n) {
  17. if (n < 1) return 0;
  18. if (dyn[n] == -1) {
  19. dyn[n] = 0;
  20. for (int i = 1; i < n; ++i)
  21. dyn[n] += Ladder(n - i);
  22. }
  23. return dyn[n];
  24. }
  25.  
  26.  
  27. signed main() {
  28. std::ios::sync_with_stdio(false);
  29. cin.tie(0);
  30. int n; cin >> n;
  31. dyn.assign(n + 1, -1);
  32. dyn[1] = 1;
  33. cout << Ladder(n);
  34. //std::cout << "Hello World!\n";
  35. return 0;
  36. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement