Correct problem 9 solution

C/p009.c

@@ -11,10 +11,11 @@
 #include <stdio.h>
 #include <stdlib.h>
 #include <time.h>
+#include "projecteuler.h"
 
 int main(int argc, char **argv)
 {
-   int a, b, c, m, n, found = 0;
+   int a, b, c, tmpa, tmpb, tmpc, i, m, n, found = 0;
    double elapsed;
    struct timespec start, end;
 
@@ -24,16 +25,39 @@ int main(int argc, char **argv)
     * Euclid's formula, until the one where a+b+c=1000 is found.*/
    for(m = 2; found == 0; m++)
    {
-      for(n = 1; n < m; n++)
+      for(n = 1; n < m && !found; n++)
       {
-         a = m * m - n * n;
+         if(gcd(m, n) == 1 && (m % 2 == 0 && n % 2 != 0 || m % 2 != 0 && n % 2 == 0))
-         b = 2 * m * n;
-         c = m * m + n * n;
-
-         if(a + b + c == 1000)
          {
-            found = 1;
+            a = m * m - n * n;
-            break;
+            b = 2 * m * n;
+            c = m * m + n * n;
+
+            if(a + b + c == 1000)
+            {
+               found = 1;
+               break;
+            }
+
+            i = 2;
+
+            do
+            {
+               tmpa = a * i;
+               tmpb = b * i;
+               tmpc = c * i;
+
+               if(tmpa + tmpb + tmpc == 1000)
+               {
+                  a = tmpa;
+                  b = tmpb;
+                  c = tmpc;
+                  found = 1;
+                  break;
+               }
+               
+               i++;
+            }while(tmpa + tmpb + tmpc < 1000);
          }
       }
    }

Python/p009.py

@@ -10,6 +10,8 @@
 #
 # Find the product abc.
 
+from math import gcd
+
 from timeit import default_timer
 
 def main():
@@ -23,14 +25,37 @@ def main():
 #   Euclid's formula, until the one where a+b+c=1000 is found.
     while not found:
         for n in range(1, m):
-            a = m * m - n * n
+            if found == 1:
-            b = 2 * m * n
-            c = m * m + n * n
-
-            if a + b + c == 1000:
-                found = 1
                 break
 
+            if gcd(m, n) == 1 and (m % 2 == 0 and n % 2 != 0 or m % 2 != 0 and n % 2 == 0):
+                a = m * m - n * n
+                b = 2 * m * n
+                c = m * m + n * n
+
+                if a + b + c == 1000:
+                    found = 1
+                    break
+
+                i = 2
+
+                while True:
+                    tmpa = a * i
+                    tmpb = b * i
+                    tmpc = c * i
+
+                    if tmpa + tmpb + tmpc == 1000:
+                        a = tmpa
+                        b = tmpb
+                        c = tmpc
+                        found = 1
+                        break
+
+                    if tmpa + tmpb + tmpc > 1000:
+                        break
+
+                    i = i + 1
+
         m = m + 1
 
     end = default_timer()