Pagini recente » Cod sursa (job #931312) | Cod sursa (job #85245) | Cod sursa (job #1655426) | Cod sursa (job #2516251) | Cod sursa (job #1693217)
#include <fstream>
using namespace std;
ifstream f("lacate.in");
ofstream g("lacate.out");
int n,i,j,cnt,m[260][260];
int main()
{
f >> n;
cnt = 1;
for(i = 1; i <= n; ++i)
for(j = 1; j < i; ++j)
{
m[j][i - 1] = cnt;
m[i][j] = cnt;
++cnt;
}
g << cnt - 1 << " " << n - 1 << '\n';
for(i = 1; i <= n; ++i)
{
for(j = 1; j < n; ++j)
g << m[i][j] << " ";
g << '\n';
}
return 0;
}
/*
mat[1][1]=1;
mat[2][1]=1;
int chey=2;
for(int i=3; i<=n; ++i)
for(int j=1; j<i; ++j)
mat[j][i-1]=mat[i][j]=chey, chey++;
cout<<chey-1<<' '<<n-1<<'\n';
for(int i=1; i<=n; ++i)
{
for(int j=1; j<n; ++j)
cout<<mat[i][j]<<' ';
cout<<'\n';
}
return 0;
}*/