From 24bed1ea41ef1412219ffc7cd36b1488a17e56f2 Mon Sep 17 00:00:00 2001
From: "Yusuke.T" <67862122+YuHima03@users.noreply.github.com>
Date: Thu, 16 May 2024 19:25:23 +0900
Subject: [PATCH 1/5] =?UTF-8?q?=E3=83=95=E3=82=A3=E3=83=9C=E3=83=8A?=
 =?UTF-8?q?=E3=83=83=E3=83=81=E6=95=B0=E5=88=97=E3=81=AE=E5=88=9D=E9=A0=85?=
 =?UTF-8?q?=E3=82=921=E3=81=A8=E3=81=99=E3=82=8B=E3=81=93=E3=81=A8?=
 =?UTF-8?q?=E3=82=92=E6=98=8E=E8=A8=98?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 docs/text/chapter-4/practice/fibonatti.md | 2 ++
 1 file changed, 2 insertions(+)

diff --git a/docs/text/chapter-4/practice/fibonatti.md b/docs/text/chapter-4/practice/fibonatti.md
index 2e2492d..92fa9a7 100644
--- a/docs/text/chapter-4/practice/fibonatti.md
+++ b/docs/text/chapter-4/practice/fibonatti.md
@@ -2,6 +2,8 @@
 
 整数$N$を受け取り、フィボナッチ数列の$N$番目を出力しよう。
 
+ただし、フィボナッチ数列は $\{1,1,2,...\}$ とします。
+
 :::spoiler Hint 1
 $F_{n}=F_{n-1}+F_{n-2}$をfor文で計算しよう。
 :::

From f92f69cb92ccb1749ce05701cdf2b940fd71179c Mon Sep 17 00:00:00 2001
From: "Yusuke.T" <67862122+YuHima03@users.noreply.github.com>
Date: Thu, 16 May 2024 19:26:03 +0900
Subject: [PATCH 2/5] =?UTF-8?q?Fibonatti=20Number=E3=81=AE=E8=A7=A3?=
 =?UTF-8?q?=E7=AD=94=E3=81=AE=E3=82=B3=E3=83=BC=E3=83=89=E3=82=92=E4=BF=AE?=
 =?UTF-8?q?=E6=AD=A3?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 docs/text/chapter-4/practice/fibonatti.md | 4 ++--
 1 file changed, 2 insertions(+), 2 deletions(-)

diff --git a/docs/text/chapter-4/practice/fibonatti.md b/docs/text/chapter-4/practice/fibonatti.md
index 92fa9a7..9626c04 100644
--- a/docs/text/chapter-4/practice/fibonatti.md
+++ b/docs/text/chapter-4/practice/fibonatti.md
@@ -26,7 +26,7 @@ int main() {
     int n;
     cin >> n;
     int second_latest = 0, latest = 1;
-    for (int i = 2; i < n; i++) {
+    for (int i = 1; i < n; i++) {
         int next = second_latest + latest;
         second_latest = latest;
         latest = next;
@@ -46,7 +46,7 @@ int main() {
     int n;
     cin >> n;
     vector<int> fibonatti_sequence = {0, 1};
-    for (int i = 2; i < n; i++) {
+    for (int i = 1; i < n; i++) {
         int next = fibonatti_sequence[i-1] + fibonatti_sequence[i-2];
         fibonatti_sequence.push_back(next);
     }

From c76f9cd1834c7c2166a880f9e62ea95cda160c93 Mon Sep 17 00:00:00 2001
From: "Yusuke.T" <67862122+YuHima03@users.noreply.github.com>
Date: Thu, 16 May 2024 19:26:34 +0900
Subject: [PATCH 3/5] =?UTF-8?q?=E6=95=B4=E6=95=B0N=E2=86=92=E6=AD=A3?=
 =?UTF-8?q?=E3=81=AE=E6=95=B4=E6=95=B0N=20=E3=81=AB=E8=A1=A8=E8=A8=98?=
 =?UTF-8?q?=E3=82=92=E5=A4=89=E6=9B=B4?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 docs/text/chapter-4/practice/fibonatti.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/docs/text/chapter-4/practice/fibonatti.md b/docs/text/chapter-4/practice/fibonatti.md
index 9626c04..5b0a722 100644
--- a/docs/text/chapter-4/practice/fibonatti.md
+++ b/docs/text/chapter-4/practice/fibonatti.md
@@ -1,6 +1,6 @@
 # 4-xx. Fibonatti Number
 
-整数$N$を受け取り、フィボナッチ数列の$N$番目を出力しよう。
+正の整数$N$を受け取り、フィボナッチ数列の$N$番目を出力しよう。
 
 ただし、フィボナッチ数列は $\{1,1,2,...\}$ とします。
 

From 82b0f79988c1961cf76e645798899170727d0017 Mon Sep 17 00:00:00 2001
From: "Yusuke.T" <67862122+YuHima03@users.noreply.github.com>
Date: Thu, 16 May 2024 19:27:19 +0900
Subject: [PATCH 4/5] =?UTF-8?q?fibonatti.md=20=E3=81=AEmd=E3=82=92?=
 =?UTF-8?q?=E4=BF=AE=E6=AD=A3?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

コードブロック閉じの記号を追加
---
 docs/text/chapter-4/practice/fibonatti.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/docs/text/chapter-4/practice/fibonatti.md b/docs/text/chapter-4/practice/fibonatti.md
index 5b0a722..d7cd789 100644
--- a/docs/text/chapter-4/practice/fibonatti.md
+++ b/docs/text/chapter-4/practice/fibonatti.md
@@ -52,5 +52,5 @@ int main() {
     }
     cout << fibonatti_sequence.back() << endl;
 }
-
+```
 :::

From 4616086e956247c8e1d457445bc76121cdaaab27 Mon Sep 17 00:00:00 2001
From: "Yusuke.T" <67862122+YuHima03@users.noreply.github.com>
Date: Thu, 23 May 2024 02:01:52 +0900
Subject: [PATCH 5/5] =?UTF-8?q?=E8=A7=A3=E7=AD=94=E3=81=AEfor=E6=96=87?=
 =?UTF-8?q?=E3=81=AE=E6=9B=B8=E3=81=8D=E6=96=B9=E3=82=92=E4=BF=AE=E6=AD=A3?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

フィボナッチ数列のi番目を計算していることが分かりやすいようにした.
---
 docs/text/chapter-4/practice/fibonatti.md | 6 ++++--
 1 file changed, 4 insertions(+), 2 deletions(-)

diff --git a/docs/text/chapter-4/practice/fibonatti.md b/docs/text/chapter-4/practice/fibonatti.md
index d7cd789..6bf35e9 100644
--- a/docs/text/chapter-4/practice/fibonatti.md
+++ b/docs/text/chapter-4/practice/fibonatti.md
@@ -26,7 +26,8 @@ int main() {
     int n;
     cin >> n;
     int second_latest = 0, latest = 1;
-    for (int i = 1; i < n; i++) {
+    for (int i = 2; i <= n; i++) {
+        // i番目を計算
         int next = second_latest + latest;
         second_latest = latest;
         latest = next;
@@ -46,7 +47,8 @@ int main() {
     int n;
     cin >> n;
     vector<int> fibonatti_sequence = {0, 1};
-    for (int i = 1; i < n; i++) {
+    for (int i = 2; i <= n; i++) {
+        // i番目を計算
         int next = fibonatti_sequence[i-1] + fibonatti_sequence[i-2];
         fibonatti_sequence.push_back(next);
     }