From 7b5ddb3292bbe9bd73916b38a380f442454767c7 Mon Sep 17 00:00:00 2001 From: junah201 Date: Tue, 8 Oct 2024 23:57:03 +0900 Subject: [PATCH 01/15] =?UTF-8?q?=E2=9C=A8=20feat:=2017608=EB=B2=88=20?= =?UTF-8?q?=EB=B2=88=EC=97=AD=20=EC=B6=94=EA=B0=80?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- index | 3 +++ src/17608/en_US-junah201.html | 51 +++++++++++++++++++++++++++++++++++ 2 files changed, 54 insertions(+) create mode 100644 src/17608/en_US-junah201.html diff --git a/index b/index index 46192ad5..8be6c06e 100644 --- a/index +++ b/index @@ -437,6 +437,9 @@ "17598": [ "ko_KR-kiwiyou" ], + "17608": [ + "en_US-junah201" + ], "17678": [ "Korean-typo" ], diff --git a/src/17608/en_US-junah201.html b/src/17608/en_US-junah201.html new file mode 100644 index 00000000..69e0c68b --- /dev/null +++ b/src/17608/en_US-junah201.html @@ -0,0 +1,51 @@ +
Stick
+
+
+

Description

+
+
+

+ Line up sticks of different heights (you may have sticks of the same + height) andthe same shape, as shown below, and number them from left to + right. In the example below, the heights of the sticks are 6, 9, 7, 6, 4, + 6. When you look at the sticks from the right, you'll see that some of the + sticks are visible and some are invisible, meaning that they are behind + and taller than the ones you see. For example, in this case, we see three + sticks (6, 3, and 2). +

+

+ +

+

+ Given the height information for N sticks, you want to write a program + that determines how many are visible by looking to the right. +

+
+
+
+
+

Input

+
+
+

+ In the first line, you are given N (2 ≤ N ≤ 100,000) that represents + the number of sticks. In the following N lines, you are given h (1 ≤ h + ≤ 100,000) that represents the height of each stick. +

+
+
+
+
+

Output

+
+
+

+ When you see the sticks from the right side, print the number of sticks + that you can see. +

+
+
From 1af5767a05876b3400b2cbfe5617121a9ad75814 Mon Sep 17 00:00:00 2001 From: junah201 Date: Tue, 8 Oct 2024 23:57:14 +0900 Subject: [PATCH 02/15] =?UTF-8?q?=E2=9C=A8=20feat:=2027433=EB=B2=88=20?= =?UTF-8?q?=EB=B2=88=EC=97=AD=20=EC=B6=94=EA=B0=80?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- index | 3 +++ src/27433/en_US-junah201.html | 25 +++++++++++++++++++++++++ 2 files changed, 28 insertions(+) create mode 100644 src/27433/en_US-junah201.html diff --git a/index b/index index 8be6c06e..e79aa1e5 100644 --- a/index +++ b/index @@ -1190,6 +1190,9 @@ "2741": [ "en_US-masooka" ], + "27433": [ + "en_US-junah201" + ], "27487": [ "ko_KR-wizardrabbit" ], diff --git a/src/27433/en_US-junah201.html b/src/27433/en_US-junah201.html new file mode 100644 index 00000000..57bed450 --- /dev/null +++ b/src/27433/en_US-junah201.html @@ -0,0 +1,25 @@ +
Factorial 2
+
+
+

Description

+
+
+

You are given a non-negative integer N. Write a program to print N!.

+
+
+
+
+

Input

+
+
+

The first line contains an integer N (0 ≤ N ≤ 20).

+
+
+
+
+

Output

+
+
+

Print N! on the first line.

+
+
From 471d2cc4f685da0f1d3090d3828ec5bcb60431f3 Mon Sep 17 00:00:00 2001 From: junah201 Date: Wed, 9 Oct 2024 00:06:09 +0900 Subject: [PATCH 03/15] =?UTF-8?q?=E2=9C=A8=20feat:=2010870=EB=B2=88=20?= =?UTF-8?q?=EB=B2=88=EC=97=AD=20=EC=B6=94=EA=B0=80?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- index | 3 +++ src/10870/en_US-junah201.html | 41 +++++++++++++++++++++++++++++++++++ 2 files changed, 44 insertions(+) create mode 100644 src/10870/en_US-junah201.html diff --git a/index b/index index e79aa1e5..e90339f0 100644 --- a/index +++ b/index @@ -83,6 +83,9 @@ "10869": [ "en_US-kiwiyou" ], + "10870": [ + "en_US-junah201" + ], "10871": [ "en_US-masooka" ], diff --git a/src/10870/en_US-junah201.html b/src/10870/en_US-junah201.html new file mode 100644 index 00000000..bbd97b0e --- /dev/null +++ b/src/10870/en_US-junah201.html @@ -0,0 +1,41 @@ +
Fibonacci Number 5
+
+
+

Description

+
+
+

+ The Fibonacci sequence starts with 0 and 1. The 0th Fibonacci number is 0, + and the 1st Fibonacci number is 1. Starting from the 2nd number, each + Fibonacci number is the sum of the two preceding ones. +

+

+ This can be expressed by the formula Fn = + Fn-1 + Fn-2 (n ≥ 2). +

+

Here are the Fibonacci numbers up to n=17:

+

+ 0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597 +

+

Given n, write a program to print the n-th Fibonacci number.

+
+
+
+
+

Input

+
+
+

+ The first line contains the integer n. n is a non-negative integer less + than or equal to 20. +

+
+
+
+
+

Output

+
+
+

Print the n-th Fibonacci number on the first line.

+
+
From 890ec4320005046c3045c5e25005f95021186c61 Mon Sep 17 00:00:00 2001 From: junah201 Date: Wed, 9 Oct 2024 00:16:20 +0900 Subject: [PATCH 04/15] =?UTF-8?q?=E2=9C=A8=20feat:=202447=EB=B2=88=20?= =?UTF-8?q?=EB=B2=88=EC=97=AD=20=EC=B6=94=EA=B0=80?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- index | 3 +++ src/2447/en_US-junah201.html | 46 ++++++++++++++++++++++++++++++++++++ 2 files changed, 49 insertions(+) create mode 100644 src/2447/en_US-junah201.html diff --git a/index b/index index e90339f0..ae51d3df 100644 --- a/index +++ b/index @@ -905,6 +905,9 @@ "2440": [ "en_US-masooka" ], + "2447": [ + "en_US-junah201" + ], "24488": [ "ko_KR-dohoon" ], diff --git a/src/2447/en_US-junah201.html b/src/2447/en_US-junah201.html new file mode 100644 index 00000000..e291398a --- /dev/null +++ b/src/2447/en_US-junah201.html @@ -0,0 +1,46 @@ +
Star Pattern - 10
+
+
+

Description

+
+
+

+ Let's draw stars using a recursive pattern. When N is a power of 3 (3, 9, + 27, ...), the pattern of size N is a square of size N×N. +

+

+ The pattern of size 3 consists of a single star in every position except + for the center, which is a blank space. +

+ 
+***
+* *
+***
+

+ When N is greater than 3, the pattern of size N consists of an + (N/3)×(N/3) square in the center filled with spaces, surrounded by + the pattern of size N/3. For example, the pattern of size 27 is shown in + sample output 1. +

+
+
+
+
+

Input

+
+
+

+ The first line contains N. N is a power of 3, meaning N=3k for + some integer k, and 1 ≤ k < 8. +

+
+
+
+
+

Output

+
+
+

Print the star pattern from the first line to the Nth line.

+
+
From 307564eb29884a6a6cf3b45f4dd010ae6e073d5c Mon Sep 17 00:00:00 2001 From: junah201 Date: Wed, 9 Oct 2024 00:26:20 +0900 Subject: [PATCH 05/15] =?UTF-8?q?=E2=9C=A8=20feat:=202448=EB=B2=88=20?= =?UTF-8?q?=EB=B2=88=EC=97=AD=20=EC=B6=94=EA=B0=80?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- index | 3 +++ src/2448/en_US-junah201.html | 33 +++++++++++++++++++++++++++++++++ 2 files changed, 36 insertions(+) create mode 100644 src/2448/en_US-junah201.html diff --git a/index b/index index ae51d3df..66b5fa60 100644 --- a/index +++ b/index @@ -908,6 +908,9 @@ "2447": [ "en_US-junah201" ], + "2448": [ + "en_US-junah201" + ], "24488": [ "ko_KR-dohoon" ], diff --git a/src/2448/en_US-junah201.html b/src/2448/en_US-junah201.html new file mode 100644 index 00000000..13097c06 --- /dev/null +++ b/src/2448/en_US-junah201.html @@ -0,0 +1,33 @@ +
Star Pattern - 11
+
+
+

Description

+
+
+

+ Based on the sample input, deduce the pattern and print the stars + accordingly. +

+
+
+
+
+

Input

+
+
+

+ The first line contains N. N is always a number of the form 3×2k + (3, 6, 12, 24, 48, ...) where 0 ≤ k ≤ 10, and k is an integer. +

+
+
+
+
+

Output

+
+
+

Print stars from the first line to the Nth line.

+
+
From 621c43e38f5d17a6a87354e11ca9025707790400 Mon Sep 17 00:00:00 2001 From: junah201 Date: Wed, 9 Oct 2024 00:30:04 +0900 Subject: [PATCH 06/15] =?UTF-8?q?=E2=9C=A8=20feat:=2011729=EB=B2=88=20?= =?UTF-8?q?=EB=B2=88=EC=97=AD=20=EC=B6=94=EA=B0=80?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- index | 3 ++ src/11729/en_US-junah201.html | 54 +++++++++++++++++++++++++++++++++++ 2 files changed, 57 insertions(+) create mode 100644 src/11729/en_US-junah201.html diff --git a/index b/index index 66b5fa60..17283a3a 100644 --- a/index +++ b/index @@ -161,6 +161,9 @@ "11720": [ "en_US-masooka" ], + "11729": [ + "en_US-junah201" + ], "1181": [ "en_US-masooka" ], diff --git a/src/11729/en_US-junah201.html b/src/11729/en_US-junah201.html new file mode 100644 index 00000000..e25ff35a --- /dev/null +++ b/src/11729/en_US-junah201.html @@ -0,0 +1,54 @@ +
Hanoi Tower Movement Order
+
+
+

Description

+
+
+

+ There are three towers, and on the first tower, there are n disks of + different radii stacked in descending order. The monks want to move these + disks from the first tower to the third tower following these rules: +

+
    +
  1. Only one disk can be moved at a time to another tower.
    2. +
  2. A stacked disk must always be smaller than the disk below it.
    3. +
+

+ Write a program that outputs the sequence of moves required to complete + this task, ensuring the number of moves is minimized. +

+

Below is an example when there are 5 disks.

+

+ +

+
+
+
+
+

Input

+
+
+

+ The first line contains the number of disks N (1 ≤ N ≤ 20) stacked + on the first tower. +

+
+
+
+
+

Output

+
+
+

Output K, the number of moves, on the first line.

+

+ From the second line onward, output the sequence of moves. For K lines + starting from the second line, print two integers A and B separated by a + space, indicating that the top disk of the A-th tower is moved to the top + of the B-th tower. +

+
+
From 0a3c4de98d99845e5f6a283b7c9add518a19c88b Mon Sep 17 00:00:00 2001 From: junah201 Date: Fri, 25 Oct 2024 12:45:01 +0900 Subject: [PATCH 07/15] =?UTF-8?q?=E2=9C=A8=20feat:=2015649=EB=B2=88=20?= =?UTF-8?q?=EB=B2=88=EC=97=AD=20=EC=B6=94=EA=B0=80?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- index | 3 +++ src/15649/en_US-junah201.html | 42 +++++++++++++++++++++++++++++++++++ 2 files changed, 45 insertions(+) create mode 100644 src/15649/en_US-junah201.html diff --git a/index b/index index 17283a3a..06898bfb 100644 --- a/index +++ b/index @@ -374,6 +374,9 @@ "15610": [ "ko_KR-ez_code" ], + "15649": [ + "en_US-junah201" + ], "15764": [ "ko_KR-yup0927" ], diff --git a/src/15649/en_US-junah201.html b/src/15649/en_US-junah201.html new file mode 100644 index 00000000..66056d94 --- /dev/null +++ b/src/15649/en_US-junah201.html @@ -0,0 +1,42 @@ +
N and M (1)
+
+
+

Description

+
+
+

+ Given natural numbers \( N \) and \( M \), write a program that generates + all sequences of length \( M \) that satisfy the following conditions. +

+
    +
  • + Each sequence consists of \( M \) unique natural numbers chosen from 1 + to \( N \). +
    • +
+
+
+
+
+

Input

+
+
+

+ The first line contains the natural numbers \( N \) and \( M \) such that + \( 1 \le M \le N \le 8 \). +

+
+
+
+
+

Output

+
+
+

+ Print each sequence that meets the problem's requirements on a new line. + Do not print any sequence more than once, and separate the numbers in each + sequence with spaces. +

+

Print the sequences in lexicographical (dictionary) order.

+
+
From e0da1164e6f256c49ab80233ba782cd876adac6a Mon Sep 17 00:00:00 2001 From: junah201 Date: Fri, 25 Oct 2024 12:52:14 +0900 Subject: [PATCH 08/15] =?UTF-8?q?=E2=9C=A8=20feat:=2015650=EB=B2=88=20?= =?UTF-8?q?=EB=B2=88=EC=97=AD=20=EC=B6=94=EA=B0=80?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- index | 3 +++ src/15650/en_US-junah201.html | 43 +++++++++++++++++++++++++++++++++++ 2 files changed, 46 insertions(+) create mode 100644 src/15650/en_US-junah201.html diff --git a/index b/index index 06898bfb..877a873c 100644 --- a/index +++ b/index @@ -377,6 +377,9 @@ "15649": [ "en_US-junah201" ], + "15650": [ + "en_US-junah201" + ], "15764": [ "ko_KR-yup0927" ], diff --git a/src/15650/en_US-junah201.html b/src/15650/en_US-junah201.html new file mode 100644 index 00000000..35517c3d --- /dev/null +++ b/src/15650/en_US-junah201.html @@ -0,0 +1,43 @@ +
N and M (2)
+
+
+

Description

+
+
+

+ Given natural numbers \( N \) and \( M \), write a program that generates + all sequences of length \( M \) that satisfy the following conditions. +

+
    +
  • + Each sequence consists of \( M \) unique natural numbers chosen from 1 + to \( N \). +
    • +
  • The sequence must be in ascending order.
    • +
+
+
+
+
+

Input

+
+
+

+ The first line contains the natural numbers \( N \) and \( M \) such that + \( 1 \le M \le N \le 8 \). +

+
+
+
+
+

Output

+
+
+

+ Print each sequence that meets the problem's requirements on a new line. + Do not print any sequence more than once, and separate the numbers in each + sequence with spaces. +

+

Print the sequences in lexicographical (dictionary) order.

+
+
From b0b1c4a39de93512846dceec861028cd8b7bde8f Mon Sep 17 00:00:00 2001 From: junah201 Date: Fri, 25 Oct 2024 12:53:42 +0900 Subject: [PATCH 09/15] =?UTF-8?q?=E2=9C=A8=20feat:=2015651=EB=B2=88=20?= =?UTF-8?q?=EB=B2=88=EC=97=AD=20=EC=B6=94=EA=B0=80?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- index | 3 +++ src/15651/en_US-junah201.html | 43 +++++++++++++++++++++++++++++++++++ 2 files changed, 46 insertions(+) create mode 100644 src/15651/en_US-junah201.html diff --git a/index b/index index 877a873c..700b90a6 100644 --- a/index +++ b/index @@ -380,6 +380,9 @@ "15650": [ "en_US-junah201" ], + "15651": [ + "en_US-junah201" + ], "15764": [ "ko_KR-yup0927" ], diff --git a/src/15651/en_US-junah201.html b/src/15651/en_US-junah201.html new file mode 100644 index 00000000..45ea9851 --- /dev/null +++ b/src/15651/en_US-junah201.html @@ -0,0 +1,43 @@ +
N and M (3)
+
+
+

Description

+
+
+

+ Given natural numbers \( N \) and \( M \), write a program that generates + all sequences of length \( M \) that satisfy the following conditions. +

+
    +
  • + Each sequence consists of \( M \) numbers chosen from the natural + numbers between 1 and \( N \). +
    • +
  • The same number may be chosen multiple times.
    • +
+
+
+
+
+

Input

+
+
+

+ The first line contains the natural numbers \( N \) and \( M \) such that + \( 1 \le M \le N \le 7 \). +

+
+
+
+
+

Output

+
+
+

+ Print each sequence that meets the problem's requirements on a new line. + Do not print any sequence more than once, and separate the numbers in each + sequence with spaces. +

+

Print the sequences in lexicographical (dictionary) order.

+
+
From df50ea8c807da68e2575c92f2e7c8fc9b7a2a252 Mon Sep 17 00:00:00 2001 From: junah201 Date: Fri, 25 Oct 2024 12:57:22 +0900 Subject: [PATCH 10/15] =?UTF-8?q?=E2=9C=A8=20feat:=2015652=EB=B2=88=20?= =?UTF-8?q?=EB=B2=88=EC=97=AD=20=EC=B6=94=EA=B0=80?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- index | 3 ++ src/15652/en_US-junah201.html | 52 +++++++++++++++++++++++++++++++++++ 2 files changed, 55 insertions(+) create mode 100644 src/15652/en_US-junah201.html diff --git a/index b/index index 700b90a6..c3bebec7 100644 --- a/index +++ b/index @@ -383,6 +383,9 @@ "15651": [ "en_US-junah201" ], + "15652": [ + "en_US-junah201" + ], "15764": [ "ko_KR-yup0927" ], diff --git a/src/15652/en_US-junah201.html b/src/15652/en_US-junah201.html new file mode 100644 index 00000000..300b94e1 --- /dev/null +++ b/src/15652/en_US-junah201.html @@ -0,0 +1,52 @@ +
N and M (4)
+
+
+

Description

+
+
+

+ Given natural numbers \( N \) and \( M \), write a program that generates + all sequences of length \( M \) that satisfy the following conditions. +

+
    +
  • + Each sequence consists of \( M \) numbers chosen from the natural + numbers between 1 and \( N \). +
    • +
  • The same number may be chosen multiple times.
    • +
  • + Each sequence must be in non-decreasing order. +
      +
    • + A sequence of length \( K \), \( A \), is in non-decreasing order if + it satisfies \( A_1 \le A_2 \le \dots \le A_{K-1} \le A_K \). +
      • +
    +
    • +
+
+
+
+
+

Input

+
+
+

+ The first line contains the natural numbers \( N \) and \( M \) such that + \( 1 \le M \le N \le 8 \). +

+
+
+
+
+

Output

+
+
+

+ Print each sequence that meets the problem's requirements on a new line. + Do not print any sequence more than once, and separate the numbers in each + sequence with spaces. +

+

Print the sequences in lexicographical (dictionary) order.

+
+
From 13e22a7da0313d556466710827a82196577e2609 Mon Sep 17 00:00:00 2001 From: junah201 Date: Fri, 25 Oct 2024 13:05:11 +0900 Subject: [PATCH 11/15] =?UTF-8?q?=E2=9C=A8=20feat:=2015654=EB=B2=88=20?= =?UTF-8?q?=EB=B2=88=EC=97=AD=20=EC=B6=94=EA=B0=80?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- index | 5 +++- src/15654/en_US-junah201.html | 49 +++++++++++++++++++++++++++++++++++ 2 files changed, 53 insertions(+), 1 deletion(-) create mode 100644 src/15654/en_US-junah201.html diff --git a/index b/index index c3bebec7..2884ff9b 100644 --- a/index +++ b/index @@ -386,6 +386,9 @@ "15652": [ "en_US-junah201" ], + "15654": [ + "en_US-junah201" + ], "15764": [ "ko_KR-yup0927" ], @@ -1877,4 +1880,4 @@ "9978": [ "ko_KR-iktk" ] -} \ No newline at end of file +} diff --git a/src/15654/en_US-junah201.html b/src/15654/en_US-junah201.html new file mode 100644 index 00000000..5aa462ae --- /dev/null +++ b/src/15654/en_US-junah201.html @@ -0,0 +1,49 @@ +
N and M (5)
+
+
+

Description

+
+
+

+ Given natural numbers \( N \) and \( M \), write a program that generates + all sequences of length \( M \) that satisfy the following conditions. +

+
    +
      +
    • + Each sequence consists of \( M \) numbers chosen from the given set of + \( N \) natural numbers. +
      • +
    +
  • The same number may be chosen multiple times.
    • +
+
+
+
+
+

Input

+
+
+

+ The first line contains the natural numbers \( N \) and \( M \) such that + \( 1 \le M \le N \le 8 \). +

+

+ The second line contains \( N \) distinct natural numbers. Each number is + a natural number not greater than 10,000. +

+
+
+
+
+

Output

+
+
+

+ Print each sequence that meets the problem's requirements on a new line. + Do not print any sequence more than once, and separate the numbers in each + sequence with spaces. +

+

Print the sequences in lexicographical (dictionary) order.

+
+
From 061a0aa224de52cea2c1a9857055081a3564b365 Mon Sep 17 00:00:00 2001 From: junah201 Date: Fri, 25 Oct 2024 13:10:17 +0900 Subject: [PATCH 12/15] =?UTF-8?q?=E2=9C=A8=20feat:=2015655=EB=B2=88=20?= =?UTF-8?q?=EB=B2=88=EC=97=AD=20=EC=B6=94=EA=B0=80?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- index | 5 +++- src/15655/en_US-junah201.html | 50 +++++++++++++++++++++++++++++++++++ 2 files changed, 54 insertions(+), 1 deletion(-) create mode 100644 src/15655/en_US-junah201.html diff --git a/index b/index index 2884ff9b..6ffd122c 100644 --- a/index +++ b/index @@ -389,6 +389,9 @@ "15654": [ "en_US-junah201" ], + "15655": [ + "en_US-junah201" + ], "15764": [ "ko_KR-yup0927" ], @@ -1880,4 +1883,4 @@ "9978": [ "ko_KR-iktk" ] -} +} \ No newline at end of file diff --git a/src/15655/en_US-junah201.html b/src/15655/en_US-junah201.html new file mode 100644 index 00000000..6be25b03 --- /dev/null +++ b/src/15655/en_US-junah201.html @@ -0,0 +1,50 @@ +
N and M (6)
+
+
+

Description

+
+
+

+ Given \( N \) distinct natural numbers and a natural number \( M \), write + a program that generates all sequences of length \( M \) that satisfy the + following conditions. The \( N \) natural numbers are all distinct. +

+
    +
  • + Each sequence consists of \( M \) numbers chosen from the \( N \) + natural numbers. +
    • +
  • The chosen sequence must be in ascending order.
    • +
+
+
+
+
+

Input

+
+
+

+ The first line contains the integers \( N \) and \( M \) where \( 1 \le M + \le N \le 8 \). +

+

+ The second line contains \( N \) distinct natural numbers. Each number is + a natural number not greater than 10,000. +

+
+
+
+
+

Output

+
+
+

+ Print each sequence that meets the problem's requirements on a new line. + Do not print any sequence more than once, and separate the numbers in each + sequence with spaces. +

+

+ The sequences should be printed in lexicographical (dictionary) order. +

+
+
From 0eadce3d5936f2fcd5a34d15c8093be9eea56783 Mon Sep 17 00:00:00 2001 From: junah201 Date: Fri, 25 Oct 2024 13:13:15 +0900 Subject: [PATCH 13/15] =?UTF-8?q?=E2=9C=A8=20feat:=2015656=EB=B2=88=20?= =?UTF-8?q?=EB=B2=88=EC=97=AD=20=EC=B6=94=EA=B0=80?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- index | 3 +++ src/15656/en_US-junah201.html | 49 +++++++++++++++++++++++++++++++++++ 2 files changed, 52 insertions(+) create mode 100644 src/15656/en_US-junah201.html diff --git a/index b/index index 6ffd122c..16f2be41 100644 --- a/index +++ b/index @@ -392,6 +392,9 @@ "15655": [ "en_US-junah201" ], + "15656": [ + "en_US-junah201" + ], "15764": [ "ko_KR-yup0927" ], diff --git a/src/15656/en_US-junah201.html b/src/15656/en_US-junah201.html new file mode 100644 index 00000000..19de780f --- /dev/null +++ b/src/15656/en_US-junah201.html @@ -0,0 +1,49 @@ +
N and M (7)
+
+
+

Problem

+
+
+

+ Given \( N \) distinct natural numbers and a natural number \( M \), write + a program that generates all sequences of length \( M \) that satisfy the + following conditions. The \( N \) natural numbers are all distinct. +

+
    +
  • + A sequence of \( M \) numbers chosen from the \( N \) natural numbers. +
    • +
  • The same number can be chosen multiple times.
    • +
+
+
+
+
+

Input

+
+
+

+ The first line contains the integers \( N \) and \( M \) where \( 1 \le M + \le N \le 7 \). +

+

+ The second line contains \( N \) distinct natural numbers. Each number is + a natural number not greater than 10,000. +

+
+
+
+
+

Output

+
+
+

+ Print each sequence that meets the problem's requirements on a new line. + Do not print any sequence more than once, and separate the numbers in each + sequence with spaces. +

+

+ The sequences should be printed in lexicographical (dictionary) order. +

+
+
From 7aee6a821c14f66a48ee93cba610568ebb8b7725 Mon Sep 17 00:00:00 2001 From: junah201 Date: Fri, 25 Oct 2024 13:16:24 +0900 Subject: [PATCH 14/15] =?UTF-8?q?=E2=9C=A8=20feat:=2015657=EB=B2=88=20?= =?UTF-8?q?=EB=B2=88=EC=97=AD=20=EC=B6=94=EA=B0=80?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- index | 3 ++ src/15657/en_US-junah201.html | 58 +++++++++++++++++++++++++++++++++++ 2 files changed, 61 insertions(+) create mode 100644 src/15657/en_US-junah201.html diff --git a/index b/index index 16f2be41..54c3ba6f 100644 --- a/index +++ b/index @@ -395,6 +395,9 @@ "15656": [ "en_US-junah201" ], + "15657": [ + "en_US-junah201" + ], "15764": [ "ko_KR-yup0927" ], diff --git a/src/15657/en_US-junah201.html b/src/15657/en_US-junah201.html new file mode 100644 index 00000000..60673519 --- /dev/null +++ b/src/15657/en_US-junah201.html @@ -0,0 +1,58 @@ +
N and M (8)
+
+
+

Problem

+
+
+

+ Given \( N \) distinct natural numbers and a natural number \( M \), write + a program that generates all sequences of length \( M \) that satisfy the + following conditions. The \( N \) natural numbers are all distinct. +

+
    +
  • + A sequence of \( M \) numbers chosen from the \( N \) natural numbers. +
    • +
  • The same number can be chosen multiple times.
    • +
  • + The chosen sequence must be non-decreasing. +
      +
    • + A sequence \( A \) of length \( K \) is said to be non-decreasing if + it satisfies \( A_1 \leq A_2 \leq \ldots \leq A_{K-1} \leq A_K \). +
      • +
    +
    • +
+
+
+
+
+

Input

+
+
+

+ The first line contains the integers \( N \) and \( M \) where \( 1 \leq M + \leq N \leq 8 \). +

+

+ The second line contains \( N \) distinct natural numbers. Each number is + a natural number not greater than 10,000. +

+
+
+
+
+

Output

+
+
+

+ Print each sequence that meets the problem's requirements on a new line. + Do not print any sequence more than once, and separate the numbers in each + sequence with spaces. +

+

+ The sequences should be printed in lexicographical (dictionary) order. +

+
+
From 3d143a384a3af7e95f89f516bba8f8a7e46ab646 Mon Sep 17 00:00:00 2001 From: junah201 Date: Fri, 25 Oct 2024 13:29:28 +0900 Subject: [PATCH 15/15] =?UTF-8?q?=E2=9C=A8=20feat:=2015663=EB=B2=88=20?= =?UTF-8?q?=EB=B2=88=EC=97=AD=20=EC=B6=94=EA=B0=80?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- index | 3 +++ src/15663/en_US-junah201.html | 48 +++++++++++++++++++++++++++++++++++ 2 files changed, 51 insertions(+) create mode 100644 src/15663/en_US-junah201.html diff --git a/index b/index index 54c3ba6f..f58ca839 100644 --- a/index +++ b/index @@ -398,6 +398,9 @@ "15657": [ "en_US-junah201" ], + "15663": [ + "en_US-junah201" + ], "15764": [ "ko_KR-yup0927" ], diff --git a/src/15663/en_US-junah201.html b/src/15663/en_US-junah201.html new file mode 100644 index 00000000..07d9def0 --- /dev/null +++ b/src/15663/en_US-junah201.html @@ -0,0 +1,48 @@ +
N and M (9)
+
+
+

Problem

+
+
+

+ Given \( N \) natural numbers and a natural number \( M \), write a + program that generates all sequences of length \( M \) that satisfy the + following condition. +

+
    +
  • + A sequence of \( M \) numbers chosen from the \( N \) natural numbers. +
    • +
+
+
+
+
+

Input

+
+
+

+ The first line contains the integers \( N \) and \( M \) where \( 1 \leq M + \leq N \leq 8 \). +

+

+ The second line contains \( N \) natural numbers. Each number is a natural + number not greater than 10,000. +

+
+
+
+
+

Output

+
+
+

+ Print each sequence that meets the problem's requirements on a new line. + Do not print any sequence more than once, and separate the numbers in each + sequence with spaces. +

+

+ The sequences should be printed in lexicographical (dictionary) order. +

+
+