Added 10 solutions

2017-09-11 09:32:17 -07:00
parent 1b2f98dd95
commit ba2c70755b
81 changed files with 517 additions and 74 deletions
@@ -13,7 +13,7 @@ import java.util.Scanner;
 // If the distance between the kangaroos (x2 - x1) is divisible by how much closer they get in each step (v2 - v1), then they will land at the same location at the same time. Otherwise, 1 kangaroo will jump over the other and they will never be at the same location at the same time.

 public class Solution {
-    public static void main(String [] args) {
+    public static void main(String[] args) {
        /* Save input */
        Scanner scan = new Scanner(System.in);
        int x1 = scan.nextInt();