N
i have one problem can somone help me?
Size: a a a
2021 January 02
N
In the Byteotian Rope Park, an overview of trees, one behind the other in a row, is too fresh. Tree 𝑖 screen 𝑥𝑖 meters from the entrances and at a height of 𝑦𝑖 meters there is a station that you can use as a start or the end of the rope descent. By fate, all numbers 𝑥𝑖 and 𝑦𝑖 are integers. The management of the park of the new recreation of the exit, which would be the safest, i.e. the carrier is diagnostic The smallest. As we know from geometry, the slope of the rope spanning between station 𝑖 and station 𝑗 will be the quotient of the difference in height and the difference in the distance between the trees, that is, it will be equal to | 𝑦𝑖 - 𝑦𝑗 | | 𝑥𝑖 - 𝑥𝑗 | (obviously doesn't have to be a course). So choose a place to minimize this quotient - write a program that will load the search description, plans the safest rope descent and writes the station numbers to the triggered exit. We are not interested in the situation in which the slope is equal to 0, i.e. between equal heights - it would be impossible to move after the descent Entrance In the first line of local ports, one natural number 000 (1 ≤ 𝑁 ≤ 200,000) is used as trees. In response, local lines contain descriptions of the positions of trees. Description of the tree item number 𝑖 version of two numbers non-negative fish 𝑥𝑖 and 𝑦𝑖 (1 ≤ 𝑥𝑖 , 𝑦𝑖 ≤ 200,000) defining respectively: the distance of the tree from the entrances to w meters and the height in meters at which the designated exit station has been designated. Trees do not need to be listed in ascending order 𝑥𝑖 - they were planted at different times, which gave them numbers in a random order. The values of 𝑥𝑖 are pairwise distinct (no two trees are at the same place). It is guaranteed that there is at least one pair of trees of different heights. Exit In the first (only) line of output, the output is two final numbers 𝑖, 𝑗, (1 ≤ 𝑖, 𝑗 ≤ 𝑁, 𝑖 ≠ 𝑗) denoting the numbers safer rope descent. If there are many correct answers you can unsubscribe any of them. You can also print the numbers 𝑖, 𝑗 in order. Assessment You can task the task in a few simpler variants - some groups of tests optional additional additional possibilities. The table below shows how many points your program will receive if it passes the tests with this restriction.
N
sorry if thats not correct in english but i transalted it
R3
Хранить например id юзера для использования в хендлерах
class User:
id: int
id: int
N
and i need help
N
how to start
N
In the Byteotian Rope Park, an overview of trees, one behind the other in a row, is too fresh. Tree 𝑖 screen 𝑥𝑖 meters from the entrances and at a height of 𝑦𝑖 meters there is a station that you can use as a start or the end of the rope descent. By fate, all numbers 𝑥𝑖 and 𝑦𝑖 are integers. The management of the park of the new recreation of the exit, which would be the safest, i.e. the carrier is diagnostic The smallest. As we know from geometry, the slope of the rope spanning between station 𝑖 and station 𝑗 will be the quotient of the difference in height and the difference in the distance between the trees, that is, it will be equal to | 𝑦𝑖 - 𝑦𝑗 | | 𝑥𝑖 - 𝑥𝑗 | (obviously doesn't have to be a course). So choose a place to minimize this quotient - write a program that will load the search description, plans the safest rope descent and writes the station numbers to the triggered exit. We are not interested in the situation in which the slope is equal to 0, i.e. between equal heights - it would be impossible to move after the descent Entrance In the first line of local ports, one natural number 000 (1 ≤ 𝑁 ≤ 200,000) is used as trees. In response, local lines contain descriptions of the positions of trees. Description of the tree item number 𝑖 version of two numbers non-negative fish 𝑥𝑖 and 𝑦𝑖 (1 ≤ 𝑥𝑖 , 𝑦𝑖 ≤ 200,000) defining respectively: the distance of the tree from the entrances to w meters and the height in meters at which the designated exit station has been designated. Trees do not need to be listed in ascending order 𝑥𝑖 - they were planted at different times, which gave them numbers in a random order. The values of 𝑥𝑖 are pairwise distinct (no two trees are at the same place). It is guaranteed that there is at least one pair of trees of different heights. Exit In the first (only) line of output, the output is two final numbers 𝑖, 𝑗, (1 ≤ 𝑖, 𝑗 ≤ 𝑁, 𝑖 ≠ 𝑗) denoting the numbers safer rope descent. If there are many correct answers you can unsubscribe any of them. You can also print the numbers 𝑖, 𝑗 in order. Assessment You can task the task in a few simpler variants - some groups of tests optional additional additional possibilities. The table below shows how many points your program will receive if it passes the tests with this restriction.
can sonmone help[?
КБ
can sonmone help[?
Don't flood!!
👑️
Предпочту сделать отдельный класс для такого с более жесткой схеммой
+
K
Вы увеличили карму Rud 356 до 1870.11 (+11.58)
N
Don't flood!!
?
БГ
class User:
id: int
id: int
Ага, окей
И как его увидит хендлер?
И как его увидит хендлер?
КБ
how to start
Write code, that's start
R3
Ага, окей
И как его увидит хендлер?
И как его увидит хендлер?
Где увидит? Чо увидит? Чо за блять абстрактный хендлер? Так много вопросов, и так мало ответов
N
Write code, that's start
but how
БГ
Где увидит? Чо увидит? Чо за блять абстрактный хендлер? Так много вопросов, и так мало ответов
Как ты это в хендлере поймаешь
N
im doing this first time
N
and i need help
БГ
Откуда он узнает юзерид
N
it can be in c++ or in python