Pagini recente » Cod sursa (job #2827233) | Cod sursa (job #1051547) | Cod sursa (job #3219928) | Cod sursa (job #1335870) | Cod sursa (job #1687413)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("lacate.in");
ofstream g("lacate.out");
int main()
{ int n,l,k,i,j,ka=0,x=0;
f>>n;
k=n-1;
l=(n*k)/2;
g<<l<<" "<<k<<endl;
int a[n][k];
for(i=1;i<=k;i++)
a[i][1]=i;
for(i=1;i<=k;i++)
a[n][i]=i;
for(j=2;j<=n-1;j++)
for(i=1;i<=n-1;i++)
{a[i][j]=k+1;
ka++;
if(ka==2){ka=0;k++;}
}
for(i=1;i<=n;i++)
{for(j=1;j<=n-1;j++)
{g<<a[i][j]<<" ";x++;if(x==n-1){x=0;g<<endl;}}}
return 0;
}