From df4859179a888080e98586fd701128ab0f385674 Mon Sep 17 00:00:00 2001
From: Zengtudor <zengtudor@outlook.com>
Date: Thu, 17 Oct 2024 21:38:18 +0800
Subject: [PATCH] update

---
 src/oj8782/oj8782.cpp | 2 ++
 1 file changed, 2 insertions(+)

diff --git a/src/oj8782/oj8782.cpp b/src/oj8782/oj8782.cpp
index 9748d95..2645e33 100644
--- a/src/oj8782/oj8782.cpp
+++ b/src/oj8782/oj8782.cpp
@@ -1,6 +1,7 @@
 #include <bits/stdc++.h>
 using namespace std;
 /*
+
 区间动态规划解题步骤：
     1.根据问题推测dp[i][j]的含义
         问题：长度为N的数字串，要求选手使用K个乘号将它分成K+1个部分
@@ -12,6 +13,7 @@ using namespace std;
 
     3.边界问题（比如设定dp[0][0],dp[0][j],dp[i][0]初始值）
         num[i][j]   
+        
 */
 #define NV(v)#v<<" : "<<(v)
 using ll = long long;