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.

Sign up for GitHub

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

Jump to bottom

Very extended Euclidean algorithm things #3

Open
ecnerwala opened this issue Jan 6, 2019 · 0 comments
Open

Very extended Euclidean algorithm things #3

ecnerwala opened this issue Jan 6, 2019 · 0 comments

Comments

@ecnerwala
Copy link
Owner

We should put NT things into the book with fancier Euclidean stuff. For instance, count(A * x + B * y <= C) for x >= 0, y >= 0. Code for that problem is https://codeforces.com/contest/1098/submission/48011091

We should also build some understanding of how to build these things.
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
None yet
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@ecnerwala