Cod sursa(job #792322)
| Utilizator | Data | 26 septembrie 2012 21:45:21 | |
|---|---|---|---|
| Problema | Lacate | Scor | 50 |
| Compilator | cpp | Status | done |
| Runda | asem-etapa1 | Marime | 0.44 kb |
#include <stdio.h>
#define M 3264
#define N 256
int a[N][M];
int main ()
{int n,i,j,k,lacate,chei;
freopen("lacate.in","r",stdin);
freopen("lacate.out","w",stdout);
scanf("%d",&n);
lacate=n*(n-1)/2;
chei=n-1;
printf("%d %d\n",lacate,chei);
k=0;
for (i=0;i<n-1;i++)
{for (j=i+1;j<n;j++)
{a[i][k]=1;
a[j][k++]=1;
}
}
for (i=0;i<n;i++)
{for (j=0;j<k;j++)
{if(a[i][j]==1)
{printf("%d ",j+1);
}
}
printf("\n");
}
return 0;
}
