Submission #3341260

---

Source Code Expand

#include<iostream>
#include<cmath>
using namespace std;
inline bool isprime(int x)
{
	for(register int i=2;i<=sqrt(x);i++)
	{
		if(x%i==0) return false;
	}
	return true;
}
inline int find(int x)
{
	int ans;
	for(register int i=2;i<=x;i++)
	{
		if(x%i==0)
		{
			ans=i;
			x/=i;
			i=1;
		}
	}
	return ans;
}
int main()
{
	int t;
	while(cin>>t)
	{
		if(t==0) return 0;
		cout<<find(t)<<endl;
	}
	return 0;
}

Submission Info

Judge Result