Today I’ll continue this series with a problem if you are astute you will solve it in less than 5 minutes. Don’t forget triangles!
In her trip to Italy, Elizabeth Gilbert made it her duty to eat perfect pizza. One day, she ordered one for dinner. And then some Italian friends appeared at her room. The problem is that there were many people who ask for a piece of pizza at that moment. And she had a knife that only cuts straight.
This is what she wants:
Given a number K (K <= 45000), help her get the maximum of pieces possible (not necessarily of equal size) with K cuts.
If K is a negative number, the result must be -1.
Pizza.maxPizza(0) == 1Pizza.maxPizza(1) == 2Pizza.maxPizza(3) == 7[spoiler]
public class Pizza {
public static int maxPizza(int k) {
return k < 0 || k >= 45000 ? -1 : k * (k + 1) / 2 + 1;
}
}[/spoiler]
Good luck and have fun!