Submission #3560095

---

Source Code Expand

#include <bits/stdc++.h>
#define REP(i,n) for(int i=0; i<(int)(n); ++i)

using namespace std;

int main(){
    const int MAXN = 100000000 + 1;
    static int ans[MAXN] = {};
    static bool prime[MAXN] = {};
    fill(prime, prime + MAXN, 1);
    for(int i = 2; i < MAXN; i++) if(prime[i]){
        for(int j = 2 * i; j < MAXN; j += i){
            prime[j] = false;
            ans[j] = i;
        }
    }
    int n;
    while(cin >> n){
        if(n == 0) break;
        cout << (prime[n] ? n : ans[n]) << endl;
    }
    return 0;
}

Submission Info

Judge Result