From 1d8678eeb53eb48d376e0ed5da2c3b1b13ca2191 Mon Sep 17 00:00:00 2001 From: Jonathan Chan Date: Sun, 26 Aug 2018 23:38:26 -0700 Subject: [PATCH] Problem 87 attempt --- 87 | Bin 0 -> 13296 bytes 87.c | 36 ++++++++++++++++++++++++++++++++++++ 2 files changed, 36 insertions(+) create mode 100644 87 create mode 100644 87.c diff --git a/87 b/87 new file mode 100644 index 0000000000000000000000000000000000000000..a88eac9aab6362ab49a83f35e1ca243226973dc8 GIT binary patch literal 13296 zcmeHOeQaFSmA^A%$A%;`6Kbdlh)i43hHNr8!5F6z<&EPPo+Br56Aw#2l9#b(Y!8e* zX66kf>^itIMNHjFqnc9*^MU6`vBsb<}7QvhPAP zY?7?Pn#DCj6YIpyVg-3Rkn&2AaK^%rL##hEao^*h8XJ z-$K$<)~4?VY?i4IAqkKk`6_OaEa)LSqv&Df$FQQTM=a^pE4_Lp&$OT%W6JHLw$at8 z>~(rIaKvjwM60|nP?Dw8@mniS`3ApaK{c6S+G)drDeHY2da`}0{Qn|BC9qG`w^UpN z$3s!oTyc9U+11o|dn&#;l^n<&-h8;ZX>(I!IGYY{mF*_`Bzy0ksH}Xx+|x@euQ-SLiPive}d$76{J@J3su1X3RoriuPuT1 zErG|Ez<;m={;ehOPXG_$a;I+tsO0CDm%y8Vhj6*mE&w4n2tI|Yl6`@G?x${T5@uWH zZZn?9BzlusE0O8ky(5(#NOZ=!QVC(2z5VF{Gi${%mT3xe*Td#MCAT9L%VrZsIxVx$Xze?!E`jo>(#^GKp9!mF^aUndE@gBf4#_-zKI>n#zOz zSaLx0WD*H+Z+lzI4s&aGYxvGmz7cJu@#w?73V&Y7*>`(%(%7RvA!rG*38faNs=m zsjR_)JJ-i%2ku-SGzU&~b21z_uVqx$;lQtDVbJ>>IL$Fmha9+C%4Cr-a(`8zWxnqP0>9$2R#M?B3sF;kdFTK@p?6snmi$#)S?-8nNZ z`OgyXBmOzb?<1Z(*cM(q^nmHl)7UC&1GsBYqB=HoInL){KC7wbtb4c5%;2*M~&U3Ggy)d8;k|i-Sh~bz|iGY)5C?vmqltR5V70io&WP;>p!W`3rk{0&kCB zG6Ea*V)2Em^Yh4V8aML#oH41-Qr}&;#TeC##y5=L4b2+)DYTtc>x>b7)`QYnW4k_g zbb5@s{^iqUHRf}LvRbc|way%eB;j7$8y`%P@`WP~Z#KETfq=NsBssU z&j+j25{fMpQk`~hMAC>#9AyU&uJ~xF5&O&Y47#a8cl)N+Ylf~XY z%+DM77lEHO@1haYt=EbGJXC}BmW@QT|3K&I`#dn}#dqH)erwUXxXp!iJJ&;8( zf*?gB|C;n0!F+t&y4@~8z@i0X;&q?lp{78{3xd|#DxRq`!h_B&(5*;4TtuX%kA5Gy z0&=rMjWV|oebk2V$eI$;H;kW=p*dl#gdhr|bL1zq7lucE=pv$A7}YN#zQ##%a&4(u z1&Cw($=2K;>lzKxI6H}6hHo_Pz;4$s9(~;|6=&2afFH02P6imm`eN}v{)ghbX*{pL zKdE1qHd{+JFH4(&=LMp(aa6zTf!N%I`cnCvs#8#zJ~yh*QLTj$a6q=}?;rh#6QxFJ zabvV<{RUJ)Gib}Wag4?&#rMpqzqtv6<0J-0UN21QQ{={^{wk4~n=w2l^=X+uFY$9S z|0CStNO3g!s?q(5-Cq=G9y=H?!PRd;x%kX`)WkK^g(N<`wD=hke+c3jXj7L0_eamt za8!Edme%_^>1~tM+^<82!g>A+L+2lxeb4(?)rdZYPC18=oZGG!hUAhl8Z9@6HFSUA z_$I7LBl;0mFzM+@wTDhWh}146#mFxM(&H`=OfWb zXZx}B1Hlj$^JANd?r+OqY0Lkz{We-zYmJFN_=>0IP}LXTvO-&a!|Q*0{>}FMl~!1o zuRCXqoc0*oF67>%2kPezL_Qxm5IGnzPoG$LUc7r6y-oJiBbR>1P&#Gw{mVbrUA||1 z-1&4Dnk*ExiUu{$O}_1&0O1Q9k|9!AUWi*!M)G67 zgKZM@2Y34GcLi2HQadc}S-XAX9k+gzV3KLYwG+N)2#ENDPk48%Ug7OW&31Vl@Ja5) zQu$9x<&UGh0d4K2HgLJG%R>TW|2w!IK@5HgS}ONWmGoZ%ya}=Sd71uMso#pS^SBC# zSprnF_=8V*Tm1FMeY!t%tg6Mo;mg&Azu}1$hQE2FX18C<_?sjChKPSdi$4T8$hY`w zWt=v_el13>-P2@jIW0$EIReWOSdPGQ1ePPP9D(HsEJt8D0?QFtj=-N=1VX&EXQ~3A zw&kU763o*#4@#?SA_iAzGKY^JGF`@NZb~=GJ8tTGDPEt*gsrtqYZa|k<+NX>#O42e zbv{k}Nv}qv^vyR^W%KmHp3<0CBOHGxh+Sx zG=&=)!`p7N@zBm{yK?#J(s(P! zR|p=L<#>&#)So_#avlfe^4H+Yl;(tF-iOi6W_#QIP8|7J zI2dGF{bn~E4Z@ipGoChkQ|Yc)%8Xm-OxBF$4vX$||6nR%CF0?`?%dW`S;*{34kXQ3 zCKEeiCI+m`5gg}<^(V}DuD|~XR2-ZMNvlj02ZZ_)S$NodmvnRIzQ}If)c3T~(In|K z=gU;%!fgG_p2+UD9guRA$Wu*#a8}LK4b!$}wC)q;z3qEjBJJkhojdpIon~jGrCp~Q zpoC9TiLuYi@tlW4unRqy{ zw@1&!taR4uOV9uo;p~xqE7k>SWo+8VIUGVuWClfeAZ;bWk(Rd2R;*WXy#u*$S1yUu zk;%9S6W15Z_K9%($N=ow)XLZ;4<|C&WO|^CF;SLDq++C?a)T*Lgk`kC$cB5GhjW&JU)29EZzlGrEPkfr@C zwcWk1ybqWU7whxBBcvSV{Vzmha>wr=P}+O4KJQPiD1AO2&Hl3-(+8nXds*grA5*Us zI_zqt|0KiyD_GF)PO6IadA}o1c&f?PlAGyb^JZ&7l*FB(<~yniQ_blm#Kfl*BO z{Q&DlE*3JaSHb-e;Xq`p=al?F@c-$i(z(;GFurAJb@1BC)?Vx0rt# z1x|hb-O-`+zs(I(2Do0f_pD2w_ji}o3mkrL!Se3*|3K+;|MBlC{8W>vffW^Xx99JG zlmD#G=i2$ad#6j^T|XUvbL#WH@<~;{MTL&!uK#6}ktod}nRwr*2EJR~&C~Cr04~<& zeQNCo)c<$rl8da*``O?J)PDoI)WxjN`(FP4go0{64+Hj}$H7Tg{k%V(TZaN9mbbYD zp7FO);Pk(=j}F-yeXOV`>oJ`J?$qbs{e2-@f&EnKi~PBY0+0 zoG0o-{)P><{@X6&?)v{1fJ|Jo literal 0 HcmV?d00001 diff --git a/87.c b/87.c new file mode 100644 index 0000000..5e8549a --- /dev/null +++ b/87.c @@ -0,0 +1,36 @@ +// largest prime i where i^2 + 2^3 + 2^4 = 50000000 is 7069 +// largest prime j where 2^2 + j^3 + 2^4 = 50000000 is 367 +// largest prime k where 2^2 + 2^3 + k^4 = 50000000 is 83 + +#include +#include +#include +#include +#include "primes.h" + +#define SIZE 50000000 + +int main(void) { + long* primes; + bool* primesTable; + int length = listOfPrimes(sqrt(SIZE - 24), &primes, &primesTable); + //bool visited[SIZE] = {false}; + int count = 0; + + for (int i = 0; i < length && primes[i] <= 7069; i++) { + for (int j = 0; j < length && primes[j] <= 367; j++) { + for (int k = 0; k < length && primes[k] <= 83; k++) { + int n = pow(primes[i], 2) + pow(primes[j], 3) + pow(primes[k], 4); + if (n < SIZE) { //&& !visited[n]) { + count++; + //visited[n] = true; + } + } + } + } + + printf("%d\n", count); + + free(primes); + free(primesTable); +} \ No newline at end of file