Dec 9, 2024 · Dec 9, 2024
diff --git a/README.md b/README.md
 - [3082. 求出所有子序列的能量和 ](./problems/3082.find-the-sum-of-the-power-of-all-subsequences.md)
 - [3108. 带权图里旅途的最小代价](./problems/3108.minimum-cost-walk-in-weighted-graph.md)
 - [3347. 执行操作后元素的最高频率 II](./problems/3347.maximum-frequency-of-an-element-after-performing-operations-ii.md)
 - [3336. 最大公约数相等的子序列数量](./problems/3336.find-the-number-of-subsequences-with-equal-gcd.md)

 ## :trident: &nbsp;anki 卡片

diff --git a/SUMMARY.md b/SUMMARY.md
  - [3082. 求出所有子序列的能量和 ](./problems/3082.find-the-sum-of-the-power-of-all-subsequences.md)
  - [3108. 带权图里旅途的最小代价](./problems/3108.minimum-cost-walk-in-weighted-graph.md)
  - [3347. 执行操作后元素的最高频率 II](./problems/3347.maximum-frequency-of-an-element-after-performing-operations-ii.md)
  - [3336. 最大公约数相等的子序列数量](./problems/3336.find-the-number-of-subsequences-with-equal-gcd.md)

 - [后序](epilogue.md)
Original file line number	Diff line number	Diff line change
Expand Up		@@ -572,6 +572,7 @@ leetcode 题解，记录自己的 leetcode 解题之路。
		- [3082. 求出所有子序列的能量和 ](./problems/3082.find-the-sum-of-the-power-of-all-subsequences.md)
		- [3108. 带权图里旅途的最小代价](./problems/3108.minimum-cost-walk-in-weighted-graph.md)
		- [3347. 执行操作后元素的最高频率 II](./problems/3347.maximum-frequency-of-an-element-after-performing-operations-ii.md)
		- [3336. 最大公约数相等的子序列数量](./problems/3336.find-the-number-of-subsequences-with-equal-gcd.md)

		## :trident:  anki 卡片

Expand Down
Original file line number	Diff line number	Diff line change
Expand Up		@@ -378,5 +378,6 @@
		- [3082. 求出所有子序列的能量和 ](./problems/3082.find-the-sum-of-the-power-of-all-subsequences.md)
		- [3108. 带权图里旅途的最小代价](./problems/3108.minimum-cost-walk-in-weighted-graph.md)
		- [3347. 执行操作后元素的最高频率 II](./problems/3347.maximum-frequency-of-an-element-after-performing-operations-ii.md)
		- [3336. 最大公约数相等的子序列数量](./problems/3336.find-the-number-of-subsequences-with-equal-gcd.md)

		- [后序](epilogue.md)