Pagini recente » Cod sursa (job #242084) | Cod sursa (job #1810994) | Cod sursa (job #2634203) | Cod sursa (job #2740321) | Cod sursa (job #624593)
Cod sursa(job #624593)
#include<fstream>
using namespace std;
int n,l,c,k=0,t=0,i,j,p=0,a[280][280];
int main()
{
ifstream f("lacate.in");
ofstream g("lacate.out");
f>>n;
c=n-1;
l=c*n/2;
g<<l<<" "<<c;
g<<"\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;
}