I've created the following tag here http://project-gc.com/Challenges/GC3WZKT/5388
I've been working on a generic checker that allows the use of (semi) natural language to define the conditions. Its still a work in progress but In this case the translation of the challenge is:
define 'number' as match '(%d%d)$' on gccode.
define 'hundreds' as match '(1?%d%d)$' on gccode.
with name '01-99' find 99 caches with unique number field where number <> '' and number > '0'.
with name '00' find 2 caches where number == '00'.
with name '100' find a cache where hundreds == '100'.
output sorted by number table number, gccode, cache_name as 'Name'.
The slight annoyance with how this works is I have to find both a matching cache for 100 and two matching caches for '00' - one of which will probably be the one we were using for 100. Otherwise if the cache has found two caches ending in 100 they wouldn't be marked as being qualified even though they are.