From bef67514a9d721fbe05a202107921d78931b5e9a Mon Sep 17 00:00:00 2001
From: glazk0 <43091603+glazk0@users.noreply.github.com>
Date: Sat, 7 Oct 2023 19:58:41 +0200
Subject: [PATCH] multiple, andor multiplications multiples

---
 semaine-3/and-or/main.c                    | 15 ++++++++++++++
 semaine-3/multiple/main.c                  | 17 ++++++++++++++++
 semaine-3/multiplications-multiples/main.c | 23 ++++++++++++++++++++++
 3 files changed, 55 insertions(+)
 create mode 100644 semaine-3/and-or/main.c
 create mode 100644 semaine-3/multiple/main.c
 create mode 100644 semaine-3/multiplications-multiples/main.c

diff --git a/semaine-3/and-or/main.c b/semaine-3/and-or/main.c
new file mode 100644
index 0000000..65f080d
--- /dev/null
+++ b/semaine-3/and-or/main.c
@@ -0,0 +1,15 @@
+#include <stdio.h>
+#include <stdlib.h>
+int main(void) {
+
+  int tourellePrincipaleActive = 0, pourcentageArmesSecondairesActives = 71, radarActif = 0;
+
+  if ((tourellePrincipaleActive || pourcentageArmesSecondairesActives > 70) && radarActif) {
+    printf("Vaisseau sécurisé");
+  } else {
+    printf("Alerte sécurité");
+  }
+
+  return EXIT_SUCCESS;
+}
+
diff --git a/semaine-3/multiple/main.c b/semaine-3/multiple/main.c
new file mode 100644
index 0000000..6f70c37
--- /dev/null
+++ b/semaine-3/multiple/main.c
@@ -0,0 +1,17 @@
+#include <stdio.h>
+#include <stdlib.h>
+
+int main(void) {
+
+  int i, element, list[] = {1281, 3281, 5281, 7481, 8281, 9581, 108281};
+  size_t n = sizeof(list) / sizeof(int);
+
+  for (i = 0; i < n; ++i) {
+    element = list[i];
+    if (element % 7 == 0 && element % 13 == 0) {
+      printf("%d\n", element);
+    }
+  }
+
+  return EXIT_SUCCESS;
+}
diff --git a/semaine-3/multiplications-multiples/main.c b/semaine-3/multiplications-multiples/main.c
new file mode 100644
index 0000000..3a72c77
--- /dev/null
+++ b/semaine-3/multiplications-multiples/main.c
@@ -0,0 +1,23 @@
+#include <stdio.h>
+#include <stdlib.h>
+
+#define TARGET 10
+#define MAX 9
+
+int main(void) {
+
+  int i, j, n = 0, result;
+
+  for (i = 1; i <= MAX; i++) {
+    for (j = 1; j <= TARGET; j++) {
+      result = i * j;
+      if ((result % 2 == 0 && result % 4 == 0) && result % 3 != 0) {
+        n++;
+      }
+    }
+  }
+
+  printf("%d", n);
+
+  return EXIT_SUCCESS;
+}