原题链接：
A. Coins
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
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 n and S (1≤n≤100000, 1≤S≤109)
Output
Print exactly one integer — the minimum number of coins required to obtain sum S.
Examples
input
5 11
output
3
input
6 16
output
3
Note
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.
题意：
有n种无限的货币，金额从1-n，现在要求用最少的货币数组合出值m，输出最小需要货币数。
题解：
一道水题，直接用最大的面值去计算，不够再补一张小的。
若m%n==0，直接输出m/n，若m%n！=0，输出m/n+1；
附上AC代码：
#include <iostream>
#include <cstdio>
using namespace std;
int main()
{
int n,s,ans;
scanf("%d%d",&n,&s);
ans=s/n;
if(s%n!=0)
ans++;
printf("%d",ans);
return 0;
}
欢迎评论！