From ef2948b9889bf41f6cf305b1ee0007b1c96251a6 Mon Sep 17 00:00:00 2001 From: Mattrixwv Date: Tue, 16 Jun 2020 02:40:51 -0400 Subject: [PATCH] Added solution to problem 11 --- src/Problems.rs | 1 + src/Problems/Problem11.rs | 190 ++++++++++++++++++++++++++++++++++++++ src/main.rs | 9 +- 3 files changed, 199 insertions(+), 1 deletion(-) create mode 100644 src/Problems/Problem11.rs diff --git a/src/Problems.rs b/src/Problems.rs index fda6476..30d81da 100644 --- a/src/Problems.rs +++ b/src/Problems.rs @@ -33,3 +33,4 @@ pub mod Problem7; pub mod Problem8; pub mod Problem9; pub mod Problem10; +pub mod Problem11; diff --git a/src/Problems/Problem11.rs b/src/Problems/Problem11.rs new file mode 100644 index 0000000..5e64f5d --- /dev/null +++ b/src/Problems/Problem11.rs @@ -0,0 +1,190 @@ +//ProjectEulerRust/src/Problems/Problems11.rs +//Matthew Ellison +// Created: 06-16-20 +//Modified: 06-16-20 +//What is the greatest product of four adjacent numbers in the same direction (up, down, left, right, or diagonally) in the 20×20 grid? +/* +08 02 22 97 38 15 00 40 00 75 04 05 07 78 52 12 50 77 91 08 +49 49 99 40 17 81 18 57 60 87 17 40 98 43 69 48 04 56 62 00 +81 49 31 73 55 79 14 29 93 71 40 67 53 88 30 03 49 13 36 65 +52 70 95 23 04 60 11 42 69 24 68 56 01 32 56 71 37 02 36 91 +22 31 16 71 51 67 63 89 41 92 36 54 22 40 40 28 66 33 13 80 +24 47 32 60 99 03 45 02 44 75 33 53 78 36 84 20 35 17 12 50 +32 98 81 28 64 23 67 10 26 38 40 67 59 54 70 66 18 38 64 70 +67 26 20 68 02 62 12 20 95 63 94 39 63 08 40 91 66 49 94 21 +24 55 58 05 66 73 99 26 97 17 78 78 96 83 14 88 34 89 63 72 +21 36 23 09 75 00 76 44 20 45 35 14 00 61 33 97 34 31 33 95 +78 17 53 28 22 75 31 67 15 94 03 80 04 62 16 14 09 53 56 92 +16 39 05 42 96 35 31 47 55 58 88 24 00 17 54 24 36 29 85 57 +86 56 00 48 35 71 89 07 05 44 44 37 44 60 21 58 51 54 17 58 +19 80 81 68 05 94 47 69 28 73 92 13 86 52 17 77 04 89 55 40 +04 52 08 83 97 35 99 16 07 97 57 32 16 26 26 79 33 27 98 66 +88 36 68 87 57 62 20 72 03 46 33 67 46 55 12 32 63 93 53 69 +04 42 16 73 38 25 39 11 24 94 72 18 08 46 29 32 40 62 76 36 +20 69 36 41 72 30 23 88 34 62 99 69 82 67 59 85 74 04 36 16 +20 73 35 29 78 31 90 01 74 31 49 71 48 86 81 16 23 57 05 54 +01 70 54 71 83 51 54 69 16 92 33 48 61 43 52 01 89 19 67 48 +*/ +//Unless otherwise listed all non-standard includes are my own creation and available from https://bibucket.org/Mattrixwv/RustClasses +/* + 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 + 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 . +*/ + + +extern crate myClasses; +use crate::Problems::Answer::Answer; + + +pub fn getDescription() -> String{ + "What is the greatest product of four adjacent numbers in the same direction (up, down, left, right, or diagonally) in the 20×20 grid?".to_string() +} + +pub fn solve() -> Answer{ + let grid: [[i32; 20]; 20] = [[8, 02, 22, 97, 38, 15, 00, 40, 00, 75, 04, 05, 07, 78, 52, 12, 50, 77, 91, 8], + [49, 49, 99, 40, 17, 81, 18, 57, 60, 87, 17, 40, 98, 43, 69, 48, 04, 56, 62, 00], + [81, 49, 31, 73, 55, 79, 14, 29, 93, 71, 40, 67, 53, 88, 30, 03, 49, 13, 36, 65], + [52, 70, 95, 23, 04, 60, 11, 42, 69, 24, 68, 56, 01, 32, 56, 71, 37, 02, 36, 91], + [22, 31, 16, 71, 51, 67, 63, 89, 41, 92, 36, 54, 22, 40, 40, 28, 66, 33, 13, 80], + [24, 47, 32, 60, 99, 03, 45, 02, 44, 75, 33, 53, 78, 36, 84, 20, 35, 17, 12, 50], + [32, 98, 81, 28, 64, 23, 67, 10, 26, 38, 40, 67, 59, 54, 70, 66, 18, 38, 64, 70], + [67, 26, 20, 68, 02, 62, 12, 20, 95, 63, 94, 39, 63, 8, 40, 91, 66, 49, 94, 21], + [24, 55, 58, 05, 66, 73, 99, 26, 97, 17, 78, 78, 96, 83, 14, 88, 34, 89, 63, 72], + [21, 36, 23, 9, 75, 00, 76, 44, 20, 45, 35, 14, 00, 61, 33, 97, 34, 31, 33, 95], + [78, 17, 53, 28, 22, 75, 31, 67, 15, 94, 03, 80, 04, 62, 16, 14, 9, 53, 56, 92], + [16, 39, 05, 42, 96, 35, 31, 47, 55, 58, 88, 24, 00, 17, 54, 24, 36, 29, 85, 57], + [86, 56, 00, 48, 35, 71, 89, 07, 05, 44, 44, 37, 44, 60, 21, 58, 51, 54, 17, 58], + [19, 80, 81, 68, 05, 94, 47, 69, 28, 73, 92, 13, 86, 52, 17, 77, 04, 89, 55, 40], + [04, 52, 8, 83, 97, 35, 99, 16, 07, 97, 57, 32, 16, 26, 26, 79, 33, 27, 98, 66], + [88, 36, 68, 87, 57, 62, 20, 72, 03, 46, 33, 67, 46, 55, 12, 32, 63, 93, 53, 69], + [04, 42, 16, 73, 38, 25, 39, 11, 24, 94, 72, 18, 8, 46, 29, 32, 40, 62, 76, 36], + [20, 69, 36, 41, 72, 30, 23, 88, 34, 62, 99, 69, 82, 67, 59, 85, 74, 04, 36, 16], + [20, 73, 35, 29, 78, 31, 90, 01, 74, 31, 49, 71, 48, 86, 81, 16, 23, 57, 05, 54], + [01, 70, 54, 71, 83, 51, 54, 69, 16, 92, 33, 48, 61, 43, 52, 01, 89, 19, 67, 48]]; + + //Holds the largest product we have found so far + let mut greatestProduct = Vec::::new(); + //Holds the numbers we are currently working on + let mut currentProduct = Vec::::new(); + + //Make sure all elements have at least 4 elements + for _ in 0..4{ + greatestProduct.push(0); + currentProduct.push(0); + } + + //Start the timer + let mut timer = myClasses::Stopwatch::Stopwatch::new(); + timer.start(); + + //Loop through every row and column + for row in 0..20{ + for col in 0..20{ + //DIrectional booleans to show whether you can move a certain direction + let mut left = false; + let mut right = false; + let mut down = false; + + //Check which direction you will be able to move + if((col as i32 - 3) >= 1){ + left = true; + } + if((col as i32 + 3) < 20){ + right = true; + } + if((row as i32 + 3) < 20){ + down = true; + } + + //Check the direction you are able to go + //Right + if(right){ + //Fill the product + currentProduct[0] = grid[row][col]; + currentProduct[1] = grid[row][col + 1]; + currentProduct[2] = grid[row][col + 2]; + currentProduct[3] = grid[row][col + 3]; + + //If the current number's product is greater than the greatest product replace it + if(currentProduct.iter().product::() >= greatestProduct.iter().product::()){ + greatestProduct[0] = currentProduct[0]; + greatestProduct[1] = currentProduct[1]; + greatestProduct[2] = currentProduct[2]; + greatestProduct[3] = currentProduct[3]; + } + } + //Down + if(down){ + //Fill the product + currentProduct[0] = grid[row][col]; + currentProduct[1] = grid[row + 1][col]; + currentProduct[2] = grid[row + 2][col]; + currentProduct[3] = grid[row + 3][col]; + + //If the current number's product is greater than the greatest product replace it + if(currentProduct.iter().product::() >= greatestProduct.iter().product::()){ + greatestProduct[0] = currentProduct[0]; + greatestProduct[1] = currentProduct[1]; + greatestProduct[2] = currentProduct[2]; + greatestProduct[3] = currentProduct[3]; + } + } + //LeftDown + if(left && down){ + //Fill the product + currentProduct[0] = grid[row][col]; + currentProduct[1] = grid[row + 1][col - 1]; + currentProduct[2] = grid[row + 2][col - 2]; + currentProduct[3] = grid[row + 3][col - 3]; + + //If the current number's product is greater than the greatest product replace it + if(currentProduct.iter().product::() >= greatestProduct.iter().product::()){ + greatestProduct[0] = currentProduct[0]; + greatestProduct[1] = currentProduct[1]; + greatestProduct[2] = currentProduct[2]; + greatestProduct[3] = currentProduct[3]; + } + } + //RightDown + if(right && down){ + //Fill the product + currentProduct[0] = grid[row][col]; + currentProduct[1] = grid[row + 1][col + 1]; + currentProduct[2] = grid[row + 2][col + 2]; + currentProduct[3] = grid[row + 3][col + 3]; + + //If the current number's product is greater than the greatest product replace it + if(currentProduct.iter().product::() >= greatestProduct.iter().product::()){ + greatestProduct[0] = currentProduct[0]; + greatestProduct[1] = currentProduct[1]; + greatestProduct[2] = currentProduct[2]; + greatestProduct[3] = currentProduct[3]; + } + } + } + } + + //Stop the timer + timer.stop(); + + //Return the resutls + return Answer::new(format!("The greatest product of 4 numbers in a line is {}\nThe numbers are {:?}", greatestProduct.iter().product::(), greatestProduct), timer.getString()); +} + +/* Results: +The greatest product of 4 numbers in a line is 70600674 +The numbers are [89, 94, 97, 87] +It took 7.800 microseconds to solve this problem +*/ diff --git a/src/main.rs b/src/main.rs index cfb69d0..9337d5e 100644 --- a/src/main.rs +++ b/src/main.rs @@ -33,7 +33,7 @@ mod Problems; #[derive(PartialEq)] enum Selections{EMPTY, SOLVE, DESCRIPTION, LIST, EXIT, SIZE} -static problemNumbers: [u32; 11] = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10]; +static problemNumbers: [u32; 12] = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11]; fn main(){ let mut selection = Selections::EMPTY; @@ -170,6 +170,10 @@ fn solveProblem(problemNumber: u32){ println!("{}", Problems::Problem10::getDescription()); println!("{}", Problems::Problem10::solve()); } + else if(problemNumber == 11){ + println!("{}", Problems::Problem11::getDescription()); + println!("{}", Problems::Problem11::solve()); + } } fn descriptionMenu(){ //Give some extra space to print the description @@ -225,6 +229,9 @@ fn printDescription(problemNumber: u32){ else if(problemNumber == 10){ println!("{}", Problems::Problem10::getDescription()); } + else if(problemNumber == 11){ + println!("{}", Problems::Problem11::getDescription()); + } } fn getProblemNumber() -> u32{ println!("Enter a problem number: ");