We invite you to participate in CodeChef’s Starters145, this Wednesday, 31st July, rated till 6-Stars(ie. for users with rating < 2500).
Time: 8:00 PM — 10:00 PM IST
Joining us on the problem setting panel are:
Setters: Archit Pols_Agyi_Pols, Mihir BladeRunner Kaskhedikar, Piyush piyush_pransukhka Pransukhka, MD. SHIBLY RAHMAN AlveRahman ALVE, Roronoa MonoLith Zoro, Vaibhav kingmessi Khater.
Tester: Vaibhav kingmessi Khater.
Text Editorialists:Nishank IceKnight1093 Suresh.
Statement Verifier:Nishank IceKnight1093 Suresh.
Contest Admin :Archit Pols_Agyi_Pols, Nishank IceKnight1093 Suresh.
Written editorials will be available for all on discuss.codechef.com. Pro users can find the editorials directly on the problem pages after the contest. The video editorials of the problems will be available only to Pro users.
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!
Waiting for comment of nskybytskyi on the problem TOKTREE.
Waiting for comment of Savior-of-Cross on c++ 23.
It's nskybytskyi now ehe
Today's problems were actually interesting! Thank you :)
Waiting for rating update ;)
I misunderstood something. Don't want others to confuse
For bits of X that are not set, you can not change those bits in A[i]. So, you should find the highest set bit in X that satisfies the condition.
Thanks got it
Math and strings,they always kill me
very nice contest, square string was very fun to solve