| Task: | Dice Combinations |
| Sender: | rikachu |
| Submission time: | 2025-09-11 15:36:34 +0300 |
| Language: | C++ (C++11) |
| Status: | READY |
| Result: | ACCEPTED |
| test | verdict | time | |
|---|---|---|---|
| #1 | ACCEPTED | 0.00 s | details |
| #2 | ACCEPTED | 0.00 s | details |
| #3 | ACCEPTED | 0.00 s | details |
| #4 | ACCEPTED | 0.00 s | details |
| #5 | ACCEPTED | 0.00 s | details |
| #6 | ACCEPTED | 0.01 s | details |
| #7 | ACCEPTED | 0.00 s | details |
| #8 | ACCEPTED | 0.01 s | details |
| #9 | ACCEPTED | 0.00 s | details |
| #10 | ACCEPTED | 0.00 s | details |
| #11 | ACCEPTED | 0.00 s | details |
| #12 | ACCEPTED | 0.00 s | details |
| #13 | ACCEPTED | 0.01 s | details |
| #14 | ACCEPTED | 0.03 s | details |
| #15 | ACCEPTED | 0.04 s | details |
| #16 | ACCEPTED | 0.04 s | details |
| #17 | ACCEPTED | 0.04 s | details |
| #18 | ACCEPTED | 0.00 s | details |
| #19 | ACCEPTED | 0.04 s | details |
| #20 | ACCEPTED | 0.00 s | details |
Code
#define F first
#define S second
#define PB push_back
#define MP make_pair
#define REP(i, a, b) for (int i = a; i < b; ++i)
#define REPI(i, a, b) for (int i = a; i <= b; ++i)
#define BR "\n"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef pair<int, int> pi;
int main() {
int n;
cin >> n;
int m = pow(10, 9) + 7;
vi dice = {1, 2, 3, 4, 5, 6};
int count[n + 1] = {1};
REPI(i, 1, n) {
for (auto d : dice) {
if (i - d >= 0) {
count[i] += count[i - d];
count[i] %= m;
}
}
}
cout << count[n] << BR;
return EXIT_SUCCESS;
}
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 |
