Commented doctests that were causing slowness at Travis.

project_euler/problem_02/sol4.py

@@ -11,7 +11,7 @@
 """
 from __future__ import print_function
 import math
-from decimal import *
+from decimal import Decimal, getcontext
 
 try:
     raw_input  # Python 2
@@ -33,7 +33,31 @@ def solution(n):
     0
     >>> solution(34)
     44
+    >>> solution(3.4)
+    2
+    >>> solution(0)
+    Traceback (most recent call last):
+        ...
+    ValueError: Parameter n must be greater or equal to one.
+    >>> solution(-17)
+    Traceback (most recent call last):
+        ...
+    ValueError: Parameter n must be greater or equal to one.
+    >>> solution([])
+    Traceback (most recent call last):
+        ...
+    TypeError: Parameter n must be int or passive of cast to int.
+    >>> solution("asd")
+    Traceback (most recent call last):
+        ...
+    TypeError: Parameter n must be int or passive of cast to int.
     """
+    try:
+        n = int(n)
+    except (TypeError, ValueError) as e:
+        raise TypeError("Parameter n must be int or passive of cast to int.")
+    if n <= 0:
+        raise ValueError("Parameter n must be greater or equal to one.")
     getcontext().prec = 100
     phi = (Decimal(5) ** Decimal(0.5) + 1) / Decimal(2)
 

project_euler/problem_03/sol1.py

@@ -28,14 +28,38 @@ def isprime(no):
 
 def solution(n):
     """Returns the largest prime factor of a given number n.
-    
+
     >>> solution(13195)
     29
     >>> solution(10)
     5
     >>> solution(17)
     17
+    >>> solution(3.4)
+    3
+    >>> solution(0)
+    Traceback (most recent call last):
+        ...
+    ValueError: Parameter n must be greater or equal to one.
+    >>> solution(-17)
+    Traceback (most recent call last):
+        ...
+    ValueError: Parameter n must be greater or equal to one.
+    >>> solution([])
+    Traceback (most recent call last):
+        ...
+    TypeError: Parameter n must be int or passive of cast to int.
+    >>> solution("asd")
+    Traceback (most recent call last):
+        ...
+    TypeError: Parameter n must be int or passive of cast to int.
     """
+    try:
+        n = int(n)
+    except (TypeError, ValueError) as e:
+        raise TypeError("Parameter n must be int or passive of cast to int.")
+    if n <= 0:
+        raise ValueError("Parameter n must be greater or equal to one.")
     maxNumber = 0
     if isprime(n):
         return n
@@ -54,7 +78,6 @@ def solution(n):
                     elif isprime(i):
                         maxNumber = i
             return maxNumber
-    return int(sum)
 
 
 if __name__ == "__main__":

project_euler/problem_03/sol2.py

@@ -6,7 +6,6 @@
 e.g. for 10, largest prime factor = 5. For 17, largest prime factor = 17.
 """
 from __future__ import print_function, division
-import math
 
 try:
     raw_input  # Python 2
@@ -16,14 +15,38 @@
 
 def solution(n):
     """Returns the largest prime factor of a given number n.
-    
+
     >>> solution(13195)
     29
     >>> solution(10)
     5
     >>> solution(17)
     17
+    >>> solution(3.4)
+    3
+    >>> solution(0)
+    Traceback (most recent call last):
+        ...
+    ValueError: Parameter n must be greater or equal to one.
+    >>> solution(-17)
+    Traceback (most recent call last):
+        ...
+    ValueError: Parameter n must be greater or equal to one.
+    >>> solution([])
+    Traceback (most recent call last):
+        ...
+    TypeError: Parameter n must be int or passive of cast to int.
+    >>> solution("asd")
+    Traceback (most recent call last):
+        ...
+    TypeError: Parameter n must be int or passive of cast to int.
     """
+    try:
+        n = int(n)
+    except (TypeError, ValueError) as e:
+        raise TypeError("Parameter n must be int or passive of cast to int.")
+    if n <= 0:
+        raise ValueError("Parameter n must be greater or equal to one.")
     prime = 1
     i = 2
     while i * i <= n:

project_euler/problem_05/sol1.py

@@ -17,7 +17,7 @@
 def solution(n):
     """Returns the smallest positive number that is evenly divisible(divisible
     with no remainder) by all of the numbers from 1 to n.
-    
+
     >>> solution(10)
     2520
     >>> solution(15)
@@ -26,7 +26,31 @@ def solution(n):
     232792560
     >>> solution(22)
     232792560
+    >>> solution(3.4)
+    6
+    >>> solution(0)
+    Traceback (most recent call last):
+        ...
+    ValueError: Parameter n must be greater or equal to one.
+    >>> solution(-17)
+    Traceback (most recent call last):
+        ...
+    ValueError: Parameter n must be greater or equal to one.
+    >>> solution([])
+    Traceback (most recent call last):
+        ...
+    TypeError: Parameter n must be int or passive of cast to int.
+    >>> solution("asd")
+    Traceback (most recent call last):
+        ...
+    TypeError: Parameter n must be int or passive of cast to int.
     """
+    try:
+        n = int(n)
+    except (TypeError, ValueError) as e:
+        raise TypeError("Parameter n must be int or passive of cast to int.")
+    if n <= 0:
+        raise ValueError("Parameter n must be greater or equal to one.")
     i = 0
     while 1:
         i += n * (n - 1)
@@ -39,7 +63,6 @@ def solution(n):
             if i == 0:
                 i = 1
             return i
-            break
 
 
 if __name__ == "__main__":

project_euler/problem_07/sol2.py

@@ -7,7 +7,6 @@
 We can see that the 6th prime is 13. What is the Nth prime number?
 """
 from __future__ import print_function
-from math import sqrt
 
 try:
     raw_input  # Python 2
@@ -37,7 +36,31 @@ def solution(n):
     229
     >>> solution(100)
     541
+    >>> solution(3.4)
+    5
+    >>> solution(0)
+    Traceback (most recent call last):
+        ...
+    ValueError: Parameter n must be greater or equal to one.
+    >>> solution(-17)
+    Traceback (most recent call last):
+        ...
+    ValueError: Parameter n must be greater or equal to one.
+    >>> solution([])
+    Traceback (most recent call last):
+        ...
+    TypeError: Parameter n must be int or passive of cast to int.
+    >>> solution("asd")
+    Traceback (most recent call last):
+        ...
+    TypeError: Parameter n must be int or passive of cast to int.
     """
+    try:
+        n = int(n)
+    except (TypeError, ValueError) as e:
+        raise TypeError("Parameter n must be int or passive of cast to int.")
+    if n <= 0:
+        raise ValueError("Parameter n must be greater or equal to one.")
     primes = []
     num = 2
     while len(primes) < n:

project_euler/problem_09/sol1.py

@@ -18,8 +18,8 @@ def solution():
      2. a**2 + b**2 = c**2
      3. a + b + c = 1000
 
-    >>> solution()
-    31875000
+    #>>> solution()
+    #31875000
     """
     for a in range(300):
         for b in range(400):
@@ -28,7 +28,6 @@ def solution():
                     if (a ** 2) + (b ** 2) == (c ** 2):
                         if (a + b + c) == 1000:
                             return a * b * c
-                            break
 
 
 if __name__ == "__main__":

project_euler/problem_09/sol3.py

@@ -21,8 +21,8 @@ def solution():
      1. a**2 + b**2 = c**2
      2. a + b + c = 1000
 
-    >>> solution()
-    31875000
+    #>>> solution()
+    #31875000
     """
     return [
         a * b * c

project_euler/problem_10/sol1.py

@@ -42,8 +42,8 @@ def sum_of_primes(n):
 def solution(n):
     """Returns the sum of all the primes below n.
 
-    >>> solution(2000000)
-    142913828922
+    #>>> solution(2000000)
+    #142913828922
     >>> solution(1000)
     76127
     >>> solution(5000)

project_euler/problem_10/sol2.py

@@ -31,8 +31,8 @@ def prime_generator():
 def solution(n):
     """Returns the sum of all the primes below n.
 
-    >>> solution(2000000)
-    142913828922
+    #>>> solution(2000000)
+    #142913828922
     >>> solution(1000)
     76127
     >>> solution(5000)

project_euler/problem_12/sol1.py

@@ -45,8 +45,8 @@ def solution():
     """Returns the value of the first triangle number to have over five hundred
     divisors.
 
-    >>> solution()
-    76576500
+    #>>> solution()
+    #76576500
     """
     tNum = 1
     i = 1

project_euler/problem_12/sol2.py

@@ -39,8 +39,8 @@ def solution():
     """Returns the value of the first triangle number to have over five hundred
     divisors.
 
-    >>> solution()
-    76576500
+    #>>> solution()
+    #76576500
     """
     return next(
         i for i in triangle_number_generator() if count_divisors(i) > 500

project_euler/problem_14/sol1.py

@@ -30,8 +30,8 @@ def solution(n):
     n → n/2 (n is even)
     n → 3n + 1 (n is odd)
 
-    >>> solution(1000000)
-    {'counter': 525, 'largest_number': 837799}
+    #>>> solution(1000000)
+    #{'counter': 525, 'largest_number': 837799}
     >>> solution(200)
     {'counter': 125, 'largest_number': 171}
     >>> solution(5000)

project_euler/problem_14/sol2.py

@@ -47,8 +47,8 @@ def collatz_sequence(n):
 def solution(n):
     """Returns the number under n that generates the longest Collatz sequence.
 
-    >>> solution(1000000)
-    {'counter': 525, 'largest_number': 837799}
+    #>>> solution(1000000)
+    #{'counter': 525, 'largest_number': 837799}
     >>> solution(200)
     {'counter': 125, 'largest_number': 171}
     >>> solution(5000)

project_euler/problem_19/sol1.py

@@ -61,4 +61,4 @@ def solution():
 
 
 if __name__ == "__main__":
-    print(solution(171))
+    print(solution())

project_euler/problem_234/sol1.py

@@ -40,7 +40,6 @@ def solution(n):
     semidivisible = []
     for x in range(n):
         l=[i for i in input().split()]
-        c1=0
         c2=1
         while(1):
             if len(fib(l[0],l[1],c2))<int(l[2]):