PagalavanPagal66's blog

I become Expert....!
By PagalavanPagal66, 12 months ago, In English

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

  • Vote: I like it
  • +29
  • Vote: I do not like it

Comments Comments (27)
| Write comment?
»
12 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Auto comment: topic has been updated by PagalavanPagal66 (previous revision, new revision, compare).

→ Reply
»
12 months ago, # |
← Rev. 2   Vote: I like it +59 Vote: I do not like it

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

→ Reply
»
12 months ago, # |
  Vote: I like it 0 Vote: I do not like it

You forget Binary Search

→ Reply
»
12 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Auto comment: topic has been updated by PagalavanPagal66 (previous revision, new revision, compare).

→ Reply
»
12 months ago, # |
← Rev. 4   Vote: I like it +1 Vote: I do not like it

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!

→ Reply
»
12 months ago, # |
  Vote: I like it 0 Vote: I do not like it

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

→ Reply
  • »
    »
    12 months ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    How much knowledge is needed then?

    → Reply
    • »
      »
      »
      12 months ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

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

      → Reply
  • »
    »
    12 months ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

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

    → Reply
»
12 months ago, # |
  Vote: I like it 0 Vote: I do not like it

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

→ Reply
  • »
    »
    12 months ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

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

    → Reply
    • »
      »
      »
      12 months ago, # ^ |
        Vote: I like it 0 Vote: I do not like it

      That'll be sufficient?

      → Reply
      • »
        »
        »
        »
        12 months ago, # ^ |
          Vote: I like it 0 Vote: I do not like it

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

        → Reply
      • »
        »
        »
        »
        12 months ago, # ^ |
          Vote: I like it 0 Vote: I do not like it

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

        → Reply
»
12 months ago, # |
  Vote: I like it 0 Vote: I do not like it

congrats broo)) My CP journey is so sad (

→ Reply
»
12 months ago, # |
← Rev. 3   Vote: I like it +3 Vote: I do not like it

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 approach

I 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.

→ Reply
»
12 months ago, # |
  Vote: I like it +5 Vote: I do not like it

I also became expert!

→ Reply
»
12 months ago, # |
  Vote: I like it 0 Vote: I do not like it

orz

→ Reply