Add .clang-format and apply it

2015/puzzle-20-02.cc

@@ -1,42 +1,45 @@
-#include <string>
-#include <iostream>
 #include <cstdlib>
+#include <iostream>
+#include <string>
 
-int main() {
-    std::string line;
-    std::getline(std::cin, line);
+int main()
+{
+  std::string line;
+  std::getline(std::cin, line);
 
-    auto target{std::stoul(line)};
+  auto target{std::stoul(line)};
 
-    /* This is a really stupid way to do this in terms of effort, but it produces the right answer and doesn't involve
-     * thinking too much:
+  /* This is a really stupid way to do this in terms of effort, but it produces the right answer and
+   * doesn't involve thinking too much:
+   *
+   * n is the current house we're at.
+   */
+  for (auto n{2UL}; true; ++n) {
+    auto amt{0UL};
+    /* Find the number of presents delivered to house `n`.  We do this by walking through all
+     * numbers <= sqrt(n) and seeing if they are a factor.  If so we add presents for that number
+     * (i) and also (n/i), being careful not to double count for square roots.  This reduces the
+     * amount of work we have to do significantly.
      *
-     * n is the current house we're at.
+     * For the second part we also check to ensure we've not at the 51st delivery or greater for
+     * this elf.
      */
-    for (auto n{2UL}; true; ++n) {
-        auto amt{0UL};
-        /* Find the number of presents delivered to house `n`.  We do this by walking through all numbers <= sqrt(n) and
-         * seeing if they are a factor.  If so we add presents for that number (i) and also (n/i), being careful not to
-         * double count for square roots.  This reduces the amount of work we have to do significantly.
-         *
-         * For the second part we also check to ensure we've not at the 51st delivery or greater for this elf.
-         */
-        for (auto i{1UL}; i <= (n / i); ++i) {
-            if (n % i == 0) {
-                auto i2{n / i};
-                if (i2 <= 50) {
-                    amt += i * 11;
-                }
-                if (i <= 50 && i != i2) {
-                    amt += i2 * 11;
-                }
-            }
+    for (auto i{1UL}; i <= (n / i); ++i) {
+      if (n % i == 0) {
+        auto i2{n / i};
+        if (i2 <= 50) {
+          amt += i * 11;
         }
-        if (amt >= target) {
-            std::cout << "Target: " << target << " met at: " << n << " with amount: " << amt << '\n';
-            return EXIT_SUCCESS;
+        if (i <= 50 && i != i2) {
+          amt += i2 * 11;
         }
+      }
     }
+    if (amt >= target) {
+      std::cout << "Target: " << target << " met at: " << n << " with amount: " << amt << '\n';
+      return EXIT_SUCCESS;
+    }
+  }
 
-    return EXIT_FAILURE;
+  return EXIT_FAILURE;
 }