A. Petya and Origami

最新推荐文章于 2024-12-12 19:33:59 发布

市井烟火气

最新推荐文章于 2024-12-12 19:33:59 发布

阅读量297

点赞数

分类专栏： C F 水题

本文链接：https://blog.youkuaiyun.com/zhaobaole2018/article/details/86005239

版权

C F 水题专栏收录该内容

35 篇文章

订阅专栏

本文介绍了一个数学问题的解决方法，该问题涉及如何计算为了制作特定数量的邀请函，需要购买的最少笔记本数量。每个邀请函需要不同颜色的纸张，而每本笔记本包含固定数量的单一颜色纸张。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Petya is having a party soon, and he has decided to invite his nn friends.

He wants to make invitations in the form of origami. For each invitation, he needs two red sheets, five green sheets, and eight blue sheets. The store sells an infinite number of notebooks of each color, but each notebook consists of only one color with kk sheets. That is, each notebook contains kk sheets of either red, green, or blue.

Find the minimum number of notebooks that Petya needs to buy to invite all nn of his friends.

Input
The first line contains two integers nn and kk (1≤n,k≤1081≤n,k≤108) — the number of Petya’s friends and the number of sheets in each notebook respectively.

Output
Print one number — the minimum number of notebooks that Petya needs to buy.

Examples
inputCopy
3 5
outputCopy
10
inputCopy
15 6
outputCopy
38
Note
In the first example, we need 2 red notebooks, 3 green notebooks, and 5 blue notebooks.

In the second example, we need 5 red notebooks, 13 green notebooks, and 20 blue notebooks.

#include <iostream>
using namespace std;

int main()
{
    int n, m;
    while(cin >> n >> m)
    {
        int sum = 0;
        sum += (2 * n / m) + (2 * n % m > 0 ? 1 : 0);
        sum += (5 * n / m) + (5 * n % m > 0 ? 1 : 0);
        sum += (8 * n / m) + (8 * n % m > 0 ? 1 : 0);
        cout << sum << '\n';
    }
    return 0;
}