get rich or die trying

make it 132

[deleted]

Rating dynamics adds 0 contribution to probability overall. Maybe they quit codeforces for a long time and then returned with much more skills. It is suspicious, but you cant even count it as an evidence

Rating dynamics do not prove anything. Yes, it is different from the past, but it is not necessarily because they are cheating. It's because practicing on platforms other than CF has become more popular because of, well, CF cheaters.

About being skipped. AI traps are hidden everywhere now, and maybe the translation was different and causing the code to look like AI. So the probability of a code being AI if the statement is translated by AI is probably higher than you think

stop suspecting people of cheating for no reason! first, they might've practiced on another website, second, they could and probably did translate using AI (macaquedev confirmed it in cases you listed above), so they are not cheating as long as the translation doesnt violate the rules.

yes, the automatic anti-cheat is almost always accurate, but just if their solutions got skipped (even several times), doesnt mean theyre cheating. you cant be 100% sure.

Very cool, this really wraps up my profile, but it has 2 issues:

1. "Your favorite topics" No, implementation is NOT my favorite topic. You can change it to something like "Most solved topics" or something.

2. My biggest delta is shown as in my first contest (which is technically true, because your first contest grants you a ton of rating), but it isn't what you want to see. Maybe remove the first like 5 contests from this stat to make it more accurate.

Also, my suggestions:

1. My hardest problem solved shows as a 3500 (I upsolved it after reading the editorial), so maybe show the hardest problem you solved during a round (and of course, which round it was).

2. The "rating timeline" isn't readable, it looks like a random graph. I suggest adding labels to it.

Overall, it is really good! (also it's probably the only way to view banned users' stats lol)

I literally don't understand how people might even think that C/D is easier than B. B took me only 9 minutes, C took me 30 mins, and D took me over an hour. Sure, there might be some difference (I know combinatorics for B very well, C is just legit hard, and I was just stumbled on D), but not an hour long one...

The anti-cheat system is getting better though, a lot of cheaters were caught this round.

stop suspecting ppl, they might've practiced on other websites

AI finds nothing there so they can't be cheating

Div.1 is the hardest one, start with Div.4 a's they are obvious

I submitted a task, how do I know it is reviewed/accepted/rejected? (where will i see it on the proposals page?)

Congratulations!

'You solved 245 tasks (117 is 800 rated, 14 is 900 rated, but for your rating 1400 you solved 4 problems).' I was solving very many 800 problems back in the day, and now I'm not upsolving, so I'm only upsolving in rounds.

'you solved E: Idiot First Search. You made submissions in: Feb/15/2026 21:05UTC+5 C++, then Feb/15/2026 21:07UTC+5 Python.' This is because I got WA, fixed it in 2 mins, and accidently submitted it in another lang.

wdym "big bro"

Congrats brooo :)

43 :( I suck at math

Bro how do you know all of that?

Cuz I use Python for easy problems to code faster, and C++ for problems with more complex topics, such as graphs (because of recursion limits)

Thank you guys all! I'll surely keep going.

You can still do it in O(n) by precalcing the array a, where a[i] is a result of a process -- dividing a[i] by 2 while possible. It can be done with some sort of dp: if i is odd, a[i]=i, else a[i]=a[i/2]

will there be contest 2?

I participated in the last Div3, and I will just say that it was easier then usual (except for hacks on problems B and E).

I guess there are some cheaters, as always, but in general it's just people getting better at CP + rounds are easier idk

this post is close to 2026 upvotes

D1. Increments (easy version) Input: integers n, k (1 <= n, k <= 3) Output: an equation that consists of 1 integer k, some integers 1, and + symbol that is equal to n.

D2. Increments (hard version) The same, but n, k <= 20.

Sample: 5 2 Output: 2+1+1+1=5

actually, these should be H1 and H2

test results are crazy

omg its cool actually

WHAT THE HECK IT IS UNRATED

111110100000

Proof_by_QED orz sum orz

cry oworz

Okay, many thanks!

I liked this type of editorials. I want editorial like this for every round. aryanc403 orz

Maybe its not full schedule, maybe there will be a round between 3rd and 14th. But codeforces' ratio is 3 rounds/15 days, so I think no.

1,3,6

Mythic GM

Tysm!!

Thank you.

Did anyone note "coordinatORZ"?

Why my code 274894324 is getting WA on E? I did all exactly as in editorial

Hope to reach pupil after this (to solve >= 5 problems)

Announcement with a meme at the beginning? Something new... (for me)

ty for fast editorial)

Thanks for the fast text editorial! :D

Yes, just decrease your rating

I got 1010. It's beautiful like 888 :).

I am going to lose my 888... and get 999 or 1111. :P

B. Date

Input: no input

Output: the date of first div10 round in DDMMYYYY format.

omeganot will play hsr!

I use CLion by JetBrains. I love JetBrains IDE (PyCharm, IntelliJ Idea, CLion)

HAPPY NEW YEAR TO YOU ALL!!!

WE_NO_LONGER_LOVE_VALYA_WE_LOVE_SVETA

Happy New Year!!!!! 2023

AAwwoooo!! Cool drawing <3

Another one "thank you"...

Cool drawing, Heap_OverFlow!

you are cyan!!!

orz orz zhoukangyang orz

c0def0rces!