Merge branch 'project_euler/problem_12' into project_euler/master

project_euler/Problem 12/sol1.c

@@ -0,0 +1,37 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <math.h>
+
+long count_divisors(long long n)
+{
+    long num_divisors = 0;
+    
+    for (long long i = 1; i < sqrtl(n) + 1; i++)
+        if (n % i == 0 && i * i != n)
+            num_divisors += 2;
+
+    return num_divisors;
+}
+
+int main(int argc, char **argv)
+{
+    int MAX_DIVISORS = 500;
+    long i = 1, num_divisors;
+    long long triangle_number = 1;
+
+    if (argc == 2)
+        MAX_DIVISORS = atoi(argv[1]);
+
+    while(1)
+    {
+        i++;
+        triangle_number += i;
+        num_divisors = count_divisors(triangle_number);
+        if (num_divisors > MAX_DIVISORS)
+            break;
+    }
+
+    printf("First Triangle number with more than %d divisors: %lld\n", MAX_DIVISORS, triangle_number);
+
+    return 0;
+}