80分,WA了,求调qwq,暴力解的
// P1157 组合的输出
#include <bits/stdc++.h>
#define MAXN 22
#define for(i, a, b) for (int i = a; i <= b; i++)
using namespace std;
int n, r;
int main() {
scanf("%d%d", &n, &r);
switch (r) {
case 1: {
for(a, 1, n) printf("%3d\n", a);
break;
} case 2: {
for(a, 1, n)
for(b, a+1, n)
printf("%3d%3d\n", a, b);
break;
} case 3: {
for(a, 1, n)
for(b, a+1, n)
for(c, b+1, n)
printf("%3d%3d%3d\n", a, b, c);
break;
} case 4: {
for(a, 1, n)
for(b, a+1, n)
for(c, b+1, n)
for(d, c+1, n)
printf("%3d%3d%3d%3d\n", a, b, c, d);
break;
} case 5: {
for(a, 1, n)
for(b, a+1, n)
for(c, b+1, n)
for(d, c+1, n)
for(e, d+1, n)
printf("%3d%3d%3d%3d%3d\n", a, b, c, d, e);
break;
} case 6: {
for(a, 1, n)
for(b, a+1, n)
for(c, b+1, n)
for(d, c+1, n)
for(e, d+1, n)
for(f, e+1, n)
printf("%3d%3d%3d%3d%3d%3d\n", a, b, c, d, e, f);
break;
} case 7: {
for(a, 1, n)
for(b, a+1, n)
for(c, b+1, n)
for(d, c+1, n)
for(e, d+1, n)
for(f, e+1, n)
for(g, f+1, n)
printf("%3d%3d%3d%3d%3d%3d%3d\n", a, b, c, d, e, f, g);
break;
} case 8: {
for(a, 1, n)
for(b, a+1, n)
for(c, b+1, n)
for(d, c+1, n)
for(e, d+1, n)
for(f, e+1, n)
for(g, f+1, n)
for(h, g+1, n)
printf("%3d%3d%3d%3d%3d%3d%3d%3d\n", a, b, c, d, e, f, g, h);
break;
} case 9: {
for(a, 1, n)
for(b, a+1, n)
for(c, b+1, n)
for(d, c+1, n)
for(e, d+1, n)
for(f, e+1, n)
for(g, f+1, n)
for(h, g+1, n)
for(i, h+1, n)
printf("%3d%3d%3d%3d%3d%3d%3d%3d%3d\n", a, b, c, d, e, f, g, h, i);
break;
} case 10: {
for(a, 1, n)
for(b, a+1, n)
for(c, b+1, n)
for(d, c+1, n)
for(e, d+1, n)
for(f, e+1, n)
for(g, f+1, n)
for(h, g+1, n)
for(i, h+1, n)
for(j, i+1, n)
printf("%3d%3d%3d%3d%3d%3d%3d%3d%3d%3d\n", a, b, c, d, e, f, g, h, i, j);
break;
} case 11: {
for(a, 1, n)
for(b, a+1, n)
for(c, b+1, n)
for(d, c+1, n)
for(e, d+1, n)
for(f, e+1, n)
for(g, f+1, n)
for(h, g+1, n)
for(i, h+1, n)
for(j, i+1, n)
for(k, j+1, n)
printf("%3d%3d%3d%3d%3d%3d%3d%3d%3d%3d%3d\n", a, b, c, d, e, f, g, h, i, j, k);
break;
} case 12: {
for(a, 1, n)
for(b, a+1, n)
for(c, b+1, n)
for(d, c+1, n)
for(e, d+1, n)
for(f, e+1, n)
for(g, f+1, n)
for(h, g+1, n)
for(i, h+1, n)
for(j, i+1, n)
for(k, j+1, n)
for(l, k+1, n)
printf("%3d%3d%3d%3d%3d%3d%3d%3d%3d%3d%3d%3d\n", a, b, c, d, e, f, g, h, i, j, k, l);
break;
} case 13: {
for(a, 1, n)
for(b, a+1, n)
for(c, b+1, n)
for(d, c+1, n)
for(e, d+1, n)
for(f, e+1, n)
for(g, f+1, n)
for(h, g+1, n)
for(i, h+1, n)
for(j, i+1, n)
for(k, j+1, n)
for(l, k+1, n)
for(m, l+1, n)
printf("%3d%3d%3d%3d%3d%3d%3d%3d%3d%3d%3d%3d%3d\n", a, b, c, d, e, f, g, h, i, j, k, l, m);
break;
} case 14: {
for(a, 1, n)
for(b, a+1, n)
for(c, b+1, n)
for(d, c+1, n)
for(e, d+1, n)
for(f, e+1, n)
for(g, f+1, n)
for(h, g+1, n)
for(i, h+1, n)
for(j, i+1, n)
for(k, j+1, n)
for(l, k+1, n)
for(m, l+1, n)
for(o, m+1, n)
printf("%3d%3d%3d%3d%3d%3d%3d%3d%3d%3d%3d%3d%3d%3d\n", a, b, c, d, e, f, g, h, i, j, k, l, m, o);
break;
} case 15: {
for(a, 1, n)
for(b, a+1, n)
for(c, b+1, n)
for(d, c+1, n)
for(e, d+1, n)
for(f, e+1, n)
for(g, f+1, n)
for(h, g+1, n)
for(i, h+1, n)
for(j, i+1, n)
for(k, j+1, n)
for(l, k+1, n)
for(m, l+1, n)
for(o, m+1, n)
for(p, o+1, n)
printf("%3d%3d%3d%3d%3d%3d%3d%3d%3d%3d%3d%3d%3d%3d%3d\n", a, b, c, d, e, f, g, h, i, j, k, l, m, o, p);
break;
} case 16: {
for(a, 1, n)
for(b, a+1, n)
for(c, b+1, n)
for(d, c+1, n)
for(e, d+1, n)
for(f, e+1, n)
for(g, f+1, n)
for(h, g+1, n)
for(i, h+1, n)
for(j, i+1, n)
for(k, j+1, n)
for(l, k+1, n)
for(m, l+1, n)
for(o, m+1, n)
for(p, o+1, n)
for(q, p+1, n)
printf("%3d%3d%3d%3d%3d%3d%3d%3d%3d%3d%3d%3d%3d%3d%3d%3d\n", a, b, c, d, e, f, g, h, i, j, k, l, m, o, p, q);
break;
} case 17: {
for(a, 1, n)
for(b, a+1, n)
for(c, b+1, n)
for(d, c+1, n)
for(e, d+1, n)
for(f, e+1, n)
for(g, f+1, n)
for(h, g+1, n)
for(i, h+1, n)
for(j, i+1, n)
for(k, j+1, n)
for(l, k+1, n)
for(m, l+1, n)
for(o, m+1, n)
for(p, o+1, n)
for(q, p+1, n)
for(r, q+1, n)
printf("%3d%3d%3d%3d%3d%3d%3d%3d%3d%3d%3d%3d%3d%3d%3d%3d%3d\n", a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r);
break;
} case 18: {
for(a, 1, n)
for(b, a+1, n)
for(c, b+1, n)
for(d, c+1, n)
for(e, d+1, n)
for(f, e+1, n)
for(g, f+1, n)
for(h, g+1, n)
for(i, h+1, n)
for(j, i+1, n)
for(k, j+1, n)
for(l, k+1, n)
for(m, l+1, n)
for(o, m+1, n)
for(p, o+1, n)
for(q, p+1, n)
for(r, q+1, n)
for(s, r+1, n)
printf("%3d%3d%3d%3d%3d%3d%3d%3d%3d%3d%3d%3d%3d%3d%3d%3d%3d%3d\n", a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s);
break;
} case 19: {
for(a, 1, n)
for(b, a+1, n)
for(c, b+1, n)
for(d, c+1, n)
for(e, d+1, n)
for(f, e+1, n)
for(g, f+1, n)
for(h, g+1, n)
for(i, h+1, n)
for(j, i+1, n)
for(k, j+1, n)
for(l, k+1, n)
for(m, l+1, n)
for(o, m+1, n)
for(p, o+1, n)
for(q, p+1, n)
for(r, q+1, n)
for(s, r+1, n)
for(t, s+1, n)
printf("%3d%3d%3d%3d%3d%3d%3d%3d%3d%3d%3d%3d%3d%3d%3d%3d%3d%3d%3d\n", a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t);
break;
} case 20: {
for(a, 1, n)
for(b, a+1, n)
for(c, b+1, n)
for(d, c+1, n)
for(e, d+1, n)
for(f, e+1, n)
for(g, f+1, n)
for(h, g+1, n)
for(i, h+1, n)
for(j, i+1, n)
for(k, j+1, n)
for(l, k+1, n)
for(m, l+1, n)
for(o, m+1, n)
for(p, o+1, n)
for(q, p+1, n)
for(r, q+1, n)
for(s, r+1, n)
for(t, s+1, n)
for(u, t+1, n)
printf("%3d%3d%3d%3d%3d%3d%3d%3d%3d%3d%3d%3d%3d%3d%3d%3d%3d%3d%3d%3d\n", a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u);
break;
} case 21: {
for(a, 1, n)
for(b, a+1, n)
for(c, b+1, n)
for(d, c+1, n)
for(e, d+1, n)
for(f, e+1, n)
for(g, f+1, n)
for(h, g+1, n)
for(i, h+1, n)
for(j, i+1, n)
for(k, j+1, n)
for(l, k+1, n)
for(m, l+1, n)
for(o, m+1, n)
for(p, o+1, n)
for(q, p+1, n)
for(r, q+1, n)
for(s, r+1, n)
for(t, s+1, n)
for(u, t+1, n)
for(v, u+1, n)
printf("%3d%3d%3d%3d%3d%3d%3d%3d%3d%3d%3d%3d%3d%3d%3d%3d%3d%3d%3d%3d%3d\n", a, b, c, d, e, f, g, h, i, j, k, l, m, n, o, p, q, r, s, t, u, v);
break;
} default: {
printf("damn!!!");
break;
}
}
return 0;
}