Lisa's Workbook

In this post i will explain the solution of the following problem at hackerrank.com.

Here is the problem statement.

This problem looks difficult at the first sight but it's not too difficult if you go step by step.

1. Create a loop which runs through the chapters.
2. Inside that loop create another loop which runs through all the problems in  that particular chapter and checks whether the problem number is equal to chapter number or not.

AN ADVICE : Try writing a code before reading further.Keep in mind the above 2 steps. If you don't succeed than come back here and read further.
First of all initialize two int variables to keep track of the page number and the number of special problem,i have initialized pagenum and spb as these two variables.Initialize another three variables for the number of chapters, maximum number of problems per page and the number of problems per chapter.
Take the inputs i.e. the number of chapters and the maximum number of problems per chapter. Now create a loop which runs through the chapters.
Now take another input which will be the number of problems per chapter. After that create another loop which will run through the problems in a particular chapter and check whether the problem number is equal to the page number or not. If equal than increase the variable  spb by 1, if not than continue. Take a look at my solution.
Hope it helped you :)

#include <iostream>
using namespace std;
int main() {
                int n,k,pagenum=1,spb=0, numprob;
                 cin>>n>>k;
 for(int i=1;i<=n;i++){
               cin>>numprob;          

               for(int j=1; j&lt =numprob; j++){   /* looping through the problems. */
                      if( pagenum==j&nbsp)spb++; /*if problem number is equal to page number than increase spb.*/
                    if( j==numprob || j%k==0 ) pagenum++; /*if j reaches the problem number or j%k=0 then increase the page number.*/
               }
  }
cout<<spb; /*print the number of special problems.*/
return 0;
}

*****

IF YOU WANT ME TO EXPLAIN A PERTICULAR PROBLEM THAN PLEASE LEAVE A LINK TO THE PROBLEM IN THE COMMENT SECTION

*****