chore: day11 easy

OPCODE-Open-Spring-Fest · Apr 11, 2024 · bf4bd1d · bf4bd1d
1 parent f2d8876
commit bf4bd1d
Show file tree

Hide file tree

Showing 3 changed files with 16 additions and 0 deletions.
diff --git a/Easy/Day11/Problem.txt b/Easy/Day11/Problem.txt
@@ -0,0 +1,10 @@
+Let's imagine you're playing a game where you roll a regular six-sided die (with numbers 1 to 6 on its faces).
+You want to find out how many different ways you can roll the dice to get a specific total score,  n.
+For example, if  n  is 10, you could roll a 3, 3, and 4, or a 1, 4, 1, and 4, and so on.
+This task asks you to count the total number of winning roll combinations that add up to exactly  n.
+
+Constraints
+
+1 <= n <= 10^18;
+
+Print the number of ways modulo 10^9+7.
diff --git a/Easy/Day11/Sample.txt b/Easy/Day11/Sample.txt
@@ -0,0 +1,5 @@
+Input:
+8
+
+Output:
+125
diff --git a/Easy/Day11/Solution.cpp b/Easy/Day11/Solution.cpp
@@ -0,0 +1 @@
+// Write Your Code Here