| Problem | Link | Category | Difficulty |
| 11000 - Bee | 11000 | Simulation | |
| 11001 - Necklace | 11001 | Math | |
| 11002 - Towards Zero | 11002 | Dynamic Programming | |
| 11003 - Boxes | 11003 | Dynamic Programming | |
| 11004 - Changing Roadmap | 11004 | Math | 2 |
| 11005 - Cheapest Base | 11005 | Math | |
| 11006 - Wheel Good | 11006 | Greedy | |
| 11007 - Mini Cube | 11007 | Bruteforce | |
| 11008 - Antimatter Ray Clearcutting | 11008 | Dynamic Programming | |
| 11009 - Geometry Once Again | 11009 | | |
| 11010 - Tic-Tac-Tough | 11010 | | |
| 11011 - Numerical Methods! A Satire | 11011 | Ad Hoc | |
| 11012 - Cosmic Cabbages | 11012 | Ad Hoc | |
| 11013 - Get Straight | 11013 | | |
| 11014 - Make a Crystal | 11014 | Number Theory | |
| 11015 - 05-2 Rendezvous | 11015 | Shortest Path | |
| 11016 - Square Counting | 11016 | | |
| 11017 - A Greener World | 11017 | | |
| 11018 - Mars Buggy | 11018 | | |
| 11019 - Matrix Matcher | 11019 | Pattern Matching | |
| 11020 - Efficient Solutions | 11020 | | |
| 11021 - Tribles | 11021 | Probability Theory | |
| 11022 - String Factoring | 11022 | Dynamic Programming | |
| 11023 - Multisets and Sequences | 11023 | Dynamic Programming, Combinatorics | |
| 11024 - Circular Lock | 11024 | Number Theory | |
| 11025 - Mr. And Mrs. Hamilton | 11025 | Graph Theory, Dynamic Programming | |
| 11026 - A Grouping Problem | 11026 | Dynamic Programming, Combinatorics | |
| 11027 - Palindromic Permutation | 11027 | Recursion, Combinatorics | |
| 11028 - Sum of Product | 11028 | Math | |
| 11029 - Leading and Trailing | 11029 | Math | |
| 11030 - Predator II | 11030 | Computational Geometry | |
| 11031 - Looking for a Subset | 11031 | Longest Increasing Subsequence, Dynamic Programming | |
| 11032 - Function Overloading | 11032 | | |
| 11033 - Help my Brother | 11033 | Backtracking | |
| 11034 - Ferry Loading IV | 11034 | Simulation | |
| 11035 - Card Hands | 11035 | Data Structures, Trie | |
| 11036 - Eventually Periodic Sequence | 11036 | Math | |
| 11037 - Point of View in Flatland | 11037 | Math, Geometry | |
| 11038 - How Many O's? | 11038 | Math | |
| 11039 - Building designing | 11039 | Greedy | |
| 11040 - Add bricks in the wall | 11040 | | |
| 11041 - Quarter-Finals with Brazil!? No!!! | 11041 | | |
| 11042 - Complex, difficult and complicated | 11042 | | |
| 11043 - Fast and Easy Data Compressor | 11043 | | |
| 11044 - Searching for Nessy | 11044 | | |
| 11045 - My T-shirt suits me | 11045 | | |
| 11046 - Numbers and operations | 11046 | | |
| 11047 - The Scrooge Co Problem | 11047 | | |
| 11048 - Automatic Correction of Misspellings | 11048 | Ad Hoc | |
| 11049 - Basic wall maze | 11049 | Backtracking | |
| 11050 - Construct the wall maze | 11050 | | |
| 11051 - Dihedral groups | 11051 | Ad Hoc, Greedy | |
| 11052 - Economic phone calls | 11052 | Dynamic Programming, Greedy | |
| 11053 - Flavius Josephus Reloaded | 11053 | | |
| 11054 - Wine trading in Gergovia | 11054 | Greedy | |
| 11055 - Homogeneous squares | 11055 | | |
| 11056 - Formula 1 | 11056 | Sorting | |
| 11057 - Exact Sum | 11057 | | |
| 11058 - Encoding | 11058 | | |
| 11059 - Maximum Product | 11059 | Bruteforce | |
| 11060 - Beverages | 11060 | Graph Theory, Topological Sort | |
| 11061 - Playing War | 11061 | Dynamic Programming, Probability Theory | |
| 11062 - Andy's Second Dictionary | 11062 | Ad Hoc | |
| 11063 - B2-Sequence | 11063 | Ad Hoc | |
| 11064 - Number Theory | 11064 | Number Theory, Math | |
| 11065 - A Gentlemen's Agreement | 11065 | Backtracking | |
| 11066 - Aragorn | 11066 | | |
| 11067 - Little Red Riding Hood | 11067 | Dynamic Programming | |
| 11068 - An Easy Task | 11068 | Topological Sort | |
| 11069 - A Graph Problem | 11069 | Dynamic Programming, Combinatorics | |
| 11070 - The Good Old Times | 11070 | | |
| 11071 - Permutation Representation | 11071 | Data Structure | |
| 11072 - Points | 11072 | Geometry | |
| 11073 - Euler's Totient Function | 11073 | Number Theory, Backtracking | |
| 11074 - Draw Grid | 11074 | Ad Hoc | |
| 11075 - Collage | 11075 | Backtracking | |
| 11076 - Add Again | 11076 | Math, Combinatorics | |
| 11077 - Find the Permutations | 11077 | Dynamic Programming, Combinatorics | |
| 11078 - Open Credit System | 11078 | Ad Hoc | |
| 11079 - What's the Time? | 11079 | | |
| 11080 - Place the Guards | 11080 | Graph Theory | |
| 11081 - Strings | 11081 | Dynamic Programming | |
| 11082 - Matrix Decompressing | 11082 | Network Flow | |
| 11083 - Zeroes Revisited | 11083 | Number Theory | |
| 11084 - Anagram Division | 11084 | | |
| 11085 - Back to the 8-Queens | 11085 | | |
| 11086 - Composite Prime | 11086 | | |
| 11087 - Divisibility Testing | 11087 | | |
| 11088 - End up with More Teams | 11088 | | |
| 11089 - Fi-binary Number | 11089 | | |
| 11090 - Going in Cycle!! | 11090 | | |
| 11091 - How many Knight Placing? | 11091 | | |
| 11092 - IIUC HexWorld | 11092 | | |
| 11093 - Just Finish it up | 11093 | | |
| 11094 - Continents | 11094 | | |
| 11095 - Tabriz City | 11095 | | |
| 11096 - Nails | 11096 | Computational Geometry, Convex Hull | |
| 11097 - Poor My Problem! :-( | 11097 | | |
| 11098 - Battle II | 11098 | | |
| 11099 - Next Same-Factored | 11099 | | |
