| № | Пользователь | Рейтинг |
|---|---|---|
| 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 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 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 | 142 |
Has anyone solved any of these two problems using Dominator Tree?
https://cses.fi/problemset/task/1703
https://cses.fi/problemset/task/1203
Unfortunately my code is failing on a couple tests.
I'd really appreciate it if anyone provides an accepted code using Dominator Tree.
How to find Product of Divisors in this CSES Problem
for each divisor i there exist a divisor n/i such that i*(n/i)=n,so we can put the divisors into pairs of the form (i,n/i) and the product of each pair is equal to n,so the answer is (n power s/2) where s is the number of divisors,there is a case where n is perfect square then the number of divisors is odd so we just multiply the answer by sqrt(n)
Thanks a lot,man. But, I tried doing exactly what u said, but couldn't get AC. Could u please share ur code for that problem?