蜗牛 - 题目

#16982. 蜗牛

统计

AI Translation — This statement was translated using AI and may contain inaccuracies. Please refer to the original statement if in doubt.

一只蜗牛在地面上。它想要爬到一根从地面算起高度为 $V$ 米的木杆顶端。在一天中，它可以向上爬 $A$ 米，然而在每天晚上睡觉时，它会向下滑落 $B$ 米。确定它爬到顶端需要多少天。

输入格式

输入的第一行也是唯一的一行包含三个由单个空格分隔的整数：$A$，$B$ 和 $V$（$1 \le B < A \le V \le 1\,000\,000\,000$），其含义如上所述。

输出格式

输出的第一行也是唯一的一行必须包含蜗牛到达顶端所需的天数。

样例

输入样例 1

2 1 5

输出样例 1

输入样例 2

5 1 6

输出样例 2

输入样例 3

100 99 1000000000

输出样例 3

999999901

Discussions

About Discussions

The discussion section is only for posting: General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.

This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.

Open Discussions 0

No discussions in this category.

Issues

About Issues

If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.

Guidelines:

This is not a place to publish discussions, editorials, or requests to debug your code. Issues are only visible to you and problem moderators.
Do not submit duplicated issues.
Issues must be filed in English or Chinese only.

Active Issues 0

No issues in this category.

Closed/Resolved Issues 0