nolifeblackbird's blog

A is harder than B?
By nolifeblackbird, history, 3 hours ago, In English

Yesterday, I have participated in the Codeforces Round 969 (Div. 2), and I have realised that the task A was easier than B.

For task A (Dora's Set), you had to know that for any natural number x, gcd(x, x+1)=1, and for any odd number x, gcd(x, x+2)=1. Because of that, if x is an odd number, than the three distinct integers that satisfy the conditions would be x, x+1 and x+2. And thus you can find the answer (l-r+1)/4 which is increased by 1 in some cases.

For task B (Index and Maximum Value), you only had to realise that no number is gonna pass the biggest number because before it passes it, it has to become equal to the biggest number, but when it becomes equal then in any operation that the biggest number was increased, that number is also gonna be increased. Because of that we can only see in which operations the biggest number was increased or desreased, perform those operations on that number and we get the answer.

So for task A you had to know math which is not really easy, and for task B you just had to realise what I explained (if you didn't understand me, you can see the editorial), which is not harder than the math in A.

My question is: Can someone please explain why A was placed before B? Thank you for advance for your answers.

  • Vote: I like it
  • -9
  • Vote: I do not like it

»
3 hours ago, # |
← Rev. 2   Vote: I like it 0 Vote: I do not like it

A still has more accepted submissions* though...

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

    Hmm... yeah you're right. I haven't looked at that...

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

    It could be because some people thought B was harder so they solved A and then didn't have time for B though

    → Reply
»
71 minute(s) ago, # |
← Rev. 2   Vote: I like it 0 Vote: I do not like it

I believe A was not harder but observation was tough part there like thinking of that if any sequence of 3 starting from odd will result in gcd of 1 and that count will be only the max is definitely tough.

→ Reply
»
47 minutes ago, # |
← Rev. 3   Vote: I like it +1 Vote: I do not like it

1) Difficulty is subjective. To me personally, $$$\gcd(x, x+1)=1$$$ is common sense and $$$\gcd(x, x+2)=1$$$ for all odd $$$x$$$ is also common sense. However, B wasn't that obvious and I overthought the problem.

2) It's just Codeforces bruh, chill man. It's not that deep lol. The order of the problems isn't the most important thing. The most important thing is that we solve the problems and improve.

3) Rather than whining about unimportant things like problem order, how about you upsolve the problems regardless of their order and focus on doing better on the next contest?

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

I found A harder as well. I didn't prove it during the contest. But thanks to this blog, I discovered a beautiful proof for Euclid's algorithm gcd(a,b) = gcd(a%b, b) using sticks.

→ Reply