dreadolisk's blog

By dreadolisk, history, 13 months ago, In English

Salam Codeforces!

Team A² is glad to invite you all to the second contest in the STEM Avengers series of contests, STEM Avengers: Age of Algorithms, which will start on 26.10.2025 12:45 (Московское время). You will be given 7 Problems and 2 hours to solve them.

All the problems are written and prepared by me (Abdur-Rehman), M_AsadHussain, and JonKhan.

This contest is going to be an Avengers themed contest, with the problems being named and themed after Avengers Phase II movies. Now that the STEM Avengers have assembled, let's get to algorithmic fights!

The round will be rated in the A² rating system and will be held on extended ICPC rules. After the contest, your code will be tested manually (and may get hacked or skipped). The difficulty would be comparable to Div. 3/4. The problems will be partially sorted by difficulty. The problems include a wide variety of topics — from Combinatorics and Greedy Arrays to Number Theory and Graph Theory!

Join Our Group

Contest Gym

We would like to give our sincere thanks to:

  • AbdullahIshfaq for his amazing coordination and problem proposal.

  • Hayan for his coordination (telling us to talk to AbdullahIshfaq) and testing.

  • MikeMirzayanov and KAN for making and maintaining the wonderful codeforces and polygon platforms.

  • You for participating in our contest. ‎ ‎ ‎ ‎

‎

What we imagine our participants might look like.

What we imagine our participants might look like.

UPD 1:

Final Standings are out, Click Here to view them.

Congratulations to the winners

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

| Write comment?
»
13 months ago, hide # |
 
Vote: I like it 0 Vote: I do not like it

Well, I didn't do much coordination, but still, I can assure you that the problems are great and you will enjoy the round.

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

Seems cool waiting for it but have one question The round will be rated in the A² rating system Could someone explain a bit more about how this works?

»
13 months ago, hide # |
 
Vote: I like it +1 Vote: I do not like it

As a participant hope that the problem are interesting!

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

Shouldn't registering the contest be available a few days before the contest, NOT the same time as the contest?

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

As a participant, hoping for quality problems

»
12 months ago, hide # |
 
Vote: I like it +1 Vote: I do not like it
  • »
    »
    12 months ago, hide # ^ |
     
    Vote: I like it 0 Vote: I do not like it

    Actually that problem was given by e and I am the only one who knows the solution so tell me how much have you done!

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

      Usually, in these types of questions, sieve is applied. I can't think further.

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

      For problem G, I have implemented my solution.

      My submission: 354518484

      But, getting wrong answer on test 2.

      Can you please share test 2, for debugging. Tests other than test 1 are not visible (even partially).

      My solution:

      Spoiler
      • »
        »
        »
        »
        11 months ago, hide # ^ |
         
        Vote: I like it 0 Vote: I do not like it

        My Solution is to iterate through the graph and check if cycle formed the check if its a prime using sieve and then put it inside a map then check in log(m) time that if desired GCD is in the map.

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

In 642756F - Stabilizing the Overloaded Stones, in example testcase 3, k = 3, we can't convert 67 into 17. Why is the answer $$$1$$$ for 3rd index