Greetings CodeForces!
GeekHaven — the Technical Club of IIIT Allahabad is excited to invite you to CodeGuerra, a flagship event within OpenCode — a month-long open-source event hosted by students at IIIT Allahabad.
The contest will take place on December 22, 2023, at 20:00 IST.
Many thanks to all the people who made this round possible:
- The problems were authored and prepared by pvtr, shekharh433, Fremder, NirbhayPaliwal and me.
- 18o3, Ishaan_23, ALESTA, LaVa_ and coding_monk3 for testing and providing detailed feedback.
You will be given 7 problems and 2 hours and 15 minutes to solve them. The difficulty of the round will closely resemble Div. 3, 4 rounds.
We hope you will enjoy the contest!
UPD: Editorial is out
22
very much excited, #IIITA
Excited for this one!! agrim07 thanks for inviting.
Lets go !!
Looking forward!!
Congratulations! I Hope there will be many contests ahead organised by this team☺️
Looking forward to giving this contest!
Is this rated or just?
No it's not rated
Excited !!
Excited !!
As a tester i think all of the problems are very nice and you will definitely learn something from all of them .
ALESTA sir orz
very excited for this :D
:tamil:
pvtr aiyo
Excited and looking forward to give the contest
Excited
any registration link?
You will be able to register 6 hours before the start of the contest using this link
Thanks for inviting us. Hopefull to get a good rank
so there are no prizes whatsoever ?
Excited
Excited!!!
excited for this contest
enjoyed solving problems A to E , thanks for the contest
what was the approach for problem C ??
for f(i) = f(i — 1) + f(i — 2) we can see that, whenever i is odd, the parity of f(i) is odd, just try out some examples you will figure it out.
Now for g(i) = count(f(i), 1) — count(f(i), 0), we can see that whenever i % 3 = 2, the parity of g(i) is even, else parity of g(i) is odd, try out some examples.
It is also easy to prove the above pattern.
Hope it helps.
Numbers that are congruent to {1, 2, 3} mod 6
What would be the approach for the problem E i tried binary search + two pointers but not get it can someone tell
Think of prefix or suffix array.
I told E not D
E was similar to this question https://www.codechef.com/problems/CHANDWEIGHT
yes the whole concept of question is same
I was getting wrong answer on test2 for D.
My approach: Obtain a new string by adding the substrings from index (0 to l-1) and (r to last-1). Now check if str is a substring of this new string.
Here is my code , can you help where i am wrong...
Please read the question one more time. We need to search if there is subsequence of string s(0..l-1) + s(r + 1, ... n — 1), equals to str, not substring of s(0..l-1) + s(r + 1, ... n — 1).
Got it. Thanks !