# Program to find the Break Even Point

Given the list of monthly expenditure of an organization, selling price and the overhead maintenance of each item, the task is to calculate the Break Even Point.

**Break Even Point** refers to the number of items sold in order to neutralize the total expenditure i.e. Overall, neither profit nor loss.

**Examples:**

Input: Expenditure = 18000, S = 600, M = 100

Output: 36

We need to sell 36 items to cover expenditure and maintenance overhead

Input: Expenditure = 3550, S = 90, M = 65

Output: 142

**Approach:**

- Calculate the sum of all the expenditures.
- Subtract the maintenance (Cost price) from the selling price.
- Divide the expenditure sum by the above-obtained amount to get the minimum number of items to be sold (Break Even Point).

Below is the implementation of the above approach:

## C++

`// C++ program to find the break-even point. ` ` ` `#include <iostream> ` `#include <math.h> ` `using` `namespace` `std; ` ` ` `// Function to calculate Break Even Point ` `int` `breakEvenPoint(` `int` `exp` `, ` `int` `S, ` `int` `M) ` `{ ` ` ` `float` `earn = S - M; ` ` ` ` ` `// Calculating number of articles to be sold ` ` ` `int` `res = ` `ceil` `(` `exp` `/ earn); ` ` ` ` ` `return` `res; ` `} ` ` ` `// Main Function ` `int` `main() ` `{ ` ` ` `int` `exp` `= 3550, S = 90, M = 65; ` ` ` `cout << breakEvenPoint(` `exp` `, S, M); ` ` ` `return` `0; ` `} ` |

*chevron_right*

*filter_none*

## Java

`// Java program to find Break Even Point ` `import` `java.io.*; ` `import` `java.lang.*; ` ` ` `class` `GFG ` `{ ` `// Function to calculate ` `// Break Even Point ` `public` `static` `int` `breakEvenPoint(` `int` `exp1, ` ` ` `int` `S, ` `int` `M) ` `{ ` ` ` `double` `earn = S - M; ` ` ` ` ` `double` `exp = exp1; ` ` ` ` ` `// Calculating number of ` ` ` `// articles to be sold ` ` ` `double` `res = Math.ceil(exp / earn); ` ` ` ` ` `int` `res1 = (` `int` `) res; ` ` ` ` ` `return` `res1; ` `} ` ` ` `// Driver Code ` `public` `static` `void` `main (String[] args) ` `{ ` ` ` `int` `exp = ` `3550` `, S = ` `90` `, M = ` `65` `; ` ` ` `System.out.println(breakEvenPoint(exp, S, M)); ` `} ` `} ` ` ` `// This code is contributed ` `// by Naman_Garg ` |

*chevron_right*

*filter_none*

## Python 3

`# Python 3 program to find ` `# Break Even Point ` `import` `math ` ` ` `# Function to calculate ` `# Break Even Point ` `def` `breakEvenPoint(exp, S, M): ` ` ` ` ` `earn ` `=` `S ` `-` `M ` ` ` ` ` `# Calculating number of ` ` ` `# articles to be sold ` ` ` `res ` `=` `math.ceil(exp ` `/` `earn) ` ` ` ` ` `return` `res ` ` ` `# Driver Code ` `if` `__name__ ` `=` `=` `"__main__"` `: ` ` ` ` ` `exp ` `=` `3550` ` ` `S ` `=` `90` ` ` `M ` `=` `65` ` ` ` ` `print` `(` `int` `(breakEvenPoint(exp, S, M))) ` ` ` `# This code is contributed ` `# by Naman_Garg ` |

*chevron_right*

*filter_none*

## C#

`// C# program to find Break Even Point ` `using` `System; ` ` ` `class` `GFG ` `{ ` `// Function to calculate ` `// Break Even Point ` `public` `static` `int` `breakEvenPoint(` `int` `exp1, ` ` ` `int` `S, ` `int` `M) ` `{ ` ` ` `double` `earn = S - M; ` ` ` ` ` `double` `exp = exp1; ` ` ` ` ` `// Calculating number of ` ` ` `// articles to be sold ` ` ` `double` `res = Math.Ceiling(exp / earn); ` ` ` ` ` `int` `res1 = (` `int` `) res; ` ` ` ` ` `return` `res1; ` `} ` ` ` `// Driver Code ` `public` `static` `void` `Main () ` `{ ` ` ` `int` `exp = 3550, S = 90, M = 65; ` ` ` `Console.WriteLine(breakEvenPoint(exp, S, M)); ` `} ` `} ` ` ` `// This code is contributed ` `// by inder_verma.. ` |

*chevron_right*

*filter_none*

## PHP

**Output:**

142

## Recommended Posts:

- Program to find the mid-point of a line
- Program to find GCD of floating point numbers
- C Program to Multiply two Floating Point Numbers
- Find the other end point of a line with given one end and mid
- Find Tangent at a given point on the curve
- Find the Missing Point of Parallelogram
- Find normal at a given point on the curve
- Find the foot of perpendicular of a point in a 3 D plane
- Find if a point lies inside a Circle
- Find a point such that sum of the Manhattan distances is minimized
- Find a point that lies inside exactly K given squares
- Find foot of perpendicular from a point in 2 D plane to a Line
- Find the minimum sum of distance to A and B from any integer point in a ring of size N
- Reflection of a point at 180 degree rotation of another point
- Break the number into three parts

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.