Dice Combinations

CSESDynamic ProgrammingOpen on judge ↗

Your task is to count the number of ways to construct sum n by throwing a dice one or more times. Each throw produces an outcome between 1 and 6. For example, if n=3, there are 4 ways: - 1+1+1 - 1+2 - 2+1 - 3 Input The only input line has an integer n. Output Print the number of ways modulo 10^9+7. Constraints - 1 \le n \le 10^6 Example Input: 3 Output: 4

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI