Comments
0

How to think of problems such as C ??

0

E was such a beautiful Problem..
0

How do you solve the bonus for D..
-9

Another AI slop

0

Found B1 to be a beautiful problem...loved the math
0

Can someone explain how to solve D1? Using trees
0

My dumbass cant think of using binary search in D..I dont know what to do now
0

B was really a great problem..
0

Yeah C is a traditional greedy problem..Just 2-3 observations..
0

Solved ABC but looking at the ranking i think i should practice hard to go for D next time..Overall i enjoyed the contest...
0

Hope i can solve ABC

0

Its been 3 years
0

Ok I got it..thanks

0

In the optimised version, why did you mutliplied by Spf[i]+1 and found the answer for M! but then divided again by that spf[i]+1 to find the answer for A[i]*M!..or did u do that to teach the concept of division modulo operator
0

nice Explaination Bro..
0

Thanks for the contest and i really liked the problems..Need to work more on my number theory
0

As a participant I am really excited as this will be my contest after a long time..
0

Can anyone tell me why my code is giving runtime error 338645166 I am checking for out of bound in the loop but still giving error. On my compiler it is giving correct answer but cf judge is giving runtime error

+3

mine too..
0

yaa this was the testcase..how did u figured it out?
+1

Okay wrong answer on testcase 19..lol
0

He is a cheater..
0

Super fast editorial... Thanks for the contest.loved problem F and happy to solve in the contest
On weird3 → Weird became Pupil, 13 months ago
0

just look at his code and you will find out how much he has written. These people cheats from LLM and then boast on blog..