#=
julia解欧拉计划005-求最小同时都能被1-20整除的数
https://projecteuler.net/problem=5
=#

function ff1()
#= -_-!! 无脑暴力
以下表达式使用这样一行python生成然后复制粘贴过来的:
'&&'.join(["x%"+str(r)+"==0" for r in range(2,21)])
=#
f(x)=x%2==0&&x%3==0&&x%4==0&&x%5==0&&x%6==0&&x%7==0&&x%8==0&&x%9==0&&x%10==0&&x%11==0&&x%12==0&&x%13==0&&x%14==0&&x%15==0&&x%16==0&&x%17==0&&x%18==0&&x%19==0&&x%20==0;
    for r in countfrom(2)
        if f(r)
            println(r)
        break
        end
    end
end
@time ff1()
#=
232792560
  5.726657 seconds (232.85 M allocations: 3.472 GB, 2.59% gc time)
[Finished in 9.6s]
=#
复制代码

#julia 一行流
@time @show (2^4*3^2)*(*(primes(4,20)...))
复制代码

*./>:i.20
复制代码

"""
python
"""
from itertools import count
def ff1():
    #无脑暴力
    # ' and '.join(["x%"+str(r)+"==0" for r in range(2,21)])
    f=(lambda x:x%2==0 and x%3==0 and x%4==0 and x%5==0 and x%6==0 and x%7==0 
and x%8==0 and x%9==0 and x%10==0 and x%11==0 and x%12==0 and x%13==0 
and x%14==0 and x%15==0 and x%16==0 and x%17==0 and x%18==0 and x%19==0 and x%20==0)

    for r in count(1):
        if f(r):
            print(r)
            break
ff1()
"""
232792560
[Finished in 76.5s]
"""
复制代码

# Python 继续吹蜡烛O(∩_∩)O~
N=int(input("请输入同时能被1-？整除："))
import math;pro=1;r=[1]*N
for i in range(2,int(N**0.5)+1):
	if r[i-1]==0:
		continue
	else:
		for j in range(i,N//i+1):
			r[i*j-1]=0
for i in range(2,N+1):
	if r[i-1]==1:
		pro=(i**int(math.log(N)/math.log(i)))*pro
print("顷刻即出：",int(pro))
复制代码