Advertisement
lelouche29

Unique_Bst_Samsung

Sep 18th, 2019
182
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 0.70 KB | None | 0 0
  1. #include <iostream>
  2. #include<bits/stdc++.h>
  3. using namespace std;
  4.  
  5. unsigned long int solve(unsigned int n) {
  6.     // Table to store results of subproblems
  7.     unsigned long int catalan[n+1];
  8.  
  9.     // Initialize first two values in table
  10.     catalan[0] = catalan[1] = 1;
  11.  
  12.     // Fill entries in catalan[] using recursive formula
  13.     for (int i=2; i<=n; i++) {
  14.         catalan[i] = 0;
  15.         for (int j=0; j<i; j++)
  16.             catalan[i] += catalan[j] * catalan[i-j-1];
  17.     }
  18.  
  19.     // Return last entry
  20.     return catalan[n];
  21. }
  22. int main() {
  23.     int t;
  24.     cin>>t;
  25.     while(t--){
  26.         int n;
  27.         cin>>n;
  28.         int ans = solve(n);
  29.         cout<<ans<<endl;
  30.     }
  31. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement