Skip to content
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.

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

Added Euclidean Algorithm and it's Application. #86

Open
wants to merge 2 commits into
base: main
Choose a base branch
from

Conversation

AmanAgarwal0702
Copy link
Contributor

Hi , I have added the famous Euclidean Algorithm to find GCD of numbers and also showed it's application by solving a CodeForces Division 2 (Round 81) Problem number D (Same GCDs) . Please Merge my PR under Hacktoberfest2021 tag , It'll be of huge help :)

Hi , I have added the famous Euclidean Algorithm to find GCD of numbers and also showed it's application by solving a CodeForces Division 2 (Round 81) Problem number D (Same GCDs) . Please Merge my PR under Hacktoberfest2021 tag , It'll be of huge help :)
Copy link
Owner

@khagapati-bagh khagapati-bagh left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Hi @Daredevil1343, Thank you for your contributions. Your code is fine, just check my comment.

"Elements" (circa 300 BC), but it is possible
that the algorithm has even earlier origins.

I used the same concept to solve CodeForces Round 81 D. Same GCDs
Copy link
Owner

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Please add the question link here, so that developers can check directly.

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.

2 participants