Cod sursa(job #647295)
Utilizator | Enal Gemaledin Blaugranas | Data | 11 decembrie 2011 13:18:54 |
---|---|---|---|
Problema | Lacate | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.48 kb |
#include<cstdio>
#define N 300
int n,l,c,k,t,i,j,p,a[N][N];
int main()
{freopen("lacate.in","r",stdin);
freopen("lacate.out","w",stdout);
scanf("%d",&n);
c=n-1,l=c*n/2;
printf("%d %d\n",l,c),l=1;
while(t<n*c)
{for(i=l;i<=c;i++)
a[l][i]=k+i-p;
for(i=l+1;i<=n;i++)
a[i][l]=k+i-1-p;
k=a[l][c],t+=c+n-2*l+1,p++,l++;}
for(i=1;i<=n;i++)
{for(j=1;j<=c;j++)
printf("%d ",a[i][j]);
printf("\n");}
return 0;}