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 :)
→ Обратите внимание
Соревнование идет
2023 Post World Finals Online ICPC Challenge powered by Huawei
13 дней
Зарегистрироваться »
2023 Post World Finals Online ICPC Challenge powered by Huawei
13 дней
Зарегистрироваться »
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3690 |
| 2 | jiangly | 3647 |
| 3 | Benq | 3581 |
| 4 | orzdevinwang | 3570 |
| 5 | Geothermal | 3569 |
| 5 | cnnfls_csy | 3569 |
| 7 | Radewoosh | 3509 |
| 8 | ecnerwala | 3486 |
| 9 | jqdai0815 | 3474 |
| 10 | gyh20 | 3447 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | maomao90 | 174 |
| 2 | awoo | 165 |
| 3 | adamant | 161 |
| 4 | TheScrasse | 160 |
| 5 | nor | 158 |
| 6 | maroonrk | 156 |
| 7 | -is-this-fft- | 152 |
| 8 | orz | 146 |
| 9 | SecondThread | 145 |
| 9 | pajenegod | 145 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 08.05.2024 03:24:53 (k1).
Десктопная версия, переключиться на мобильную.
При поддержке
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.