The Descent

README.md

@@ -14,7 +14,7 @@ The "Solutions to CodinGame Puzzles" project is a collection of answers to codin
 | Title | Solution(s) | Topic(s) |
 | :---: | :------: | :------: |
 | Onboarding 🛹 | [Python](./puzzles/python3/onboarding), [JavaScript](./puzzles/js/onboarding), [C++](./puzzles/cpp/onboarding) | Variables, Input/Output, Conditions |
-| The Descent 🌄 | [Python](./puzzles/python3/the-descent) ★, [Kotlin](./puzzles/kotlin/src/the-descent), [TypeScript](./puzzles/ts/the-descent), [C](./puzzles/c/the-descent) | Conditions, Loops |
+| The Descent 🌄 | [Python](./puzzles/python3/the-descent) ★, [Kotlin](./puzzles/kotlin/src/the-descent), [TypeScript](./puzzles/ts/the-descent), [C++](./puzzles/cpp/the-descent) | Conditions, Loops |
 | Power of Thor 1 ⚡ | [Python](./puzzles/python3/power-of-thor1) ★, [Kotlin](./puzzles/kotlin/src/power-of-thor1), [TypeScript](./puzzles/ts/power-of-thor1), [C++](./puzzles/cpp/power-of-thor1.cpp), [Swift](./puzzles/swift/power-of-thor1) | Input/Output, Conditions |
 | Temperatures ❄️ | [Python](./puzzles/python3/temperatures) ★, [Kotlin](./puzzles/kotlin/src/temperatures), [TypeScript](./puzzles/ts/temperatures), [Ruby](./puzzles/ruby/temperatures) | Conditions, Loops, Arrays |
 | Mars Lander 1 🚀 | [Python](./puzzles/python3/mars-lander1), [Kotlin](./puzzles/kotlin/src/mars-lander1), [TypeScript](./puzzles/ts/mars-lander1) ★, [C++](./puzzles/cpp/mars-lander1.cpp) | Conditions, Loops |

puzzles/cpp/the-descent/README.md

@@ -0,0 +1,60 @@
+# The Descent
+
+## Description
+
+The goal of the puzzle is to destroy the mountains by firing at the highest one at the start of each game turn. The heights of the mountains are given as input, and the output should be the index of the mountain to fire at. The game is won if all the mountains are destroyed, and lost if the ship crashes into a mountain.
+
+## Algorithm
+
+The following code snippet is a game loop that continuously reads the heights of 8 mountains and outputs the index of the highest mountain to "shoot" at. It does this by iterating through the mountain heights, keeping track of the highest height and its corresponding index, and then printing the index of the highest mountain. The loop repeats indefinitely.
+
+## Example Input/Output
+
+**Input**
+
+```
+9
+8
+7
+6
+5
+4
+3
+2
+```
+
+**Output**
+
+```
+0
+```
+
+## Code Example
+
+```cpp
+#include <iostream>
+using namespace std;
+
+int main() {
+    // Game loop
+    while (true) {
+        int highestIndex = 0;
+        int highestHeight = -1;
+
+        // Read the heights of the mountains and determine the highest
+        for (int i = 0; i < 8; i++) {
+            int mountainHeight;
+            cin >> mountainHeight;
+
+            // Check if this mountain is the highest so far
+            if (mountainHeight > highestHeight) {
+                highestHeight = mountainHeight;
+                highestIndex = i;
+            }
+        }
+
+        // Output the index of the highest mountain to shoot
+        cout << highestIndex << endl;
+    }
+}
+```

puzzles/cpp/the-descent/the_descent.cpp

@@ -0,0 +1,25 @@
+#include <iostream>
+using namespace std;
+
+int main() {
+    // Game loop
+    while (true) {
+        int highestIndex = 0;
+        int highestHeight = -1;
+
+        // Read the heights of the mountains and determine the highest
+        for (int i = 0; i < 8; i++) {
+            int mountainHeight;
+            cin >> mountainHeight;
+
+            // Check if this mountain is the highest so far
+            if (mountainHeight > highestHeight) {
+                highestHeight = mountainHeight;
+                highestIndex = i;
+            }
+        }
+
+        // Output the index of the highest mountain to shoot
+        cout << highestIndex << endl;
+    }
+}

puzzles/python3/the-descent/README.md

@@ -2,21 +2,28 @@
 
 ## Description
 
-In "The Descent" puzzle, you are given an array of integers representing the heights of a set of mountains. Your goal is to determine which mountain is the tallest and shoot it down by printing its index to the console.
+The goal of the puzzle is to destroy the mountains by firing at the highest one at the start of each game turn. The heights of the mountains are given as input, and the output should be the index of the mountain to fire at. The game is won if all the mountains are destroyed, and lost if the ship crashes into a mountain.
 
-## Approach
+## Algorithm
 
-The approach for solving "The Descent" puzzle is simple. You iterate over the array of mountains and keep track of the tallest mountain seen so far. Once you have iterated over all the mountains, you print the index of the tallest mountain to the console.
+The following code snippet is a game loop that continuously reads the heights of 8 mountains and outputs the index of the highest mountain to "shoot" at. It does this by iterating through the mountain heights, keeping track of the highest height and its corresponding index, and then printing the index of the highest mountain. The loop repeats indefinitely.
 
 ## Example Input/Output
 
-Let's consider the following array of mountains:
+**Input for one game turn**
 
 ```
-[9, 8, 6, 7, 3, 5, 4, 1, 2]
+9
+8
+7
+6
+5
+4
+3
+2
 ```
 
-Here, the tallest mountain is the one with a height of `9`. The index of this mountain in the array is `0`. Therefore, the output of the program should be:
+**Output for one game turn**
 
 ```
 0
@@ -25,22 +32,19 @@ Here, the tallest mountain is the one with a height of `9`. The index of this mo
 ## Code Example
 
 ```python
-import sys
-
-# Game loop
 while True:
-    heights = []
-
-    # Read the heights of the mountains
-    for _ in range(8):
-        mountain_height = int(input())  # Height of the mountain
-        heights.append(mountain_height)
-
-    # Find the index of the highest mountain
-    max_height = max(heights)
-    max_height_index = heights.index(max_height)
-
-    # Output the index of the highest mountain to shoot
-    print(max_height_index)
+    highest_index = 0
+    highest_height = -1
+
+    # Read the heights of the mountains and determine the highest
+    for i in range(8):
+        mountain_height = int(input())
+
+        # Check if this mountain is the highest so far
+        if mountain_height > highest_height:
+            highest_height = mountain_height
+            highest_index = i
 
+    # Output the index of the highest mountain to shoot
+    print(highest_index)
 ```

puzzles/python3/the-descent/the_descent.py

@@ -1,17 +1,15 @@
-from typing import List
-
-
-def solve(mountain_heights: List[int]) -> int:
-    index_to_fire = 0
-    max_mountain_height = -1
-    for index, mountain_height in enumerate(mountain_heights):
-        if mountain_height > max_mountain_height:
-            max_mountain_height = mountain_height
-            index_to_fire = index
-    return index_to_fire
-
-
-if __name__ == "__main__":
-    while True:
-        mountain_heights = [int(input()) for _ in range(8)]
-        print(solve(mountain_heights))
+while True:
+    highest_index = 0
+    highest_height = -1
+
+    # Read the heights of the mountains and determine the highest
+    for i in range(8):
+        mountain_height = int(input())
+
+        # Check if this mountain is the highest so far
+        if mountain_height > highest_height:
+            highest_height = mountain_height
+            highest_index = i
+
+    # Output the index of the highest mountain to shoot
+    print(highest_index)