swift_lab05

//
//  main.swift
//  lab05
//
//  Created by student on 07/11/2022.
//

import Foundation

func fibonacci(n: Int) -> Int {
    var i:Int = 0;
    var v: Int = 1;
    var h1: Int = 0;
    var h2: Int = 0;

    while (i < n) {
        if (i == 0 || i == 1) {
            h1 = 1;
            h2 = 1;
        } else {
            h2 = h1;
            h1 = v;
            v = h1 + h2;
        }
        i += 1
    }
    return v;
}

func prime() {
    print("Podaj liczbe: ")
    guard let n = Float(readLine()!) else {
            fatalError("Not a number!")
        }

    var i: Int = 1;
    var divCount: Int = 0;

    while (i < Int(pow(n, 1/2))) {
        if (Int(n) % i == 0) {
            divCount += 1;
        }
        i += 1;
    }
    print(divCount);
    divCount < 2 ? print("Podana liczba jest liczba pierwsza.") : print("Podana liczba nie jest liczba pierwsza.");

}

func geoMean() {
    print("Podaj liczbe: ")
    guard var n = Float(readLine()!) else {
            fatalError("Not a number!")
        }
    var result: Double = 0;
    var resultLen: Int = 0;
    var currentDiv: Float = 0;
    var currentNumber: Float = 0;
    var i: Int = 0;

    result = Double(n);
    while (result >= 1) {
        result /= 10;
        resultLen += 1;
    }
    result = 1;
    i = resultLen;
    while (i > 0) {
        currentDiv = pow(10, Float(i) - 1);
        currentNumber = floor(n / currentDiv);
        result *= Double(currentNumber);
        print(result);
        n -= currentNumber  * currentDiv;
        print(n);
        i -= 1;
    }
    result = pow(result, 1 / Double(resultLen));

    print(result);
}

func palindrome() {
    print("Podaj slowo do sprawdzenia: ")
    guard var word = readLine() else {
        fatalError("Not a string!");
    }
    word = word.lowercased();
    var letterCount: Int = 0;
    print(Int(word.count / 2));

    while (letterCount <= Int(word.count / 2)) {
        if (word.prefix(letterCount) == word.suffix(letterCount)) {
            letterCount += 1;
            // maybe index remove
            print(word.prefix(letterCount), word.suffix(letterCount))
        } else {
            break;
        }
    }
    letterCount == Int(word.count / 2) ? print("Slowo jest palindromem.") : print("Slowo nie jest palindromem.");
}

//prime()
//geoMean();
palindrome();