Cel mai mare factor prim la puterea cea mai mica - partial

#include <iostream>
using namespace std;
int main()
{
    int n,d=2,p,pmin=1000000,sol;
    cin>>n;
    while(n>1){
        p=0;        /// puterea unui factor prim

        while(n%d==0){
            n=n/d;
            p++;
        }
        if(p>0){///am gasit un factor prim
            if( pmin > p){
                pmin = p;
                sol = d;
            }
            ///cout<<d<<"^"<<p;

        }
        d++;
        if(d*d>n && n!=1){

            n=n/n;
        }

    }
    cout<<sol;
    return 0;
}