O(√n)

return all divisors of the number "n" in time complexity O(√n)

Author: Tanmay-901

divisors

@@ -0,0 +1,15 @@
+from math import *
+
+
+def divisors(n):
+    div = set()
+    for i in range(1,int(sqrt(n))+1):
+        if n%i == 0:
+            div.add(i)
+            div.add(n//i)
+    return list(div)
+
+
+for _ in range(int(input())):
+    n = int(input())
+    print(*divisors(n))