hello 8

examples/tower.c

@@ -0,0 +1,24 @@
+
+
+#include <stdio.h> 
+  
+// C recursive function to solve tower of hanoi puzzle 
+void towerOfHanoi(int n, char from_rod, char to_rod, char aux_rod) 
+{ 
+    if (n == 1) 
+    { 
+        printf("\n Move disk 1 from rod %c to rod %c", from_rod, to_rod); 
+        return; 
+    } 
+    towerOfHanoi(n-1, from_rod, aux_rod, to_rod); 
+    printf("\n Move disk %d from rod %c to rod %c", n, from_rod, to_rod); 
+    towerOfHanoi(n-1, aux_rod, to_rod, from_rod); 
+} 
+  
+int main() 
+{ 
+    int n = 4; // Number of disks 
+    towerOfHanoi(n, 'A', 'C', 'B');  // A, B and C are names of rods 
+    return 0; 
+} 
+

swarmlab/Makefile

@@ -1,12 +1,17 @@
-all: hello run
+all: hello gcc run
 
 hello: 
 
 	gcc ../examples/helloworld.c -o /root/helloworld
 
+hello: 
+
+	gcc ../examples/tower.c -o /root/tower
+
 run:
 
 	/root/helloworld 2>&1 | tee /tmp/output.log
+	/root/tower 2>&1 | tee /tmp/output.log