Archives java - Stránka 10 z 14

Hackerrank – Is Fibo

Popis problému Celý popis zadania sa nacháza – Hackerrank. Riešenie Vytvoríme si Fibonacciho postupnosť a zistíme, či sa fibonaciho číslo rovná požadovanému n. 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.math.BigInteger;
import java.util.*;

public class IsFibo {

    public static void main(String[] args) {
        Scanner stdin = new Scanner(System.in);
        int tests = stdin.nextInt();
        for(int i = 0; i < tests; i++) {
            BigInteger n = stdin.nextBigInteger();
            System.out.println(isFibo(n));
        }
        stdin.close();
    }

    private static String isFibo(BigInteger n) {
        BigInteger fib0 = BigInteger.ZERO;
        BigInteger fib1 = BigInteger.ONE;
        while(fib0.compareTo(n) <= 0) {
            if (fib0.compareTo(n) == 0) return "IsFibo";
            BigInteger temp = fib0;
            fib0 = fib1;
            fib1 = fib1.add(temp);
        }
        return "IsNotFibo";
    }
}

import java.math.BigInteger;

import java.util.*;

public class IsFibo {

public static void main(String[] args) {

Scanner stdin = new Scanner(System.in);

int tests = stdin.nextInt();

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

BigInteger n = stdin.nextBigInteger();

System.out.println(isFibo(n));

}

stdin.close();

}

private static String isFibo(BigInteger n) {

BigInteger fib0 = BigInteger.ZERO;

BigInteger fib1 = BigInteger.ONE;

while(fib0.compareTo(n) <= 0) {

if (fib0.compareTo(n) == 0) return "IsFibo";

BigInteger temp = fib0;

fib0 = fib1;

fib1 = fib1.add(temp);

}

return "IsNotFibo";

}

JavaScript

'use strict';

let isFibo = n => {
    let fib0 = 0;
    let fib1 = 1;
    while(fib0 <= n) {
        if (fib0 == n) return "IsFibo";
        let temp = fib0;
        fib0 = fib1;
        fib1 += temp;
    }
    return "IsNotFibo"
};
const processData = input => {
    console.log(input.split("\n").slice(1).map(i => parseInt(i)).map(isFibo).join("\n"));
};

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

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

'use strict';

let isFibo = n => {

let fib0 = 0;

let fib1 = 1;

while(fib0 <= n) {

if (fib0 == n) return "IsFibo";

let temp = fib0;

fib0 = fib1;

fib1 += temp;

}

return "IsNotFibo"

};

const processData = input => {

console.log(input.split("\n").slice(1).map(i => parseInt(i)).map(isFibo).join("\n"));

};

process.stdin.resume();

process.stdin.setEncoding("ascii");

var _input = "";

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

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

Scala

import scala.io.Source

object IsFibo extends App {
  val lines = Source.stdin.getLines()
  val numbers = lines.drop(1).map(BigInt(_))
  val fibos = numbers.map(isFibo)
  println(fibos.mkString("\n"))

  def isFibo(n: BigInt): String = {
    var fib0: BigInt = 0
    var fib1: BigInt = 1
    while(fib0 <= n) {
      if (fib0 == n) return "IsFibo"
      val temp: BigInt = fib0
      fib0 = fib1
      fib1 += temp
    }
    "IsNotFibo"
  }
}

import scala.io.Source

object IsFibo extends App {

val lines = Source.stdin.getLines()

val numbers = lines.drop(1).map(BigInt(_))

val fibos = numbers.map(isFibo)

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

def isFibo(n: BigInt): String = {

var fib0: BigInt = 0

var fib1: BigInt = 1

while(fib0 <= n) {

if (fib0 == n) return "IsFibo"

val temp: BigInt = fib0

fib0 = fib1

fib1 += temp

}

"IsNotFibo"

}

Ruby

def is_fibo(number)
  fib0 = 0
  fib1 = 1
  while fib0 <= number do
    return "IsFibo" if fib0 == number
    temp = fib0
    fib0 = fib1
    fib1 += temp
  end
  return "IsNotFibo"  
end

test_cases = gets.chomp.to_i
test_cases.times do
  number = gets.chomp.to_i
  result = is_fibo(number)
  puts result
end

def is_fibo(number)

fib0 = 0

fib1 = 1

while fib0 <= number do

return "IsFibo" if fib0 == number

temp = fib0

fib0 = fib1

fib1 += temp

end

return "IsNotFibo"

end

test_cases = gets.chomp.to_i

test_cases.times do

number = gets.chomp.to_i

result = is_fibo(number)

puts result

end

Hackerrank – IP Address Validation

Popis problému Celý popis zadania sa nacháza – Hackerrank. Riešenie IP4 regex: \b(((2[0-5][0-5])|(1[0-9][0-9])|(\b[1-9][0-9]\b)|(\b\d\b))\.){3}((2[0-5][0-5])|(1[0-9][0-9])|(\b[1-9][0-9]\b)|(\b\d\b))\b IP6 regex: ([a-f0-9]{1,4}:){7}\b[0-9a-f]{1,4}\b 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.*;

public class IPAddressValidation {

    private static final String IP6_PATTERN = "([a-f0-9]{1,4}:){7}\\b[0-9a-f]{1,4}\\b";
    private static final String IP4_PATTERN =
            "\\b(((2[0-5][0-5])|(1[0-9][0-9])|(\\b[1-9][0-9]\\b)|(\\b\\d\\b))\\.){3}((2[0-5][0-5])|(1[0-9][0-9])|(\\b[1-9][0-9]\\b)|(\\b\\d\\b))\\b";

    public static void main(String[] args) {
        Scanner stdin = new Scanner(System.in);
        int tests = Integer.parseInt(stdin.nextLine());
        for(int i = 0; i < tests; i++) {
            System.out.println(ipValidation(stdin.nextLine()));
        }
        stdin.close();
    }

    private static String ipValidation(String address) {
        if(address.matches(IP6_PATTERN))
            return "IPv6";
        else if(address.matches(IP4_PATTERN))
            return "IPv4";
        else
            return "Neither";
    }
}

import java.util.*;

public class IPAddressValidation {

private static final String IP6_PATTERN = "([a-f0-9]{1,4}:){7}\\b[0-9a-f]{1,4}\\b";

private static final String IP4_PATTERN =

"\\b(((2[0-5][0-5])|(1[0-9][0-9])|(\\b[1-9][0-9]\\b)|(\\b\\d\\b))\\.){3}((2[0-5][0-5])|(1[0-9][0-9])|(\\b[1-9][0-9]\\b)|(\\b\\d\\b))\\b";

public static void main(String[] args) {

Scanner stdin = new Scanner(System.in);

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

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

System.out.println(ipValidation(stdin.nextLine()));

}

stdin.close();

}

private static String ipValidation(String address) {

if(address.matches(IP6_PATTERN))

return "IPv6";

else if(address.matches(IP4_PATTERN))

return "IPv4";

else

return "Neither";

}

JavaScript

'use strict';

const IP6_PATTERN = "([a-f0-9]{1,4}:){7}\\b[0-9a-f]{1,4}\\b";
const IP4_PATTERN =
    "\\b(((2[0-5][0-5])|(1[0-9][0-9])|(\\b[1-9][0-9]\\b)|(\\b\\d\\b))\\.){3}((2[0-5][0-5])|(1[0-9][0-9])|(\\b[1-9][0-9]\\b)|(\\b\\d\\b))\\b";

const processData = input => {
    let lines = input.split('\n').slice(1);
    let ipValidation = address => {
        if(address.match(new RegExp(IP4_PATTERN))) {
            return "IPv4";
        } else if(address.match(new RegExp(IP6_PATTERN))) {
            return "IPv6";
        } else {
            return "Neither";
        }
    };
    let validations = lines.map(ipValidation);
    console.log(validations.join('\n'));
};

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

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

'use strict';

const IP6_PATTERN = "([a-f0-9]{1,4}:){7}\\b[0-9a-f]{1,4}\\b";

const IP4_PATTERN =

"\\b(((2[0-5][0-5])|(1[0-9][0-9])|(\\b[1-9][0-9]\\b)|(\\b\\d\\b))\\.){3}((2[0-5][0-5])|(1[0-9][0-9])|(\\b[1-9][0-9]\\b)|(\\b\\d\\b))\\b";

const processData = input => {

let lines = input.split('\n').slice(1);

let ipValidation = address => {

if(address.match(new RegExp(IP4_PATTERN))) {

return "IPv4";

} else if(address.match(new RegExp(IP6_PATTERN))) {

return "IPv6";

} else {

return "Neither";

}

};

let validations = lines.map(ipValidation);

console.log(validations.join('\n'));

};

process.stdin.resume();

process.stdin.setEncoding("ascii");

var _input = "";

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

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

Scala

import scala.io.Source

object IPAddressValidation extends App {
  private[this] val IP6_PATTERN = "([a-f0-9]{1,4}:){7}\\b[0-9a-f]{1,4}\\b"
  private[this] val IP4_PATTERN =
    "\\b(((2[0-5][0-5])|(1[0-9][0-9])|(\\b[1-9][0-9]\\b)|(\\b\\d\\b))\\.){3}((2[0-5][0-5])|(1[0-9][0-9])|(\\b[1-9][0-9]\\b)|(\\b\\d\\b))\\b"

  val lines = Source.stdin.getLines().drop(1)
  val validation = lines.map(ipValidation)
  println(validation.mkString("\n"))

  def ipValidation(address: String): String = {
    if(address.matches(IP6_PATTERN))
      "IPv6"
    else if(address.matches(IP4_PATTERN))
      "IPv4"
    else
      "Neither"
  }
}

import scala.io.Source

object IPAddressValidation extends App {

private[this] val IP6_PATTERN = "([a-f0-9]{1,4}:){7}\\b[0-9a-f]{1,4}\\b"

private[this] val IP4_PATTERN =

"\\b(((2[0-5][0-5])|(1[0-9][0-9])|(\\b[1-9][0-9]\\b)|(\\b\\d\\b))\\.){3}((2[0-5][0-5])|(1[0-9][0-9])|(\\b[1-9][0-9]\\b)|(\\b\\d\\b))\\b"

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

val validation = lines.map(ipValidation)

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

def ipValidation(address: String): String = {

if(address.matches(IP6_PATTERN))

"IPv6"

else if(address.matches(IP4_PATTERN))

"IPv4"

else

"Neither"

}

Ruby

tests = gets.chomp.to_i
tests.times do
  input = gets.chomp.to_s
  if input =~ /\b(((2[0-5][0-5])|(1[0-9][0-9])|(\b[1-9][0-9]\b)|(\b\d\b))\.){3}((2[0-5][0-5])|(1[0-9][0-9])|(\b[1-9][0-9]\b)|(\b\d\b))\b/
    puts "IPv4" 
  elsif input =~ /([a-f0-9]{1,4}:){7}\b[0-9a-f]{1,4}\b/
    puts "IPv6"
  else
    puts "Neither"
  end
end

tests = gets.chomp.to_i

tests.times do

input = gets.chomp.to_s

if input =~ /\b(((2[0-5][0-5])|(1[0-9][0-9])|(\b[1-9][0-9]\b)|(\b\d\b))\.){3}((2[0-5][0-5])|(1[0-9][0-9])|(\b[1-9][0-9]\b)|(\b\d\b))\b/

puts "IPv4"

elsif input =~ /([a-f0-9]{1,4}:){7}\b[0-9a-f]{1,4}\b/

puts "IPv6"

else

puts "Neither"

end

Hackerrank – Intro to Tutorial Challenges

Popis problému Celý popis zadania sa nacháza – Hackerrank. Riešenie Zisti, či existujú prvky poľa, ktoré sa rovnajú zadanej hodnote. 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 IntroToTutorialChallenges
{
    public static void main(String[] args)
    {
        Scanner stdin = new Scanner(System.in);
        int v = Integer.parseInt(stdin.nextLine());
        int size = Integer.parseInt(stdin.nextLine());
        String[] numbers = stdin.nextLine().split(" ");
        System.out.println(getPosition(numbers, v));
        
        stdin.close();
    }
    
    private static int getPosition(String[] numbers, int v)
    {
        for(int i = 0; i < numbers.length; i++)
        {
            if(v == Integer.parseInt(numbers[i]))
            {
                return i;
            }
        }
        return 0;
    }
}

import java.util.Scanner;

public class IntroToTutorialChallenges

{

public static void main(String[] args)

{

Scanner stdin = new Scanner(System.in);

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

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

String[] numbers = stdin.nextLine().split(" ");

System.out.println(getPosition(numbers, v));

stdin.close();

}

private static int getPosition(String[] numbers, int v)

{

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

{

if(v == Integer.parseInt(numbers[i]))

{

return i;

}

return 0;

}

JavaScript

'use strict';

const processData = input => {
    let getPosition = (arr, val) => {
        for(let i = 0; i < arr.length; i++) {
            if(arr[i] == val) {
                return i;
            }
        }
    };
    let lines = input.split('\n');
    let searchedValue = parseInt(lines[0]);
    let array = lines[2].split(' ').map(i => parseInt(i));
    let position = getPosition(array, searchedValue);
    console.log(position);
};

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

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

'use strict';

const processData = input => {

let getPosition = (arr, val) => {

for(let i = 0; i < arr.length; i++) {

if(arr[i] == val) {

return i;

}

};

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

let searchedValue = parseInt(lines[0]);

let array = lines[2].split(' ').map(i => parseInt(i));

let position = getPosition(array, searchedValue);

console.log(position);

};

process.stdin.resume();

process.stdin.setEncoding("ascii");

var _input = "";

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

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

Scala

import scala.io.Source

object IntroToTutorialChallenges extends App {
  val lines = Source.stdin.getLines().toList
  val searchedValue = lines(0).toInt
  val array = lines(2).split(" ").map(_.toInt)

  val valPosition = getPosition(array, searchedValue)
  println(valPosition)

  def getPosition(array: Array[Int], value: Int): Int = {
    array.indexOf(value)
  }
}

import scala.io.Source

object IntroToTutorialChallenges extends App {

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

val searchedValue = lines(0).toInt

val array = lines(2).split(" ").map(_.toInt)

val valPosition = getPosition(array, searchedValue)

println(valPosition)

def getPosition(array: Array[Int], value: Int): Int = {

array.indexOf(value)

}

Ruby

def get_position(arr, val)
  (arr.size - 1).times do |i|
    return i if(val == arr[i])
  end
end

searched_value = gets.to_s.chomp.to_i
array_length = gets.to_s.chomp.to_i
arr = gets.to_s.split.map{ |i| i.to_i }

position = get_position(arr, searched_value)
puts position

def get_position(arr, val)

(arr.size - 1).times do |i|

return i if(val == arr[i])

end

searched_value = gets.to_s.chomp.to_i

array_length = gets.to_s.chomp.to_i

arr = gets.to_s.split.map{ |i| i.to_i }

position = get_position(arr, searched_value)

puts position

Hackerrank – Insertion Sort – Part 1

Popis problému Celý popis zadania sa nacháza – Hackerrank. Riešenie Priraď posledný element do nejakej dočasnej premennej. Iteruj od posledného prvku k prvému (index 0). Ak je aktuálny elemen väčší ako dočasná premenná, priraď do dočasnej premennej index aktuálneho prvku. Inak vymeň aktuálny element s predchádzajúcim. Vytvoril som riešenie v týchto programovacích jazykoch: Java JavaScript […]

Hackerrank – Ice Cream Parlor

Popis problému Celý popis zadania sa nacháza – Hackerrank. Riešenie Pre každú i-tú cenovku zisti, či súčet i-tej a (i+1)-ej ceny je rovný požadovanej sume. 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.*;

public class IceCreamParlor {

    public static void main(String[] args) {
        Scanner stdin = new Scanner(System.in);
        int tests = Integer.parseInt(stdin.nextLine());
        for(int i = 0; i < tests; i++) {
            int amount = Integer.parseInt(stdin.nextLine());
            int length = Integer.parseInt(stdin.nextLine());
            int[] costs = new int[length];
            String[] strings = stdin.nextLine().split(" ");
            for(int j = 0; j < length; j++) {
                costs[j] = Integer.parseInt(strings[j]);
            }
            for(int j = 0; j < length - 1; j++) {
                for(int k = j + 1; k < length; k++) {
                    if(costs[j] + costs[k] == amount) {
                        System.out.println((j + 1) + " " + (k + 1));
                    }
                }
            }
        }
        stdin.close();
    }
}

import java.util.*;

public class IceCreamParlor {

public static void main(String[] args) {

Scanner stdin = new Scanner(System.in);

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

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

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

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

int[] costs = new int[length];

String[] strings = stdin.nextLine().split(" ");

for(int j = 0; j < length; j++) {

costs[j] = Integer.parseInt(strings[j]);

}

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

for(int k = j + 1; k < length; k++) {

if(costs[j] + costs[k] == amount) {

System.out.println((j + 1) + " " + (k + 1));

}

stdin.close();

}

JavaScript

'use strict';

const processData = input => {
    let lines = input.split('\n');
    let tests = parseInt(lines[0]);
    let index = 1;
    for(let i = 0; i < tests; i++) {
        let amount = parseInt(lines[index++]);
        let lenght = parseInt(lines[index++]);
        let costs = lines[index++].split(" ").map(i => parseInt(i));
        let indexes = [];
        for(let j = 0; j < lenght - 1; j++) {
            for(let k = j + 1; k < lenght; k++) {
                if(costs[j] + costs[k] === amount) {
                    indexes.push(j + 1);
                    indexes.push(k + 1);
                }
            }
        }
        console.log(indexes.join(" "));
    }
};

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

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

'use strict';

const processData = input => {

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

let tests = parseInt(lines[0]);

let index = 1;

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

let amount = parseInt(lines[index++]);

let lenght = parseInt(lines[index++]);

let costs = lines[index++].split(" ").map(i => parseInt(i));

let indexes = [];

for(let j = 0; j < lenght - 1; j++) {

for(let k = j + 1; k < lenght; k++) {

if(costs[j] + costs[k] === amount) {

indexes.push(j + 1);

indexes.push(k + 1);

}

console.log(indexes.join(" "));

}

};

process.stdin.resume();

process.stdin.setEncoding("ascii");

var _input = "";

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

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

Scala

import scala.collection.mutable.ListBuffer
import scala.io.Source

object IceCreamParlor extends App {
  val console = Source.stdin.bufferedReader()
  val tests = console.readLine().toInt
  (0 until tests).foreach(_ => {
    val amount = console.readLine().toInt
    val lenght = console.readLine().toInt
    val costs = console.readLine().split(" ").map(_.toInt)
    println(indexes(costs, amount).mkString(" "))
  })

  def indexes(costs: Array[Int], amount: Int): List[Int] = {
    val result: ListBuffer[Int] = ListBuffer.empty
    (0 until costs.length - 1).foreach(i => {
      (i + 1 until costs.length).foreach(j => {
        if(costs(i) + costs(j) == amount) {
          result += i + 1
          result += j + 1
        }
      })
    })
    result.toList
  }
}

import scala.collection.mutable.ListBuffer

import scala.io.Source

object IceCreamParlor extends App {

val console = Source.stdin.bufferedReader()

val tests = console.readLine().toInt

(0 until tests).foreach(_ => {

val amount = console.readLine().toInt

val lenght = console.readLine().toInt

val costs = console.readLine().split(" ").map(_.toInt)

println(indexes(costs, amount).mkString(" "))

})

def indexes(costs: Array[Int], amount: Int): List[Int] = {

val result: ListBuffer[Int] = ListBuffer.empty

(0 until costs.length - 1).foreach(i => {

(i + 1 until costs.length).foreach(j => {

if(costs(i) + costs(j) == amount) {

result += i + 1

result += j + 1

}

})

result.toList

}

Ruby

tests = gets.chomp.to_i
tests.times do
  m = gets.chomp.to_i
  n = gets.chomp.to_i
  flavors = gets.chomp.split.map { |e| e.to_i }
  for i in 0...flavors.length - 1 do
    for j in i + 1...flavors.length do
      puts "#{i + 1} #{j + 1}" if flavors[i] + flavors[j] == m
    end
  end
end

tests = gets.chomp.to_i

tests.times do

m = gets.chomp.to_i

n = gets.chomp.to_i

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

for i in 0...flavors.length - 1 do

for j in i + 1...flavors.length do

puts "#{i + 1} #{j + 1}" if flavors[i] + flavors[j] == m

end

Hackerrank – Handshake

Popis problému Celý popis zadania sa nacháza – Hackerrank. Riešenie $$handshakes = \sum_{i=0}^{directors-1}{i}$$ Vytvoril som riešenie v týchto programovacích jazykoch: Java JavaScript Ruby Scala Všetky riešenia sú dostupné aj na mojom GitHub profile. Java

import java.util.*;

public class Handshake {

    public static void main(String[] args) {
        Scanner stdin = new Scanner(System.in);
        int tests = stdin.nextInt();
        for(int i = 0; i < tests; i++) {
            long handshakes = 0;
            int directors = stdin.nextInt();
            for(int j = 0; j < directors; j++) {
                handshakes += j;
            }
            System.out.println(handshakes);
        }
        stdin.close();
    }
}

import java.util.*;

public class Handshake {

public static void main(String[] args) {

Scanner stdin = new Scanner(System.in);

int tests = stdin.nextInt();

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

long handshakes = 0;

int directors = stdin.nextInt();

for(int j = 0; j < directors; j++) {

handshakes += j;

}

System.out.println(handshakes);

}

stdin.close();

}

JavaScript

'use strict';

const processData = input => {
    let directors = input.split('\n').map(i => parseInt(i))
    for(let i = 1; i < directors.length; i++) {
        let handshakes = 0;
        for(let j = 0; j < directors[i]; j++) {
            handshakes += j;
        }
        console.log(handshakes);
    }
};

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

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

'use strict';

const processData = input => {

let directors = input.split('\n').map(i => parseInt(i))

for(let i = 1; i < directors.length; i++) {

let handshakes = 0;

for(let j = 0; j < directors[i]; j++) {

handshakes += j;

}

console.log(handshakes);

}

};

process.stdin.resume();

process.stdin.setEncoding("ascii");

var _input = "";

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

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

Ruby

gets.chomp.to_i.times do
  directors = gets.chomp.to_i
  result = 0
  (directors - 1).downto 0 do |handshakes|
    result += handshakes
  end
  puts result
end

gets.chomp.to_i.times do

directors = gets.chomp.to_i

result = 0

(directors - 1).downto 0 do |handshakes|

result += handshakes

end

puts result

end

Scala

import scala.io.Source

object Handshake extends App {
  val lines = Source.stdin.getLines()
  val directors = lines.drop(1).map(_.toInt)
  val handshakes = directors.map(Range(0, _).toList.sum)
  println(handshakes.mkString("\n"))
}

import scala.io.Source

object Handshake extends App {

val lines = Source.stdin.getLines()

val directors = lines.drop(1).map(_.toInt)

val handshakes = directors.map(Range(0, _).toList.sum)

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

}

Hackerrank – Halloween Party

Popis problému Celý popis zadania sa nacháza – Hackerrank. Riešenie Kúsky čokolády vypočítame: $$horizontal = slices / 2$$ $$vertical = slices – horizontal$$ $$pieces = horizontal * vertical$$ 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.*;

public class HalloweenParty {

    public static void main(String[] args) {
        Scanner stdin = new Scanner(System.in);
        int tests = stdin.nextInt();
        for(int i = 0; i < tests; i++) {
            long k = stdin.nextLong();
            long horizontal = k / 2;
            long vertical = k - horizontal;
            System.out.println(vertical * horizontal);
        }
        stdin.close();
    }
}

import java.util.*;

public class HalloweenParty {

public static void main(String[] args) {

Scanner stdin = new Scanner(System.in);

int tests = stdin.nextInt();

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

long k = stdin.nextLong();

long horizontal = k / 2;

long vertical = k - horizontal;

System.out.println(vertical * horizontal);

}

stdin.close();

}

JavaScript

'use strict';

const processData = input => {
    let lines = input.split("\n");
    let slices = lines.map(i => parseInt(i));
    const pieces = k => {
        let horizontal = parseInt(k / 2);
        let vertical = k - horizontal;
        return vertical * horizontal;
    };
    for(let i = 1; i < slices.length; i++) {
        console.log(pieces(slices[i]));
    }
};

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

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

'use strict';

const processData = input => {

let lines = input.split("\n");

let slices = lines.map(i => parseInt(i));

const pieces = k => {

let horizontal = parseInt(k / 2);

let vertical = k - horizontal;

return vertical * horizontal;

};

for(let i = 1; i < slices.length; i++) {

console.log(pieces(slices[i]));

}

};

process.stdin.resume();

process.stdin.setEncoding("ascii");

var _input = "";

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

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

Scala

import scala.io.Source

object HalloweenParty extends App {
  val lines = Source.stdin.getLines()
  val slices = lines.drop(1).map(_.toLong)
  val result = slices.map(pieces)
  println(result.mkString("\n"))

  def pieces(k: Long): Long = {
    val horizontal = k / 2
    val vertical = k - horizontal
    vertical * horizontal
  }
}

import scala.io.Source

object HalloweenParty extends App {

val lines = Source.stdin.getLines()

val slices = lines.drop(1).map(_.toLong)

val result = slices.map(pieces)

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

def pieces(k: Long): Long = {

val horizontal = k / 2

val vertical = k - horizontal

vertical * horizontal

}

Ruby […]

Hackerrank – HackerRank Tweets

Popis problému Celý popis zadania sa nacháza – Hackerrank. Riešenie Skontrolovať, či každý riadok je validný pre nasledovný regulárny výraz. .*hackerrank.* 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.*;

public class HackerrankTweets {

    public static void main(String[] args) {
        Scanner stdin = new Scanner(System.in);
        int tests = Integer.parseInt(stdin.nextLine());
        int count = 0;
        for(int i = 0; i < tests; i++) {
            if(stdin.nextLine().toLowerCase().matches(".*hackerrank.*")) {
                count++;
            }
        }
        System.out.println(count);
        stdin.close();
    }
}

import java.util.*;

public class HackerrankTweets {

public static void main(String[] args) {

Scanner stdin = new Scanner(System.in);

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

int count = 0;

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

if(stdin.nextLine().toLowerCase().matches(".*hackerrank.*")) {

count++;

}

System.out.println(count);

stdin.close();

}

JavaScript

'use strict';

const processData = input => {
    let lines = input.split('\n').slice(1);
    let matches = lines.filter(line => line.toLowerCase().match(/.*hackerrank.*/));
    console.log(matches.length);
};

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

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

'use strict';

const processData = input => {

let lines = input.split('\n').slice(1);

let matches = lines.filter(line => line.toLowerCase().match(/.*hackerrank.*/));

console.log(matches.length);

};

process.stdin.resume();

process.stdin.setEncoding("ascii");

var _input = "";

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

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

Scala

import scala.io.Source

object HackerrankTweets extends App {
  val lines = Source.stdin.getLines().drop(1)
  val matchingLines = lines.count(_.toLowerCase.matches(".*hackerrank.*"))
  println(matchingLines)
}

import scala.io.Source

object HackerrankTweets extends App {

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

val matchingLines = lines.count(_.toLowerCase.matches(".*hackerrank.*"))

println(matchingLines)

}

Ruby

tests = gets.chomp.to_i
result = 0
tests.times do
  words = gets.chomp.split
  words.each do |word|
    result += 1 if word.downcase =~ /.*hackerrank.*/
  end
end

puts result

tests = gets.chomp.to_i

result = 0

tests.times do

words = gets.chomp.split

words.each do |word|

result += 1 if word.downcase =~ /.*hackerrank.*/

end

puts result

Hackerrank – Gemstones

Popis problému Celý popis zadania sa nacháza – Hackerrank. Riešenie Urobiť prienik znakov vo vstupných reťazcoch (Iba výskyty rovnakých znakoch vo všetkých reťazcoch). Vytvoril som riešenie v týchto programovacích jazykoch: Java JavaScript Ruby Scala Všetky riešenia sú dostupné aj na mojom GitHub profile. Java

import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

public class GemStones
{
    public static void main(String[] args)
    {
        Scanner scanner = new Scanner(System.in);
        int rocks = scanner.nextInt();

        char[] first = scanner.next().toCharArray();

        Set<Character> result = new HashSet<>();
        for (char c : first)
        {
            result.add(c);
        }

        for (int i = 1; i < rocks; i++)
        {
            char[] composition = scanner.next().toCharArray();
            Set<Character> set = new HashSet<>();
            for (char d : result)
            {
                for (int j = 0; j < composition.length; j++)
                {
                    if(d == composition[j])
                    {
                        set.add(composition[j]);
                    }
                }
            }
            result = set;
        }
        System.out.println(result.size());
        scanner.close();
    }
}

import java.util.HashSet;

import java.util.Scanner;

import java.util.Set;

public class GemStones

{

public static void main(String[] args)

{

Scanner scanner = new Scanner(System.in);

int rocks = scanner.nextInt();

char[] first = scanner.next().toCharArray();

Set<Character> result = new HashSet<>();

for (char c : first)

{

result.add(c);

}

for (int i = 1; i < rocks; i++)

{

char[] composition = scanner.next().toCharArray();

Set<Character> set = new HashSet<>();

for (char d : result)

{

for (int j = 0; j < composition.length; j++)

{

if(d == composition[j])

{

set.add(composition[j]);

}

result = set;

}

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

scanner.close();

}

JavaScript

function processData(input) {
    var lines = input.split('\n');
    var first = lines[1].split('');
    for(var i = 2; i < lines.length; i++) {
        first = intersect(first, lines[i].split(''));
    }
    console.log(first.length)
}

function intersect(arr1, arr2) {
    var unique1 = arr1.distinct();
    var unique2 = arr2.distinct();
    return unique1.distinct().filter(function(s) {
        return unique2.distinct().indexOf(s) !== -1
    });
}

Array.prototype.distinct = function() {
    var hash = {};
    var a = [];
    for(var i = 0; i < this.length; i++) {
        if(hash.hasOwnProperty(this[i])) {
            continue;
        }
        hash[this[i]] = true;
        a.push(this[i]);
    }
    return a;
};

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 first = lines[1].split('');

for(var i = 2; i < lines.length; i++) {

first = intersect(first, lines[i].split(''));

}

console.log(first.length)

}

function intersect(arr1, arr2) {

var unique1 = arr1.distinct();

var unique2 = arr2.distinct();

return unique1.distinct().filter(function(s) {

return unique2.distinct().indexOf(s) !== -1

});

}

Array.prototype.distinct = function() {

var hash = {};

var a = [];

for(var i = 0; i < this.length; i++) {

if(hash.hasOwnProperty(this[i])) {

continue;

}

hash[this[i]] = true;

a.push(this[i]);

}

return a;

};

process.stdin.resume();

process.stdin.setEncoding("ascii");

_input = "";

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

_input += input;

});

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

processData(_input);

});

Ruby

string_count = gets.to_i
first = gets.chars.uniq
(string_count - 1).times do
  s = gets.chars.uniq
  first = first & s
end
puts first.length

string_count = gets.to_i

first = gets.chars.uniq

(string_count - 1).times do

s = gets.chars.uniq

first = first & s

end

puts first.length

Scala

import scala.io.Source

object Gemstones extends App {
  val strings = Source.stdin.getLines().drop(1).toList

  val first = strings(0)
  val gemstones = strings.drop(1).foldLeft(first)(_ intersect _)
  println(gemstones.size)
}

import scala.io.Source

object Gemstones extends App {

val strings = Source.stdin.getLines().drop(1).toList

val first = strings(0)

val gemstones = strings.drop(1).foldLeft(first)(_ intersect _)

println(gemstones.size)

}

Hackerrank – Game of Thrones – I

Popis problému Celý popis zadania sa nacháza – Hackerrank. Riešenie Podmienky pre zistenie palindrómu: ak je dĺžka reťazca párna, potom sa musí každý znak vyskytovať v reťazci párny počet krát ak je dĺžka reťazca nepárne číslo, potom musí byť výskyt iba jedného znaku nepárny počet krát, ostatné sa musia vyskytovať párny počet krát Vytvoril som […]

Pavol Pidanič

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

Značka: java

Hackerrank – Is Fibo

Hackerrank – IP Address Validation

Hackerrank – Intro to Tutorial Challenges

Hackerrank – Insertion Sort – Part 1

Hackerrank – Ice Cream Parlor

Hackerrank – Handshake

Hackerrank – Halloween Party

Hackerrank – HackerRank Tweets

Hackerrank – Gemstones

Hackerrank – Game of Thrones – I