Monotonically Increasing

AtCoder

IDabc263_c

Time2000ms

Memory256MB

Difficulty—

Print all strictly increasing integer sequences of length $N$ where all elements are between $1$ and $M$ (inclusive), in lexicographically ascending order. ## Constraints * $1 \le N \le M \le 10$ * All values in input are integers. ## Input Input is given from Standard Input in the following format: $N$ $M$ [samples] ## Notes For two integer sequences of the same length $A_1,A_2,\dots,A_N$ and $B_1,B_2,\dots,B_N$, $A$ is said to be lexicographically earlier than $B$ if and only if: * there is an integer $i$ $(1 \le i \le N)$ such that $A_j=B_j$ for all integers $j$ satisfying $1 \le j < i$, and $A_i < B_i$. An integer sequence $A_1,A_2,\dots,A_N$ is said to be strictly increasing if and only if: * $A_i < A_{i+1}$ for all integers $i$ $(1 \le i \le N-1)$.

Samples

Input #1

2 3

Output #1

1 2 
1 3 
2 3 

The sought sequences are $(1,2),(1,3),(2,3)$, which should be printed in lexicographically ascending order.

Input #2

3 5

Output #2

API Response (JSON)

{
  "problem": {
    "name": "Monotonically Increasing",
    "description": {
      "content": "Print all strictly increasing integer sequences of length $N$ where all elements are between $1$ and $M$ (inclusive), in lexicographically ascending order.",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "abc263_c"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "Print all strictly increasing integer sequences of length $N$ where all elements are between $1$ and $M$ (inclusive), in lexicographically ascending order.\n\n## Constraints\n\n*   $1 \\le N \\le M \\le 10$\n...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments