# Problems not solved at the end of Nth day

• Last Updated : 06 May, 2021

Given 3 integers K, P and N. Where, K is the number of problems given to the person every day and P is the maximum number of problems he can solve in a day. Find the total number of problems not solved after the N-th day.
Examples

```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```

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.  To complete your preparation from learning a language to DS Algo and many more,  please refer Complete Interview Preparation Course.

In case you wish to attend live classes with experts, please refer DSA Live Classes for Working Professionals and Competitive Programming Live for Students.

If P is greater than or equal to K then all problems will be solved on that day or (K-P) problems will be solved on each day so the answer will be 0 if K<=P else the answer will be (K-P)*N.
Below is the implementation of the above approach:

## C++

 `// C++ program to find problems not``// solved at the end of Nth day` `#include ``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

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

## Python3

 `# 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#

 `// 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

 ``

## Javascript

 ``
Output:
`30`

My Personal Notes arrow_drop_up