We invite you to participate in CodeChef’s Starters115, this Wednesday, 3rd January, rated for All.
Time: 8:00 PM — 10:30 PM IST
Joining us on the problem setting panel are:
Setters: Shreyan Dominater069 Ray, Aditya Everule Jain, Satyam satyam343 Kumar Roy
Tester: Mridul MridulAhi Ahi
Statement Verifier: Kanhaiya notsoloud1 Mohan
Text Editorialists: Nishank IceKnight1093 Suresh.
- Contest Admin : Shreyan Dominater069 Ray
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.
All problems except 2 are made by me. Hope you find them interesting, but constructive criticism is also appreciated. There will be a total of 11 problems, out of which 7 will be scoreable for division 1 and 8 scoreable problems for every other division.
Hope to see you participating. Good Luck!
UPD : The contest got extended by 30minutes to a total of 2.5hours.
Dominater dominating cc round setting
Hope this one is not guessforces and edgecaseforces like the previous one.
not that last round was bad or anything, but this round is definitely high quality
Dominater069 shared with me some of his problems in this round and they are great... Recommend to participate!
As a gray tester, some of the problems really scared me.
As a green setter, i was scared to set them too.
Thank you Dominater069 for reminding me, I was just about to take part in some competition )
MridulAhi orz tester
MridulAhi orz tester
MridulAhi orz tester
MridulAhi orz tester
MridulAhi orz tester
MridulAhi orz tester
MridulAhi orz tester
MridulAhi orz tester
MridulAhi orz tester
MridulAhi orz tester
MridulAhi orz tester
MridulAhi orz tester
MridulAhi orz tester
MridulAhi orz tester
MridulAhi orz tester
MridulAhi orz tester
orz tester
This Contest is also termed as (Hello 2024) on Codechef.
For many of us, this was a very exciting moment where we would potentially get to write a contest with beautiful and interesting problems.
For Dominater069, however, it was a Wednesday.
Please try to add more sample test cases if possible. Like in last contests chef and tag problem i wasted a lot of time as i missed the point that we cannot tag in leaf Node which wouldn’t have happened if a simple sample like 1-0 would have been added
i know it’s my skill issues but still
Auto comment: topic has been updated by Dominater069 (previous revision, new revision, compare).
I hope to become green in this round
I hope to become cyan in this round
pupil making contest XD
I tried my best
I will try my best in contest :(
Hoping the problem will be well-cooked with right amount of spiciness.
Contest starting in little under an hour. Hope to see you participating and best of luck. Do read and try atleast the next couple of problems.
is it only me who cannot view problems yet?
me too but people are making submissions
I switched to Chrome from Safari , then worked
This apart, problems were pretty nice. Dominater069 orz.
Hello, I hope you liked the problemset, do leave your feedbacks.
fun problems i enjoyed the contest
problems were nicely explained and easy to understand.
Thanks
It was really fun. "Subtraction Subsequence I" was just amazing! (wasn't able to solve II :( ).
Problems were really cool! Great job authors!
SUBSEQ1 and SUBSEQ2 are great! thanks for the problemset!
I liked COUNTISFUN10 and SUBSEQII, thanks! Perhaps even better if modulos in the a contest are the same.
By the way what should I do to keep hiding Live Ratings Graph after refreshing the page?
Glad that you liked COUNTISFUN10
Thanks for the feedback! We'll try to make the Live Ratings Graph section minimization / maximization 'sticky' through refreshes.
i always try to keep 10^9 + 7, COUNTISFUN10 was already prepared with a different modulo by a different author, so i did not change it
I always try to keep 998244353 xD
why tls so tight? i cry ;-;
btw which TL was tight? i kept most TLs quite loose from intended solution, except for COUNTISFUN (only a 2.5x or so) but that didnt have TLE issues
Subseq1 ;-; Due to a deficit in my IQ I was using segtree with a complexity of nlognlogn which tls. Later when I did it without segtree it gets ac
can you please explain your soln. i also think of a soln using binary search with range min and rang sum query but then i realized binary search won't work.
i think -i am also on the same way ,why binary search will not work with lazy seg assuming no tles??
fist let me explain why i'am using binary search. for a segment i .. n — 1 i'am finding j such that sum(i..j) > minele(j + 1..n — 1) but then i realize it's not monotonic.
Is Binary Grid Forces DSU?
It's just some implementation and finding a nCr.
problemset was really cool..... after so long I enjoyed participating in codechef contest !
In Problem Binary Grid Forces
Which sequence of operations will form
S1as10011.Please pay $$$5,000*\text{The no of users who converted from free tire to paid tier plus Russian GST}$$$ in rupees as using codeforces blog post for commercial use
As a Div 4 participant, I really liked the problemset!