Pagini recente » Cod sursa (job #1706261) | Cod sursa (job #2806731) | Cod sursa (job #726956) | Cod sursa (job #2802448) | Cod sursa (job #1232624)
#include <fstream>
using namespace std;
ifstream ka("lacate.in");
ofstream ki("lacate.out");
const int N_MAX = 256;
int n, r, c, curent = 1, a[N_MAX + 1][N_MAX + 1];
int main()
{
ka >> n;
ki << n * (n - 1) / 2 << " " << n - 1 << '\n';
int bagat = 0, next = 0;
for(int i = 1; i <= n; i++)
{
int j;
for(j = 1; j <= bagat; j++)
ki << a[j][bagat] << " ";
for(; j <= n - 1; j++)
{
a[i][j] = ++next;
ki << a[i][j] << " ";
}
bagat++;
ki << '\n';
}
}