Codeforces Round #524 (Div. 2) A. Petya and Origami

最新推荐文章于 2024-07-08 02:24:29 发布

原创最新推荐文章于 2024-07-08 02:24:29 发布 · 371 阅读

0 ·

CC 4.0 BY-SA版权

比赛题解专栏收录该内容

223 篇文章

订阅专栏

本文探讨了如何通过算法优化解决派对邀请制作的问题，利用最少的笔记本数量来准备不同颜色的纸张，以满足邀请函的需求。文章通过具体例子展示了算法的实现过程，包括输入参数、计算逻辑和输出结果。

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

A. Petya and Origami

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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

input

Copy

3 5

output

Copy

input

Copy

15 6

output

Copy

Note

In the first example, we need 22 red notebooks, 33 green notebooks, and 55 blue notebooks.

In the second example, we need 55 red notebooks, 1313 green notebooks, and 2020 blue notebooks.

#include<cstdio>
#include<iostream>
#include<fstream>
#include<algorithm>
#include<functional>
#include<cstring>
#include<string>
#include<cstdlib>
#include<iomanip>
#include<numeric>
#include<cctype>
#include<cmath>
#include<ctime>
#include<queue>
#include<stack>
#include<list>
#include<set>
#include<map>
using namespace std;
#define N 100000+5
#define rep(i,n) for(int i=0;i<n;i++)
#define sd(n) scanf("%d",&n)
#define sll(n) scanf("%I64d",&n)
#define pd(n) scanf("%d\n",n)
#define pll(n) scanf("%I64d\n",n)
#define MAX 26
typedef long long ll;
const ll mod=1e9+7;
ll n,m;
ll a[N];
//ll b[N];
int main()
{
	 //string s;
	 //cin>>s;
	 ll ans=0;
	 //ll sum=0;
	 scanf("%I64d",&n);
	 scanf("%I64d",&m);
	 a[1]=n*2;
	 a[2]=n*5;
	 a[3]=n*8;
	
	for(int i=1;i<=3;i++)
	{
		int k=a[i]/m;
	    if(k*m<a[i])
	    	k++;
	    	//cout<<k<<endl;
		ans+=k;
	}
	//for(int i=1;i<=n;i++)
	//	printf("%I64d",a[i]);
		
	printf("%I64d\n",ans);
    return 0;
}