aboutsummaryrefslogtreecommitdiffstats
diff options
context:
space:
mode:
authormjf <mjf@localhost.localdomain>2020-02-04 16:22:29 -0500
committermjf <mjf@localhost.localdomain>2020-02-04 16:22:29 -0500
commitcd692dd6425eeb2c2e96565de36ed571ea00f8ff (patch)
treeac86782b35bd097ed184ce1d7a39b85fbefa80e9
parent20bc571dc655d0774529dd1f5517342e934809d5 (diff)
downloadProject_Euler_Solutions-cd692dd6425eeb2c2e96565de36ed571ea00f8ff.tar.gz
adding palindrome.c, for some reason does not work at 13, bu works for 4, fix later
-rwxr-xr-xproductofdigitsbin0 -> 16736 bytes
-rw-r--r--productofdigits.c46
-rw-r--r--productofdigits.py1
3 files changed, 46 insertions, 1 deletions
diff --git a/productofdigits b/productofdigits
new file mode 100755
index 0000000..2b5d859
--- /dev/null
+++ b/productofdigits
Binary files differ
diff --git a/productofdigits.c b/productofdigits.c
new file mode 100644
index 0000000..fc7606d
--- /dev/null
+++ b/productofdigits.c
@@ -0,0 +1,46 @@
+#include <stdlib.h>
+#include <stdio.h>
+
+const char bigBoy[1001] = "73167176531330624919225119674426574742355349194934"
+ "96983520312774506326239578318016984801869478851843"
+ "85861560789112949495459501737958331952853208805511"
+ "12540698747158523863050715693290963295227443043557"
+ "66896648950445244523161731856403098711121722383113"
+ "62229893423380308135336276614282806444486645238749"
+ "30358907296290491560440772390713810515859307960866"
+ "70172427121883998797908792274921901699720888093776"
+ "65727333001053367881220235421809751254540594752243"
+ "52584907711670556013604839586446706324415722155397"
+ "53697817977846174064955149290862569321978468622482"
+ "83972241375657056057490261407972968652414535100474"
+ "82166370484403199890008895243450658541227588666881"
+ "16427171479924442928230863465674813919123162824586"
+ "17866458359124566529476545682848912883142607690042"
+ "24219022671055626321111109370544217506941658960408"
+ "07198403850962455444362981230987879927244284909188"
+ "84580156166097919133875499200524063689912560717606"
+ "05886116467109405077541002256983155200055935729725"
+ "71636269561882670428252483600823257530420752963450";
+
+int parseNum(const char *x, int r){
+ long len = 1001;
+ int max = 0;
+ printf("%s\n", x);
+ for(int i = 0; i < len - r; i++){
+ // Digits in ascii start at 48
+ int prod = (int) (x[i] - 48);
+ for(int k = i + 1; k < i + r; k++)
+ prod *= (int) (x[k] - 48);
+ if(prod > max)
+ max = prod;
+ }
+ return max;
+}
+
+
+
+int main(){
+ int p = parseNum(bigBoy, 13);
+ printf("%d\n", p);
+ return 0;
+}
diff --git a/productofdigits.py b/productofdigits.py
index 3e7756e..0d1e132 100644
--- a/productofdigits.py
+++ b/productofdigits.py
@@ -1,6 +1,5 @@
import PIL
import math
-import numpy as np
# Problem 8 - largest Product in a series
bigBoy = 7316717653133062491922511967442657474235534919493496983520312774506326239578318016984801869478851843858615607891129494954595017379583319528532088055111254069874715852386305071569329096329522744304355766896648950445244523161731856403098711121722383113622298934233803081353362766142828064444866452387493035890729629049156044077239071381051585930796086670172427121883998797908792274921901699720888093776657273330010533678812202354218097512545405947522435258490771167055601360483958644670632441572215539753697817977846174064955149290862569321978468622482839722413756570560574902614079729686524145351004748216637048440319989000889524345065854122758866688116427171479924442928230863465674813919123162824586178664583591245665294765456828489128831426076900422421902267105562632111110937054421750694165896040807198403850962455444362981230987879927244284909188845801561660979191338754992005240636899125607176060588611646710940507754100225698315520005593572972571636269561882670428252483600823257530420752963450