从给定数字的开头算出k位数字的平均值，从结尾算出l位数字的平均值

给定三个整数N ， K和L。任务是找到给定数字N的前K个数字和后L个数字的平均值，而没有任何数字重叠。
例子：

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 = 3
Input: N = 456966, K = 1, L = 1 
Output: 5.0 
 

方法：如果n中的位数小于(K + L) ，则不可能找到没有位数重叠的平均值，并且在这种情况下打印-1 。如果不是这种情况，请找到N的最后L个数字的总和，并将其存储在变量sum1中，然后找到N的前K个数字的总和，并将其存储在sum2中。现在，将平均值打印为(sum1 + sum2)/(K + L) 。
下面是上述方法的实现：

C++

// implementation of the approach
#include 
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

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));
    }
}

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

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

Javascript

// javascript implementation of the approach   
 
    // Function to return the count
    // of digits in num
    function countDigits(num)
    {
        var cnt = 0;
        while (num > 0)
        {
            cnt++;
            num = parseInt(num/10);
        }
        return cnt;
    }
 
    // Function to return the sum
    // of first n digits of num
    function sumFromStart(num, n, rem)
    {
 
        // Remove the unnecessary digits
        num = (parseInt( num/Math.pow(10, rem)));
 
        var sum = 0;
        while (num > 0)
        {
            sum += (num % 10);
            num = parseInt(num/10);
        }
        return sum;
    }
 
    // Function to return the sum
    // of the last n digits of num
    function sumFromEnd(num , n)
    {
        var sum = 0;
        for (i = 0; i < n; i++)
        {
            sum += (num % 10);
            num = parseInt(num/10);
        }
        return sum;
    }
 
    function getAverage(n , k , l) {
 
        // If the average can't be calculated without
        // using the same digit more than once
        var totalDigits = countDigits(n);
        if (totalDigits < (k + l))
            return -1;
 
        // Sum of the last l digits of n
        var 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
        var sum2 = sumFromStart(n, k, totalDigits - k);
 
        // Return the average
        return ( (sum1 + sum2) /  (k + l));
    }
 
    // Driver code
    var n = 123456, k = 2, l = 3;
    document.write(getAverage(n, k, l));
 
// This code is contributed by Rajput-Ji

输出：

3.6