From 4449e40b69abde8760d9eed741ceec9a70007aea Mon Sep 17 00:00:00 2001
From: sigonasr2 <sigonasr2@gmail.com>
Date: Sun, 17 Jul 2022 21:03:26 -0500
Subject: [PATCH] #15 done!

Co-authored-by: sigonasr2 <sigonasr2@gmail.com>
---
 archives/15/current             | Bin 0 -> 16040 bytes
 archives/15/src/executeall.sh   |  20 +++++++++++++
 archives/15/src/main.c.disabled |  35 ++++++++++++++++++++++
 archives/15/src/output          |  20 +++++++++++++
 archives/15/src/threadedmain.c  |  40 +++++++++++++++++++++++++
 archives/15/src/utils.h         |   7 +++++
 current                         | Bin 15952 -> 16040 bytes
 src/executeall.sh               |  20 +++++++++++++
 src/main.c                      |  50 --------------------------------
 src/main.c.disabled             |  35 ++++++++++++++++++++++
 src/output                      |  20 +++++++++++++
 src/threadedmain.c              |  40 +++++++++++++++++++++++++
 12 files changed, 237 insertions(+), 50 deletions(-)
 create mode 100755 archives/15/current
 create mode 100755 archives/15/src/executeall.sh
 create mode 100644 archives/15/src/main.c.disabled
 create mode 100644 archives/15/src/output
 create mode 100644 archives/15/src/threadedmain.c
 create mode 100644 archives/15/src/utils.h
 create mode 100755 src/executeall.sh
 delete mode 100644 src/main.c
 create mode 100644 src/main.c.disabled
 create mode 100644 src/output
 create mode 100644 src/threadedmain.c

diff --git a/archives/15/current b/archives/15/current
new file mode 100755
index 0000000000000000000000000000000000000000..64a880868d50db1e776e3cdb5e1f121864e0d2a6
GIT binary patch
literal 16040
zcmeHOZEO_B8J;@~7y|eJL(E6vnuZ7(`LMxQgyM48URYOrxL_+#HC@iWweOnyaPRhl
z9hJtFlPISPDQ%<%sjb@P4^o>SmKsI$N86)NKBSbIe^iaowZhV&($>&6a$3UneP`bH
zSZ~fmYOD6oj<om8`^@{y%)UFjp7qYWpzYh^_xS{;IpVVdt<ivD!c<Uhr3^q=Y!{2+
zcfD9A=7C)!IaMB30HrEj_s_&y;^zROt^qSuaIK;RBli#yb+e^cutSg-1)T@#=3)Wa
zZoEeQWaRQndqEUK3d-LKu0;n(j7}YPWxP=qi}ALZc#PVM5wZ?V)D=lrBpu@vwa3Wu
z#F*f*o#N@nCMd(i=+?zZ=f+MY6O7mfro)p~^xtW(n{<JotVXzTr=kTTxA%F_(WNDi
zhXY^cL)6}E*P)x@&q(1Fn-lTA)|SnQXk#Lt$_+OTZ*OgEZ3$)5p)Imu>{k#D98-G_
z^a`k^h#ZAc_(zq^^<h~(m7{-K$9E>b5h`pP>3j2y1+Ts2Yuq$`1bwjIs6ii0SRW4&
zv@t&)4)js+_&Veihj`7rnnau}Vg1Xh6q>*VtMHEjSIvLxEIjrm2!}hJ0wU-p!S=y{
zZG0pdM*ncc7>K7LiTLxTFbudL{YKV`WGo{YiKl=8qyJf>KlZFK5Q!(mP$r(T1_b)y
zb!ruR_jR>*7+XSHLfb0&mP&4Gi!i!+_8U<%V-Ci%mYM0<-;qeC%$`VJ0vjAmrc>0Q
zp<Jsv;x+NXb*h11U**|^%nmpy9*4Qr@dbE?b`n<~k1xin+fDY{-~2XQPQUm91%jU!
ze4id$stV51^MLsv@wH)9&OF=KcPSpn3dWjK$-z6vSJ}bK=OqcI9K0HLs$kl|<GAE>
znRw**p1`sR2an_3OI`%L2zU|jBH%^9i+~paF9QGD2>i8f-9PlP+qHUO?r%2>p}$nL
z{Pu)CcA@sX?1;VXTR`8nH@pr|w_c!s3`_3b`n_%2r=*P&%e%L(u?^nelio1d#d5Hp
zaoN32yZKLD`D<U&^MBCCZccUgXwAjuEBeW{T~MvPVk>z5Z6H*){zcgz;Ew{MpPYLL
z;i+kB1$2ES=Ar8g>{8wOQFJ^{2>zR-|F*{vHr?0rQ~J3-@6yjr&(VDs^=tR7dZ=JB
zq$;SjO9OT5q2H{>{*Sg{vB*8ytB<w)60>@K(psb!+Ae}oUI6D^j>6ByxjzHj_Y7!f
z=x-f|LaeA4bP()7{=~g}Zd%XxPK}+oSO3Dwf_Cqu?$ZmsQw420e=+}?@>NhknXuN5
zotTy$(-n_<`K$R$<+qeaeXapLa?A9BHl-IJFx^lQWb=VjSI#>cZOWf`PtWHjqI#ib
z!$x@y+H`aAl2(SixTKX7+*EKI;g4Giy`}ubxsu;E;Vb5~5>yOBqX>f~P|$Abr*+>%
z-8-W0=f$ydlTRy+X*aR$DlRV;b8i>4QeL~QU(%+qZv7;j?EX?gE6cOFao@Jp`QOf8
zgo}$WM|%F!S#&L5{?N8%4m_r#`jhpt|JK~{_o3j*c{#@97_N+3lzGXEfENKT0$v2X
z2zU|jBH%^9i+~paF9Kc!oDuNBH>ZUQH$-=ANJNqMt(o%~{Pv39cmh+lJp>pAJPp_l
zI1V@jcm(k19oxPPcok5-MM56Gabog4e@OU-1HLtj=GUHr7kT9ITRztL1Uhui4<I}a
zM++RM|6<!sNGu8LS<>*ix<`)Jj*4BYcYJ#5<MQ($>c0rb55P|f(H9c(796M#0&>E(
zUWFqM?d6cvmIPk*cPyUgPe6}UU)}=x29!_ED1T3uBjqJ80$v2X2zU|jBH%^9i+~pa
zF9Kc!ya@b1Bf#qbdEFnc>BF^#m=-ChEIfqoXfj=(MVzb1=JkbZ$c9%UnN}0>IzxPq
z!o=l&zi+3}9;ZcpyhiYJ4YIr@Rfy|UzEIKPM}&_MHW02LWZ<=e<FrnY*Cxt$LvX_P
zJxsjT@KI%oBeW=y`P0-f?st*=U=gNF-2OVU+3%mWIzNc3q~N=xJl`W!AAEI{Hpd-a
zAEn(+<sXpE=Rwu~*MQf7yDMy>m*TMV<=E}?5S!PF?(OK<5!~3@mrGf>U~@C9oo#At
zekv#J=1s&rq#le*jksgGT`=yrI`&lxOpqLw16K3L>*9yiv*WJwK^^iX7mw?ak>~pY
zOqsgi*C$qsKv>y)-EeiaPplL?&Q+-pUxf_T!}l5UuSowDm392gpMgxZ{?B$^@5p-U
zMZ+h#h6h-!o(t0dQQ^Mszm~G)g4fS;EhXvSAo%`a{(Z<)TgSZ|0up2=2PPyBPm8dF
zgzRSE17cMro?O}r{4)Pi!Ot1ycOuV*1D~FS|1#C@ZudCwL5H5RF9W~Sze@1<W&U;K
zv1Jm`<4L>;d;rEnLzq1k4gtRmN=9j1$^TJ7(HZjR@x!X0kpB%@e?3VBXMxB5xcx5x
zA7rruZvZd<!R6pE`vLIF{O~k)jdL4$Amh}o{NEM|4)<rQ=1>~etw;Leh7}nUKxD1l
zz(A;9JXqsySV^NFSGi}wGnzIA6Y0K4!iZYwOxB3xhDComIg~IhGa72D?tyFa<3=Qt
ziHsO#%F2w0flMT68qr)bIRX-gWq_wO!_|sq%t+LX;tGD~mtpKVw0pm1Xa_nCSYzLL
z^uX@@T^&Hf_6I}LsZ{SgB#gcL4z};!XB^zK=djje^z3fmr-8z~D<I5k{y%PYzZs2K
z5h2e7YMHr{pi)T-?J1}bxRU_F22!;#0F0Tt1dM1lZNws}DDEKWItX6Tc*@9S&8UE2
z!H?0G&61XOF~F_^K7ZVfP<4;N%*_xpyMr+n$@Fuk5TWcy(u(u}S{a2g&cW6QGczPY
zskCK=22;7vP$oTOW~>nh)t8IIewTQZsNL;djW~{^dn}TTiBNPT1x+ZlGOFY`Gn0*{
zQ!@+$$}(mmf&$77B`gt=eGNf2G?)exGg-4=ge-FyOdMF?otBp-WX5PH#iCFfTdEE<
zrj&y7&{QNDhsu;3;w(Zin3FI@@&5P^6V8+1)`PzdD!KQq@jQu&r7!0ZKLrQQO;|tM
z{w(yx#Pbnl34z=1oO<^@E&M;aGx76|Is7~5)brnA#vnTqy7f;3|31uZxc@x=W90T}
z8upR?M?jBrKi2d7kg*75n6Qr+XFh+Pr^SK8sRQeIzRAe*OK_11>u{#8fPr&2*7JOg
zksq_%fA(Yi8t8E@$TrUh8N<|=yZ=OslaRrfvYzLsj74(f_TA_I2I<?$kLSCLO%6TA
z%&q?+a2OM=zw&p5PMqHZs2bT<&Le&o4yQgyI!11vHB?+_=8Q|<O%9CgKbwBsr9Vaj
z#vls`xjx39y7Z$|z}UeT#--<Kf8o;eJcp6rv)JE#|NM&dm1ctEN%(PkobO@$S<mx6
z#+_6hgS-9Tx%AyZ<;nOi3kiArFpcw@C2;V24ZlC~zDl=0+l+TWTj$X8y!&h;kdW9<
zSr2UHKZF7tyWBp{hk2hY?}x?v4-@P7`u`X>j34WHemuSzz2V!Yg32%J8Rvo6sTW~#
zZBoeXa0RSmdl86{<Mw%e7$CjdAKP-KrPMyTSBhBwM1@fq);p2Mj?;BJRd|Xz_6aD2
qS#u?R{QSlDH}1Pre;HrAAl0}k=XO;o&c&<i-`%D>R=Wf)Q~V2cbDvWH

literal 0
HcmV?d00001

diff --git a/archives/15/src/executeall.sh b/archives/15/src/executeall.sh
new file mode 100755
index 0000000..1f547c1
--- /dev/null
+++ b/archives/15/src/executeall.sh
@@ -0,0 +1,20 @@
+./sig build 1 &
+./sig build 2 &
+./sig build 3 &
+./sig build 4 &
+./sig build 5 &
+./sig build 6 &
+./sig build 7 &
+./sig build 8 &
+./sig build 9 &
+./sig build 10 &
+./sig build 11 &
+./sig build 12 &
+./sig build 13 &
+./sig build 14 &
+./sig build 15 &
+./sig build 16 &
+./sig build 17 &
+./sig build 18 &
+./sig build 19 &
+./sig build 20 &
\ No newline at end of file
diff --git a/archives/15/src/main.c.disabled b/archives/15/src/main.c.disabled
new file mode 100644
index 0000000..eece796
--- /dev/null
+++ b/archives/15/src/main.c.disabled
@@ -0,0 +1,35 @@
+#include <stdio.h>
+#include "utils.h"
+
+/*
+    Starting in the top left corner of a 2×2 grid, and only being able to move to the right and down, there are exactly 6 routes to the bottom right corner.
+
+    How many such routes are there through a 20×20 grid?
+
+
+    https://projecteuler.net/problem=14
+*/
+
+void move(int x,int y,long*pathCount) {
+    if (x<21) {
+        move(x+1,y,pathCount);
+    }
+    if (y<21) {
+        move(x,y+1,pathCount);
+    }
+    if (x==20&&y==20) {
+        (*pathCount)++;
+        if (*pathCount%1000000==0) {
+            printf("%ld...",*pathCount);
+        }
+    }
+}
+
+int main(int argc,char**argv) {
+    int x=0;
+    int y=0;
+    long pathCount=0;
+    move(x,y,&pathCount);
+    printf("\n\n%ld",pathCount);
+    return 0;
+}
\ No newline at end of file
diff --git a/archives/15/src/output b/archives/15/src/output
new file mode 100644
index 0000000..20a53d8
--- /dev/null
+++ b/archives/15/src/output
@@ -0,0 +1,20 @@
+1:    35345263800
+2:    17672631900
+3:     8597496600
+4:     4059928950
+5:     1855967520
+6:      818809200
+7:      347373600
+8:      141120525
+9:       54627300
+10:      20030010
+11:       6906900
+12:       2220075
+13:        657800
+14:        177100
+15:         42504
+16:          8855
+17:          1540
+18:           210
+19:            20
+20:             1
\ No newline at end of file
diff --git a/archives/15/src/threadedmain.c b/archives/15/src/threadedmain.c
new file mode 100644
index 0000000..c2e931b
--- /dev/null
+++ b/archives/15/src/threadedmain.c
@@ -0,0 +1,40 @@
+#include <stdio.h>
+#include "utils.h"
+
+/*
+    Starting in the top left corner of a 2×2 grid, and only being able to move to the right and down, there are exactly 6 routes to the bottom right corner.
+
+    How many such routes are there through a 20×20 grid?
+
+
+    https://projecteuler.net/problem=14
+*/
+
+void move(int x,int y,long*pathCount) {
+    if (x<21) {
+        move(x+1,y,pathCount);
+    }
+    if (x!=0&&y<21) {
+        move(x,y+1,pathCount);
+    }
+    if (x==20&&y==20) {
+        (*pathCount)++;
+    }
+}
+
+int main(int argc,char**argv) {
+    int x=0;
+    int y=0;
+    int i=0;
+    int id=0;
+    while (argv[1][i]!='\0') {
+        y*=10;
+        y+=argv[1][i]-'0';
+        i++;
+    }
+    id=y;
+    long pathCount=0;
+    move(x,y,&pathCount);
+    printf("\n\n%d:%ld",id,pathCount);
+    return 0;
+}
\ No newline at end of file
diff --git a/archives/15/src/utils.h b/archives/15/src/utils.h
new file mode 100644
index 0000000..d785fa2
--- /dev/null
+++ b/archives/15/src/utils.h
@@ -0,0 +1,7 @@
+#define true 1
+#define false 0
+#define boolean char
+struct String{
+    int length;
+    char*str;
+};
\ No newline at end of file
diff --git a/current b/current
index ed41d39e4320d10ad01a6e8bbe0e3226c1855466..64a880868d50db1e776e3cdb5e1f121864e0d2a6 100755
GIT binary patch
delta 2240
zcmZ`)eM}Tb6rWk{fHhEd`S5^Z@6@7F<Lw=w$iW3FZd{W#9&Jgni9sq@s5DBwYhzjh
z1T}6>TJR<I+NP=ckF_z)T``7#G-suN(dzMM6GN_vBu7e9uuXGqXt!_ngH&Q)GV^;M
zzj-tBc4jv5;a7bl#o~ZKbZInzq(&<)^Jg**>&)nn5<kNk#tev5da;ZemW9L|&)jTO
zbej>6`k%yuW|l4(qz*A|vf?Hy4p-=d^@7V7vl{CSH>rnDxqa*ZZ-#(5Ljd@UqlNya
z&*wgNhqs(~^U^2$N2lnvifAjG&Dc_ug~_bN5;CZ#&VoA`4YU)QZ4PkRifI)rWjN>{
zv*`%-%|ct-@nHL*BW;Jej<g+a@9u$%woSAeZrWb$=P+Fcv0+cKH-ve7sG7wgq0(-i
zV05?XE9~yhCCCYw_O;RTSUirrVGJi$^|DR-plB%LX1y%GOC<1teLpPNb8;6O3=aDW
znedC<k;}Gf$ux+W4nARWvPNUhF;8X}e@@tteNH0eu~rW7f>2uB#cK0-en!)@k>B#3
z`wIhKU_8%>OE>KUtLzqN6*dMMaG+LHg|XicyYrkU^@){X|9<o+!}eDg)TV<)O4z=Z
z>8IjBUQ6aV2N?0TiO8?e`P(<ZU7?JdbHlu_u42xOoY2-5Wyt>>Qx$bCn4^UKlW3%P
zTxzNVyGi>Eki_zSLG4>sLuo~ASsdzHF6>_$mY0VWs)Sn>!*W`kR3D`7BOPNTST@v`
z)*0y)#<F@}ol0Fb7=@u?#t7vrVR=yr<4yvY2vt=WxpSKpqy-nF3@v!nzK4n$N^~gw
zVO#kYeUWn78=sO>sFNu<X}}``78v|o8E#3ciCamICTLuhlbAW748^mRun?9XDG`Mx
z@~)G-oAIHPhswzz`4OA^DU_4((6z9fROJO_s##uS$(3Q;?#s!roYMC*`;Vp>6<AOw
z@q4iIr>IlojGCJMThnw68R-sXYoWe@pgr{^2JYM*tI7B0o^#pcHEYT{eC0hIY!H1m
zqmErncHD$TO*@9zh!{Z(AVv|7A+{p!U(&Q`#QTUT7<6r3$3|>I580h1FnAtYHMYpF
zn&yG;T^kQyKur&^FiIh|AU4KuAzD&~%2{kGW(+Z>{ETp#Ys$^!dUCSxp0M~;Y_k}j
zdm{c2<73VFpXHQT*9)(cF6<64@xjbCr#O*sSS1FKC{VYPj>CGlL?h6Q`q$9wmc*!e
zxy*Nncp&C>imj|bDAr|+z)$Xdv=zLPlkS3M=`AkqhZwgO5>hs8gc<1pjlxBbqa^v?
z-D83(Y#hEQE|~F1I6d_`Ru;}CU~&c<B}KSIueX7}u3Lqq7*2RM@14*s2eIB<G<Eqw
z?+b|a>Y8qnM1_)KVr|Rv|DivQ1wbnuB|TUv7s0|bT2TWf@M3faM)Nt5SOv5=_0V4F
zps%yO<Za{#Ps#AUp8qsPMXrQougVW_tJ1+=(#MwK{$iB{2l6q`fLSyBXyJ61O@^>)
z{22Nff7blq`oTc{xH;cy{sdc%eHNn|@LLtoKVh)SA!=rpZZk^=MytNb4tBlU+1}CF
z0S(o|rK|rNjeB0&yQ`_K(p?RAtFPGJIr?7b*zxT*I2s4<PDzZ|a1kgL;=w}iF1z8i
zP=FYETTQQpjj*&+;v=Rv0u{A2D~HcIgdXUv?WZ1Cs+HiN&jSIU02i>mW)on*=gPP0
zXJHcu-}>CV^#Lbf-nWP5LT`-|0(F9D9T^Mjp|=hb*9r6<#Ofs8`i(_lzODw6bvR+Y
wz*`3}4&C)NE4L<!?>>_N#OgKt>&E;wYo^(mN3n76*uR6nx7{#HVaf0O7yTm;dH?_b

delta 1949
zcmZ`)VQdsd6rS0;YrD13-O^@zP`oX8(yHCP(n8z2mKJ2g9@_MXl92ePSgh?2TdloN
z5^H-oG@M7J<wb+~i(i&RNeCuhVok21^r|M79}-B=5UA#~jTZFBK_cs$y;+JRzGUW`
z_ue;e-pst&ogQ6yW3p22mWVAKc_5QhwI7Q$1$nJz>Z&dpLS8XIruxoCn%5j8d_FU?
zS*g0bKh^eMJiw!LLyRhNhO;u9m4P$#hw6x$pYt#_=FOxLJ`lR9|8E78uV8}c8Z6&X
zGvn`^za9BpTe|V=y??d~$vv0hxT~guCFvwfNX!mh0Q0VPx)=7j6;R!kw3m%&)Yiw{
zLHN$?hr8~*eMG>iE^Mr4VFXf($d7<T*Y}GAJq_IU+0^^Enn2p^MeuC+Zi~3yA?F9_
zhwKDqJugr<Y%EZqs-VQ5;{jOetU0p4?S*J?oxfCeQ#>hcD*8|-<hJGi2%eDEm*e15
z)JuK43Hht^(YvTeVMN*-`4;C`70;pX?_RCcchrt)PP83Ci#g#LV$hNst}v6H?QHy3
zdRVlsm-@yT@d8KWhi(40U9coo2_79pd1I{yZ6x~Sely;7L&Kq&_+_}nOt$@sO4e&x
zR`w8f7d<~gm+T)4Bu1~9iRi+dvB+YZbH)n8IU~!i>9+~&l1A1%WhRW=oUzP&ORZ+o
z$i=TyOe?Cev6=YFoc+DsqzmRHRE*pbX1*Us3noo7YdlSvIc_XdGd`N5(Jzz6a>!VG
zbL=S`B#cF8jTM}?k~9_*7x5S>*0Sv9Qf$#|<ep{4F{{{UwtZJADSfvWckv**@Im$_
zWZU!RFW_W$_GWy!$c%qo#Pn4;|8v=<H85Fl{G{q0W9H6-BWh3I!TtfY|8;d>@UZGX
zq}KQk)oPkn%>2d0tBjt(=)f@JA*Xk6NF9j2^5RQFs3DVXaD~{*@nBo{)3W*yR}d!=
z$%<u7BS?r5#5;&-Lf{$IzcGcJ$I(W17utpW7!FySZnUc~p>C!J;GC*x5!7u0<Dyhy
zJC3a$W7)T4td-sto?cTR+$<?9!t#8l#OqW%;g!#Bm`N?n*ZJh;vb^Ta14+T1Iv-7g
zSJUY@gf$;M0sWdTr+D4-2Tv;DjOLRi{xsNYU=o3=S{GHJR`*c}!urcJ1Lt%fT+uUh
z5>5vcZ~DRXaRz(00(;GHDWK!Jv|d@wn1w_+hK-U6%&oq@T|8@R<s<+{>bHbvY)v7~
zR}EELzOnmt#QCmqGr58TN-Bx7AIJU&+;S=O5ujTYZy1kAC3qqojyI26pdP&%ddmcv
zI49?D8sXqph3<hV?4M_GXb;RH|5fD61dmzGGu?c`7~Dc{CyR#r@8;)XR{=7PLUn`U
zo#fsyzdQSm(fc0kYf$KEdzCLB)}Y9j8B-`({V>98!&x}oI03$G)91h6HY3n!NHpv6
zIA7nv6Y!dQ9b9X!k|kEPC=RX#u|=0vZgnsK;TBztaBBo&Elu~!z$u4Hm~R<_Oi+cs
zpd@zit#v>w*aRcN0Azy_q=J(0BZcCSCORkC3_C-6Xcr`!d@vo7AQzHoBg}_%`Iu^F
zMjZSE#8w?fS_9D6ilML_YYm7_4P;=pwdsDvrr4Je1^-cP7VQRcM^o`BR(2@YDD2&_
Loeo26$CiHqISsHA

diff --git a/src/executeall.sh b/src/executeall.sh
new file mode 100755
index 0000000..1f547c1
--- /dev/null
+++ b/src/executeall.sh
@@ -0,0 +1,20 @@
+./sig build 1 &
+./sig build 2 &
+./sig build 3 &
+./sig build 4 &
+./sig build 5 &
+./sig build 6 &
+./sig build 7 &
+./sig build 8 &
+./sig build 9 &
+./sig build 10 &
+./sig build 11 &
+./sig build 12 &
+./sig build 13 &
+./sig build 14 &
+./sig build 15 &
+./sig build 16 &
+./sig build 17 &
+./sig build 18 &
+./sig build 19 &
+./sig build 20 &
\ No newline at end of file
diff --git a/src/main.c b/src/main.c
deleted file mode 100644
index 58767cf..0000000
--- a/src/main.c
+++ /dev/null
@@ -1,50 +0,0 @@
-#include <stdio.h>
-#include "utils.h"
-
-/*
-    The following iterative sequence is defined for the set of positive integers:
-
-    n → n/2 (n is even)
-    n → 3n + 1 (n is odd)
-
-    Using the rule above and starting with 13, we generate the following sequence:
-    13 → 40 → 20 → 10 → 5 → 16 → 8 → 4 → 2 → 1
-
-    It can be seen that this sequence (starting at 13 and finishing at 1) contains 10 terms. Although it has not been proved yet (Collatz Problem), it is thought that all starting numbers finish at 1.
-
-    Which starting number, under one million, produces the longest chain?
-
-    NOTE: Once the chain starts the terms are allowed to go above one million.
-
-
-    https://projecteuler.net/problem=14
-*/
-
-int main(int argc,char**argv) {
-    int maxChain=0;
-    long maxNumb=0;
-    int counter=1;
-    while (counter<1000000) {
-        //printf("Calculating %d...\n",counter);
-        long numb=counter;
-        int chainCount=0;
-        while (numb!=1) {
-            if (numb%2==0) {
-                numb/=2;
-            } else {
-                numb=3*numb+1;
-            }
-            chainCount++;
-            //printf("%d>",numb);
-        }
-        if (chainCount>maxChain) {
-            maxChain=chainCount;
-            maxNumb=counter;
-            printf("Max chain is now %d (%d)...\n",maxChain,maxNumb);
-        }
-        counter++;
-    }
-    printf("\n\nMax chain count is %d for number %d\n",maxChain,maxNumb);
-
-    return 0;
-}
\ No newline at end of file
diff --git a/src/main.c.disabled b/src/main.c.disabled
new file mode 100644
index 0000000..eece796
--- /dev/null
+++ b/src/main.c.disabled
@@ -0,0 +1,35 @@
+#include <stdio.h>
+#include "utils.h"
+
+/*
+    Starting in the top left corner of a 2×2 grid, and only being able to move to the right and down, there are exactly 6 routes to the bottom right corner.
+
+    How many such routes are there through a 20×20 grid?
+
+
+    https://projecteuler.net/problem=14
+*/
+
+void move(int x,int y,long*pathCount) {
+    if (x<21) {
+        move(x+1,y,pathCount);
+    }
+    if (y<21) {
+        move(x,y+1,pathCount);
+    }
+    if (x==20&&y==20) {
+        (*pathCount)++;
+        if (*pathCount%1000000==0) {
+            printf("%ld...",*pathCount);
+        }
+    }
+}
+
+int main(int argc,char**argv) {
+    int x=0;
+    int y=0;
+    long pathCount=0;
+    move(x,y,&pathCount);
+    printf("\n\n%ld",pathCount);
+    return 0;
+}
\ No newline at end of file
diff --git a/src/output b/src/output
new file mode 100644
index 0000000..20a53d8
--- /dev/null
+++ b/src/output
@@ -0,0 +1,20 @@
+1:    35345263800
+2:    17672631900
+3:     8597496600
+4:     4059928950
+5:     1855967520
+6:      818809200
+7:      347373600
+8:      141120525
+9:       54627300
+10:      20030010
+11:       6906900
+12:       2220075
+13:        657800
+14:        177100
+15:         42504
+16:          8855
+17:          1540
+18:           210
+19:            20
+20:             1
\ No newline at end of file
diff --git a/src/threadedmain.c b/src/threadedmain.c
new file mode 100644
index 0000000..c2e931b
--- /dev/null
+++ b/src/threadedmain.c
@@ -0,0 +1,40 @@
+#include <stdio.h>
+#include "utils.h"
+
+/*
+    Starting in the top left corner of a 2×2 grid, and only being able to move to the right and down, there are exactly 6 routes to the bottom right corner.
+
+    How many such routes are there through a 20×20 grid?
+
+
+    https://projecteuler.net/problem=14
+*/
+
+void move(int x,int y,long*pathCount) {
+    if (x<21) {
+        move(x+1,y,pathCount);
+    }
+    if (x!=0&&y<21) {
+        move(x,y+1,pathCount);
+    }
+    if (x==20&&y==20) {
+        (*pathCount)++;
+    }
+}
+
+int main(int argc,char**argv) {
+    int x=0;
+    int y=0;
+    int i=0;
+    int id=0;
+    while (argv[1][i]!='\0') {
+        y*=10;
+        y+=argv[1][i]-'0';
+        i++;
+    }
+    id=y;
+    long pathCount=0;
+    move(x,y,&pathCount);
+    printf("\n\n%d:%ld",id,pathCount);
+    return 0;
+}
\ No newline at end of file