public void Problem67() { var solver = new MaxSumPathSolver(); var filename = Path.Combine(AppDomain.CurrentDomain.SetupInformation.ApplicationBase, "p067_triangle.txt"); var triangle = File.ReadAllText(filename); var answer = solver.Solve(triangle); Assert.That(answer, Is.EqualTo(7_273)); }
public void Problem18() { var triangle = @"75 95 64 17 47 82 18 35 87 10 20 04 82 47 65 19 01 23 75 03 34 88 02 77 73 07 63 67 99 65 04 28 06 16 70 92 41 41 26 56 83 40 80 70 33 41 48 72 33 47 32 37 16 94 29 53 71 44 65 25 43 91 52 97 51 14 70 11 33 28 77 73 17 78 39 68 17 57 91 71 52 38 17 14 91 43 58 50 27 29 48 63 66 04 68 89 53 67 30 73 16 69 87 40 31 04 62 98 27 23 09 70 98 73 93 38 53 60 04 23"; var solver = new MaxSumPathSolver(); var answer = solver.Solve(triangle); Assert.That(answer, Is.EqualTo(1074)); // What are the input sizes for this? // rows: 321 - 307 + 1 = 15 // How many vertices are there? // The arithmetic series minus + 1 is equal to the number of vertices. // arithmetic series: // n = (rows - 1) // 105 = (14^2 + 14)/2 // vertices = 106 // How many edges are there? // 1 + 2 * (arithemetic series from 1 to rows - 2) // n = (rows - 2) // 91 = (13^2 + 13)/2 // 183 }