"""Problem:2520 is the smallest number that can be divided by each of the numbers from 1to 10 without any remainder.What is the smallest positive number that is evenly divisible(divisible with noremainder) by all of the numbers from 1 to N?"""""" Euclidean GCD Algorithm """def gcd(x, y):return x if y == 0 else gcd(y, x % y)""" Using the property lcm*gcd of two numbers = product of them """def lcm(x, y):return (x * y) // gcd(x, y)def solution(n):"""Returns the smallest positive number that is evenly divisible(divisiblewith no remainder) by all of the numbers from 1 to n.>>> solution(10)2520>>> solution(15)360360>>> solution(20)232792560>>> solution(22)232792560"""g = 1for i in range(1, n + 1):g = lcm(g, i)return gif __name__ == "__main__":print(solution(int(input().strip())))
此处可能存在不合适展示的内容,页面不予展示。您可通过相关编辑功能自查并修改。
如您确认内容无涉及 不当用语 / 纯广告导流 / 暴力 / 低俗色情 / 侵权 / 盗版 / 虚假 / 无价值内容或违法国家有关法律法规的内容,可点击提交进行申诉,我们将尽快为您处理。