Hackerrank - Drawing Book - Pavol Pidanič

Hackerrank – Problem Statement

A description of the problem can be found on Hackerrank.

Solution

The equation to calculate no. of draws, when I started from the front of the book:

$draws = p / 2$

no. of draws, when I started from the back of the book:
if

$n$

is even

$n' = n$

else

$n' = n + 1$

$draws = (n' - p) / 2$

I created solution in:

Scala
Java
Javascript

All solutions are also available on my GitHub profile.

Scala

import scala.io.Source

object Solution extends App {
  val lines = Source.stdin.getLines().toList
  val n = lines.head.toInt
  val p = lines.tail.head.toInt

  val fromFront = p
  val fromBack = if(n % 2 == 0) {
    n + 1
  } else {
    n
  }
  val result = List(fromFront / 2, (fromBack - p) / 2).min

  println(result)
}

import scala.io.Source

object Solution extends App {

val lines = Source.stdin.getLines().toList

val n = lines.head.toInt

val p = lines.tail.head.toInt

val fromFront = p

val fromBack = if(n % 2 == 0) {

n + 1

} else {

}

val result = List(fromFront / 2, (fromBack - p) / 2).min

println(result)

}

Java

import java.util.*;

public class Solution {

    public static void main(String[] args) {
        Scanner stdin = new Scanner(System.in);
        int n = stdin.nextInt();
        int p = stdin.nextInt();

        int fromFront = p;
        int fromBack = n;
        if(n % 2 == 0) {
            fromBack = n + 1;
        }
        int result = Math.min(fromFront / 2, (fromBack - p) / 2);
        System.out.println(result);

        stdin.close();
    }
}

import java.util.*;

public class Solution {

public static void main(String[] args) {

Scanner stdin = new Scanner(System.in);

int n = stdin.nextInt();

int p = stdin.nextInt();

int fromFront = p;

int fromBack = n;

if(n % 2 == 0) {

fromBack = n + 1;

}

int result = Math.min(fromFront / 2, (fromBack - p) / 2);

System.out.println(result);

stdin.close();

}

Java

'use strict';

const processData = input => {
    const [n, p] = input.split('\n').map(i => parseInt(i));

    const fromFront = p;
    let fromBack = n;
    if(n % 2 == 0) {
        fromBack = n + 1;
    }
    const result = parseInt(Math.min(fromFront / 2, (fromBack - p) / 2));
    console.log(result);
};

process.stdin.resume();
process.stdin.setEncoding("ascii");

let _input = "";
process.stdin.on("data", input => _input += input);
process.stdin.on("end", () => processData(_input));

'use strict';

const processData = input => {

const [n, p] = input.split('\n').map(i => parseInt(i));

const fromFront = p;

let fromBack = n;

if(n % 2 == 0) {

fromBack = n + 1;

}

const result = parseInt(Math.min(fromFront / 2, (fromBack - p) / 2));

console.log(result);

};

process.stdin.resume();

process.stdin.setEncoding("ascii");

let _input = "";

process.stdin.on("data", input => _input += input);

process.stdin.on("end", () => processData(_input));

Pavol Pidanič

I can count to 1023 with 10 fingers

Hackerrank – Drawing Book

Hackerrank – Problem Statement

Solution

Scala

Java

Java

Leave a Reply Cancel reply