Submission #117021

---

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <sstream>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <queue>
#include <stack>
#include <map>
#include <set>
#include <numeric>
#include <cctype>

#define rep(i, n) for(int i = 0; i < (n); i++)
#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define ALL(v) (v).begin(), (v).end()
#define REV(s) (s).rbegin(), (s).rend()
#define MEMSET(v, s) memset(v, s, sizeof(v))
#define MP make_pair
#define X first
#define Y second

using namespace std;

typedef long long ll;
typedef pair<int, int> P;

bool np[10010];
vector<int> p;

int main(){
	for(int i = 2; i < 10010; i++){
		if(!np[i]){
			for(int j = i*2; j < 10010; j+= 2){
				np[j] = 1;
			}
			p.push_back(i);
		}
	}

	int n;
	while(cin >> n, n){
		int x = 0;
		rep(i, p.size()){
			while(n%p[i] == 0){
				n/=p[i];
				x = max(x, p[i]);
			}
		}
		if(n != 1) cout << n << endl;
		else cout << x << endl;
	}
	
	return 0;
}

Submission Info

Judge Result