Submission details
Task:Dice Combinations
Sender:Giaco
Submission time:2025-09-18 01:56:59 +0300
Language:Rust (2021)
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.05 sdetails
#18ACCEPTED0.00 sdetails
#19ACCEPTED0.05 sdetails
#20ACCEPTED0.00 sdetails

Compiler report

warning: unused import: `max`
 --> input/code.rs:1:16
  |
1 | use std::cmp::{max, min};
  |                ^^^
  |
  = note: `#[warn(unused_imports)]` on by default

warning: unused imports: `HashMap`, `HashSet`
 --> input/code.rs:2:24
  |
2 | use std::collections::{HashMap, HashSet};
  |                        ^^^^^^^  ^^^^^^^

warning: variable `DP` should have a snake case name
  --> input/code.rs:33:13
   |
33 |     let mut DP = vec![0_usize; n+1];
   |             ^^ help: convert the identifier to snake case: `dp`
   |
   = note: `#[warn(non_snake_case)]` on by default

warning: 3 warnings emitted

Code

use std::cmp::{max, min};
use std::collections::{HashMap, HashSet};
use std::io::{self, Read};

macro_rules! input {
    ($it: expr) => {
        $it.next().unwrap().parse().unwrap()
    };
    ($it: expr, $T: ty) => {
        $it.next().unwrap().parse::<$T>().unwrap()
    };
}
/*
mod classes;
mod homework;

fn main() {
    // println!("{}", "-".repeat(20));
    // classes::c06::task1();
    homework::hw2::task1();
    // println!("{}", "-".repeat(20));
}
// */

fn main() {
    let mut buf = String::new();
    io::stdin().read_to_string(&mut buf).unwrap();

    let mut it = buf.split_whitespace();

    let n: usize = input!(it);

    let mut DP = vec![0_usize; n+1];
    DP[1]=1;
    DP[0]=1;
    let mut k=2;
    while k<=n {
        for i in 1..=min(k, 6) {
            DP[k]= (DP[k] + DP[k-i]) % (10_usize.pow(9)+7);
        }
        k+=1;

    }
    println!("{}", DP[n]);
}


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