feat: solved 6064 카잉달력 & 최대 공약수 최소공배수 #124

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Open

flowjiyun wants to merge 1 commit into main from 95-2023113fri-바킹독-알고리즘-부수기-day37-1

Contributor

flowjiyun commented Feb 7, 2023

최대 공약수를 구하는 방법
유클리드 호제법
최소 공배수를 구하는 방법
a * b = gcd(a, b) * lcm(a, b)


          feat: solved 6064 카잉달력 & 최대 공약수 최소공배수

63377f0

flowjiyun linked an issue

that may be closed by this pull request

2023.1.13(FRI) 바킹독 알고리즘 부수기 (Day37) #95

Open

1 task

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet