# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3823 |
3 | Benq | 3738 |
4 | Radewoosh | 3633 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3390 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 157 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
9 | nor | 153 |
I am newbie in the competitive programming community. I have solved a few problems with difficulty less than 1200 mostly with tags greedy, math, implementation. Here are my submissions Then I started to move on with different tags starting from data structures But now, I cannot solve those problems (tagged data structures) , though I seem to understand those questions but I cannot code most of the solution... still there were some problems on which I got AC, but they seem to have execution time > 1000 ms which I think are not efficient, right ? Can anyone please help me on how to move ahead in this journey ? It would be very good. More specifically I want to know how to solve problems ahead with possibly more difficulty and varying tags, or is there something wrong with my approach ?
Name |
---|