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 | 4009 |
2 | jiangly | 3773 |
3 | Radewoosh | 3646 |
4 | ecnerwala | 3624 |
5 | jqdai0815 | 3620 |
5 | Benq | 3620 |
7 | orzdevinwang | 3612 |
8 | Geothermal | 3569 |
8 | cnnfls_csy | 3569 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | awoo | 161 |
2 | maomao90 | 160 |
3 | nor | 157 |
4 | atcoder_official | 156 |
4 | cry | 156 |
6 | -is-this-fft- | 155 |
7 | maroonrk | 154 |
8 | adamant | 153 |
9 | Um_nik | 151 |
10 | djm03178 | 146 |
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 |
---|