Pagini recente » Cod sursa (job #1863927) | Cod sursa (job #2563726) | Cod sursa (job #162855) | Cod sursa (job #284711) | Cod sursa (job #206432)
Cod sursa(job #206432)
#include<stdio.h>
int main(){
int a[100][100];
int c,i,j,inc,ka,ka1,k;
int n,l,co;
FILE *pfin, *pfout;
pfin=fopen("lacate.in", "r");
pfout=fopen("lacate.out", "w");
fscanf(pfin, "%d", &n);
printf("lacate%d\n",n);
l=(n*(n-1))/2;
fprintf(pfout,"%d ", l);
co=n-1;
fprintf(pfout,"%d", co);
for( i=0;i<=co;i++){
for( j=0;j<=co;j++){
a[i][j]=0;
}
}
a[0][0]=1;
inc=1;
for(k=1;k<=co;k++) a[k][0]=inc++;
inc=1;
for(k=0;k<co;k++)a[0][k]=inc++;
inc=5;
for(k=1;k<co;k++)a[k][k]=a[k-1][k-1]+inc--;
inc=5;
ka1=2;
while(ka1<=5){
inc=5;
for(k=1, ka=ka1;k<=co,ka<=co;k++,ka++){
a[ka][k]=a[ka-1][k-1]+inc--;
}
ka1++;
}
c=5;
for(k=0;k<co-2;k++){
i=0;
for(j=k+1;j<=co-2;j++){
a[i+1][j+1]=a[i][j]+c-i;
i++;
}
}
for( i=0;i<=co;i++){
fprintf(pfout,"\n");
for( j=0;j<co;j++){
fprintf(pfout,"%d",a[i][j]);
}
}
return 0;
}