Day 9 submission

Day 7/Marcus/cpp/part1.cpp

@@ -1,23 +1,23 @@
-#include <iostream>
-#include <algorithm>
-#include <math.h>
-
-using namespace std;
-
-int main()
-{
-    vector<int> crabs(1000);
-    
-    for(int i = 0; i < 1000; i++) cin >> crabs[i];
-    
-    sort(crabs.begin(), crabs.end());
-    
-    int final_position = round(((float)crabs[499]+(float)crabs[500])/2.0f);
-    
-    int fuel = 0;
-    for(int i = 0; i < 1000; i++) fuel += (int)abs((float)final_position-crabs[i]);
-    
-    cout << fuel << endl;
-    
-    return 0;
-}
+#include <iostream>
+#include <algorithm>
+#include <math.h>
+
+using namespace std;
+
+int main()
+{
+    vector<int> crabs(1000);
+    
+    for(int i = 0; i < 1000; i++) cin >> crabs[i];
+    
+    sort(crabs.begin(), crabs.end());
+    
+    int final_position = round(((float)crabs[499]+(float)crabs[500])/2.0f);
+    
+    int fuel = 0;
+    for(int i = 0; i < 1000; i++) fuel += (int)abs((float)final_position-crabs[i]);
+    
+    cout << fuel << endl;
+    
+    return 0;
+}

Day 7/Marcus/cpp/part2.cpp

@@ -1,31 +1,31 @@
-#include <iostream>
-#include <algorithm>
-#include <math.h>
-
-using namespace std;
-
-int main()
-{
-    vector<int> crabs(1000);
-    
-    for(int i = 0; i < 1000; i++) cin >> crabs[i];
-    
-    sort(crabs.begin(), crabs.end());
-    
-    vector<int> costs(crabs[999],0);
-    
-    for(int i = 0; i < costs.size(); i++)
-    {
-        for(int j = 0; j < 1000; j++)
-        {
-            int diff = (int)abs((float)i-crabs[j]);
-            costs[i] += (diff*(diff+1))/2;
-        }
-    }
-    
-    sort(costs.begin(), costs.end());
-    
-    cout << costs[0] << endl;
-    
-    return 0;
-}
+#include <iostream>
+#include <algorithm>
+#include <math.h>
+
+using namespace std;
+
+int main()
+{
+    vector<int> crabs(1000);
+    
+    for(int i = 0; i < 1000; i++) cin >> crabs[i];
+    
+    sort(crabs.begin(), crabs.end());
+    
+    vector<int> costs(crabs[999],0);
+    
+    for(int i = 0; i < costs.size(); i++)
+    {
+        for(int j = 0; j < 1000; j++)
+        {
+            int diff = (int)abs((float)i-crabs[j]);
+            costs[i] += (diff*(diff+1))/2;
+        }
+    }
+    
+    sort(costs.begin(), costs.end());
+    
+    cout << costs[0] << endl;
+    
+    return 0;
+}