Hackerrank - Sequence Equation

Hackerrank – Popis problému

Celý popis zadania sa nacháza – Hackerrank.

Riešenie

Mám zadaný počet čísel n
Robím pre všetky čísla od 1 po n
Nájdem ich index v prvkoch na druhom riadku
Potom nájdem index indexu v prvkoch na druhom riadku

Vytvoril som riešenie v týchto programovacích jazykoch:

Scala
Java
Javascript

Všetky riešenia sú dostupné aj na mojom GitHub profile.

Scala

import scala.io.Source

object Solution extends App {
  val inputLines = Source.stdin.getLines().toList
  val n = inputLines.head.toInt
  val elements = inputLines.tail.head.split(" ").map(_.toInt)

  val y = (1 to n).map(i => {
    val index = elements.indexOf(i)
    val value1 = index + 1
    val index2 = elements.indexOf(value1)
    index2
  })

  println(y.mkString("\n"))
}

import scala.io.Source

object Solution extends App {

val inputLines = Source.stdin.getLines().toList

val n = inputLines.head.toInt

val elements = inputLines.tail.head.split(" ").map(_.toInt)

val y = (1 to n).map(i => {

val index = elements.indexOf(i)

val value1 = index + 1

val index2 = elements.indexOf(value1)

index2

})

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

}

Java

import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
import java.util.Scanner;
import java.util.stream.Collectors;

public class SequenceEquation {
    public static void main(String[] args) {
        Scanner stdin = new Scanner(System.in);
        int tests = Integer.parseInt(stdin.nextLine());
        List<Integer> elements = Arrays.stream(stdin.nextLine().split(" ")).map(Integer::parseInt).collect(Collectors.toList());
        List<Integer> result = new ArrayList<>();
        for(int i = 1; i <= tests; i++) {
            int index = elements.indexOf(i);
            int value1 = index + 1;
            int index2 = elements.indexOf(value1);
            result.add(index2 + 1);
        }
        for (int elem : result) {
            System.out.println(elem);
        }
        stdin.close();
    }
}

import java.util.ArrayList;

import java.util.Arrays;

import java.util.List;

import java.util.Scanner;

import java.util.stream.Collectors;

public class SequenceEquation {

public static void main(String[] args) {

Scanner stdin = new Scanner(System.in);

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

List<Integer> elements = Arrays.stream(stdin.nextLine().split(" ")).map(Integer::parseInt).collect(Collectors.toList());

List<Integer> result = new ArrayList<>();

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

int index = elements.indexOf(i);

int value1 = index + 1;

int index2 = elements.indexOf(value1);

result.add(index2 + 1);

}

for (int elem : result) {

System.out.println(elem);

}

stdin.close();

}

Javascript

'use strict';

const processData = input => {
    const lines = input.split('\n');
    const n = parseInt(lines[0]);
    const elements = lines[1].split(' ').map(i => parseInt(i));
    const result = [];
    for(let i = 1; i <= n; i++) {
        const index = elements.indexOf(i);
        const value1 = index + 1;
        const index2 = elements.indexOf(value1);
        result[i - 1] = index2 + 1;
    }

    console.log(result.join('\n'));
};

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

const result = [];

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

const index = elements.indexOf(i);

const value1 = index + 1;

const index2 = elements.indexOf(value1);

result[i - 1] = index2 + 1;

}

console.log(result.join('\n'));

};

process.stdin.resume();

process.stdin.setEncoding("ascii");

let _input = "";

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

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

Pavol Pidanič

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

Hackerrank – Sequence Equation

Hackerrank – Popis problému

Riešenie

Scala

Java

Javascript

Leave a Reply Cancel reply