GeeksforGeeks Solution For Hard Domain .Below You Can Find The Solution Of School Basic ,Easy ,Medium . Or Hackerrank Solution You Can Also Direct Submit Your Solution to Geeksforgeeks Same Problem .You Need to login then you can submit you answers
Problem :- Pascal Triangle
Submit Your Solution :- Click Here
Solution :-
#include<bits/stdc++.h>
using namespace std;
int com(int n,int r)
{
if(r==0)
return 1;
if(r==n)return 1;
if(r==1)return n;
return com(n-1,r)+com(n-1,r-1);
}
int main()
{
int t;
cin>>t;
while(t--)
{
int item;
cin>>item;
item--;
for(int i=0;i<=item;i++)
cout<<com(item,i)<<" ";
cout<<"\n";
}
cout<<endl;
return 0;
}
Output:-
0 Comments: