Submission #3359905

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <cmath>
using namespace std;
long long n,ans;
bool pan(long long x)
{
    for(long long i=2;i*i<=x;i++)
        if(x%i==0)
		return false;
    return true;
}

int main()
{
    while(1)
    {
        cin>>n;
        if(!n)
		break;
        long long l=0;
        for(long long i=1;i*i<=n;i++)
        {
            if(n%i!=0)
			continue;
			long long o=n/i;
            if(pan(o))
                l=max(o,l);
            if(pan(i))
                l=max(i,l);
        }
        cout<<l<<"\n";
    }

    return 0;
}

Submission Info

Judge Result