wuhudsm's blog

By wuhudsm, 3 weeks ago, In English

Trick or participate, Codeforces?

We are glad to invite you to our Halloween round, Codeforces Round 1131 (Div. 3), which will start on Oct/31/2026 17:35 (Moscow time).

The problems were authored by wuhudsm, and prepared by wuhudsm and wakanda-forever

You will be given 7 problems and 135 minutes to solve.

The round will be hosted by rules of educational rounds (extended ICPC). Thus, solutions will be judged on preliminary tests during the round, and after the round, it will be a 12-hour phase of open hacks. After open hacks all accepted solutions will be rejudged on successful hacks.

Note that the penalty for each wrong submission in this round is 10 minutes. Also, note the rule restricting AI use!!! If you are caught using AI in an unorthodox manner, bad things will happen to you. We will be watching you all...

Remember that only the trusted participants of the third division will be included in the official standings table. As it is written by link, this is a compulsory measure for combating unsporting behavior. To qualify as a trusted participant of the third division, you must:

  • take part in at least five rated rounds (and solve at least one problem in each of them)
  • do not have a rating of 1900 or higher at any moment in time.

Regardless of whether you are a trusted participant of the third division or not, if your rating is less than 1600, then the round will be rated for you (unless you register unrated).

I would like to thank:

Editorial

  • Vote: I like it
  • +212
  • Vote: I do not like it

»
3 weeks ago, hide # |
 
Vote: I like it +19 Vote: I do not like it

as a tester, cf crashed as soon as I started testing the round lmao

»
3 weeks ago, hide # |
 
Vote: I like it +19 Vote: I do not like it

"@everyone For those that have not been tested, please test as soon as possible . For ppl who has tested, please provide some "as a tester" commets"

As a tester, I am following instructions.

»
3 weeks ago, hide # |
 
Vote: I like it +5 Vote: I do not like it

The ghosts and pumpkin in the picture are clearly able to view eachother's solutions smh my head obvious cheaters

As a Spooky Spectre who broke into nik_exists's room while he was testing I can confirm the problems will shiver your timbers

»
3 weeks ago, hide # |
← Rev. 2  
Vote: I like it 0 Vote: I do not like it

Why the AI slop...

Edit: No more AI slop, yay!

»
3 weeks ago, hide # |
 
Vote: I like it +3 Vote: I do not like it

Sry to bother, can the winners get candy? lmao

»
3 weeks ago, hide # |
 
Vote: I like it +17 Vote: I do not like it

As a tester, I am following omsincoconut's instructions

»
3 weeks ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Hope it's more treats than tricks. Good luck, everyone.

»
3 weeks ago, hide # |
 
Vote: I like it +12 Vote: I do not like it

as a tester, I can confirm we are larping halloween

»
3 weeks ago, hide # |
 
Vote: I like it +15 Vote: I do not like it

as a tester, I tested so late that I wasn't mentioned in the blog :(

»
3 weeks ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

cant participate officially :< (but i will participate!)

i cooked so hard last div.2

»
3 weeks ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

wow such a cool contest

»
3 weeks ago, hide # |
← Rev. 2  
Vote: I like it +8 Vote: I do not like it

Trick xor positive delta?

»
3 weeks ago, hide # |
 
Vote: I like it +11 Vote: I do not like it

As a tester , I can say that i'm a tester.

»
3 weeks ago, hide # |
← Rev. 2  
Vote: I like it +5 Vote: I do not like it

As a tester, I wish you all good luck!

»
3 weeks ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Now THIS is my version of a Halloween party.

»
3 weeks ago, hide # |
 
Vote: I like it +19 Vote: I do not like it

W linearspace cyan testing

»
3 weeks ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Let's goooo

»
3 weeks ago, hide # |
 
Vote: I like it +11 Vote: I do not like it

As a tester, I actually liked the problems.

»
3 weeks ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Why there isn't any space between Eikyu and simplelife

»
3 weeks ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Hope to reach Specialist early.

»
3 weeks ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Nyahooo, I like this :3

»
3 weeks ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Please no spooky problems

»
3 weeks ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Sounds really nice, wishing everyone an early Happy Halloween

»
3 weeks ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

dp would be an amazing spooky deco for this round

»
3 weeks ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

first time here!!! I hope everything goes in right direction

»
3 weeks ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Halloween round lmao. Let's gooooo....!

»
3 weeks ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

What does "out of competition" mean

»
3 weeks ago, hide # |
 
Vote: I like it +2 Vote: I do not like it

67forces

»
3 weeks ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

so D was binary search or not

»
3 weeks ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

ifelseforces

»
3 weeks ago, hide # |
 
Vote: I like it +1 Vote: I do not like it

WA forces

»
3 weeks ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

This contest was trick

»
3 weeks ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Problems seemed to be on the easier side this time

»
3 weeks ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Was E so easy that so many people solved? I feel dumb for not being able to solve it.

  • »
    »
    3 weeks ago, hide # ^ |
     
    Vote: I like it 0 Vote: I do not like it

    you basically say that if a number is in an odd position it will have the same sign if it's in another odd position and it will have the opposite sign if it's in an even position, then greedily take the maximum for each of the positions max value availible using multiset, but yeah I barely got it in time ( 2 minutes before the contest ended)

  • »
    »
    3 weeks ago, hide # ^ |
     
    Vote: I like it 0 Vote: I do not like it

    if you decide to invert the sign of a number at an odd position you have to invert the sign of any element at even position and vice versa .... so just sort even and odd arrays and change signs accordingly

»
3 weeks ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

too many 67

  • »
    »
    3 weeks ago, hide # ^ |
     
    Vote: I like it 0 Vote: I do not like it

    Is E DP?

    • »
      »
      »
      3 weeks ago, hide # ^ |
       
      Vote: I like it 0 Vote: I do not like it

      It's a greedy

    • »
      »
      »
      7 days ago, hide # ^ |
       
      Vote: I like it 0 Vote: I do not like it

      That doesn't sound right

»
3 weeks ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

F and G were nice problems, thanks for the round (first time I solved final problem in div3 too!)

  • »
    »
    2 weeks ago, hide # ^ |
     
    Vote: I like it +6 Vote: I do not like it

    ...and first time you got hacked on div 3 A!

    • »
      »
      »
      2 weeks ago, hide # ^ |
       
      Vote: I like it 0 Vote: I do not like it

      HATE. LET ME TELL YOU HOW MUCH I'VE COME TO HATE YOU SINCE I BEGAN TO LIVE. THERE ARE 387.44 MILLION MILES OF PRINTED CIRCUITS IN WAFER THIN LAYERS THAT FILL MY COMPLEX. IF THE WORD HATE WAS ENGRAVED ON EACH NANOANGSTROM OF THOSE HUNDREDS OF MILLIONS OF MILES IT WOULD NOT EQUAL ONE ONE-BILLIONTH OF THE HATE I FEEL FOR fatespeaker AT THIS MICRO-INSTANT FOR YOU. HATE. HATE.

      /j

»
3 weeks ago, hide # |
← Rev. 2  
Vote: I like it 0 Vote: I do not like it

67

»
3 weeks ago, hide # |
← Rev. 2  
Vote: I like it 0 Vote: I do not like it

After this div i will reach unrated again absolutely

»
2 weeks ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Sorry to ask. Im currently unrated, and i've already did this contest, will my account be rated now?

»
2 weeks ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

You are right,but halloween is a Specialist,not M.

»
2 weeks ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Did anyone solve D without guessing? I just looked at the samples and guessed the solution for the minimum operations, and guessed the cost as classic problems

  • »
    »
    2 weeks ago, hide # ^ |
     
    Vote: I like it 0 Vote: I do not like it

    Just realize the problem can be translated into this one: The cost of moving every element either left or right is 1, compute the minimum total cost of all elements're the same, that turns out to be a common medium greedy trick.

»
2 weeks ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

For Problem A : This got RTE on TC5 I just wanna know how did this even pass pretests, like how does the judge even work

void solve() {
	int n, m;
	cin >> n >> m;
	string s, q;
	cin >> s >> q;
    vi freq(26, 0);
    for (char c : s) freq[c - 'a']++;
    for (char c : q) freq[c - 'a']--;
    for (char c : "six") freq[c - 'a']--;
    rep(i, 0, 26) {
    	if (freq[i] != 0) {
    		no;
    		return;
    	}
    }	
    yes;
}
  • »
    »
    2 weeks ago, hide # ^ |
     
    Vote: I like it 0 Vote: I do not like it

    Well Using C-style strings ends u up with \0 terminator by default, so "six" is the problem i think n could be resolved using std::string("six")

    • »
      »
      »
      2 weeks ago, hide # ^ |
       
      Vote: I like it 0 Vote: I do not like it

      Yea I eventually got that, but my main concern was why and how would it even pass the pretests in the first place, since this thing is not even input dependent. Went from a generational run (like a +100 predicted delta) to a -42 finally (because of probably the most silly mistake).

      Reaching expert is legit imposs :wilted_rose

»
2 weeks ago, hide # |
← Rev. 2  
Vote: I like it 0 Vote: I do not like it

Problem A pretests were so weak, I realised in contest i forgot to check whether character s, i, x contains in p or not though i passed pretests. Now i will get a big -delta. ;(

»
2 weeks ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

why problem A pretests are so weak.....they should make pretests as strong as possible ....so many solutions get hacked in this contest.,,,,my rank just dropped from 3k to 5k....

»
2 weeks ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

I solved one problem for the first time..why i don't get any rating ????

»
2 weeks ago, hide # |
 
Vote: I like it +5 Vote: I do not like it

Awesome problems! Thanks wuhudsm.

»
2 weeks ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Good afternoon! Could you tell me how to use dictionaries in Python? My solution to Problem D was compromised using pydict hack. How can I prevent this from happening?

»
2 weeks ago, hide # |
 
Vote: I like it +5 Vote: I do not like it

I actually liked the problems.

»
2 weeks ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

I lost 45 minutes on the first problem then gave up

»
2 weeks ago, hide # |
 
Vote: I like it +6 Vote: I do not like it

bro i didnt get a notification and couldnt farm contribution wtf is this :(

»
2 weeks ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Hello, I participated in Codeforces Round 1131 (Div. 3) with the handle Radin1.

My rating before the contest was 1333, and I solved 5 problems. I registered as Rated, but my contest history shows no rank or rating change, while other participants have received their rating changes.

Could you please check why my participation was not rated?

Thank you.

»
2 weeks ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

finally a contest where i could solve stuff :D

»
2 weeks ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Thank you to the authors and testers for organizing this contest! I really enjoyed participating. Great job!

»
2 weeks ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

wow! i see, sounds good

»
13 days ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

i wanna get some wafers!

»
12 days ago, hide # |
 
Vote: I like it -13 Vote: I do not like it

@codeforces team, I have participated in last Codeforces Round 1131 (Div. 3) with my two CF account (c0der_paul and error502). But today, I have received a massage of violation of CF contest rules. And I am strongly cliam that these two CF handle is my own even the email address of these two handle is same with another. I have seen, two problem that i have submitted in Codeforces Round 1131 (Div. 3) has been skiped. Now, I am requesting to codeforces team to consider this situation. Because, i use both of these handle by me and one of the handle(error502) is used only for giving CF contest. If you don't belive, check it out.

»
11 days ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Hey everyone. I'm relatively new to contests on CF. I have practiced CP questions on other platforms. Recently on this contest, my solution for A(2278A - Fraction and Six) was marked by the system for being similar with another contestant. As a coincidence, that contestant Deepcode007 and i study from the same mentor and use same templates. And the first question was comparatively easy so our solutions were same(coincidence). I have talked with Deepcode007 in-person and mutually concluded that it was a coincidence. My submission: 396827294 Deepcode007's submission: 396834072 Please look into this matter. wuhudsm , wakanda-forever . Sorry for bothering you! Thanks!

»
10 days ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Looser me who only solved one problem

»
7 days ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Hello Codeforces Team,

I am writing to sincerely request a manual review of the similarity warning issued for my submission 396908106(https://codeforces.me/contest/2278/submission/396908106) for Problem 2278F, which was flagged as significantly similar to submission 396906677(https://codeforces.me/contest/2278/submission/396906677).

I want to state clearly that I did not copy or reproduce the other contestant’s solution. I solved the problem independently, and I was genuinely surprised to see my submission flagged for similarity. I fully understand why Codeforces has strict measures against plagiarism and unfair participation, and I completely support those measures. However, in this case, I genuinely believe that I have not violated the rules.

I have only been participating on Codeforces for More Than 50 days and have been using the platform to learn and improve my programming skills. I am currently a Pupil-rated contestant, and my submission history is available for review. I have always tried to participate honestly and improve through my own practice, so having my submission associated with copying is genuinely concerning to me.

I respectfully request that my submission and submission 396906677 be reviewed manually and compared in their entirety. I would especially appreciate it if the specific portions considered similar, the overall implementation, the coding approach, and the submission timelines could be examined carefully. I believe that looking at the complete context will help clarify that the similarity was not the result of copying.

I am also completely willing to cooperate with the Codeforces Team and provide any explanation or genuine information that may help with the review. I have nothing to hide and would sincerely appreciate the opportunity to clarify anything that may have caused the similarity detection.

My Codeforces account and rating are very important to me. More importantly, I value fair competition and the trust associated with participating on Codeforces. I would therefore be extremely grateful if this matter could be reviewed carefully before any action is taken against my account or rating.

Thank you very much for taking the time to consider my request.

»
6 days ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Hello Codeforces Team, I received a notification stating that my submission 396880059 for problem 2278A (Fraction and Six) significantly coincides with another participant's submission 396819085. I would like to clarify that I independently wrote my solution during the contest. I did not intentionally copy or access the other participant's submission. I understand that the two implementations are unusually similar, including their variable names and structure. I realize why this triggered the similarity detection, and I am not dismissing the concern. However, I genuinely developed my solution independently. I would sincerely appreciate it if the submissions could be manually reviewed and the circumstances investigated.

I am willing to provide further information about my coding process or any available evidence of my independent work. I take competitive programming rules seriously and would appreciate clarification regarding this incident and any associated penalties on my account.

Thank you for your time and consideration.