Hackerrank - Connecting Towns

Popis problému
Celý popis zadania sa nacháza – Hackerrank.

Riešenie
Všetky trasy je súčin trás medzi jednotlivými mestami.

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

Java
JavaScript
Scala
Ruby

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

Java

import java.util.Scanner;

public class ConnectingTowns {
    public static void main(String[] args) {
        Scanner stdin = new Scanner(System.in);
        int cases = stdin.nextInt();
        for(int i = 0; i < cases; i++) {
            int l = stdin.nextInt();
            int routes = 1;
            for(int j = 0; j < l - 1; j++) {
                routes *= stdin.nextInt();
                routes %= 1234567;
            }
            System.out.println(routes);
        }
        stdin.close();
    }
}

import java.util.Scanner;

public class ConnectingTowns {

public static void main(String[] args) {

Scanner stdin = new Scanner(System.in);

int cases = stdin.nextInt();

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

int l = stdin.nextInt();

int routes = 1;

for(int j = 0; j < l - 1; j++) {

routes *= stdin.nextInt();

routes %= 1234567;

}

System.out.println(routes);

}

stdin.close();

}

JavaScript

function processData(input) {
    var lines = input.split('\n');
    var n = parseInt(lines[0]);
    var index = 2;
    for(var i = 0; i < n; i++) {
        var arr = lines[index].split(" ").map(i => parseInt(i));
        var routes = 1;
        for(var j = 0; j < arr.length; j++) {
            routes *= arr[j];
            routes %= 1234567;
        }
        console.log(routes);
        index += 2;
    }
}

process.stdin.resume();
process.stdin.setEncoding("ascii");
_input = "";
process.stdin.on("data", function (input) {
    _input += input;
});

process.stdin.on("end", function () {
    processData(_input);
});

function processData(input) {

var lines = input.split('\n');

var n = parseInt(lines[0]);

var index = 2;

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

var arr = lines[index].split(" ").map(i => parseInt(i));

var routes = 1;

for(var j = 0; j < arr.length; j++) {

routes *= arr[j];

routes %= 1234567;

}

console.log(routes);

index += 2;

}

process.stdin.resume();

process.stdin.setEncoding("ascii");

_input = "";

process.stdin.on("data", function (input) {

_input += input;

});

process.stdin.on("end", function () {

processData(_input);

});

Scala

import scala.io.Source

object ConnectingTowns extends App {
  val lines = Source.stdin.getLines().drop(1)
  val routesArray = lines.toList.filter(_.contains(" "))
  val routes = routesArray.map(_.split(" ").map(_.toLong).foldLeft(1L)(_ * _ % 1234567))
  println(routes.mkString("\n"))
}

import scala.io.Source

object ConnectingTowns extends App {

val lines = Source.stdin.getLines().drop(1)

val routesArray = lines.toList.filter(_.contains(" "))

val routes = routesArray.map(_.split(" ").map(_.toLong).foldLeft(1L)(_ * _ % 1234567))

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

}

Ruby

cases = gets.chomp.to_i
cases.times do
  result = 1
  towns = gets.chomp.to_i
  routes = gets.chomp.split.map { |e| e.to_i }
  for i in 0..towns - 2 do
    result *= routes[i]
    result %= 1234567
  end
  puts result 
end

cases = gets.chomp.to_i

cases.times do

result = 1

towns = gets.chomp.to_i

routes = gets.chomp.split.map { |e| e.to_i }

for i in 0..towns - 2 do

result *= routes[i]

result %= 1234567

end

puts result

end

Pavol Pidanič

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

Hackerrank – Connecting Towns