Geeksforgeeks

Error

×

Leaderboard

Showing:

Handle | Score |
---|---|

@Ibrahim Nash | 6420 |

@blackshadows | 6380 |

@mb1973 | 5642 |

@Quandray | 5233 |

@akhayrutdinov | 5111 |

@saiujwal13083 | 4610 |

@sanjay05 | 3762 |

@kirtidee18 | 3673 |

@marius_valentin_dragoi | 3522 |

@sushant_a | 3459 |

@verma_ji | 3413 |

Complete Leaderboard | |

Handle | Score |

@sanskar94511 | 603 |

@akashverma4 | 363 |

@swastik8750 | 300 |

@nishunishuraj18 | 286 |

@surajmamgai | 264 |

@anks9013 | 222 |

@nayan2709 | 213 |

@burhanuddinbohra72 | 212 |

@realname | 203 |

@amank8975 | 203 |

@manmeetkaur18102000 | 202 |

Complete Leaderboard |

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.

**Example 1:**

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

**Example 2:**

Input:N = 3Output:7Explanation: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

Login to report an issue on this page.

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

Yes
The Lazy Caterer's Problem

...