| Problem
|
Link
|
Category
|
| 10000 - Longest Paths
|
10000
|
Graph Theory
|
| 10001 - Garden of Eden
|
10001
|
Dynamic Programming
|
| 10002 - Center of Masses
|
10002
|
Geometry
|
| 10003 - Cutting Sticks
|
10003
|
Dynamic Programming
|
| 10004 - Bicoloring
|
10004
|
Graph Theory
|
| 10005 - Packing polygons
|
10005
|
|
| 10006 - Carmichael Numbers
|
10006
|
Math, Number Theory
|
| 10007 - Count the Trees
|
10007
|
Combinatorics
|
| 10008 - What's Cryptanalysis?
|
10008
|
String, Sorting
|
| 10009 - All Roads Lead Where?
|
10009
|
Graph Theory, Shortest Path
|
| 10010 - Where's Waldorf?
|
10010
|
|
| 10011 - Where Can You Hide?
|
10011
|
Geometry
|
| 10012 - How Big Is It?
|
10012
|
|
| 10013 - Super long sums
|
10013
|
|
| 10014 - Simple calculations
|
10014
|
Math
|
| 10015 - Joseph's Cousin
|
10015
|
Modular Arithmetic
|
| 10016 - Flip-Flop the Squarelotron
|
10016
|
Simulation
|
| 10017 - The Never Ending Towers of Hanoi
|
10017
|
|
| 10018 - Reverse and Add
|
10018
|
BigNum
|
| 10019 - Funny Encryption Method
|
10019
|
Ad Hoc
|
| 10020 - Minimal coverage
|
10020
|
|
| 10021 - Cube in the labirint
|
10021
|
|
| 10022 - Delta-wave
|
10022
|
|
| 10023 - Square root
|
10023
|
BigNum
|
| 10024 - Curling up the cube
|
10024
|
|
| 10025 - The ? 1 ? 2 ? ... ? n = k problem
|
10025
|
|
| 10026 - Shoemaker's Problem
|
10026
|
Sorting
|
| 10027 - Language Cardinality
|
10027
|
|
| 10028 - Demerit Points
|
10028
|
|
| 10029 - Edit Step Ladders
|
10029
|
|
| 10030 - Computer Dialogue
|
10030
|
|
| 10031 - Saskatchewan
|
10031
|
|
| 10032 - Tug of War
|
10032
|
Dynamic Programming
|
| 10033 - Interpreter
|
10033
|
|
| 10034 - Freckles
|
10034
|
Graph Theory, Minimum Spanning Tree, Geometry
|
| 10035 - Primary Arithmetic
|
10035
|
|
| 10036 - Divisibility
|
10036
|
Dynamic Programming
|
| 10037 - Bridge
|
10037
|
|
| 10038 - Jolly Jumpers
|
10038
|
Math
|
| 10039 - Railroads
|
10039
|
|
| 10040 - Ouroboros Snake
|
10040
|
|
| 10041 - Vito's Family
|
10041
|
|
| 10042 - Smith Numbers
|
10042
|
|
| 10043 - Chainsaw Massacre
|
10043
|
|
| 10044 - Erdos Numbers
|
10044
|
Graph Theory, Breadth-First Search
|
| 10045 - Echo
|
10045
|
|
| 10046 - Fold-up Patterns
|
10046
|
|
| 10047 - The Monocycle
|
10047
|
Graph Theory, Shortest Path
|
| 10048 - Audiophobia
|
10048
|
Graph Theory
|
| 10049 - Self-describing Sequence
|
10049
|
Math, Binary Search
|
| 10050 - Hartals
|
10050
|
Simulation
|
| 10051 - Tower of Cubes
|
10051
|
|
| 10052 - Inviting Politicians
|
10052
|
|
| 10053 - Envelopes
|
10053
|
|
| 10054 - The Necklace
|
10054
|
Graph Theory, Eulerian Cycle
|
| 10055 - Hashmat the Brave Warrior
|
10055
|
Ad Hoc
|
| 10056 - What is the Probability ?
|
10056
|
Math, Probability Theory
|
| 10057 - A mid-summer night's dream.
|
10057
|
|
| 10058 - Jimmi's Riddles
|
10058
|
|
| 10059 - The Hazard of CSE Department!
|
10059
|
|
| 10060 - A hole to catch a man
|
10060
|
|
| 10061 - How many zero's and how many digits ?
|
10061
|
Math, Number Theory, Primes
|
| 10062 - Tell me the frequencies!
|
10062
|
Sorting
|
| 10063 - Knuth's Permutation
|
10063
|
Permutations
|
| 10064 - Travelling in another Dimension
|
10064
|
|
| 10065 - Useless Tile Packers
|
10065
|
Computational Geometry, Convex Hull
|
| 10066 - The Twin Towers
|
10066
|
Dynamic Programming, Longest Common Subsequence
|
| 10067 - Playing with Wheels
|
10067
|
Graph Theory
|
| 10068 - The Treasure Hunt
|
10068
|
|
| 10069 - Distinct Subsequences
|
10069
|
Dynamic Programming
|
| 10070 - Leap Year or Not Leap Year and ...
|
10070
|
|
| 10071 - Back to High School Physics
|
10071
|
Math
|
| 10072 - Bob Laptop Woolmer and Eddie Desktop Barlow
|
10072
|
|
| 10073 - Constrained Exchange Sort
|
10073
|
|
| 10074 - Take the Land
|
10074
|
Dynamic Programming
|
| 10075 - Airlines
|
10075
|
Graph Theory, Shortest Path
|
| 10076 - The Bumpy Robot
|
10076
|
|
| 10077 - The Stern-Brocot Number System
|
10077
|
Math
|
| 10078 - The Art Gallery
|
10078
|
Computational Geometry
|
| 10079 - Pizza Cutting
|
10079
|
Math
|
| 10080 - Gopher II
|
10080
|
Graph Theory, Mincut-Maxflow, Bipartite Matching
|
| 10081 - Tight Words
|
10081
|
Combinatorics,Dynamic Programming
|
| 10082 - WERTYU
|
10082
|
Ad Hoc
|
| 10083 - Division
|
10083
|
|
| 10084 - Hotter Colder
|
10084
|
Computational Geometry
|
| 10085 - The most distant state
|
10085
|
|
| 10086 - Test the Rods
|
10086
|
|
| 10087 - The Tajmahal of ++Y2k
|
10087
|
|
| 10088 - Trees on My Island
|
10088
|
|
| 10089 - Repackaging
|
10089
|
|
| 10090 - Marbles
|
10090
|
|
| 10091 - The Valentine's Day
|
10091
|
Graph Theory
|
| 10092 - The Problem with the Problem Setter
|
10092
|
|
| 10093 - An Easy Problem!
|
10093
|
|
| 10094 - Place the Guards
|
10094
|
|
| 10095 - Saving the Planet
|
10095
|
|
| 10096 - The Richest Man of the Universe
|
10096
|
|
| 10097 - The Color Game
|
10097
|
Graph Theory, Shortest Path
|
| 10098 - Generating Fast, Sorted Permutation
|
10098
|
Permutations
|
| 10099 - The Tourist Guide
|
10099
|
Graph Theory
|
