```
class Solution {
public:
vector<int> getRow(int rowIndex) {
long temp , prev,i;
vector<int> v;
if(rowIndex<0)
return v;
prev = 1;
v.push_back(prev);
for(int i=1;i<=rowIndex;i++){
int t = (v[i-1] * (rowIndex-i+1))/(i);
v.push_back(t);
}
return v;
}
};
Same Solution is used for generating each row in the Problem Pascals triangle I is accepted but this
is giving wrong answer for n = 30
```