fork download 
  1. import java.io.BufferedReader;
  2. 	import java.io.IOException;
  3. 	import java.io.InputStreamReader;
  4.  
  5. 	public class Main {
  6. 		public static void main(String[] args) {
  7. 			try (BufferedReader br = new BufferedReader(new InputStreamReader(System.in))) {
  8. 				String s = "";
  9. 				while ((s = br.readLine()) != null) {
  10. 					Operation o;
  11. 					try {
  12. 						o = new Operation(s);
  13. 						int result = getResult(o);
  14. 						System.out.printf("%d %c %d = %d\n", o.getOpOne(), o.getOp(), o.getOpTwo(), result);
  15. 					} catch (NumberFormatException | OperationConstructionException | DivideException e) {
  16. 						e.printStackTrace();
  17. 					}
  18. 				}
  19. 			} catch (IOException e) {
  20. 				e.printStackTrace();
  21. 			}
  22. 		}
  23.  
  24. 		private static int getResult(Operation o) throws DivideException {
  25. 			switch (o.getOp()) {
  26. 			case '+':
  27. 				return o.getOpOne() + o.getOpTwo();
  28. 			case '-':
  29. 				return o.getOpOne() + -o.getOpTwo();
  30. 			case '*':
  31. 				return multiply(o.getOpOne(), o.getOpTwo());
  32. 			case '/':
  33. 				return divide(o.getOpOne(), o.getOpTwo());
  34. 			case '^':
  35. 				return power(o.getOpOne(), o.getOpTwo());
  36. 			case '%':
  37. 				break;
  38. 			default:
  39. 				System.err.printf("%c is not a supported operation.\n", o.getOp());
  40. 				return -1;
  41. 			}
  42. 			return -1;
  43. 		}
  44.  
  45. 		private static int power(int one, int two) throws DivideException {
  46. 			if (two == 0) {
  47. 				return 1;
  48. 			} else if (two < 0) {
  49. 				throw new DivideException("Non-Integral Answer");
  50. 			}
  51. 			int result = 1;
  52. 			for (int i = 0; i < two; i++) {
  53. 				result = multiply(result, one);
  54. 			}
  55. 			return result;
  56. 		}
  57.  
  58. 		private static int divide(int one, int two) throws DivideException {
  59. 			if (two == 0) {
  60. 				throw new DivideException("Cannot divide by 0.");
  61. 			}
  62. 			boolean answerNegative = false;
  63. 			if ((one < 0 && two > 0) || (one > 0 && two < 0)) {
  64. 				answerNegative = true;
  65. 				if (one < 0) {
  66. 					one = -one;
  67. 				}
  68. 				if (two < 0) {
  69. 					two = -two;
  70. 				}
  71. 			} else if (one < 0 && two < 0) {
  72. 				one = -one;
  73. 				two = -two;
  74. 			}
  75.  
  76. 			int count = 0;
  77. 			int rem = one;
  78. 			while (rem >= two) {
  79. 				rem = rem + -two;
  80. 				count++;
  81. 			}
  82. 			if (rem > 0) {
  83. 				throw new DivideException("Non-Integral Answer");
  84. 			}
  85. 			return answerNegative ? -count : count;
  86. 		}
  87.  
  88. 		private static int multiply(int one, int two) {
  89. 			boolean answerNegative = false;
  90. 			if ((one < 0 && two > 0) || (one > 0 && two < 0)) {
  91. 				answerNegative = true;
  92. 				if (one < 0) {
  93. 					one = -one;
  94. 				}
  95. 				if (two < 0) {
  96. 					two = -two;
  97. 				}
  98. 			} else if (one < 0 && two < 0) {
  99. 				one = -one;
  100. 				two = -two;
  101. 			}
  102. 			int result = 0;
  103. 			for (int i = 0; i < one; i++) {
  104. 				result += two;
  105. 			}
  106. 			return answerNegative ? -result : result;
  107. 		}
  108.  
  109. 		public static class Operation {
  110. 			private int op_one, op_two;
  111. 			private char op;
  112.  
  113. 			public Operation(String s) throws OperationConstructionException, NumberFormatException {
  114. 				String[] parts = s.split("\\s");
  115. 				if (parts.length != 3) {
  116. 					throw new OperationConstructionException("Input must contain 3, spaced, items.");
  117. 				}
  118. 				op_one = Integer.parseInt(parts[0]);
  119. 				op_two = Integer.parseInt(parts[2]);
  120. 				if (parts[1].length() != 1) {
  121. 					throw new OperationConstructionException("Operation must be a single char: +, -, /, *, ^, %");
  122. 				}
  123. 				op = parts[1].charAt(0);
  124. 			}
  125.  
  126. 			public int getOpOne() {
  127. 				return op_one;
  128. 			}
  129.  
  130. 			public int getOpTwo() {
  131. 				return op_two;
  132. 			}
  133.  
  134. 			public char getOp() {
  135. 				return op;
  136. 			}
  137. 		}
  138.  
  139. 		public static class OperationConstructionException extends Throwable {
  140. 			private static final long serialVersionUID = 1L;
  141.  
  142. 			public OperationConstructionException(String message) {
  143. 				super(message);
  144. 			}
  145. 		}
  146.  
  147. 		public static class DivideException extends Throwable {
  148. 			private static final long serialVersionUID = 1L;
  149.  
  150. 			public DivideException(String message) {
  151. 				super(message);
  152. 			}
  153. 		}
  154. 	}
Success #stdin #stdout #stderr 0.06s 4386816KB
comments ()
stdin 
12 + 25
-30 + 100
100 - 30
100 - -30
-25 - 29
-41 - -10
9 * 3
9 * -4
-4 * 8
-12 * -9
100 / 2
75 / -3
-75 / 3
7 / 3
0 / 0
5 ^ 3
-5 ^ 3
-8 ^ 3
-1 ^ 1
1 ^ 1
0 ^ 5
5 ^ 0
10 ^ -3
stdout 
12 + 25 = 37
-30 + 100 = 70
100 - 30 = 70
100 - -30 = 130
-25 - 29 = -54
-41 - -10 = -31
9 * 3 = 27
9 * -4 = -36
-4 * 8 = -32
-12 * -9 = 108
100 / 2 = 50
75 / -3 = -25
-75 / 3 = -25
5 ^ 3 = 125
-5 ^ 3 = -125
-8 ^ 3 = -512
-1 ^ 1 = -1
1 ^ 1 = 1
0 ^ 5 = 0
5 ^ 0 = 1
stderr 
Main$DivideException: Non-Integral Answer
	at Main.divide(Main.java:83)
	at Main.getResult(Main.java:33)
	at Main.main(Main.java:13)
Main$DivideException: Cannot divide by 0.
	at Main.divide(Main.java:60)
	at Main.getResult(Main.java:33)
	at Main.main(Main.java:13)
Main$DivideException: Non-Integral Answer
	at Main.power(Main.java:49)
	at Main.getResult(Main.java:35)
	at Main.main(Main.java:13)
https://ideone.com/uBsbtA
language:
Java (HotSpot 12)
created:
7 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!