Hello guys I'm trying to be good at counting using combinatorics.
Can anyone recommend some tutorials/problems for me ... Thanks in advance and RAMADAN KAREEM
№ | Пользователь | Рейтинг |
---|---|---|
1 | ecnerwala | 3649 |
2 | Benq | 3581 |
3 | orzdevinwang | 3570 |
4 | Geothermal | 3569 |
4 | cnnfls_csy | 3569 |
6 | tourist | 3565 |
7 | maroonrk | 3531 |
8 | Radewoosh | 3521 |
9 | Um_nik | 3482 |
10 | jiangly | 3468 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 162 |
4 | TheScrasse | 159 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 151 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
Hello guys I'm trying to be good at counting using combinatorics.
Can anyone recommend some tutorials/problems for me ... Thanks in advance and RAMADAN KAREEM
Hello every one ,wish you are doing great .... can any one explain how does this code doesn't got TLE ? https://codeforces.com/contest/246/submission/79394388
My idea is:
1-I'm storing all nodes in subtree of u at depth x using dfs time.
2- In every query first I check if I've encountered a query asking about the same nodes then I print answer as I save the ans of every query else then I iterate over all strings at depth d[i] + x at subtree of u and find number of distinct strings using set.
thanks in advance
Название |
---|