Mountain Scenes

Author: William Fiset

slides/dynamicprogramming/tiling_dominoes.key

@@ -20,6 +20,11 @@ public static void main(String[] args) throws IOException {
     W = Integer.parseInt(ln[1]);
     H = Integer.parseInt(ln[2]);
 
+    solution1();
+  }
+
+  // Recursive solution implementation
+  static void solution1() {
     // Count the number of plain mountains. Be sure to account for having more
     // ribbon than can possible be placed.
     int plains = (Math.min(W * H, N) / W) + 1;

src/main/java/com/williamfiset/algorithms/dp/examples/scenes/Scenes.java

@@ -0,0 +1 @@
+10000 100 100