Add more solutions in python

Added python solutions for problem 56, 57, 58, 59 and 60

C/p059.c

@@ -122,6 +122,7 @@ int main(int argc, char **argv)
                }
 
                found = 1;
+               printf("%c%c%c\n", c1, c2, c3);
             }
          }
       }

C/p060.c

@@ -29,7 +29,7 @@ int main(int argc, char **argv)
    /* Straightforward brute force approach.*/
    for(p1 = 3; p1 < N && !found; p1 += 2)
    {
-      /* If p1 is not prime, go to next number.*/
+      /* If p1 is not prime, go to the next number.*/
       if(!primes[p1])
       {
          continue;