Cod sursa(job #3265757)
Utilizator | Data | 2 ianuarie 2025 22:39:18 | |
---|---|---|---|
Problema | Pascal | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.38 kb |
#include <iostream>
using namespace std;
int main()
{
int n,k,i,j,a[1000][1000];
cin>>n>>k;
for(i=1;i<=n;++i)
{
a[i][0]=a[i][i]=1;
for(j=1;j<=i-1;++j)
a[i][j]=(a[i-1][j]+a[i-1][j-1])%k;
}
for(i=0;i<=n-1;++i)
{
for(j=0;j<=i-1;++j)
cout<<a[i][j]<<" ";
cout<<endl;
}
return 0;
}