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
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 3757 |
| 2 | jiangly | 3647 |
| 3 | Benq | 3581 |
| 4 | orzdevinwang | 3570 |
| 5 | Geothermal | 3569 |
| 5 | cnnfls_csy | 3569 |
| 7 | Radewoosh | 3509 |
| 8 | ecnerwala | 3486 |
| 9 | jqdai0815 | 3474 |
| 10 | gyh20 | 3447 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | maomao90 | 171 |
| 2 | awoo | 165 |
| 3 | adamant | 164 |
| 4 | TheScrasse | 159 |
| 5 | nor | 155 |
| 5 | maroonrk | 155 |
| 7 | -is-this-fft- | 152 |
| 8 | Petr | 147 |
| 9 | orz | 146 |
| 10 | pajenegod | 145 |
→ 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: Jun/02/2024 12:30:45 (j2).
Desktop version, switch to mobile version.
Supported by
