Given the initial balance as bal and the amount X to be debited, where X must be a multiple of 10 and rupees 1.50 is deducted as the debit charge for each successful debit. The task is to find the remaining balance left after the transaction, which can be successful, or unsuccessful. The balances are in 2 floating-point precision.
Input: X = 50, bal = 100.50 Output: 49.00 Transaction successful Input: X = 55, bal = 99.00 Output: 99.00 Transaction unsuccessful
Approach: Find out if the transaction can be successful or not.
- The transaction can be successful if:
- X is a multiple of 10, and
- the person has at least (X+1.50) rupees, that is the money to be withdrawn plus the charges, in the account.
- In any other case, the transaction will be unsuccessful.
- If the transaction is successful, then deduct the (X + 1.50) amount from the balance and return it
- Else just return the balance.
Below is the implementation of the above approach:
- Balance pans using given weights that are powers of a number
- Area of plot remaining at the end
- Element equal to the sum of all the remaining elements
- Check if the array has an element which is equal to sum of all the remaining elements
- Check if the array has an element which is equal to product of remaining elements
- Delete odd and even numbers at alternate step such that sum of remaining elements is minimized
- Append a digit in the end to make the number equal to the length of the remaining string
- Find (1^n + 2^n + 3^n + 4^n) mod 5 | Set 2
- Find the value of f(n) / f(r) * f(n-r)
- Find the value of max(f(x)) - min(f(x)) for a given F(x)
- Find 2^(2^A) % B
- Find value of (n^1 + n^2 + n^3 + n^4) mod 5 for given n
- Find K such that |A - K| = |B - K|
- Find value of (1^n + 2^n + 3^n + 4^n ) mod 5
- Find x and y satisfying ax + by = n
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. 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.