After getting negative contribution to my pervious blog (Asking about will I go to specialist by 2023), I have raged up my problem solving limits and become Blue now...!

Topic to cover mostly :

1) Maths — Combinatorics, Modular arithmetics, Prime properties

2) Prefix & Suffix optimizations

3) Basic DP , Recursion , Graph , Tree implementations

4) Implementation skills — You have to ready to convert your thought process into code easily

5) STL usage is very important

6) Binary search

7) Bit manipulations

Tips :

1) Don't try the topics you have learned in recent days into all the problems

2) Think of the solution without thinking any algorithms — just use that algorithms if you need optimization or it is basic need in your approach

3) Spend quality of time in each and every problem you solve — I have spent a whole day for a 1700 problem in my practice session before ICPC regionals

4) Enhance your debugging skills

5) Don't give up and keep trying — a single push can lift you beyond your imaginary level — For me that push is ICPC regionals

Auto comment: topic has been updated by PagalavanPagal66 (previous revision, new revision, compare).bro relax , you will probably get back to specialist in the next contest

bro relax , you will probably get back to pupil in the next contest

bro relax , we will all go back to pupil in the next contest

bro relax ,I will go back to newbie in the next context.

Maybe — But I never stop to stay down...! Anyways...! Good luck in your journey

Congrats!

Thanks alot

bro relax, you will probably promote to candidate master in the next contest

You forget Binary Search

Thank you for reminding me bro ❤️

Auto comment: topic has been updated by PagalavanPagal66 (previous revision, new revision, compare).Let people say whatever they want to. It's always special and joyful to reach a new Color. Congratulations!! Miles to Go!! Keep Enjoying the Journey!

Thank you

Personal Opinion, You don't need to be advanced in graph programming to get to blue

How much knowledge is needed then?

understand bfs/dfs, know dijkstra logic. and know how to work with graphs, traversing etc but no advanced algo

Is tarzan's algorithm, DSU and MSTs considered as advanced algos?

yes,

Yeah...! But basic graph topics helps alot in getting blue, Div 4/3 last 2 questions are literally based on that majorly.

Any tips about how and from where to do CP maths?

Refer geeks for geeks & CP algorithms for this kind of maths stuffs

That'll be sufficient?

You have to experience alot and that will be the best way to learn. Like reading editorials after every codeforces contest.

for getting out of newbie yes, after that we'll talk about it

Hey bro, congratulation.

can you help me with this problem statement -> https://mirror.codeforces.com/contest/1879/problem/C

I didn't understand what this problem is asking.

Mostly this statement -> the number of different shortest sequences of operations that make s alternating. Two sequences of operations are different if in at least one operation, the chosen integer i is different in these two sequences.

My english is not so good, i didn't understand what this problem is saying. please help.

congrats broo)) My CP journey is so sad (

Congrats, keep going :D

Congratulations! Reaching blue when you weren't even sure if you would reach cyan such a short time ago is really impressive!

2)

Think of the solution without thinking any algorithms — just use that algorithms if you need optimization or it is basic need in your approachI do have some qualms about this tip though. Perhaps it is true for really hard problems, but thinking stuff like "Can I do binary search? Is there a DP recurrence here?" has helped me get unstuck on many problems. I think it can be really helpful in certain situations.

I also became expert!

Congrats Broo

orz

Congrats!!! I just became Specialist only, so I will work hard to get to blue one day too!

how did you reach expert with only 9 1600 problems solved? Do you practice on some other platforms too?