Pagini recente » Cod sursa (job #2100362) | Cod sursa (job #2035496) | Cod sursa (job #2569029) | Cod sursa (job #8152) | Cod sursa (job #481177)
Cod sursa(job #481177)
#include <stdio.h>
using namespace std;
int a[257][257];
int n, i, j, k, p, t;
int lacate, chei;
int main ()
{
FILE *f = fopen ("lacate.in","r");
FILE *g = fopen ("lacate.out","w");
fscanf (f,"%d", &n);
chei = n - 1;
k = 1;
i = j = k = t = 1;
while (i < n)
{
j = t;
for (p=i+1; p<=n; ++p)
{
a[i][j] = k;
j ++;
if (j > chei)
{
j = 1;
i ++;
}
a[p][t] = k;
k ++;
}
t ++;
}
lacate = k - 1;
fprintf ("%d %d\n", lacate, chei);
for (i=1; i<=n; ++i)
{
for (j=1; j<=chei; ++j)
fprintf (g, "%d ", a[i][j]);
fprintf (g, "\n");
}
fclose (g);
fclose (f);
return 0;
}