Cod sursa(job #589908)
| Utilizator | Data | 14 mai 2011 13:05:44 | |
|---|---|---|---|
| Problema | Lacate | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.41 kb |
#include <cstdio>
#define MAXN 256
int main(){
freopen("lacate.in", "r", stdin);
freopen("lacate.out", "w", stdout);
int N, K[MAXN+5][MAXN+5], i, j, k;
scanf("%d", &N);
k=1;
for(i=1; i<=N; i++)
for(j=i; j<N; j++)
K[i][j]=K[j+1][i]=k++;
printf("%d %d\n", ((N-1)*N)>>1, N-1);
for(i=1; i<=N; i++){
for(j=1; j<N; j++)
printf("%d ", K[i][j]);
printf("\n");
}
return 0;
}
