Pagini recente » Cod sursa (job #680432) | Cod sursa (job #468711) | Cod sursa (job #2962810) | Cod sursa (job #801341) | Cod sursa (job #2778800)
#include<bits/stdc++.h>
using namespace std;
ifstream F("lacate.in");
ofstream G("lacate.out");
int n,l,c,k,t,i,j,p,a[300][300];
int main()
{
F>>n,c=n-1,l=c*n/2,G<<l<<" "<<c<<"\n",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)
G<<a[i][j]<<" ";
G<<"\n";
}
return 0;
}