What a chad, I'd love to have your discipline

LOL don't worry about it, happens to the best of us.

Yes but when your code gets a TLE verdict and for example the limit for that specific problem is 2500ms it'd just say "2500ms" on your Time section, not 2612ms or something like that.

How so? If you tried to use the codeforces judge it'd only tell you that you got a TLE, not the exact time your code took, correct?

Yeah but then you wouldn't really know unless you test your code on the same hardware and tests

I think you're too much of a truth speaker dawg might want to chill out

Then reused

Stolen comment

Go through the bits of n, let's say you're at bit x, if the bit is a 0 then check if m >= 2^x — (the number represented by the binary expression before bit x) or if x is not greater than the most significant bit of n then you can also check if m >= (the number represented by the binary expression before bit x).

263459449

Yep, if there's not a huge chance of collision then you can mostly ignore it

Honestly, don't know how I didn't realize that the LCM on C could be bounded that easily, I guess we have good and bad days

If you actually read the two problems you'd see that they are different, the problem you linked is bounded with a given integer K for the amount of subarrays, whilst in the problem C from today's contest, we aren't bounded at all.

Crazy, you still used it in a contest but just changed the min to max bruh

They didn't even bother to solve their own unbalanced problems lol (joke)

Honestly, in situations like these I just read all of the problem statements, and thankfully C was a casework problem so I just put an hour into it and solved it, if you really want to become cyan I'd recommend you wait for div.3 rounds.

Please, either get better at balancing problems or don't host contests at all. This is the 2nd time this has happened.

You beat me to it lol, I remembered this as well and was pretty surprised when it worked after I submitted it.

I'm honestly really annoyed at this, can someone see what's wrong with my code because I've been trying to debug this for the last 20 minutes.

Submission

Chill out we're joking around, you gotta have fun sometimes as well

But I don't want tooooo :((((

Because yes

Impossible

Why are y'all downvoting the guy???

ok

Thanks for this, I really need to get better at dp lol-

My approach was basically keep track of every number from 1 to 50 and what sets they were in, you only need a set of length 1 less than the union of all sets so you search through every number from 1 to 50 and decrement the nubmers the sets they're in and check if it's the max, sorry if it's a bit confusing lol this is was kind of a more difficult implementation problem.

Same lol, sad it had to be one of my best performing rounds yet.

Well that's just an obstacle you have to overcome, there's really nothing more to it, it's just practice and more practice, after around 50 — 100 problems you'll be well on your way to becoming pupil, I can see you're pretty close, so just keep participating in these upcoming contests and you'll do fine

You're definitely a troll lol, I don't see why you'd need all of those algorithms when you're just starting out though, the first thing you should get down is math and logical patterns, then you should start learning more complex algorithms, as for data structures they are quite important so you should probably get used to many of those

There's no way you're serious bruh this blog looks fake for some reason

Thank you!! :)) Hoping you soon get to it as well!

bruh