Given a unidirected graph of 10^5 nodes, how do i efficiently query for number of eulerian paths between any 2 nodes of the graph? Number of queries are 10^4
→ Pay attention
→ Streams
→ Top rated
| # | 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 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 169 |
| 2 | maomao90 | 162 |
| 2 | Um_nik | 162 |
| 4 | atcoder_official | 160 |
| 5 | djm03178 | 158 |
| 6 | -is-this-fft- | 157 |
| 7 | adamant | 155 |
| 8 | Dominater069 | 154 |
| 8 | awoo | 154 |
| 10 | luogu_official | 150 |
→ Find user
→ Recent actions
How to find number of Eulerian paths between any 2 nodes of a unidirected graph?
Revision en1, by uzumaki_naruto_, 2018-01-08 08:26:00
History
Revisions
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en2 |
|
uzumaki_naruto_ | 2018-01-08 11:28:16 | 158 | ||
| en1 |
|
uzumaki_naruto_ | 2018-01-08 08:26:00 | 237 | Initial revision (published) |
Codeforces (c) Copyright 2010-2024 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Dec/23/2024 13:20:10 (i1).
Desktop version, switch to mobile version.
Supported by
