@@ -0,0 +1,710 @@
+#!/usr/local/bin/python%0A# Code Fights Prime Sum Problem%0A%0A%0Adef primeSum(a, b):%0A    return sum(filter(lambda p: p %3E 1 and all(p %25 n for n in%0A               range(2, int(p**0.5) + 1)), range(a, b + 1)))%0A%0A%0Adef main():%0A    tests = %5B%0A        %5B10, 20, 60%5D,%0A        %5B1, 7, 17%5D,%0A        %5B5, 10, 12%5D,%0A        %5B24, 28, 0%5D,%0A        %5B13, 13, 13%5D%0A    %5D%0A%0A    for t in tests:%0A        res = primeSum(t%5B0%5D, t%5B1%5D)%0A        ans = t%5B2%5D%0A        if ans == res:%0A            print(%22PASSED: primeSum(%7B%7D, %7B%7D) returned %7B%7D%22%0A                  .format(t%5B0%5D, t%5B1%5D, res))%0A        else:%0A            print(%22FAILED: primeSum(%7B%7D, %7B%7D) returned %7B%7D, answer: %7B%7D%22%0A                  .format(t%5B0%5D, t%5B1%5D, res, ans))%0A%0A%0Aif __name__ == '__main__':%0A    main()%0A

Solve Code Fights prime sum problem