From a10fcbb56fb314f0ac3b9427e092a08957bf489c Mon Sep 17 00:00:00 2001
From: "sigonasr2, Sig, Sigo" <sigonasr2@gmail.com>
Date: Fri, 22 Jul 2022 19:09:13 +0000
Subject: [PATCH] Completed 29 and fixed some library functions

Co-authored-by: sigonasr2 <sigonasr2@gmail.com>
---
 archives/29/current     | Bin 0 -> 21368 bytes
 archives/29/src/main.c  |  42 ++++++++
 archives/29/src/utils.c | 207 ++++++++++++++++++++++++++++++++++++++++
 archives/29/src/utils.h |  18 ++++
 current                 | Bin 21336 -> 21368 bytes
 src/main.c              |  20 +++-
 src/utils.c             |  21 +++-
 src/utils.h             |   3 +-
 8 files changed, 303 insertions(+), 8 deletions(-)
 create mode 100755 archives/29/current
 create mode 100644 archives/29/src/main.c
 create mode 100644 archives/29/src/utils.c
 create mode 100644 archives/29/src/utils.h

diff --git a/archives/29/current b/archives/29/current
new file mode 100755
index 0000000000000000000000000000000000000000..fc3dfa9f81faff25c686914bc986279c451cee8a
GIT binary patch
literal 21368
zcmeHP4|G)3nZJ_+2#T4Y(4uxrs<MkkVxZ^}DK!)F;Kd!3B2inV!!Q|0w)tl=(?XZ9
z=$M|o^BB!;4=tW;chRG#?5;iHo}){Z$RyBAM7A9)b)&U4ve-@xwvom)?V_{4@80`O
zW?m-Rv)$9Pd(PZ*Cf~ik`+eX2?sxycym$ZF@UAUzxdewo@i`$=a}`phGY<a+a|lr-
zR*FmTccJ*Cm<hNDzbc*Wq(cQNgK4qmD+DFE1r*6aKcQg3lr1Dma?^#XSt^IAC{<~a
zn?X^XcGB==ijOJhr^~BQ`NB!H{eo#mdE}d()k>~seKy^r{nD)|mq$sGJD}wbXgQ{1
z+7V3IpX3wzt<-inX&Le;l*zwBIOXora!y*K`I%A~6mEYrRR2FIZ-bV*PW#bG_bT;*
zDVO(o$dO-u-=Ld8Y}DmV*A8vk|4g-e#q~{%TW?%(eN+9?rpA`=j-@+R-njI}73CeR
z<;$fBWEYh|eQMpUbpmQ)gmE{Z_&lAa{5>zlzc3-r{PgdB9%;Jwu}8xje=_?;)<I<w
z4+WCvE<tIEUyL8|sQTZBn8Jvj3jVN}=yc(3WL%mflg3pp{42oAa`2N4x%jV}2Ctn4
z|6AZ?_&LL80OZnt%{2HUz{~J+hMNFf<pe2>_6$(--6(v%j*vg_WnZA-%f4;?#wO7g
z4h0(g?V>&CZ)$1{h_?2|me4lQtWrK-V29tgt+B=5)cCa^q)8L0Xb<_C{f#YRTYE4l
z)_H5I*Z7u~uSmz1m){_KwVT%a>VxgU?TsCwVEd-^YnobHf}8wXn@G|2=GGRi$fsCy
zGQ#)**$)aeRVmd=T)<r5;Ql_ZvGEe>MO!o$zM^q9$^RwN6nGxu@jtBR`TcsHVf=u`
zi#I4a#yLH7o5HD2a-Sz;I0MfdugMHtPtj7rSO$KPMAV;&44nENhl3g?9aL`)hcfWY
z@pCu>r}4%imVwK4L1zqR;9O_QN@U=0Xg=gUkoQ2|19=bRJ&^Z6-UI({J@6a%Cx2%~
z&J~;Xj8|?J!t9EL3Q`F(a=iGMtW)ZScEIOTi#kBu3kC5vP|o?0H&Urok4)1>?EJ{7
zbec9`=STX|Y1$y3A9*UBrj6M7kw?;L+JK!O`5R87w9T@#8X?O=`u)#Q>67Vq9qG3n
z={FtepE=S$$xJVMyVg4OCDS@%M$V3H*yN4QSc{{G8NK93*aVx=)qOB8HUD2AGTwva
zD~OoU87~p3oCwW_>mH;yTsJ#4>|VGB?BbZF;QvR-f5W3huKmEY#>~E7-E8(v6q>F9
z^VA2Sc~B743W`(1+hjdip8UIKHD!zNk~%Z8x|*V<^=4>}X|G<3MDm3XQmJG;oHsCI
zHPWulkWH6Q@*`hGCPnHXhsLh5I!~HbIChi_O}+|o(=vw5xRE3vZX^^rP0cv+qJ-q*
zn~|pwx9f&%<Fxg%6;JLe5yI*-t%S9H3>qfl#%m-wy4*HiGxwW)!$qdmZ`x4pO4y~Q
zZ5G?%F{CG~_e^Ub`G#AF2V&tbMvT{7kXU6Tb`3;~1mcNoY3pSZrB!P?C$pm)NZYU(
zol^jcc-@3)xlHTx#b(4vx<*|+5o5>|=^UzeKWM-O5#uycr;%EM6hx9R0}XTmhvCCy
zdGh)9Qz;pH;TZeNbEoGHPn~De?dE;w7NDb}{jA;?*<wGfNbjJuEN)s)myuqpcQJ^S
zFs&1&)m18?eG5S9O}l8(Vw3}C4K9nB)-dvwjxH%_?;}a%_Lx@Pe$!UMwiE_>0O-Mi
zu2tX>_C8W<OS#Ja-PcWFW)<0rr3%~ViMF}y&I4v(z>Fl}v92vtZeXC+I_~KuPay7%
zUe~3fan01An7}S57Vjzs(JZxAzvnp_x1%!G{to4u)~mJdCtorx1zH*$1b9rfo77eN
z-Wk(%iW~-utgbO~XuN9zB&~kHBfG2D{to4O?Z+wCYn_3nm%Y{yNSqW>^u1rOvX{+3
z+;l(LZ${_Ix*VosvaF3O@f^jUmHOZNjrrwRDRtKS&WJIx`ajHTe+=8r%G04s(eQM<
zHY0nlnLw8nqa)zF?@S7D^V-vs@vfIbrHdpQNfw)~VKY)JsEs4BLbESffbmd(y0yV8
z@veKc=SFXjciqMD8@$%9FgKtxOD=mK<(PpJ_C8`a123T}FPp9t@uD6wJ0c}9TzV>H
zY<Dao^#VCiDPy}HMHCHeb!~!zk=xLHx%(JB65l}h+fatVv)}HbB*vaA;eJNApN~b&
z1n`5l6wkmT$qM(AgVqW6^RhF#5>}TNl3I79mlCsg-)T$K3?$6Pm$q-)w$1E&tE}&L
z1$`3>ukE)I-BQ-xN6coR-)xL2o@ANT*Z123D?xmH)*#&G8g#`-L=~gGq^h<=+Gh1D
z+oPsSJI@TfkapN9RfsjOJMulMp)1l$M7XV)AbWb{fZDw@r(XB-QOZthm2F_n>4|)g
zTnbG@py@I6#<+2aRzfp6;|B{sEaPyz%cN|Ckt1^M7{&;r;kUtM%Pd!d+!J{VW3X-y
zMXi0q(1gyP1R+5MCKNct;QnV-Pln(hwI@@py5n6nx>lnfNB`)yW!l_7P*hM6k#Xvj
z8Fj3b;I1FXyQ)~waQ1b|k$s&!mTtNec2Q3xR)JMUmLr+=ch4z^NKLBm6S(_Oc8ONM
z7cz1xM{dge)Sx*#QESD#_WEwS?hxkw!(MB^YyAjpUh73#kbZ7jeaT<K<9bOuL=EV*
z&PG&2$w5W7x%b{cjR6f9B%iGaciP4wj18<%J?{axx^{pm-t}4hrQR^Q9Ht+(Wm*m)
zdmm*{4WqX}%|2qspoX$;R7;9MW2KDkK1St`?(zS`Y;PQ*L5t#SSqK@3d?f2YAD1f$
z8UJH|gZ1WT)M68wk^FZETZ3jaICQt?9?xdamps1B=>_g~><AjLs(Gvl<q{N!-2qmL
z&VzapQ|r-y(TmMN40RGmsb<LoPzxJ|?79Oq3H7`8UJ5*J94D5Mckw4;#Lz}D>ch4%
zWU7UHCyPPGIPQ+#4@OksAUwRpI1V47l8z~8KlD${!!+dT+tb-AcF%P`WAs}67)RZ8
zy_mR0XUL{^4Pv2<bPmqmT@2%0k><gR;F+jdVWS*v6DF?{-KC>zb6a33{iW__>UymN
z4C_WY30B`XMNh;yjtU>3dhJc2n~Yo{J#zBHJ+l2>?MRY5>F~(O5AldI@AvXZBGQ>i
zdn5smB&0`9=J1H}dsZnQ=@EyXh;dR5Q`Ad(M7CE&&W^EVoZS#ZoueCQkPV?H42WfM
z<21Q&^d9UzC+(y$V?2)zwghOVgv>ZPHKQN><oWJ`OeF*z#mK|n5d2nu-&+e^iBl7m
z#_3((01%0}xIEQ+pZm?Ek?AfpfPFE9u@{xy92-m8m)dpMVA6QR*oz!*xI25yEw(ye
zv%(k@bqRa(kQq3pc3F@O9K%fI`94)RZk$#1jvK==vf4Jzl0jfs`<fpRjN%fetDg$R
zwy~&R?Q1<a#mI4x{Ka|N{SKps!>f#;UC$k*NA1Z&5<Ls_>?-56UEl8Mftic{5Hr8X
zX0CFYskV|CX4*yf%gy&AIAbXzJ=sR~DkCq>HuCRt7-@A5$Bl9FLyx_FJbJIo3XhwC
zcT9UdP9E>LpPBu@3*lcNCo<x)en_*MbS<V`tP8(2XTM{jeeAknZmSFjU}~&DGaW4=
zcRlrvY<V1W&e6#TKA(uo|3Od;-L(jZ7z=&tHOm--J@WMQPhbS{@Oz!(R-!BB?%D?+
zVw{7|&ry$6+fu1Ob+3DLAu6A?jL{7jWIi?TxYSSDDvj}w_rnxjHmxG;lG!Afp=>k8
zBE~pU<ExA@_ugCJnh(?cuVcy+IgCuiQ9<RL$uks|lB5+r8#gXc-sqp&#)YiPCo#xv
zQE8kF&pIsE%&Q~D1z3}dt1A|c$^Mc(n(neXpRmFQahltNeR=YA9OU#mjy;tzB+m}X
zU;kR#Js3BRNJDl<j3X%Kh#KL8dVP9DbJ^>kFav#=`_g{wUa=un`&ZhRCa^E<vrbrQ
z20fCVg9cF{T2^cWDspdsE#rwu=M%#HklZe)Wp(rp7_$WHCC_D~N6ux>VR~UJW&1hV
zFparrVoP(mXkvSgCN^4vk7P`2v0V=nASWx-*+}XYdvq}k0(*VZ4$I|QozlnA)|sAE
zE8Ou_#=%|01qJcsoxg%#X>8-+0FNR}C3j_xq$wK=j5qWOv<^<m5Vi1Jp>7yTD*HpT
zWCM?`;SRHurc%`%$RDLJ5)UD$cen=Oo|S2dxvJj`R~i>~y(qiV=40E+-3uR}=Eei0
zD)~IgbEh}D`Wv4X!gEKh^|Gg~)_T{o$zxrpGowo%0DQam+V|<1Sn~CAs8`?ng`tJZ
zeyX46c&+o;xz<>}^rYs!Zbpu|%*vmI-=gPbcW>ss)v;}pWzu5=dXh$zbP^|}^C9nn
zya)0g$a^5~fxHLu9>{wj?}5Ar@*enOdw|{_z38GEyq?<F5(t&yCDrD#Kx?=qbW_=)
zrh2^Xj=!_TBK(#K*Oi5<x?v#w>tX!$REiGK^~0$YJ)#PM(&_#*=wqP0Z=_Q5aF&1j
zOe(bk^oJv<)E3a{w^OMHKu16if<B0&<4MrBK<S<KWjJn@;?YSDXa(pBJpS1PdK@%F
zX*_;A0!r^zQ*eE4qj2pgbzM1UR&fvH3I7Csi($w0#85Mf%oW$*w*tQk*xg1zN$J{>
z1-G~_{%Y|aaq|^7efl%kTtzU+--F){@JT@e5eN_A*9LqGC<iKw-c^4D<yD}3VU(19
zy<p8HGYkLB1(O8*yY~tFo`OH#pci5}f5StC4;Dpd?422zRX8}4SVbAKhw$5$L|qFr
zc#TM5;kLpw&jn;XGnz_$7c{L8JOvL+7OAHUwp8Ny`nZ$lTa!FB;CU82RNu575A<wQ
zJXE&^@SF$FI?yyv;pb%CD8C!{<!Cz};_3W?JJPmN8{dWe$1>%qKHrooWLr`D58<K9
z{aHG8N*y)8&LQ7Ke+W|k+LF?T3TjIhJXmOyltqh-lEr&x)Ra_weWqEmGBRsjNmWb9
zN>53Jr(|(;Nm+Htg6fje>XKsFXIG%#v_a1d(vuH)59B?N_dwnQc@N}0koQ2|19=bp
zAMgNwkH_EN(YBca(>W@c{@@QE`^nI7wW62nG=JxJrB35`A;T4#^7nqUho`{#?|zVK
zrSt(he<1K)Ia#FA{7v7W&Zid%D9Cp|LHS#~1rilvzNSpHnCQ7pA=r}3(4#4xvnbH_
zeH1>fh&ZGRW_(N=#&*Xv-)v2}{7>pM^Zi#!)eruZ5Z=*|^^IwLsmXjPiQ|IIe@y59
zR;RfhTK)eT;qSbi3M=$sv`W(rnr_jwP18M^I^{nq&EIvdTeIe-vc+{<@dO}TR$0EH
zykhCHuuLu6y}Y8lVnz9~YZd-c8tJ=GSNi+@Om6y)mA_BV#tQ|1f1ZsOiCsAyUWnew
z{WP0@rr`dWjn5L?kF)V&!R?!k&lcP-vhj-q_rGlX;&eaF#xZJhv`ZmwQ7Framx!L6
zxLX{^i38N%>t>fbSMa=$jpN0jicCbs3&mxEzsJwaEyUB0!#Vlqr@tr8=Kq-B`6V0w
zxX9JN3&n!;e2~qL*=$25qT+?(3Q?L9=h<#jhUU#8@s50zb`lkW=FtK)N`=F3_@qJN
zTO9bOG|uxf>-uv<Tp9N8JiS)pQ~l7a^$a`o@09#g{kb1_F8lvs8hpC?(z7BL+VR42
zL>wWP{--6+{3-1?0NjOH+1ZXi()_&ca1m!@WNN>nw?i>IOlkLpSP%-RbxK)-q8FoL
zmjZlNPw4WQ6|%0>_?D{`AFo$SB%ZB<Qmd!IHv%u4$}V1&_|$&bBK4Gt-{}QcKCgp(
zyT&(bW%9Wg@V^3HDlVVWZx<1N!PIejzt(d^>ygjTpvRIpB98F*H2C+Y!H0m8J<jp<
zCh#(cZc2^=pIdOb;B|soTxhSkbaR8AAM`ds&@)_WugmqlD)QMUgyw5}>?)-ps1+@e
zIBT7xm72fhPZTDfc_P|}Un$1j0>?b?bJ$7c!YCQ8S44QVo{ue5fP9{b=$+G)+XS5S
zJLj1lTF;2qFQ55BPp8J`>;Cz;F83jgZ@EeV_iOx{z{#IZ{f`1K(>$4ko_SxD32;2n
z9_k2%@y1a=OkOnM3pM)!bk#%$u9>KB^=)rz-Rf`h)rVT!JAD4|4iRW=ZfgpLg7xJq
zD{fqtn~CncX!QBp+x<Iz!In__PTX|iZw~tE!_Cb*A(D~ufislFN;hM`q;ROQsRPvK
zTf5P--tZZ>*7$JOMK*uE@YQ_bR?qs{HQ71xjtxM#8^vdsT7y}$QTWz*Z>#oreYdS$
zd%Lm8x5-oOHGCp~`#VCx>c;K2hMTtr+aV}#>Iig%WliKg9aU9)Q3qYmp)dZ(20!f1
z4u5^UXzW<)55SSa7p(V(`~n4TX#FZm%f3})Qt1kPp~xg6uLg16BjU^^<?412=+3?>
z#8=<Z>TB?~)YCO0wYPz*zOls@?g-Y4=5SLev*y$=`X-a?0^}tp-qx1wHLYP>N8)L3
z7u$m&RkaSj3ME^_=iA!Rp-qxEpGY0GEul#j!F$90ChBy!>VzAc?m)?Tu}SvLD%oX;
z@{XO&A^%p;P`jcH9K-D_!S*&$-qIQhmTzwfm$$XIwguZmJ2RlI;YQru(^#(|Pj&6m
zkbk?7><#{o22ozWvjs&c8fsTLUkSE%G`6;6C49(h4>tKpK*!qP<8tZQazx9ww<1ZA
zj$lBPhk`qhq_G3;R@p_$gAIDLG}J>Ir<4vgY?K7YQIx;A5z3S}+%C#7WScPzdEEbj
zly*v(DzVn8ut4vxnew?%XG>m=6Q$*r&SEUj`+25i$jc0T{$lJ#L^9>?(&aOy|JP*(
zURM~aMI=+6&j(D)m{C)w{GGt@9ZD<P&*uoHTt1(7o%Z`7PiI}0=ko^BGIA~g*+@~A
z=W}TzFsd@k^SOj6pQphhgI32$aW7(YR%LlUzcA%;*nZ|?x*PIz_T@C6bC~Moe2V>S
zKok-3Da-SDh-pkSa{12se@n|(Yd${TGwsQcr@A=h9|1-_Vg0n^%b=<AB;aiSZ-Y5g
zzD&z8ZPV(QIMj>pI^_Ah#+3P|lRxB;KcEGeZec-9Ss&ByJLGx4!!(F3S!Q54#*QMA
zS${q!GUew=%<uHy541eDKkxsTUdMu(I_3Y(A<ySdrh7j^{-+LkKA$o*(}pQU+<#c@
zn~2a^Pft7Pb1dHz=j7)!({~{2&XDKx?*7#P5tvV<Cew_+j|}R&Tt1(t_})Ky7lH!K
z9~4-Q+wq@)5ev)n^R%9ui5vgtRwVtG<(bZeaHf3v98jf1xExl%a-5z6VZyk4-p7_!
zDGnz;m6aLh>hdcxLBv^pi34Z(OzLQ2DN$9W1ovpi(XoNf0BjG>i}ak3ZC4WNZ)}~S
ad|xH!ak-qP?SC%${kJHND;xrjr1)<n(5_wp

literal 0
HcmV?d00001

diff --git a/archives/29/src/main.c b/archives/29/src/main.c
new file mode 100644
index 0000000..c2bda2d
--- /dev/null
+++ b/archives/29/src/main.c
@@ -0,0 +1,42 @@
+#include <stdio.h>
+#include "utils.h"
+#include <stdlib.h>
+
+/*
+    Consider all integer combinations of ab for 2 ≤ a ≤ 5 and 2 ≤ b ≤ 5:
+
+    22=4, 23=8, 24=16, 25=32
+    32=9, 33=27, 34=81, 35=243
+    42=16, 43=64, 44=256, 45=1024
+    52=25, 53=125, 54=625, 55=3125
+    If they are then placed in numerical order, with any repeats removed, we get the following sequence of 15 distinct terms:
+
+    4, 8, 9, 16, 25, 27, 32, 64, 81, 125, 243, 256, 625, 1024, 3125
+
+    How many distinct terms are in the sequence generated by ab for 2 ≤ a ≤ 100 and 2 ≤ b ≤ 100?
+
+    https://projecteuler.net/problem=29
+*/
+
+int main(int argc,char**argv) {
+    struct String*numbs=malloc(sizeof(struct String)*0);
+    long distinctTermCount=0;
+    int arrSize=0;
+    for (int a=2;a<=100;a++) {
+        for (int b=2;b<=100;b++) {
+            struct String newNumb=BigPow(a,b);
+            for (int i=0;i<arrSize;i++) {
+                if (equals(newNumb,numbs[i])) {
+                    goto skip;
+                }
+            }
+            numbs=realloc(numbs,sizeof(struct String)*++arrSize);
+            numbs[arrSize-1]=newNumb;
+            //printf("%d^%d: %s\n",a,b,numbs[arrSize-1].str);
+            distinctTermCount++;
+            skip: continue;
+        }
+    }
+    printf("\n\nDistinct term count: %ld",distinctTermCount);
+    return 0;
+}
\ No newline at end of file
diff --git a/archives/29/src/utils.c b/archives/29/src/utils.c
new file mode 100644
index 0000000..b20be5d
--- /dev/null
+++ b/archives/29/src/utils.c
@@ -0,0 +1,207 @@
+#include "utils.h"
+#include <stdio.h>
+#include <stdlib.h>
+
+struct String mult(struct String numb1, struct String numb2) {
+    struct String n1 = numb1;
+    struct String n2 = numb2;
+    byte carryover = 0;
+    if (numb2.length>numb1.length) {
+        n1=numb2;
+        n2=numb1;
+    }
+    int addends[n2.length][n1.length+1];
+    for (int i=0;i<n2.length;i++) {
+        for (int j=0;j<n1.length+1;j++) {
+            addends[i][j]=0;
+        }
+    }
+    for (int i=n2.length-1;i>=0;i--) {
+        carryover=0;
+        for (int j=n1.length-1;j>=0;j--) {
+            int mult = (n1.str[j]-'0')*(n2.str[i]-'0')+((carryover!=0)?carryover:0);
+            //printf("  %d/%d\n",mult,carryover);
+            carryover=0;
+            if (mult>=10) {
+                carryover=mult/10;
+                mult=mult%10;
+            }
+            addends[(n2.length-1)-i][j+1]=mult;
+        }
+        if (carryover>0) {
+            addends[(n2.length-1)-i][0]=carryover;
+        }
+    }
+    //printIntDoubleArr(n2.length,n1.length+1,addends);
+    struct String sum = {1,"0"};
+    for (int i=0;i<n2.length;i++) {
+        char val[n1.length+1+i];
+        for (int j=0;j<n1.length+1+i;j++) {
+            val[j]='0';
+        }
+        for (int j=0;j<n1.length+1;j++) {
+            val[j]=addends[i][j]+'0';
+        }
+        sum=add((struct String){n1.length+1+i,val},sum);
+        //printf("\nAA:%s",sum.str);
+    }
+    if (sum.str[0]=='0') {
+        char*newStr=malloc(sum.length);
+        for (int i=1;i<sum.length+1;i++) {
+            newStr[i-1]=sum.str[i];
+        }
+        free(sum.str);
+        sum=(struct String){sum.length-1,newStr};
+    }
+    //printf("\nA:%s",sum.str);
+    return sum;
+}
+
+struct String add(struct String numb1, struct String numb2){
+    //printf("%s %s\n",numb1.str,numb2.str);
+    byte carryover=0;
+    int digitCount=0;
+    char*str = malloc(1);
+    //str[0]='\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]+((carryover>0)?carryover--:0);
+            }
+            //str[offset+1]='\0';
+        }
+    } 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]+((carryover>0)?carryover--:0);
+            }
+            //str[offset+1]='\0';
+        }
+    }
+    if (carryover>0) {
+        str = realloc(str,++digitCount);
+        str[digitCount-1]='1';
+        //str[digitCount]='\0';
+    }
+    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;
+    }
+    str = realloc(str,digitCount+1);
+    str[digitCount]='\0';
+    struct String newStr = {digitCount,str};
+    return newStr;
+}
+
+void printLongDoubleArr(int a,int b,long doubleArr[a][b]) {
+    for (int i=0;i<a;i++) {
+        for (int j=0;j<b;j++) {
+            printf("%ld\t",doubleArr[i][j]);
+        }
+        printf("\n");
+    }
+}
+
+void printIntDoubleArr(int a,int b,int doubleArr[a][b]) {
+    for (int i=0;i<a;i++) {
+        for (int j=0;j<b;j++) {
+            printf("%d\t",doubleArr[i][j]);
+        }
+        printf("\n");
+    }
+}
+
+struct String createBigNumber(char*numb) {
+    int marker=0;
+    while (numb[marker++]!='\0');
+    return (struct String){marker-1,numb};
+}
+
+int*getFactors(int numb) {
+    int*factorList=malloc(sizeof(int)*1);
+    int factorListSize=2;
+    factorList[0]=1;
+    factorList[1]=numb;
+    int max=numb;
+    for (int i=2;i<max;i++) {
+        if (numb%i==0) {
+            factorList=realloc(factorList,sizeof(int)*++factorListSize);
+            factorList[factorListSize-1]=i;
+            if (numb/i!=i) {
+                factorList=realloc(factorList,sizeof(int)*++factorListSize);
+                factorList[factorListSize-1]=numb/i;
+                max=numb/i;
+            }
+        }
+    }
+    factorList=realloc(factorList,sizeof(int)*++factorListSize);
+    factorList[factorListSize-1]=0;
+    return factorList;
+}
+
+boolean isFactor(int*factorList,int numb) {
+    int counter=0;
+    while (factorList[counter]!=0) {
+        if (numb==factorList[counter]) {
+            return true;
+        }
+        counter++;
+    }
+    return false;
+}
+
+struct String BigPow(int numb1, int numb2) {
+    struct String sum = BigNumber(1);
+    char*newStr = malloc(0);
+    int strLength=0;
+    while (numb1>0) {
+        newStr=realloc(newStr,++strLength);
+        newStr[strLength-1]=(numb1%10)+'0';
+        numb1/=10;
+    }
+    for (int i=0;i<strLength/2;i++) {
+        char oldC=newStr[strLength-i-1];
+        newStr[strLength-i-1]=newStr[i];
+        newStr[i]=oldC;
+    }
+    struct String bigNumb2 = (struct String){strLength,newStr};
+    for (int i=0;i<numb2;i++) {
+        sum=mult(sum,bigNumb2);
+    }
+    free(newStr);
+    return sum;
+}
+
+boolean equals(struct String str1,struct String str2) {
+    if (str1.length!=str2.length) {
+        return false;
+    }
+    for (int i=0;i<str1.length;i++) {
+        if (str1.str[i]!=str2.str[i]) {
+            return false;
+        }
+    }
+    return true;
+}
\ No newline at end of file
diff --git a/archives/29/src/utils.h b/archives/29/src/utils.h
new file mode 100644
index 0000000..d7f9886
--- /dev/null
+++ b/archives/29/src/utils.h
@@ -0,0 +1,18 @@
+#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);
+struct String mult(struct String numb1, struct String numb2);
+struct String BigPow(int numb1,int numb2);
+void printLongDoubleArr(int a,int b,long doubleArr[a][b]);
+void printIntDoubleArr(int a,int b,int doubleArr[a][b]);
+struct String createBigNumber(char*numb);
+#define BigNumber(X) createBigNumber(#X)
+boolean isFactor(int*factorList,int numb);
+int*getFactors(int numb);
+boolean equals(struct String str1,struct String str2);
\ No newline at end of file
diff --git a/current b/current
index be822cecf9a16754725445b4e757b641e4755042..fc3dfa9f81faff25c686914bc986279c451cee8a 100755
GIT binary patch
delta 2043
zcmZWqeNa?Y6n}S@Z$FkVMZVkxbc9q`7*dIFT;#&jFiFLa$Qc|JWkyYNx3qz9c-U}f
zLC`znX#JxOnl}6)?F=Gd0+LH;u^H-CPJ&~#h$f*GI@s&?-Y%H=X72vZJ?GqWe&^it
z-a1c_kyE5Lo-`dyxE){#5!A;L!h=a-fS`461+8r<NhC3IjPCvavC89C#gA%wLib&>
zuNx8W{PgM1(zac7CoC(j`(Lq@Xg`_cpB*d+V)dk+Ag&L(RwhdK7qQZ-BD1tzR06nu
z{705WM*BoNbtwuvb-1Bd101-bs+_9a0NI-Fw9;O7gV|jrlLdjbi_F264I#pao!(MT
z4yIV?E%Auh-sdH<4$+Fx#9<8-t)idRQZ@v|2>V-PmtFljL8xf6ye-jN1V_@TqvWzg
z9grO_9%na1q|5XWeQvJKQ=;{W)e|*9$oV58BO-gtPn4*O43b)jI*C;3+@w1|Wm%SJ
zZvwWx*v`flXI$VRR%eVx2||;?-Sy=&SyrX5Z9TyYy+Xg5hUPKaWZy61gyJ&LYKsXw
zNf!PF*;D;l#Uq#9l~gD2KbEFSx~f+d&Q{u_YZP8LT1u_-EGk1SwLB`kVA|uqWEm>S
zMHmd${d*Kr2*p1OpGj`=Z^BoTV|+%$JhInT5D`Sk7TfknA3_SbIjWAd@bKu*V@$YQ
zH}hYIl>+;ay)T_QOIj`lDD|A>ccUv}jt7l-nO^j|;P#rp*>px4c!+)zd55>_!}&pd
z5($A+K+f@K!=VXlS!q49oJOx!@n%Cr^23KJ)h;`2RhlyRkwjaOx>elhK)qd}`^tXs
zcv+X#bMKhMvQ|`Iou_o93p2sGD+8^xUO7^HZA(#6k=TCE(Ee1@KB7<Pz*NzCskC0u
z)hKPT(>68FYUG$r+g^x+=2p@cE3}^En1`3$I&_VRq!Na4Hv$!HsnkfcO`*;@+VAO!
z<GYbG+E#KD3cfQYzU=XkEPJlmfxB@^v=h#q>GX7or&7CX&F|_hW1sI773c3+mne0v
zEm(i)k#73ae3AVkvLO>2$z_*wSq}yPuV0_YN?i;wyAc+E_bR^+vz^vq_Em3maIu|^
zmZ??GMP!$ij-qVh&@~2%)@67L)omB5Uod_oNTQ?41f<c?k}FLFhu2>!O4R8qlrVx$
zzerFBnbzc1XYf}9!L)h_yJ5;-!u~X^GO^Kov3hO=)GKonp5Z&;=em90ri<;Lc*y8o
z7LZlE+g!Y3quF5I{N8rM#&<0{%&!?{Zrdan1^oI8GqI8d5~)qEM5;in$G2r!nT}0;
zvV0e4295%Ifpx$O{jwYijt}n0aw_oK0a-2tW<HSR3g7_nH1Gi0n|u|*JqSa<WZX$0
zzDTt|BQO<1y$aX~G%Nc@NX$<f<HF;SDha8CEMJ9@Fas+U%gFnUv&!~>psH3(ctWwv
zSUaIF1dcsX5R|X&aYQpBzd$DkeymwM$wxbjO!V~=;-RX?YCu8#KL4@j)o2fRReM+Y
zNWR)GAH`KL!0f~-a>=|VIoexkNF#4Z)_WTeIgMY3lm)4oKY_Fr(lC!siS(|76wWhJ
zB9|&HS&L580mqq8Nvl1qk`WZPO1GSN`N|=W`)Ky646>lQ54$+T%TqG_Qqi!TXe5s@
zh1mARvH)J2u|Tsm&eokV)eFe)m=ehx9+VkIn(#ZtwlMPxLPq%?i$8$6I4g%V^M<T2
zO<^4G&U&9b<t7?N*7J2VDQ0V&lK%Nqj;z5LjaGwOSI5uLa}nX5zdyBeFiZg<#cL>*
zf0&&}cJMRVIhv_@KAin#n%aH%lzM!oOm{~*=?0<3qc4ngE6P3k!+b+dnD+@-4ZJ}U
zLRxJHb53b|Ht(`**tXj?Z|MnQyZJ`HR<k*nH!n{N7$c7AhnHug%(T3upqKuC`Ce$7
jjP4X;DB8~F$%O3V=U2@4Z_9BTo&3p)`Q!*sUODSuiqY%x

delta 1761
zcmZWqZA?>F7(V9~q;^VM1Zxo}<zv)Lp%9{M4r7%|FDhFd7Qf<jnV4-ci;1w!g$`rU
zc-Iw>;}Y524|O_R_Ct1c!wds#ZXhukPD9GVVl`x|nVX1P#unJ!b9xKLd6ILV_dM@=
z->-Ady%T3>=nQRf&|^my-89rBk?5#NVo5aL5E8UyNKn?$d}_~eYU}@FqehcP)+T(P
zTySXYifi*n?{2(K+QzTdwC-Dba-~wQ`(W<urDj5;;M{H#vzdQrsFM75OJv_wNv`YZ
z<{l!$|Ej7ai;+HYgs=O=Fi+sl@u)l+l@CDniz753j!4I(-f)~Ge=P;Xh$Ih5a$n?=
zn1_ezpl2+q52gtL?`S{_%R{g$N+jEf+$+h0@)MH0TK~8`9h3qq^^*LZ6fE79PDm#L
zlZXTU{o*L~`$m(EO|>dtg|Q098=JOZ6}6K5mrJ&8Qx?oy5tlr%042*}XWu~yYVPCC
z4dpe<Y3i_063d|S9JfH0om#j&%XGNgf2k_7SyQa(ye=3RzaY;#>wE$69I8hhy{yu@
z)tL)3Q2q#&p$Hs&3!xr$SvP;$<s$B~$C^vW*w5B#dXbf;E~TwXZK|2l{mP+*vnbui
zf@vSq8>}e(Q~P?H2(5H=Tq_nWTrP&{zv?#dhFoD&>5cXdY^-Lr<x#6knpF-vnIY2w
zw%E3l*0Ccti7v*|${yHO(LuH}v$a~1eO+>0Cz`#}2)8$<R8`xa%0W~T($0r|ELvB8
zpV-4Y`RhA=u?HuiM|v5XCHBY8!1z7QDp1+QGVJ*&J!n<X!`s&{(Ls6OuqhyRv6t+r
ziCunQ7cn;TcEJn#+wN#6zW-=ozjzrDE-x25>tiwcBH`bon}M}AB=Ib-%l+7MY3sIc
zb{TEjWq4rB_{X(zU9j}jQ-rvxE94=Uw?h8YwZSD%dZpl!qoAwSEt<j|&`0k528X><
zx>}o(mpwd3@g$gNt24eKcdvmsiNWQ1CU-A@KXZ5QoK12u3kjhMb<6jo4`>*fys4_^
zfxE-1$}dkn@DJb!kl&wgZ>j1WoVd?!t7<Xu(j8UZ0W3u5Mqmio4)me6tH5EPeGEb-
zdTzqiYXCZdU1-n-;9_j_adyF(Z7o5F0)!xC2__CXn8lbY*?ni;i-(a|l;$doWXxL3
z{or>1rw4!QJ<JYx`-PKYqUn&ZdhRUIuM>vnB<MMZ;lMnPxd#QA6WHs87SqJ6s5%pD
z7}Lw%FSNzSA@|elA|wYS2m1-qI!I?3EwVN2fpqJxs=9$Qk#s94ca#RI1-u?D*baF{
zFI3OOIS0KPdfv(zJu=lj8FfL*K;M9F2hL&*_fei`Y8EOI7c}X_#LOV;E?S~bLl+N2
z&+M*wN=tT!fwh#D2%EB$fztVLKz7@ePji@gm4&wBnWC&%^*P10yubQQ(65%c=?T_R
zW)VDDY@qB7dW*S43oT=t#RB`LEFSaWIDk}=h>4ua)VN}HR{Sz`F!r@KCunR665>{2
zJA1o4pL*HZa<?#*!N$v<dpf!$F!RN1Ch<w+<Fp2(8N6Ar5|bxJ#Nb1A#BGVc0BsiQ
z5R#Q%caxx0uQ@@LiM3&!;5D-!pU*c;=Zm6~JmoZ-ZT1wHAN$L&Hn8onf6z2Km0^!c
a=__pbg=Mqb-CEdd%v!Y!-?8;odH(_Zn_U$E

diff --git a/src/main.c b/src/main.c
index 01d8475..c2bda2d 100644
--- a/src/main.c
+++ b/src/main.c
@@ -15,18 +15,28 @@
 
     How many distinct terms are in the sequence generated by ab for 2 ≤ a ≤ 100 and 2 ≤ b ≤ 100?
 
-    https://projecteuler.net/problem=
+    https://projecteuler.net/problem=29
 */
 
 int main(int argc,char**argv) {
     struct String*numbs=malloc(sizeof(struct String)*0);
+    long distinctTermCount=0;
     int arrSize=0;
-    for (int a=2;a<=5;a++) {
-        for (int b=2;b<=20;b++) {
+    for (int a=2;a<=100;a++) {
+        for (int b=2;b<=100;b++) {
+            struct String newNumb=BigPow(a,b);
+            for (int i=0;i<arrSize;i++) {
+                if (equals(newNumb,numbs[i])) {
+                    goto skip;
+                }
+            }
             numbs=realloc(numbs,sizeof(struct String)*++arrSize);
-            numbs[arrSize-1]=BigPow(a,b);
-            printf("\n%s\n",numbs[arrSize-1].str);
+            numbs[arrSize-1]=newNumb;
+            //printf("%d^%d: %s\n",a,b,numbs[arrSize-1].str);
+            distinctTermCount++;
+            skip: continue;
         }
     }
+    printf("\n\nDistinct term count: %ld",distinctTermCount);
     return 0;
 }
\ No newline at end of file
diff --git a/src/utils.c b/src/utils.c
index 0db2900..b20be5d 100644
--- a/src/utils.c
+++ b/src/utils.c
@@ -43,7 +43,7 @@ struct String mult(struct String numb1, struct String numb2) {
             val[j]=addends[i][j]+'0';
         }
         sum=add((struct String){n1.length+1+i,val},sum);
-        printf("\nAA:%s",sum.str);
+        //printf("\nAA:%s",sum.str);
     }
     if (sum.str[0]=='0') {
         char*newStr=malloc(sum.length);
@@ -53,7 +53,7 @@ struct String mult(struct String numb1, struct String numb2) {
         free(sum.str);
         sum=(struct String){sum.length-1,newStr};
     }
-    printf("\nA:%s",sum.str);
+    //printf("\nA:%s",sum.str);
     return sum;
 }
 
@@ -181,10 +181,27 @@ struct String BigPow(int numb1, int numb2) {
         newStr[strLength-1]=(numb1%10)+'0';
         numb1/=10;
     }
+    for (int i=0;i<strLength/2;i++) {
+        char oldC=newStr[strLength-i-1];
+        newStr[strLength-i-1]=newStr[i];
+        newStr[i]=oldC;
+    }
     struct String bigNumb2 = (struct String){strLength,newStr};
     for (int i=0;i<numb2;i++) {
         sum=mult(sum,bigNumb2);
     }
     free(newStr);
     return sum;
+}
+
+boolean equals(struct String str1,struct String str2) {
+    if (str1.length!=str2.length) {
+        return false;
+    }
+    for (int i=0;i<str1.length;i++) {
+        if (str1.str[i]!=str2.str[i]) {
+            return false;
+        }
+    }
+    return true;
 }
\ No newline at end of file
diff --git a/src/utils.h b/src/utils.h
index b0b8212..d7f9886 100644
--- a/src/utils.h
+++ b/src/utils.h
@@ -14,4 +14,5 @@ void printIntDoubleArr(int a,int b,int doubleArr[a][b]);
 struct String createBigNumber(char*numb);
 #define BigNumber(X) createBigNumber(#X)
 boolean isFactor(int*factorList,int numb);
-int*getFactors(int numb);
\ No newline at end of file
+int*getFactors(int numb);
+boolean equals(struct String str1,struct String str2);
\ No newline at end of file