SuperJ6's blog

Similar Problems
By SuperJ6, history, 2 years ago, In English

What are some examples of surprisingly similar problems across different contests on codeforces?

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

»
2 years ago, # |
  Vote: I like it +37 Vote: I do not like it

765F and 1793F from a week ago.

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

1771B and 652C. They are basically the same task but the permutation is $$$\left[1,2,3,...,n-1,n\right]$$$ in 1771B while it can be any permutation in 652C

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

This 1790F - Тимофей и черно-белое дерево and 342E - Ксюша и дерево overall still pretty interesting problem

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

1141E - Супергеройская битва and 1490G - Старый дисковод they are both from Div 3 contests, one has multiple testcases while the other doesn't.

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

1795C in educational round same as 923B

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

All the problems until 2000 rating that involve the concept of permutation groups , permutation parity and permutation cycles are similar;

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

407B and 1552F. The latter is just the former with a ton of shit added on top.

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

1462C - Уникальное число and 1714C - Минимальное разнообразное число are the same, except the constraints (45 vs 50)

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

713C - Соня и задача без легенды and 13C - Последовательность

Differences: strictly increasing/non-decreasing, N=3000/5000. In other words, no difference...

→ Reply