Archives fibonacci - Pavol Pidanič

Hackerrank – Is Fibo

Popis problému Celý popis zadania sa nacháza – Hackerrank. Riešenie Vytvoríme si Fibonacciho postupnosť a zistíme, či sa fibonaciho číslo rovná požadovanému n. 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.math.BigInteger;
import java.util.*;

public class IsFibo {

    public static void main(String[] args) {
        Scanner stdin = new Scanner(System.in);
        int tests = stdin.nextInt();
        for(int i = 0; i < tests; i++) {
            BigInteger n = stdin.nextBigInteger();
            System.out.println(isFibo(n));
        }
        stdin.close();
    }

    private static String isFibo(BigInteger n) {
        BigInteger fib0 = BigInteger.ZERO;
        BigInteger fib1 = BigInteger.ONE;
        while(fib0.compareTo(n) <= 0) {
            if (fib0.compareTo(n) == 0) return "IsFibo";
            BigInteger temp = fib0;
            fib0 = fib1;
            fib1 = fib1.add(temp);
        }
        return "IsNotFibo";
    }
}

import java.math.BigInteger;

import java.util.*;

public class IsFibo {

public static void main(String[] args) {

Scanner stdin = new Scanner(System.in);

int tests = stdin.nextInt();

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

BigInteger n = stdin.nextBigInteger();

System.out.println(isFibo(n));

}

stdin.close();

}

private static String isFibo(BigInteger n) {

BigInteger fib0 = BigInteger.ZERO;

BigInteger fib1 = BigInteger.ONE;

while(fib0.compareTo(n) <= 0) {

if (fib0.compareTo(n) == 0) return "IsFibo";

BigInteger temp = fib0;

fib0 = fib1;

fib1 = fib1.add(temp);

}

return "IsNotFibo";

}

JavaScript

'use strict';

let isFibo = n => {
    let fib0 = 0;
    let fib1 = 1;
    while(fib0 <= n) {
        if (fib0 == n) return "IsFibo";
        let temp = fib0;
        fib0 = fib1;
        fib1 += temp;
    }
    return "IsNotFibo"
};
const processData = input => {
    console.log(input.split("\n").slice(1).map(i => parseInt(i)).map(isFibo).join("\n"));
};

process.stdin.resume();
process.stdin.setEncoding("ascii");

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

'use strict';

let isFibo = n => {

let fib0 = 0;

let fib1 = 1;

while(fib0 <= n) {

if (fib0 == n) return "IsFibo";

let temp = fib0;

fib0 = fib1;

fib1 += temp;

}

return "IsNotFibo"

};

const processData = input => {

console.log(input.split("\n").slice(1).map(i => parseInt(i)).map(isFibo).join("\n"));

};

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 IsFibo extends App {
  val lines = Source.stdin.getLines()
  val numbers = lines.drop(1).map(BigInt(_))
  val fibos = numbers.map(isFibo)
  println(fibos.mkString("\n"))

  def isFibo(n: BigInt): String = {
    var fib0: BigInt = 0
    var fib1: BigInt = 1
    while(fib0 <= n) {
      if (fib0 == n) return "IsFibo"
      val temp: BigInt = fib0
      fib0 = fib1
      fib1 += temp
    }
    "IsNotFibo"
  }
}

import scala.io.Source

object IsFibo extends App {

val lines = Source.stdin.getLines()

val numbers = lines.drop(1).map(BigInt(_))

val fibos = numbers.map(isFibo)

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

def isFibo(n: BigInt): String = {

var fib0: BigInt = 0

var fib1: BigInt = 1

while(fib0 <= n) {

if (fib0 == n) return "IsFibo"

val temp: BigInt = fib0

fib0 = fib1

fib1 += temp

}

"IsNotFibo"

}

Ruby

def is_fibo(number)
  fib0 = 0
  fib1 = 1
  while fib0 <= number do
    return "IsFibo" if fib0 == number
    temp = fib0
    fib0 = fib1
    fib1 += temp
  end
  return "IsNotFibo"  
end

test_cases = gets.chomp.to_i
test_cases.times do
  number = gets.chomp.to_i
  result = is_fibo(number)
  puts result
end

def is_fibo(number)

fib0 = 0

fib1 = 1

while fib0 <= number do

return "IsFibo" if fib0 == number

temp = fib0

fib0 = fib1

fib1 += temp

end

return "IsNotFibo"

end

test_cases = gets.chomp.to_i

test_cases.times do

number = gets.chomp.to_i

result = is_fibo(number)

puts result

end

Hackerrank – Fibonacci Numbers

Popis problému Celý popis zadania sa nacháza – Hackerrank. Riešenie Použijeme rovnicu pre Fibonacciho čísla z popisu problému Fibonacci(n) = 0 , n = 1 Fibonacci(n) = 1 , n = 2 Fibonacci(n) = Fibonacci(n-1) + Fibonacci(n-2) , n > 2 Vytvoril som riešenie v týchto programovacích jazykoch: Scala Všetky riešenia sú dostupné aj na […]

Pavol Pidanič

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

Značka: fibonacci

Hackerrank – Is Fibo

Hackerrank – Fibonacci Numbers