aboutsummaryrefslogtreecommitdiffstats
path: root/05-Smallest-Multiple/smallmult.c
diff options
context:
space:
mode:
authormjfernez <mjfernez@gmail.com>2020-02-09 15:16:26 -0500
committermjfernez <mjfernez@gmail.com>2020-02-09 15:16:26 -0500
commit93ea7fe5957b62f18e8fbd17a21696bd7de6332d (patch)
treed90aed60d687bcf195f1150777f37cbe8a149814 /05-Smallest-Multiple/smallmult.c
parent125ec5bc3d8bfc224b7d32bcfbbc37b9fb5d441f (diff)
downloadProject_Euler_Solutions-93ea7fe5957b62f18e8fbd17a21696bd7de6332d.tar.gz
Organized everything, update README
Diffstat (limited to '05-Smallest-Multiple/smallmult.c')
-rw-r--r--05-Smallest-Multiple/smallmult.c23
1 files changed, 23 insertions, 0 deletions
diff --git a/05-Smallest-Multiple/smallmult.c b/05-Smallest-Multiple/smallmult.c
new file mode 100644
index 0000000..302f19b
--- /dev/null
+++ b/05-Smallest-Multiple/smallmult.c
@@ -0,0 +1,23 @@
+#include <stdlib.h>
+#include <stdio.h>
+
+// num: the number to divide
+// gd: the greatest divisor to count up to
+int isDivisible(int num, int gd){
+ int divisible = 1;
+ for(int i = 1; i < gd; i++){
+ if(num % i != 0)
+ divisible = 0;
+ }
+ return divisible;
+}
+
+int main(){
+ int found = 0;
+ int start = 2520;
+ while(!found){
+ start += 20;
+ found = isDivisible(start, 20);
+ }
+ printf("%d\n", start);
+}