coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 23:41: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/smallest-value-after-replacing-with-sum-of-prime-factors.json
View File

@@ -149,7 +149,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"19.4K\", \"totalSubmission\": \"40.5K\", \"totalAcceptedRaw\": 19402, \"totalSubmissionRaw\": 40522, \"acRate\": \"47.9%\"}",
"stats": "{\"totalAccepted\": \"19.4K\", \"totalSubmission\": \"40.5K\", \"totalAcceptedRaw\": 19408, \"totalSubmissionRaw\": 40530, \"acRate\": \"47.9%\"}",
"hints": [
"Every time you replace n, it will become smaller until it is a prime number, where it will keep the same value each time you replace it.",
"n decreases logarithmically, allowing you to simulate the process.",