I don't find any solution idea for this problem . I am totally stuck in this problem . If anyone solve the problem , please give me the idea for this problem . Thanks in advance !
→ Обратите внимание
→ Трансляции
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | ecnerwala | 3649 |
| 2 | Benq | 3581 |
| 3 | jiangly | 3578 |
| 4 | orzdevinwang | 3570 |
| 5 | Geothermal | 3569 |
| 5 | cnnfls_csy | 3569 |
| 7 | tourist | 3565 |
| 8 | maroonrk | 3531 |
| 9 | Radewoosh | 3521 |
| 10 | Um_nik | 3482 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | maomao90 | 174 |
| 2 | awoo | 165 |
| 3 | adamant | 161 |
| 4 | TheScrasse | 159 |
| 5 | nor | 158 |
| 6 | maroonrk | 156 |
| 7 | -is-this-fft- | 152 |
| 8 | orz | 146 |
| 8 | SecondThread | 146 |
| 10 | pajenegod | 145 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2024 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 30.04.2024 19:41:47 (h1).
Десктопная версия, переключиться на мобильную.
При поддержке
Auto comment: topic has been updated by rajon_aust (previous revision, new revision, compare).
OP changed the question from HIGHWAY — > HIGH . This comment is uselss
can you explain your idea please . thanks !
Auto comment: topic has been updated by rajon_aust (previous revision, new revision, compare).
I think the problem is just counting spanning trees
Any more good resources to understand the algorithm ? Thanks a lot for giving the link of algorithm .
Just try Googling "counting spanning trees," or "Kirchoff's theorem" and there are a lot of sources. Here's a proof, and here's how to find a determinant
Thanks a lot ! I will try my best to solve the problem .
Thanks a lot . Finally I solved the problem !