QOJ.ac

QOJ

実行時間制限: 1.0 s メモリ制限: 256 MB 満点: 100 ハック可能 ✓

#12410. 煎薄饼!

統計

在中国,有一个关于煎饼的著名问题:你有一个平底锅,每次可以同时煎 $K$ 个煎饼。每个煎饼都有正反两面需要煎,每一面都需要一小时才能煎熟。

那么,煎 3 个煎饼最少需要多长时间?答案是三小时: 在第一小时,煎 1 号煎饼的正面和 2 号煎饼的正面。 在第二小时,煎 2 号煎饼的反面和 3 号煎饼的正面。 在第三小时,煎 1 号煎饼的反面和 3 号煎饼的反面。

现在你有一个平底锅,每次可以同时煎 $K$ 个煎饼。煎 $N$ 个煎饼最少需要多少小时?

注意,你必须将煎饼的某一侧完全煎熟,这意味着你不能将煎饼的一侧煎到一半就拿出来。因此,答案总是整数。

输入格式

第一行包含两个整数 $N, K$。

$1 \le N, K \le 100$

输出格式

输出答案。

样例

输入格式 1

3 2

输出格式 1

3

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:

  1. This is not a place to publish discussions, editorials, or requests to debug your code. Issues are only visible to you and problem moderators.
  2. Do not submit duplicated issues.
  3. Issues must be filed in English or Chinese only.
Active Issues 0
No issues in this category.
Closed/Resolved Issues 0
No issues in this category.