[백준] [DP] 2293번 동전 1

#include <iostream>
#include <cstdio>
 
int coin_case[10001];
 
int main(void){
    
    int n, money;
    int coin[101];
 
    scanf("%d %d", &n, &money);
 
    for(int i = 1 ; i <= n ; i++)
        scanf("%d", &coin[i]);
 
    coin_case[0] = 1;
 
    for(int i = 1; i <= n ; i++){
        for(int j = 1 ; j <= money; j++){
            if( coin[i] <= j )
                coin_case[j] += coin_case[j - coin[i]];
        }
    }
 
    std::cout << coin_case[money] <<std::endl;
    return -1;
}