Seekul
0
Q:

Pascal Triangle gfg

#include <stdio.h>
#include <stdlib.h>

int main()
{
  int N;

  scanf("%d", &N);
  int pascalArray[N + 1][N + 1];
  int i, j;
  if(0 <= N && N <= 20)
  {
      for (i = 0; i < N + 1; i++)
      {
        for(j = 0; j <= i; j++)
        {
            if(j == 0 || j == i)
                pascalArray[i][j] = 1;
            else
                pascalArray[i][j] = pascalArray[i-1][j-1] + pascalArray[i-1][j];
            if (i == N)
                printf("%d ", pascalArray[i][j]);
        }
      }
  }
  return 0;
}
0
// C++ program for Pascal’s Triangle 
// A O(n^2) time and O(1) extra space  
// function for Pascal's Triangle 
#include <bits/stdc++.h> 
  
using namespace std; 
void printPascal(int n) 
{ 
      
for (int line = 1; line <= n; line++) 
{ 
    int C = 1; // used to represent C(line, i) 
    for (int i = 1; i <= line; i++)  
    { 
          
        // The first value in a line is always 1 
        cout<< C<<" ";  
        C = C * (line - i) / i;  
    } 
    cout<<"\n"; 
} 
} 
  
// Driver code 
int main() 
{ 
    int n = 5; 
    printPascal(n); 
    return 0; 
} 
  
// This code is contributed by Code_Mech 
0

New to Communities?

Join the community