Archives hackerrank - Stránka 3 z 25

Hackerrank – Taum and B’day

Hackerrank – Popis problému Celý popis zadania sa nacháza – Hackerrank. Riešenie Ako je napísané v zadaní. Porovnať, či je výhodnejšie kúpiť darčeky v cenách, aké sú zadané, alebo cena za vymenenie farby darčeku. 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 TaumAndBday {

  def main(args: Array[String]) {
    val sc = new java.util.Scanner (System.in)
    val t = sc.nextInt()
    var a0 = 0
    while(a0 < t){
      val black = sc.nextLong()
      val white = sc.nextLong()
      val x = sc.nextLong()
      val y = sc.nextLong()
      val z = sc.nextLong()

      val ansWithoutConvert = black * x + white * y
      val blackConvertCost = black * z
      val ansWhite = (white + black) * y + blackConvertCost

      val whiteConvertCost = white * z
      val ansBlack = (black + white) * x + whiteConvertCost

      var min = ansWithoutConvert
      if(ansBlack.compareTo(min) < 0)
      {
        min = ansBlack
      }
      if(ansWhite.compareTo(min) < 0)
      {
        min = ansWhite
      }
      println(min)
      a0 +=1
    }
  }
}

object TaumAndBday {

def main(args: Array[String]) {

val sc = new java.util.Scanner (System.in)

val t = sc.nextInt()

var a0 = 0

while(a0 < t){

val black = sc.nextLong()

val white = sc.nextLong()

val x = sc.nextLong()

val y = sc.nextLong()

val z = sc.nextLong()

val ansWithoutConvert = black * x + white * y

val blackConvertCost = black * z

val ansWhite = (white + black) * y + blackConvertCost

val whiteConvertCost = white * z

val ansBlack = (black + white) * x + whiteConvertCost

var min = ansWithoutConvert

if(ansBlack.compareTo(min) < 0)

{

min = ansBlack

}

if(ansWhite.compareTo(min) < 0)

{

min = ansWhite

}

println(min)

a0 +=1

}

[…]

Hackerrank – Sequence Equation

Hackerrank – Popis problému Celý popis zadania sa nacháza – Hackerrank. Riešenie Mám zadaný počet čísel n Robím pre všetky čísla od 1 po n Nájdem ich index v prvkoch na druhom riadku Potom nájdem index indexu v prvkoch na druhom riadku Vytvoril som riešenie v týchto programovacích jazykoch: Scala Java Javascript Všetky riešenia sú […]

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 – Consecutive Subsequences

Hackerrank – Popis problému Celý popis zadania sa nacháza – Hackerrank. Riešenie http://stackoverflow.com/questions/24518682/count-subsequences-divisible-by-k Vytvoril som riešenie v týchto programovacích jazykoch: Java Všetky riešenia sú dostupné aj na mojom GitHub profile. Java

import java.util.Scanner;

// http://stackoverflow.com/questions/24518682/count-subsequences-divisible-by-k
public class ConsecutiveSubsequences
{
    public static void main(String[] args)
    {
        Scanner scanner = new Scanner(System.in);
        int tests = scanner.nextInt();

        for(int l = 0; l < tests; l++)
        {
            int n = scanner.nextInt();
            int k = scanner.nextInt();
            long[] numbers = new long[n];

            for(int i = 0; i < n; i++)
            {
                numbers[i] = scanner.nextLong();
            }

            long[] prefixModCount = new long[k];
            for(int i = 0; i < k; i++)
            {
                prefixModCount[i] = 0;
            }
            prefixModCount[0] = 1;

            int prefixSum = 0;
            for(int i = 0; i < numbers.length; i++)
            {
                prefixSum += numbers[i];
                prefixSum %= k;
                prefixModCount[prefixSum] += 1;
            }

            long result = 0;
            for(int mod = 0; mod < k; mod++)
            {
                result += prefixModCount[mod] * (prefixModCount[mod] - 1) / 2;
            }
            System.out.println(result);
        }

        scanner.close();
    }
}

import java.util.Scanner;

// http://stackoverflow.com/questions/24518682/count-subsequences-divisible-by-k

public class ConsecutiveSubsequences

{

public static void main(String[] args)

{

Scanner scanner = new Scanner(System.in);

int tests = scanner.nextInt();

for(int l = 0; l < tests; l++)

{

int n = scanner.nextInt();

int k = scanner.nextInt();

long[] numbers = new long[n];

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

{

numbers[i] = scanner.nextLong();

}

long[] prefixModCount = new long[k];

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

{

prefixModCount[i] = 0;

}

prefixModCount[0] = 1;

int prefixSum = 0;

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

{

prefixSum += numbers[i];

prefixSum %= k;

prefixModCount[prefixSum] += 1;

}

long result = 0;

for(int mod = 0; mod < k; mod++)

{

result += prefixModCount[mod] * (prefixModCount[mod] - 1) / 2;

}

System.out.println(result);

}

scanner.close();

}

Hackerrank – Project Euler+ #067 – Maximum path sum II

Hackerrank – Popis problému Celý popis zadania sa nacháza – Hackerrank. Riešenie Riešenie je rovnaké ako Maximum Path Sum I.

Hackerrank – Project Euler+ #036 – Double-base palindromes

Hackerrank – Popis problému Celý popis zadania sa nacháza – Hackerrank. Riešenie Postup je zadaný v popise úlohy. Java Všetky riešenia sú dostupné aj na mojom GitHub profile. Java

public class DoubleBasePalindromes 
{
	public static void main(String[] args)
	{
		Scanner stdin = new Scanner(System.in);
		int n = stdin.nextInt();
		int base = stdin.nextInt();
		long sum = 0;
		for(int i = 1; i < n; i++)
		{
			String decimalString = Integer.toString(i, 10);
			String kBaseString = Integer.toString(i, base);
			if(isPalindrome(decimalString) && isPalindrome(kBaseString))
			{
				sum += i;
			}
		}
		System.out.println(sum);
		stdin.close();
	}
	
	
	private static boolean isPalindrome(String n)
	{
		for(int i = 0; i < n.length() / 2; i++)
		{
			char first = n.charAt(i);
			char last = n.charAt(n.length() - i - 1);
			if(first != last)
			{
				return false;
			}
		}
		return true;
	}
}

public class DoubleBasePalindromes

{

public static void main(String[] args)

{

Scanner stdin = new Scanner(System.in);

int n = stdin.nextInt();

int base = stdin.nextInt();

long sum = 0;

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

{

String decimalString = Integer.toString(i, 10);

String kBaseString = Integer.toString(i, base);

if(isPalindrome(decimalString) && isPalindrome(kBaseString))

{

sum += i;

}

System.out.println(sum);

stdin.close();

}

private static boolean isPalindrome(String n)

{

for(int i = 0; i < n.length() / 2; i++)

{

char first = n.charAt(i);

char last = n.charAt(n.length() - i - 1);

if(first != last)

{

return false;

}

return true;

}

Hackerrank – Project Euler+ #022 – Name scores

Hackerrank – Popis problému Celý popis zadania sa nacháza – Hackerrank. Riešenie Postup je zadaný v popise úlohy. Java Všetky riešenia sú dostupné aj na mojom GitHub profile. Java

import java.util.ArrayList;
import java.util.Collections;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import java.util.Scanner;

public class NameScores
{
    private static Map<Character, Integer> alphabet;
    static
    {
        alphabet = new HashMap<>(26);
        alphabet.put('A', 1);
        alphabet.put('B', 2);
        alphabet.put('C', 3);
        alphabet.put('D', 4);
        alphabet.put('E', 5);
        alphabet.put('F', 6);
        alphabet.put('G', 7);
        alphabet.put('H', 8);
        alphabet.put('I', 9);
        alphabet.put('J', 10);
        alphabet.put('K', 11);
        alphabet.put('L', 12);
        alphabet.put('M', 13);
        alphabet.put('N', 14);
        alphabet.put('O', 15);
        alphabet.put('P', 16);
        alphabet.put('Q', 17);
        alphabet.put('R', 18);
        alphabet.put('S', 19);
        alphabet.put('T', 20);
        alphabet.put('U', 21);
        alphabet.put('V', 22);
        alphabet.put('W', 23);
        alphabet.put('X', 24);
        alphabet.put('Y', 25);
        alphabet.put('Z', 26);
    }

    public static void main(String[] args)
    {
        Scanner scanner = new Scanner(System.in);
        int namesCount = Integer.parseInt(scanner.nextLine());
        List<String> namesList = new ArrayList<>(namesCount);
        for (int i = 0; i < namesCount; i++)
        {
            String name = scanner.nextLine();
            namesList.add(name);
        }
        Collections.sort(namesList);
        Map<String, Integer> names = new HashMap<>();
        for (int i = 1; i <= namesList.size(); i++)
        {
            names.put(namesList.get(i - 1), i);
        }
        int queries = Integer.parseInt(scanner.nextLine());
        for (int i = 0; i < queries; i++)
        {
            String query = scanner.nextLine();
            int score = nameScore(names, query);
            System.out.println(score);
        }
        scanner.close();
    }

    private static int nameScore(Map<String, Integer> names, String name)
    {
        int result = 0;
        for (int i = 0; i < name.length(); i++)
        {
            result += alphabet.get(name.charAt(i));
        }
        result *= names.get(name);
        return result;
    }
}

import java.util.ArrayList;

import java.util.Collections;

import java.util.HashMap;

import java.util.List;

import java.util.Map;

import java.util.Scanner;

public class NameScores

{

private static Map<Character, Integer> alphabet;

static

{

alphabet = new HashMap<>(26);

alphabet.put('A', 1);

alphabet.put('B', 2);

alphabet.put('C', 3);

alphabet.put('D', 4);

alphabet.put('E', 5);

alphabet.put('F', 6);

alphabet.put('G', 7);

alphabet.put('H', 8);

alphabet.put('I', 9);

alphabet.put('J', 10);

alphabet.put('K', 11);

alphabet.put('L', 12);

alphabet.put('M', 13);

alphabet.put('N', 14);

alphabet.put('O', 15);

alphabet.put('P', 16);

alphabet.put('Q', 17);

alphabet.put('R', 18);

alphabet.put('S', 19);

alphabet.put('T', 20);

alphabet.put('U', 21);

alphabet.put('V', 22);

alphabet.put('W', 23);

alphabet.put('X', 24);

alphabet.put('Y', 25);

alphabet.put('Z', 26);

}

public static void main(String[] args)

{

Scanner scanner = new Scanner(System.in);

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

List<String> namesList = new ArrayList<>(namesCount);

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

{

String name = scanner.nextLine();

namesList.add(name);

}

Collections.sort(namesList);

Map<String, Integer> names = new HashMap<>();

for (int i = 1; i <= namesList.size(); i++)

{

names.put(namesList.get(i - 1), i);

}

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

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

{

String query = scanner.nextLine();

int score = nameScore(names, query);

System.out.println(score);

}

scanner.close();

}

private static int nameScore(Map<String, Integer> names, String name)

{

int result = 0;

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

{

result += alphabet.get(name.charAt(i));

}

result *= names.get(name);

return result;

}

Hackerrank – Project Euler+ #020 – Factorial digit sum

Hackerrank – Popis problému Celý popis zadania sa nacháza – Hackerrank. Riešenie Potrebné mať jazyk, ktorý podporuje operácie s veľkými číslami. Urobiť faktoriál a spočítať číslice. Ruby Všetky riešenia sú dostupné aj na mojom GitHub profile. Ruby

def factorial(n)
  fact = 1
  for i in 2..n do
    fact *= i
  end
  return fact
end


def sum_digits(number)
  chars = number.to_s.chars
  sum = 0
  chars.each { |char| sum += char.to_i }
  return sum
end
 
gets.chomp.to_i.times do
  n = gets.chomp.to_i
  puts sum_digits(factorial(n))
end

def factorial(n)

fact = 1

for i in 2..n do

fact *= i

end

return fact

end

def sum_digits(number)

chars = number.to_s.chars

sum = 0

chars.each { |char| sum += char.to_i }

return sum

end

gets.chomp.to_i.times do

n = gets.chomp.to_i

puts sum_digits(factorial(n))

end

Hackerrank – Project Euler+ #019 – Counting Sundays

Hackerrank – Popis problému Celý popis zadania sa nacháza – Hackerrank. Riešenie Implementácia je špecifická pre každý jazyk. Podľa toho, aké operácie s dátumom podporuje. Zo zadaného dátumu som si zistil, kedy je najbližšia nedeľa. Potom som zvyšoval dni o 7, aby som dostal nasledujúcu nedeľu. Tu si treba dať pozor na prípady, keď vyjde […]

Hackerrank – Project Euler+ #018 – Maximum path sum I

Hackerrank – Popis problému Celý popis zadania sa nacháza – Hackerrank. Riešenie Načítam si všetky čísla v zadnom trojuholníku a uložím ich do zoznamu po riadkoch. Začínam od konca a zoberiem posledné 2 riadky. Pre každé číslo na hornom riadku urobím súčet s číslom na spodnom riadku pre ľavú a pravú stranu. Zistím, ktoré číslo […]

Pavol Pidanič

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

Značka: hackerrank

Hackerrank – Taum and B’day

Hackerrank – Sequence Equation

Hackerrank – Priyanka and Toys

Hackerrank – Consecutive Subsequences

Hackerrank – Project Euler+ #067 – Maximum path sum II

Hackerrank – Project Euler+ #036 – Double-base palindromes

Hackerrank – Project Euler+ #022 – Name scores

Hackerrank – Project Euler+ #020 – Factorial digit sum

Hackerrank – Project Euler+ #019 – Counting Sundays

Hackerrank – Project Euler+ #018 – Maximum path sum I