| # | User | Rating |
|---|---|---|
| 1 | tourist | 3985 |
| 2 | jiangly | 3814 |
| 3 | jqdai0815 | 3682 |
| 4 | Benq | 3529 |
| 5 | orzdevinwang | 3526 |
| 6 | ksun48 | 3517 |
| 7 | Radewoosh | 3410 |
| 8 | hos.lyric | 3399 |
| 9 | ecnerwala | 3392 |
| 9 | Um_nik | 3392 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 169 |
| 2 | maomao90 | 162 |
| 2 | Um_nik | 162 |
| 4 | atcoder_official | 161 |
| 5 | djm03178 | 158 |
| 6 | -is-this-fft- | 157 |
| 7 | adamant | 155 |
| 8 | Dominater069 | 154 |
| 8 | awoo | 154 |
| 10 | luogu_official | 150 |
very interesting research challenge
hello codeforces
i want to suggest a research
let's call the depth of an english wikipedia page a minimal amount of clicks on links (in the text) to reach this page.
what is (approximately) the mathematical expectation of this value (the page is chosen randomly equiprobably)? I'm waiting for your approaches (with description)!!!
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en6 |
|
MikeMirzayan | 2021-02-13 05:24:23 | 212 | ||
| en5 |
|
MikeMirzayan | 2021-02-13 01:48:54 | 13 | Tiny change: 'edia page a minimal amount of' -> 'edia page the smallest amount of' | |
| en4 |
|
MikeMirzayan | 2021-02-13 01:48:26 | 3 | Tiny change: 'epth** of english w' -> 'epth** of an english w' | |
| en3 |
|
MikeMirzayan | 2021-02-13 01:47:28 | 0 | (published) | |
| en2 |
|
MikeMirzayan | 2021-02-13 01:47:22 | 4 | (saved to drafts) | |
| en1 |
|
MikeMirzayan | 2021-02-13 01:47:06 | 424 | Initial revision (published) |
