Pavol Pidanič - Stránka 26 z 29 - Dokážem na 10 prstoch napočítať do 1023

Hackerrank – List Replication

Popis problému Celý popis zadania sa nacháza – Hackerrank. Riešenie

object ListReplication extends App {

  def f(num: Int, arr: List[Int]): List[Int] = if (arr.isEmpty) Nil 
                            else List.fill(num)(arr.head) ::: f(num, arr.tail)

  def f2(num: Int, arr: List[Int]): List[Int] =
    arr match {
      case x :: xs => List.fill(num)(x) ::: f2(num, xs)
      case Nil => Nil
    }

  def displayResult(arr: List[Int]) = println(f(arr(0).toInt, arr.drop(1)).map(_.toString).mkString("\n"))

  displayResult(io.Source.stdin.getLines.toList.map(_.trim).map(_.toInt))
}

object ListReplication extends App {

def f(num: Int, arr: List[Int]): List[Int] = if (arr.isEmpty) Nil

else List.fill(num)(arr.head) ::: f(num, arr.tail)

def f2(num: Int, arr: List[Int]): List[Int] =

arr match {

case x :: xs => List.fill(num)(x) ::: f2(num, xs)

case Nil => Nil

}

def displayResult(arr: List[Int]) = println(f(arr(0).toInt, arr.drop(1)).map(_.toString).mkString("\n"))

displayResult(io.Source.stdin.getLines.toList.map(_.trim).map(_.toInt))

}

Riešenie dostupné na mojom GitHub profile.

Hackerrank – Hello World N Times

Popis problému Celý popis zadania sa nacháza – Hackerrank. Riešenie

object HelloWorldNTimes extends App {
  def f2(i: Int): Unit = println("Hello World")

  def f(n: Int) = (1 to n).foreach(f2(_))

  var n = readInt
  f(n)
}

object HelloWorldNTimes extends App {

def f2(i: Int): Unit = println("Hello World")

def f(n: Int) = (1 to n).foreach(f2(_))

var n = readInt

f(n)

}

Riešenie dostupné na mojom GitHub profile.

Exploring Possibilities for Symmetric Implementation of Aspect-Oriented Design Patterns in Scala

Note: Only English version Originally published in Proceedings In Informatics and Information Technologies Student Research Conference 2015. PDF available here, source code on GitHub. Abstract In aspect-oriented programming, it may be distinguished between asymmetric and symmetric implementation. Aspect-oriented design patterns are known in their AspectJ-like, asymmetric implementation. One of their categorization is by dominating element […]

Hackerrank – Hello World

Popis problému Celý popis zadania sa nacháza – Hackerrank. Riešenie

object HelloWorld extends App {
  def f() = println("Hello World")

  f()
}

object HelloWorld extends App {

def f() = println("Hello World")

f()

}

Riešenie dostupné na mojom GitHub profile.

Hackerrank – Solve me first FP

Popis problému Celý popis zadania sa nacháza – Hackerrank. Riešenie

object SolveMeFirst {
  def main(args: Array[String]) {
    println(io.Source.stdin.getLines().take(2).map(_.toInt).sum)
  }
}

object SolveMeFirst {

def main(args: Array[String]) {

println(io.Source.stdin.getLines().take(2).map(_.toInt).sum)

}

Riešenie je dostupné na mojom GitHub profile.

Hackerrank – Print the elements of a linked list

Popis problému Celý popis zadania sa nacháza – Hackerrank. Riešenie

void Print(Node head) {
  while(head != null) {
      System.out.println(head.data);
      head = head.next;
  } 
}

void Print(Node head) {

while(head != null) {

System.out.println(head.data);

head = head.next;

}

Riešenie tiež dostupné na mojom GitHub profile.

Hackerrank – Diagonal Difference

Popis problému Celý popis zadania sa nacháza – Hackerrank. Riešenie Vytvoríme si 2 súčty – jeden pre diagonálu od ľavého horného rohu po pravý dolný, druhý pre diagonálu od pravého horného rohu po ľavý dolný roh. Urobíme ich rozdiel. Vytvoril som riešenie v týchto programovacích jazykoch: Scala Java JavaScript Ruby Všetky riešenia sú dostupné aj […]

Hackerrank – Staircase

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 Ruby Všetky riešenia sú dostupné aj na mojom GitHub profile. Scala

object Staircase extends App {
   val n = io.Source.stdin.bufferedReader().readLine().toInt

   Range(1, n + 1).foreach {
     i => println(stair(i, n))
   }

   def stair(i: Int, n: Int) = " " * (n - i) + "#" * i
 }

object Staircase extends App {

val n = io.Source.stdin.bufferedReader().readLine().toInt

Range(1, n + 1).foreach {

i => println(stair(i, n))

}

def stair(i: Int, n: Int) = " " * (n - i) + "#" * i

}

Java

import java.util.*;

public class Staircase 
{
    public static void main(String[] args) 
    {
        Scanner stdin = new Scanner(System.in);
        int height = Integer.parseInt(stdin.nextLine());
        for(int i = 0; i < height; i++)
        {
           for(int j = 0; j < height; j++)
           {
                if(height - i - 2 < j)
                {
                    System.out.print("#");
                }
               else
               {
                   System.out.print(" ");
               }
           }
            System.out.println();
        }
        stdin.close();
    }
}

import java.util.*;

public class Staircase

{

public static void main(String[] args)

{

Scanner stdin = new Scanner(System.in);

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

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

{

for(int j = 0; j < height; j++)

{

if(height - i - 2 < j)

{

System.out.print("#");

}

else

{

System.out.print(" ");

}

System.out.println();

}

stdin.close();

}

JavaScript

function processData(input) {
    var n = parseInt(input);

    for(var i = 0; i < n; i++)
    {
        var s = "";
        for(var j = 0; j < n; j++)
        {
            if(n - i - 2 < j)
            {
                s += "#";
            }
            else
            {
                s += " ";
            }
        }
        console.log(s);
    }
}

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 n = parseInt(input);

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

{

var s = "";

for(var j = 0; j < n; j++)

{

if(n - i - 2 < j)

{

s += "#";

}

else

{

s += " ";

}

console.log(s);

}

process.stdin.resume();

process.stdin.setEncoding("ascii");

_input = "";

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

_input += input;

});

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

processData(_input);

});

Ruby

def stair(spaces, hashes)
  " " * spaces + "#" * hashes
end

n = gets.to_i

for i in 1..n do
  puts stair(n - i, i)
end

def stair(spaces, hashes)

" " * spaces + "#" * hashes

end

n = gets.to_i

for i in 1..n do

puts stair(n - i, i)

end

Hackerrank – String Reductions

Popis problému Celý popis zadania sa nacháza – Hackerrank. Riešenie

object StringReductions extends App {
  println(io.Source.stdin.getLines().toList.head.distinct)
}

object StringReductions extends App {

println(io.Source.stdin.getLines().toList.head.distinct)

}

Riešenie je dostupné na mojom GitHub profile.

Hackerrank – Sort Command #2

Popis problému Celý popis zadania sa nacháza – Hackerrank. Riešenie

#!/bin/bash

sort -r

#!/bin/bash

sort -r

Riešenie je dostupné na mojom GitHub profile.