Update Readme.md

wisdompeak · web-flow · commit 6b87c3799e20 · 2021-08-29T11:20:41.000-07:00
diff --git a/Dynamic_Programming/1986.Minimum-Number-of-Work-Sessions-to-Finish-the-Tasks/Readme.md b/Dynamic_Programming/1986.Minimum-Number-of-Work-Sessions-to-Finish-the-Tasks/Readme.md
@@ -5,7 +5,7 @@
 &#25105;&#20204;&#29992;&#38271;&#24230;&#20026;14&#30340;&#20108;&#36827;&#21046;&#25968;state&#30340;&#27599;&#20010;bit&#20301;&#34920;&#31034;&#35813;&#20219;&#21153;&#26159;&#21542;&#34987;&#23454;&#26045;&#65292;&#37027;&#20040;dp[state]&#34920;&#31034;state&#25152;&#20195;&#34920;&#30340;&#20219;&#21153;&#38598;&#21512;&#38656;&#35201;&#26368;&#23569;&#22810;&#23569;&#20010;session&#12290;
 
 &#21033;&#29992;&#26522;&#20030;&#23376;&#38598;&#30340;&#27169;&#26495;&#65306;
-```
+```cpp
   for (int state=1; state<(1<<n); state++)  
       for (int subset=state; subset>0; subset=(subset-1)&state)
       {

Original file line number	Diff line number	Diff line change
`@@ -5,7 +5,7 @@`
`5`	`5`	`我们用长度为14的二进制数state的每个bit位表示该任务是否被实施，那么dp[state]表示state所代表的任务集合需要最少多少个session。`
`6`	`6`
`7`	`7`	`利用枚举子集的模板：`
`8`		-```
	`8`	+```cpp
`9`	`9`	`for (int state=1; state<(1<<n); state++)`
`10`	`10`	`for (int subset=state; subset>0; subset=(subset-1)&state)`
`11`	`11`	`{`