Skip to content

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

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

Hidden character warning

The head ref may contain hidden characters: "95-2023113fri-\ubc14\ud0b9\ub3c5-\uc54c\uace0\ub9ac\uc998-\ubd80\uc218\uae30-day37-1"
Open

feat: solved 6064 카잉달력 & 최대 공약수 최소공배수#124
flowjiyun wants to merge 1 commit intomainfrom
95-2023113fri-바킹독-알고리즘-부수기-day37-1

Conversation

@flowjiyun
Copy link
Contributor

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

@flowjiyun flowjiyun linked an issue Feb 7, 2023 that may be closed by this pull request
1 task
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment

Labels

None yet

Projects

None yet

Development

Successfully merging this pull request may close these issues.

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

1 participant