Archives ruby - Stránka 7 z 10

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 […]

Hackerrank – Funny String

Popis problému Celý popis zadania sa nacháza – Hackerrank. Riešenie Pre každý index i v reťazci s skontroluj, či je výsledok tejto rovnice vždy rovnaký. $$|s_{i} – s_{i+1}| – |s_{length(s)-i-2} – s_{length(s)-i-1}|$$ 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 FunnyString 
{

    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++)
        {
            String s = stdin.nextLine();
            if(isFunny(s))
            {
                System.out.println("Funny");
            }
            else
            {
                System.out.println("Not Funny");
            }
            
        }
        stdin.close();
    }
    
    private static boolean isFunny(String s)
    {
        for(int j = 0; j < s.length() - 1; j++)
        {
            if(Math.abs(Character.codePointAt(s, j + 1) - Character.codePointAt(s, j)) !=
                    Math.abs(Character.codePointAt(s, s.length() - j - 2) - Character.codePointAt(s, s.length() - j - 1)))
            {
                return false;
            }
        }
        return true;
    }
}

import java.util.Scanner;

public class FunnyString

{

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

{

String s = stdin.nextLine();

if(isFunny(s))

{

System.out.println("Funny");

}

else

{

System.out.println("Not Funny");

}

stdin.close();

}

private static boolean isFunny(String s)

{

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

{

if(Math.abs(Character.codePointAt(s, j + 1) - Character.codePointAt(s, j)) !=

Math.abs(Character.codePointAt(s, s.length() - j - 2) - Character.codePointAt(s, s.length() - j - 1)))

{

return false;

}

return true;

}

JavaScript […]

Hackerrank – Flowers

Popis problému Celý popis zadania sa nacháza – Hackerrank. Riešenie Usporiadaj všetky ceny zostupne. Rovnica pre určenie ceny kvetu i: $$total = \sum_{i=0}^{n-1}((i / k + 1) * price_{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 Flowers {

    private static class Descending implements Comparator<Integer> {
        @Override
        public int compare(Integer i, Integer j) {
            return j - i;
        }
    }

    public static void main(String[] args) {
        Scanner stdin = new Scanner(System.in);
        int n = stdin.nextInt();
        int k = stdin.nextInt();
        Integer[] prices = new Integer[n];
        for(int i = 0; i < n; i++) {
            prices[i] = stdin.nextInt();
        }
        Arrays.sort(prices, new Descending());
        int sum = 0;
        for(int i = 0; i < n; i++) {
            int factor = i / k;
            sum += prices[i] * (factor + 1);
        }
        System.out.println(sum);
        stdin.close();
    }
}

import java.util.*;

public class Flowers {

private static class Descending implements Comparator<Integer> {

@Override

public int compare(Integer i, Integer j) {

return j - i;

}

public static void main(String[] args) {

Scanner stdin = new Scanner(System.in);

int n = stdin.nextInt();

int k = stdin.nextInt();

Integer[] prices = new Integer[n];

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

prices[i] = stdin.nextInt();

}

Arrays.sort(prices, new Descending());

int sum = 0;

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

int factor = i / k;

sum += prices[i] * (factor + 1);

}

System.out.println(sum);

stdin.close();

}

JavaScript

'use strict';

const processData = input => {
    let lines = input.split('\n');
    let definition = lines[0].split(' ').map(i => parseInt(i));
    let n = definition[0];
    let k = definition[1];
    let prices = lines[1].split(" ").map(i => parseInt(i));
    let descendingPrices = prices.sort((i, j) => j - i);
    let totalPrice = 0;
    for(let i = 0; i < n; i++) {
        let factor = parseInt(i / k);
        totalPrice += (factor + 1) * descendingPrices[i];
    }
    console.log(totalPrice);

};

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 definition = lines[0].split(' ').map(i => parseInt(i));

let n = definition[0];

let k = definition[1];

let prices = lines[1].split(" ").map(i => parseInt(i));

let descendingPrices = prices.sort((i, j) => j - i);

let totalPrice = 0;

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

let factor = parseInt(i / k);

totalPrice += (factor + 1) * descendingPrices[i];

}

console.log(totalPrice);

};

process.stdin.resume();

process.stdin.setEncoding("ascii");

var _input = "";

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

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

Ruby

(n, k) = gets.chomp.split.map { |e| e.to_i }
prices = gets.chomp.split.map { |e| e.to_i }

prices.sort! { |i,j| j <=> i }
result = 0
n.times do |i|
  factor = i / k
  result += (factor + 1) * prices[i]
end
puts result

(n, k) = gets.chomp.split.map { |e| e.to_i }

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

prices.sort! { |i,j| j <=> i }

result = 0

n.times do |i|

factor = i / k

result += (factor + 1) * prices[i]

end

puts result

[…]

Hackerrank – Flipping Bits

Popis problému Celý popis zadania sa nacháza – Hackerrank. Riešenie Definoval som si najväčšie možné neznamienkové celé číslo v dvojkovej sústave 11 111 111 111 111 111 111 111 111 111 111. Pre každé zadané číslo som vykonal operáciu XOR so zadaným maximom a vypísal výsledok. Nie všetky programovacie jazyky podporujú štandardne znamienkové celé čísla. […]

Hackerrank – Find Point

Popis problému Celý popis zadania sa nacháza – Hackerrank. Riešenie Pozri Wikipedia stránku. 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 FindPoint {

    public static void main(String[] args) {
        Scanner stdin = new Scanner(System.in);
        int points = stdin.nextInt();
        for(int i = 0; i < points; i++) {
            int x = stdin.nextInt();
            int y = stdin.nextInt();
            int mx = stdin.nextInt();
            int my = stdin.nextInt();
            int sx = 2 * mx - x;
            int sy = 2 * my - y;
            System.out.println(sx + " " + sy);
        }
        stdin.close();
    }
}

import java.util.*;

public class FindPoint {

public static void main(String[] args) {

Scanner stdin = new Scanner(System.in);

int points = stdin.nextInt();

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

int x = stdin.nextInt();

int y = stdin.nextInt();

int mx = stdin.nextInt();

int my = stdin.nextInt();

int sx = 2 * mx - x;

int sy = 2 * my - y;

System.out.println(sx + " " + sy);

}

stdin.close();

}

JavaScript

function processData(input) {
    var lines = input.split("\n");
    //var points = parseInt(lines[0]);
    for(var i = 1; i < lines.length; i++) {
        var coordinates = lines[i].split(" ").map(i => parseInt(i));
        var x = coordinates[0];
        var y = coordinates[1];
        var mx = coordinates[2];
        var my = coordinates[3];
        var sx = 2 * mx - x;
        var sy = 2 * my - y;
        console.log(sx + " " + sy);
    }
}

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 points = parseInt(lines[0]);

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

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

var x = coordinates[0];

var y = coordinates[1];

var mx = coordinates[2];

var my = coordinates[3];

var sx = 2 * mx - x;

var sy = 2 * my - y;

console.log(sx + " " + sy);

}

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

case class Point(val x: Int, val y: Int) {
  def reflection(midPoint: Point): Point = {
    val rx = 2 * midPoint.x - x
    val ry = 2 * midPoint.y - y
    Point(rx, ry)
  }
}

object FindPoint extends App {
  val coordinates = Source.stdin.getLines().drop(1)
  coordinates.foreach {
    lines => {
      val ints = lines.split(" ").map(_.toInt)
      val point = Point(ints(0), ints(1))
      val midPoint = Point(ints(2), ints(3))
      val symmetricPoint = point.reflection(midPoint)
      println(s"${symmetricPoint.x} ${symmetricPoint.y}")
    }
  }
}

import scala.io.Source

case class Point(val x: Int, val y: Int) {

def reflection(midPoint: Point): Point = {

val rx = 2 * midPoint.x - x

val ry = 2 * midPoint.y - y

Point(rx, ry)

}

object FindPoint extends App {

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

coordinates.foreach {

lines => {

val ints = lines.split(" ").map(_.toInt)

val point = Point(ints(0), ints(1))

val midPoint = Point(ints(2), ints(3))

val symmetricPoint = point.reflection(midPoint)

println(s"${symmetricPoint.x} ${symmetricPoint.y}")

}

Ruby

class Point
  attr_reader :x, :y
  
  def initialize(x, y)
    @x = x
    @y = y
  end

  def self.symetric_point(point, midpoint)
    x = 2 * midpoint.x - point.x
    y = 2 * midpoint.y - point.y
    return Point.new(x, y)
  end
end


tests = gets.chomp.to_i
tests.times do
  coordinates = gets.chomp.split.map { |e| e.to_i }
  half1 = coordinates.slice(0..1)
  half2 = coordinates.slice(2..3)
  point = Point.new(half1[0], half1[1])
  midpoint = Point.new(half2[0], half2[1])
  
  symetric_point = Point.symetric_point(point, midpoint)
  puts "#{symetric_point.x} #{symetric_point.y}"
end

class Point

attr_reader :x, :y

def initialize(x, y)

@x = x

@y = y

end

def self.symetric_point(point, midpoint)

x = 2 * midpoint.x - point.x

y = 2 * midpoint.y - point.y

return Point.new(x, y)

end

tests = gets.chomp.to_i

tests.times do

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

half1 = coordinates.slice(0..1)

half2 = coordinates.slice(2..3)

point = Point.new(half1[0], half1[1])

midpoint = Point.new(half2[0], half2[1])

symetric_point = Point.symetric_point(point, midpoint)

puts "#{symetric_point.x} #{symetric_point.y}"

end

Hackerrank – Find Hackerrank

Popis problému Celý popis zadania sa nacháza – Hackerrank. Riešenie Vypíš „0“ ak zadaný reťazec zodpovedá regulárnemu výrazu ^hackerrank$ alebo ^hackerrank.*hackerrank$ Vypíš „1“ ak zadaný reťazec zodpovedá regulárnemu výrazu ^hackerrank.* Vypíš „2“ ak zadaný reťazec zodpovedá regulárnemu výrazu .*hackerrank$ inak vypíš „-1“ Vytvoril som riešenie v týchto programovacích jazykoch: Java JavaScript Scala Ruby Všetky riešenia […]

Hackerrank – Find Digits

Popis problému Celý popis zadania sa nacháza – Hackerrank. Riešenie Spočítaj všetky číslice, ktoré sú väčšie ako 0 a ak je zadané číslo deliteľné aktuálnou číslicou, ktorú porovnávame. 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 FindDigits 
{
    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 result = 0;
            String number = stdin.nextLine();
            for(char digit : number.toCharArray())
            {
                if(Character.getNumericValue(digit) != 0 
                        && Integer.parseInt(number) % Character.getNumericValue(digit) == 0)
                {
                    result++;
                }
            }
            System.out.println(result);
        }
        stdin.close();
    }
}

import java.util.Scanner;

public class FindDigits

{

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 result = 0;

String number = stdin.nextLine();

for(char digit : number.toCharArray())

{

if(Character.getNumericValue(digit) != 0

&& Integer.parseInt(number) % Character.getNumericValue(digit) == 0)

{

result++;

}

System.out.println(result);

}

stdin.close();

}

JavaScript

function processData(input) {
    var inputs = input.split('\n');
    var tests = parseInt(inputs[0]);

    for(var i = 0; i < tests; i++) {
        for(var j = 1; j < inputs.length; j++) {
            var result = 0;
            var num = parseInt(inputs[j]);
            for(var k = 0; k < inputs[j].length; k++) {
                var c = parseInt(inputs[j][k]);
                if(c > 0 && num % c === 0) {
                    result++;
                }
            }
            console.log(result);
        }
        return;
    }
}

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

var tests = parseInt(inputs[0]);

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

for(var j = 1; j < inputs.length; j++) {

var result = 0;

var num = parseInt(inputs[j]);

for(var k = 0; k < inputs[j].length; k++) {

var c = parseInt(inputs[j][k]);

if(c > 0 && num % c === 0) {

result++;

}

console.log(result);

}

return;

}

process.stdin.resume();

process.stdin.setEncoding("ascii");

_input = "";

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

_input += input;

});

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

processData(_input);

});

Scala

object FindDigits extends App {
  var inputs = io.Source.stdin.getLines().toList.tail

  inputs.foreach {
    in =>
      println(in.toCharArray.count(d =>
        d.getNumericValue != 0 && in.toInt % d.getNumericValue == 0))
  }
}

object FindDigits extends App {

var inputs = io.Source.stdin.getLines().toList.tail

inputs.foreach {

in =>

println(in.toCharArray.count(d =>

d.getNumericValue != 0 && in.toInt % d.getNumericValue == 0))

}

Ruby […]

Pavol Pidanič

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

Značka: ruby

Hackerrank – Halloween Party

Hackerrank – HackerRank Tweets

Hackerrank – Gemstones

Hackerrank – Game of Thrones – I

Hackerrank – Funny String

Hackerrank – Flowers

Hackerrank – Flipping Bits

Hackerrank – Find Point

Hackerrank – Find Hackerrank

Hackerrank – Find Digits