001package net.n1da.dev.euler;
002
003import net.n1da.dev.euler.core.*;
004import net.n1da.dev.euler.helper.*;
005
006/**
007 * Solution for problem 67
008 * "<strong>Maximum path sum II</strong>"
009 * completed on Sat, 16 May 2015, 21:19.
010 * 
011 * @author <a href="mailto:nico@danneberg.de">Nico Danneberg</a>
012 * @since 16.05.2015 21:16:15
013 * 
014 * @see <a href="https://projecteuler.net/problem=67" target="_blank">Problem @ Project Euler</a>
015 * @see <a href="http://n1da.net/specials/projekt-euler/problem-67-maximale-summe-eines-pfades-ii/" target="_top">Solution @ Ni-Da-Net</a>
016 */
017public class PE0067 extends PE0018 {
018
019        /**
020         * A simple constructor to set {@link Problem#number number}
021         * and {@link Problem#title title}.
022         */
023        public PE0067() {
024                super( 67, "Maximum path sum II" );
025        }
026
027        /**
028         * Since the same algorithm like in {@link PE0018 Problem 18} is used
029         * we do need to change the initialization, only!
030         */
031        @Override
032        public void prepare() {
033                super.prepare();
034                data = IO.readTriangle( "data-files/triangle-100rows.txt" );
035        }
036}