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

Hackerrank – Java Date and Time

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.*;

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

}

Hackerrank – Java Int to String

import java.util.*;
import java.security.*;

public class Solution {
    public static void main(String[] args) {

        DoNotTerminate.forbidExit();

        try {
            Scanner in = new Scanner(System.in);
            int n = in.nextInt();
            in.close();
            String s = String.valueOf(n);
            if (n == Integer.parseInt(s)) {
                System.out.println("Good job");
            } else {
                System.out.println("Wrong answer.");
            }
        } catch (DoNotTerminate.ExitTrappedException e) {
            System.out.println("Unsuccessful Termination!!");
        }
    }
}

//The following class will prevent you from terminating the code using exit(0)!
class DoNotTerminate {

    public static class ExitTrappedException extends SecurityException {

        private static final long serialVersionUID = 1;
    }

    public static void forbidExit() {
        final SecurityManager securityManager = new SecurityManager() {
            @Override
            public void checkPermission(Permission permission) {
                if (permission.getName().contains("exitVM")) {
                    throw new ExitTrappedException();
                }
            }
        };
        System.setSecurityManager(securityManager);
    }
}

import java.util.*;

import java.security.*;

public class Solution {

public static void main(String[] args) {

DoNotTerminate.forbidExit();

try {

Scanner in = new Scanner(System.in);

int n = in.nextInt();

in.close();

String s = String.valueOf(n);

if (n == Integer.parseInt(s)) {

System.out.println("Good job");

} else {

System.out.println("Wrong answer.");

}

} catch (DoNotTerminate.ExitTrappedException e) {

System.out.println("Unsuccessful Termination!!");

}

//The following class will prevent you from terminating the code using exit(0)!

class DoNotTerminate {

public static class ExitTrappedException extends SecurityException {

private static final long serialVersionUID = 1;

}

public static void forbidExit() {

final SecurityManager securityManager = new SecurityManager() {

@Override

public void checkPermission(Permission permission) {

if (permission.getName().contains("exitVM")) {

throw new ExitTrappedException();

}

};

System.setSecurityManager(securityManager);

}

Hackerrank – Java Static Initializer Block

import java.util.*;

class Solution {
    private static int B;
    private static int H;
    private static boolean flag = false;
    static {
        Scanner stdin = new Scanner(System.in);
        B = stdin.nextInt();
        H = stdin.nextInt();
        flag = B > 0 && H > 0;
        if(!flag) {
            System.out.println("java.lang.Exception: Breadth and height must be positive");
        }
        stdin.close();
    }

    public static void main(String [] args) {
        if(flag){
            int area = B * H;
            System.out.print(area);
        }
    }
}

import java.util.*;

class Solution {

private static int B;

private static int H;

private static boolean flag = false;

static {

Scanner stdin = new Scanner(System.in);

B = stdin.nextInt();

H = stdin.nextInt();

flag = B > 0 && H > 0;

if(!flag) {

System.out.println("java.lang.Exception: Breadth and height must be positive");

}

stdin.close();

}

public static void main(String [] args) {

if(flag){

int area = B * H;

System.out.print(area);

}

Hackerrank – Java Loops II

import java.util.*;

class Solution{
    public static void main(String []argh){
        Scanner in = new Scanner(System.in);
        int t = in.nextInt();
        for(int i = 0; i < t; i ++){
            int a = in.nextInt();
            int b = in.nextInt();
            int n = in.nextInt();
            long prev = 0;
            for(int j = 0; j < n; j++) {
                long val = prev + ((long)Math.pow(2, j) * b);
                System.out.print((val + a) + " ");
                prev = val;
            }
            System.out.println();
        }
        in.close();
    }
}

import java.util.*;

class Solution{

public static void main(String []argh){

Scanner in = new Scanner(System.in);

int t = in.nextInt();

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

int a = in.nextInt();

int b = in.nextInt();

int n = in.nextInt();

long prev = 0;

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

long val = prev + ((long)Math.pow(2, j) * b);

System.out.print((val + a) + " ");

prev = val;

}

System.out.println();

}

in.close();

}

Hackerrank – Java Loops I

import java.util.*;

public class Solution {

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        for(int i = 1; i <= 10; i++) {
            System.out.println(n + " x " + i + " = " + (i * n));
        }
    }
}

import java.util.*;

public class Solution {

public static void main(String[] args) {

Scanner in = new Scanner(System.in);

int n = in.nextInt();

for(int i = 1; i <= 10; i++) {

System.out.println(n + " x " + i + " = " + (i * n));

}

Hackerrank – Java Output Formatting

import java.util.Scanner;

public class Solution {

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        System.out.println("================================");
        for(int i = 0; i < 3; i++){
            String s1 = sc.next();
            int x = sc.nextInt();
            System.out.printf("%-15s%03d\n", s1, x);
        }
        System.out.println("================================");

    }
}

import java.util.Scanner;

public class Solution {

public static void main(String[] args) {

Scanner sc = new Scanner(System.in);

System.out.println("================================");

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

String s1 = sc.next();

int x = sc.nextInt();

System.out.printf("%-15s%03d\n", s1, x);

}

System.out.println("================================");

}

Hackerrank – Java Stdin and Stdout II

import java.util.Scanner;

public class Solution {

    public static void main(String[] args) {
        Scanner scan = new Scanner(System.in);
        int i = scan.nextInt();
        double d = scan.nextDouble();
        scan.nextLine();
        String s = scan.nextLine();

        System.out.println("String: " + s);
        System.out.println("Double: " + d);
        System.out.println("Int: " + i);
    }
}

import java.util.Scanner;

public class Solution {

public static void main(String[] args) {

Scanner scan = new Scanner(System.in);

int i = scan.nextInt();

double d = scan.nextDouble();

scan.nextLine();

String s = scan.nextLine();

System.out.println("String: " + s);

System.out.println("Double: " + d);

System.out.println("Int: " + i);

}

Hackerrank – Mini-Max Sum

Hackerrank – Popis problému Celý popis zadania sa nacháza – Hackerrank. Riešenie Ak budú prvky usporiadané vzostupne – najmenší súčet bude mať prvých n-1 prvkov – najväčší súčet je medzi poslednými n-1 prvkami 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. Java

import java.util.*;

public class MiniMaxSum {

    public static void main(String[] args) {
        Scanner stdin = new Scanner(System.in);
        Object[] numbers = Arrays.stream(stdin.nextLine().split(" "))
                .map(Long::parseLong).toArray();
        Arrays.sort(numbers);
        long minSum = 0;
        long maxSum = 0;
        for(int i = 0; i < numbers.length - 1; i++) {
            minSum += (long) numbers[i];
            maxSum += (long) numbers[i + 1];
        }

        System.out.println(minSum + " " + maxSum);
        stdin.close();
    }
}

import java.util.*;

public class MiniMaxSum {

public static void main(String[] args) {

Scanner stdin = new Scanner(System.in);

Object[] numbers = Arrays.stream(stdin.nextLine().split(" "))

.map(Long::parseLong).toArray();

Arrays.sort(numbers);

long minSum = 0;

long maxSum = 0;

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

minSum += (long) numbers[i];

maxSum += (long) numbers[i + 1];

}

System.out.println(minSum + " " + maxSum);

stdin.close();

}

[…]

Hackerrank – Bon Appétit

Hackerrank – Popis problému Celý popis zadania sa nacháza – Hackerrank. Riešenie Vypočítame správnu sumu peňazí, ktoré je potrebné zaplatiť – (food_sum – index_of_allergic) / 2. Potom stačí porovnať, či sa vypočítaná suma zhoduje s množstom zadaným pri popise problému. Vytvoril som riešenie v týchto programovacích jazykoch: Scala Java JavaScript Ruby Všetky riešenia sú dostupné […]

Hackerrank – Sequence full of colors

Hackerrank – Popis problému Celý popis zadania sa nacháza – Hackerrank. Riešenie Implementoval som rekurzívnu funkciu, ktorá berie do úvahy zadané podmienky – pozri jej implementáciu. Vytvoril som riešenie v týchto programovacích jazykoch: Scala Všetky riešenia sú dostupné aj na mojom GitHub profile. Scala

import scala.io.Source
import scala.collection.mutable.Map

object SequenceFullOfColors extends App {
  val lines = Source.stdin.getLines().toList.tail
  val results = lines.map(fullOfColors).map(_.toString.capitalize)

  println(results.mkString("\n"))

  def fullOfColors(sequence: String): Boolean = {
    val colors = Map.empty[Char, Int]
    def prefixSequences(seq: String, n: Int): Boolean = {
      val char = seq(n)
      val count = colors.getOrElse(char, 0)
      colors.put(char, count + 1)
      if(n < seq.length - 1) {
        val greenCount = colors.getOrElse('G', 0)
        val redCount = colors.getOrElse('R', 0)
        val yellowCount = colors.getOrElse('Y', 0)
        val blueCount = colors.getOrElse('B', 0)
        if((greenCount - redCount).abs <= 1 && (yellowCount - blueCount).abs <= 1) {
          return prefixSequences(seq, n + 1)
        }
        return false
      }
      true
    }

    val condition = prefixSequences(sequence, 0)
    val greenCount = colors.getOrElse('G', 0)
    val redCount = colors.getOrElse('R', 0)
    val yellowCount = colors.getOrElse('Y', 0)
    val blueCount = colors.getOrElse('B', 0)
    condition && (greenCount == redCount) && (yellowCount == blueCount)
  }
}

import scala.io.Source

import scala.collection.mutable.Map

object SequenceFullOfColors extends App {

val lines = Source.stdin.getLines().toList.tail

val results = lines.map(fullOfColors).map(_.toString.capitalize)

println(results.mkString("\n"))

def fullOfColors(sequence: String): Boolean = {

val colors = Map.empty[Char, Int]

def prefixSequences(seq: String, n: Int): Boolean = {

val char = seq(n)

val count = colors.getOrElse(char, 0)

colors.put(char, count + 1)

if(n < seq.length - 1) {

val greenCount = colors.getOrElse('G', 0)

val redCount = colors.getOrElse('R', 0)

val yellowCount = colors.getOrElse('Y', 0)

val blueCount = colors.getOrElse('B', 0)

if((greenCount - redCount).abs <= 1 && (yellowCount - blueCount).abs <= 1) {

return prefixSequences(seq, n + 1)

}

return false

}

true

}

val condition = prefixSequences(sequence, 0)

val greenCount = colors.getOrElse('G', 0)

val redCount = colors.getOrElse('R', 0)

val yellowCount = colors.getOrElse('Y', 0)

val blueCount = colors.getOrElse('B', 0)

condition && (greenCount == redCount) && (yellowCount == blueCount)

}