mirror of
https://bitbucket.org/Mattrixwv/projecteulerlua.git
synced 2025-12-06 17:43:57 -05:00
Updated problems to be more in line with conventions
This commit is contained in:
@@ -1,11 +1,11 @@
|
||||
--ProjectEuler/lua/Problem10.lua
|
||||
--Matthew Ellison
|
||||
-- Created: 02-06-19
|
||||
--Modified: 03-28-19
|
||||
--Modified: 06-19-20
|
||||
--Find the sum of all the primes below two million
|
||||
--All of my requires, unless otherwise listed, can be found at https://bitbucket.org/Mattrixwv/luaClasses
|
||||
--[[
|
||||
Copyright (C) 2019 Matthew Ellison
|
||||
Copyright (C) 2020 Matthew Ellison
|
||||
|
||||
This program is free software: you can redistribute it and/or modify
|
||||
it under the terms of the GNU Lesser General Public License as published by
|
||||
@@ -26,7 +26,7 @@ require "Stopwatch"
|
||||
require "Algorithms"
|
||||
|
||||
|
||||
timer = Stopwatch:create();
|
||||
local timer = Stopwatch:create();
|
||||
timer:start();
|
||||
|
||||
LARGEST_PRIME = 2000000; --Sum all prime numbers smaller than this
|
||||
|
||||
Reference in New Issue
Block a user