Cod sursa(job #250946)
Utilizator | Andrei Poenaru AndreyP | Data | 1 februarie 2009 13:47:58 |
---|---|---|---|
Problema | Lacate | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.52 kb |
#include<stdio.h>
#define N 260
int n,lac,cate,c;
int a[N][N];
int main()
{
freopen("lacate.in","r",stdin);
freopen("lacate.out","w",stdout);
scanf("%d",&n);
if(n==1)
{
printf("1 1\n1\n1\n");
return 0;
}
lac=n*(n-1);
lac>>=1;
for(int i=1; i<=n; ++i)
{
for(int j=i+1; j<=n; ++j)
a[i][++a[i][0]]=a[j][++a[j][0]]=++cate;
}
c=a[1][0];
printf("%d %d\n",lac,c);
for(int i=1; i<=n; ++i)
{
for(int j=1; j<c; ++j)
printf("%d ",a[i][j]);
printf("%d\n",a[i][c]);
}
return 0;
}