| # | User | Rating |
|---|---|---|
| 1 | tourist | 3880 |
| 2 | jiangly | 3669 |
| 3 | ecnerwala | 3654 |
| 4 | Benq | 3627 |
| 5 | orzdevinwang | 3612 |
| 6 | Geothermal | 3569 |
| 6 | cnnfls_csy | 3569 |
| 8 | jqdai0815 | 3532 |
| 9 | Radewoosh | 3522 |
| 10 | gyh20 | 3447 |
| # | User | Contrib. |
|---|---|---|
| 1 | awoo | 161 |
| 2 | maomao90 | 160 |
| 3 | adamant | 156 |
| 4 | maroonrk | 153 |
| 5 | atcoder_official | 149 |
| 6 | -is-this-fft- | 148 |
| 6 | SecondThread | 148 |
| 8 | Petr | 147 |
| 9 | nor | 144 |
| 10 | cry | 143 |
Euclid's Algorithm
Every time I use Euclid's algorithm, I go through the same lengthy process of convincing myself of why it works. Hopefully this blog post will allow me to shorten that process by referring back to this post instead.
The entirety of Euclid's algorithm is as follows:
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en5 |
|
ebanner | 2016-11-19 21:40:38 | 519 | Tiny change: 'asonable; the large' - (published) | |
| en4 |
|
ebanner | 2016-11-19 21:27:16 | 414 | Tiny change: '`, we can stack it to get' - | |
| en3 |
|
ebanner | 2016-11-19 21:15:18 | 1298 | Tiny change: 'if b == 0 gcd(b, a%' - | |
| en2 |
|
ebanner | 2016-11-19 21:01:10 | 1243 | ||
| en1 |
|
ebanner | 2016-11-19 20:51:08 | 412 | Initial revision (saved to drafts) |
