Hi Codeforces, I have a problem where the solution is to solve diofant equation with K unknowns and K > 2. For example one equation of this type is: a1 * x + a2 * y + a3 * z = n and I have to find one solution of x, y and z. It is guaranteed that the equation always have a solution. Are there any algorithm that solve this problem? I will be thankful for helping :)
→ Pay attention
Before contest
CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!)
20:05:13
Register now »
CodeTON Round 9 (Div. 1 + Div. 2, Rated, Prizes!)
20:05:13
Register now »
*has extra registration
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3823 |
| 3 | Benq | 3738 |
| 4 | Radewoosh | 3633 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3390 |
| 10 | gamegame | 3386 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 3 | atcoder_official | 162 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 9 | nor | 153 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Nov/22/2024 21:29:47 (j2).
Desktop version, switch to mobile version.
Supported by
Reduce it to the equation with 2 variables
A condition for a solution to exist: gcd(a1, a2, a3) divides n.
Now, if we rewrite the equation as: a1 * x + a2 * y = n - a3 * z, using the condition above, it shouldn't be hard to find z such that gcd(a1, a2) divides n - a3 * z. When you manage to do that, just solve the regular Diophantine equation left.