Skip to content

Added Solution for Problem 3 in C++#10

Open
TheFirstMe wants to merge 2 commits intoMU-Enigma:masterfrom
TheFirstMe:master
Open

Added Solution for Problem 3 in C++#10
TheFirstMe wants to merge 2 commits intoMU-Enigma:masterfrom
TheFirstMe:master

Conversation

@TheFirstMe
Copy link
Copy Markdown

Solved #5

Copy link
Copy Markdown
Contributor

@IceCereal IceCereal left a comment

Choose a reason for hiding this comment

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

This is a good and standard answer. Check if you can try to implement it using the Sieve of Eratosthenes idea. You could also look at eliminating the non-neighbors of 6.

@IceCereal IceCereal assigned IceCereal and murtuzaal2 and unassigned IceCereal Oct 27, 2019
@IceCereal IceCereal requested a review from murtuzaal2 October 27, 2019 14:00
@TheFirstMe
Copy link
Copy Markdown
Author

@IceCereal Isn't the Sieve of Eratosthenes used for getting prime numbers in a given range?

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.

3 participants