Archives java - Page 3 of 14

Hackerrank – Taum and B’day

Hackerrank – Problem Statement A description of the problem can be found on Hackerrank. Solution The hint is given in problem description. One should compare if it is better to buy presents without changing colors or with changing colors. I created solution in: Scala Java JavaScript All solutions are also available on my GitHub profile. […]

Hackerrank – Sequence Equation

Hackerrank – Problem Statement A description of the problem can be found on Hackerrank. Solution I have given count of numbers n. I will iterate over all numbers from 1 to n I will find index of each iterated number in all elements and then index of index within all elements I created solution in: […]

Hackerrank – Priyanka and Toys

Hackerrank – Problem Statement A description of the problem can be found on Hackerrank. Solution I created solution in: Scala Java JavaScript All solutions are also available on my 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 = lines[1].split(" ").map(i => parseInt(i)).sort((a, b) => a - b);

    let price = 1;
    let lastWeight = weights[0];
    for (let i = 1; i < weights.length; i++)
    {
        if(lastWeight + 4 >= weights[i])
        {
            // lastWeight = toys[i];
        }
        else
        {
            price++;
            lastWeight = weights[i];
        }
    }
    console.log(price);
};

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 lines = input.split('\n');

const n = parseInt(lines[0]);

const weights = lines[1].split(" ").map(i => parseInt(i)).sort((a, b) => a - b);

let price = 1;

let lastWeight = weights[0];

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

{

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

{

// lastWeight = toys[i];

}

else

{

price++;

lastWeight = weights[i];

}

console.log(price);

};

process.stdin.resume();

process.stdin.setEncoding("ascii");

let _input = "";

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

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

Hackerrank – Consecutive Subsequences

Hackerrank – Problem Statement A description of the problem can be found on Hackerrank. Solution http://stackoverflow.com/questions/24518682/count-subsequences-divisible-by-k I created solution in: Java All solutions are also available on my 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 – Problem Statement A description of the problem can be found on Hackerrank. Solution We will use professor’s rules and transform all grades: – We find how many times (n) is 5 in given grade – if it is divisible without a remainder, we do nothing – it not we round it to neareast […]

Hackerrank – Between Two Sets

Hackerrank – Problem description The problem description – Hackerrank. Solution I created an array of all positive numbers, which satisfy conditions specified in problem statement. This set should contain elements from to . I filter all numbers from the set that are valid for an equation a . The array of positive numbers can be […]

Hackerrank – The Hurdle Race

Hackerrank – Problem Statement A description of the problem can be found on Hackerrank. Solution We need to find the highest hurdle. If it is greater than k then substract its height with k and we have the result. Otherwise print 0. I created solution in: Scala Java JavaScript Ruby All solutions are also available […]

Hackerrank – Java End-of-file

Hackerrank – Problem Statement A description of the problem can be found on Hackerrank. Solution I created solution in: Java All solutions are also available on my GitHub. 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

Hackerrank – Problem Statement A description of the problem can be found on Hackerrank. Solution I created solution in: Java All solutions are also available on my GitHub. Java

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

Hackerrank – Problem Statement A description of the problem can be found on Hackerrank. Solution I created solution in: Java All solutions are also available on my GitHub. Java

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);

}

Pavol Pidanič

I can count to 1023 with 10 fingers

Tag: java

Hackerrank – Taum and B’day

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