initial upload Java projects

Author: gaydov

.idea/.name

@@ -0,0 +1,11 @@
+<?xml version="1.0" encoding="UTF-8"?>
+<module type="JAVA_MODULE" version="4">
+  <component name="NewModuleRootManager" inherit-compiler-output="true">
+    <exclude-output />
+    <content url="file://$MODULE_DIR$">
+      <sourceFolder url="file://$MODULE_DIR$/src" isTestSource="false" />
+    </content>
+    <orderEntry type="inheritedJdk" />
+    <orderEntry type="sourceFolder" forTests="false" />
+  </component>
+</module>

.idea/misc.xml

@@ -0,0 +1,55 @@
+package LanguageSpecificsJava;
+
+import java.util.Scanner;
+
+public class CompareCharArrays {
+    public static void main(String[] args) {
+        Scanner console = new Scanner(System.in);
+
+        String[] firstInput = console.nextLine().split(" ");
+        String[] secondInput = console.nextLine().split(" ");
+        char[] firstCharArr = new char[firstInput.length];
+        char[] secondCharArr = new char[secondInput.length];
+
+        for (int i = 0; i < firstInput.length; i++) {
+            firstCharArr[i] = firstInput[i].charAt(0);
+        }
+
+        for (int i = 0; i < secondInput.length; i++) {
+            secondCharArr[i] = secondInput[i].charAt(0);
+        }
+
+        int shorterArr = Math.min(firstCharArr.length, secondCharArr.length);
+
+        String firstStr = new String(firstCharArr);
+        String secondStr = new String(secondCharArr);
+
+        for (int i = 0; i < shorterArr; i++) {
+
+            if (firstCharArr[i] < secondCharArr[i]) {
+
+                System.out.println(firstStr);
+                System.out.println(secondStr);
+                return;
+
+            } else if (firstCharArr[i] > secondCharArr[i]) {
+
+                System.out.println(secondStr);
+                System.out.println(firstStr);
+                return;
+            }
+        }
+
+        if (firstCharArr.length < secondCharArr.length) {
+
+            System.out.println(firstStr);
+            System.out.println(secondStr);
+
+        } else {
+
+            System.out.println(secondStr);
+            System.out.println(firstStr);
+        }
+
+    }
+}

.idea/modules.xml

@@ -0,0 +1,23 @@
+package LanguageSpecificsJava;
+
+import java.util.Scanner;
+
+public class EmployeeData {
+    public static void main(String[] args) {
+        Scanner console = new Scanner(System.in);
+
+        String firstName = console.nextLine();
+        String lastName = console.nextLine();
+        int age = Integer.parseInt(console.nextLine());
+        char gender = console.nextLine().charAt(0);
+        long personalID = Long.parseLong(console.nextLine());
+        int employeeID = Integer.parseInt(console.nextLine());
+
+        System.out.println("First name: " + firstName);
+        System.out.println("Last name: " + lastName);
+        System.out.println("Age: " + age);
+        System.out.println("Gender: " + gender);
+        System.out.println("Personal ID: " + personalID);
+        System.out.println("Unique Employee number: " + employeeID);
+    }
+}

.idea/vcs.xml

@@ -0,0 +1,32 @@
+package LanguageSpecificsJava;
+
+import java.util.Scanner;
+
+public class FibonacciNumbers {
+    public static void main(String[] args) {
+        Scanner console = new Scanner(System.in);
+
+        int n = Integer.parseInt(console.nextLine());
+        System.out.println(Fib(n));
+    }
+
+    public static int Fib(int n) {
+
+        if (n == 0 || n == 1) {
+            return 1;
+        } else {
+
+            int firstNum = 1;
+            int secondNum = 1;
+            int fibNum = 0;
+
+            for (int i = 2; i <= n; i++) {
+
+                fibNum = firstNum + secondNum;
+                firstNum = secondNum;
+                secondNum = fibNum;
+            }
+            return fibNum;
+        }
+    }
+}

1LanguageSpecifics.iml

@@ -0,0 +1,43 @@
+package LanguageSpecificsJava;
+
+import java.util.ArrayList;
+import java.util.Arrays;
+import java.util.Collections;
+import java.util.Scanner;
+
+public class FoldAndSum {
+    public static void main(String[] args) {
+        Scanner console = new Scanner(System.in);
+        int[] inputNums = Arrays.stream(console.nextLine().split(" ")).mapToInt(Integer::parseInt).toArray();
+        int k = inputNums.length / 4;
+        ArrayList<Integer> leftPart = new ArrayList<Integer>();
+        ArrayList<Integer> rightPart = new ArrayList<Integer>();
+
+        for (int i = 0; i < k; i++) {
+            leftPart.add(inputNums[i]);
+        }
+        Collections.reverse(leftPart);
+
+        for (int i = inputNums.length - 1; i >= 3 * k; i--) {
+            rightPart.add(inputNums[i]);
+        }
+
+        ArrayList<Integer> topRow = new ArrayList<Integer>();
+        for (int i = 0; i < k; i++) {
+            topRow.addAll(leftPart);
+            topRow.addAll(rightPart);
+        }
+        ArrayList<Integer> bottomRow = new ArrayList<Integer>();
+        for (int i = k; i < 3 * k; i++) {
+            bottomRow.add(inputNums[i]);
+        }
+        ArrayList<Integer> result = new ArrayList<Integer>();
+        for (int i = 0; i < 2 * k; i++) {
+            result.add(topRow.get(i) + bottomRow.get(i));
+        }
+
+        for (int num : result) {
+            System.out.print(num + " ");
+        }
+    }
+}

src/LanguageSpecificsJava/CompareCharArrays.java

@@ -0,0 +1,16 @@
+package LanguageSpecificsJava;
+
+import java.util.Scanner;
+
+public class IntegertoHexandBinary {
+    public static void main(String[] args) {
+        Scanner console = new Scanner(System.in);
+
+        int decimalNum = Integer.parseInt(console.nextLine());
+        String hex = Integer.toHexString(decimalNum);
+        String binary = Integer.toBinaryString(decimalNum);
+
+        System.out.println(hex.toUpperCase());
+        System.out.println(binary);
+    }
+}

src/LanguageSpecificsJava/EmployeeData.java

@@ -0,0 +1,39 @@
+package LanguageSpecificsJava;
+
+import java.util.LinkedHashMap;
+import java.util.Map;
+import java.util.Scanner;
+
+public class MinerTask {
+    public static void main(String[] args) {
+        Scanner console = new Scanner(System.in);
+
+        String resource = console.nextLine();
+
+        LinkedHashMap<String, Integer> resourcesWithQuantities = new LinkedHashMap<>();
+
+        while (!resource.equals("stop")) {
+
+            int quantity = Integer.parseInt(console.nextLine());
+
+            if(!resourcesWithQuantities.containsKey(resource)) {
+
+                resourcesWithQuantities.put(resource, quantity);
+            }
+            else  {
+
+                int currentQuantity = resourcesWithQuantities.get(resource);
+                resourcesWithQuantities.put(resource, currentQuantity += quantity);
+            }
+
+            resource = console.nextLine();
+
+        }
+
+        for (Map.Entry<String, Integer> entry : resourcesWithQuantities.entrySet()) {
+
+            System.out.printf("%s -> %d %n", entry.getKey(), entry.getValue());
+        }
+
+    }
+}

src/LanguageSpecificsJava/FibonacciNumbers.java

@@ -0,0 +1,54 @@
+package LanguageSpecificsJava;
+
+import java.util.Scanner;
+
+public class NameLastDigit {
+    public static void main(String[] args) {
+        Scanner console = new Scanner(System.in);
+
+        long inputNum = Long.parseLong(console.nextLine());
+        System.out.println(getLastDigitWord(inputNum));
+    }
+
+    public static String getLastDigitWord(long number) {
+
+        long lastDigit = Math.abs(number) % 10;
+        String lastDigitWord = "";
+
+        switch ((int) lastDigit) {
+
+            case 0:
+                lastDigitWord = "zero";
+                break;
+            case 1:
+                lastDigitWord = "one";
+                break;
+            case 2:
+                lastDigitWord = "two";
+                break;
+            case 3:
+                lastDigitWord = "three";
+                break;
+            case 4:
+                lastDigitWord = "four";
+                break;
+            case 5:
+                lastDigitWord = "five";
+                break;
+            case 6:
+                lastDigitWord = "six";
+                break;
+            case 7:
+                lastDigitWord = "seven";
+                break;
+            case 8:
+                lastDigitWord = "eight";
+                break;
+            case 9:
+                lastDigitWord = "nine";
+                break;
+        }
+
+        return lastDigitWord;
+    }
+}

src/LanguageSpecificsJava/FoldAndSum.java

@@ -0,0 +1,19 @@
+package LanguageSpecificsJava;
+
+import java.util.Scanner;
+
+public class NumbersReversedOrder {
+    public static void main(String[] args) {
+        Scanner console = new Scanner(System.in);
+
+        String input = console.nextLine();
+        System.out.println(reverseDigits(input));
+
+    }
+
+    public static String reverseDigits(String input) {
+
+        String reversed = new StringBuilder(input).reverse().toString();
+        return reversed;
+    }
+}