Project Euler - Problem 1

#=
# This is a generalized version of Project Euler problem 1
#
# The generalized problem can be described as: Σnᵢ where n∈N mod d∈D == 0. The default values are the ones from the original problem:
#
# Inputs:
# 	N := highest positive integer (natural number) of which we check if Divisors are a multiple; default N := 999
# 	Divisors := Array of integers that should be tested as multiples; default Divisors := [3;5] 
# Output:
# 	Sum of all numbers n∈N, where n mod d∈D == 0
#
=#

function checkIfMultiplesOf(n::UInt64, Divisors::Array{UInt64,1})
	for d in Divisors
		if mod(n,d) == 0
			return n
		end
	end
	return 0
end


function ProjectEuler0001(N::UInt64, Divisors::Array{UInt64,1})
	totalSum = 0;
	for n in 1:1:N
		totalSum += checkIfMultiplesOf(n, Divisors)
	end
	println(totalSum);
end


function checkARGS()
	Divisors = Array{UInt64,1}();
	if isempty(ARGS) == false
		N = tryparse(UInt64,ARGS[1])
		for i in split(ARGS[2], ",")
			push!(Divisors,tryparse(UInt64,i))
		end
	else
		N::UInt64 = 999;
		push!(Divisors,0x3);
		push!(Divisors,0x5);
	end
	return N, Divisors
end


function main()
	N, Divisors = checkARGS()
	ProjectEuler0001(N, Divisors)
end

main()