Pagini recente » Cod sursa (job #3229889) | Cod sursa (job #2092548) | Cod sursa (job #1371493) | Cod sursa (job #3259321) | Cod sursa (job #945607)
Cod sursa(job #945607)
#include<fstream>
using namespace std;
ifstream fin("lacate.in"); ofstream fout("lacate.out");
int n, N;
int a[300][300], sol[100];
void Solve()
{
int i, j;
int l = 1, c = 1;
for(i = 1; i <= n; i++)
{
for(j = i; j <= n - 1; j++)
a[i][j] = l++;
for(j = i + 1; j <= n; j++)
a[j][i] = c++;
}
}
void Write()
{
int i, j;
for(i = 1; i <= n; i++)
{
for(j = 1; j <= n - 1; j++)
fout << a[i][j] << " ";
fout << "\n";
}
}
void Afis()
{
for(int i = 1; i <= n; i++)
fout << sol[i] << " ";
fout << "\n";
}
void Back(int k)
{
for(int i = 0; i <= 1;i++)
{
sol[k] = i;
if(k >= n)
Afis();
else
Back(k + 1);
}
}
int main()
{
fin >> n;
N = n * (n - 1) / 2;
fout << N << " " << (n - 1) << "\n";
Solve();
Write();
fin.close(); fout.close();
return 0;
}