We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 35e71f2 commit f2d9df7Copy full SHA for f2d9df7
C++/count-equal-and-divisible-pairs-in-an-array.cpp
@@ -1,4 +1,4 @@
1
-// Time: O(n * sqrt(k))
+// Time: O(nlogk + n * sqrt(k))
2
// Space: O(n + sqrt(k)), number of factors of k is at most sqrt(k)
3
4
// math, number theory
0 commit comments