From 0d8758e1db95bfc2ca2b2e053568d69f946129cd Mon Sep 17 00:00:00 2001
From: "sigonasr2, Sig, Sigo" <sigonasr2@gmail.com>
Date: Tue, 19 Jul 2022 13:38:45 +0000
Subject: [PATCH] #21 complete!

Co-authored-by: sigonasr2 <sigonasr2@gmail.com>
---
 archives/21/current     | Bin 0 -> 16976 bytes
 archives/21/src/main.c  |  50 ++++++++++++++++++
 archives/21/src/utils.c |  72 ++++++++++++++++++++++++++
 archives/21/src/utils.h |  11 ++++
 current                 | Bin 17016 -> 16976 bytes
 src/main.c              | 109 +++++++++++++---------------------------
 6 files changed, 168 insertions(+), 74 deletions(-)
 create mode 100755 archives/21/current
 create mode 100644 archives/21/src/main.c
 create mode 100644 archives/21/src/utils.c
 create mode 100644 archives/21/src/utils.h

diff --git a/archives/21/current b/archives/21/current
new file mode 100755
index 0000000000000000000000000000000000000000..c9ba7d89fbcbb566943d2552e21bfce9040749ca
GIT binary patch
literal 16976
zcmeHOdvH|M89$rl5fC>)K@lI>T2U-!2^NvZM6)3mZk(u860udhEZK!*n(U^#cPl8d
z$g0D2iPEVv;?!x=Kdf}xncC4hI2GLh66&BXt>e(qj%cw>l-fu`jnD1xJNJB>yEhwk
zs(<v4Ju|!CIlu35zVn^Oz31M0exx<6DD!v(C$G3lP$^SsBXx?gbE(RJ)QQF7bo^I|
z3&bRpCrHfZ*VzPII~^@6q~!|tf|A}W$`qmJ*|1>B9ug(J@zQQ`2#Kjs?I690#8727
zeSR`Ag<#73e0_e&7Q#(c`vg-*edJ1SwXN4%TS&W<{3e$k6-n=LrT4hfV>(0*Au;86
zQcUQ#SjE##{oqmZ%YPx<dN(OOH*HYzOsNh^tKT-m|4V(Vl-^~2X-2r|EjBEea(&-{
zp6Xg9@%e<i`36<rc>S<W#h<APubAJ_zJAfd`5ocvj`nDBQ}w3Bi>enb3?yQK%Vovn
z7u7*yYUOn;)cqO4R2XGn%ur?GpL%lI$7{}e`HrjJeD;nHA56^~dZuh1+n_p0h7#%X
zkf1W<r{G62cKh!_&c=uyiM-TFbi8yL7-tk=-U!TJ1V0y8G5N*g;Bnx7{M_k60LAQ_
zISx*(^5f@DmjWPLV-otOmAYe*=t`QcZK1e`M?xJPu~yL)Z;zTAM5kRcjMhydV?%p1
z)X{!>L>LAs8VNHLH;v9vdsM7!YOG&wTpqYQaD^}$o3Ay(k$7Zdd%}#wo3CBo5sOBe
zL+d+8b7N;Lsx%E-w5T9lrCuv5`1ha(JwSO}CTF*!Tg${Xs$sl7@VxAuZZmeP`Oo+|
zg_qaae8#za^lBTYu|i&OI_AK6P7!awfy?z#DGWJqu7g-34xGj%r#%X%Wt7^<DdWI-
zZV>N~19#5rtOHj|GMg&VQUpp7C`F(Yfl>rY5hz8V6oIcH0{^bK;3GYCqFhf;{L6eH
z^m{U9SuU%m4wUbg)^k^E1AH<!Ck0YbB}l%FI41|+%;j=BWtndHP7WT)m+8jy<X~UE
zOgDZf2Y<(9SnHP78icfma<!{G$5lSxRi5cAFZgGpb>vpvdP`3oA6nJi)HCr_+*0a2
zryG*g_M!UR%##5jhIi^cwdX)r@0oZ8ktHMMOf>x^@Tloia>pvFwnAL&R}}Jt#O%4^
zEh3kGrdvaL-+Nc<eIs7ob5K9>nK=Un9#sa)bH_GRRH0q0Px0AWOKg#x*P^Ftw^3HN
z-ZrP{>Dqfy7#RF4mm3HpI0q+oqwHA=-2(l=+rT74Ezm<})mYuH>sB(`uN|Yv>;2jY
zh#34E{`$4!gr&7(*1o=Xsyx{vBbGMMubrSidG|`-4}Z{o!ph#0NnV`RPI$EA3R<F_
zFsG{gC<@&aq#(IW8`#p<ugT{QY3+ES^<im!9&lJ6meyydwPBAoq@dB9v^Wfl!({PA
z@Rw;r<|U{ZG+6~|9YoOEP8VViTowcGe45Jv)pzM0Z6t*z-_?Dr;t~wT`zsL^J*|!C
zQe$aeV-GZ>?jQGa)K(*GZRon7HPU1qY_eX~t$u{CSGT%%TUp(DLASJ>y4AAlptct=
z%uvnG(ci!wFb3w)bW3kq+qq<4#g6v@_iG1;JNOFzQd$Ph$>^<FICE6DUWM&}W>$la
zcA%nX8wB-q%kH$+J5M`+#-s*3x+h!ll&E+%)1yPRWf$y^<)sE{Jbhcc_li5GS3ITd
zwf3dn@oaC|3$1r2%0_w)S=ymg_n|3wmcw~Zs`C)K@lcOmlSVztCr{RTVSDAfbBcJ7
zZh_PbU>wywFTkDcWhw0d+S5yJ@9-nUgD2p7zjhe^pVQ#hPgI;p^RTPIhd-ymZr+z_
za5mMQ%{MrU24`i14;N{$9oErW(k+m3HTW<ZjD9+7H&{lyrf9czf6T4Sph-QeX#62?
z*@I$1zea;Wyn9Ppdu7xOim3K1hQ~ahP7TR;ZY*OTdimMyWlkdmJxBfW3XQY;%v++p
zvgIcPU~<TTrwxE2-!h<EeY*8$>k!uQwwu=$%!0XCJgg*!X-hV}_Nd;vUyek~N@N?Y
zOz>%H1XdBdEm&e?rWW&*8U^u+-|o|UW;{<Ys>|x0efI23PuOQq#KU+lU{BroALVj1
zV<E6iJG$i$&rOBWz!Zrd2a2ix`j$s_?u46jzlxjRV>g$%-Mq)`W_rRlxmsM7ck;du
z3!L0*I~kT}-pQZko!k(psJff1;%bO>o)(zknx>xG)fWp9ys^=GHQ3T<oeDMwtxsC?
zp6Uj`tD7$Ul&-M@4~$^+^nL0zs}{Vbt}jj2$tLT)2J0We+>AH$)P9e?<gdwh==yu}
z+Tbn0wZU71#{LbXl~R3lWhN@G+xaWC^r`e$ia;p>r3jQFP>Mh)0;LFiVFWyQOEf1u
zRZN{4>}+qP7hV4AlAY@#aepG&xzs<WBP{Tn0+}hobFO#UO|VFJal`-0<#vEJ4CQi9
zf;NNF4&gyi6SVvNT#oJ`pE#MzO~8)y=~KDfT+ns@$>o|rXM6xT(7QpOp)zDCd2YW!
zcs5mf&Yd>7e5b<c8-Q7`iw!#}oGf3VU4-mH{MNybRfPL0SNLXKQ*qjD<y*zovzLDB
z+ZSC(FxjPd$=e~v@7@?EKeqy}BS0mpi`w;L)VB!r3(Z$~Z`tzGCwZ$qa7p+9{RY3s
z(7s9ZT!Z;q%Ih5|BM~W+1<M-F<sJid%9K4UMFjajjNdfG<x#iHL$(aTxWyFb!H->#
zix9BFSNT9$qi@#zUd`w4nV|XR?wHu%tGRcQ?pvIiywX<}^(_wiYJ$GG^*(>SZ&tmp
zvffuN-#dn3Cj&bZ$xbPiB2bDzDFUSklp;`yKq&&H2$UjFiopL}1o%5Z{_YRA@G>!-
z#vZH94PJuDwC8M_o}<eAeIb3{Nr}Jdn{5{be`iShA4<$W^;s@P<zCwBAo1Q|&jh=S
zH>@%pQheGQQu?V)1bu%>X_igIOhuU}HPNfS`=b|$l-9}r(S0F*3#ghUbX76q+m&PN
zcSh;sF~3Y){{^bda(JI3+lP2c2=8KLxlP%_`!D88O>7Hgxmoe?nn0Gh9m@RIM)<pL
zx4|0K-*t+vQgof7Zuu`N^Y^1GmoH!HpWCuN88wssC4q&3n(75fSz2)C<u!qtg@FZ^
z+V~e)q;Hu$`S1Ik(q24s;P2B5aj)R-&kOMhVoQ+#dodb$To%et5<DIY@yUY6Z6RJR
zxIYW=DT2pAAwE^`cq_zD%a6-K9J91Yzj$$q!e12kiLRn}h1gmYugss<D6Dt7;B}x7
z$CufDCt~Nl;>`T__)e}DPf@lPm7ghiT`815E5Du;;%AFu<JpVVf#-jrJXWtdCt~Nl
zVz#I(iu39=szdAK1o3`u6tQ!(ZkC}_hFtOVDcrBVvu3?-D4f?}#;-)i<M4;-qqG7)
zj~E*V`dFXp<#nB8DQ(8jgVoU;&t1Ta`Tz5A@bTJ9&!If%$4{ssu2jta@1@MlG5vTD
zxJQib$Cs77+yA#DK6YH4l6J=S`(ZSoOpKi`rvX0$aeG`{0Qfp|uEb>}1%EZb{RN0!
z*dg(;<BFb1lKnT-p#}MD4=SsGSBi7SjJKI2Up97rt&w)dR{Z^O@cWc~_c(tDxPPn}
z@k`*-%gzzJUbDy(grfzlq%O~5A8=|{or+sTDf~&|tUXHquH@fV7i#(Z66`+wDlyJy
z)s4zhj-Jty{fwGN^A-EUaqRnWfhRle`8yjp+4+^4ck<aQY*i_I$62=FN0t2rz$p%H
zJGH?5O2$dn0Kd=)aK1HeCd?$>u(yiQgCB<3X|&SOj|7f=gk#3Wj@bH8hY>bo@q`gd
zZW67r&aRG#83_j#*DP94T!;>xv>Ty#Jha(}M9uhSu^}Gnj2Pi$XXj?9I7$X2%>q$6
zngW-SW_w2h)G$`u5WH41wCfrSoINR&4-2E=yVnJ;ZCqZ+k%wFW;cSti>B@rMaDy;b
zHeFvIY%;E2v0}B>Y%~Y!n>4a2kH)knlG1ZNS5sH_WlzY2!tf*#4w)f!2FIo9K6>M3
zlcs&X2EG&?wlTtqn9&xBhUp+q<MogVw?~a+B7z!6-KHq2b3cW)<&mJKSaf4UEQwbf
z!Fc|(P@$Y*tWPAA3-WM~RBVizqk4vcQ$gGhbX=(D8KA;bM}?J$Kw@*J8Cnl&#%<ch
zIh<UI#JfZw8Z#q-jnQPFD<12L#LdkPXnnFB$I{xv3JTUYR-2)XLW;MA5^W+7-W)|0
zHZ|im=ZBGaqCFNZC>Y?yBOM`9P`R!SQv_rj1IPw8#!#e8BGM`XW@HnJG^`;VlN}w1
zw5fsI7KSx0**5GEZEJ8IRfX`T3C__t2_W7gfZ5cE8NyTYt5CWFz|w<jh@EDs`$nd`
zzfo){%Xy;T#E<qAtk3tUO#R?F6YnD!TZD{L|0Y#GQ+n^?OuSAr)`*N#pYMB_`dLs>
zxBeR7c*PcD|M~uyDc8^YHn;yF=+mB!_4z)U>5!_Ie55$DKJTyEfl-rLpYOMs^1cuv
zGLa2u`T+{G=VE=nFK0^c^C+?ZEXVXt@MsUmWxjuB>L+C+xBoUOL=Q3)Q`YDEe5M&C
z$o0G1|B%wJS8}{hWxCFxPcd`r{{k4rgze*!XeUM8cew8Uf5fHlS9(lWDRWF*=EY+!
zecp#KW%=>+A9v|*RSHb&SW!{7$Mk8Jenv5vp2`QtHo$spmOk2b#*g<uO!@f;%e&+E
zywd0X7k(wF=w+(N#I64#7*s#&U*@+ZnciX-^Z#!B*T8Y=^S+DeCSp1gj~|BKMuzq<
zYT3!}C;0rcTb|2I>Eq@Khdw_S+FcD0iRJ9lXqoX(!JsbU`gy;{=h=sp|1|$7u^#v1
zuYr*W>+`;_SKU~y1J9XQpXnqhJM~4KlCH5S*TXhgkIU1bOc>YC_m`DQ-z`sdIn#7i
zzY@>0Sbts~u`{giq&#+<qIJq(MvedT!K9F|KfL}<0mi;N^~IHTDd95C^|CD8eizeE
NEU_hKyA)hS@n4o2N+bXP

literal 0
HcmV?d00001

diff --git a/archives/21/src/main.c b/archives/21/src/main.c
new file mode 100644
index 0000000..68efa7a
--- /dev/null
+++ b/archives/21/src/main.c
@@ -0,0 +1,50 @@
+#include <stdio.h>
+#include "utils.h"
+
+/*
+    Let d(n) be defined as the sum of proper divisors of n (numbers less than n which divide evenly into n).
+    If d(a) = b and d(b) = a, where a ≠ b, then a and b are an amicable pair and each of a and b are called amicable numbers.
+
+    For example, the proper divisors of 220 are 1, 2, 4, 5, 10, 11, 20, 22, 44, 55 and 110; therefore d(220) = 284. The proper divisors of 284 are 1, 2, 4, 71 and 142; so d(284) = 220.
+
+    Evaluate the sum of all the amicable numbers under 10000.
+
+    https://projecteuler.net/problem=21
+*/
+
+int main(int argc,char**argv) {
+    int counter=1;
+    long totalSum=0;
+    while (counter<10000) {
+        //printf("Factor sum of %d: 1,",counter);
+        int factorSum=1;
+        int max=counter/2;
+        for (int i=2;i<max;i++) {
+            if (counter%i==0) {
+                factorSum+=i;
+                if (i!=(counter/i)) {
+                    factorSum+=counter/i;
+                }
+                max=counter/i;
+                //printf("%d,%d,",i,counter/i);
+            }
+        }
+        //printf("\n");
+        int factorSum2=1;
+        max=factorSum/2;
+        for (int i=2;i<max;i++) {
+            if (factorSum%i==0) {
+                factorSum2+=i;
+                factorSum2+=factorSum/i;
+                max=factorSum/i;
+            }
+        }
+        if (factorSum!=factorSum2&&counter==factorSum2) {
+            printf("%d\n",counter);
+            totalSum+=counter;
+        }
+        counter++;
+    }
+    printf("\n\nAmicable Number sum: %ld",totalSum);
+    return 0;
+}
\ No newline at end of file
diff --git a/archives/21/src/utils.c b/archives/21/src/utils.c
new file mode 100644
index 0000000..90b55a9
--- /dev/null
+++ b/archives/21/src/utils.c
@@ -0,0 +1,72 @@
+#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;
+}
+
+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");
+    }
+}
\ No newline at end of file
diff --git a/archives/21/src/utils.h b/archives/21/src/utils.h
new file mode 100644
index 0000000..4920b41
--- /dev/null
+++ b/archives/21/src/utils.h
@@ -0,0 +1,11 @@
+#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);
+void printLongDoubleArr(int a,int b,long doubleArr[a][b]);
+void printIntDoubleArr(int a,int b,int doubleArr[a][b]);
\ No newline at end of file
diff --git a/current b/current
index e2467db1833285140d45ccbf1f85665db2b14ae6..c9ba7d89fbcbb566943d2552e21bfce9040749ca 100755
GIT binary patch
delta 1208
zcmZWpZA@Eb6n@{^(vAxBwtyYD*pCT?0Ifry4g^-lyIm5pWEm5qQ}@A)ONNO;%@Sys
zDH^UF+IjY4{4xGfW3nI1?tZWgl}=|9omuy1aSLXsoic2)x)mvm=Jnj$Zgcu3=RPOT
zd!FZ<(|gm*IE|0fNDYk~uf1WqXe8RXXap<uz#q?9l%3Q~o%N0!|6kmbqsbna5-yi5
zoh`c8zv1#o$1h)vtegndrDlXWWmNZKv3S)$h%{OJss`;*0>6ttj7g#7({gZ5k^}J=
zo2O_c#aKply!9JCVl1I@VKy&ch%VY`{7Ob<3o(`ykp0t#{M2$VDaYTP4OE9&lCnge
z+RT!}rhNX8MQsSHu(FLUj7DQ@ES0lQJZhiT?CZiTf%a+5zB0_xl%?|2!%VYGqh(sP
z{1NZlSZdgftq}uuMEN^uvi<d9LZ)$Mvap!t99ik4L|LXfgiF5@oHx4(F@GR(&ZRKR
zNSdVefn*xqDD4$SvM^KHEc9jJZs~2|z#1gV5<>8v@_o6Bx-J#o_xG-HuDWUy{4{$0
zYm?fwa1}~yp|Sc0W$&*%Qubx8Y(QfZD8@DBMn8^3q|moDFTMQDYaX+GT%Dho?cIdj
zH9xuP@9&*#-&IYB|M?#Is(*KnyyWlm%WJ!($%byEclFk0@%64-_%MTOMYFnLyJB3w
zVuaI%$VU$SSk-`um`wh`LkITlKYY-!BQUuC;9HKNz+kJR>hJ);C?r)F^a)+t3)ooQ
zBYm6mV~E`;&d(zDAznf}fjEp9{EPDhqH>3GJ-*s=OPtpr?){tdUc|CxtV0}M<^rFA
zn~seY>rv`O3F$V9Dm;bJgs~T#PItuwHq>bK3Qrk^+UO|kbK0E8QQLxcgq4Wz30sQ|
zx&~TgTt^&8ox=DW&N=M`am-}+8M8EIML=B}3pSwYB-FaL77SoEtGwy*K88QcQTU|c
zSz+3yTyHSw5#iTO9$F8UMjM^LXSveRc!mmVPPp^T+sGek+Af^7!I`F4gd0|{HhWY_
zSMz6d3*2h<3OCE4v898qK(xu$Q-a^LNGgfA1&8?8sYKq2H(ywCq_z*H_B?;=@f`nY
zUb6|VwAl3Rc#8v-3Z!45zARNtn-?jFdcCsNI;Rts3~;@}W16<*L^zeTa~lpk)n<ny
soucJ`{~<8d>9tHaa^?5&h;pryQ#uRR{Juis%UupZMVF5b!OkxCKeIrdQ2+n{

delta 1532
zcmZuxeN0<b6u<YCQa%bTrHl{V`U=)j6>2v=Hom*@<|AXt%&eLjjBJIBY=Ya`p$T1C
zUaNVjO_<lrnJh+4G+W|7Q2(ge%vvyFoY9)$vM5Hfzy#Zb51AG$KF{qdOI-HS^M2?2
z&N=s-bMNhodU3*wM=EjXy!p2rdlpJP_AH{q)!D<0Yz_xIumu~vtZY7r4w*&{@;>u}
z{=(g+t>&BVQ&ag3``(^1O#51Q27*J1!+F|X6+(O<Z!wcXvw+E6?G2CUPKvIC;7+PF
zZ(W9k{9KX`=zVlaKA^142PT8zFY<vRGw3{ywn#G}19)TZ&^8KZ{PqNYbe!)C8+@^6
z`N%vgMj~rUF&ar2%n|XM<6(z+T#Wj{uBwMbdLnD8`=Nc|5sXkey2Q^Vgc$|osX|+6
zq5ROJ6jU;xu8BW2+t%&8IL8a|r$zTPFS??WTpU(FliZRFt0!RQNiHE<NpPWscj4tf
zu<EzR{oImA{2KPcn}<+{I_JONkfd|&RN7gs;7%Y{j^K`CSBAhPvERN5DdH`0a{l_i
zlC+zPyE6r-7<&R}A&iBDdN5Cb+UYi8I)Pi=G}1lMsc2;8U=~%|!Z@Z(l@`Hr#|;|a
z5lNB+_mW!Udl58fCJHlXeEY$G!%6kKpx*4)Kz`D7GIx@sqOg{^nk0t{7nyJWA^Y{S
z%<Ov5T2zk9{n?wr7uH~9ZU+0gnMUsR(ADcXbmZ68h--`BiNW2I_h32kzpyXmup23M
z7LsQhx#^(~Mn-tytIC(UCVDl7c7*6**k0%iG*6fivOV7+-m=*{#Cx{qY+};R2dX{?
z`cS8N0}d-|Uiw>-_{fIBX|VpHF$~k44-OYEsor5TJk;o3k)&UjB`F3%arOax7}wtI
z>}g<44om7sCqpPF$K+rSx%wU5Z=7ZadrtMR1O2S?SPyGG?PLdfQ|hY&{mx_6$aKPy
zjZBX0BM3jDXnX~db3raGN)o*<almVUNx&(<rX@)l0yIHmalqdJ)o{sHq4B2x*Y8Qv
zLBNmxk|ZZ!Ck%WE@EYJO@v#-9Ay~-*nW$Z*rSKR?4OK{l-CkM=-V{w4c=RAn5SCzL
zvCRtA$0^O_Yu{w{=4CQps8w)$^#Ac0$W8F)LACpSMFyq;EKuKpgvoBBLAeCl$D|81
zJ;a*GIb(&g3AD@PigB;f3tBX|Y_#N(536=Dd`a-<s!aG2l#n~tYV0KiJBsl<yo-V@
zJH{|GR8CfQo&mnE<{74~gpAd^%)DMmbhXtqWl!y=I7$|3EoD~<pej76_5oL*j1Fnh
z*)623u0^SYFP@H!GKIK|oUAMEc%0hcKCVk;q105MKAGlC#WMei45%6S0;Uvc+tNfD
zI>?W8#mb}LEr-?hL0mtFbKBuobo3vf=O3Kg6~iRVWCWuPGYZD1B4aJpIedwn4io&*
zvJZx{HX6vmR&9Zol^vVtASYWb1@mck6E6lwTP2KdlTllJc1gXQ;vvhndi)+S@7ewz
Dl{g>i

diff --git a/src/main.c b/src/main.c
index 74ce739..68efa7a 100644
--- a/src/main.c
+++ b/src/main.c
@@ -2,88 +2,49 @@
 #include "utils.h"
 
 /*
-    You are given the following information, but you may prefer to do some research for yourself.
+    Let d(n) be defined as the sum of proper divisors of n (numbers less than n which divide evenly into n).
+    If d(a) = b and d(b) = a, where a ≠ b, then a and b are an amicable pair and each of a and b are called amicable numbers.
 
-    1 Jan 1900 was a Monday.
-    Thirty days has September,
-    April, June and November.
-    All the rest have thirty-one,
-    Saving February alone,
-    Which has twenty-eight, rain or shine.
-    And on leap years, twenty-nine.
-    A leap year occurs on any year evenly divisible by 4, but not on a century unless it is divisible by 400.
-    How many Sundays fell on the first of the month during the twentieth century (1 Jan 1901 to 31 Dec 2000)?
+    For example, the proper divisors of 220 are 1, 2, 4, 5, 10, 11, 20, 22, 44, 55 and 110; therefore d(220) = 284. The proper divisors of 284 are 1, 2, 4, 71 and 142; so d(284) = 220.
 
-    https://projecteuler.net/problem=19
-*/
-
-enum Month {JANUARY=1,FEBRUARY,MARCH,APRIL,MAY,JUNE,JULY,AUGUST,SEPTEMBER,OCTOBER,NOVEMBER,DECEMBER};
+    Evaluate the sum of all the amicable numbers under 10000.
 
-int DaysInMonth(enum Month month,int year) {
-    switch (month) {
-        case JANUARY:
-        case MARCH:
-        case MAY:
-        case JULY:
-        case AUGUST:
-        case OCTOBER:
-        case DECEMBER:{
-            return 31;
-        }break;
-        case APRIL:
-        case JUNE:
-        case SEPTEMBER:
-        case NOVEMBER:{
-            return 30;
-        }break;
-        case FEBRUARY:{
-            return ((year%100==0)&&(year%400!=0))?28:(year%4==0)?29:28;
-        }break;
-    }
-}
+    https://projecteuler.net/problem=21
+*/
 
 int main(int argc,char**argv) {
-    int day=1;
-    enum Month month=1;
-    int year=1900;
-    enum Weekday{
-        SUNDAY,
-        MONDAY,
-        TUESDAY,
-        WEDNESDAY,
-        THURSDAY,
-        FRIDAY,
-        SATURDAY,
-    } weekday=MONDAY;
-
-    int sundayCount=0;
-
-    while((day!=31)||(month!=12)||(year!=2000)) {
-        printf("Date: %d/%d/%d\n",month,day,year);
-        if (year>=1901) {
-            //Start counting Sundays.
-            if (weekday==SUNDAY&&day==1) {
-                sundayCount++;
+    int counter=1;
+    long totalSum=0;
+    while (counter<10000) {
+        //printf("Factor sum of %d: 1,",counter);
+        int factorSum=1;
+        int max=counter/2;
+        for (int i=2;i<max;i++) {
+            if (counter%i==0) {
+                factorSum+=i;
+                if (i!=(counter/i)) {
+                    factorSum+=counter/i;
+                }
+                max=counter/i;
+                //printf("%d,%d,",i,counter/i);
+            }
+        }
+        //printf("\n");
+        int factorSum2=1;
+        max=factorSum/2;
+        for (int i=2;i<max;i++) {
+            if (factorSum%i==0) {
+                factorSum2+=i;
+                factorSum2+=factorSum/i;
+                max=factorSum/i;
             }
         }
-        //Increment the day.
-        if (day+1<=DaysInMonth(month,year)) {
-            day++;
-        } else 
-        if (month+1<=12){
-            //It's a new month.
-            month++;
-            day=1;
-        } else {
-            //It's a new year!
-            year++;
-            day=1;
-            month=1;
-            //printf("The year is now %d...\n",year);
+        if (factorSum!=factorSum2&&counter==factorSum2) {
+            printf("%d\n",counter);
+            totalSum+=counter;
         }
-        weekday=((weekday+1)<=SATURDAY)?weekday+1:SUNDAY;
+        counter++;
     }
-
-    printf("\n\n%d Sundays were on the 1st of the month.",sundayCount);
+    printf("\n\nAmicable Number sum: %ld",totalSum);
     return 0;
 }
\ No newline at end of file