Problems
| Problem | Category | Types | Points ▾ | AC % | Users | |
|---|---|---|---|---|---|---|
| IOI '04 P2 - Hermes | IOI | Uncategorized | 15p | 23.5% | 188 | |
| IOI '06 P4 - The Valley of Mexico | IOI | Dynamic Programming | 15p | 22.0% | 214 | |
| IOI '11 P3 - Rice Hub (Standard I/O) | IOI | Greedy Algorithms, Simple Math | 15p | 19.4% | 496 | |
| IOI '12 P3 - Crayfish Scrivener (Standard I/O) | IOI | Data Structures | 15p | 16.8% | 276 | |
| IOI '13 P1 - Dreaming (Standard I/O) | IOI | Graph Theory | 15p | 18.4% | 532 | |
| IOI '14 P4 - Gondola (Standard I/O) | IOI | Ad Hoc | 15 | 8.5% | 222 | |
| IOI '15 P1 - Boxes with Souvenirs (Standard I/O) | IOI | Ad Hoc | 15p | 8.2% | 189 | |
| IOI '15 P4 - Horses (Standard I/O) | IOI | Ad Hoc | 15p | 7.6% | 162 | |
| IOI '16 P4 - Paint by Numbers (Standard I/O) | IOI | Ad Hoc | 15p | 10.0% | 63 | |
| IOI '10 P3 - Quality of Living (Standard I/O) | IOI | Data Structures | 15p | 28.1% | 338 | |
| IOI '20 P2 - Connecting Supertrees | IOI | Graph Theory | 15p | 13.8% | 54 | |
| IOI '16 P1 - Detecting Molecules | IOI | Greedy Algorithms | 12p | 11.8% | 155 | |
| IOI '01 P2 - Ioiwari Game | IOI | Game Theory | 12p | 34.5% | 7 | |
| IOI '07 P1 - Aliens | IOI | Interactive | 12p | 15.3% | 21 | |
| IOI '05 P2 - Mean Sequence | IOI | Intermediate Math | 12p | 20.8% | 270 | |
| IOI '05 P4 - Birthday | IOI | Implementation | 12p | 15.7% | 141 | |
| IOI '09 P2 - Hiring | IOI | Uncategorized | 12p | 32.3% | 252 | |
| IOI '95 Practice Task 3 - Bar Codes | IOI | Dynamic Programming | 12p | 35.4% | 23 | |
| IOI '95 Practice Task 2 - Word Chains | IOI | Data Structures | 12 | 43.9% | 54 | |
| IOI '96 P3 - Network of Schools | IOI | Graph Theory | 12p | 23.7% | 83 | |
| IOI '96 P5 - Longest Prefix | IOI | Dynamic Programming | 12 | 20.8% | 112 | |
| IOI '98 P3 - Party Lamps | IOI | Ad Hoc | 12p | 34.0% | 168 | |
| IOI '00 P4 - Walls | IOI | Graph Theory | 12 | 36.2% | 228 | |
| IOI '08 P1 - Type Printer | IOI | String Algorithms | 12p | 20.0% | 409 | |
| IOI '16 P1 - Detecting Molecules (Standard I/O) | IOI | Greedy Algorithms | 12p | 14.1% | 230 | |
| IOI '21 P4 - Mutating DNA | IOI | Data Structures, Greedy Algorithms | 12p | 28.9% | 75 | |
| IOI '13 P4 - Cave | IOI | Divide and Conquer, Interactive | 10p | 18.6% | 311 | |
| IOI '98 P1 - Contact | IOI | Data Structures | 10p | 8.9% | 58 | |
| IOI '00 P1 - Palindrome | IOI | Dynamic Programming | 10p | 18.5% | 830 | |
| IOI '09 P4 - Raisins | IOI | Dynamic Programming | 10p | 55.4% | 543 | |
| IOI '10 P6 - Traffic Congestion | IOI | Graph Theory | 10p | 18.2% | 94 | |
| IOI '94 P2 - The Castle | IOI | Graph Theory, Implementation | 10 | 18.8% | 127 | |
| IOI '94 P4 - The Clocks | IOI | Implementation | 10 | 27.2% | 121 | |
| IOI '96 P4 - Sorting a Three-Valued Sequence | IOI | Constructive, Greedy Algorithms | 10 | 31.9% | 142 | |
| IOI '96 P1 - A Game | IOI | Dynamic Programming, Game Theory | 10 | 39.2% | 270 | |
| IOI '99 P1 - Little Shop of Flowers | IOI | Dynamic Programming | 10 | 30.6% | 206 | |
| IOI '04 P4 - Phidias | IOI | Dynamic Programming | 10p | 53.6% | 889 | |
| IOI '14 Practice Task 3 - Tile | IOI | Divide and Conquer | 10p | 28.0% | 55 | |
| IOI '14 Practice Task 1 - Square | IOI | Dynamic Programming | 10p | 51.6% | 182 | |
| IOI '10 P6 - Traffic Congestion (Standard I/O) | IOI | Graph Theory | 10p | 33.0% | 416 | |
| IOI '94 P1 - The Triangle | IOI | Dynamic Programming | 7p | 56.5% | 1484 | |
| IOI '09 P5 - Garage | IOI | Implementation | 7 | 46.4% | 532 | |
| IOI '09 P3 - POI | IOI | Implementation | 7 | 28.7% | 528 | |
| IOI '14 Practice Task 2 - Station | IOI | Greedy Algorithms | 7p | 57.9% | 50 | |
| IOI '06 P1 - Deciphering the Mayan Writing | IOI | String Algorithms | 7p | 39.5% | 433 | |
| IOI '10 P5 - Memory | IOI | Implementation, Interactive | 5p | 23.1% | 136 | |
| IOI '10 P1 - Cluedo | IOI | Implementation | 5p | 36.0% | 137 |