OmaeWaMouShenDeiru's blog

Training schedule,,
By OmaeWaMouShenDeiru, 10 years ago, In English

Hello,

In this blog, I would like to ask for your training experiences.

The ACM local contest will be in three month, and the regional contest is in December, and I believe I still have enough time to improve my skills.

I'm fast in reading problem statements and coding whenever I understand the problem completely. I know basics of graph theory problems, number theory, dynamic programming, and working on improving my data structure skills.

But whenever I participate in a codeforces contest, I feel there is a lot of skills I'm missing.

So it would be very kind of you to share or provide a good training schedule for the amount of time left before the coming contests.

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

Comments Comments (16)
| Write comment?
»
10 years ago, # |
  Vote: I like it -24 Vote: I do not like it

tnakx

→ Reply
»
10 years ago, # |
  Vote: I like it +3 Vote: I do not like it

this is something like a complete course as you're purple i already suppose you covered most of it but it's somehow good to take a fast review then you can indicate the points where you are weak and go to study them in depths maybe in here

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

    Thank you so much,, I've already seen the topics and I have basic knowledge of moat of these topics,, I need the best time strict schedule for the next couple monthes I have

    → Reply
»
10 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Aaaall day, aaaaall night... Aaall day, aaaall night... Fifala fiesta, fifala noches:D

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

    speak some human language !!

    → Reply
    • »
      »
      »
      10 years ago, # ^ |
        Vote: I like it +4 Vote: I do not like it

      Ok. Now in human language. I'll give a strict schedule as you wanted. Schedule covers 5 years, beginning from today. Your learning process will be iterational. It is, you read the problem, you think about this sometime, if you can't solve, then you'll ask someone who knows(teacher, friend). And thats it! As Kung Fu Panda says:"There is no secret ingridient"!!!

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

        It looks so scary after 5 years. I think he gave up.

        → Reply
»
10 years ago, # |
  Vote: I like it 0 Vote: I do not like it

guys, most important thing now is to know the most important topics to focus on for the next couple of month i still have.

I think I'll start with data structures and math.

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

    I think schedules vary from people to people. We dont learn things exactly as well. XD i believe that we should just mainly focus on what we are not really good at right now

    What do you think so?

    → Reply
»
10 years ago, # |
  Vote: I like it +11 Vote: I do not like it

Never had a successful schedule yet

→ Reply
»
10 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Ok, let's forget about a strict scedual I need to know some important topics to focus on right now. And should I focus on some topics and solve as much as I can on them, or should I solve and learn topics randomly

→ Reply
  • »
    »
    10 years ago, # ^ |
    ← Rev. 4   Vote: I like it +5 Vote: I do not like it

    I can give you general areas of data structures and algorithms. I don't know if this is enough, guess i am still grey.

    Programming Contest Problem Types

    Hal Burch conducted an analysis over spring break of 1999 and made an amazing discovery: there are only 16 types of programming contest problems! Furthermore, the top several comprise almost 80% of the problems seen at the IOI. Here they are:

    Dynamic Programming
Greedy
Complete Search
Flood Fill
Shortest Path
Recursive Search Techniques
Minimum Spanning Tree
Knapsack
Computational Geometry
Network Flow
Eulerian Path
Two-Dimensional Convex Hull
BigNums
Heuristic Search
Approximate Search
Ad Hoc Problems

    The most challenging problems are Combination Problems which involve a loop (combinations, subsets, etc.) around one of the above algorithms — or even a loop of one algorithm with another inside it. These seem extraordinarily tricky to get right, even though conceptually they are ``obvious''.

    If you can master solving just 40% of these problem types, you can almost guarantee a silver medal at the IOI. Mastering 80% moves you into the gold range almost for sure. Of course, `mastery' is a tough nut to crack! We'll be supplying a plethora of problems so that you can hone your skills in the quest for international fame. (Copied from USACO).

    Where can you learn this?

    Sites where is this sorted by areas are: USACO Hakerrank

    Or you can go good old way solving problem by problem on these sites by order: Codeforces TopCoder CodeChef SPOJ Timus ProjectEuler Hakerearth Coderbyte

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

      Thanks a lot for sharing!

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

        Probably the best set of Data Structures and Algorithms with tutorials is on this link Codechef.

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

          Yeah,I've read that list before,that was fantastic!Thanks!

          This oneis also really nice(including the Codechef tutorials)!

          → Reply