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/count-array-pairs-divisible-by-k.json
View File

@@ -155,7 +155,7 @@
"__typename": "CodeSnippetNode"
}
],
"stats": "{\"totalAccepted\": \"14.2K\", \"totalSubmission\": \"49.1K\", \"totalAcceptedRaw\": 14201, \"totalSubmissionRaw\": 49117, \"acRate\": \"28.9%\"}",
"stats": "{\"totalAccepted\": \"14.2K\", \"totalSubmission\": \"49.1K\", \"totalAcceptedRaw\": 14219, \"totalSubmissionRaw\": 49143, \"acRate\": \"28.9%\"}",
"hints": [
"For any element in the array, what is the smallest number it should be multiplied with such that the product is divisible by k?",
"The smallest number which should be multiplied with nums[i] so that the product is divisible by k is k / gcd(k, nums[i]). Now think about how you can store and update the count of such numbers present in the array efficiently."