For this challenge, we were presented with a netcat command to connect to a server. Once connected, there is a classic math problem with weighing 12 balls a max times of 3 with an odd one that weighs heavier or lighter than the others. ![Netcat](https://github.com/Cap-Size/CTF_Write_Ups/blob/master/ISITDTU_2019/balls/Screen%20Shot%202019-06-30%20at%209.37.50%20AM.png?raw=true)
The problem is described here: [Article](https://www.mathsisfun.com/pool_balls_solution.html://). The problem is in thinking that with a scale you have two outcomes, but in reality, you have three (if you weigh the balls in the right order). The article explains the solution as well. Given the article, I wrote a script that fits those rules, (With a ton of if-statements) that solves this problem. There are better ways of doing it (with many less lines of code), but it works none-the-less. The script can be found [here](https://github.com/Cap-Size/CTF_Write_Ups/blob/master/ISITDTU_2019/balls/balls.py)