coder-xiaomo/leetcode-problemset
1
0
Fork 0
mirror of https://gitee.com/coder-xiaomo/leetcode-problemset synced 2025-09-05 07:21:40 +08:00
Code Issues Projects Releases Wiki Activity GitHub Gitee

update

Browse Source
This commit is contained in:
小墨
2022-05-02 23:44:12 +08:00
parent 7ea03594b3
commit 2a71c78585
4790 changed files with 11696 additions and 10944 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
leetcode-cn/originData/number-of-different-subsequences-gcds.json
View File

@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"2.9K\", \"totalSubmission\": \"7.2K\", \"totalAcceptedRaw\": 2850, \"totalSubmissionRaw\": 7172, \"acRate\": \"39.7%\"}",
"stats": "{\"totalAccepted\": \"2.9K\", \"totalSubmission\": \"7.3K\", \"totalAcceptedRaw\": 2914, \"totalSubmissionRaw\": 7320, \"acRate\": \"39.8%\"}",
"hints": [
"Think of how to check if a number x is a gcd of a subsequence.",
"If there is such subsequence, then all of it will be divisible by x. Moreover, if you divide each number in the subsequence by x , then the gcd of the resulting numbers will be 1.",