ProjectEuler/ProjectEulerRust
1
0
Fork 0
mirror of https://bitbucket.org/Mattrixwv/projecteulerrust.git synced 2025-12-06 17:43:58 -05:00
Code Issues Packages Projects Releases Wiki Activity

Updated to allow benchmarking

Browse Source
This commit is contained in:
Mattrixwv
2020-07-22 13:50:34 -04:00
parent 1370e2bc9a
commit baab41f5c0
35 changed files with 590 additions and 365 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
src/Problems/Problem31.rs
View File

@@ -1,7 +1,7 @@
//ProjectEulerRust/src/Problems/Problems31.rs
//Matthew Ellison
// Created: 06-19-20
//Modified: 06-19-20
//Modified: 07-21-20
//How many different ways can £2 be made using any number of coins?
//Unless otherwise listed all non-standard includes are my own creation and available from https://bibucket.org/Mattrixwv/RustClasses
/*
@@ -57,10 +57,10 @@ pub fn solve() -> Answer{
//Stop the timer
timer.stop();
return Answer::new(format!("There are {} ways to make 2 pounds with the given denominations of coins", permutations), timer.getString());
return Answer::new(format!("There are {} ways to make 2 pounds with the given denominations of coins", permutations), timer.getString(), timer.getNano());
}
/* Results:
There are 73682 ways to make 2 pounds with the given denominations of coins
It took 109.300 microseconds to solve this problem
It took an average of 100.789 microseconds to run this problem through 100 iterations
*/