Archives java - Stránka 4 z 14

Hackerrank – Java Int to String

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.*;
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 – Repeated String

Hackerrank – Popis problému Celý popis zadania sa nacháza – Hackerrank. Riešenie Dĺžka slova opakovaného niekoľkokrát za sebou by prekročila časové limity pre toto zadanie. Musíme si ho nejako zjednodušiť. Máme zadaný reťazec – s. Spočítame výskyt znaku „a“ a označíme si ho ako – c Získaj dĺžku výsledného reťazca (zadané na druhom riadku) – […]

Hackerrank – Viral Advertising

Hackerrank – Popis problému Celý popis zadania sa nacháza – Hackerrank. Riešenie Použi vzorec zo zadania úlohy. 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 ViralAdvertising {

    public static void main(String[] args) {
        Scanner stdin = new Scanner(System.in);
        int n = Integer.parseInt(stdin.nextLine());
        int totalLiked = 0;
        int dayStartPeople = 5;
        for(int i = 0; i < n; i++) {
            int dayLiked = dayStartPeople / 2;
            int received = dayLiked * 3;
            totalLiked += dayLiked;
            dayStartPeople = received;
        }
        System.out.println(totalLiked);
        stdin.close();
    }
}

import java.util.*;

public class ViralAdvertising {

public static void main(String[] args) {

Scanner stdin = new Scanner(System.in);

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

int totalLiked = 0;

int dayStartPeople = 5;

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

int dayLiked = dayStartPeople / 2;

int received = dayLiked * 3;

totalLiked += dayLiked;

dayStartPeople = received;

}

System.out.println(totalLiked);

stdin.close();

}

JavaScript

'use strict';

const processData = input => {
    const n = parseInt(input)

    let totalLiked = 0;
    let dayStartPeople = 5;
    for(let i = 0; i < n; i++) {
        const dayLiked = parseInt(dayStartPeople / 2);
        const received = dayLiked * 3;
        totalLiked += dayLiked;
        dayStartPeople = received;
    }
    console.log(totalLiked);
};

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

let totalLiked = 0;

let dayStartPeople = 5;

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

const dayLiked = parseInt(dayStartPeople / 2);

const received = dayLiked * 3;

totalLiked += dayLiked;

dayStartPeople = received;

}

console.log(totalLiked);

};

process.stdin.resume();

process.stdin.setEncoding("ascii");

let _input = "";

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

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

Scala

import scala.io.Source

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

  println(like(5).take(n).sum)


  def like(start: Long): Stream[Long] = {
    val liked = start / 2
    val received = liked * 3
    liked #:: like(received)
  }
}

import scala.io.Source

object ViralAdvertising extends App {

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

println(like(5).take(n).sum)

def like(start: Long): Stream[Long] = {

val liked = start / 2

val received = liked * 3

liked #:: like(received)

}

Ruby

n = gets.to_i
    
total_liked = 0
day_start_people = 5
for i in 0...n do
  day_liked = day_start_people / 2
  received = day_liked * 3
  total_liked = total_liked + day_liked
  day_start_people = received
end

puts total_liked

n = gets.to_i

total_liked = 0

day_start_people = 5

for i in 0...n do

day_liked = day_start_people / 2

received = day_liked * 3

total_liked = total_liked + day_liked

day_start_people = received

end

puts total_liked

Pavol Pidanič

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

Značka: java

Hackerrank – Java Int to String

Hackerrank – Java Static Initializer Block

Hackerrank – Java Loops II

Hackerrank – Java Loops I

Hackerrank – Java Output Formatting

Hackerrank – Java Stdin and Stdout II

Hackerrank – Mini-Max Sum

Hackerrank – Bon Appétit

Hackerrank – Repeated String

Hackerrank – Viral Advertising