Question

Информатика БЕЛЬЧОНОК С ОРЕХОМ Задача Любимец Софии Бельчонок живет на очень высоком дереве на высоте h метров. Он хочет поднять в свое дупло орех. За день он поднимается вместе с орехом на a метров, а за ночь орех скатывается вниз на b метров. На какой день бельчонок поднимет орех до своего дупла? Входные данные Программа получает на вход натуральные числа h, a, b. Выходные данные Программа должна вывести одно натуральное число. Гарантируется, что a > b. Примеры № Входные данные Выходные данные 1 10 3 2 8 Запрещенные операторы: if;for;while;?;max;min

Answer 1

Ответ:

import math

h=int(input())

a=int(input())

b=int(input())

print (math.ceil((h-a)/(a-b))+1)

Answer 2

Problem Analysis

The problem states that a squirrel named Belchonok lives on a tree at a height of h meters. Belchonok wants to bring an acorn up to his nest. During the day, he climbs up a meters, and during the night, the acorn rolls down b meters. We need to determine on which day Belchonok will bring the acorn up to his nest.

Solution

To solve this problem, we can use a simple mathematical approach. We need to calculate the number of days it takes for Belchonok to reach a height greater than or equal to h.

Let's assume that on the first day, Belchonok climbs up a meters. On the second day, he climbs up a meters again, but the acorn rolls down b meters during the night. So, at the beginning of the second day, Belchonok is at a height of a - b meters. On the third day, he climbs up a meters again, but the acorn rolls down b meters during the night. So, at the beginning of the third day, Belchonok is at a height of (a - b) + a - b = 2a - 2b meters.

We can observe that on each subsequent day, Belchonok's height increases by (a - b) meters. Therefore, the height on the nth day can be calculated as:

height = a + (n - 1) * (a - b)

We need to find the smallest value of n for which the height is greater than or equal to h. We can solve this equation to find the value of n:

a + (n - 1) * (a - b) >= h

Simplifying the equation, we get:

n >= (h - a) / (a - b) + 1

Since n must be a natural number, we need to round up the result of the division to the nearest integer. We can use the ceiling function to achieve this.

Pseudocode

Here's the pseudocode for the solution:

h = input("Enter the height of the tree: ")
a = input("Enter the distance climbed during the day: ")
b = input("Enter the distance rolled down during the night: ")

n = ceil((h - a) / (a - b)) + 1

print("Belchonok will bring the acorn up to his nest on day", n)

Example

Let's consider the example provided in the problem statement: - h = 10 (height of the tree) - a = 3 (distance climbed during the day) - b = 2 (distance rolled down during the night)

Using the formula, we can calculate the value of n:

n = ceil((10 - 3) / (3 - 2)) + 1 = ceil(7 / 1) + 1 = 7 + 1 = 8

Therefore, Belchonok will bring the acorn up to his nest on the 8th day.

Implementation

Here's an implementation of the solution in Python:

import math

h = int(input("Enter the height of the tree: "))
a = int(input("Enter the distance climbed during the day: "))
b = int(input("Enter the distance rolled down during the night: "))

n = math.ceil((h - a) / (a - b)) + 1

print("Belchonok will bring the acorn up to his nest on day", n)

Please note that the above code snippet is a complete program that takes input from the user and prints the result. You can run it in any Python environment to get the desired output.

I hope this helps! Let me know if you have any further questions.