“Perseverance, competitiveness and resilience”

It is a student organization at UTEC, Peru. We do activities related to competitive programming. We have two types of training:

• Beginner training. Here we assume a minimal experience with programming and we assume zero knowledge of competitive programming.

• Advanced training. Here we assume that you have taken the beginner training or you have experience in competitive programming.

The beginner training is open to all student at UTEC with the will to learn about competitive programming.

The advanced training is just for the official members of the organization. You can join us taking the entrance contest. Just register in this form to take the contest on september 11, 4-7pm.

Moreover, you can find a collection of images of some previous actividades.

Study material

The material developed by CPC UTEC in its activities can be found in this repository and in this page.

## Topics

• Introduction
• Complete Search
• Divide and Conquer
• Game Theory
• Graph Theory

### Introduction

• Topics
• What is competitive programming?
• Topics of the course
• Virtual Judges
• Problem structure
• Veredicts information
• Environment setup
• Topics:
• Motivation
• Sampling an extrapolation
• Big Oh notation
• Asymptotic Analysis
• Space and Time Complexity
• Topics
• Standard Template Library (STL)
• Numeric data types and its operations
• String
• Vector
• Set
• Map
• Struct

### Divide and Conquer

• Topics
• The divide and conquer paradigm
• Binary search
• Lower bound
• Upper bound
• Binary search on the answer
• Topics
• Generalized binary search
• Ternary search
• Merge sort
• Inductive constructions

### Game Theory

• Topics
• Introduction
• WL states
• The game of Nim
• Grundy numbers
• Sprague-Grundy theorem
• Topics
• Grundy’s games
• Staircase Nim
• Misère games
• Minimax
• Alpha-Beta prunning

### Graph Theory

• Topics
• Introduction
• Graph representation
• Distance in graphs
• Graph isomorphism
• Graph score
• Trees
• BFS
• DFS
• Diameter of a tree
• Isomorphism of trees