Indian Computing Olympiad

A

• Adjacency list, see Graphs
• Adjacency matrix, see Graphs
• Articulation points, see Graphs

B

• Bellman-Ford algorithm, see Graphs
• BFS tree, see Graphs
• Binary search (video available)
• Aliens (IOI 2007)
• Off with the head (IOITC 2003)
• Post Election Transfers (IOITC 2006)
• Rods (IOI 2002)
• Wires and switches (IOI 1995)
• Bipartite matching, see Graphs
• Breadth first search, see Graphs
• Bridges, see Graphs

C

• Connectedness, see Graphs
• Cycles, see Graphs

D

• Dags, see Graphs
• Data structures
  • Binary index trees
  • Disjoint-set data structure (Union-Find) (video available)
  • Advertising hoardings
  • Heaps (video available)
  • Heapsort (video available)
  • Dijkstra's algorithm with heaps (video available)
  • Backup (APIO 2007)
  • Race (CEOI 2003)
  • Sokoban
  • Segment trees
• Degree of vertex, see Graphs
• Depth first search, see Graphs
• DFS numbering, see Graphs
• Dijkstra's algorithm, see Graphs
• Directed graphs, see Graphs
• Directed acyclic graphs, see Graphs
• Dynamic programming (video available)
• Counting paths in a grid (video available)
• DNA (APIO 2008)
• Edit distance (video available)
• Fibonacci numbers
• Heaviest path
• Longest ascending subsequence
• Longest common subsequence (video available)
• Longest common subword (video available)
• Maximum sum subsection
• Matrix multiplication (video available)
• Mexico (IOI 2006)
• Phidias (IOI 2004)
• Post Office (IOI 2000)
• Pyramid (IOI 2006)
• Speculating on buffalos, Version 2
• Tiling Problems
• Yertle the Turtle
• Dynamic programming on trees
• Catering contracts
• Rivers (IOI 2005)
• Mobiles (APIO 2007)
• Coffee Shop (APIO shortlist 2007)
• Catering Contracts Version 2π (IOITC 2008)

E

F

• Floyd-Warshall algorithm, see Graphs

G

• Games and strategies
• Solving finite games
• Generating Permutations, see Permutations
• Geometry
• Boundary (IOI 2003)
• Frogs (IOI 2002)
• Graphs
• Adjacency list (video available)
• Adjacency matrix (video available)
• Articulation points
• ATM Robbery (APIO 2009)
• Basics
• Bellman-Ford algorithm (video available)
• BFS tree
• Bipartite matching
• Breadth first search (video available)
• Bridges
• Catering Contracts: Two Way Split
• Catering Contracts: Three Way Split
• Connectedness
• Dags (video available)
• Directed graphs
• Directed acyclic graphs (video available)
• Degree of vertex
• Depth first search (video available)
• DFS numbering
• Dijkstra's algorithm (video available)
• Dijkstra's algorithm with heaps (video available)
• Flood (IOI 2007)
• Floyd-Warshall algorithm (video available)
• Indegree
• Islands (IOI 2008)
• Kruskal's algorithm (vido available)
• Longest paths(video available)
• Maintain (IOI 2003)
• One way roads
• Outdegree
• Paths
• Placing rooks
• Prim's algorithm (video available)
• Prisoners escape
• Representing graphs
• Roads (APIO 2008)
• Spanning trees
• Shortest paths
• Strongly connected components (video available)
• Toll roads
• Topological Sort (video available)
• Trees
• Weighted graphs
• Greedy algorithms
• Backup (APIO 2007)
• Sails (IOI 2007)
• Speculating on buffalos
• Teleporters (IOI 2008)

H

• Heaps, see Data structures

I

• Indegree of vertex, see Graphs

J

K

• Kruskal's algorithm, see Graphs

L

M

N

• Network flows (video available)
• Going to school
• Evil intentions (IOITC 2005)

O

• Outdegree of vertex, see Graphs

P

• Paths, see Graphs
• Permutations, Generating
• Bead Necklace
• Beads (APIO 2008)
• Depot (IOI 2001)
• Prefix Sums
• Maximum Sum Subsection
• Ramu's Mango Trees
• Oil (APIO 2009)
• Prim's algorithm, see Graphs
• Problems
• Advertising hoardings
• Aliens (IOI 2007)
• Artemis (IOI 2004)
• ATM Robbery (APIO 2009)
• Backup (APIO 2007)
• Beads (APIO 2008)
• Boundary (IOI 2003)
• Buying empty plots
• Buying two empty plots
• Catering contracts
• Catering Contracts: Two Way Split
• Catering Contracts: Three Way Split
• Catering Contracts Version 2π (IOITC 2008)
• Coffee Shop (APIO shortlist 2007)
• Depot (IOI 2001)
• DNA (APIO 2008)
• Edit Ladder
• Evil intentions (IOITC 2005)
• Flood (IOI 2007)
• Frogs (IOI 2002)
• From inversions to permutations
• Garden (IOI 2005)
• Going to school
• IOI
• Aliens (IOI 2007)
• Artemis (IOI 2004)
• Boundary (IOI 2003)
• Depot (IOI 2001)
• Flood (IOI 2007)
• Frogs (IOI 2002)
• Garden (IOI 2005)
• Islands (IOI 2008)
• Mexico (IOI 2006)
• Mobiles (IOI 2001)
• Maintain (IOI 2003)
• Mountain (IOI 2005)
• Phidias (IOI 2004)
• Post Election Transfers (IOITC 2006)
• Post Office (IOI 2000)
• Pyramid (IOI 2006)
• Rectangle (IOI 2005)
• Rivers (IOI 2005)
• Rods (IOI 2002)
• Sails (IOI 2007)
• Scores (IOI 2001)
• Teleporters (IOI 2008)
• Utopia (IOI 2002)
• Wires and switches (IOI 1995)
• Writing (IOI 2006)
• Islands (IOI 2008)
• Longest Open Segment
• Maintain (IOI 2003)
• Maximum Sum Subsection
• Mexico (IOI 2006)
• Min Segments
• Mobiles (IOI 2001)
• Mobiles (APIO 2007)
• Mountain (IOI 2005)
• Off with the head (IOITC 2003)
• Oil (APIO 2009)
• One way roads
• Pearls (CEOI 2003)
• Phidias (IOI 2004)
• Placing rooks
• Post Office (IOI 2000)
• Prisoners escape (Baltic Olympiad 2007)
• Pyramid (IOI 2006)
• Race (CEOI 2003)
• Ramu's Mango Trees
• Rectangle (IOI 2005)
• Rivers (IOI 2005)
• Roads (APIO 2008)
• Rods (IOI 2002)
• Sails (IOI 2007)
• Scores (IOI 2001)
• Shoemaker
• Sokoban
• Speculating on buffalos
• Speculating on buffalos, Version 2
• Teleporters (IOI 2008)
• Toll roads (IOITC 2006)
• Utopia (IOI 2002)
• Wires and switches (IOI 1995)
• Writing (IOI 2006)
• Yertle the Turtle

Q

R

• Range queries
• Range queries on static data
• Range queries with single point updates
• Binary index trees
• Segment trees
• Range queries with interval updates and point queries
• Range queries with interval updates and interval queries

• Representing graphs, see Graphs

S

• Spanning trees, see Graphs
• Shortest paths, see Graphs
• Sliding window algorithms
• Buying empty plots
• Buying two empty plots
• Min Segments
• Garden (IOI 2005)
• Writing (IOI 2006)
• Sorting
• Heapsort (video available)
• Mergesort (video available)
• Quicksort (video available)
• Shoemaker
• Stable sorting
• Utopia (IOI 2002)
• Stategies, see Games and strategies
• Strongly connected components, see Graphs

T

• Trees, see Graphs

U

• Union-find, see Data Structures

V

• Video Lectures
• Disjoint-set data structure (Union-Find)
• Dynamic programming
• Counting paths in a grid
• Edit distance
• Longest common subsequence
• Longest common subword
• Matrix multiplication
• Graphs
• Adjacency list
• Adjacency matrix
• Bellman-Ford algorithm
• Breadth first search
• Depth first search
• Dijkstra's algorithm
• Dijkstra's algorithm with heaps
• Directed acyclic graphs
• Floyd-Warshall algorithm
• Kruskal's algorithm
• Prim's algorithm
• Network flows
• Strongly connected components
• Heaps
• Motivating examples
• Searching
• Sorting
• Heapsort
• Mergesort
• Quicksort

W

• Weighted graphs, see Graphs

X

Y

Z