305599: CF1061A. Coins
Memory Limit:256 MB
Time Limit:2 S
Judge Style:Text Compare
Creator:
Submit:0
Solved:0
Description
Coins
题意翻译
给出 $n$ 和 $S$,求最小的 $m$,使存在 $\sum\limits_{i=1}^{m}a_i = S$,其中 $a_i$ 为 $[1,\ n]$ 中的整数。题目描述
You have unlimited number of coins with values $ 1, 2, \ldots, 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 $ ?输入输出格式
输入格式
The only line of the input contains two integers $ n $ and $ S $ ( $ 1 \le n \le 100\,000 $ , $ 1 \le S \le 10^9 $ )
输出格式
Print exactly one integer — the minimum number of coins required to obtain sum $ S $ .
输入输出样例
输入样例 #1
5 11
输出样例 #1
3
输入样例 #2
6 16
输出样例 #2
3