# 13631 - Nugget Frenzy
>author: Utin
###### tags: `combination`

---

## Brief
See the code below

## Solution 0

#include <stdio.h>

int n, k, ans = 0;
int arr[20];

void f(int index, int last, int index_delta);

int main() {
    scanf("%d %d", &n, &k);
    for(int i = 0; i < k; i++) {
        scanf("%d", &arr[i]);
    }
    for(int i = 0; i < k; i++) {
        f(0 + arr[i], n - arr[i], i);
    }
    printf("%d\n", ans);
}

void f(int index, int last, int index_delta) {
    if(last < 0) return;
    else if(last == 0) ans += 1;
    else {
        for(int i = index_delta; i < k; i++) {
            f(index + arr[i], last - arr[i], i);
        }
    }
}
// By Utin

## Reference