Pagini recente » Cod sursa (job #2312070) | Cod sursa (job #2905745) | Cod sursa (job #1199864) | Cod sursa (job #1148827) | Cod sursa (job #1469912)
#include <cstdio>
#include <cstdlib>
long long cit() {
long long ans = 0;
char c = getchar();
bool neg = false;
while (c < '0' || c > '9') {
if (c == '-') {
c = getchar();
neg = true;
break;
}
c = getchar();
}
while (c >= '0' && c <= '9') {
ans = (ans << 3) + (ans << 1) + (c - '0');
c = getchar();
}
return (neg) ? -ans : ans;
}
void afis(long long n, char d) {
int l = 0;
char c[20];
if (n == 0) {
putchar('0');
}
if (n < 0) {
putchar('-');
n = -n;
}
while (n > 0) {
c[l++] = n % 10 + '0';
n /= 10;
}
for (int i = l - 1; i >= 0; i--) {
putchar(c[i]);
}
putchar(d);
}
int main() {
freopen("lacate.in", "r", stdin);
freopen("lacate.out", "w", stdout);
int n = cit();
int m[260][260];
afis(n * (n - 1) / 2, ' ');
afis(n - 1, '\n');
int nr = 1;
for (int i = 1; i <= n; i++) {
for (int j = i + 1; j <= n; j++) {
m[i][j] = m[j][i] = nr;
nr++;
}
for (int j = 1; j <= n; j++) {
if (i == j)
continue;
afis(m[i][j], ' ');
}
printf("\n");
}
return 0;
}