If you connect to programming.easyctf.com:10300
enough times, you'll see the 4 types of problems:
- Fill in missing operations, which we can just brute force since there are only 27 possiblities;
- Find # of ways to get a certain value from a subset of the coins, which can be solved efficiently with Dynamic Programming
- Find distance traveled after being projected from a desk, a simple physics question
- Find greatest/least root, solve using quadratic formula