Fix pre-commit hook: use git add data/ instead of glob pattern

Author: romankurnovskii

.husky/pre-commit

@@ -1,2 +1,2 @@
 npm run format:json
-git add 'data/**/*.json'
+git add data/

explanations/3179/en.md

@@ -7,7 +7,7 @@
 **1.1 Constraints & Complexity:**
 
 - **Input Size:** n and k are both between 1 and 1000. The values can grow very large, so we need modulo 10^9 + 7.
-- **Time Complexity:** O(n * k) - we iterate k times, and for each iteration, we process n-1 elements.
+- **Time Complexity:** O(n \* k) - we iterate k times, and for each iteration, we process n-1 elements.
 - **Space Complexity:** O(n) - we maintain an array of size n.
 - **Edge Case:** When k=0, the array remains [1,1,...,1], so the result is 1.
 
@@ -17,7 +17,7 @@ The goal is to apply prefix sum operation k times. Each second, we compute the p
 
 **1.3 Brute force vs. optimized strategy:**
 
-- **Brute Force:** Simulate k seconds by computing prefix sums k times. This is O(n * k) time and O(n) space.
+- **Brute Force:** Simulate k seconds by computing prefix sums k times. This is O(n \* k) time and O(n) space.
 - **Optimized Strategy:** The same approach is already optimal. We can't avoid computing each prefix sum operation.
 - **Optimization:** Using modulo arithmetic ensures we don't overflow, and the direct simulation is the most straightforward approach.
 
@@ -42,14 +42,14 @@ We apply prefix sum k=5 times.
 
 **2.3 Trace Walkthrough:**
 
-| Second | Array State | Action |
-|--------|-------------|--------|
-| 0 | [1, 1, 1, 1] | Initial state |
-| 1 | [1, 2, 3, 4] | Prefix sum: arr[1]=1+1=2, arr[2]=1+2=3, arr[3]=1+2+3=4 |
-| 2 | [1, 3, 6, 10] | Prefix sum: arr[1]=1+2=3, arr[2]=1+3+2=6, arr[3]=1+3+6=10 |
-| 3 | [1, 4, 10, 20] | Prefix sum: arr[1]=1+3=4, arr[2]=1+4+3=10, arr[3]=1+4+10=20 |
-| 4 | [1, 5, 15, 35] | Prefix sum: arr[1]=1+4=5, arr[2]=1+5+4=15, arr[3]=1+5+15=35 |
-| 5 | [1, 6, 21, 56] | Prefix sum: arr[1]=1+5=6, arr[2]=1+6+5=21, arr[3]=1+6+21=56 |
+| Second | Array State    | Action                                                      |
+| ------ | -------------- | ----------------------------------------------------------- |
+| 0      | [1, 1, 1, 1]   | Initial state                                               |
+| 1      | [1, 2, 3, 4]   | Prefix sum: arr[1]=1+1=2, arr[2]=1+2=3, arr[3]=1+2+3=4      |
+| 2      | [1, 3, 6, 10]  | Prefix sum: arr[1]=1+2=3, arr[2]=1+3+2=6, arr[3]=1+3+6=10   |
+| 3      | [1, 4, 10, 20] | Prefix sum: arr[1]=1+3=4, arr[2]=1+4+3=10, arr[3]=1+4+10=20 |
+| 4      | [1, 5, 15, 35] | Prefix sum: arr[1]=1+4=5, arr[2]=1+5+4=15, arr[3]=1+5+15=35 |
+| 5      | [1, 6, 21, 56] | Prefix sum: arr[1]=1+5=6, arr[2]=1+6+5=21, arr[3]=1+6+21=56 |
 
 **2.4 Increment and Loop:**
 
@@ -58,4 +58,3 @@ After k iterations, we have the final array state.
 **2.5 Return Result:**
 
 The value at index n-1 (index 3) after k=5 seconds is 56, which matches the example output.
-