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 | 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 |
# | User | Contrib. |
---|---|---|
1 | awoo | 161 |
2 | maomao90 | 160 |
3 | adamant | 156 |
4 | maroonrk | 153 |
5 | atcoder_official | 148 |
5 | -is-this-fft- | 148 |
5 | SecondThread | 148 |
8 | Petr | 147 |
9 | nor | 144 |
10 | TheScrasse | 142 |
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://mirror.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 |
---|