Пожалуйста, подпишитесь на официальный канал Codeforces в Telegram по ссылке https://t.me/codeforces_official. ×

Блог пользователя Top1Top1Top1Top1

Автор Top1Top1Top1Top1, история, 28 минут назад, По-английски

Hi everyone,

I'd like to raise a technical question, not an accusation.

Observation. According to the standings, nkn0acc của anh ấy solved Problem F (Problem from Malinovka) roughly 9 minutes into the contest. That is very fast for a problem of this difficulty, so I looked at the code out of curiosity.

What I compared. I compared nkn0's submission (**399449778**) with another solution (**399480287**code tôi thử claude để kiểm tra). Both use:

square-free filtering, integer square roots to count candidates, GCD conditions for pairwise coprimality, a case split into equal / two-equal / all-distinct triples, with coefficients 1, 3, 6.

Important caveats.

The second submission was made about 2h25m after nkn0's, so it cannot be the source of nkn0's code. These techniques and coefficients are standard for this problem, so independent solutions would likely look similar. The implementations are structurally different (SPF + stampArr vs. precomputed adj + mark[]).

So I have no evidence of any rule violation, and I'm not claiming one. A fast solve can simply mean a strong participant who found the key idea quickly.

Request. If the organizers see fit, a routine check of the submission history and similarity reports would settle the question either way. I'd also welcome comments from anyone who solved F quickly and can say whether the approach is straightforward.

Thanks for reading.

  • Проголосовать: нравится
  • 0
  • Проголосовать: не нравится