Pagini recente » Cod sursa (job #31120) | Cod sursa (job #1682716) | Cod sursa (job #1005921) | Cod sursa (job #1971348) | Cod sursa (job #2010880)
#include <cstdio>
using namespace std;
int chei[257][257];
int main()
{
freopen ("lacate.in", "r", stdin);
freopen ("lacate.out", "w", stdout);
int n;
scanf("%d", &n);
int lacate = n * (n - 1) / 2, c = n - 1;
int pcheie = 1, ox = 1, oy = 1;
while(ox + 1 <= n && oy <= c){
int copie = pcheie;
for(int i = oy; i <= c;i++){
chei[ox][i] = copie;
copie++;
}
for(int i = ox + 1; i <= n;i++){
chei[i][oy] = pcheie;
pcheie++;
}
ox++;
oy++;
}
printf("%d %d\n", lacate, c);
for(int i = 1; i <= n; i++){
for(int j = 1; j <= c; j++)
printf("%d ", chei[i][j]);
printf("\n");
}
return 0;
}