diff options
| author | Mohammad S Anwar <Mohammad.Anwar@yahoo.com> | 2020-12-09 03:51:22 +0000 |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2020-12-09 03:51:22 +0000 |
| commit | 58a7569f7a35797f2e57f285a8c138b2edfc4346 (patch) | |
| tree | 8fd73cd96a9a6cd4c3cbb6596e63d050409e0e97 /challenge-090 | |
| parent | f0f1c062f0e79058c45f0488f309411b3efb66ef (diff) | |
| parent | fa883cb3f3225a37216f0ff9c6eaf1cc5426b827 (diff) | |
| download | perlweeklychallenge-club-58a7569f7a35797f2e57f285a8c138b2edfc4346.tar.gz perlweeklychallenge-club-58a7569f7a35797f2e57f285a8c138b2edfc4346.tar.bz2 perlweeklychallenge-club-58a7569f7a35797f2e57f285a8c138b2edfc4346.zip | |
Merge pull request #2952 from ziameraj16/new-branch
Java Solution for Ethiopian Multiplication
Diffstat (limited to 'challenge-090')
| -rw-r--r-- | challenge-090/ziameraj16/README.md | 1 | ||||
| -rwxr-xr-x | challenge-090/ziameraj16/java/EthiopianMultiplication.java | 25 |
2 files changed, 26 insertions, 0 deletions
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; + } +} |
