The Lazy Caterer's Problem
Basic Accuracy: 78.66% Submissions: 4427 Points: 1

Given an integer n, denoting the number of cuts that can be made on a pancake, find the maximum number of pieces that can be formed by making n cuts.
NOTE: Cuts can't be horizontal.

 

Example 1:

Input: N = 5
Output: 16
Explanation:  16 pieces can be formed by
making 5 cuts.

Example 2:

Input: N = 3
Output: 7
Explanation: 7 pieces can be formed by 
making 3 cuts.

 

Your Task: 
You don't need to read or print anything. Your task is to complete the function maximum_Cuts() which takes n as input parameter and returns the maximum number of pieces that can be formed by making n cuts.

 

Expected Time Complexity: O(1)
Expected Space Complexity: O(1)

Constraints:
1 <= N <= 10000

We are replacing the old Disqus forum with the new Discussions section given below.
Click here to view old Disqus comments.


to report an issue on this page.

Editorial

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

Yes

All Submissions

My Submissions:

Login to access your submissions.

The Lazy Caterer's Problem

Output Window