CSES - Aalto Competitive Programming 2024 - wk3 - Homework - Results
Submission details
Task:Dice Combinations
Sender:hungdojan
Submission time:2024-09-13 18:11:49 +0300
Language:C++ (C++11)
Status:READY
Result:ACCEPTED
Test results
testverdicttime
#1ACCEPTED0.00 sdetails
#2ACCEPTED0.00 sdetails
#3ACCEPTED0.00 sdetails
#4ACCEPTED0.00 sdetails
#5ACCEPTED0.00 sdetails
#6ACCEPTED0.00 sdetails
#7ACCEPTED0.00 sdetails
#8ACCEPTED0.00 sdetails
#9ACCEPTED0.00 sdetails
#10ACCEPTED0.00 sdetails
#11ACCEPTED0.00 sdetails
#12ACCEPTED0.00 sdetails
#13ACCEPTED0.01 sdetails
#14ACCEPTED0.03 sdetails
#15ACCEPTED0.04 sdetails
#16ACCEPTED0.04 sdetails
#17ACCEPTED0.04 sdetails
#18ACCEPTED0.00 sdetails
#19ACCEPTED0.04 sdetails
#20ACCEPTED0.00 sdetails

Code

#include <bits/stdc++.h>
using namespace std;
#define N 10000000
#define MOD 1000000007

typedef long long ll;

ll arr[N] = {
    0,
};

int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);

  int n;
  cin >> n;

  for (int i = 1; i <= n; i++) {
    if (i <= 6) {
      arr[i] += 1;
    }

    arr[i] += arr[i - 1];
    if (i - 2 >= 1) {
      arr[i] += arr[i - 2];
      arr[i] %= MOD;
    }
    if (i - 3 >= 1) {
      arr[i] += arr[i - 3];
      arr[i] %= MOD;
    }
    if (i - 4 >= 1) {
      arr[i] += arr[i - 4];
      arr[i] %= MOD;
    }
    if (i - 5 >= 1) {
      arr[i] += arr[i - 5];
      arr[i] %= MOD;
    }
    if (i - 6 >= 1) {
      arr[i] += arr[i - 6];
      arr[i] %= MOD;
    }
  }

  cout << arr[n] << endl;
  return 0;
}

Test details

Test 1

Verdict: ACCEPTED

input
1

correct output
1

user output
1

Test 2

Verdict: ACCEPTED

input
2

correct output
2

user output
2

Test 3

Verdict: ACCEPTED

input
3

correct output
4

user output
4

Test 4

Verdict: ACCEPTED

input
4

correct output
8

user output
8

Test 5

Verdict: ACCEPTED

input
5

correct output
16

user output
16

Test 6

Verdict: ACCEPTED

input
6

correct output
32

user output
32

Test 7

Verdict: ACCEPTED

input
7

correct output
63

user output
63

Test 8

Verdict: ACCEPTED

input
8

correct output
125

user output
125

Test 9

Verdict: ACCEPTED

input
9

correct output
248

user output
248

Test 10

Verdict: ACCEPTED

input
10

correct output
492

user output
492

Test 11

Verdict: ACCEPTED

input
50

correct output
660641036

user output
660641036

Test 12

Verdict: ACCEPTED

input
1000

correct output
937196411

user output
937196411

Test 13

Verdict: ACCEPTED

input
123456

correct output
113810539

user output
113810539

Test 14

Verdict: ACCEPTED

input
654321

correct output
615247550

user output
615247550

Test 15

Verdict: ACCEPTED

input
999998

correct output
39372206

user output
39372206

Test 16

Verdict: ACCEPTED

input
999999

correct output
511319454

user output
511319454

Test 17

Verdict: ACCEPTED

input
1000000

correct output
874273980

user output
874273980

Test 18

Verdict: ACCEPTED

input
1001

correct output
94201505

user output
94201505

Test 19

Verdict: ACCEPTED

input
999997

correct output
74225807

user output
74225807

Test 20

Verdict: ACCEPTED

input
40

correct output
567401756

user output
567401756