I'm thinking of a program that uses prime numbers to perform prime factorization of integers.

#include<stdio.h>

void p_flag(int flag[], intn){
    inti,j;
    for(i=2;i<=n;i++){
        flag[i] = 1;
        printf("~~%d~~",i); 
        if(i<=3){
            for(intk=2;k<=i-1;k++){
                if(flag[k]!=0){
                    int check = i%k;
                    printf("%d",k); 
                    if(check==0){
                        flag[i] = 0;    
                    }
                }
            }
        }
    }

}

int main(void){
    /* void p_flag();*/
    int flag [10000], m, md, i;
    printf("integer2 or above:\n";
    scanf("%d", & m);

    p_flag(flag,m);

    md = m;
    For(i=2;i<m/*flag[i]Number of elements */;i++){
        if(flag[i]!=0){
            while(m/flag[i]!=1){
                printf("%d", flag[i]);
                md = m/flag[i];
            }
        }
    }
}