mirror of
https://bitbucket.org/Mattrixwv/projecteulerc.git
synced 2025-12-06 17:13:58 -05:00
First commit with 3 problems
This commit is contained in:
2
.gitignore
vendored
Normal file
2
.gitignore
vendored
Normal file
@@ -0,0 +1,2 @@
|
|||||||
|
#Visual Studio Code
|
||||||
|
.vscode
|
||||||
165
LICENSE
Normal file
165
LICENSE
Normal file
@@ -0,0 +1,165 @@
|
|||||||
|
GNU LESSER GENERAL PUBLIC LICENSE
|
||||||
|
Version 3, 29 June 2007
|
||||||
|
|
||||||
|
Copyright (C) 2007 Free Software Foundation, Inc. <https://fsf.org/>
|
||||||
|
Everyone is permitted to copy and distribute verbatim copies
|
||||||
|
of this license document, but changing it is not allowed.
|
||||||
|
|
||||||
|
|
||||||
|
This version of the GNU Lesser General Public License incorporates
|
||||||
|
the terms and conditions of version 3 of the GNU General Public
|
||||||
|
License, supplemented by the additional permissions listed below.
|
||||||
|
|
||||||
|
0. Additional Definitions.
|
||||||
|
|
||||||
|
As used herein, "this License" refers to version 3 of the GNU Lesser
|
||||||
|
General Public License, and the "GNU GPL" refers to version 3 of the GNU
|
||||||
|
General Public License.
|
||||||
|
|
||||||
|
"The Library" refers to a covered work governed by this License,
|
||||||
|
other than an Application or a Combined Work as defined below.
|
||||||
|
|
||||||
|
An "Application" is any work that makes use of an interface provided
|
||||||
|
by the Library, but which is not otherwise based on the Library.
|
||||||
|
Defining a subclass of a class defined by the Library is deemed a mode
|
||||||
|
of using an interface provided by the Library.
|
||||||
|
|
||||||
|
A "Combined Work" is a work produced by combining or linking an
|
||||||
|
Application with the Library. The particular version of the Library
|
||||||
|
with which the Combined Work was made is also called the "Linked
|
||||||
|
Version".
|
||||||
|
|
||||||
|
The "Minimal Corresponding Source" for a Combined Work means the
|
||||||
|
Corresponding Source for the Combined Work, excluding any source code
|
||||||
|
for portions of the Combined Work that, considered in isolation, are
|
||||||
|
based on the Application, and not on the Linked Version.
|
||||||
|
|
||||||
|
The "Corresponding Application Code" for a Combined Work means the
|
||||||
|
object code and/or source code for the Application, including any data
|
||||||
|
and utility programs needed for reproducing the Combined Work from the
|
||||||
|
Application, but excluding the System Libraries of the Combined Work.
|
||||||
|
|
||||||
|
1. Exception to Section 3 of the GNU GPL.
|
||||||
|
|
||||||
|
You may convey a covered work under sections 3 and 4 of this License
|
||||||
|
without being bound by section 3 of the GNU GPL.
|
||||||
|
|
||||||
|
2. Conveying Modified Versions.
|
||||||
|
|
||||||
|
If you modify a copy of the Library, and, in your modifications, a
|
||||||
|
facility refers to a function or data to be supplied by an Application
|
||||||
|
that uses the facility (other than as an argument passed when the
|
||||||
|
facility is invoked), then you may convey a copy of the modified
|
||||||
|
version:
|
||||||
|
|
||||||
|
a) under this License, provided that you make a good faith effort to
|
||||||
|
ensure that, in the event an Application does not supply the
|
||||||
|
function or data, the facility still operates, and performs
|
||||||
|
whatever part of its purpose remains meaningful, or
|
||||||
|
|
||||||
|
b) under the GNU GPL, with none of the additional permissions of
|
||||||
|
this License applicable to that copy.
|
||||||
|
|
||||||
|
3. Object Code Incorporating Material from Library Header Files.
|
||||||
|
|
||||||
|
The object code form of an Application may incorporate material from
|
||||||
|
a header file that is part of the Library. You may convey such object
|
||||||
|
code under terms of your choice, provided that, if the incorporated
|
||||||
|
material is not limited to numerical parameters, data structure
|
||||||
|
layouts and accessors, or small macros, inline functions and templates
|
||||||
|
(ten or fewer lines in length), you do both of the following:
|
||||||
|
|
||||||
|
a) Give prominent notice with each copy of the object code that the
|
||||||
|
Library is used in it and that the Library and its use are
|
||||||
|
covered by this License.
|
||||||
|
|
||||||
|
b) Accompany the object code with a copy of the GNU GPL and this license
|
||||||
|
document.
|
||||||
|
|
||||||
|
4. Combined Works.
|
||||||
|
|
||||||
|
You may convey a Combined Work under terms of your choice that,
|
||||||
|
taken together, effectively do not restrict modification of the
|
||||||
|
portions of the Library contained in the Combined Work and reverse
|
||||||
|
engineering for debugging such modifications, if you also do each of
|
||||||
|
the following:
|
||||||
|
|
||||||
|
a) Give prominent notice with each copy of the Combined Work that
|
||||||
|
the Library is used in it and that the Library and its use are
|
||||||
|
covered by this License.
|
||||||
|
|
||||||
|
b) Accompany the Combined Work with a copy of the GNU GPL and this license
|
||||||
|
document.
|
||||||
|
|
||||||
|
c) For a Combined Work that displays copyright notices during
|
||||||
|
execution, include the copyright notice for the Library among
|
||||||
|
these notices, as well as a reference directing the user to the
|
||||||
|
copies of the GNU GPL and this license document.
|
||||||
|
|
||||||
|
d) Do one of the following:
|
||||||
|
|
||||||
|
0) Convey the Minimal Corresponding Source under the terms of this
|
||||||
|
License, and the Corresponding Application Code in a form
|
||||||
|
suitable for, and under terms that permit, the user to
|
||||||
|
recombine or relink the Application with a modified version of
|
||||||
|
the Linked Version to produce a modified Combined Work, in the
|
||||||
|
manner specified by section 6 of the GNU GPL for conveying
|
||||||
|
Corresponding Source.
|
||||||
|
|
||||||
|
1) Use a suitable shared library mechanism for linking with the
|
||||||
|
Library. A suitable mechanism is one that (a) uses at run time
|
||||||
|
a copy of the Library already present on the user's computer
|
||||||
|
system, and (b) will operate properly with a modified version
|
||||||
|
of the Library that is interface-compatible with the Linked
|
||||||
|
Version.
|
||||||
|
|
||||||
|
e) Provide Installation Information, but only if you would otherwise
|
||||||
|
be required to provide such information under section 6 of the
|
||||||
|
GNU GPL, and only to the extent that such information is
|
||||||
|
necessary to install and execute a modified version of the
|
||||||
|
Combined Work produced by recombining or relinking the
|
||||||
|
Application with a modified version of the Linked Version. (If
|
||||||
|
you use option 4d0, the Installation Information must accompany
|
||||||
|
the Minimal Corresponding Source and Corresponding Application
|
||||||
|
Code. If you use option 4d1, you must provide the Installation
|
||||||
|
Information in the manner specified by section 6 of the GNU GPL
|
||||||
|
for conveying Corresponding Source.)
|
||||||
|
|
||||||
|
5. Combined Libraries.
|
||||||
|
|
||||||
|
You may place library facilities that are a work based on the
|
||||||
|
Library side by side in a single library together with other library
|
||||||
|
facilities that are not Applications and are not covered by this
|
||||||
|
License, and convey such a combined library under terms of your
|
||||||
|
choice, if you do both of the following:
|
||||||
|
|
||||||
|
a) Accompany the combined library with a copy of the same work based
|
||||||
|
on the Library, uncombined with any other library facilities,
|
||||||
|
conveyed under the terms of this License.
|
||||||
|
|
||||||
|
b) Give prominent notice with the combined library that part of it
|
||||||
|
is a work based on the Library, and explaining where to find the
|
||||||
|
accompanying uncombined form of the same work.
|
||||||
|
|
||||||
|
6. Revised Versions of the GNU Lesser General Public License.
|
||||||
|
|
||||||
|
The Free Software Foundation may publish revised and/or new versions
|
||||||
|
of the GNU Lesser General Public License from time to time. Such new
|
||||||
|
versions will be similar in spirit to the present version, but may
|
||||||
|
differ in detail to address new problems or concerns.
|
||||||
|
|
||||||
|
Each version is given a distinguishing version number. If the
|
||||||
|
Library as you received it specifies that a certain numbered version
|
||||||
|
of the GNU Lesser General Public License "or any later version"
|
||||||
|
applies to it, you have the option of following the terms and
|
||||||
|
conditions either of that published version or of any later version
|
||||||
|
published by the Free Software Foundation. If the Library as you
|
||||||
|
received it does not specify a version number of the GNU Lesser
|
||||||
|
General Public License, you may choose any version of the GNU Lesser
|
||||||
|
General Public License ever published by the Free Software Foundation.
|
||||||
|
|
||||||
|
If the Library as you received it specifies that a proxy can decide
|
||||||
|
whether future versions of the GNU Lesser General Public License shall
|
||||||
|
apply, that proxy's public statement of acceptance of any version is
|
||||||
|
permanent authorization for you to choose that version for the
|
||||||
|
Library.
|
||||||
71
Problem1.c
Normal file
71
Problem1.c
Normal file
@@ -0,0 +1,71 @@
|
|||||||
|
//ProjectEuler/C/Problem1.c
|
||||||
|
//Matthew Ellison
|
||||||
|
// Created: 03-08-19
|
||||||
|
//Modified: 03-28-19
|
||||||
|
//What is the sum of all the multiples of 3 or 5 that are less than 1000
|
||||||
|
//Unless otherwise listed all non-standard includes are my own creation and available from https://bibucket.org/Mattrixwv/myHelpers
|
||||||
|
/*
|
||||||
|
Copyright (C) 2019 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
|
||||||
|
the Free Software Foundation, either version 3 of the License, or
|
||||||
|
(at your option) any later version.
|
||||||
|
|
||||||
|
This program is distributed in the hope that it will be useful,
|
||||||
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||||
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||||
|
GNU Lesser General Public License for more details.
|
||||||
|
|
||||||
|
You should have received a copy of the GNU Lesser General Public License
|
||||||
|
along with this program. If not, see <https://www.gnu.org/licenses/>.
|
||||||
|
*/
|
||||||
|
|
||||||
|
|
||||||
|
#include <stdio.h>
|
||||||
|
#include <inttypes.h>
|
||||||
|
#include "Stopwatch.h"
|
||||||
|
|
||||||
|
const int MAX_NUMBER = 1000;
|
||||||
|
|
||||||
|
|
||||||
|
int main(){
|
||||||
|
//Setup the stopwatch
|
||||||
|
struct Stopwatch timer;
|
||||||
|
initStopwatch(&timer);
|
||||||
|
//Setup the variables you will need
|
||||||
|
|
||||||
|
uint64_t fullSum = 0; //For the sum of all the numbers
|
||||||
|
|
||||||
|
//Start the timer
|
||||||
|
startStopwatch(&timer);
|
||||||
|
|
||||||
|
//Step through ever number < 1000 and see if either 3 or 5 divides it evenly
|
||||||
|
for(uint64_t cnt = 1;cnt < MAX_NUMBER;++cnt){
|
||||||
|
if((cnt % 3) == 0){
|
||||||
|
fullSum += cnt;
|
||||||
|
}
|
||||||
|
else if((cnt % 5) == 0){
|
||||||
|
fullSum += cnt;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
//Stop the timer
|
||||||
|
stopStopwatch(&timer);
|
||||||
|
char* timerStr = getStrStopwatch(&timer);
|
||||||
|
|
||||||
|
//Print the results
|
||||||
|
printf("The sum of all the numbers < %d that are divisible by 3 or 5 is %lu\n", MAX_NUMBER, fullSum);
|
||||||
|
printf("It took %s to run this algorithm\n", timerStr);
|
||||||
|
|
||||||
|
//Free the memory taken up by the string
|
||||||
|
free(timerStr);
|
||||||
|
timerStr = NULL;
|
||||||
|
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
/* Results:
|
||||||
|
The sum of all the numbers < 1000 that are divisible by 3 or 5 is 233168
|
||||||
|
It took 3.000 microseconds to run this algorithm
|
||||||
|
*/
|
||||||
79
Problem2.c
Normal file
79
Problem2.c
Normal file
@@ -0,0 +1,79 @@
|
|||||||
|
//ProjectEuler/C/Problem2.c
|
||||||
|
//Matthew Ellison
|
||||||
|
// Created: 03-11-19
|
||||||
|
//Modified: 03-28-19
|
||||||
|
//The sum of the even Fibonacci numbers less than 4,000,000
|
||||||
|
//Unless otherwise listed all non-standard includes are my own creation and available from https://bibucket.org/Mattrixwv/myHelpers
|
||||||
|
//This program needs the -lm flag to compile
|
||||||
|
/*
|
||||||
|
Copyright (C) 2019 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
|
||||||
|
the Free Software Foundation, either version 3 of the License, or
|
||||||
|
(at your option) any later version.
|
||||||
|
|
||||||
|
This program is distributed in the hope that it will be useful,
|
||||||
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||||
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||||
|
GNU Lesser General Public License for more details.
|
||||||
|
|
||||||
|
You should have received a copy of the GNU Lesser General Public License
|
||||||
|
along with this program. If not, see <https://www.gnu.org/licenses/>.
|
||||||
|
*/
|
||||||
|
|
||||||
|
|
||||||
|
#include <stdio.h>
|
||||||
|
#include <inttypes.h>
|
||||||
|
#include "Stopwatch.h"
|
||||||
|
#include "Algorithms.h"
|
||||||
|
#include "DynamicInt64Array.h"
|
||||||
|
|
||||||
|
const uint64_t TOP_NUM = 4000000; //Holds the largest number that we are looking for
|
||||||
|
|
||||||
|
|
||||||
|
int main(){
|
||||||
|
//Create a timer for the algorithm
|
||||||
|
struct Stopwatch timer;
|
||||||
|
initStopwatch(&timer);
|
||||||
|
|
||||||
|
uint64_t fullSum = 0; //Holds the sum of all the numbers
|
||||||
|
|
||||||
|
//Start the timer
|
||||||
|
startStopwatch(&timer);
|
||||||
|
|
||||||
|
//Get all of the fibonacci numbers < TOP_NUM
|
||||||
|
struct DynamicInt64Array fibList = getAllFib(TOP_NUM - 1);
|
||||||
|
|
||||||
|
//Step through the sum of all the elements to find the even numbers and add them to the running sum
|
||||||
|
for(uint64_t cnt = 0;cnt < fibList.size;++cnt){
|
||||||
|
//Get the current number
|
||||||
|
int64_t num = getDynamicInt64Array(&fibList, cnt);
|
||||||
|
|
||||||
|
//If the number is even add it to the sum
|
||||||
|
if((num % 2) == 0){
|
||||||
|
fullSum += num;
|
||||||
|
}
|
||||||
|
//Otherwise ignore it
|
||||||
|
}
|
||||||
|
|
||||||
|
//Stop the timer
|
||||||
|
stopStopwatch(&timer);
|
||||||
|
char* timerStr = getStrStopwatch(&timer);
|
||||||
|
|
||||||
|
//Print the results
|
||||||
|
printf("The sum of the even Fibonacci numbers less than %ld is %ld\n", TOP_NUM, fullSum);
|
||||||
|
printf("It took %s to run this algorithm\n", timerStr);
|
||||||
|
|
||||||
|
//Free the memory taken by the program
|
||||||
|
destroyDynamicInt64Array(&fibList);
|
||||||
|
free(timerStr);
|
||||||
|
timerStr = NULL;
|
||||||
|
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
/* Results:
|
||||||
|
The sum of the even Fibonacci numbers less than 4000000 is 4613732
|
||||||
|
It took 52.000 microseconds to run this algorithm
|
||||||
|
*/
|
||||||
64
Problem3.c
Normal file
64
Problem3.c
Normal file
@@ -0,0 +1,64 @@
|
|||||||
|
//ProjectEuler/C/Problem3.c
|
||||||
|
//Matthew Ellison
|
||||||
|
// Created: 03-11-19
|
||||||
|
//Modified: 03-28-19
|
||||||
|
//The largest prime factor of 600851475143
|
||||||
|
//Unless otherwise listed all non-standard includes are my own creation and available from https://bibucket.org/Mattrixwv/myHelpers
|
||||||
|
//This program need the -lm flag to compile
|
||||||
|
/*
|
||||||
|
Copyright (C) 2019 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
|
||||||
|
the Free Software Foundation, either version 3 of the License, or
|
||||||
|
(at your option) any later version.
|
||||||
|
|
||||||
|
This program is distributed in the hope that it will be useful,
|
||||||
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||||
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||||||
|
GNU Lesser General Public License for more details.
|
||||||
|
|
||||||
|
You should have received a copy of the GNU Lesser General Public License
|
||||||
|
along with this program. If not, see <https://www.gnu.org/licenses/>.
|
||||||
|
*/
|
||||||
|
|
||||||
|
|
||||||
|
#include <stdio.h>
|
||||||
|
#include <inttypes.h>
|
||||||
|
#include "Stopwatch.h"
|
||||||
|
#include "DynamicInt64Array.h"
|
||||||
|
#include "Algorithms.h"
|
||||||
|
|
||||||
|
const int64_t GOAL_NUMBER = 600851475143; //The number you are trying to find the factors of
|
||||||
|
|
||||||
|
|
||||||
|
int main(){
|
||||||
|
//Setup your variables
|
||||||
|
struct Stopwatch timer; //Used to determine your algorithm's run time
|
||||||
|
initStopwatch(&timer);
|
||||||
|
|
||||||
|
//Start the timer
|
||||||
|
startStopwatch(&timer);
|
||||||
|
|
||||||
|
//Find the factors of GOAL_NUMBER
|
||||||
|
struct DynamicInt64Array factors = getFactors(GOAL_NUMBER); //Holds the factors of goalNumber
|
||||||
|
//Stop the timer
|
||||||
|
stopStopwatch(&timer);
|
||||||
|
char* timerStr = getStrStopwatch(&timer);
|
||||||
|
|
||||||
|
//Print the results
|
||||||
|
printf("The largest factor of the number %lu is %lu\n", GOAL_NUMBER, getDynamicInt64Array(&factors, factors.size - 1));
|
||||||
|
printf("It took %s to run this algorithm\n", timerStr);
|
||||||
|
|
||||||
|
//Free the memory used by the string
|
||||||
|
destroyDynamicInt64Array(&factors);
|
||||||
|
free(timerStr);
|
||||||
|
timerStr = NULL;
|
||||||
|
|
||||||
|
return 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
/* Results:
|
||||||
|
The largest factor of the number 600851475143 is 6857
|
||||||
|
It took 1.297 seconds to run this algorithm
|
||||||
|
*/
|
||||||
Reference in New Issue
Block a user