Turning Book Pages

PKJ

 Coding Problem Keys 

 Turning Book Pages 

 Problem Statement 

A book can be turned either from front or from the back. When we open a book always we have the page 1 always on the right. The book pages must always be turned one by one instead of multiple pages at once. Each page has two sides, front and back. Hence the last page may have only front side depending on the total number of pages N in the book (If N is even, it will have both sides printed else if N is odd only the front side will be printed).

Now Manoj wants to navigate to a page P in the book by turning the least minimum pages either from front or back. Please help Manoj by completing the program as per the given requirement.

 Boundary Condition(S) 

1 <= N <= 10000
1 <= P <= N

 Input Format 

The first line will contain the value of N which represents the total number of pages in the book.
The second line will contain the value of P which represents the page to be navigated.

 Output Format 

The first line will contain the integer value which is the least minimum pages to be turned either from front or back.

 Example Input/Output 1 

 Input 

8
6

 Output 

1

 Explanation 

From front, after turn 1, pages 2 & 3 are visible. After turn 2, pages 4 & 5 are visible. In the third turn pages 6 & 7 are visible. So 3 turns are required from front.
From back, the last page back side is page 8. So after turn 1, pages 6 & 7 are visible. So 1 turn is required from the back.
The minimum of 3 and 1 (which is 1) is printed as the output.

 Example Input/Output 2 

 Input 

12
4

 Output 

2

 Explanation 

From front, after turn 1, pages 2 & 3 are visible. After turn 2, pages 4 & 5 are visible. So 2 turns are required from front.
From back, the last page from back side is page 12. So after turn 1, pages 10 & 11 are visible. After turn 2, pages 8 & 9 are visible. After turn 3, pages 6 & 7 are visible. Only after turn 4, pages 4 and 5 are visible. So 4 turns are required from the back.
The minimum of 2 and 4 (which is 2) is printed as the output.

 Hidden Test Cases 

 Test Case 1 

 Input 

8
5

 Output 

2

 Test Case 2 

 Input 

13
12

 Output 

0

 Test Case 3 

 Input 

354
353

 Output 

1

 Test Case 4 

 Input 

745
562

 Output 

91

 Test Case 5 

 Input 

1576
1

 Output 

0

 Note: Max Execution Time Limit: 5000 millisecs 

 Solution 

 Programming Language: Python 3 Language 

total=int(input())
navigate=int(input())
if(total%2==0):
    total+=1
front=navigate//2
back=(total-navigate)//2
print(min(front,back))

# Published By PKJCODERS

 (Note: Incase If the code doesn't Pass the output kindly comment us with your feedback to help us improvise.) 

Comments

Post a Comment

Popular Posts

Difference between a number and it's reverse

PKJ
 Coding Problem Keys   Difference between a number and it's reverse   Problem Statement  The number N is passed as input. The program must print the difference between the number N and it's reverse R.  Boundary Condition(S)  10 <= N <= 9999999  Input Format  The first line denotes the value of N.  Output Format  The first line contains the value of difference of N and R.  Example Input/Output 1   Input  42  Output  18  Explanation  The output is 42 - 24 = 18.  Example Input/Output 2   Input  555  Output  0  Explanation  The output is 555 - 555 = 0.  Example Input/Output 3   Input  125  Output  -396  Explanation  The output is 125 - 521 = -396.  Note: Max Execution Time Limit: 5000 millisecs   Solution   Programming Language: Python 3 Language  n= input ().strip() print ( in...
Click to Continue...

Snakes and Ladders

PKJ
 Coding Problem Keys   Snakes and Ladders   Problem Statement  In an R*C matrix, a snake is represented using the letter 'S' and the ladder is represented using the letter 'L'. A kid is playing the Snakes and Ladders game with this matrix and a die which can show from 1 to 6. The game always starts with the pawn in the lower left most cell in the matrix and the aim is to reach or cross the top left most cell by casting the die as many times as required. Based on the number cast in the die, if the pawn lands up in a cell containing a snake, the pawn must move to the immediate lower row (if it is not in the lowermost row) in the same column. Based on the number cast in the die, if the pawn lands up in a cell containing a ladder, the pawn must move to the immediate upper row in the same column (It may so happen that the pawn is already in the top most row and if it encounters a ladder it is consider...
Click to Continue...

Reverse Column - First and Last

PKJ
 Coding Problem Keys   Reverse Column - First and Last   Problem Statement  The program must accept an integer matrix of size RxC as the input. The program must reverse all the elements in the column if the first and last elements of the column are same. Then the program must print the modified matrix as the output.  Input Format  The first line contains the value of R and C separated by space. The next R lines contain each C elements separated by space(s).  Output Format  The first R lines contain each C elements separated by space.  Boundary Condition(s)  2 <= R, C <= 50 -999 <= Each element of the matrix <= 999  Example Input/Output 1   Input  5 4 11 7 5 19 4 13 16 10 9 9 13 0 7 5 17 8 11 8 5 12   Output  11 7 5 19 7 13 17 10 9 9 13 0 4 5 16 8 11 8 5 12  Explanation  The elements in the first column are 11, 4, 9, 7 and 11. Here the first and the last elements are same. So ...
Click to Continue...

Sum of N Integers - Even Reversed

PKJ
 Coding Problem Keys   Sum of N Integers - Even Reversed   Problem Statement  The program must accept N integers and print the sum S of all POSITIVE integers with the even positive integers reversed.  Boundary Condition(S)  1 <= N <= 100000  Input Format  The first line will contain N. The second line will contain the N integers separated by a space.  Output Format  The first line will contain S.  Example Input/Output 1   Input  4 39 -8 57 24  Output  138  Explanation  The sum = 39 + 57 + 42 = 138 (The even number 24 is reversed).  Example Input/Output 2   Input  3 -23 -11 -445  Output  0  Note: Max Execution Time Limit: 5000 millisecs   Solution   Programming Language: Python 3 Language  n= int ( input ()) l= list ( map ( str , input ().split())) s= 0 for i in l: if '-' not in i: if ( int (i)% 2 ==...
Click to Continue...

Matrix Diagonal Pattern

PKJ
 Coding Problem Keys   Matrix Diagonal Pattern   Problem Statement  Given an integer matrix of size N*N as input, the program must print only the diagonal elements. The remaining elements must be replaced by *.  Boundary Condition(s)  1 <= N <= 50  Input Format  The first line contains the value of N. The next N lines contain N values separated by space(s).  Output Format  The first N lines contain the modified matrix as mentioned above.  Example Input/Output 1   Input  3 1 8 9 4 8 7 5 2 8   Output  1 * 9 * 8 * 5 * 8  Example Input/Output 2   Input  6 31 62 5 8 39 3 37 2 79 76 97 81 9 1 43 86 5 37 9 77 85 45 87 36 41 6 65 75 9 3 22 69 45 83 20 90  Output  31 * * * * 3 * 2 * * 97 * * * 43 86 * * * * 85 45 * * * 6 * * 9 * 22 * * * * 90  Max Execution Time Limit: 5000 millisecs   Solution   Programming Language: Python 3 Language  n= in...
Click to Continue...

Sort the Binary Values

PKJ
 Coding Problem Keys   Sort the Binary Values   Problem Statement  Given N pairs consisting of an integer X representing the number of bits to consider and B representing a binary value as input, the program must find the decimal values based on the following conditions:     - If X is positive then consider the first X bits in the binary value.     - If X is negative then consider the last X bits in the binary value.     - If X is zero then consider all the bits in the binary value. Finally, the program must sort (in ascending order) based on the considered binary values converted to their decimal equivalent. Then the program must print the original binary values in the sorted order.  Boundary Condition(s)  1 <= N <= 100 -20 <= X <= 20 1 <= Number of bits in B <= 20  Input Format  The first line contains the value of N. The next M lines contain pair of integers X and B separated by space(s)...
Click to Continue...