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.
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3831 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | gamegame | 3386 |
10 | ksun48 | 3373 |
# | User | Contrib. |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 160 |
5 | -is-this-fft- | 158 |
6 | awoo | 157 |
7 | adamant | 156 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | Dominater069 | 153 |
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.
Name |
---|
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 :)