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 | ecnerwala | 3648 |
2 | Benq | 3580 |
3 | orzdevinwang | 3570 |
4 | cnnfls_csy | 3569 |
5 | Geothermal | 3568 |
6 | tourist | 3565 |
7 | maroonrk | 3530 |
8 | Radewoosh | 3520 |
9 | Um_nik | 3481 |
10 | jiangly | 3467 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | adamant | 164 |
2 | awoo | 164 |
4 | TheScrasse | 160 |
5 | nor | 159 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 150 |
8 | SecondThread | 148 |
9 | pajenegod | 145 |
10 | orz | 144 |
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 :)