RockyB's blog

Problem recommendations
By RockyB, history, 5 years ago, In English

Hi guys :)

Some of you might know that I have YouTube channel where I do screencasts, explain algorithms and observe interesting problems.

Since we all love cool problems and want to improve in competitive programming I want to start doing videos more recently. So, If you have any interesting, educative problems of different levels, please share them with me in the comments below. I will try to select fabulous ones and make video solutions.

For example today during AtCoder Beginner Contest I found problem F really nice and I made video on this problem.

Link https://youtu.be/3mnwcJGO_MI

If you have any suggestions, feel free to leave them below :)

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

Comments Comments (17)
| Write comment?
»
5 years ago, # |
  Vote: I like it +32 Vote: I do not like it

This is the last problem from Global Round 8 1368H1 - Breadboard Capacity (easy version) and 1368H2 - Breadboard Capacity (hard version)

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

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

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

It would be great if u can upload solutions of div2 D & E problems solutions, becoz most of us get stuck there. Posting algorithms required to be able to solve upto E in div2.

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

    I see your point, however since I can't do video solutions for all div2 D, E problems, it would be better if you could send some really cool problems for which you would like to see my explanations.

    Thanks!

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

      The thing is that, since I am not able to solve D & E problem, so I don't think I can identify cool ones between them. But I think, u should solve D & E from recent contests.

      → Reply
»
4 years ago, # |
← Rev. 2   Vote: I like it -7 Vote: I do not like it

https://atcoder.jp/contests/arc066/tasks/arc066_b?lang=en

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

After the round most of us search for Problem D and Problem E (div 2) but most of video solution are made for Div2 B and C only. It would be great if you could make solutions for these two.

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

Hi Jan! I like very much your explanations! It will be very interesting to listen your explanation for problem Info(1)Cup 2017 Xorsum or similar to Codeforces Round #626 Div2D and Info(1)Cup 2019 Cat .

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

    Hi :)

    Oh, I know that cool technique/idea, definitely will try to observe it.

    Thank you!

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

I can't solve it and editorial written on Japanese. I didn't understand. https://atcoder.jp/contests/abc137/tasks/abc137_f?lang=en https://atcoder.jp/contests/abc150/tasks/abc150_e?lang=en

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

Harder problems (D-E-F) from recent contests would be great.

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

I think this problem from POI 2014 is a cool problem:

https://www.spoj.com/problems/TREEOI14/

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

    Nice, it would be cool to see more such cool OI problems.

    → Reply