Hi! I'm new here, and I don't really understand hacks, what they are, how to hack, what to hack, who is the defender, what does he do, how to become one, etc. Simply said, I know nothing about hacks! Welcome to codeforces :) hacking is to give a testcase that makes a solut...
is this really an actual hacking attempt? why it seems fake to me? I may be wrong, correct me if i am. i have many more screenshot of previous contests, which have the similar pattern of hacking. Hack Code:  Hack Test Case:  was held. And I liked it! Problems were very nice and interesting. But one thing happened, that is still on my mind. My B got FST (Failed System Tests). For those unfamiliar with this system, I'll explain it to you. When...
Honestly, simulating algorithms is a time-consuming and thankless approach. Once you make a small mistake in hundreds of lines of code but fail to find it, or even didn't plan to find any because you have passed the sample, then you are all done....
But do you think someone may intentionally leave a “landmine” for others to hack, and give himself/herself a chance to lose5050points? Anyone knows it’s impossible. And see the rating of the defender: Newbie. I’m not discriminating against Newbies (since so am I), but this is one ...
Recently in the div 4 contest (Codeforces Round 964 (Div. 4)), I tried to hack some people's problem E solution, and I find some strange things. In problem E, the solution should be like this : 1. for all x from 1 to 2e5, precompute the number of operations needed for x to ...
The first result on google is this https://codeforces.com/blog/entry/6249 → Reply AliArapov221 21 month(s) ago, # | +8 Basically, when people hack another people's submissions, server keeps hacking tests, so they will test them after contest to every submission. It was made ...
What is Div.1+Div.2? Is it a round to choose from Div.1 and Div.2 or a round with difficulty Div.2A to Div.1F? I have rating 675675 and contribution −103−103. Can I take part in this round? Also, is hack avaliable?
In short, I have a vector<vector<int>>a(n); The sort function is sort(a.begin(),a.end(),[&](autoa1,autoa2){return(a1.back()<a2.back());}); Instead of sorting, create a map to store the position of albums with each maximum coolnesspass ...