Submission #3424878

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
bool v[100000005],w[100000005];
int prime(long long n)
{
	int k=0;
	for(int i=2;i<=sqrt(n);i++)
		v[i]=false;
	for(int i=2;i<=sqrt(n);i++)
		w[i]=false;
	for(int i=2;i<=sqrt(n);i++)
	{
		if(v[i]) continue;
		w[i]=true;
		for(int j=i;j<=sqrt(n)/i;j++)
			v[i*j]=true;
	}
}
int main()
{
	int n;
	prime(1000000000000);
	while(cin>>n)
	{
	    if(n==0)
	        return 0;
    	for(int i=2;i<=n;i++)
    	{
    		if(n%i==0&&w[n/i])
    		   {
    		       cout<<n/i<<endl;
    		       break;
    		   }
    	}  
	}
	
}

Submission Info

Judge Result