prime_factorisation_seive_of_erosthenes.cpp

#include<iostream>
using namespace std;

void primefactorisationSieve(int n)
{
    int spf[100]={0};

    for(int i=2; i<=n; i++)
    {
        spf[i] = i;
    }

    for(int i=2; i<=n; i++)
    {
        if(spf[i]==i)
        {
            for(int j = i*i; j<=n; j+=1)
            {
                if(spf[j]==j)
                {
                    spf[j]=i;
                }
            }
        }
    }

    while(n!=1)
    {
        cout<<spf[n]<<" ";
        n = n / spf[n];
    }

}

int main()
{
    int n;
    cin>>n;
    primefactorisationSieve(n);
    return 0;
}