Search results for "distribution:Project-Euler LESPEA"
Project::Euler - Solutions for < http://projecteuler.net >
This is the base class which will eventually be responsible for displaying the interface to interact with the solutions implemented so far. For now, you will have to manually import the problem_solutions and solve them manually....
LESPEA/Project-Euler-0.20 - 26 Aug 2010 05:35:25 UTC
Project::Euler::Lib::Types - Type definitions for < Project::Euler >
(Most) all of the types that our modules use are defined here so that they can be reused and tested. This also helps prevent all of the namespace pollution from the global declarations....
LESPEA/Project-Euler-0.20 - 26 Aug 2010 05:35:25 UTC
Project::Euler::Lib::Utils - Collection of helper utilities for project euler problems
LESPEA/Project-Euler-0.20
-
26 Aug 2010 05:35:25 UTC
Project::Euler::Problem::P005 - Solutions for problem 005 - Least common multiple
This module is used to solve problem #005 Use Math::BigInt to calculate the least common multiple between numbers...
LESPEA/Project-Euler-0.20 - 26 Aug 2010 05:35:25 UTC
Project::Euler::Problem::P003 - Solutions for problem 003 - Max prime factor
This module is used to solve problem #003 Here we find the maximum prime factor of a given number. Math::Big::Factor is used to generate a prime wheel that finds all of the prime factors. From there it's a simple matter of taking the last one in the ...
LESPEA/Project-Euler-0.20 - 26 Aug 2010 05:35:25 UTC
Project::Euler::Problem::P002 - Solutions for problem 002 - Sum filtered fib numbers
This module is used to solve problem #002 This is a simple problem which computes the fib numbers up to a certain maximum and sums all of them that are even (or as implemented here, divisible by every integer in multi_nums)...
LESPEA/Project-Euler-0.20 - 26 Aug 2010 05:35:25 UTC
Project::Euler::Problem::P004 - Solutions for problem 004 - Largest palindrome from prods
This module is used to solve problem #004 Given the length of ints to iterate through, we will find the largest product that produces a palindrome....
LESPEA/Project-Euler-0.20 - 26 Aug 2010 05:35:25 UTC
Project::Euler::Problem::P001 - Solutions for problem 001 - Sum filtered range
This module is used to solve problem #001 This problem simply needs to find the sum of all the numbers within a range which are multiples of a set of integers. The range always starts at 1 and continues up to the provided input *(1000 by default)*. T...
LESPEA/Project-Euler-0.20 - 26 Aug 2010 05:35:25 UTC
Project::Euler::Problem::Base - Abstract class that the problems will extend from
To ensure that each problem class performs a minimum set of functions, this class will define the basic subroutines and variables that every object must implement....
LESPEA/Project-Euler-0.20 - 26 Aug 2010 05:35:25 UTC