Pagini recente » Cod sursa (job #2135758) | Cod sursa (job #1166218) | Cod sursa (job #3241766) | Cod sursa (job #2070059) | Cod sursa (job #197679)
Cod sursa(job #197679)
#include<stdio.h>
long n,m,i,a,b,v,s[500][500],j;
int main()
{
freopen("reconst.in","r",stdin);
freopen("reconst.out","w",stdout);
scanf("%ld%ld",&n,&m);
for(i=1;i<=m;++i){scanf("%ld%ld%ld",&a,&b,&v);s[a][b]=v;}
for(i=1;i<=n;++i)
{
for(j=1;j<=i;++j)
if(s[j][n-i+j]==0)
{
if(j!=1)s[j][n-i+j]=s[j-1][n-i+j]-s[j-1][n-i+j-1];
else s[j][n-i+j]=1;
}
}
for(i=1;i<=n;++i)printf("%ld ",s[i][i]);
printf("\n");
return 0;
}