Hackerrank - Cut the sticks

Hackerrank – Popis problému

Celý popis zadania sa nacháza – Hackerrank.

Riešenie

Pokiaľ nebude pole sticks prázdne

vypíš veľkosť poľa
usporiadaj pole
zober najmenší prvok poľa, ktorý je po usporiadaní na začiatku
vytvor nové pole, ktoré bude obsahovať už len väčšie prvky

Vytvoril som riešenie v týchto programovacích jazykoch:

Scala
Java
JavaScript
Ruby

Všetky riešenia sú dostupné aj na mojom GitHub profile.

Java

import java.util.*;

public class CutTheSticks {

    public static void main(String[] args) {
        Scanner stdin = new Scanner(System.in);
        int tests = stdin.nextInt();
        List<Integer> sticks = new LinkedList<>();
        for(int i = 0; i < tests; i++) {
            sticks.add(stdin.nextInt());
        }

        while(!sticks.isEmpty()) {
            System.out.println(sticks.size());
            Collections.sort(sticks);
            int min = sticks.get(0);
            List<Integer> filtered = new LinkedList<>();
            for(int j = 0; j < sticks.size(); j++) {
                if(sticks.get(j) > min) {
                    filtered.add(sticks.get(j));
                }
            }
            sticks = filtered;
        }
        stdin.close();
    }
}

import java.util.*;

public class CutTheSticks {

public static void main(String[] args) {

Scanner stdin = new Scanner(System.in);

int tests = stdin.nextInt();

List<Integer> sticks = new LinkedList<>();

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

sticks.add(stdin.nextInt());

}

while(!sticks.isEmpty()) {

System.out.println(sticks.size());

Collections.sort(sticks);

int min = sticks.get(0);

List<Integer> filtered = new LinkedList<>();

for(int j = 0; j < sticks.size(); j++) {

if(sticks.get(j) > min) {

filtered.add(sticks.get(j));

}

sticks = filtered;

}

stdin.close();

}

JavaScript

'use strict';

const processData = input => {
    const lines = input.split('\n');
    let sticks = lines[1].split(' ').map(i => parseInt(i));
    while(sticks.length > 0) {
        console.log(sticks.length);
        sticks.sort((a, b) => a - b);
        const min = sticks[0];
        sticks = sticks.filter(i => i > min);
    }
};

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');

let sticks = lines[1].split(' ').map(i => parseInt(i));

while(sticks.length > 0) {

console.log(sticks.length);

sticks.sort((a, b) => a - b);

const min = sticks[0];

sticks = sticks.filter(i => i > min);

}

};

process.stdin.resume();

process.stdin.setEncoding("ascii");

let _input = "";

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

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

Scala

import scala.io.Source

object CutTheSticks extends App {
  var sticks = Source.stdin.getLines().toList.tail.head.split(" ").map(_.toInt)
  while (!sticks.isEmpty) {
    println(sticks.length)
    val sortedSticks = sticks.sorted
    val min = sortedSticks(0)
    sticks = sortedSticks.filter(_ > min)
  }
}

import scala.io.Source

object CutTheSticks extends App {

var sticks = Source.stdin.getLines().toList.tail.head.split(" ").map(_.toInt)

while (!sticks.isEmpty) {

println(sticks.length)

val sortedSticks = sticks.sorted

val min = sortedSticks(0)

sticks = sortedSticks.filter(_ > min)

}

Ruby

n = gets.to_i
sticks = gets.split.map(&:to_i)
while(sticks.size > 0) do
  puts sticks.size
  sticks.sort!{|a, b| a <=> b}
  min = sticks[0]
  sticks = sticks.filter {|i| i > min}
end

n = gets.to_i

sticks = gets.split.map(&:to_i)

while(sticks.size > 0) do

puts sticks.size

sticks.sort!{|a, b| a <=> b}

min = sticks[0]

sticks = sticks.filter {|i| i > min}

end

Pavol Pidanič

Dokážem na 10 prstoch napočítať do 1023

Hackerrank – Cut the sticks