Solves Problem 8

Prepares Problem 9

Creates a bash script which will do templates for me

e_8.py

@@ -28,32 +28,28 @@ Find the greatest product of five consecutive digits in the 1000-digit number.
 71636269561882670428252483600823257530420752963450
 #---
 """ 
+from operator import mul
+
 def greatest_product(data):
     """
     Returns the greatest product of five consecutive digits in the input data.
     """
     cons_list = []
+    great_prod = 0
     # print list of 5 consecutive digits
     for j in range(len(data) - 4):
-        suite = data[j:j+5]
-        if is_consecutive(suite):
-            cons_list.append(suite)
+        prod = suite_to_product(data[j:j+5])
+        if prod > great_prod :
+            great_prod = prod
+    return great_prod
 
-    return 1
-
-def is_consecutive(suite):
+def suite_to_product(suite):
     """
-    Returns true if values in suite are consecutive and False otherwise
+    Returns product of all elements of a string
     """
-    cons = True
-    for k in range(len(suite) - 1):
-        if ((int(suite[k]) + 1) != int(suite[k + 1])):
-            cons = False
-    return cons
+    return reduce(mul, [int(el) for el in list(suite)])
 
 if __name__ == '__main__':
     # really bad way to present it
     data = "7316717653133062491922511967442657474235534919493496983520312774506326239578318016984801869478851843858615607891129494954595017379583319528532088055111254069874715852386305071569329096329522744304355766896648950445244523161731856403098711121722383113622298934233803081353362766142828064444866452387493035890729629049156044077239071381051585930796086670172427121883998797908792274921901699720888093776657273330010533678812202354218097512545405947522435258490771167055601360483958644670632441572215539753697817977846174064955149290862569321978468622482839722413756570560574902614079729686524145351004748216637048440319989000889524345065854122758866688116427171479924442928230863465674813919123162824586178664583591245665294765456828489128831426076900422421902267105562632111110937054421750694165896040807198403850962455444362981230987879927244284909188845801561660979191338754992005240636899125607176060588611646710940507754100225698315520005593572972571636269561882670428252483600823257530420752963450"
-
-    #print data
     print "Answer : %d " % (greatest_product(data))

e_9.py

@@ -0,0 +1,24 @@
+#!/usr/bin/env python 
+"""
+ ##---
+ # jlengrand
+ #Created on : Fri Jan 13 10:49:29 CET 2012
+ #
+ # DESCRIPTION : Solves problem 9 of Project Euler
+ A Pythagorean triplet is a set of three natural numbers, a  b  c, for which,
+
+ a^2 + b^2 = c^2
+ For example, 3^2 + 4^2 = 9 + 16 = 25 = 5^2.
+
+ There exists exactly one Pythagorean triplet for which a + b + c = 1000.
+ Find the product abc.
+ ##---
+"""
+def fun():
+    """
+    """
+
+    return 1
+
+if __name__ == '__main__':
+    print "Answer : %d" % (fun())

euler_template

@@ -0,0 +1,41 @@
+#!/bin/bash
+
+# Brrr this is ugly. You 'd better change it quickly
+
+TYPE=$1
+FILE="e_$1.py"
+
+if [ $# -gt 1 -o $# -lt 1 ];
+	then
+		echo "Main usage is : euler_template number_of_problem"
+		exit 0;
+fi
+
+#generating shellbang
+#echo -e "#!"$(which $TYPE)"\n" >> $FILE 
+echo "#!/usr/bin/env python " >>$FILE
+
+#generating header
+echo -e '"""' >> $FILE
+echo -e " ##---" >> $FILE
+echo -e " # "$(whoami) >> $FILE
+echo -e " #Created on : "$(date)"\n #" >> $FILE
+echo -e " # DESCRIPTION : Solves problem $1 of Project Euler" >> $FILE
+echo -e ' ' >> $FILE
+echo -e " ##---" >> $FILE
+echo -e '"""' >> $FILE
+
+# function prototype
+echo -e 'def fun():' >> $FILE
+echo -e '    """' >> $FILE
+echo -e '    """' >> $FILE
+echo -e '    ' >> $FILE
+echo -e '    return 1' >> $FILE
+
+echo -e '' >> $FILE
+# main
+echo -e "if __name__ == '__main__':" >> $FILE
+echo -e '    print "Answer : %d" % (fun())' >> $FILE
+
+
+chmod +x $FILE