CSES - Aalto Competitive Programming 2024 - wk12 - Wed - Results
Submission details
Task:Dice Summation
Sender:Nallue
Submission time:2024-11-27 16:49:28 +0200
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.02 sdetails
#14ACCEPTED0.08 sdetails
#15ACCEPTED0.12 sdetails
#16ACCEPTED0.12 sdetails
#17ACCEPTED0.12 sdetails
#18ACCEPTED0.00 sdetails
#19ACCEPTED0.12 sdetails
#20ACCEPTED0.00 sdetails

Compiler report

input/code.cpp: In function 'int comb_rec_prog(int)':
input/code.cpp:13:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   13 |     for(int i=0; i<sol.size(); i++){
      |                  ~^~~~~~~~~~~

Code

#include <iostream>
#include <vector>
 
using namespace std;
 
long int m=1000000007;
 
int comb_rec_prog(int n){
    vector<long int> sol(n+1,-1);
 
    sol[0] = 1;
 
    for(int i=0; i<sol.size(); i++){
        if(sol[i]==-1){
            sol[i]=0;
            for(int d=1; d<=6; d++){
                if((i-d) >= 0){
                    
                    sol[i] = (sol[i]+sol[i-d]) % m;
                }
            }
        }
    }
    return sol[n];
 
}
 
int main(){
    int n;
    cin >> n;
 
    cout << comb_rec_prog(n) <<endl;
 
 
}

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