Pagini recente » Cod sursa (job #29810) | Cod sursa (job #3210571) | Cod sursa (job #2549361) | Cod sursa (job #2205726) | Cod sursa (job #46767)
Cod sursa(job #46767)
#include <stdio.h>
#define NM 20
FILE *fin,*fout;
long saux;
long pas[NM][NM],sum[NM];
void genpas(long k)
{long i,j;
pas[1][1]=pas[2][1]=pas[2][2]=1;
for (i=3;i<=k;i++)
for (j=1;j<=i;j++)
pas[i][j]=pas[i-1][j]+pas[i-1][j-1];
}
void gensum (int k)
{long i,j,l;
for (i=1;i<=(((k-1)>>1)+1);i++)
{
for (j=1;j<=i;j++)
for (l=j;l<=(k+j-i);l++)
{
sum[i]+=pas[l][j];
sum[k-i+1]=sum[i];
}
}
}
int main()
{
long n,S,i,j;
fin=fopen("triunghi.in","rt");
fout=fopen("triunghi.out","wt");
fscanf (fin,"%ld %ld\n",&n,&S);
n=8;
genpas(n);
gensum(n);
for (i=1;i<=10;i++) fprintf(fout,"%ld ",sum[i]);
return 0;
}