From 9f14ac1de8831fff6a3c58f311f3c7fbb4ace55e Mon Sep 17 00:00:00 2001
From: "sigonasr2, Sig, Sigo" <sigonasr2@gmail.com>
Date: Mon, 18 Jul 2022 19:27:26 +0000
Subject: [PATCH] Completed 18!

Co-authored-by: sigonasr2 <sigonasr2@gmail.com>
---
 archives/15/src/main.c.disabled |   2 +-
 archives/15/src/threadedmain.c  |   2 +-
 archives/18/current             | Bin 0 -> 16944 bytes
 archives/18/src/main.c          |  76 ++++++++++++
 archives/18/src/utils.c         |  54 ++++++++
 archives/18/src/utils.h         |   9 ++
 current                         | Bin 16848 -> 16944 bytes
 src/main.c                      | 212 +++++++++-----------------------
 8 files changed, 201 insertions(+), 154 deletions(-)
 create mode 100755 archives/18/current
 create mode 100644 archives/18/src/main.c
 create mode 100644 archives/18/src/utils.c
 create mode 100644 archives/18/src/utils.h

diff --git a/archives/15/src/main.c.disabled b/archives/15/src/main.c.disabled
index eece796..ee76bd8 100644
--- a/archives/15/src/main.c.disabled
+++ b/archives/15/src/main.c.disabled
@@ -7,7 +7,7 @@
     How many such routes are there through a 20×20 grid?
 
 
-    https://projecteuler.net/problem=14
+    https://projecteuler.net/problem=15
 */
 
 void move(int x,int y,long*pathCount) {
diff --git a/archives/15/src/threadedmain.c b/archives/15/src/threadedmain.c
index c2e931b..043d577 100644
--- a/archives/15/src/threadedmain.c
+++ b/archives/15/src/threadedmain.c
@@ -7,7 +7,7 @@
     How many such routes are there through a 20×20 grid?
 
 
-    https://projecteuler.net/problem=14
+    https://projecteuler.net/problem=15
 */
 
 void move(int x,int y,long*pathCount) {
diff --git a/archives/18/current b/archives/18/current
new file mode 100755
index 0000000000000000000000000000000000000000..1a1d3c4624a6669965a483ce0bd8a95f88df232e
GIT binary patch
literal 16944
zcmeHOe{fXCec#g|5H_4d0ye>}x!BM`4QGL63U;t{LJyu=fmM)VJO)2bx)ZwQ^dqOc
zMz}UndOnw%Lya<VTg{Z2Dl=}Q8IzVyC$2qXYzZhQGqe^7O_Yh-su|OsZ0g9wZn0~)
ze!jc=J-vH6#c8L1wYM{O-_L&b`~B|jclYhRefRdOM&r&hmrHPRi-!f}rm7TEs|$J_
z)BvJZY!yrKy;|HQ79zhua;m&m36!cdSym`3H1CEayOjir$U7A+SaJ(VlHGi%Vv#Cg
zDRe)`uAGW=-YNh7R%OSM%k%YlRk?7;VNyV1X}6=;3~iLfVrYAz?9*}S*OKihOLimL
zZbaL$oYD2M<akm{=(APF(<!|uqvVy}LOAXAYdfc`*ZM4}4ods3#Df2m`kJ)e8n1LC
zoU&2Tf+g4Yo3Nv}{Gy46d9SW-zH#W#@n@;SEAESgTesBQ7YS~RguCK>8~e6y*|?>~
z*W2yeESo^>qB>|!?b_2K;AWIK9Y#48%XOa0U%dG*lYepB;`_fp{l)%h&A~rj{mPYV
z?1Sng9ZF=+Q-bn@Z^4IjRR6yQq&Sk7LVwpua=t{@&u5Ahei@v%2v3(mG5rnm@D20u
z1K_>*IMe+giuqqN4}Su@7awP$<>+oFNqLN08x7MIVOhPgK--tBwvI1Z?SXJa^u%Lr
z9f7Ebh60gDcbn*mhPz_zqEqE8tF13!wTHU`k?>O?Sd%Am5sg`$fpC}D)!0zC!`ket
z$)nA_2ZYtoyxR(fqM^g#-dHHwyn9EayDQWjXpNAM!=2q-+J~i7iz=#dc4M?@y!o5D
z<3i2_$@6)6IJ}f*$rGB3uL>_Fix4Rz@jAoT_vkXk59@V=`F_n;)T(mkIY0S`;%Uy=
z=i`)(r@7B5Yvb+L>5Pp>L-Xmnji>p|>6GSa8K-`8dfCSFHAZElHlD60PUALS|0Kww
z2^-ISW}A{MMW7UcQUpp7C`F(Yfl>tiKSbbXm3Mt?CazYP>GB`lCxn?Cjg{pl%*45h
zv$FfS2c80bEw}b}ASzc2((j;>Yt#Rn%jE`To^I5xO<&6A>4x#z^jJPmH*D9Y|1zJa
z8?|fG-{L&HcS`T|Li$I3g(JVzkuP`TZ}_Nnv-Tg_^PB#yA$93VGxZZQ@%BtpbK^ky
zdE9cE14|#3V*41HlUwmUn0zp34s8Djz#J&QMq=Cb*b0Q^&j}+mi*r+ztNWoY&T0w$
zH>CapXGpBSX{Kh(vG*P^$F93g*Lm~O&De4{NNNWaxv6&9PPV7`^>3$Q5x=*^Ol)r@
zXr`{jmYC`7?Z{+*bTgOB1`(|D<p+^>9fWPZezKqb3JM9dz|Q>I)ltMdb-MABT+U2=
zw-zF3rWdSTC;b}NH;tMDf6xQ=Wf0<(9!dZ3XXcA$>f=<InK-i`lceI`KtU#X63CM1
z6i}^1Ss>azWRh2bFcLsBKzk)xb0e3d9bP864(J|<HUK>)Q8f_V?`M*SfM|!DNd|#v
zN@S89K*~!5NO|r7^2^c_K%bRp7>FiaCiw!;?GlXu={5t=l*=Sf0nsiolbi(FFVR~-
zG(j`TDWKgFy$wV=*-SDEMEeEw4Tv@i=o`=uiI!t1+9X;Dq*`?+kZQdbi1yo=<QgE_
z1tA7Nw0FxSHvsLFs2b>iL`^{JC2G#2{XnZEcK~RsM2CR(NfZR4kwmP3nk0$<DbGDX
zpO@TmAmw=ws9JK*1DO&H<@HVgsW=Y<d1dJfKx-u$0aC3$3G}4oP67RrMB_jYNOTcs
zmqZgl^sFG0ybPowGzs)M$-M=1uS8Qow1>?k-v+9YC<_#j=qeCBDM0LjJQ6LyBv-wx
z0HWs<ndA~6)!!;075n8tYE)MOsZqTXNX=L;&>m^K2IyBLS_g!s1O7JT^{RokNv;-1
zwX_~c_0j}VZEghmWvSN$r0Qq}Qf=N3q-+lWsh%GKqNf*__duH^>HxY!q6m<RZV!+e
zx2J*ROf>rINXd9s&Nt(jY_xIwaY+u!p)j78Gu0TnOOhvK|BYceh{g+sBuC_>Xq=Su
z$T+oHk}oTtuRbhuqpeb$lZ`UQ<rQXJTr9~6ISR&Qr822%c<Z1no073G-d1hNenFB~
zmFpRGoi<~o(9zLo`Xf?H9zYgAOkcoPT4v3*@pN)Oc(ZN7Oih?$Qwz-X6Q*lC{j6N0
zQppY!D&54W>(kXEQk^^wG-*2+nQh-I^!~i`o|fLXCCR9Aw-o6CX?r9$u%wKeIAgZ`
z&~84HIxfu<vI{Py_E3`gU3r{lUE({0U5W3IFIVC;2~qj=k1^G;EK&yP-F8e6#<gjQ
zW&cQFzHpq!&ylY}2)VRpC$6I|X^2Y5m*?nTzfOy9_77zVc|r*Z&(UwBRYb|fPq6|j
z7Xwg~$V|tt2hICy<j+W~JR3y88)x}PXCH1MI`GTqPhD?Joo`INX{It}Dn4wco*BWg
zr7oB$W6(^s44pSlWB!g(2VbYJ>=)n%g_G%);j}Th?M&tI_d#cjb5uHg8D9xw)Ri_y
zsmp0&(oFpTzOyUX3^vBO%7Nd7qM2?PNgKoW8t2R*Gm&+fu8GQ*MCEIv113ychTwm0
zSt48Q8tZ@Nv^ct~@+ISR>P+Gt*Rht<uzI&#cHA|dGR70nj4wV~fyTQMo#VHpjqw4q
zI*odCn_LsA3&*P7U0b9D=@w{RK*6Nxx`5^!D@z#X(4S#y_HkN`rmv#y8RH_pe@=(j
z{D+PcSzdH>_~Os$u(RwJ>hMJ3nTdRdC(z*u+2M;tI;_GvTT8kHT8<81M29g>7gdL4
zw5y8_>%;%fy&OfCaEZzxcTJoZn=%GX2J!BJv~hX185B|DHB66t!P+fk!RvDi&R~>Z
zJ62|QLe%RtE|+PZrOu4Kv)VOr>H0R~^3&fW!kAJM&&Waow`9%Kn3?*1Y8<!89ZwuQ
z+wQAe{VX+3w9ETp|6`2<+aJ1H2>%xwQa|vwG^9TCH~Ukcw3q`MH-O&Pxc&y+b7#N$
z0lGVO!yQ|_>BsthvN3h7G4)=3>R<i2<^N<R&brKP{}6wN?#G`v=s(~;=zr30oo%13
zk*>hAsF|d^kI&z^%LbLcN)aeUpcH|5BS8Nztqm>~w>;h*k9s=;ec{e{r#IRikA=M9
zUhmo<EM0fFAEJE&ZY;znKh5QyhCDEn%e?>@fqWJ6RY=nP)Aw^ZTBujy2l@lZ4gZPz
za+eS%AcK(0!BKKOwO6?Ms$6$0SyVBodAfgZf*;zCi26lz&nnj7Q-e<*>OBN0JXJeA
zD}TN6)~{6bi$_*H_^bD?!HTN<9)LUrJ!wcJ64e*OX9Ro`5js&_$MJas^~Dzg7@n%<
z%62SW=#DHzlVrUoLEnYn-Gy#jxsh<Yua}XEO!fG_j8DbKxt#nDZl|Z}>tzj|mA~&c
zJl=r?hG*UJ@_JA8a|=z+*2JP+p4u+YR==m(?^##p@z!}()_JPxJQec)J&IE`{Mi3j
zQ?-=7OA#nVpcH{p1WFMoMW7UcQUpp7C`I7^as>FjJ$_FQTLYO`F5%AW%?@4)lxduv
z*dx*ZEtL3uKuzc0`=x)FDDiuNv>&3Rw>9F!o4Ibv57XWUiT5NE3sj!AOq9lTIXzaU
z^pX;S{-2?=QVFp_OBUKp3_YTlGF{N8CGFcN;YqYi^xpxcL0vKP6S`sC?op{F1pQS(
ziR-7oLnyHxwxhCth^M6R>|OO&`@@4-E|+%LCd&MCy8I)Z=YB|~|HUtU-`nZ3T90?F
zmQ7k7(y~WOr`@OJD{7U-t{pob^sZ}Zjd#W3-fg}bU-iaKahcn6baS<@y2iI@z2ZO3
zBfX{S%D>-l*QWPe`Tg`l-Yxk3^Fn@sc)CcS-I$d;KMVC2=I3Q0zew=>E#xZ%k82^n
zSPb*Tw-vbYMmEno8;$<nnxCJAJg(Lv<Ko6C3U5)~Bl?T-m13|cUzI<vQCROX!RtXG
zkN@Yrc1B^h_-y`te0!-IPf>b`>aWPJFNONI<=2%${&rDpUb}IX@;Xqck5#PJ&M52_
zt3*{%o>#e98(J?Hi1+1RYO|~mw0@RhP^#!JTU(-kCW)_g@SoQ_ug7fiYXB}=d#FB2
zJMnRexpC+OPyTs*CtXTM@Nr?4<n>yT_!`2eSo{BE9)7<5ejEBOjN=LFh$9vA|6QrG
zV$L|82k#Pd$MH?A?`;21BtLgveJK6R9rr9cP)4KUnCG{G{|v=V4>4bscSv4VQt(v`
z-dn(^%!uUY&Z|c0r%F7me=y`TKbSOuufngXbH1%0{j#~&*JIMp+=_eW;eT%){?EWu
zz0UdnSKz&K-HS8emz8}^@H);aZxT-@F0_&U`4;~Op5oc0;~CNh?@6AmXXO}R73TTM
z+F6d!N$qD!kJo*=xC}q&sC7=d9X$DQ#`7MjUnSnq*PVPO3+r{@sb5b08t~pZ-i6o$
z{_Y~YXp6>rV{!a*)+T08Ygn;PtBuZU^x~{Wu-iHu>23`~tYEA=+G_>keWI<qvnLXY
zg@V4V)mt_dSE4f`VJi@g298*vu2}SlXpaUuLsl@}*?9yewwwjcSb-{?EJ2gvv2dgp
z(z15$_3t(;V^6(>10#j{L1EQDzQ@12VMk$!Jfi{%XNWAr)E><Gy~5hn_-LKK(Ry^}
z&V5F+)$FfpG{~zw+0xb<mo4XGF}1aPz~$49wFH7_NhlbI1>mdjjLoc*8hyNGmXU6q
zr)r$V<W(J*f$zf8Ggh#-+v*5(1?gl>!=um&hP$kIZwRfK?Gi;;AL%Ldtxx?Fl9tul
z+pFu7hkPsxCwMsgbhM}Fd7Z+uLWM4culGo2EYJ!Wiz?Z{2<MGL(H`OJ>W+nchr8mw
zo@jSZC>lFrqgvx(oH`2!HRZ2s*cb~O7E-+<(Ayz=!6RL$LdjTEmHc)n+8gffD#%zU
zi-sZrGSH|e5)(cdA|Igda5u69dP8l(7Yp?vOS2i;-Ew?=p$<KNJA&}WIpsr5WM#n^
zRRuc3aHh-=UE#w;)QJnD*j4%8=4iRXl7rs}l~(HeLYBOb(Zy1iG0A)Ip}hm!^L;2w
zFUstR_Y2Hz0kGTe*Y&fc|EuhY*IVZ3Z7I7w-`BGAvZ9tw`^UiJC5disKi~hd<obDk
z=4^ie_Ov%+d)~jXtf1f`Q5y-eJ@2E!;Hb-N&-c?TdH)9$nY263iZ27v-iqz{zMJK3
zT9ez)dMuBkoc3y*=lgS()!N?Keoc!30E#Kw^L;$aQLV`JJNy4f+P+Tf@qUzLpUs|P
z=CuD7IEo4T$B&^(S~~Awo#TJPVei#;EDvdSEFA8|w;lHVT7f0&&u4$iVbA*!mQ8G^
zCHrIfio<?N7qGm-4-y>q?3Ugdv&WD3H!S%%2<toJ_cz*}$6t80rj~c>EDNXo-=cu(
zXZtl?rOC2UW%J)o`yZpkZr|fosx0Zg)t-3%Fn0xj_9%MU$?q5Ve6v%Z^DN(oZKchg
zpZ^SR1c}6YDmR;F{sszY?sEOSpX2lDGrIkB{ZV2&9{(4?kqX=MzHdn1IChYcEwMez
zg)p|;i(0K*tt8jOF4&IqOJGbK*U$HrRodREPj%VTGF`t`&lj;hz2j?7Y;Tu5ckFt#
y+Tn;^80Z~f3JJG|*I#<B#cj9SXX%Ft>9-utxn5ODdx7Hid$%c#RSpA3R{R$X|3^Lm

literal 0
HcmV?d00001

diff --git a/archives/18/src/main.c b/archives/18/src/main.c
new file mode 100644
index 0000000..57370fc
--- /dev/null
+++ b/archives/18/src/main.c
@@ -0,0 +1,76 @@
+#include <stdio.h>
+#include "utils.h"
+
+#define TARGET 2
+
+/*
+   By starting at the top of the triangle below and moving to adjacent numbers on the row below, the maximum total from top to bottom is 23.
+
+3
+7 4
+2 4 6
+8 5 9 3
+
+That is, 3 + 7 + 4 + 9 = 23.
+
+Find the maximum total from top to bottom of the triangle below:
+
+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
+
+NOTE: As there are only 16384 routes, it is possible to solve this problem by trying every route. However, Problem 67, is the same challenge with a triangle containing one-hundred rows; it cannot be solved by brute force, and requires a clever method! ;o)
+    https://projecteuler.net/problem=18
+*/
+
+int main(int argc,char**argv) {
+    int rows[][15] = {
+    {75}
+    ,{95,64}
+    ,{17,47,82}
+    ,{18,35,87,10}
+    ,{20,4,82,47,65}
+    ,{19,1,23,75,3,34}
+    ,{88,2,77,73,7,63,67}
+    ,{99,65,4,28,6,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,4,68,89,53,67,30,73,16,69,87,40,31}
+    ,{4,62,98,27,23,9,70,98,73,93,38,53,60,4,23}};
+
+    int max=14;
+    for (int row=14;row>0;row--) {
+        for (int col=0;col<max;col++) {
+            int numb1=rows[row][col];
+            int numb2=rows[row][col+1];
+            //printf("Picked numbers: %d %d\n",numb1,numb2);
+            rows[row-1][col]+=(numb1>numb2)?numb1:numb2;
+        }
+        max--;
+    }
+    for (int i=0;i<15;i++) {
+        for (int j=0;j<15;j++) {
+            printf("%d\t",rows[i][j]);
+        }
+        printf("\n");
+    }
+
+    printf("\nYour maximum route is %d",rows[0][0]);
+
+    return 0;
+}
\ No newline at end of file
diff --git a/archives/18/src/utils.c b/archives/18/src/utils.c
new file mode 100644
index 0000000..bd5f32c
--- /dev/null
+++ b/archives/18/src/utils.c
@@ -0,0 +1,54 @@
+#include "utils.h"
+#include <stdio.h>
+#include <stdlib.h>
+
+struct String add(struct String numb1, struct String numb2){
+    byte carryover=0;
+    int digitCount=0;
+    char*str = malloc(0);
+    if (numb1.length>=numb2.length) {
+        for (int offset=0;offset<numb1.length;offset++) {
+            str = realloc(str,++digitCount);
+            //printf("Digit count is now %d\n",digitCount);
+            if (numb2.length>offset) {
+                //printf("%c %c\n",numb1.str[numb1.length-offset-1],numb2.str[numb2.length-offset-1]);
+                int sum=((numb1.str[numb1.length-offset-1]-'0')+(numb2.str[numb2.length-offset-1]-'0'))+((carryover>0)?carryover--:0);
+                if (sum>=10) {
+                    carryover=1;
+                    sum-=10;
+                }
+                str[offset]=sum+'0';
+            } else {
+                str[offset]=numb1.str[numb1.length-offset-1];
+            }
+        }
+    } else {
+        for (int offset=0;offset<numb2.length;offset++) {
+            str = realloc(str,++digitCount);
+            //printf("Digit count is now %d\n",digitCount);
+            if (numb1.length>offset) {
+                //printf("%c %c\n",numb1.str[numb1.length-offset-1],numb2.str[numb2.length-offset-1]);
+                int sum=((numb1.str[numb1.length-offset-1]-'0')+(numb2.str[numb2.length-offset-1]-'0'))+((carryover>0)?carryover--:0);
+                if (sum>=10) {
+                    carryover=1;
+                    sum-=10;
+                }
+                str[offset]=sum+'0';
+            } else {
+                str[offset]=numb2.str[numb2.length-offset-1];
+            }
+        }
+    }
+    if (carryover>0) {
+        str = realloc(str,++digitCount);
+        str[digitCount-1]='1';
+    }
+    for (int i=0;i<digitCount/2;i++) {
+        char c = str[i];
+        char c2 = str[digitCount-i-1];
+        str[digitCount-i-1]=c;
+        str[i]=c2;
+    }
+    struct String newStr = {digitCount,str};
+    return newStr;
+}
\ No newline at end of file
diff --git a/archives/18/src/utils.h b/archives/18/src/utils.h
new file mode 100644
index 0000000..6ddf751
--- /dev/null
+++ b/archives/18/src/utils.h
@@ -0,0 +1,9 @@
+#define true 1
+#define false 0
+#define boolean char
+#define byte char
+struct String{
+    int length;
+    char*str;
+};
+struct String add(struct String numb1, struct String numb2);
\ No newline at end of file
diff --git a/current b/current
index 9d6fe630f73942523902594b4653745f07bc3124..1a1d3c4624a6669965a483ce0bd8a95f88df232e 100755
GIT binary patch
delta 4129
zcmai%4Nz3q702J(U0@ecb`i25=q`u`65Qoes(iQ`U42Y2LE~3i4G_>mf+HwQP3mN^
z_-wbx6mxBdnK~1k+7=ViVrf&I>J&{Ui=E75lbXhMoDRuoXK8H(qYYa1^?%QOk0O&!
zFT<YS`MBrZd+x{EjdaOFhveQ=$CzEB<`Y6{J(~N|cx#-{tZ_&G?1}$)j?g}y!;)l=
zzh4%rAtgNnH^<_?Z<+A-RXi&9n}puU4$4keC#SL@c{C~8Ev)~Q?7OBHGXGbSCOt_L
zvzcp?-+K7hD?fkCR`iGQEuDLdcl^+G_WCV$z?_p3kEF(UB<UbMBA%T!KQ3o5hsDY4
z<ra3$oXoaaQsq2hDYLL-OET*f9=V8H<!tiRR8X{KCGxPzqWSC%OG0XG?Y{Q<hL>v_
znqIEmRo~nqwRW^OG}Z5AZ(4kEG5gfADaglamQ47Qra$>mWN3VJdf}wx=H|IP@@u-S
zV?ncx_t?pU(Tqx3g({6W1oZ0_Hte0c-RdJhdn0C{Y+~nQoM|z7PcEXXgu>S<mi;5f
zS%rs9x2YLkUPYq~>2|&|_}GnhW`^C&7REZ$EQSkmbcQ#Mt&ere*5S5Tv+Z?zmi1My
zB;C@Me3Lz4Um0vNBl_0(X-(65KTlkAuZd^5HGaa-5x5)iiLN!0#Qo4yX6bWh=`pkP
z2cAd!-<hGaAK8;PW4cPu+-FHtT)^|Sl#dW|yI1L{xC>BvVs3G<VyZnw>5lmsXLY3A
zri~@KIuS0tt4qXRqWF@F9+u!pmsOVISd^>6CUrcyS?Q{Hk)sm2-kzXzSL}ik{nJBD
zi#B4q@5St3dmM{{2XBm^CZY4y_ccuk{mKW?sB~MF<WSGRRKbYS^Ziy>&%hv^Z6)(3
zpDS-Ep?e{d(sj`iR=N9WIKt{6sFr95<RglL_>KvyH$bQsXacm6Q&7!*plL~D%mFPX
z$^&gB$_MfN5mxI!$wZAHzHVW)2}Ehs7LZ8Y3i6ZpIA}gmKZx(9uzC{YBpLucEd{x8
z5Xd)1SRDdo5nTaoBf1LWM=Pw3fz}gU162`4L431fb|AhFF+0#|qGXi2fhZLuhLr&l
z!*@T_f?5W-vti^XC9LLv_=ydxd7!mK`JnAYHK1IgP1Cduw18~eL0=)N13gF72;z&0
zYJqBqT0kOmuoaj|#v>q+x)+pBwqqcLsBb#%I7pPbALJ(QNzf9a0gxE}Am|0M4S^OC
zje<&u-UqFdQ2($R0p^kMGDsBZ3Mh?iS3yq_je+>x6;`i-iix72dZHVkBBBY<JR%D=
zx|pXG#NRJrH31|hYzGBJ`ICWSWm7?7Wivox-?~B1Q0HvW<3u?iToOo_HyxJ`T0u4+
zNDOri2=hdo0uqC+1}!C9O%Ny^vI!(cy$vKfZwHCF*MazZA*}MlTS(LdN+)Uoi2}ER
z#L^uA(RK`UKE;CqhiKCUzC)u99C@CM!CqR9z%kmdfxbm#Jx&z}^wUBHP6o(0KqoRV
zNSi4z<Rar4k@Q?8X(KO^_#KTZFiHn4@V<?V5n71AWf5{kJmG3^2RX;69D!?MFwt@{
z-VnJb#ChF>D?_i3PUClZn7SP*KpOu&KDtR&8b-U-ZLlj15hWB+E{s`}+=wENb|0e4
zDx@~S$zy|>)-@vk|M(V)=P7$?s3Xrksx*A`X!>K6zMImoP<f}s^(4A`sP8LUPlCx9
z<Al=iNpNQWiO>=1-$j#<MO>N6XP$V3Z@sR!Im=yd^JH?@c`l^H@7=?O#|6n1w7>7d
zCNbF8O-vKy0kaDdG%E5Q-X<QaB+)e=jZEQT)DutP$>zQG>)-NwIQj$f@Ko?{G4Hjb
z-J+;G#ZBCWB1I1ZiInb+sYa!!m|iLEG0{diF1^d&uA7w*OK_H%%BNVBv&57##X6lg
zP1#?tw$y8;%73w~X}>Jn<w<lM;?t6L(Hq;pwYsOGEK8F7TdG2T^lz>T-SKbohwg7y
zdY0wE{9JYJ1EuSRH5$A<ylTNg%j<4Sa7m+0ihq7j$6ojD`u)wjJ9fMG?&)aX>2BWV
zUebuna=N*U-*T9~bpNKN9e~_Ep=l=}TOiLto`dAEKc3XI%a98&i`$TS|JJk&S(1)J
zHbN%D#+&@=MoHdpm(vsC*l#lDF04U+errl=;`phOvhmMvgZ+439lM^nc;gU=T-=Su
zGqvM?0QMSg&>O$8j^O_iGIqoQ0`u&LO{?d|np<KM;;fW;5avZ+u&-t<HCgYmZ)L5u
z<loaYmRT@=cr0r)ez-F>SGF17?>gD(WnRZ9KeTB4*5$2_O)hiE{mkL<$`R)Gxa4<O
zy~pe5<ChAWNeF2_JK=FTdig-mu>8~_>_gA9=$+|x$%mQW`*r3kOlBh{3mfsK+UoRq
zwhn&?KhjU;I}w&ykYct;=v3f@jcaqHUbdlNos2K@&=R4YhHs2(7Kb#N&OR&f6lA;g
zht3dYl&|$m?J1a<ztD-X`3qCbPHBL(LF;3o!f)i-`Bgll@%zSv@6Wzj_Dt4R<Yc}g
zH?q_hIn#_v8eLxj$P$0j(V|-UICB)vXO`j&UXNmD+CYU7C*%htc=U#1XYTCT+@V~l
zl2Lb~Z<HM^b~#4$Rg2Nh>1;!ZQ_g1>ik$@m*p6<#o<5_Gkkzm!VOEu?LXYL&eb8!{
zt;99G4}?vUwo=A@^!aW6nf4R(w|`0AVgA&#i|{&3X_D1vWDxQLb{c*EqCdMvANNi@
z=%4J<67Rx6-8-i54>~Z2Fk!PLvD2pc>zyFGv_P`^^p3h%%p>5rq^}em4ES<j=cAb&
zUktmOXOy2AKC!$|w&_2sd_MM>C5PQCos&NMmzU4CuDa@})wPA5;^DicTTH_>E9+#F
zRc5~^^Ee_FF%Uz(!zRnTj>G!081gYzQ0{f~>sCYNv$k@tEuvc^>{NN_^m#JQ)qXZv
z9+c}?TZPxwsaL0yovJ{jt{Jk1O;&i5j0zg^dORzv^u!y794F_c%C&M9n_TH)kxF}f
zwp)xp+s*z~xjf!DI<0Q@#H!^s<CkF{YhG1qGky>Dvs2KF-8{g?SCvlR4t@I4HL(Jp
bCJ(Rzf2l3HTs-3?*5)rYZCt_L^e_Dn>wPKs

delta 3886
zcmZ8k3v5%@89w*gPIAq|c0%enJQ9bdB}LeIhnEwZ*6jtccG(shRc%8`9Gn)Cj5vj8
zL?$(qnk<lT)U~K<1*^Jc(-1+av@mH}(u$_E>Kdx5%Bo6(j&5eLfIuh?1Ma?a?>)B}
zCp!M0-+%t|pa0%_GPGZqhzb2Uj^lQs4!=f-eW2)f*7h__YEK*Z+GBm)s!6X~X{O+D
zO^TYxDbXVcbU?_H!n(Dc_6SbL$STcu#HUmGd*SoUdbcM1K<OdzdH101Jg7T!TCaz!
zr;@2*(en*;+vbf+4SOzq|Hj5d#gZR=Szbl=npR|IAgF+;<=&$%kwMRx9u}UYC(KSE
zi(WK2g<|#hMOBl_cxpH22whCJu(S&3X>pOXqveHdo{lz8CB0$x(?zTE>2sEq&%!L?
z?}uNuAp0Y{2Bb5$MPl|1(6Pbyz>;HQpF^WV`X0I7PiHMFT`UqG7iu()ZO24?X-=1!
zn?SG4v8L0Vu<}UEX;inSgBR&%Y0exAQ|n`5j+NGyWDO6w<I+)kLB=63A=j0{UiyfA
zZ3UP<$hN%42)SWfb{lf=KG}DlT;ZjEw=b(h0pz{~PpQN=hDDX^OnA=p%YD8zVB|ha
zDI;rAk!-owa>WDwz-UBLF4*$+u^d0tDf}hXze4oV&5p&wSsHdMD>@4R>0DVS$9%tG
ztQ`L?GGFfX{T4!E_MW07niNI($nrKl<yan#C5z+T-^lUKiSb~9MIR3)S)Ip&*EBK%
zXJtH?V&t+Dg&GgeRrLn1#e>P-U?Lv8)6<<yn6UPeSTHfKXQwJ4$$1M28DXIlJF$AK
zJGsqvxB$U>gGo8MZ9;DOBJaRdtvvRh{IT1Xu~c5s2l0t`a3<D0BiRmK0IoMUBlj&j
z0FD*s7{c|MMfpv+FS`%CEKF1@7qFxi2qBV#U$Iky<M9QAOxeM_#h7$3zXBu2KSECZ
z;8;#klKA?rqD*xIKOabwiceSZ?Hs?8<6kuJwK|?8-eT}-wqwA}D%_&NALZ~G4qs=$
zGdVn(couke^bc}XViPpj@=K$?7J^BXOR^nq!DGeBrB-Wub91v+Ezzh}D%PDMw*3M4
zAq^#xjf6~y`qg}1`<Xjx?Xzr09?@zaL%~u}l-LG2K02quFCZ0O;Vmp@USSq7ZbW<+
z5ifs%B4VvHSUL<#oLN|TVX?rn)v&ZN%R8DS1AB`uU=>R)R4W#Mn|fd>!w!rw+JXIZ
z9^c3+gqUhT<a7XSDsVXiGXDa@f7tN9`(OBb;V;48q57M+zd33EVg}$d0Q&J5AWL%j
zI?J^?CE1SrL*p{KD<P-b_Mg$@blZ`$8fS{41yW-71DD^2qBod|CCssuXgl~G#HlA)
zm6$#9Fn-lOOJ#IMS)<0W^pp$CLB_C-J-`^YA(oX^fJ^wyXit%cZK#fw7J<}`OKBbV
z9EU%{;ZGaz_YC;e+kij7>W7nwu7`&fb`tu2Wc||U_gdc(+u`|W4J@K`F8;r+I$#8Q
z7a)`sUG%NG=j5C=dIF(&8?9rB7;OZE`k*GosCpjv@G?~QJ<Axj?-}-bRG-u<;Isr+
zv&5s?zLRPJliGv&HxB=l!#_6QrwsV)EZ}~?%~)P7ThgM{{{+Xs&GE+!e7k}FGs6q0
zP-129PW%J*;$v?Ti&2YXaERfx+0%WEy#{TEzd^$6&B)yTZN%9HH+4hjKD=S0{v5wp
zF-u>`sSp>=(la?%#ic3w2iGOB>K5(KeZSoJzyzM&+~@0EPDo(O#`sr(x{dLhfu9B9
zck1N6RePcS>E@!lax9sV`0LH#=;9vpusz)`9L+aJ+gd}Ba9d|bV`~$M>~13+Eqe%b
zq_Bf@gkBD{l2FU`aD+s{yFww--12gWw6?(9+}62^ggaZCc7>XVie;`lR77NVXb1e5
zOC$s}1E@?S+@fikTbflxM@w{%#xS7Dsmn2x%5-VqF02nI$ZoiGA&+MKB2~t>F@u^b
zXnuZS)7ru&D=BP3$KgAybWLk>1oW0ZnU2XL(@{-11jkP>FJa!(r|*WMu(?y8Odr3g
zD4*g3$EFqhMtyRb>x9Lob(@g@yH|XCMN#%K{;Hx3g64pZg36%bLNF!Q6lD_hB!Z<t
zNANYx$D_3Ztq=w!gtq1vES*Fge9#GbEM2`cJ_xoP(+|C$p3GnVlX`IaeUkZ+MVJxH
zA46Zv6#7^K`b*4OWU$u)Cb-c4s`%)FG*gFVetHIBk^hK!a)uVT9}@d-(M|5h%_FxI
zg}T)n&pE5a?_z#>VwKnNS}xo%TpA&R^x~>KVTcMIuW+1}c=7~FYdv1apniM8he#bV
z9q{BiR_HfocH?3rOvgM=2{Ltf^MrC*;@vKc&_HPx9Tm-V$eS}f>CF)kcDmRJv%4hQ
zBoP_ZDTGyN9$A5#*%QK6+5?-7wA0hD9cPl+L0-$H-<EiUdOBT}Wig>fgF2TDE>P-3
z)`8M&laq|lpF<j?@zUKz6LZUo3~{l*Jrzp*M#{2g!%ZD!PU<hqN0i1gr;Arfvl7w;
zMj&jZfwBhi%L016%mY_<xzojO`P}t$m0_;6<<260+vnDsYM>m#3(EC>q66i5j(z%Z
zu(M@jF+E-36n4{TtW$-K%0%iGr)EpT%ZQD2)LoHh9HgcrWCI;5cM4nBud5SCJ3C@O
zw`%ki7Tq-ft3z~=jQgzb(2KC1)K|6ZnT7Naf1!>_uj?1O^|)SUwawvio~^t2U+TKK
z#C~7o>pCi~AA;J-K;43#Wpcm230+4WrCB0bI()veRG<ON5^G~q6KM!FHAWhTpIN;{
z96q(SQ4l8S`Snh^Vm<!DGi!-*iZ)*Fb(HIc<usEHKr8E7PV*7PD}{A!m`c7Xqt$uK
z%e2-P75wzP&ns=!cfXZN)m4smUE;Ku)>eBnd4)LrPNGMvJy!nwp}9Y)etbbaDqxI(
z(^<5*#%|>;RPUynYAUURZp~xRO%K&nO8kGVL3*yHO5*=v4N=KoCGplAp&R{G#xp#q
fpHe*?@GHU|IuL+or51DzJs+qNr&m+!hKK$KEdPcY

diff --git a/src/main.c b/src/main.c
index fe9522c..57370fc 100644
--- a/src/main.c
+++ b/src/main.c
@@ -1,168 +1,76 @@
 #include <stdio.h>
 #include "utils.h"
 
+#define TARGET 2
+
 /*
-    If the numbers 1 to 5 are written out in words: one, two, three, four, five, then there are 3 + 3 + 5 + 4 + 4 = 19 letters used in total.
+   By starting at the top of the triangle below and moving to adjacent numbers on the row below, the maximum total from top to bottom is 23.
+
+3
+7 4
+2 4 6
+8 5 9 3
 
-    If all the numbers from 1 to 1000 (one thousand) inclusive were written out in words, how many letters would be used?
+That is, 3 + 7 + 4 + 9 = 23.
 
+Find the maximum total from top to bottom of the triangle below:
 
-    NOTE: Do not count spaces or hyphens. For example, 342 (three hundred and forty-two) contains 23 letters and 115 (one hundred and fifteen) contains 20 letters. The use of "and" when writing out numbers is in compliance with British usage.
+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
 
-    https://projecteuler.net/problem=17
+NOTE: As there are only 16384 routes, it is possible to solve this problem by trying every route. However, Problem 67, is the same challenge with a triangle containing one-hundred rows; it cannot be solved by brute force, and requires a clever method! ;o)
+    https://projecteuler.net/problem=18
 */
 
 int main(int argc,char**argv) {
-    int totalCount=0;
-    int counter=1;
-    int i=1;
-    int hundredsDigit=-1;
-    int tensDigit=-1;
-    while (i<=1000) {
-        hundredsDigit=-1;
-        tensDigit=-1;
-        counter=i;
-        int currentCount=totalCount;
-        if (counter==1000) {
-            //onethousand (11)
-            totalCount+=11;
-            counter-=1000;
-            printf("onethousand");
-        }
-        if (counter>=100) {
-            hundredsDigit=counter/100;
-            switch (hundredsDigit) {
-                case 1:
-                case 2:
-                case 6:{
-                    //onehundred (10)
-                    totalCount+=10;
-                    printf("%s",hundredsDigit==1?"one":hundredsDigit==2?"two":"six");
-                }break;
-                case 3:
-                case 7:
-                case 8:{
-                    //threehundred (12)
-                    totalCount+=12;
-                    printf("%s",hundredsDigit==3?"three":hundredsDigit==7?"seven":"eight");
-                }break;
-                case 4:
-                case 5:
-                case 9:{
-                    //fourhundred (11)
-                    totalCount+=11;
-                    printf("%s",hundredsDigit==4?"four":hundredsDigit==5?"five":"nine");
-                }break;
-            }
-            printf("hundred");
-            counter-=hundredsDigit*100;
-        }
-        if (counter>=10) {
-            tensDigit=counter/10;
-            if (tensDigit!=0) {
-                if (hundredsDigit!=-1) {
-                    //and (3)
-                    totalCount+=3;
-                    printf("and");
-                }
-                if (counter<20) {
-                    switch (counter) {
-                        case 10:{
-                            //ten (3)
-                            totalCount+=3;
-                            printf("ten");
-                        }break;
-                        case 11:{
-                            //eleven (6)
-                            totalCount+=6;
-                            printf("eleven");
-                        }break;
-                        case 12:{
-                            //twelve (5)
-                            totalCount+=5;
-                            printf("twelve");
-                        }break;
-                        case 13:
-                        case 14:
-                        case 19:{
-                            //thirteen (8)
-                            totalCount+=8;
-                            printf("%s",counter==13?"thirteen":counter==14?"fourteen":"nineteen");
-                        }break;
-                        case 15:
-                        case 16:{
-                            //fifteen (7)
-                            totalCount+=7;
-                            printf("%s",counter==15?"fifteen":"sixteen");
-                        }break;
-                        case 17:
-                        case 18:{
-                            //seventeen (9)
-                            totalCount+=9;
-                            printf("%s",counter==17?"seventeen":"eighteen");
-                        }break;
-                    }
-                    counter=0;
-                } else {
-                    switch (tensDigit) {
-                        case 2:
-                        case 3:
-                        case 8:
-                        case 9:{
-                            //twenty (6)
-                            totalCount+=6;
-                            printf("%s",tensDigit==2?"twenty":tensDigit==3?"thirty":tensDigit==8?"eighty":"ninety");
-                        }break;
-                        case 4:
-                        case 5:
-                        case 6:{
-                            //forty (5)
-                            totalCount+=5;
-                            printf("%s",tensDigit==4?"forty":tensDigit==5?"fifty":"sixty");
-                        }break;
-                        case 7:{
-                            //seventy (7)
-                            totalCount+=7;
-                            printf("seventy");
-                        }break;
-                    }
-                    counter-=tensDigit*10;
-                }
-            }
+    int rows[][15] = {
+    {75}
+    ,{95,64}
+    ,{17,47,82}
+    ,{18,35,87,10}
+    ,{20,4,82,47,65}
+    ,{19,1,23,75,3,34}
+    ,{88,2,77,73,7,63,67}
+    ,{99,65,4,28,6,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,4,68,89,53,67,30,73,16,69,87,40,31}
+    ,{4,62,98,27,23,9,70,98,73,93,38,53,60,4,23}};
+
+    int max=14;
+    for (int row=14;row>0;row--) {
+        for (int col=0;col<max;col++) {
+            int numb1=rows[row][col];
+            int numb2=rows[row][col+1];
+            //printf("Picked numbers: %d %d\n",numb1,numb2);
+            rows[row-1][col]+=(numb1>numb2)?numb1:numb2;
         }
-        if (counter>0) {
-            if (tensDigit==-1&&hundredsDigit!=-1) {
-                //and (3)
-                totalCount+=3;
-                printf("and");
-            }
-            switch (counter) {
-                case 1:
-                case 2:
-                case 6:{
-                    //one (3)
-                    totalCount+=3;
-                    printf("%s",counter==1?"one":counter==2?"two":"six");
-                }break;
-                case 3:
-                case 7:
-                case 8:{
-                    //three (5)
-                    totalCount+=5;
-                    printf("%s",counter==3?"three":counter==7?"seven":"eight");
-                }break;
-                case 4:
-                case 5:
-                case 9:{
-                    //four (4)
-                    totalCount+=4;
-                    printf("%s",counter==4?"four":counter==5?"five":"nine");
-                }break;
-            }
+        max--;
+    }
+    for (int i=0;i<15;i++) {
+        for (int j=0;j<15;j++) {
+            printf("%d\t",rows[i][j]);
         }
-        printf("  %d:%d\n",i,totalCount-currentCount);
-        i++;
+        printf("\n");
     }
-    printf("%d",totalCount);
+
+    printf("\nYour maximum route is %d",rows[0][0]);
+
     return 0;
 }
\ No newline at end of file