Hello Codeforces!
Greetings from the IIIT Vadodara Coding Club!
First of all, our sincere apologies for the inconvenience caused during the last contest(Code Clash) organized by us.
We are thrilled to announce that our annual tech fest, CEREBRO, will feature an exhilarating programming event: Cook-A-Code! This contest will be conducted on Codeforces.
Event Name: Cook-A-Code
Participation type: Team participation only. You have to form a team in the codeforces and use that team while registering to the contest. You can do so from the profile section.
Date and Time: Friday, November 15, 2024 at 21:00 IST.
Contest Duration: 3 hours.
Contest Link: here :)
Registration Link: Register on Unstop here. (Registration is required in order to enter the contest and be eligible for rewards).
Prize Pool worth of ₹21,000+
Only teams comprised of Indian University Students are eligible to receive prizes. And all the team members must belong to the same University for the eligibility of the prizes.
Problemsetters: reshwanthind, darsh9510, omdixit2107, sharma_kartik, JEETJANI, ajayjain12, Padmnabhuno.
Testers: vijay_katari23, drizzle_codes, MayankSavaliya, Pal_J, Darshil
Join us for this team-based coding competition designed to challenge your problem-solving skills with ICPC-style challenges and engaging problems. Compete to aim for the prizes on the leaderboard!
See you all on the leaderboard!
Happy Coding!
UPD: Contest link has been updated UPD: Contest registration has now started.
The day before India ICPC Prelims?
would be nice practice though
As a Setter , the round is gonna be fun for you all :)
Are registration opening again or not ?
Registrations are now open till November 15, 2024 21:00 IST.
contest is not opening from registered mail id
CookQueue A CodeAs a participant, I could solve only 4 problems. Can anyone brief their approach to E?
it can be solved using Grundy number
First precompute prime_fact_count using sieve
Then precompute Grundy till 1e6 since a[i] can go upto 1e6
Then for each testcase if xor_sum of Grundy[a[i]] ==0 then bob else alice
Okay, I need to learn this. Thanks a lot!
can anyone explain how to solve c , my idea was to use dp, but it gave WA.and also if possible please make other users solutions visible
I solved it using dp only. Let dp[Y] equals maximum length of consecutive elements having endpoints as Y . So our answer is max dp[Y] for all 1<=Y<=1e6+1 . Transistions are pretty trivial as well. Only issue is we can't check all points from 1 to 1e6+1 .But this can be optimised as our point of concerns are only a[i] and a[i]+1.