Contest Based on Brain Craft Intra SUST Programming Contest 2023

Hello, Codeforces!

The flagship contest of SUST is here everyone! There will be 12 problems and the problemset is based on Brain Craft Intra SUST Programming Contest 2023. We cordially invite you to participate in this contest. Also, we encourage you to participate as teams. Please make sure that you read ALL the problems!

The contest will be held on Friday, April 7, 2023 at 08:05UTC and will run for 5 hours.

The setters of this contest are: Alfeh, Kawchar85, Mac_prime, magic_kiri, nh_nayeem, Raiden, ShikariSohan, ShinnirKolaChori, susmoydhar7, Tahseen

Contest link: Contest Based on Brain Craft Intra SUST Programming Contest 2023

UPD: Congratulations to the winners of the round!

Top 5 of all participants:

Participants who sent the first correct solution to the problems:

UPD2:

Solutions

104283A - Yet Another Short Statement
ideas: Kawchar85
prepared: steinum

104283B - Johny English and Group Formation
ideas: Raiden
prepared: Raiden

104283C - Johnny English Strikes Again
ideas: Raiden
prepared: Raiden

104283D - Search For Beauty
ideas: Kawchar85
prepared: Kawchar85

104283E - Tree query with update
ideas: Alfeh
prepared: Alfeh

104283F - Find GCD
ideas: Kawchar85
prepared: Kawchar85

104283G - Another Tree Query
ideas: Alfeh
prepared: Alfeh

104283H - Sequential Nim
ideas: Kawchar85
prepared: Kawchar85

104283I - The Secret Key
ideas: Kawchar85
prepared: Kawchar85

104283J - Magic Balls
ideas: Raiden
prepared: Raiden

104283K - Special Lattice Path
ideas: magic_kiri
prepared: steinum

104283L - Ultimate Game
ideas: ShinnirKolaChori
prepared: Raiden

• 39 hours ago, # ^ | who knows! you might packet the set within 4hour! see you at standing :D

  • 30 hours ago, # ^ | Thanks for contest.

• 32 hours ago, # ^ | ← Rev. 3 →   0 I think you mean T*div(max(A,B)), where T is number of testcases. My solution using long long initially TLed but passed using fast io.

  • 32 hours ago, # ^ | Yes, thanks. Idk, I had even fast io, still I had hard time getting AC.

• 32 hours ago, # ^ | Can you share the solution of tree query problem both E and G

• 32 hours ago, # ^ | ← Rev. 2 →   0

• 14 hours ago, # ^ | approach pls

  • 13 hours ago, # ^ | should be the divisor of . You can check all divisors of . You need to be careful when and . In that case, answer is .

    • 13 hours ago, # ^ | did same but was getting WA

    • 11 hours ago, # ^ | ← Rev. 3 →   0 Do same thing but got TLE please help me satyam343

  • 8 hours ago, # ^ | In addition to what @satyam343 has said, you have to handle cases when either A or B is equal to its remainder or less than its remainder.

• 32 hours ago, # ^ | How to do G , Any hint??

  • 32 hours ago, # ^ | Suppose you have two components, and you know the endpoints of a diameter for both. Suppose [P1, P2] is a diameter of the first component, [Q1, Q2] is a diameter of the second component. After merging these two components, the resulting diameter will have endpoints among [P1, P2, Q1, Q2]. We can check all these distances in logarithmic time using LCA, and update the diameter accordingly

    • 32 hours ago, # ^ | Can you please share your solution. It is difficult for me to understand. by seeing code and what you say , I can interpret the idea behind the solution I will be vey thankful to you.

      • • 32 hours ago, # ^ | we can not see the submissions, you can paste in ideone then i am able to see

          • 32 hours ago, # ^ | Go to common standings, double click on any AC cell in that particular task, you'll be able to see it

            • 32 hours ago, # ^ | they restricted the submission

            • 31 hour(s) ago, # ^ | you have permission to see only the solved problem solution.

              • 31 hour(s) ago, # ^ | those question which i have solved why we see them again :)))))

              • 31 hour(s) ago, # ^ | because you have many things to learn from other's solution :| @Snapper_001

      • 31 hour(s) ago, # ^ | here is Chimpanzee's solution on ideone

        • 26 hours ago, # ^ | Thanks bro for the solution

    • 27 hours ago, # ^ | I see your code , i am getting some idea. Actually you are merging and keep track of diameter end point of these two components and we have our full tree also which give us distance so we can figure out the new diameter end point. Thanks for your solution

• 32 hours ago, # ^ | instead of binary search you can just walk on dp table. again if you take a smaller number for any position, you can save the state for all test case

• 32 hours ago, # ^ | afiak there is no option to do that.

• • 31 hour(s) ago, # ^ |

• 11 hours ago, # ^ | Fermat's little theorem follow this link

  • 11 hours ago, # ^ | ← Rev. 2 →   0