From fa883cb3f3225a37216f0ff9c6eaf1cc5426b827 Mon Sep 17 00:00:00 2001
From: ziameraj16 <ziameraj16@gmail.com>
Date: Tue, 8 Dec 2020 18:08:50 +0000
Subject: Java Solution for Ethiopian Multiplication

---
 challenge-090/ziameraj16/README.md                 |  1 +
 .../ziameraj16/java/EthiopianMultiplication.java   | 25 ++++++++++++++++++++++
 2 files changed, 26 insertions(+)
 create mode 100644 challenge-090/ziameraj16/README.md
 create mode 100755 challenge-090/ziameraj16/java/EthiopianMultiplication.java

diff --git a/challenge-090/ziameraj16/README.md b/challenge-090/ziameraj16/README.md
new file mode 100644
index 0000000000..e04a1c63a3
--- /dev/null
+++ b/challenge-090/ziameraj16/README.md
@@ -0,0 +1 @@
+Solution by Mohammad Meraj Zia
diff --git a/challenge-090/ziameraj16/java/EthiopianMultiplication.java b/challenge-090/ziameraj16/java/EthiopianMultiplication.java
new file mode 100755
index 0000000000..da39b823e5
--- /dev/null
+++ b/challenge-090/ziameraj16/java/EthiopianMultiplication.java
@@ -0,0 +1,25 @@
+
+import java.util.Scanner;
+
+public class EthiopianMultiplication {
+
+    public static void main(String[] args) {
+        Scanner scanner = new Scanner(System.in);
+        System.out.println("Enter first number");
+        final int first = scanner.nextInt();
+        System.out.println("Enter second number");
+        final int second = scanner.nextInt();
+        System.out.println("Result using Ethiopian Multiplication: " + multiply(first, second));
+    }
+
+    public static int multiply(int first, int second) {
+        int sum = 0;
+        for (int i = first; i >= 1; i = i/2) {
+            if (i % 2 != 0) {
+                sum += second;
+            }
+            second = second * 2;
+        }
+        return sum;
+    }
+}
-- 
cgit