Added Euclidean Algorithm and it's Application.#86
Open
AmanAgarwal0702 wants to merge 2 commits into
Open
Conversation
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 :)
Owner
khagapati-bagh
left a comment
khagapati-bagh
left a comment
There was a problem hiding this comment.
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 |
Owner
There was a problem hiding this comment.
Please add the question link here, so that developers can check directly.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
2 participants
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
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 :)