Given three integers N, K and L. The task is to find the average of the first K digits and the last L digits of the given number N without any digit overlapping.
Examples:
Input: N = 123456, K = 2, L = 3
Output: 3.0
Sum of first K digits will be 1 + 2 = 3
Sum of last L digits will be 4 + 5 + 6 = 15
Average = (3 + 15) / (2 + 3) = 18 / 5 = 3Input: N = 456966, K = 1, L = 1
Output: 5.0
Approach: If the count of digits in n is less than (K + L) then it isn’t possible to find the average without digits overlapping and print -1 in that case. If that’s not the case, find the sum of the last L digits of N and store it in a variable say sum1 then find the sum of the first K digits of N and store it in sum2. Now, print the average as (sum1 + sum2) / (K + L).
Below is the implementation of the above approach:
C++
// implementation of the approach #include <bits/stdc++.h> using namespace std; // Function to return the count // of digits in num int countDigits(int num) { int cnt = 0; while (num > 0) { cnt++; num /= 10; } return cnt; } // Function to return the sum // of first n digits of num int sumFromStart(int num, int n, int rem) { // Remove the unnecessary digits num /= ((int)pow(10, rem)); int sum = 0; while (num > 0) { sum += (num % 10); num /= 10; } return sum; } // Function to return the sum // of the last n digits of num int sumFromEnd(int num, int n) { int sum = 0; for (int i = 0; i < n; i++) { sum += (num % 10); num /= 10; } return sum; } float getAverage(int n, int k, int l) { // If the average can't be calculated without // using the same digit more than once int totalDigits = countDigits(n); if (totalDigits < (k + l)) return -1; // Sum of the last l digits of n int sum1 = sumFromEnd(n, l); // Sum of the first k digits of n // (totalDigits - k) must be removed from the // end of the number to get the remaining // k digits from the beginning int sum2 = sumFromStart(n, k, totalDigits - k); // Return the average return ((float)(sum1 + sum2) / (float)(k + l)); } // Driver code int main() { int n = 123456, k = 2, l = 3; cout << getAverage(n, k, l); return 0; } // This code is contributed by PrinciRaj1992 |
chevron_right
filter_none
Java
// Java implementation of the approach class GFG { // Function to return the count // of digits in num public static int countDigits(int num) { int cnt = 0; while (num > 0) { cnt++; num /= 10; } return cnt; } // Function to return the sum // of first n digits of num public static int sumFromStart(int num, int n, int rem) { // Remove the unnecessary digits num /= ((int)Math.pow(10, rem)); int sum = 0; while (num > 0) { sum += (num % 10); num /= 10; } return sum; } // Function to return the sum // of the last n digits of num public static int sumFromEnd(int num, int n) { int sum = 0; for (int i = 0; i < n; i++) { sum += (num % 10); num /= 10; } return sum; } public static float getAverage(int n, int k, int l) { // If the average can't be calculated without // using the same digit more than once int totalDigits = countDigits(n); if (totalDigits < (k + l)) return -1; // Sum of the last l digits of n int sum1 = sumFromEnd(n, l); // Sum of the first k digits of n // (totalDigits - k) must be removed from the // end of the number to get the remaining // k digits from the beginning int sum2 = sumFromStart(n, k, totalDigits - k); // Return the average return ((float)(sum1 + sum2) / (float)(k + l)); } // Driver code public static void main(String args[]) { int n = 123456, k = 2, l = 3; System.out.print(getAverage(n, k, l)); } } |
chevron_right
filter_none
Python3
# implementation of the approach from math import pow # Function to return the count # of digits in num def countDigits(num): cnt = 0 while (num > 0): cnt += 1 num //= 10 return cnt # Function to return the sum # of first n digits of num def sumFromStart(num, n, rem): # Remove the unnecessary digits num //= pow(10, rem) sum = 0 while (num > 0): sum += (num % 10) num //= 10 return sum # Function to return the sum # of the last n digits of num def sumFromEnd(num, n): sum = 0 for i in range(n): sum += (num % 10) num //= 10 return sum def getAverage(n, k, l): # If the average can't be calculated without # using the same digit more than once totalDigits = countDigits(n) if (totalDigits < (k + l)): return -1 # Sum of the last l digits of n sum1 = sumFromEnd(n, l) # Sum of the first k digits of n # (totalDigits - k) must be removed from the # end of the number to get the remaining # k digits from the beginning sum2 = sumFromStart(n, k, totalDigits - k) # Return the average return (sum1 + sum2) / (k + l) # Driver code if __name__ == '__main__': n = 123456 k = 2 l = 3 print(getAverage(n, k, l)) # This code is contributed by # Surendra_Gangwar |
chevron_right
filter_none
C#
// C# implementation of the approach using System; class GFG { // Function to return the count // of digits in num public static int countDigits(int num) { int cnt = 0; while (num > 0) { cnt++; num /= 10; } return cnt; } // Function to return the sum // of first n digits of num public static int sumFromStart(int num, int n, int rem) { // Remove the unnecessary digits num /= ((int)Math.Pow(10, rem)); int sum = 0; while (num > 0) { sum += (num % 10); num /= 10; } return sum; } // Function to return the sum // of the last n digits of num public static int sumFromEnd(int num, int n) { int sum = 0; for (int i = 0; i < n; i++) { sum += (num % 10); num /= 10; } return sum; } public static float getAverage(int n, int k, int l) { // If the average can't be calculated without // using the same digit more than once int totalDigits = countDigits(n); if (totalDigits < (k + l)) return -1; // Sum of the last l digits of n int sum1 = sumFromEnd(n, l); // Sum of the first k digits of n // (totalDigits - k) must be removed from the // end of the number to get the remaining // k digits from the beginning int sum2 = sumFromStart(n, k, totalDigits - k); // Return the average return ((float)(sum1 + sum2) / (float)(k + l)); } // Driver code public static void Main(String []args) { int n = 123456, k = 2, l = 3; Console.WriteLine(getAverage(n, k, l)); } } // This code is contributed by Princi Singh |
chevron_right
filter_none
Output:
3.6
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:
- Check if given number contains a digit which is the average of all other digits
- Find smallest number with given number of digits and sum of digits under given constraints
- Find temperature of missing days using given sum and average
- Find the ratio of number of elements in two Arrays from their individual and combined average
- Find the Largest number with given number of digits and sum of digits
- Find the deleted value from the array when average of original elements is given
- Numbers of Length N having digits A and B and whose sum of digits contain only digits A and B
- Average of odd numbers till a given odd number
- Average of even numbers till a given even number
- Count of numbers from range [L, R] that end with any of the given digits
- Find the subarray with least average
- Find the average of first N natural numbers
- Program to find simple moving average
- Find average of two numbers using bit operation
- Find the Batting Average of a batsman
- Maximize the given number by replacing a segment of digits with the alternate digits given
- Number of digits in the nth number made of given four digits
- Minimum digits to be removed to make either all digits or alternating digits same
- Find the number of consecutive zero at the end after multiplying n numbers
- Count of integers in a range which have even number of odd digits and odd number of even digits
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.
