Update count-ways-to-make-array-with-product.py

kamyu104 · web-flow · commit 6f2b5022533a · 2023-06-03T04:26:08.000+08:00
diff --git a/Python/count-ways-to-make-array-with-product.py b/Python/count-ways-to-make-array-with-product.py
@@ -1,4 +1,4 @@
-# Time:  O(sqrt(m) + n + q * (logm + sqrt(m)/log(sqrt(m)))), m is max(k for _, k in queries)
+# Time:  O(sqrt(m) + n + q * (logm + pi(sqrt(m)))) = O(sqrt(m) + n + q * (logm + sqrt(m)/log(sqrt(m)))), m is max(k for _, k in queries), pi(n) = number of primes in a range [1, n] = O(n/logn) by prime number theorem, see https://en.wikipedia.org/wiki/Prime_number_theorem
 # Space: O(sqrt(m) + n + logm)
 
 import collections

Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-# Time: O(sqrt(m) + n + q * (logm + sqrt(m)/log(sqrt(m)))), m is max(k for _, k in queries)`
	`1`	`+# Time: O(sqrt(m) + n + q * (logm + pi(sqrt(m)))) = O(sqrt(m) + n + q * (logm + sqrt(m)/log(sqrt(m)))), m is max(k for _, k in queries), pi(n) = number of primes in a range [1, n] = O(n/logn) by prime number theorem, see https://en.wikipedia.org/wiki/Prime_number_theorem`
`2`	`2`	`# Space: O(sqrt(m) + n + logm)`
`3`	`3`
`4`	`4`	`import collections`