Hackerrank - Jumping on the Clouds: Revisited

Hackerrank – Problem Statement

A description of the problem can be found on Hackerrank.

Solution

I jumped for k positions and lowered the energy. If I reached position 0 I printed the remaining enenergy.

I created solution in:

Scala
Java
JavaScript
Ruby

All solutions are also available on my GitHub.

Java

import java.util.*;

public class JumpingOnTheCloudsRevisited {

    public static void main(String[] args) {
        Scanner stdin = new Scanner(System.in);
        int n = stdin.nextInt();
        int k = stdin.nextInt();
        int[] clouds = new int[n];
        for(int i = 0; i < n; i++) {
            clouds[i] = stdin.nextInt();
        }
        int energy = 100;
        int pos = k % n;
        energy -= ((clouds[pos] == 1) ? 3 : 1);
        while(pos != 0) {
            pos = (pos + k) % n;
            energy -= ((clouds[pos] == 1) ? 3 : 1);
        }
        System.out.println(energy);
        stdin.close();
    }
}

import java.util.*;

public class JumpingOnTheCloudsRevisited {

public static void main(String[] args) {

Scanner stdin = new Scanner(System.in);

int n = stdin.nextInt();

int k = stdin.nextInt();

int[] clouds = new int[n];

for(int i = 0; i < n; i++) {

clouds[i] = stdin.nextInt();

}

int energy = 100;

int pos = k % n;

energy -= ((clouds[pos] == 1) ? 3 : 1);

while(pos != 0) {

pos = (pos + k) % n;

energy -= ((clouds[pos] == 1) ? 3 : 1);

}

System.out.println(energy);

stdin.close();

}

JavaScript

'use strict';

const processData = input => {
    const lines = input.split('\n');
    const [n, k] = lines[0].split(' ').map(i => parseInt(i));
    const clouds = lines[1].split(' ').map(i => parseInt(i));

    let energy = 100;
    let pos = k % n;
    energy -= ((clouds[pos] == 1) ? 3 : 1);
    while(pos != 0) {
        pos = (pos + k) % n;
        energy -= ((clouds[pos] == 1) ? 3 : 1);
    }
    console.log(energy);
};

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 lines = input.split('\n');

const [n, k] = lines[0].split(' ').map(i => parseInt(i));

const clouds = lines[1].split(' ').map(i => parseInt(i));

let energy = 100;

let pos = k % n;

energy -= ((clouds[pos] == 1) ? 3 : 1);

while(pos != 0) {

pos = (pos + k) % n;

energy -= ((clouds[pos] == 1) ? 3 : 1);

}

console.log(energy);

};

process.stdin.resume();

process.stdin.setEncoding("ascii");

let _input = "";

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

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

Scala

object JumpingOnTheCloudsRevisited extends App {
  val lines = Source.stdin.getLines().toList
  val nk = lines.head.split(" ").map(_.toInt)
  val n = nk(0)
  val k = nk(1)
  val clouds = lines(1).split(" ").map(_.toInt)
  var energy = 100
  var pos = k % n
  energy -= (if(clouds(pos) == 1) 3 else 1)
  while(pos != 0) {
    pos = (pos + k) % n
    energy -= (if(clouds(pos) == 1) 3 else 1)
  }
  println(energy)
}

object JumpingOnTheCloudsRevisited extends App {

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

val nk = lines.head.split(" ").map(_.toInt)

val n = nk(0)

val k = nk(1)

val clouds = lines(1).split(" ").map(_.toInt)

var energy = 100

var pos = k % n

energy -= (if(clouds(pos) == 1) 3 else 1)

while(pos != 0) {

pos = (pos + k) % n

energy -= (if(clouds(pos) == 1) 3 else 1)

}

println(energy)

}

Ruby

(n, k) = gets.split(" ").map(&:to_i)
clouds = gets.split(" ").map(&:to_i)

energy = 100
pos = k % n
energy -= ((clouds[pos] == 1) ? 3 : 1)
while(pos != 0) do
  pos = (pos + k) % n
  energy -= ((clouds[pos] == 1) ? 3 : 1)
end
puts energy

(n, k) = gets.split(" ").map(&:to_i)

clouds = gets.split(" ").map(&:to_i)

energy = 100

pos = k % n

energy -= ((clouds[pos] == 1) ? 3 : 1)

while(pos != 0) do

pos = (pos + k) % n

energy -= ((clouds[pos] == 1) ? 3 : 1)

end

puts energy

Pavol Pidanič

I can count to 1023 with 10 fingers

Hackerrank – Jumping on the Clouds: Revisited

Hackerrank – Problem Statement

Solution

Java

JavaScript

Scala

Ruby

Leave a Reply Cancel reply