Auto-translated
So, the competition program includes 5 tasks, with the following programming languages: Basic, Delphi, C++. Please send your code to my email in .txt format.
Task #1 (very easy):
Given a race, determine the level 7 unit of that race.
Task #2 (high school level):
Input the names of heroes and their levels, and output a list of heroes sorted by level in ascending order.
Task #3 (solvable):
Two warriors meet in a field, but one realizes he cannot defeat his opponent and decides to use trickery.
Both warriors attack without retaliation, on a field of length n cells. The first can teleport to any cell, and the second is a foot soldier with a speed of v cells.
Warrior 1: A HP, damage - A1, where B1-A1 > 0
Warrior 2: B HP, damage - B1, where B-A > 0
Can warrior 1 defeat warrior 2 if, in one turn, he can either move and attack (in any order)?
Task #4 (related to programming):
The task condition is extremely short - write qsort (specifically for those who know it)!
I strongly request that you do not copy from the internet or other sources; I hope for your honesty and solidarity with the other participants.
Task #5 (a bit more complex):
A hero is lost in the Dungeon and cannot find the exit! You volunteered to help him!
Let's imagine that the Dungeon is a collection of caves (n of them) connected by tunnels, and up to 4 tunnels can lead out of the same cave (including the one you came through).
Find the shortest path to the exit in the given Dungeon, from the hero's location to the exit location (the Dungeon can be defined using a 2-dimensional array). If no such path exists, output that the hero will not survive.
The tournament will last until the end of summer.
I look forward to it! :)