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
# | 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 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 171 |
2 | awoo | 165 |
3 | adamant | 163 |
4 | TheScrasse | 159 |
5 | maroonrk | 155 |
6 | nor | 154 |
7 | -is-this-fft- | 152 |
8 | Petr | 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
Name |
---|