Problemas no resueltos al final del enésimo día

Dados 3 números enteros K, P y N. Donde, K es el número de problemas que se le dan a la persona todos los días y P es el número máximo de problemas que puede resolver en un día. Encuentre el número total de problemas no resueltos después del N-ésimo día.
Ejemplos : 
 

Input :  K = 2, P = 1, N = 3
Output : 3
On each day 1 problem is left so 3*1 = 3 
problems left after Nth day.

Input : K = 4, P = 1, N = 10
Output : 30

Si P es mayor o igual a K, todos los problemas se resolverán ese día o (KP) los problemas se resolverán cada día, por lo que la respuesta será 0 si K<=P, de lo contrario, la respuesta será (KP)*N .
A continuación se muestra la implementación del enfoque anterior: 
 

// C++ program to find problems not
// solved at the end of Nth day
 
#include <bits/stdc++.h>
using namespace std;
 
// Function to find problems not
// solved at the end of Nth day
int problemsLeft(int K, int P, int N)
{
    if (K <= P)
        return 0;
    else
        return (K - P) * N;
}
 
// Driver Code
int main()
{
    int K, P, N;
 
    K = 4;
    P = 1;
    N = 10;
 
    cout << problemsLeft(K, P, N);
 
    return 0;
}

// Java program to find problems not
// solved at the end of Nth day
 
class Gfg {
 
    // Function to find problems not
    // solved at the end of Nth day
    public static int problemsLeft(int K, int P, int N)
    {
        if (K <= P)
            return 0;
        else
            return ((K - P) * N);
    }
 
    // Driver Code
    public static void main(String args[])
    {
        int K, P, N;
        K = 4;
        P = 1;
        N = 10;
 
        System.out.println(problemsLeft(K, P, N));
    }
}

# Python program to find problems not
# solved at the end of Nth day
 
def problemsLeft(K, P, N):
    if(K<= P):
        return 0
    else:
        return ((K-P)*N)
 
# Driver Code
K, P, N = 4, 1, 10
 
print(problemsLeft(K, P, N))

// C# program to find problems not
// solved at the end of Nth day
using System;
 
class GFG
{
 
// Function to find problems not
// solved at the end of Nth day
public static int problemsLeft(int K,
                               int P, int N)
{
    if (K <= P)
        return 0;
    else
        return ((K - P) * N);
}
 
// Driver Code
public static void Main()
{
    int K, P, N;
    K = 4;
    P = 1;
    N = 10;
 
    Console.WriteLine(problemsLeft(K, P, N));
}
}
 
// This code is contributed by vt_m

<?php
// PHP program to find problems not
// solved at the end of Nth day
 
// Function to find problems not
// solved at the end of Nth day
function problemsLeft($K, $P, $N)
{
    if ($K <= $P)
        return 0;
    else
        return ($K - $P) * $N;
}
 
// Driver Code
$K = 4;
$P = 1;
$N = 10;
 
echo problemsLeft($K, $P, $N);
 
// This code is contributed by anuj_67
?>

<script>
// JavaScript program to find problems not
// solved at the end of Nth day
 
// Function to find problems not
// solved at the end of Nth day
function problemsLeft( K, P, N){
    if (K <= P)
        return 0;
    else
        return (K - P) * N;
}
 
// Driver Code
let K, P, N;
 
    K = 4;
    P = 1;
    N = 10;
 
document.write(problemsLeft(K, P, N));
 
// This code is contributed by rohitsingh07052.
</script>

30