Drawing Book problem HackerRank

 A teacher asks the class to open their books to a page number. A student can either start turning pages from the front of the book or from the back of the book. They always turn pages one at a time. When they open the book, page  is always on the right side:

When they flip page , they see pages  and . Each page except the last page will always be printed on both sides. The last page may only be printed on the front, given the length of the book. If the book is  pages long, and a student wants to turn to page , what is the minimum number of pages to turn? They can start at the beginning or the end of the book.

Given  and , find and print the minimum number of pages that must be turned in order to arrive at page .

Example

Using the diagram above, if the student wants to get to page , they open the book to page , flip  page and they are on the correct page. If they open the book to the last page, page , they turn  page and are at the correct page. Return .

Function Description

Complete the pageCount function in the editor below.

pageCount has the following parameter(s):

• int n: the number of pages in the book
• int p: the page number to turn to

Returns

• int: the minimum number of pages to turn

Input Format

The first line contains an integer , the number of pages in the book.
The second line contains an integer, , the page to turn to.

import java.io.*;

import java.math.*;

import java.security.*;

import java.text.*;

import java.util.*;

import java.util.concurrent.*;

import java.util.function.*;

import java.util.regex.*;

import java.util.stream.*;

import static java.util.stream.Collectors.joining;

import static java.util.stream.Collectors.toList;

class Result {

    /*

     * Complete the 'pageCount' function below.

     *

     * The function is expected to return an INTEGER.

     * The function accepts following parameters:

     *  1. INTEGER n

     *  2. INTEGER p

     */

    public static int pageCount(int n, int p) {

    // Write your code here

  // Calculate number of page turns from the front

        int fromFront = p / 2;

       

//(n / 2) gives the total page turns in the book.

//(p / 2) gives the turns from the front to reach p.

// Calculate number of page turns from the back (substract front from total)

        int fromBack = (n / 2) - (p / 2);

        // Return the minimum number of turns

        return Math.min(fromFront, fromBack);

    }

}

public class Solution {

    public static void main(String[] args) throws IOException {

        BufferedReader bufferedReader = new BufferedReader(new InputStreamReader(System.in));

        BufferedWriter bufferedWriter = new BufferedWriter(new FileWriter(System.getenv("OUTPUT_PATH")));

        int n = Integer.parseInt(bufferedReader.readLine().trim());

        int p = Integer.parseInt(bufferedReader.readLine().trim());

        int result = Result.pageCount(n, p);

        bufferedWriter.write(String.valueOf(result));

        bufferedWriter.newLine();

        bufferedReader.close();

        bufferedWriter.close();

    }

}