We invite you to participate in CodeChef’s Starters 20, this Wednesday, 15th December, rated for Div 3 coders.
Time: 8 PM — 11 PM IST
Joining me on the problem setting panel are:
Setters: Utkarsh Utkarsh.25dec Gupta, Akshit akshitm16 Monga, Manuj DarkSparkle Nanthan, Ansh unknown0711 Gupta, Srikkanth srikkanthr R, Nishan Retarded_Ape Singh, Aryan Aggu_01000101 Agarwala
Testers: Aryan aryanc403 C
Statement Verifier: Nishank IceKnight1093 S
Editorialist: Ajit ajit Sharma
Contest Admin: Utkarsh Utkarsh.25dec Gupta, Daanish Mahajan
The video editorials of the problems will be available on our YouTube channel as soon as the contest ends. Subscribe to get notifications about our new editorials.
Also, if you have some original and engaging problem ideas, and you’re interested in them being used in CodeChef's contests, you can share them here.
Hope to see you participating.
Good Luck!
Can someone give me hints for Finding Pairs?
https://www.codechef.com/START20A/problems/VKMPAIRS
Overall a nice problem set, I liked Weird values and Brutal XORs problem.
Let A[i] be x and A[i] xor B[j] be y .
So (x*y)%p=1%p
Since y<p , so y=(x^(-1))%p
y=(x^(-1))%pWhat is this rule called ?Multiply both sides by x^(-1) ,
(y*x*(x^(-1)))%p=(x^(-1))%p