CodeForces 1061A 贪心水题

最新推荐文章于 2022-03-24 22:40:18 发布

csu_xiji

最新推荐文章于 2022-03-24 22:40:18 发布

阅读量271

点赞数

分类专栏：贪心

本文链接：https://blog.csdn.net/xiji333/article/details/86575099

版权

贪心专栏收录该内容

114 篇文章 0 订阅

订阅专栏

http://codeforces.com/problemset/problem/1061/A

You have unlimited number of coins with values 1,2,…,n.You want to select some set of coins having the total value of S .

It is allowed to have multiple coins with the same value in the set. What is the minimum number of coins required to get sum S ?

Input

The only line of the input contains two integers nn and S (1≤n≤100000, 1≤S≤10^9 )

Output

Print exactly one integer — the minimum number of coins required to obtain sum S .

Examples

Input

Copy

5 11

Output

Copy

Input

Copy

6 16

Output

Copy

Note

In the first example, some of the possible ways to get sum 11 with 3 coins are:

(3,4,4)(3,4,4)
(2,4,5)(2,4,5)
(1,5,5)(1,5,5)
(3,3,5)(3,3,5)

It is impossible to get sum 11 with less than 3 coins.

In the second example, some of the possible ways to get sum 16 with 3 coins are:

(5,5,6)(5,5,6)
(4,6,6)(4,6,6)

It is impossible to get sum 16 with less than 3 coins.

题目大意：你有无限个硬币，它们的价值分别为从1到n，给你一个数S，问凑够S的最小硬币数是多少。

思路：贪心。

#include<iostream>
#include<cstdio>
#include<cmath>
#include<set>
#include<algorithm>
#include<iterator>
#define INF 0x3f3f3f3f
using namespace std;

int main()
{
	int n,s;
	scanf("%d%d",&n,&s);
	if(s%n==0)
		printf("%d\n",s/n);
	else
		printf("%d\n",s/n+1);
	return 0;
}