Archives scala - Stránka 3 z 15

Hackerrank – Priyanka and Toys

Hackerrank – Popis problému Celý popis zadania sa nacháza – Hackerrank. Riešenie Vytvoril som riešenie v týchto programovacích jazykoch: Scala Java Javascript Všetky riešenia sú dostupné aj na mojom GitHub profile. Scala

object PriyankaAndToys extends App {
  val lines = Source.stdin.getLines().toList
  val n = Integer.parseInt(lines.head)
  val weights = lines.tail.head.split("\\s+").map(_.toInt).sorted
  var price = 1
  var lastWeight = weights(0)

  var i = 1
  while ( {
    i < weights.length
  }) {
    if (lastWeight + 4 >= weights(i)) {
      // lastWeight = toys[i];
    }
    else {
      price += 1
      lastWeight = weights(i)
    }

    {
      i += 1; i - 1
    }
  }
  println(price)
}

object PriyankaAndToys extends App {

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

val n = Integer.parseInt(lines.head)

val weights = lines.tail.head.split("\\s+").map(_.toInt).sorted

var price = 1

var lastWeight = weights(0)

var i = 1

while ( {

i < weights.length

}) {

if (lastWeight + 4 >= weights(i)) {

// lastWeight = toys[i];

}

else {

price += 1

lastWeight = weights(i)

}

{

i += 1; i - 1

}

println(price)

}

Java

import java.util.Arrays;
import java.util.Scanner;

public class PriyankaAndToys
{
    public static void main(String[] args)
    {
        Scanner scanner = new Scanner(System.in);
        int n = Integer.parseInt(scanner.nextLine());
        String[] weights = scanner.nextLine().split("\\s+");

        int[] toyWeights = new int[n];
        for (int i = 0; i < n; i++)
        {
            toyWeights[i] = Integer.parseInt(weights[i]);
        }

        Arrays.sort(toyWeights);
        int price = 1;
        int lastWeight = toyWeights[0];

        for (int i = 1; i < toyWeights.length; i++)
        {
            if(lastWeight + 4 >= toyWeights[i])
            {
                // lastWeight = toys[i];
            }
            else
            {
                price++;
                lastWeight = toyWeights[i];
            }
        }
        System.out.println(price);
        scanner.close();
    }
}

import java.util.Arrays;

import java.util.Scanner;

public class PriyankaAndToys

{

public static void main(String[] args)

{

Scanner scanner = new Scanner(System.in);

int n = Integer.parseInt(scanner.nextLine());

String[] weights = scanner.nextLine().split("\\s+");

int[] toyWeights = new int[n];

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

{

toyWeights[i] = Integer.parseInt(weights[i]);

}

Arrays.sort(toyWeights);

int price = 1;

int lastWeight = toyWeights[0];

for (int i = 1; i < toyWeights.length; i++)

{

if(lastWeight + 4 >= toyWeights[i])

{

// lastWeight = toys[i];

}

else

{

price++;

lastWeight = toyWeights[i];

}

System.out.println(price);

scanner.close();

}

Javascript ‚use strict‘; const processData = input => { const lines = input.split(‚\n‘); const n = parseInt(lines[0]); const weights = […]

Hackerrank – Grading Students

Hackerrank – Popis problému Celý popis zadania sa nacháza – Hackerrank. Riešenie Treba pretransformovať každú známku podľa profesorových pravidiel: – najprv si zistím koľkonásobok 5 je daná známka (n) – ak je deliteľná 5 bezo zvyšku, vôbec ju neupravujem — ak nie je, zaokrúhlim ju: (n + 1) * 5 – zistím najbližší násobok 5 […]

Hackerrank – Between Two Sets

Hackerrank – Popis problému Celý popis zadania sa nacháza – Hackerrank. Riešenie Vytvorim si pole všetkých pozitívnych čísel, ktoré spĺňajú podmienky úlohy. Bude obsahovať prvky od do . Pre všetky tieto prvky zistím, či pre všetky a . Vypíšem počet takých čísel. Počiatočné pole sa dá zmenšiť. Bude obsahovať len čísla […]

Hackerrank – The Hurdle Race

Hackerrank – Popis problému Celý popis zadania sa nacháza – Hackerrank. Riešenie Je potrebné nájsť najvyššiu prekážku v pretekoch. Ak je väčšia ako k, urobiť ich rozdiel a odstaneme počet nápojov, ktoré stačí vypiť. Inak vypíšeme 0. Vytvoril som riešenie v týchto programovacích jazykoch: Scala Java Javascript Ruby Všetky riešenia sú dostupné aj na mojom […]

Hackerrank – Mini-Max Sum

Hackerrank – Popis problému Celý popis zadania sa nacháza – Hackerrank. Riešenie Ak budú prvky usporiadané vzostupne – najmenší súčet bude mať prvých n-1 prvkov – najväčší súčet je medzi poslednými n-1 prvkami 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 MiniMaxSum {

    public static void main(String[] args) {
        Scanner stdin = new Scanner(System.in);
        Object[] numbers = Arrays.stream(stdin.nextLine().split(" "))
                .map(Long::parseLong).toArray();
        Arrays.sort(numbers);
        long minSum = 0;
        long maxSum = 0;
        for(int i = 0; i < numbers.length - 1; i++) {
            minSum += (long) numbers[i];
            maxSum += (long) numbers[i + 1];
        }

        System.out.println(minSum + " " + maxSum);
        stdin.close();
    }
}

import java.util.*;

public class MiniMaxSum {

public static void main(String[] args) {

Scanner stdin = new Scanner(System.in);

Object[] numbers = Arrays.stream(stdin.nextLine().split(" "))

.map(Long::parseLong).toArray();

Arrays.sort(numbers);

long minSum = 0;

long maxSum = 0;

for(int i = 0; i < numbers.length - 1; i++) {

minSum += (long) numbers[i];

maxSum += (long) numbers[i + 1];

}

System.out.println(minSum + " " + maxSum);

stdin.close();

}

[…]

Hackerrank – Bon Appétit

Hackerrank – Popis problému Celý popis zadania sa nacháza – Hackerrank. Riešenie Vypočítame správnu sumu peňazí, ktoré je potrebné zaplatiť – (food_sum – index_of_allergic) / 2. Potom stačí porovnať, či sa vypočítaná suma zhoduje s množstom zadaným pri popise problému. Vytvoril som riešenie v týchto programovacích jazykoch: Scala Java JavaScript Ruby Všetky riešenia sú dostupné […]

Hackerrank – Sequence full of colors

Hackerrank – Popis problému Celý popis zadania sa nacháza – Hackerrank. Riešenie Implementoval som rekurzívnu funkciu, ktorá berie do úvahy zadané podmienky – pozri jej implementáciu. Vytvoril som riešenie v týchto programovacích jazykoch: Scala Všetky riešenia sú dostupné aj na mojom GitHub profile. Scala

import scala.io.Source
import scala.collection.mutable.Map

object SequenceFullOfColors extends App {
  val lines = Source.stdin.getLines().toList.tail
  val results = lines.map(fullOfColors).map(_.toString.capitalize)

  println(results.mkString("\n"))

  def fullOfColors(sequence: String): Boolean = {
    val colors = Map.empty[Char, Int]
    def prefixSequences(seq: String, n: Int): Boolean = {
      val char = seq(n)
      val count = colors.getOrElse(char, 0)
      colors.put(char, count + 1)
      if(n < seq.length - 1) {
        val greenCount = colors.getOrElse('G', 0)
        val redCount = colors.getOrElse('R', 0)
        val yellowCount = colors.getOrElse('Y', 0)
        val blueCount = colors.getOrElse('B', 0)
        if((greenCount - redCount).abs <= 1 && (yellowCount - blueCount).abs <= 1) {
          return prefixSequences(seq, n + 1)
        }
        return false
      }
      true
    }

    val condition = prefixSequences(sequence, 0)
    val greenCount = colors.getOrElse('G', 0)
    val redCount = colors.getOrElse('R', 0)
    val yellowCount = colors.getOrElse('Y', 0)
    val blueCount = colors.getOrElse('B', 0)
    condition && (greenCount == redCount) && (yellowCount == blueCount)
  }
}

import scala.io.Source

import scala.collection.mutable.Map

object SequenceFullOfColors extends App {

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

val results = lines.map(fullOfColors).map(_.toString.capitalize)

println(results.mkString("\n"))

def fullOfColors(sequence: String): Boolean = {

val colors = Map.empty[Char, Int]

def prefixSequences(seq: String, n: Int): Boolean = {

val char = seq(n)

val count = colors.getOrElse(char, 0)

colors.put(char, count + 1)

if(n < seq.length - 1) {

val greenCount = colors.getOrElse('G', 0)

val redCount = colors.getOrElse('R', 0)

val yellowCount = colors.getOrElse('Y', 0)

val blueCount = colors.getOrElse('B', 0)

if((greenCount - redCount).abs <= 1 && (yellowCount - blueCount).abs <= 1) {

return prefixSequences(seq, n + 1)

}

return false

}

true

}

val condition = prefixSequences(sequence, 0)

val greenCount = colors.getOrElse('G', 0)

val redCount = colors.getOrElse('R', 0)

val yellowCount = colors.getOrElse('Y', 0)

val blueCount = colors.getOrElse('B', 0)

condition && (greenCount == redCount) && (yellowCount == blueCount)

}

Hackerrank – Jumping Bunnies

Hackerrank – Popis problému Celý popis zadania sa nacháza – Hackerrank. Riešenie Vypočítaj Najmenší spoločný násobok veľkosti skokov. Vytvoril som riešenie v týchto programovacích jazykoch: Scala Všetky riešenia sú dostupné aj na mojom GitHub profile. Scala

import scala.io.Source

object JumpingBunnies extends App {
  val lines = Source.stdin.getLines().toList
  val bunnies = lines(1).split(" ").map(_.toInt)

  val commonPoint = bunnies.foldLeft(BigInt(1))(lcm(_, _))

  println(commonPoint)

  def gcd(x: BigInt, y: BigInt): BigInt = {
    if(y == 0) x else gcd(y, x % y)
  }

  def lcm(x: BigInt, y: BigInt): BigInt = {
    (x * y) / gcd(x, y)
  }
}

import scala.io.Source

object JumpingBunnies extends App {

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

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

val commonPoint = bunnies.foldLeft(BigInt(1))(lcm(_, _))

println(commonPoint)

def gcd(x: BigInt, y: BigInt): BigInt = {

if(y == 0) x else gcd(y, x % y)

}

def lcm(x: BigInt, y: BigInt): BigInt = {

(x * y) / gcd(x, y)

}

Hackerrank – Repeated String

Hackerrank – Popis problému Celý popis zadania sa nacháza – Hackerrank. Riešenie Dĺžka slova opakovaného niekoľkokrát za sebou by prekročila časové limity pre toto zadanie. Musíme si ho nejako zjednodušiť. Máme zadaný reťazec – s. Spočítame výskyt znaku „a“ a označíme si ho ako – c Získaj dĺžku výsledného reťazca (zadané na druhom riadku) – […]

Hackerrank – Viral Advertising

Hackerrank – Popis problému Celý popis zadania sa nacháza – Hackerrank. Riešenie Použi vzorec zo zadania úlohy. 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 ViralAdvertising {

    public static void main(String[] args) {
        Scanner stdin = new Scanner(System.in);
        int n = Integer.parseInt(stdin.nextLine());
        int totalLiked = 0;
        int dayStartPeople = 5;
        for(int i = 0; i < n; i++) {
            int dayLiked = dayStartPeople / 2;
            int received = dayLiked * 3;
            totalLiked += dayLiked;
            dayStartPeople = received;
        }
        System.out.println(totalLiked);
        stdin.close();
    }
}

import java.util.*;

public class ViralAdvertising {

public static void main(String[] args) {

Scanner stdin = new Scanner(System.in);

int n = Integer.parseInt(stdin.nextLine());

int totalLiked = 0;

int dayStartPeople = 5;

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

int dayLiked = dayStartPeople / 2;

int received = dayLiked * 3;

totalLiked += dayLiked;

dayStartPeople = received;

}

System.out.println(totalLiked);

stdin.close();

}

JavaScript

'use strict';

const processData = input => {
    const n = parseInt(input)

    let totalLiked = 0;
    let dayStartPeople = 5;
    for(let i = 0; i < n; i++) {
        const dayLiked = parseInt(dayStartPeople / 2);
        const received = dayLiked * 3;
        totalLiked += dayLiked;
        dayStartPeople = received;
    }
    console.log(totalLiked);
};

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 = parseInt(input)

let totalLiked = 0;

let dayStartPeople = 5;

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

const dayLiked = parseInt(dayStartPeople / 2);

const received = dayLiked * 3;

totalLiked += dayLiked;

dayStartPeople = received;

}

console.log(totalLiked);

};

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 ViralAdvertising extends App {
  val n = Source.stdin.bufferedReader().readLine().toInt

  println(like(5).take(n).sum)


  def like(start: Long): Stream[Long] = {
    val liked = start / 2
    val received = liked * 3
    liked #:: like(received)
  }
}

import scala.io.Source

object ViralAdvertising extends App {

val n = Source.stdin.bufferedReader().readLine().toInt

println(like(5).take(n).sum)

def like(start: Long): Stream[Long] = {

val liked = start / 2

val received = liked * 3

liked #:: like(received)

}

Ruby

n = gets.to_i
    
total_liked = 0
day_start_people = 5
for i in 0...n do
  day_liked = day_start_people / 2
  received = day_liked * 3
  total_liked = total_liked + day_liked
  day_start_people = received
end

puts total_liked

n = gets.to_i

total_liked = 0

day_start_people = 5

for i in 0...n do

day_liked = day_start_people / 2

received = day_liked * 3

total_liked = total_liked + day_liked

day_start_people = received

end

puts total_liked

Pavol Pidanič

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

Značka: scala

Hackerrank – Priyanka and Toys

Hackerrank – Grading Students

Hackerrank – Between Two Sets

Hackerrank – The Hurdle Race

Hackerrank – Mini-Max Sum

Hackerrank – Bon Appétit

Hackerrank – Sequence full of colors

Hackerrank – Jumping Bunnies

Hackerrank – Repeated String

Hackerrank – Viral Advertising