Ultraviolet A 357 Let Me Count The Ways (01 backpack)

There are five types of coins with a nominal value of 1, 5, 10, 25, and 50 respectively. Now, we provide the amount and ask how many methods can be used to make up the nominal value. Solution: it is the same as uva674, but the upper limit is different. Pay attention to the output.

# Include <stdio. h> # include <string. h> const int N = 30005; const int val [5] = {1, 5, 10, 25, 50}; long cnt [N]; void Init () {memset (cnt, 0, sizeof (cnt); cnt [0] = 1; for (int I = 0; I <5; I ++) {for (int j = val [I]; j <N; j ++) cnt [j] + = cnt [j-val [I] ;}} int main () {Init (); int n; while (scanf ("% d", & n) = 1) {if (cnt [n] <= 1) printf ("There is only 1 way to produce % d cents change. \ n ", n); else printf (" There are % lld ways to produce % d cents change. \ n ", cnt [n], n);} return 0 ;}