Indian Computing Olympiad
Training Material
Skip menu
Contact
Index
Problems
Topics
Home
Searching
Wires and Switches (IOI 1995)
Rods (IOI 2002)
Off with the Head (IOITC 2003)
Aliens (IOI 2007)
Post election transfers (IOITC 2006)
Sorting
Shoemaker
Utopia (IOI 2002)
Basic Graph Algorithms
Prisoners escape (Baltic Olympiad 2007)
Toll Roads (IOITC 2006)
Amazing Robots (IOI 2003)
Catering Contracts: Two Way Split
Catering Contracts: Three Way Split
Dynamic Programming
Speculating on buffalos, Version 2
Post Office (IOI 2000)
Phidias (IOI 2004)
Mexico (IOI 2006)
Pyramid (IOI 2006)
Yertle the Turtle
DNA (APIO 2008)
Greedy Algorithms
Speculating on Buffalos
Backup (APIO 2007)
Teleporters (IOI 2008)
Sails (IOI 2007)
Heaps
Backup (APIO 2007)
Race (CEOI 2003)
Sokoban
Generating permutations
Depot (IOI 2001)
Beads (APIO 2008)
Directed acyclic graphs
Edit Ladder
Computing prefix sums
Maximum Sum Subsection
Ramu's Mango Trees
Oil (APIO 2009)
Sliding window algorithms
Buying empty plots
Buying two empty plots
Min Segments
Garden (IOI 2005)
Writing (IOI 2006)
Advanced Graph Algorithms
Maintain (IOI 2003)
Roads (APIO 2008)
One way roads
Placing rooks
ATM Robbery (APIO 2009)
Flood (IOI 2007)
Islands (IOI 2008)
Dynamic Programming on Trees
Catering contracts
Rivers (IOI 2005)
Mobiles (APIO 2007)
Coffee Shop (APIO shortlist 2007)
Catering Contracts Version 2π (IOITC 2008)
Range Queries
Mobiles (IOI 2001)
From inversions to permuations
Longest Open Segment
Artemis (IOI 2004)
Mountain (IOI 2005)
Network Flows
Going to school
Evil intentions (IOITC 2005)
Geometry
Frogs (IOI 2002)
Boundary (IOI 2003)
Problems related to
Searching
Sorting
Basic Graph Algorithms
Dynamic Programming
Greedy Algorithms
Computing Shortest Paths
Heaps
Permutations
Directed Acyclic Graphs
Computing Prefix Sums
Sliding Window Algorithms
Advanced Graph Algorithms
Dynamic Programming on Trees
Range Queries
Network Flows
Games and Strategies
Geometry
©IARCS 2012–2016
Pěstujeme web
| visit:
Skluzavky