hackerrank# The Coin change problem

Original title Address

Knapsack problem, nothing to say, remember to use a long long, otherwise it will explode

Code:

1#include <cmath>2#include <cstdio>3#include <vector>4#include <iostream>5#include <algorithm>6#include <cstring>7 using namespacestd;8 9 #defineMax_n 256Ten #defineMax_m 64 One  A Long LongF[max_n]; - intC[max_m]; - intm, N; the  - intMain () { -     /*Enter your code here. Read input from STDIN. Print output to STDOUT*/    -CIN >> N >>m; +      for(inti =0; I < m; i++) -CIN >>C[i]; +  AMemset (F,0,sizeof(f)); atf[0] =1; -      for(inti = m-1; I >=0; i--) -          for(intj =1; J <= N; J + +) -             if(J >=C[i]) -F[J] + = f[j-C[i]]; -  incout << F[n] <<Endl; -     return 0; to}

hackerrank# The Coin change problem