Topic outline

  • Week 11

    HOMEWORK BEFORE WEEK 11

    On week 11 we are going to work with number theory and combinatorics. Familiarize yourself with Euclid's algorithm and learn how to implement the basic algorithms required for combinatorics. You can pick up on Euclid's algorithm, modular exponentiation and the modular inverse in chapter 21 of the Competitive Programmer’s Handbook. Information about binomial coefficients and inclusion-exclusion can be found in chapter 22. You can practice your implementations with the CSES problem set: Exponentiation, Combinations.

    MONDAY CONTEST

    On Monday (November 21), we will have a solo contest.

    The contest will be available at cses.fi/422/list/. The contest will automatically open at 16.20 sharp, and it will end at 17.50 sharp. Please make sure you use your personal CSES user account to take part in the contest.

    Once the contest is over, please fill in the form below to record your score.

    WEDNESDAY CONTEST

    On Wednesday (November 23), we will have a team contest. We will assign students to teams at random at 16.15, so please be in the class room punctually!

    The contest will be available at cses.fi/423/list/. The contest will automatically open at 16.20 sharp, and it will end at 17.50 sharp.

    We will create one CSES account for each team. Please make sure all team members use the same team account to take part in the contest.

    Once the contest is over, please fill in the form below to record your score.

    HOMEWORK FOR WEEK 12

    Week 12 will not have new topics

◄ Previous section
Week 10
Next section ►
Week 12