/media/sda-magnetic/david/Dok-15-2023-11-27/fernuni-hagen/cs-i-ii/old-cs-2-03/2021-04-21quine-state-.../prim5.c

#include <stdio.h>

void prim_div (int x) {
    int i;
        
    for (i = 3;  i < x;  i += 2) {
        if ((x % i) == 0) {
            printf("%i: %i, %i; ", x, i, x/i);
            prim_div (i);
            prim_div (x / i);
        }
    }
}

int main (void) {
    int i;
    int x;
    
    

        x = 576172;
        prim_div (x);    
        printf ("\n");
        x = 712835;
        prim_div (x);
        printf ("\n");
        x = 781238;
        prim_div (x);
        printf ("\n");
        x = 812879;
        prim_div (x);
        printf ("\n");

    
return 0;
}