Cod sursa(job #613279)
| Utilizator | Data | 20 septembrie 2011 17:43:56 | |
|---|---|---|---|
| Problema | Lacate | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.54 kb |
#include <cstdio>
using namespace std;
#define maxn 300
int n, nl, i, j, k;
int v[maxn][maxn];
int main()
{
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)
{
++nl;
v[i][++v[i][0]]=nl;
v[j][++v[j][0]]=nl;
}
printf("%d %d\n", nl, n-1);
for(int i=1; i<=n; ++i)
{
for(int j=1; j<n; ++j)
printf("%d ", v[i][j]);
printf("\n");
}
return 0;
}
