Hello dear CodeForces community!

I was solving this problem and submitted a solution, which should pass all sample tests. However, it is falling on the second test, where answer is 4. Everything is ok on my local machine, but for some reason it is returning 1 on CodeForces.

Next, I went to run the code and see my output on Custom Test. For GNU G++20 13.2(64 bit, winlibs) my output is 1.

But for GNU G++17 I am getting the correct answer!

So, I decided to submit my solution on using C++17, but still getting 1. Very strange.

Please, if you know what is happening, can you help me?

My submission with C++20: Click

My submission with C++17: Click

Good morning/afternoon/evening/night dear codeforces community!

I have been learning Go language to start developing in Back-end, so I decided to practice it by solving simple problems from codeforces. However, I am facing a problem in this problem. Initially I implemented sorting by my own comparator to sort the paired(implemented via struct) array. However I got TLE. After that, I implemented merge sort by my own, and even after this I got TLE again. I thought that problem was in binary seacrh(maybe I write something wrong), so I replaced it with two-pointers method. Unfortunately I got TLE again. Can you tell me, is it possible to get "Accepted" in this problem using Golang?

The final version of code is right here -> https://mirror.codeforces.com/problemset/submission/580/226466440

Thanks for your consideration.

Hello everyone, I wanted to solve some hard problems, but c2-ladder is not working. Does anyone know why??

Thanks for your consideration.

Hello codeforces community! I am on my way to reach CM again, and I think that I have to solve constructive problems faster than usual. Can you give me an advice how to solve such uncomfortable problems fast enough in contests. I know that most of you will say to practice more, I can do it by myself. I am just asking, if you have any source of such problems?

Thanks for your consideration.

Добрый день codeforces! Решал я задачу с atcoder и сделал следующее предположение. Если $$$(b - a)*b$$$ $$$\gt$$$ $$$(x - y) * y$$$, то выполняется следующее условие $$$C_{a}^b$$$ $$$\gt$$$ $$$C_{x}^y$$$. Самое интересное то, что оно оказалось правильной или же тесты слабые. Можете помочь доказать, правильность данного утверждения?

Решал я 463C - Gargari and Bishops, отправлял решение с cin(конечно использовал ios_base), но оно не проходило 10 тест(Код возврата -1). Решил написать scanf, printf вместо cin, cout и задача прошла. Различие в кодах нету, только вместо cin, cout написал scanf, printf. Почему так??? Решение с cin, cout -> 111551516 Решение с scanf, printf -> 111551392