aboutsummaryrefslogtreecommitdiff
path: root/contests/Round889/B/main.py
diff options
context:
space:
mode:
authoromagdy7 <omar.professional8777@gmail.com>2023-07-29 23:46:41 +0300
committeromagdy7 <omar.professional8777@gmail.com>2023-07-29 23:46:41 +0300
commit14b6ca598cdb041b56822fae224134610b7bb345 (patch)
tree71ceda0b702059f1cf9e847672cab724ac3aa3b5 /contests/Round889/B/main.py
parent350518c931e4a9fa8445f47f4dadc019132a7b8a (diff)
downloadcompetitive-programming-14b6ca598cdb041b56822fae224134610b7bb345.tar.xz
competitive-programming-14b6ca598cdb041b56822fae224134610b7bb345.zip
Solved A from the last Div2
Diffstat (limited to 'contests/Round889/B/main.py')
-rw-r--r--contests/Round889/B/main.py23
1 files changed, 23 insertions, 0 deletions
diff --git a/contests/Round889/B/main.py b/contests/Round889/B/main.py
new file mode 100644
index 0000000..3a99f47
--- /dev/null
+++ b/contests/Round889/B/main.py
@@ -0,0 +1,23 @@
+def factorial(n):
+ ans = 1
+ for i in range(2, n + 1):
+ ans *= i
+ return ans
+
+def solve():
+ n = int(input())
+ v = []
+ for i in range(100):
+ v.append(factorial(i))
+ mx = 1
+ for i in range(1, len(v)):
+ for j in range(i + 1, len(v)):
+ if n % (v[j] // v[i - 1]) == 0:
+ print("-> ", j - i + 1)
+ mx = max(mx, j - i + 1)
+ print(mx)
+
+if __name__ == "__main__":
+ tt = int(input())
+ for _ in range(tt):
+ solve()