From 39df1e74756109e1aae833cf72f81413c643ed63 Mon Sep 17 00:00:00 2001
From: Greg Gauthier <gmgauthier@protonmail.com>
Date: Sun, 19 Oct 2025 15:30:28 +0100
Subject: [PATCH] should be happy path

---
 jcl/SIEVE05.jcl |  5 +++++
 src/SIEVE05.c   | 46 ++++++++++++++++++++++++++++++++++++++++++++++
 2 files changed, 51 insertions(+)
 create mode 100644 jcl/SIEVE05.jcl
 create mode 100644 src/SIEVE05.c

diff --git a/jcl/SIEVE05.jcl b/jcl/SIEVE05.jcl
new file mode 100644
index 0000000..9dfc009
--- /dev/null
+++ b/jcl/SIEVE05.jcl
@@ -0,0 +1,5 @@
+//SIEVE05 JOB (GCC),'Sieve 5 Program Example',
+//             NOTIFY=@05054,CLASS=A,MSGCLASS=H,
+//             MSGLEVEL=(1,1),REGION=4M,TIME=1440
+//STEP1 EXEC GCCCG,INFILE='@05054.SRCLIB.C(SIEVE05)'
+//
\ No newline at end of file
diff --git a/src/SIEVE05.c b/src/SIEVE05.c
new file mode 100644
index 0000000..f17c422
--- /dev/null
+++ b/src/SIEVE05.c
@@ -0,0 +1,46 @@
+#include<stdio.h>
+
+#define LIMIT 10000
+#define PRIMES 1000
+
+int main()
+{
+   int i,j,numbers[LIMIT];
+   int primes[PRIMES];
+
+   for (i=0;i<LIMIT;i++)
+   {
+      numbers[i]=i+2;
+   }
+
+   for (i=0;i<LIMIT;i++)
+   {
+      if (numbers[i]!=-1)
+      {
+         for (j=2*numbers[i]-2;j<LIMIT;j+=numbers[i])
+            numbers[j]=-1;
+      }
+   }
+
+   j = 0;
+   for (i=0;i<LIMIT&&j<PRIMES;i++)
+     if (numbers[i]!=-1)
+        primes[j++] = numbers[i];
+
+   printf("\n");
+   printf("PRIME NUMBERS BETWEEN 1 AND %d\n",LIMIT);
+   printf("TOTAL PRIMES FOUND: %d\n\n",PRIMES);
+   printf("LIST OF PRIMES:\n\n");
+
+   for (i=0;i<PRIMES;i++)
+      if (i % 20 == 0)
+      {
+         printf("\n %4d ",primes[i]);
+      }
+      else
+      {
+         printf("%4d  ",primes[i]);
+      }
+
+   return 0;
+}