Archives java - Stránka 3 z 14

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 – 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 – Java End-of-file

Hackerrank – Popis problému Celý popis zadania sa nacháza – Hackerrank. Riešenie 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.*;

class Solution {
    public static void main(String [] args) {
        Scanner sc = new Scanner(System.in);
        int line = 1;
        while (sc.hasNextLine()) {
            System.out.println(line ++ + " " + sc.nextLine());
        }
        sc.close();
    }
}

import java.util.*;

class Solution {

public static void main(String [] args) {

Scanner sc = new Scanner(System.in);

int line = 1;

while (sc.hasNextLine()) {

System.out.println(line ++ + " " + sc.nextLine());

}

sc.close();

}

Hackerrank – Java Datatypes

import java.util.*;

class Solution{
    public static void main(String []argh)
    {
        Scanner sc = new Scanner(System.in);
        int t = sc.nextInt();
        for(int i = 0; i < t; i++) {
            try {
                long x = sc.nextLong();
                System.out.println(x + " can be fitted in:");
                if(x >= -128 && x <= 127) {
                    System.out.println("* byte");
                }
                if(x >= Short.MIN_VALUE && x <= Short.MAX_VALUE) {
                    System.out.println("* short");
                }
                if(x >= Integer.MIN_VALUE && x <= Integer.MAX_VALUE) {
                    System.out.println("* int");
                }
                if(x >= Long.MIN_VALUE && x <= Long.MAX_VALUE) {
                    System.out.println("* long");
                }
            } catch(Exception e) {
                System.out.println(sc.next() + " can't be fitted anywhere.");
            }
        }
    }
}

import java.util.*;

class Solution{

public static void main(String []argh)

{

Scanner sc = new Scanner(System.in);

int t = sc.nextInt();

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

try {

long x = sc.nextLong();

System.out.println(x + " can be fitted in:");

if(x >= -128 && x <= 127) {

System.out.println("* byte");

}

if(x >= Short.MIN_VALUE && x <= Short.MAX_VALUE) {

System.out.println("* short");

}

if(x >= Integer.MIN_VALUE && x <= Integer.MAX_VALUE) {

System.out.println("* int");

}

if(x >= Long.MIN_VALUE && x <= Long.MAX_VALUE) {

System.out.println("* long");

}

} catch(Exception e) {

System.out.println(sc.next() + " can't be fitted anywhere.");

}

Hackerrank – Java Currency Formatter

import java.util.*;
import java.text.*;

public class Solution {

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        double payment = scanner.nextDouble();
        scanner.close();

        NumberFormat usFormat = NumberFormat.getCurrencyInstance(Locale.US);
        NumberFormat cnFormat = NumberFormat.getCurrencyInstance(Locale.CHINA);
        NumberFormat frFormat = NumberFormat.getCurrencyInstance(Locale.FRANCE);
        NumberFormat inFormat = NumberFormat.getCurrencyInstance(new Locale("en", "in"));

        String us = usFormat.format(payment);
        String india = inFormat.format(payment);
        String france = frFormat.format(payment);
        String china = cnFormat.format(payment);

        System.out.println("US: " + us);
        System.out.println("India: " + india);
        System.out.println("China: " + china);
        System.out.println("France: " + france);
    }
}

import java.util.*;

import java.text.*;

public class Solution {

public static void main(String[] args) {

Scanner scanner = new Scanner(System.in);

double payment = scanner.nextDouble();

scanner.close();

NumberFormat usFormat = NumberFormat.getCurrencyInstance(Locale.US);

NumberFormat cnFormat = NumberFormat.getCurrencyInstance(Locale.CHINA);

NumberFormat frFormat = NumberFormat.getCurrencyInstance(Locale.FRANCE);

NumberFormat inFormat = NumberFormat.getCurrencyInstance(new Locale("en", "in"));

String us = usFormat.format(payment);

String india = inFormat.format(payment);

String france = frFormat.format(payment);

String china = cnFormat.format(payment);

System.out.println("US: " + us);

System.out.println("India: " + india);

System.out.println("China: " + china);

System.out.println("France: " + france);

}

Hackerrank – Java Date and Time

import java.util.*;

public class Solution {

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int month = in.nextInt();
        int day = in.nextInt();
        int year = in.nextInt();

        Calendar cal = Calendar.getInstance();
        cal.set(Calendar.YEAR, year);
        cal.set(Calendar.MONTH, month - 1);
        cal.set(Calendar.DAY_OF_MONTH, day);

        int weekDay = cal.get(Calendar.DAY_OF_WEEK);
        String dayName = "";
        switch (weekDay) {
            case Calendar.MONDAY: dayName = "MONDAY"; break;
            case Calendar.TUESDAY: dayName = "TUESDAY"; break;
            case Calendar.WEDNESDAY: dayName = "WEDNESDAY"; break;
            case Calendar.THURSDAY: dayName = "THURSDAY"; break;
            case Calendar.FRIDAY: dayName = "FRIDAY"; break;
            case Calendar.SATURDAY: dayName = "SATURDAY"; break;
            case Calendar.SUNDAY: dayName = "SUNDAY"; break;
        }
        System.out.println(dayName);
    }
}

import java.util.*;

public class Solution {

public static void main(String[] args) {

Scanner in = new Scanner(System.in);

int month = in.nextInt();

int day = in.nextInt();

int year = in.nextInt();

Calendar cal = Calendar.getInstance();

cal.set(Calendar.YEAR, year);

cal.set(Calendar.MONTH, month - 1);

cal.set(Calendar.DAY_OF_MONTH, day);

int weekDay = cal.get(Calendar.DAY_OF_WEEK);

String dayName = "";

switch (weekDay) {

case Calendar.MONDAY: dayName = "MONDAY"; break;

case Calendar.TUESDAY: dayName = "TUESDAY"; break;

case Calendar.WEDNESDAY: dayName = "WEDNESDAY"; break;

case Calendar.THURSDAY: dayName = "THURSDAY"; break;

case Calendar.FRIDAY: dayName = "FRIDAY"; break;

case Calendar.SATURDAY: dayName = "SATURDAY"; break;

case Calendar.SUNDAY: dayName = "SUNDAY"; break;

}

System.out.println(dayName);

}

Pavol Pidanič

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

Značka: java

Hackerrank – Sequence Equation

Hackerrank – Priyanka and Toys

Hackerrank – Consecutive Subsequences

Hackerrank – Grading Students

Hackerrank – Between Two Sets

Hackerrank – The Hurdle Race

Hackerrank – Java End-of-file

Hackerrank – Java Datatypes

Hackerrank – Java Currency Formatter

Hackerrank – Java Date and Time