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/Problem3.lua
|
||||
--Matthew Ellison
|
||||
-- Created: 02-04-19
|
||||
--Modified: 03-28-19
|
||||
--Modified: 06-19-20
|
||||
--The largest prime factor of 600851475143
|
||||
--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,13 +26,13 @@ require "Stopwatch"
|
||||
require "Algorithms"
|
||||
|
||||
|
||||
timer = Stopwatch:create();
|
||||
local timer = Stopwatch:create();
|
||||
timer:start();
|
||||
|
||||
|
||||
TARGET_NUMBER = 600851475143;
|
||||
--Get the factors of the number
|
||||
factors = getFactors(TARGET_NUMBER);
|
||||
local factors = getFactors(TARGET_NUMBER);
|
||||
timer:stop();
|
||||
|
||||
--The largest number will be the answer
|
||||
|
||||
Reference in New Issue
Block a user