Pagini recente » Cod sursa (job #2821501) | Cod sursa (job #494693) | Cod sursa (job #400582) | Cod sursa (job #391735) | Cod sursa (job #2404621)
#include <cstdio>
#include <iostream>
using namespace std;
const int NMAX=260;
int N;
int ans1, ans2, ord;
int A[NMAX][NMAX*NMAX];
inline void Solve (int N)
{
ans1=(N*(N-1))/2;
ans2=N-1;
for(int i=1; i <= N; ++i)
for(int j=1; j <= ans2; ++j)
if(A[i][j] == 0)
A[i][j]=A[j+1][i]=++ord;
return;
}
inline void Write ()
{
printf("%d %d\n", ans1, ans2);
for(int i=1; i <= N; ++i)
{
for(int j=1; j <= ans2; ++j)
printf("%d ", A[i][j]);
printf("\n");
}
return;
}
int main()
{
freopen("lacate.in", "r", stdin);
freopen("lacate.out", "w", stdout);
ios_base :: sync_with_stdio(false);
cin.tie(NULL);
scanf("%d", &N);
Solve(N);
Write();
return 0;
}