Pagini recente » tema | Rating Eugen Iordanescu (eugeniord) | Cod sursa (job #550750) | Cod sursa (job #2641827) | Cod sursa (job #598017)
Cod sursa(job #598017)
#include<stdio.h>
#define MaxN 65000
int A[MaxN];
int C[MaxN];
int N;
int a = 0;
int main()
{
FILE *f = fopen("lacate.in","r");
FILE *g = fopen("lacate.out","w");
fscanf(f,"%d ",&N);
fprintf(g,"%d %d\n",N*(N-1)/2,N-1);
for(int i=1;i<=N-1;i++)
A[i] = i,C[i] = N-1;
for(int i=1;i<=N;i++)
{
for(int i=1;i<=N-1;i++)
fprintf(g,"%d ",A[i]);
fprintf(g,"\n");
for(int i=N;i;i--)
A[i] = A[i-1] + C[i-1],C[i] = C[i-1] - 1;
A[1] = ++ a;
C[1] = N-1;
}
fclose(g);
fclose(f);
return 0;
}