/media/sda-magnetic/david/Dokumente-15/fernuni-hagen/cs-i-ii/fsm/fsm/2021-04-21quine-state-.../prim4.c

#include <stdio.h>

int a [4069];
int n = 0;


int is_prim (int x) {
    int i;
    
    if (x == 2)
        return 1;
    
    if ((x % 2) == 0)
        return 0;
    
    for (i = 3;  i < x;  i += 2) 
        if ((x % i) == 0)
            return 0;
return 1;
}

#define MAX 5

int mult_prim () {
    int x;
    
    int i1, i2, i3, i4, i5;
    
    
    
    for (i1 = 0, n = 5;  i1 < MAX;  i1++) {
        for (i2 = 0;  i2 < MAX;  i2++) {
            a [n++] = a[i1]*a[i2]+1;
            printf ("%i\n", a[i1]*a[i2]+1);
            for (i3 = 0;  i3 < MAX;  i3++) {
                a [n++] = a[i1]*a[i2]*a[i3]+1;
                printf ("%i\n", a[n-1]);
                for (i4 = 0;  i4 < MAX;  i4++) {
                    a [n++] = a[i1]*a[i2]*a[i3]*a[i4]+1;
                    printf ("%i\n", a[n-1]);
                    for (i5 = 0;  i5 < MAX;  i5++) {
                        a [n++] = a[i1]*a[i2]*a[i3]*a[i4]*a[i5]+1;
                        printf ("%i\n", a[n-1]);
                    }
                }
            }
        }
    }
}

void sort () {
    int i, j;
    int tmp;
    
    for (i = 0;  i < n;  i++) {
        for (j = i;  j < n;  j++) {
            if (a [i] > a[j]) {
                tmp = a[i];
                a [i] = a[j];
                a [j] = tmp;
            }
        }
    }
}

int main (void) {
    int i;
    int x;
    
    
    x = 6;
    
    for (x = 2, n = 0;  x < 20;  x++) {
        if (is_prim (x) == 0)
            printf ("%i ist keine Primzahl\n", x);
        else {   
            printf ("%i ist eine Primzahl\n", x);
            a [n++] = x;
        }
    }
    
    for (i = 1;  i < n;  i++)
        printf ("%i\n", a [i]);
    mult_prim ();
    
    sort ();
    
    for (i = 0;  i < n;  i++)
        printf ("%i  ", a [i]);
    
return 0;
}