There is a small village of 100 people. An unknown number of these villagers are pick pockets. Each day, you're allowed to take as many villagers as you wish out of the village. When a pick pocket has been taken out, he will not pick any pockets.
Each day, pick pockets still in the village will pick one pocket.
Each night, people will report if and how many times they were victim to pick pocketing.
Pick pockets do not know who each other are, so they may pick pocket each other. They will also still report if they are victim.
You have to successfully find who are the pick pockets. My question is if there's an optimal solution to this problem, and if there is, what's the worst case scenario?