From 13fda69f2062d4c47f2f350dc99870953e65fcc9 Mon Sep 17 00:00:00 2001 From: Mattrixwv Date: Wed, 17 Jun 2020 23:20:44 -0400 Subject: [PATCH] Added solution to problem 28 --- src/Problems.rs | 1 + src/Problems/Problem28.rs | 137 ++++++++++++++++++++++++++++++++++++++ src/main.rs | 11 ++- 3 files changed, 147 insertions(+), 2 deletions(-) create mode 100644 src/Problems/Problem28.rs diff --git a/src/Problems.rs b/src/Problems.rs index deeba76..e59d99e 100644 --- a/src/Problems.rs +++ b/src/Problems.rs @@ -50,3 +50,4 @@ pub mod Problem24; pub mod Problem25; pub mod Problem26; pub mod Problem27; +pub mod Problem28; diff --git a/src/Problems/Problem28.rs b/src/Problems/Problem28.rs new file mode 100644 index 0000000..e367b83 --- /dev/null +++ b/src/Problems/Problem28.rs @@ -0,0 +1,137 @@ +//ProjectEulerRust/src/Problems/Problems28.rs +//Matthew Ellison +// Created: 06-17-20 +//Modified: 06-17-20 +//What is the sum of the numbers on the diagonals in a 1001 by 1001 spiral formed by starting with the number 1 and moving to the right in a clockwise direction a 5 by 5 spiral +//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 sum of the numbers on the diagonals in a 1001 by 1001 spiral formed by starting with the number 1 and moving to the right in a clockwise direction a 5 by 5 spiral".to_string() +} + +pub fn solve() -> Answer{ + //Start the timer + let mut timer = myClasses::Stopwatch::Stopwatch::new(); + timer.start(); + + //Setup the grid + let grid = setupGrid(); + //Find the sum of the diagonals in the grid + let sumOfDiagonals = findSum(grid); + + //Stop the timer + timer.stop(); + + //Return the answer + return Answer::new(format!("The sum of the diagonals in the given grid is {}", sumOfDiagonals), timer.getString()); +} +fn setupGrid() -> Vec::>{ + let mut grid = Vec::>::new(); + //Fill the grid with 0's + for cnt in 0..1001{ + //Add a blank vector + grid.push(Vec::::new()); + for _ in 0..1001{ + grid[cnt].push(0); + } + } + + let mut finalLocation = false; //A flag to indicate if the final location to be filled has been reached + //Set the number that is going to be put at each location + let mut currentNum = 1; + //Start with the middle location and set it correctly and advance the tracker to the next number + let mut xLocation = 500; + let mut yLocation = 500; + grid[yLocation][xLocation] = currentNum; + currentNum += 1; + //Move right the first time + xLocation += 1; + //Move in a circular pattern until you reach the final location + while(!finalLocation){ + //Move down until you reach a blank location on the left + while(!(grid[yLocation][xLocation - 1] == 0)){ + grid[yLocation][xLocation] = currentNum; + currentNum += 1; + yLocation += 1; + } + + //Move left until you reach a blank location above + while(!(grid[yLocation - 1][xLocation] == 0)){ + grid[yLocation][xLocation] = currentNum; + currentNum += 1; + xLocation -= 1; + } + + //Move up until you reach a blank location above + while(!(grid[yLocation][xLocation + 1] == 0)){ + grid[yLocation][xLocation] = currentNum; + currentNum += 1; + yLocation -= 1; + } + + //Move right until you reach a blank location below + while(!(grid[yLocation + 1][xLocation] == 0)){ + grid[yLocation][xLocation] = currentNum; + currentNum += 1; + xLocation += 1; + //Check if you are at the final location and break the loop if you are + if(xLocation == grid.len()){ + finalLocation = true; + break; + } + } + } + + return grid; +} +//Finds the sum of the diagonals in the grid +fn findSum(grid: Vec::>) -> i64{ + //Start at the top corners and work your way down moving toward the opposite side + let mut sumOfDiagonals = 0; + let mut leftSide: i32 = 0; + let mut rightSide: i32 = (grid.len() - 1) as i32; + let mut row: i32 = 0; + //println!("grid {}", grid.len()); + + while(row < grid.len() as i32){ + //This ensures the middle location is only counted once + if(leftSide == rightSide){ + sumOfDiagonals += grid[row as usize][leftSide as usize]; + } + else{ + sumOfDiagonals += grid[row as usize][leftSide as usize]; + sumOfDiagonals += grid[row as usize][rightSide as usize]; + } + row += 1; + leftSide += 1; + rightSide -= 1; + } + + //Return the sum + return sumOfDiagonals; +} + +/* Results: +The sum of the diagonals in the given grid is 669171001 +It took 7.651 milliseconds to solve this problem +*/ diff --git a/src/main.rs b/src/main.rs index e3d2277..3996f15 100644 --- a/src/main.rs +++ b/src/main.rs @@ -33,9 +33,9 @@ mod Problems; #[derive(PartialEq)] enum Selections{EMPTY, SOLVE, DESCRIPTION, LIST, EXIT, SIZE} -static problemNumbers: [u32; 28] = [ 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, +static problemNumbers: [u32; 29] = [ 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, - 20, 21, 22, 23, 24, 25, 26, 27]; + 20, 21, 22, 23, 24, 25, 26, 27, 28]; fn main(){ let mut selection = Selections::EMPTY; @@ -240,6 +240,10 @@ fn solveProblem(problemNumber: u32){ println!("{}", Problems::Problem27::getDescription()); println!("{}", Problems::Problem27::solve()); } + else if(problemNumber == 28){ + println!("{}", Problems::Problem28::getDescription()); + println!("{}", Problems::Problem28::solve()); + } } fn descriptionMenu(){ //Give some extra space to print the description @@ -346,6 +350,9 @@ fn printDescription(problemNumber: u32){ else if(problemNumber == 27){ println!("{}", Problems::Problem27::getDescription()); } + else if(problemNumber == 28){ + println!("{}", Problems::Problem28::getDescription()); + } } fn getProblemNumber() -> u32{ println!("Enter a problem number: ");