coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-06 16:01:41 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2023-12-09 19:57:46 +08:00
parent 9bc4722a45
commit 3770b44d1e
4792 changed files with 10889 additions and 10886 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
leetcode/originData/maximum-element-sum-of-a-complete-subset-of-indices.json
View File

@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"6.5K\", \"totalSubmission\": \"15.1K\", \"totalAcceptedRaw\": 6493, \"totalSubmissionRaw\": 15086, \"acRate\": \"43.0%\"}",
"stats": "{\"totalAccepted\": \"6.5K\", \"totalSubmission\": \"15.1K\", \"totalAcceptedRaw\": 6533, \"totalSubmissionRaw\": 15130, \"acRate\": \"43.2%\"}",
"hints": [
"Let <code>P(x)</code> be the product of all prime numbers <code>p</code> such that <code>p</code> divides <code>x</code>, and there exists an <strong>odd</strong> <code>k</code> such that <code>p^k</code> divides <code>x</code> but <code>p^(k+1)</code> does not.",
"If <code>P(nums[i]) = P(nums[j])</code>, <code>nums[i]</code> and <code>nums[j]</code> can be grouped together.",