Program to calculate Electricity Bill
Last Updated :
04 Apr, 2023
Given an integer U denoting the amount of KWh units of electricity consumed, the task is to calculate the electricity bill with the help of the below charges:
- 1 to 100 units - Rs. 10/unit
- 100 to 200 units - Rs. 15/unit
- 200 to 300 units - Rs. 20/unit
- above 300 units - Rs. 25/unit
Examples:
Input: U = 250
Output: 3500
Explanation:
Charge for the first 100 units - 10*100 = 1000
Charge for the 100 to 200 units - 15*100 = 1500
Charge for the 200 to 250 units - 20*50 = 1000
Total Electricity Bill = 1000 + 1500 + 1000 = 3500
Input: U = 95
Output: 950
Explanation:
Charge for the first 100 units - 10*95 = 950
Total Electricity Bill = 950
Approach 1: The idea is to identify the charge bar in which it falls and then calculate the bill according to the charges mentioned above. Below is the illustration of the steps:
- Check units consumed is less than equal to the 100, If yes then the total electricity bill will be:
\text{Total Electricity Bill} = (\text{units} * 10)
- Else if, check that units consumed is less than equal to the 200, if yes then total electricity bill will be:
\text{Total Electricity Bill} = (100*10) + (\text{units}-100) * 15
- Else if, check that units consumed is less than equal to the 300, if yes then total electricity bill will be:
\text{Total Electricity Bill} = (100*10) + (100*15) + (\text{units}-200) * 20
- Else if, check that units consumed greater than 300, if yes then total electricity bill will be:
\text{Total Electricity Bill} = (100*10) + (100*15) + (100*20) + (\text{units}-300) * 25
Below is the implementation of the above approach:
C++
// C++ implementation to calculate the
// electricity bill
#include<bits/stdc++.h>
using namespace std;
// Function to calculate the
// electricity bill
int calculateBill(int units)
{
// Condition to find the charges
// bar in which the units consumed
// is fall
if (units <= 100)
{
return units * 10;
}
else if (units <= 200)
{
return (100 * 10) +
(units - 100) * 15;
}
else if (units <= 300)
{
return (100 * 10) +
(100 * 15) +
(units - 200) * 20;
}
else if (units > 300)
{
return (100 * 10) +
(100 * 15) +
(100 * 20) +
(units - 300) * 25;
}
return 0;
}
// Driver Code
int main()
{
int units = 250;
cout << calculateBill(units);
}
// This code is contributed by spp____
// Java implementation to calculate the
// electricity bill
import java.util.*;
class ComputeElectricityBill {
// Function to calculate the
// electricity bill
public static int calculateBill(int units)
{
// Condition to find the charges
// bar in which the units consumed
// is fall
if (units <= 100) {
return units * 10;
}
else if (units <= 200) {
return (100 * 10)
+ (units - 100)
* 15;
}
else if (units <= 300) {
return (100 * 10)
+ (100 * 15)
+ (units - 200)
* 20;
}
else if (units > 300) {
return (100 * 10)
+ (100 * 15)
+ (100 * 20)
+ (units - 300)
* 25;
}
return 0;
}
// Driver Code
public static void main(String args[])
{
int units = 250;
System.out.println(
calculateBill(units));
}
}
# Python3 implementation to calculate the
# electricity bill
# Function to calculate the
# electricity bill
def calculateBill(units):
# Condition to find the charges
# bar in which the units consumed
# is fall
if (units <= 100):
return units * 10;
elif (units <= 200):
return ((100 * 10) +
(units - 100) * 15);
elif (units <= 300):
return ((100 * 10) +
(100 * 15) +
(units - 200) * 20);
elif (units > 300):
return ((100 * 10) +
(100 * 15) +
(100 * 20) +
(units - 300) * 25);
return 0;
# Driver Code
units = 250;
print(calculateBill(units));
# This code is contributed by Code_Mech
// C# implementation to calculate the
// electricity bill
using System;
class ComputeElectricityBill{
// Function to calculate the
// electricity bill
public static int calculateBill(int units)
{
// Condition to find the charges
// bar in which the units consumed
// is fall
if (units <= 100)
{
return units * 10;
}
else if (units <= 200)
{
return (100 * 10) +
(units - 100) * 15;
}
else if (units <= 300)
{
return (100 * 10) +
(100 * 15) +
(units - 200) * 20;
}
else if (units > 300)
{
return (100 * 10) +
(100 * 15) +
(100 * 20) +
(units - 300) * 25;
}
return 0;
}
// Driver Code
public static void Main(String []args)
{
int units = 250;
Console.WriteLine(calculateBill(units));
}
}
// This code is contributed by spp____
<script>
// Javascript implementation to calculate the
// electricity bill
// Function to calculate the
// electricity bill
function calculateBill(units)
{
// Condition to find the charges
// bar in which the units consumed
// is fall
if (units <= 100)
{
return units * 10;
}
else if (units <= 200)
{
return (100 * 10)
+ (units - 100)
* 15;
}
else if (units <= 300)
{
return (100 * 10)
+ (100 * 15)
+ (units - 200)
* 20;
}
else if (units > 300)
{
return (100 * 10)
+ (100 * 15)
+ (100 * 20)
+ (units - 300)
* 25;
}
return 0;
}
// Driver Code
var units = 250;
document.write(calculateBill(units));
// This code is contributed by Khushboogoyal499
</script>
Time Complexity: O(1)
Auxiliary Space: O(1)
Approach 2 : In this approach, we can use an array to store the different rate of charges and their respective range of units. This approach can make the code more readable and easier to maintain. Here's how the code would look like:
C++
#include <bits/stdc++.h>
using namespace std;
const int n = 4;
// Function to calculate the electricity bill
int calculateBill(int units)
{
int charges[n] = { 10, 15, 20, 25 };
int range[n] = { 100, 100, 100, INT_MAX };
int bill = 0;
for (int i = 0; i < n; i++) {
if (units <= range[i]) {
bill += charges[i] * units;
break;
}
else {
bill += charges[i] * range[i];
units -= range[i];
}
}
return bill;
}
// Driver code
int main()
{
int units = 250;
cout << calculateBill(units);
return 0;
}
import java.util.*;
public class Main {
public static final int n = 4;
// Function to calculate the electricity bill
public static int calculateBill(int units) {
int[] charges = {10, 15, 20, 25};
int[] range = {100, 100, 100, Integer.MAX_VALUE};
int bill = 0;
for (int i = 0; i < n; i++) {
if (units <= range[i]) {
bill += charges[i] * units;
break;
}
else {
bill += charges[i] * range[i];
units -= range[i];
}
}
return bill;
}
// Driver code
public static void main(String[] args) {
int units = 250;
System.out.println(calculateBill(units));
}
}
// This code is contributed by divyansh2212
import sys
MAX_INT = sys.maxsize
n = 4
# Function to calculate the electricity bill
def calculateBill(units):
charges = [10, 15, 20, 25]
# changed variable name from 'range' to 'range_'
range_ = [100, 100, 100, MAX_INT]
bill = 0
for i in range(n):
if units <= range_[i]:
bill += charges[i] * units
break
else:
bill += charges[i] * range_[i]
units -= range_[i]
return bill
# Driver code
units = 250
print(calculateBill(units))
# This code is contributed by shivhack999
using System;
public class Program {
const int n = 4;
// Function to calculate the electricity bill
static int CalculateBill(int units)
{
int[] charges = { 10, 15, 20, 25 };
int[] range = { 100, 100, 100, int.MaxValue };
int bill = 0;
for (int i = 0; i < n; i++) {
if (units <= range[i]) {
bill += charges[i] * units;
break;
}
else {
bill += charges[i] * range[i];
units -= range[i];
}
}
return bill;
}
// Driver code
public static void Main()
{
int units = 250;
Console.WriteLine(CalculateBill(units));
}
}
// This code is contributed by sarojmcy2e
const n = 4;
// Function to calculate the electricity bill
function calculateBill(units) {
const charges = [10, 15, 20, 25];
const range = [100, 100, 100, Number.MAX_VALUE];
let bill = 0;
for (let i = 0; i < n; i++) {
if (units <= range[i]) {
bill += charges[i] * units;
break;
} else {
bill += charges[i] * range[i];
units -= range[i];
}
}
return bill;
}
// Driver code
const units = 250;
console.log(calculateBill(units));
// This code is contributed by shiv1o43g
Time Complexity : The time complexity of the calculateBill function is O(n), where n is the number of ranges of units and their respective charges. This is because the function uses a for loop to iterate through the range and charges arrays, and for each iteration, it performs a constant amount of work (calculating the bill based on the units consumed).
Since n is a constant value, the time complexity can be considered as O(1) in the best-case scenario. The function takes a constant amount of time to run, regardless of the number of units consumed.
Auxiliary Space : The space complexity of this code is O(n), where n is the number of rate of charges. This is because the program uses two arrays, charges and range, both of which have a size of n elements. The arrays take up 2 * n * sizeof(int) bytes of memory. In this case, n = 4, so the total memory occupied by the arrays is 2 * 4 * sizeof(int).
Similar Reads
Basics & Prerequisites
Data Structures
Array Data StructureIn this article, we introduce array, implementation in different popular languages, its basic operations and commonly seen problems / interview questions. An array stores items (in case of C/C++ and Java Primitive Arrays) or their references (in case of Python, JS, Java Non-Primitive) at contiguous
3 min read
String in Data StructureA string is a sequence of characters. The following facts make string an interesting data structure.Small set of elements. Unlike normal array, strings typically have smaller set of items. For example, lowercase English alphabet has only 26 characters. ASCII has only 256 characters.Strings are immut
2 min read
Hashing in Data StructureHashing is a technique used in data structures that efficiently stores and retrieves data in a way that allows for quick access. Hashing involves mapping data to a specific index in a hash table (an array of items) using a hash function. It enables fast retrieval of information based on its key. The
2 min read
Linked List Data StructureA linked list is a fundamental data structure in computer science. It mainly allows efficient insertion and deletion operations compared to arrays. Like arrays, it is also used to implement other data structures like stack, queue and deque. Here’s the comparison of Linked List vs Arrays Linked List:
2 min read
Stack Data StructureA Stack is a linear data structure that follows a particular order in which the operations are performed. The order may be LIFO(Last In First Out) or FILO(First In Last Out). LIFO implies that the element that is inserted last, comes out first and FILO implies that the element that is inserted first
2 min read
Queue Data StructureA Queue Data Structure is a fundamental concept in computer science used for storing and managing data in a specific order. It follows the principle of "First in, First out" (FIFO), where the first element added to the queue is the first one to be removed. It is used as a buffer in computer systems
2 min read
Tree Data StructureTree Data Structure is a non-linear data structure in which a collection of elements known as nodes are connected to each other via edges such that there exists exactly one path between any two nodes. Types of TreeBinary Tree : Every node has at most two childrenTernary Tree : Every node has at most
4 min read
Graph Data StructureGraph Data Structure is a collection of nodes connected by edges. It's used to represent relationships between different entities. If you are looking for topic-wise list of problems on different topics like DFS, BFS, Topological Sort, Shortest Path, etc., please refer to Graph Algorithms. Basics of
3 min read
Trie Data StructureThe Trie data structure is a tree-like structure used for storing a dynamic set of strings. It allows for efficient retrieval and storage of keys, making it highly effective in handling large datasets. Trie supports operations such as insertion, search, deletion of keys, and prefix searches. In this
15+ min read
Algorithms
Searching AlgorithmsSearching algorithms are essential tools in computer science used to locate specific items within a collection of data. In this tutorial, we are mainly going to focus upon searching in an array. When we search an item in an array, there are two most common algorithms used based on the type of input
2 min read
Sorting AlgorithmsA Sorting Algorithm is used to rearrange a given array or list of elements in an order. For example, a given array [10, 20, 5, 2] becomes [2, 5, 10, 20] after sorting in increasing order and becomes [20, 10, 5, 2] after sorting in decreasing order. There exist different sorting algorithms for differ
3 min read
Introduction to RecursionThe process in which a function calls itself directly or indirectly is called recursion and the corresponding function is called a recursive function. A recursive algorithm takes one step toward solution and then recursively call itself to further move. The algorithm stops once we reach the solution
14 min read
Greedy AlgorithmsGreedy algorithms are a class of algorithms that make locally optimal choices at each step with the hope of finding a global optimum solution. At every step of the algorithm, we make a choice that looks the best at the moment. To make the choice, we sometimes sort the array so that we can always get
3 min read
Graph AlgorithmsGraph is a non-linear data structure like tree data structure. The limitation of tree is, it can only represent hierarchical data. For situations where nodes or vertices are randomly connected with each other other, we use Graph. Example situations where we use graph data structure are, a social net
3 min read
Dynamic Programming or DPDynamic Programming is an algorithmic technique with the following properties.It is mainly an optimization over plain recursion. Wherever we see a recursive solution that has repeated calls for the same inputs, we can optimize it using Dynamic Programming. The idea is to simply store the results of
3 min read
Bitwise AlgorithmsBitwise algorithms in Data Structures and Algorithms (DSA) involve manipulating individual bits of binary representations of numbers to perform operations efficiently. These algorithms utilize bitwise operators like AND, OR, XOR, NOT, Left Shift, and Right Shift.BasicsIntroduction to Bitwise Algorit
4 min read
Advanced
Segment TreeSegment Tree is a data structure that allows efficient querying and updating of intervals or segments of an array. It is particularly useful for problems involving range queries, such as finding the sum, minimum, maximum, or any other operation over a specific range of elements in an array. The tree
3 min read
Pattern SearchingPattern searching algorithms are essential tools in computer science and data processing. These algorithms are designed to efficiently find a particular pattern within a larger set of data. Patten SearchingImportant Pattern Searching Algorithms:Naive String Matching : A Simple Algorithm that works i
2 min read
GeometryGeometry is a branch of mathematics that studies the properties, measurements, and relationships of points, lines, angles, surfaces, and solids. From basic lines and angles to complex structures, it helps us understand the world around us.Geometry for Students and BeginnersThis section covers key br
2 min read
Interview Preparation
Practice Problem