BaseLibraries/OctaveFunctions
1
0
Fork 0
mirror of https://bitbucket.org/Mattrixwv/octavefunctions.git synced 2026-02-04 04:02:32 -05:00
Code Issues Packages Projects Releases Wiki Activity

Added documentation

Browse Source
This commit is contained in:
Mattrixwv
2018-09-27 00:18:34 -04:00
parent 9e8ba438e2
commit c4ebd010fa
1 changed files with 27 additions and 12 deletions
Download Patch File Download Diff File Expand all files Collapse all files

39
ProjectEuler/C++/Problem12.cpp
View File

@@ -1,38 +1,53 @@
#include <iostream> //ProjectEuler/C++/Problem12.cpp
#include <cmath> //Matthew Ellison
#include <chrono> // Created: 9-27-18
//Modified: 9-28-18
//This file contains the program to calculate the answer to Problem 12 on ProjectEuler.net
#include <iostream>
#include <cmath> //For fmod
#include <chrono> //For the timer
//Counter how many divisors number has
unsigned long countDivisors(unsigned long number); unsigned long countDivisors(unsigned long number);
int main(){ int main(){
bool found = false; bool found = false; //To flag whether the number has been found
unsigned long sum = 1; unsigned long sum = 1; //The sum of the numbers up to counter
unsigned long counter = 2; unsigned long counter = 2; //The next number to be added to sum
const unsigned long goalDivisors = 500; const unsigned long goalDivisors = 500; //The number of divisors that is being sought
std::chrono::high_resolution_clock::time_point startTime = std::chrono::high_resolution_clock::now(); std::chrono::high_resolution_clock::time_point startTime = std::chrono::high_resolution_clock::now();
while(!found){ while(!found){
//If the number of divisors is correct set the flag
if(countDivisors(sum) > goalDivisors){ if(countDivisors(sum) > goalDivisors){
found = true; found = true;
} }
//Otherwise add to the sum and increase the next numeber
else{ else{
sum += counter; sum += counter;
++counter; ++counter;
} }
} }
std::chrono::high_resolution_clock::time_point endTime = std::chrono::high_resolution_clock::now(); std::chrono::high_resolution_clock::time_point endTime = std::chrono::high_resolution_clock::now();
--counter;
std::cout << "The triangular number " << sum << " is made with all number >= " << counter << " and has " << countDivisors << " divisors" << std::endl; //Print the results
std::cout << "The triangular number " << sum << " is made with all number >= " << counter - 1 << " and has " << countDivisors << " divisors" << std::endl;
std::cout << "The problem took " << std::chrono::duration_cast<std::chrono::milliseconds>(std::chrono::high_resolution_clock::duration(endTime - startTime)).count() << " milliseconds" << std::endl; std::cout << "The problem took " << std::chrono::duration_cast<std::chrono::milliseconds>(std::chrono::high_resolution_clock::duration(endTime - startTime)).count() << " milliseconds" << std::endl;
return 0; return 0;
} }
unsigned long countDivisors(unsigned long number){ unsigned long countDivisors(unsigned long number){
unsigned long numDivisors = 0; unsigned long numDivisors = 0; //Holds the number of divisors
for(int cnt = 0;cnt * cnt < number;++cnt){ //You only need to go to sqrt(number). cnt * cnt is faster than sqrt()
//if((number % cnt) == 0){ for(int cnt = 1;cnt * cnt < number;++cnt){
//Check if the counter evenly divides the number
//If it does the counter and the other number are both divisors
if(fmod((double)number, (double)cnt) == 0){ if(fmod((double)number, (double)cnt) == 0){
numDivisors += 2; numDivisors += 2;
} }