SPOJ- PIE solution
Hello! This post is about solution of SPOJ problem PIE : visit question PIE So, we will be looking at the implementation part of it using Binary Search. We encourage you to try solving problem first by yourself but still if you are getting trouble then move on to tutorials. Here we require to maximize the cake volume each person would get: Constraints: 1. Each person would get equal volume of cake. 2. We will not mix two cake pieces to make one piece.
Comments
Post a Comment