Dice Combinations

#include <bits/stdc++.h>

using namespace std;

int dies[] = {1, 2, 3, 4, 5, 6};

const int N = 1e6+1;
const int m = 1e9 + 7;
int ways[N];

int solve(int n) {
  ways[0] = 1;
  for (int k = 1; k <= n; k++) {
    for (auto d : dies) {
      if (k - d >= 0) {
        ways[k] += ways[k - d];
        ways[k] %= m;
      }
    }
  }
  return ways[n];
}

int main() {
  int n;
  cin >> n;

  int res = solve(n);
  cout << res << 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

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED

Test 16

Verdict: ACCEPTED

Test 17

Verdict: ACCEPTED

Test 18

Verdict: ACCEPTED

Test 19

Verdict: ACCEPTED

Test 20

Verdict: ACCEPTED