A12091 | Coins
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
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$ ?
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
In the first example, some of the possible ways to get sum $11$ with $3$ coins are:
- $(3, 4, 4)$
- $(2, 4, 5)$
- $(1, 5, 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)$
- $(4, 6, 6)$
It is impossible to get sum $16$ with less than $3$ coins.
- $(3, 4, 4)$
- $(2, 4, 5)$
- $(1, 5, 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)$
- $(4, 6, 6)$
It is impossible to get sum $16$ with less than $3$ coins.
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted