Pagini recente » Cod sursa (job #1612419) | Cod sursa (job #943214) | Cod sursa (job #1776711) | Cod sursa (job #1729078) | Cod sursa (job #1332669)
#include <stdio.h>
#define MAXN 256
int m[MAXN][MAXN-1];
int main(){
int n, c, i, j, k;
FILE *fin, *fout;
fin=fopen("lacate.in", "r");
fout=fopen("lacate.out", "w");
fscanf(fin, "%d", &n);
c=n-1;
fprintf(fout, "%d %d\n", n*c/2, c);
for(i=0, k=1; i<c; i++, k++){
m[i][i]=m[i+1][i]=k;
}
for(i=0; i<n; i++){
for(j=1; i+j<c; j++, k++){
m[i][i+j]=m[i+j+1][i]=k;
}
}
for(i=0; i<n; i++){
for(j=0; j<c-1; j++){
fprintf(fout, "%d ", m[i][j]);
}
fprintf(fout, "%d\n", m[i][j]);
}
fclose(fin);
fclose(fout);
return 0;
}