Greetings Codeforces Community!↵
↵
I hope you are healthy and staying indoors. I invite you to participate in **CoderFest 1.O** in collaboration with PSIT Kanpur, this Saturday, 15th May.↵
↵
- Time: 04:00 PM — 07:00 PM IST.↵
- Link: https://www.codechef.com/FEST2021↵
↵
The contest features 6 problems of varying difficulty and is 3 hours long. It will be served with some delicious partially graded problems (IOI-Style) — where you get a score for passing certain test data, along with the details of the failed test cases, if any :slight_smile:↵
↵
The problems in this round are prepared by [@codedreamer_dg](https://www.codechef.com/users/codedreamer_dg), [@sethhritik](https://www.codechef.com/users/sethhritik), [@hash16](https://www.codechef.com/users/hash16).↵
↵
Contact: [email protected]↵
↵
Huge thanks to entire CodeChef Team for their invaluable help and their great platform.↵
↵
Good Luck!↵
↵
Hope to see you participating!!↵
↵
Happy Programming!!↵
↵
PS: Editorial to the problems will be released soon after the contest ends.↵
↵
↵
I hope you are healthy and staying indoors. I invite you to participate in **CoderFest 1.O** in collaboration with PSIT Kanpur, this Saturday, 15th May.↵
↵
- Time: 04:00 PM — 07:00 PM IST.↵
- Link: https://www.codechef.com/FEST2021↵
↵
The contest features 6 problems of varying difficulty and is 3 hours long. It will be served with some delicious partially graded problems (IOI-Style) — where you get a score for passing certain test data, along with the details of the failed test cases, if any :slight_smile:↵
↵
The problems in this round are prepared by [@codedreamer_dg](https://www.codechef.com/users/codedreamer_dg), [@sethhritik](https://www.codechef.com/users/sethhritik), [@hash16](https://www.codechef.com/users/hash16).↵
↵
Contact: [email protected]↵
↵
Huge thanks to entire CodeChef Team for their invaluable help and their great platform.↵
↵
Good Luck!↵
↵
Hope to see you participating!!↵
↵
Happy Programming!!↵
↵
PS: Editorial to the problems will be released soon after the contest ends.↵
↵
