incra's blog

Leave your favourite problems rating between [1900,2400]!
By incra, history, 3 months ago, In English

I can't find many nice problems, so please drop some problems even if it's naive!

Updata: Just found out that *2100 was not hard enough :)

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

»
3 months ago, # |
← Rev. 2   Vote: I like it +4 Vote: I do not like it

https://mirror.codeforces.com/contest/1360/problem/G

tbh it is a good problem but i didnt feel like it was this hard maybe cuz i solved alot of matrix problems but aye it was nice for me :)

this also might be good https://mirror.codeforces.com/contest/1154/problem/G (didnt solve yet)

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

How about this one. Maybe it's a little simple, but I liked it.

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

This and this

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

    Both of them were nice! Thank u!

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

1624G — MinOr Tree

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

    Solved it before, but it's a great problem. Thanks!

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

1714F - Build a Tree and That Is It

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

    I've solved it before, but still thanks!

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

1143E - Lynyrd Skynyrd

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

My favourite ones: https://mirror.codeforces.com/problemset/problem/1659/E https://mirror.codeforces.com/problemset/problem/979/D

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

1993D - Med-imize

Lesson

1992G - Ultra-Meow

Lesson

2002D2 - DFS Checker (Hard Version)

Lesson

2002E - Cosmic Rays

Lesson

Find Kth smallest pair distance in an array: Leetcode HARD (but simple bs actually)

Lesson

2000G - Call During the Journey

Lesson:

2008H - Sakurako's Test

Lesson
→ Reply
  • »
    »
    3 months ago, # ^ |
      Vote: I like it -8 Vote: I do not like it

    Almost all the problems in USACO.guide Gold with Normal and beyond rating are extremely good problems.

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

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

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

I can't solve the *1900+ problem/ng

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

1973D - Cat, Fox and Maximum Array Split

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

    This isn't a data structure problem

    → Reply
    • »
      »
      »
      2 months ago, # ^ |
      ← Rev. 2   Vote: I like it 0 Vote: I do not like it

      Does the problem become any easier if you know the array? (it actually does due to some hack solutions, but it's not trivial)

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

        In that case, why force a data structure onto a problem when more obvious and intended sol is much much simpler?

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

          Co-author of the mentioned problem here. Originally the problem was supposed to be solved knowing the whole array, but over the time, we figured out that it impossible to cut-off unintended bruteforces while letting all implementations of the model solutions pass. Making a black-box RMQ+binary search data structure and hiding the original array was the best solution I could think of.

          So in a way, the problem is still a data-structure problem, as it requires the contestant to figure out an efficient way to use a given a data structure.

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

1477C - Nezzar and Nice Beatmap

1787E - The Harmonization of XOR

1965C - Folding Strip

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

@incra 123123123

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

Wonderful tree

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

1560F2 - Nearest Beautiful Number (hard version)

1154G - Minimum Possible LCM

1367F1 - Flying Sort (Easy Version)

1367F2 - Flying Sort (Hard Version)

1156E - Special Segments of Permutation

1560F2 - Nearest Beautiful Number (hard version)

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

Wait,I think I have seen you on the acring web.Is that the right name?no for sure

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

I mean this problem is pretty legendary at this point: https://mirror.codeforces.com/problemset/problem/1188/B

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

https://mirror.codeforces.com/contest/2004/problem/E pretty cool game theory problem I say

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

CF1989E Distance to Different

Very nice counting problem.

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

A problem authored by a friend of mine and I was the first tester to solve this and did it with an unintended solution

https://mirror.codeforces.com/contest/1735/problem/E

The funniest thing is it was supposed to be a Div2C, but after testing it became Div2E and got a rating of 2400

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

1994D

1975E

1844E

1673F

1188B

1158B

Warning: lots of constructive algorithms

→ Reply