From d49b98e349a5c51bee50d5b707825e2a06730684 Mon Sep 17 00:00:00 2001
From: Stoycho Kyosev <68247567+stoychoX@users.noreply.github.com>
Date: Mon, 25 Oct 2021 15:28:54 +0300
Subject: Add files via upload

---
 pract_KN/pract. 03/solutions/5.cpp | 30 ++++++++++++++++++++++++++++++
 1 file changed, 30 insertions(+)
 create mode 100644 pract_KN/pract. 03/solutions/5.cpp

(limited to 'pract_KN/pract. 03/solutions/5.cpp')

diff --git a/pract_KN/pract. 03/solutions/5.cpp b/pract_KN/pract. 03/solutions/5.cpp
new file mode 100644
index 0000000..ef81f30
--- /dev/null
+++ b/pract_KN/pract. 03/solutions/5.cpp	
@@ -0,0 +1,30 @@
+#include<iostream>
+
+int main() {
+	int number = 0;
+	
+	int temp = 0;
+	int tempTwo = 1;
+
+	int result = 0;
+
+	std::cin >> number;
+
+	for (int i = 0; i < number; i++) {
+		result = tempTwo;
+		tempTwo = tempTwo + temp;
+		temp = result;
+		//std::cout << "Local result at step " << i << " is: " << result << std::endl;
+	}
+	std::cout << result;
+
+	/*При числата на фибоначи всяко следващо е сбор на предходните две.
+	Започваме от 0 и 1.
+	Създаваме две променливи които представляват стойностите в 0 и 1.
+
+	0 1 1 2 3 5 8 13 (х)
+	В случая х = 13 + 8.
+
+	Премахнете коментара в цикъла за да видите подробно как работи той. Пробвайте по - големи входове (примерно 17-19).
+	*/
+}
-- 
cgit v1.3.1-23-gd82d