Cod sursa(job #1000666)
| Utilizator | Data | 23 septembrie 2013 15:52:38 | |
|---|---|---|---|
| Problema | Lacate | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.62 kb |
#include<stdio.h>
#define maxN 256
int sol[maxN+1][maxN+1];
int main()
{
FILE *fin,*fout;
fin=fopen("lacate.in","r");
fout=fopen("lacate.out","w");
int n;
fscanf(fin,"%d",&n);
int i,j,cont=1;
for(i=1;i<=n;i++)
for(j=i+1;j<=n;j++)
{
sol[i][0]++;
sol[j][0]++;
sol[i][sol[i][0]]=sol[j][sol[j][0]]=cont;
cont++;
}
fprintf(fout,"%d %d\n",n*(n-1)/2,n-1);
for(i=1;i<=n;i++)
{
for(j=1;j<=n-1;j++)
fprintf(fout,"%d ",sol[i][j]);
fprintf(fout,"\n");
}
return 0;
}
