Given an integer N, where . The task is to print the count of pieces of a circle with N cuts where each cut passes through the centre of given circle.

**Examples**:

Input: N = 2Output: 4Input: N = 100Output: 200

**Approach:** This problem can be easily solved with observation only. Since each cut passes through the centre, each cut creates two new pieces.

Let us see how above Intuition works.

- At first cut we have 2 different pieces of circle.
- At second cut we have 2 new different pieces from previous 2 pieces of circle.
- At third cut we have again 2 new different pieces from any of previous 2 pieces which are opposite to each other.

In this way, we proceed with N cuts to get the count of total pieces after N cuts.

Below is the implementation of above approach:

## C++

`// C++ program to find number of pieces ` `// of circle after N cuts ` ` ` `#include <bits/stdc++.h> ` `using` `namespace` `std; ` ` ` `// Function to find number of pieces ` `// of circle after N cuts ` `int` `countPieces(` `int` `N) ` `{ ` ` ` `return` `2 * N; ` `} ` ` ` `// Driver program ` `int` `main() ` `{ ` ` ` `int` `N = 100; ` ` ` ` ` `cout << countPieces(N); ` ` ` ` ` `return` `0; ` `} ` |

*chevron_right*

*filter_none*

## Java

`// Java program to find number of pieces ` `// of circle after N cuts ` `import` `java.util.*; ` ` ` `class` `solution ` `{ ` ` ` `// Function to find number of pieces ` `// of circle after N cuts ` `static` `int` `countPieces(` `int` `N) ` `{ ` ` ` `return` `2` `* N; ` `} ` ` ` `// Driver program ` `public` `static` `void` `main(String args[]) ` `{ ` ` ` `int` `N = ` `100` `; ` ` ` ` ` `System.out.println(countPieces(N)); ` ` ` `} ` ` ` `} ` |

*chevron_right*

*filter_none*

## Python3

`# Python program to find number ` `# of pieces of circle after N cuts ` ` ` `# Function to find number of ` `# pieces of circle after N cuts ` `def` `countPieces(N): ` ` ` `return` `2` `*` `N ` ` ` `# Driver Code ` `N ` `=` `100` ` ` `print` `(countPieces(N)) ` ` ` `# This code is contributed by ` `# Sanjit_Prasad ` |

*chevron_right*

*filter_none*

## C#

`// C# program to find number of pieces ` `// of circle after N cuts ` ` ` `class` `solution ` `{ ` ` ` `// Function to find number of pieces ` `// of circle after N cuts ` `static` `int` `countPieces(` `int` `N) ` `{ ` ` ` `return` `2 * N; ` `} ` ` ` `// Driver program ` `static` `void` `Main() ` `{ ` ` ` `int` `N = 100; ` ` ` ` ` `System.Console.WriteLine(countPieces(N)); ` ` ` `} ` ` ` `} ` `// This code is contributed by mits ` |

*chevron_right*

*filter_none*

## PHP

`<?php ` `// PHP program to find number of ` `// pieces of circle after N cuts ` ` ` `// Function to find number of pieces ` `// of circle after N cuts ` `function` `countPieces(` `$N` `) ` `{ ` ` ` `return` `2 * ` `$N` `; ` `} ` ` ` `// Driver Code ` `$N` `= 100; ` ` ` `echo` `countPieces(` `$N` `); ` ` ` `// This code is contributed by anuj_67 ` `?> ` |

*chevron_right*

*filter_none*

**Output:**

200

**Time Complexity:** O(1)

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the **DSA Self Paced Course** at a student-friendly price and become industry ready.

## Recommended Posts:

- Maximum number of pieces in N cuts
- Minimum cuts required to divide the Circle into equal parts
- Minimum number of cuts required to make circle segments equal sized
- Count ways to divide circle using N non-intersecting chord | Set-2
- Area of the circle that has a square and a circle inscribed in it
- Check if a circle lies inside another circle or not
- Probability that the pieces of a broken stick form a n sided polygon
- Probability of cutting a rope into three pieces such that the sides form a triangle
- Equation of circle when three points on the circle are given
- Possible cuts of a number such that maximum parts are divisible by 3
- Minimum Cuts can be made in the Chessboard such that it is not divided into 2 parts
- Minimum number of cuts required to pay salary from N length Gold Bar
- Number of ways to cut a stick of length N into in even length at most K units long pieces
- Minimize number of cuts required to break N length stick into N unit length sticks
- Count of binary strings of length N having equal count of 0's and 1's and count of 1's ≥ count of 0's in each prefix substring
- Angle subtended by the chord to center of the circle when the angle subtended by the another equal chord of a congruent circle is given
- Minimum Enclosing Circle | Set 1
- Radius of the circle when the width and height of an arc is given
- Shortest distance between a point and a circle
- Area of circle inscribed within rhombus

If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.

Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.