原題連結：
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;
}

歡迎評論！