Now I'm Pupil, but I was Specialist before. Not happy! I want to be Candidate Master.
# | User | Rating |
---|---|---|
1 | tourist | 3985 |
2 | jiangly | 3814 |
3 | jqdai0815 | 3682 |
4 | Benq | 3529 |
5 | orzdevinwang | 3526 |
6 | ksun48 | 3517 |
7 | Radewoosh | 3410 |
8 | hos.lyric | 3399 |
9 | ecnerwala | 3392 |
9 | Um_nik | 3392 |
# | User | Contrib. |
---|---|---|
1 | cry | 169 |
2 | maomao90 | 162 |
2 | Um_nik | 162 |
4 | atcoder_official | 161 |
5 | djm03178 | 158 |
6 | -is-this-fft- | 157 |
7 | adamant | 155 |
8 | awoo | 154 |
8 | Dominater069 | 154 |
10 | luogu_official | 150 |
Now I'm Pupil, but I was Specialist before. Not happy! I want to be Candidate Master.
Name |
---|
Oh, it's easy! Just register to #256 contest, solve three first problems in, say, 30 minutes... Repeat if necessary with #257 contest.
It's even easier:
yes, it will improve ability to solve harder problems. but unfortunately, upsolving alone won't help him increase rating.
It will improve his ability to solve harder problems (and solve problems faster), which causes him to perform better in contests and improve his rating.
If we wanted to nitpick, then the words "alone" and "help" have opposite meaning. If something helps towards a goal (which is increasing rating = doing well at contests, for which rating is just a measure), it's obviously not the only thing you do to achieve it.
But if these words are used together, then the meaning it holds to me is that "if the only effort he makes is upsolving, then it won't have the desired effect". And that's what I argued against.
But then again, these are just technicalities.
But it's so hard!:(
put your self in a plan and watch your progress
A.try to solve some (i.e 30 ) problems which solved at least 2000 times.
B.try to solve some (i.e 5 ) contests unofficial (at least a,b,c) and read the tutorial.
C.participate in some (i.e 3 ) virtual contests and examine yourself.
What about if I have a lack of algorithms background I usually do fine with Div 2 A, B but then when there is a DP or BFS or Tree problem I usually skip it.
I have bought the book introduction to algorithms .
Do you advise me to read it or should I take some math course before about discrete maths.
Just read it. Mostly secondary school math is more than enough for studying basic structures and algorithms.
Thankk you
Well, when you find that you're skipping some kinds of problems, that should indicate your weakness. You should practice on those more. DP and Graph are quite important topics as well.
I have Problems with the Asymptotic notations (I find they are kind of useless) Plus I am kind of weak in Probability. Do you think it's okay ?
Do you also advise me to skip some chapters in the book or go through it and do all the exercises + Problems
Thank You in Advance :D
It's hard to tell exactly. It depends on your goal though. Eventually you will need to know the basic for all of them, but for now, just study the important topics first and try to implement them. I never read the entire book at once. If you wanna do well in CF and become Candidate Master, you should practice a lot on Div2ABC. If you can't solve something, read the editorials/codes and code it on your own (try not to skip a problem).
Who cares...
You have participated in only 4 rounds and now you are disappointed and want to be candidate master... I had participated in more than 80 contests and I still want to be candidate master... Just 2 of my contest were Div1 contests...
Never skip editorials, try to understand each explanation and solve them on your own. By the way, from time to time i also have big decreasing in my rating, do not let it demotivate you! Cheers
You can try like this:
But this is not practical or