Final HomeTask1

src/com/geekhub/home/task1/Factorial.java

@@ -0,0 +1,26 @@
+package com.geekhub.home.task1;
+
+/**
+ * Created by kvart on 15.10.15.
+ */
+public class Factorial {
+    public int factorial(int n){
+
+        if (n==0){
+            return 1;
+        }
+        if (n<0){
+            System.out.println("Incorrect value N");
+            return 0;
+        }
+
+        int x=1;
+
+        for (int i=1; i<=n; i++){
+             x=x*i;
+        }
+
+        return x;
+    }
+}
+

src/com/geekhub/home/task1/Fibonacci.java

@@ -0,0 +1,34 @@
+package com.geekhub.home.task1;
+
+/**
+ * Created by kvart on 15.10.15.
+ */
+public class Fibonacci {
+
+    public int[] fibonacci(int n){
+
+
+
+        int [] fibonacci=new int[n];
+        if (n==1){
+            System.out.println("Incorrect value N");
+            fibonacci[0]=1;
+            return fibonacci;
+        }
+        if (n==2){
+            System.out.println("Incorrect value N");
+            fibonacci[0]=1;
+            fibonacci[1]=1;
+            return fibonacci;
+        }
+
+        fibonacci[0]=1;
+        fibonacci[1]=1;
+
+        for (int i=2; i<n; i++){
+            fibonacci[i]= fibonacci[i-2] + fibonacci[i-1];
+
+        }
+        return fibonacci;
+    }
+}

src/com/geekhub/home/task1/Main.java

@@ -0,0 +1,40 @@
+package com.geekhub.home.task1;
+
+import java.util.Arrays;
+import java.util.Scanner;
+
+/**
+ * Created by kvart on 15.10.15.
+ */
+public class Main {
+    public static void main(String[] args) {
+
+        Factorial calculateFactorial=new Factorial();
+        Scanner input = new Scanner(System.in);
+        System.out.println("Input N for calculate Factorial");
+        if (input.hasNextInt()) {
+
+            int n=input.nextInt();
+            System.out.println("Factorial "+n +" = "+calculateFactorial.factorial(n));
+
+        } else {
+            System.out.println("Incorrect value N");
+        }
+        System.out.println("Input N for sequence Fibonacci");
+        if (input.hasNextInt()) {
+            int n = input.nextInt();
+            Fibonacci calculateFibonacci = new Fibonacci();
+            System.out.println("Fibonacci " +n +" = " +Arrays.toString(calculateFibonacci.fibonacci(n)));
+
+        } else {
+            System.out.println("Incorrect value N");
+        }
+
+        System.out.println("Input N for convert to word");
+        if (input.hasNextInt()) {
+            int n = input.nextInt();
+            NumberToWordConverter numbertoworkconverter = new NumberToWordConverter();
+            System.out.println(numbertoworkconverter.numberToWordConverter(n));
+        }
+    }
+}

src/com/geekhub/home/task1/NumberToWordConverter.java

@@ -0,0 +1,33 @@
+package com.geekhub.home.task1;
+
+/**
+ * Created by kvart on 15.10.15.
+ */
+public class NumberToWordConverter {
+    public String numberToWordConverter(int n){
+        switch(n) {
+            case 1:
+                return "One";
+            case 2:
+                return "Two";
+            case 3:
+                return "Three";
+            case 4:
+                return "Four";
+            case 5:
+                return "Five";
+            case 6:
+                return "Six";
+            case 7:
+                return "Seven";
+            case 8:
+                return "Eight";
+            case 9:
+                return "Nine";
+            case 0:
+                return "Zero";
+            default:
+                return "Incorrect value N";
+        }
+    }
+}