Pagini recente » Cod sursa (job #223370) | Cod sursa (job #786658) | Cod sursa (job #2292495) | Cod sursa (job #1609886) | Cod sursa (job #1306935)
#include<cstdio>
const int N=256;
int a[N+1][N+1];
int main(){
int n,k=0;
freopen("lacate.in","r",stdin);
freopen("lacate.out","w",stdout);
scanf("%d",&n);
for(int i=1;i<=n;i++){
for(int j=i+1;j<=n;j++){
a[i][j-1]=++k;
a[j][i]=k;
}
}
printf("%d %d\n",k,n-1);
for(int i=1;i<=n;i++){
for(int j=1;j<n;j++)
printf("%d ",a[i][j]);
printf("\n");
}
return 0;
}