-
Notifications
You must be signed in to change notification settings - Fork 18
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
1 parent
913cdcb
commit 9f03d92
Showing
6 changed files
with
161 additions
and
29 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Loading
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,57 @@ | ||
| # Mars Lander - Episode 1 | ||
|
|
||
| ## Description | ||
|
|
||
| This puzzle teaches you how to compare values using a simple condition. It's an introduction to the "Mars Lander" series of puzzles and requires only a simple condition to solve. | ||
|
|
||
| ## Solution Overview | ||
|
|
||
| The algorithm starts by reading the surface data. Then, it enters an infinite loop, continually reading the current state of the spacecraft and calculating the new thrust power based on the vertical speed. The thrust power is adjusted by one unit if the vertical speed exceeds the maximum allowed, and the new power value is adjusted to be within the valid range. The thrust power is adjusted by one unit if the vertical speed is below the minimum allowed, and the new power value is adjusted to be within the valid range. Finally, the new thrust power and rotation angle are printed to the console. | ||
|
|
||
| ## Code Example | ||
|
|
||
| ```csharp | ||
| using System; | ||
|
|
||
| class Player | ||
| { | ||
| // Define constants for better readability and maintainability | ||
| const int MAX_VERTICAL_SPEED = -40; // Maximum allowed vertical speed before adjusting thrust | ||
| const int MAX_THRUST_POWER = 4; // Maximum thrust power | ||
| const int MIN_THRUST_POWER = 0; // Minimum thrust power | ||
| static void Main(string[] args) | ||
| { | ||
| string[] inputs; | ||
| int surfaceN = int.Parse(Console.ReadLine()); // the number of points used to draw the surface of Mars. | ||
| for (int i = 0; i < surfaceN; i++) | ||
| { | ||
| inputs = Console.ReadLine().Split(' '); | ||
| int landX = int.Parse(inputs[0]); // X coordinate of a surface point. (0 to 6999) | ||
| int landY = int.Parse(inputs[1]); // Y coordinate of a surface point. By linking all the points together in a sequential fashion, you form the surface of Mars. | ||
| } | ||
|
|
||
| // game loop | ||
| while (true) | ||
| { | ||
| inputs = Console.ReadLine().Split(' '); | ||
| int hSpeed = int.Parse(inputs[2]); // the horizontal speed (in m/s), can be negative. | ||
| int vSpeed = int.Parse(inputs[3]); // the vertical speed (in m/s), can be negative. | ||
| int power = int.Parse(inputs[6]); // the thrust power (0 to 4). | ||
| // Adjust thrust power based on the vertical speed using constants | ||
| if (vSpeed <= MAX_VERTICAL_SPEED && power < MAX_THRUST_POWER) // Increase thrust if falling too fast | ||
| { | ||
| power++; | ||
| } | ||
| else if (vSpeed > MAX_VERTICAL_SPEED && power > MIN_THRUST_POWER) // Decrease thrust if falling slowly | ||
| { | ||
| power--; | ||
| } | ||
|
|
||
| // Output the desired rotation and power (rotation is always 0 for this level) | ||
| Console.WriteLine("0 " + power); | ||
| } | ||
| } | ||
| } | ||
| ``` |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,43 @@ | ||
| using System; | ||
|
|
||
| class Player | ||
| { | ||
| // Define constants for better readability and maintainability | ||
| const int MAX_VERTICAL_SPEED = -40; // Maximum allowed vertical speed before adjusting thrust | ||
| const int MAX_THRUST_POWER = 4; // Maximum thrust power | ||
| const int MIN_THRUST_POWER = 0; // Minimum thrust power | ||
|
|
||
| static void Main(string[] args) | ||
| { | ||
| string[] inputs; | ||
| int surfaceN = int.Parse(Console.ReadLine()); // the number of points used to draw the surface of Mars. | ||
| for (int i = 0; i < surfaceN; i++) | ||
| { | ||
| inputs = Console.ReadLine().Split(' '); | ||
| int landX = int.Parse(inputs[0]); // X coordinate of a surface point. (0 to 6999) | ||
| int landY = int.Parse(inputs[1]); // Y coordinate of a surface point. By linking all the points together in a sequential fashion, you form the surface of Mars. | ||
| } | ||
|
|
||
| // game loop | ||
| while (true) | ||
| { | ||
| inputs = Console.ReadLine().Split(' '); | ||
| int hSpeed = int.Parse(inputs[2]); // the horizontal speed (in m/s), can be negative. | ||
| int vSpeed = int.Parse(inputs[3]); // the vertical speed (in m/s), can be negative. | ||
| int power = int.Parse(inputs[6]); // the thrust power (0 to 4). | ||
|
|
||
| // Adjust thrust power based on the vertical speed using constants | ||
| if (vSpeed <= MAX_VERTICAL_SPEED && power < MAX_THRUST_POWER) // Increase thrust if falling too fast | ||
| { | ||
| power++; | ||
| } | ||
| else if (vSpeed > MAX_VERTICAL_SPEED && power > MIN_THRUST_POWER) // Decrease thrust if falling slowly | ||
| { | ||
| power--; | ||
| } | ||
|
|
||
| // Output the desired rotation and power (rotation is always 0 for this level) | ||
| Console.WriteLine("0 " + power); | ||
| } | ||
| } | ||
| } |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters