Pagini recente » Cod sursa (job #709050) | Cod sursa (job #3217139) | Cod sursa (job #1015917) | Cod sursa (job #2031796) | Cod sursa (job #1810195)
#include <iostream>
#include <cstdio>
using namespace std;
FILE *f, *g;
int n, locks, a[260][260];
void readFile()
{
f = fopen("lacate.in", "r");
fscanf(f, "%d", &n);
fclose(f);
}
int radical(int n)
{
int i = 0, pas = 1 << 15;
while(pas != 0)
{
if((i + pas) * (i + pas) <= n)
i += pas;
pas /= 2;
}
return i;
}
void solve()
{
int i, j, c = 1, h;
locks = (n - 1) * n / 2;
for(i = 1; i <= n; i ++)
{
for(j = i; j <= n - 1; j ++)
{
a[i][j] = c;
a[j + 1][i] = c;
c ++;
}
}
}
void printFile()
{
int i, j;
g = fopen("lacate.out", "w");
fprintf(g, "%d %d\n", locks, n - 1);
for(i = 1; i <= n; i ++)
{
for(j = 1; j <= n - 1; j ++)
fprintf(g, "%d ", a[i][j]);
fprintf(g, "\n");
}
}
int main()
{
readFile();
solve();
printFile();
return 0;
}