Pagini recente » Cod sursa (job #1621339) | Cod sursa (job #1126918) | Cod sursa (job #2101086) | Cod sursa (job #434766) | Cod sursa (job #1180545)
#include <cstdio>
using namespace std;
const int MaX_N=256;
int q[MaX_N+1][MaX_N+1];
int main(){
freopen("lacate.in","r",stdin);
freopen("lacate.out","w",stdout);
int n,dr,i,j;
scanf("%d",&n);
dr=0;
for(i=1;i<=n;i++){
for(j=i;j<n;j++){
q[i][j]=q[j+1][i]=++dr;
}
}
printf("%d %d\n",dr,n-1);
for(i=1;i<=n;i++){
for(j=1;j<n;j++){
printf("%d ",q[i][j]);
}
printf("\n");
}
}