Catalan numbers/Pascal's triangle: Difference between revisions
Content deleted Content added
Created page with "{{task}} The task is to print out the first 15 Catalan numbers by extracting them from Pascal's triangle, see [http://milan.milanovic.org/math/english/fibo/fibo4.html Catalan ..." |
mNo edit summary |
||
Line 2: | Line 2: | ||
The task is to print out the first 15 Catalan numbers by extracting them from Pascal's triangle, see [http://milan.milanovic.org/math/english/fibo/fibo4.html Catalan Numbers and the Pascal Triangle]. |
The task is to print out the first 15 Catalan numbers by extracting them from Pascal's triangle, see [http://milan.milanovic.org/math/english/fibo/fibo4.html Catalan Numbers and the Pascal Triangle]. |
||
=={{header|C++}}== |
|||
<lang cpp> |
<lang cpp> |
||
// Generate Catalan Numbers |
// Generate Catalan Numbers |
Revision as of 11:37, 26 April 2013
![Task](http://static.miraheze.org/rosettacodewiki/thumb/b/ba/Rcode-button-task-crushed.png/64px-Rcode-button-task-crushed.png)
You are encouraged to solve this task according to the task description, using any language you may know.
The task is to print out the first 15 Catalan numbers by extracting them from Pascal's triangle, see Catalan Numbers and the Pascal Triangle.
C++
<lang cpp> // Generate Catalan Numbers // // Nigel Galloway: June 9th., 2012 //
- include <iostream>
int main() {
const int N = 15; int t[N+2] = {0,1}; for(int i = 1; i<=N; i++){ for(int j = i; j>1; j--) t[j] = t[j] + t[j-1]; t[i+1] = t[i]; for(int j = i+1; j>1; j--) t[j] = t[j] + t[j-1]; std::cout << t[i+1] - t[i] << " "; } return 0;
}</lang>
- Produces:
1 2 5 14 42 132 429 1430 4862 16796 58786 208012 742900 2674440 9694845