Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include<bits/stdc++.h>
- using namespace std;
- unsigned long int solve(unsigned int n) {
- // Table to store results of subproblems
- unsigned long int catalan[n+1];
- // Initialize first two values in table
- catalan[0] = catalan[1] = 1;
- // Fill entries in catalan[] using recursive formula
- for (int i=2; i<=n; i++) {
- catalan[i] = 0;
- for (int j=0; j<i; j++)
- catalan[i] += catalan[j] * catalan[i-j-1];
- }
- // Return last entry
- return catalan[n];
- }
- int main() {
- int t;
- cin>>t;
- while(t--){
- int n;
- cin>>n;
- int ans = solve(n);
- cout<<ans<<endl;
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement