pllk's blog

CSES Problem Set new year 2021 update: 100 new problems
By pllk, history, 2 weeks ago, In English

Today we have released a new version of the CSES Problem Set:

https://cses.fi/problemset/

CSES Problem Set is a collection of algorithmic programming problems that can be used to practice competitive programming. We have now added 100 new problems, and the total number of problems is 300. There are both easy and difficult new problems, and some of them cover advanced topics, such as treaps, suffix structures, and FFT.

In 2020, there were more than one million submissions to CSES, which is a new record. Thank you for your submissions and new test cases through hacking!

Our ultimate goal is to create a problem set of 1000 problems, so you can expect many new problems also in the future. If you have ideas on how to improve the problem set, you can discuss them here.

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

Comments Comments (42)
»
2 weeks ago, # |
  Vote: I like it +10 Vote: I do not like it

Thank you for the problems

→ Reply
»
2 weeks ago, # |
  Vote: I like it +34 Vote: I do not like it

Great. Make it like one stop Platform where any beginner can blindly follow.

→ Reply
»
2 weeks ago, # |
  Vote: I like it +140 Vote: I do not like it

Sample explanations please.

→ Reply
»
2 weeks ago, # |
  Vote: I like it -60 Vote: I do not like it

Please add tutorial option in the problem statement page if possible.

→ Reply
»
2 weeks ago, # |
  Vote: I like it +9 Vote: I do not like it

https://cses.fi/problemset/task/2413/ Counting Towers

I am missing a proper defintion on how to count distinct towers. Is a rotation or a reflection another tower?

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

    Thanks, now the problem statement should be easier to understand.

    → Reply
»
2 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

yanire Yoav Noam13 almogwald inbarin Back to the grind?

→ Reply
»
2 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

Thanks a lot !

→ Reply
»
2 weeks ago, # |
  Vote: I like it +8 Vote: I do not like it

Why does trying to hack Digit Queries give internal error?

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

    Thanks, now it should be fixed

    → Reply
»
2 weeks ago, # |
  Vote: I like it +13 Vote: I do not like it

How to sort problems by difficulty level?

→ Reply
»
2 weeks ago, # |
← Rev. 3   Vote: I like it +72 Vote: I do not like it

For anyone else, like me, curious for a list of just the new 100 problems to look through:

by category
→ Reply
»
2 weeks ago, # |
  Vote: I like it -27 Vote: I do not like it

Thanks for this but i have a suggestion :

Do not increase numbers , but focus on quality . Create a problemset which cover all possible topics of Competitive Programming with minimum number of problems. Else there will be no difference a online judge and this set . You can add other practice problem to a different section .

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

Nice good sir.

→ Reply
»
2 weeks ago, # |
  Vote: I like it +24 Vote: I do not like it

Thanks for doing this, I really appreciate your book and the problemset!

Couple of questions:

  1. Is there any way to hide problem "tags" like DP, Graphs, etc? The only thing that stopped me from solving CSES is that you know if the problem will be DP or Graphs or Math in advance, thus making it less interesting.

  2. Why 1000 problems? It feels great to solve everything, and this will be hard to do with 1000 problems, just from the time standpoint. 200 was perfect for this, 300 is not bad. I think it's possible to cover most essential topics/techniques, and still keep the problemset size small.

→ Reply
  • »
    »
    13 days ago, # ^ |
    ← Rev. 2   Vote: I like it +25 Vote: I do not like it
    1. To make it more interesting, solve only Additional Problems. All others are just "implement classical algorithm". So even if you hide topics, they become obvious when you read problems.
    → Reply
  • »
    »
    13 days ago, # ^ |
      Vote: I like it +15 Vote: I do not like it

    If you've started at the right time, after each expansion you only have to solve a 100 new problems :P

    → Reply
  • »
    »
    13 days ago, # ^ |
      Vote: I like it +31 Vote: I do not like it

    1. The idea is that the "tutorial" problems are divided into sections and then there are more difficult problems in the last section without hints.

    2. With 300 problems the problem set is already quite comprehensive, but there are still many good educational problems that are missing. I agree with your point that it may take really long to solve them all in the future.

    → Reply
»
2 weeks ago, # |
  Vote: I like it 0 Vote: I do not like it

please add some decent questions of constructive algorithms to practice

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

    Yeah, Constructive Algorithms are the most widely asked topic in these days contests.

    Add some good level Problems on Constructive Algorithms !!

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

best problemset for beginners and intermediates. thankyou!

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

I think it would be great if there are discuss section like leetcode.

Some problems are quite hard for beginners like me to figure out the solution all by myself.

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

You are doing a great Job. Thank you!

→ Reply
»
13 days ago, # |
  Vote: I like it 0 Vote: I do not like it

The problems are really good. One suggestion: why not change the time limit for non-Cpp programs? I try submitting the solution in Java and it TLEs. Just converting it to cpp gets accepted.

→ Reply
»
13 days ago, # |
  Vote: I like it +105 Vote: I do not like it

I always dreamt of being 1st on the CSES leaderboard, but I never imagined being 2nd simultaneously!

→ Reply
  • »
    »
    11 days ago, # ^ |
      Vote: I like it +33 Vote: I do not like it

    "There are only two hard things in computer science: cache invalidation and naming things."

    → Reply
»
13 days ago, # |
  Vote: I like it 0 Vote: I do not like it

orz pllk

→ Reply
»
13 days ago, # |
  Vote: I like it 0 Vote: I do not like it

Nice initiative.....

→ Reply
»
12 days ago, # |
← Rev. 2   Vote: I like it 0 Vote: I do not like it

Firstly, thank you for the helpful initiative!

I had a small clarification in this regard. The original post mentions the addition of problems based on some advanced concepts like treaps, suffix structures, and FFT. I just wanted to enquire as to if the book contains an explanation for these topics as well.

If not, can this please be done ?

Once again, thank you!

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

    At the moment no, someday it will contain. Before that there are other sources that can be used to learn the topics.

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

Official editorials of the problems may be a good idea.

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

Our ultimate goal is to create a problem set of 1000 problems

→ Reply
»
8 days ago, # |
  Vote: I like it 0 Vote: I do not like it

Thank you for the amazing problem set!

I think it is the best website for someone who want to learn some new algorithm

→ Reply
»
7 days ago, # |
  Vote: I like it 0 Vote: I do not like it

Can you please add the sample explanations for the sample test case? I am finding some problems a little difficult to understand like Prefix sum queries.

→ Reply
»
28 hours ago, # |
← Rev. 2   Vote: I like it -14 Vote: I do not like it

Suggestion: add hacking leaderboards or some other way of crediting hackers.

Perhaps add next to a testcase the name of the person who added it? There are a few possibilities.

→ Reply
  • »
    »
    27 hours ago, # ^ |
      Vote: I like it +6 Vote: I do not like it

    People will abuse it. Please take a look at educational round hacks.

    → Reply
»
13 hours ago, # |
  Vote: I like it 0 Vote: I do not like it

Can anyone please help me out with the Counting Tilings problem?? I haven't been able to find any recurrence relation.Any hint??

→ Reply
  • »
    »
    10 hours ago, # ^ |
      Vote: I like it +3 Vote: I do not like it
    Hint
    → Reply