Pagini recente » Cod sursa (job #499846) | Cod sursa (job #1566986) | Cod sursa (job #1884770) | Cod sursa (job #1939468) | Cod sursa (job #1596545)
#include <fstream>
using namespace std;
int main()
{
int n, A[257][257], k = 1, i, j;
ifstream f("lacate.in");
f >> n;
f.close();
for (i = 1; i <= n; i++)
{
for (j = i + 1; j <= n; j++)
{
if (i != j)
{
A[i][j] = A[j][i] = k++;
}
}
}
ofstream g("lacate.out");
g << (n * (n - 1)) / 2 << " " << (n - 1) << "\n";
for (i = 1; i <= n; i++)
{
for (j = 1; j <= n; j++)
{
if (i != j)
{
g << A[i][j] << " ";
}
}
g << "\n";
}
g.close();
return 0;
}