search

Team-Kek / Notebook

Implementations of algorithms that might be useful in ICPC.
1 stars 0 forks source link

Euclid's algorithm #4

Open ZacharyForman opened 8 years ago

maxhwardg commented 8 years ago

Which one? Gcd is worth having, but there are better ways to get mod inverse than extended Euclid.

ZacharyForman commented 8 years ago

GCD specifically, but mod inverse is probably worth it too.

On Wed, Sep 7, 2016 at 10:19 PM, Max Ward notifications@github.com wrote:

Which one? Gcd is worth having, but there are better ways to get mod inverse than extended Euclid.

— You are receiving this because you authored the thread. Reply to this email directly, view it on GitHub https://github.com/Team-Kek/Notebook/issues/4#issuecomment-245270010, or mute the thread https://github.com/notifications/unsubscribe-auth/AD9UC0FgbfYu1VkehxDcNaU4c71Z9kvBks5qnrLhgaJpZM4Jw2at .