Submission #3523181

---

Source Code Expand

#include<bits/stdc++.h>
#include<iostream>
#include<iomanip>
#include<cmath>
#include<cstring>
using namespace std;
long long int a,b,c,d,n,m,i,j,k,sum,sumend;
bool cmp(int a,int b)
{
	return a>b;
}
int gcd(int a,int b)
{
	if(!b)
		return a;
	return gcd(b,a%b);
}
int gqt(int n)
{
	if(!n||n)
		return 0;
	if(n==2)
		return 1;
	for(int i=3;i<=sqrt(n);i+=2)	
		if(n%i==0)
			return 0;
	return 1;
}
int main()
{
    //while(cin>>n)
    //int n;
    while(cin>>n)
    {
        //cin>>n;
        if(n==0) 
			break;
        for(i=1;i<=n;i++)
            if(!(n%i)) 
                if(gqt(n/i))
                {
                    cout<<n/i<<endl;
                    break;
                }
    }
    /*while(cin>>n)
    {
    	//cin>>n;
        if(n==0) 
		    break;
        for(i=1;i<=n;i++)
            if(n%i==0) 
                if(gqt(n/i)==1)
                {
                    cout<<n/i<<endl;
                    break;
                }
    }*/
    return 0;
}

Submission Info

Judge Result