提出 #33827737

---

ソースコード 拡げる

#!/usr/bin/env python3
def solve(N, M):
    ret = [[i] for i in range(1, M + 1)]
    for l in range(1, N):
        next_ret = []
        for li in ret:
            if l != len(li):
                continue
            for i in range(li[-1] + 1, M + 1):
                next_ret.append(li + [i])
        ret = next_ret
    return ret

    # cnt = 1
    # for k in range(1, N):
    #     print(ret)
    #     print()
    #     next_ret = []
    #     for li in ret:
    #         tmp = [li + [i] for i in range(li[-1] + 1, M + 2 - N + cnt)]
    #         if len(tmp) != 0:
    #             next_ret.append(tmp)
    #     ret = next_ret
    #     cnt += 1
    # return ret


def main():
    N, M = map(int, input().split())
    li = solve(N, M)
    for row in li:
        print(*row)


if __name__ == "__main__":
    main()

提出情報

ジャッジ結果