Submission #117019

---

Source Code Expand

#include <iostream>
#include <vector>
#include <cstdio>
#include <algorithm>
#include <queue>
#include <complex>
using namespace std;

vector<int> factor(int n){
	vector<int> ret;
 
	int i = 2;
	while(i*i<=n){
		if(n%i==0)ret.push_back(i) , n/=i , i = 2;
		else i++;
	}
	if(n!=1)ret.push_back(n);
 
	return ret;
}


int E[15][15];
int main(){
	int N;
	while(cin >> N && N){
		vector<int> v = factor(N);
		cout << v[v.size()-1] << endl;
	}
	
}

Submission Info

Judge Result