Thanks to visit codestin.com
Credit goes to www.scribd.com

0% found this document useful (0 votes)
44 views2 pages

Competitive Coding Conclave - The CP Camp

The Competitive Coding Conclave is a free programming camp conducted by the Programming Club Team of IIT Madras, utilizing Google Classroom for course materials. It includes nine sessions covering C++ basics to advanced topics, along with three coding contests on weekends. Participants are required to have a Codeforces account to join the camp.

Uploaded by

jhhxrm8jgt
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
44 views2 pages

Competitive Coding Conclave - The CP Camp

The Competitive Coding Conclave is a free programming camp conducted by the Programming Club Team of IIT Madras, utilizing Google Classroom for course materials. It includes nine sessions covering C++ basics to advanced topics, along with three coding contests on weekends. Participants are required to have a Codeforces account to join the camp.

Uploaded by

jhhxrm8jgt
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Competitive Coding Conclave

Competitive Programming Camp

Logistics :
● Instructors: Programming Club Team of IIT Madras
● Discussion Forum: Google Classroom

Course Description :
The camp is free of cost. The course contents will be released on Google
Classroom. There will be a set of Problem sets provided on the CodeForces
Platform. The overall plan involves nine sessions starting from basic
concepts and intro to C++ up to advanced concepts like Sieve, Binary
Search, etc. There will be three coding contests held on the weekends.

The camp will cover C++ STL data structures and basic concepts, such as
time complexity analysis, postfix/prefix sums, greedy, complete search,
modulo arithmetic, binary search (on the answer), sieve, ETF, etc. The
contests will gradually increase in difficulty but will be extremely easy, and
the final round should be as difficult as Div. 3.
Requirement: Have a codeforces account

Timeline:

You might also like