How to solve for(M,N) it the equation of the form M*c1+c2=N*c3+c4, using Extended euclidean algo. Here c1,c2,c3,c4 are known constants.
→ Pay attention
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 4 | jiangly | 3583 |
| 5 | turmax | 3559 |
| 6 | tourist | 3541 |
| 7 | strapple | 3515 |
| 8 | ksun48 | 3461 |
| 9 | dXqwq | 3436 |
| 10 | Otomachi_Una | 3413 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 157 |
| 2 | adamant | 153 |
| 3 | Um_nik | 147 |
| 3 | Proof_by_QED | 147 |
| 5 | Dominater069 | 145 |
| 6 | errorgorn | 142 |
| 7 | cry | 139 |
| 8 | YuukiS | 135 |
| 9 | TheScrasse | 134 |
| 10 | chromate00 | 133 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2026 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Apr/17/2026 15:31:16 (g2).
Desktop version, switch to mobile version.
Supported by
Convert to c1M + c3( - N) = c4 - c2. This is now in the form ax + by = c, solving for x, y, which can be done using Extended Euclidean algorithm.
Thanks, can you please share a useful link? :)
Got it, it is a Diophantine equation, Thanks again :)
I bet it is for yesterday's contest ;)
See tags for the question
I didn't see it :)