# HackerRank : Week of Code 27 – Drawing Book

By | December 20, 2016

#### Drawing Book

Brie’s Drawing teacher asks her class to open their n-page drawing book to page number p. Brie can either start turning pages from the front of the book (i.e., page number 1) or from the back of the book (i.e., page number n), and she always turns pages one-by-one (as opposed to skipping through multiple pages at once). When she opens the book, page 1 is always on the right side:

Each page in the book has two sides, front and back, except for the last page which may only have a front side depending on the total number of pages of the book (see the Explanation sections below for additional diagrams).

Given n and p, find and print the minimum number of pages Brie must turn in order to arrive at page p.

Input Format

The first line contains an integer, n, denoting the number of pages in the book.
The second line contains an integer,p , denoting the page that Brie’s teacher wants her to turn to.

Constraints

1<=n<= 10^5
1<=p<= n

Output Format

Print an integer denoting the minimum number of pages Brie must turn to get to page p.

Sample Input 0

6
2


Sample Output 0

1


Explanation 0
If Brie starts turning from page  1, she only needs to turn 1 page:

If Brie starts turning from page 6 , she needs to turn 2 pages:

Because we want to print the minumum number of page turns, we print 1 as our answer.

Sample Input 1

5
4


Sample Output 1

0


Explanation 1
If Brie starts turning from page 1, she needs to turn 2 pages:

If Brie starts turning from page 5, she doesn’t need to turn any  pages:

Because we want to print the minimum number of page turns, we print 0 as our answer.

Source :  Hackerrank

Solution

I have used if else conditions to solve the problem.
Checked few cases like:
if the given input page , p==1.
check if the total pages are odd or even.

Test case 10 is failing. else all are passed.
Comment to get Suggestions.
import java.io.*;
import java.util.*;
import java.text.*;
import java.math.*;
import java.util.regex.*;

public class Solution {

public static void main(String[] args) {
Scanner in = new Scanner(System.in);
int n = in.nextInt();
int p = in.nextInt();
int t=0;
if(p>n)
{
System.out.println(0);
}
else
{
if(p==1)
t=0;
else
{
if(n%2==0)
{

t=p/2;
int mid=n/2;
if(p>(n/2)+1)
t=mid%t;
}
else
{
if(p==n || p==n-1)
t=0;
else
{
t=p/2;
int mid=n/2;
if(p>=(n/2)+1)
t=mid%t;
}
}
}
System.out.println(t);
}
}
}