Kolikot

#include <bits/stdc++.h>
#define ll long long
#define INF 999999999
#define N (1<<17)
#define M 1000000007

using namespace std;

ll dp[500001];

int main () {
  int n, x;
  cin>>n>>x;
  vector<int> v(n);
  for (int i = 0; i < n; i++) cin>>v[i];
  dp[0] = 1;
  for (int c = 0; c < n; c++) {
    for (int i = v[c]; i <= x; i++) {
      dp[i] = (dp[i] + dp[i - v[c]]) % M;
    }
  }
  cout<<dp[x]<<endl;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED