Submission #117040

---

Source Code Expand

#include <iostream>
#include <iomanip>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <complex>
#include <cstring>
#include <cstdlib>
#include <string>
#include <cmath>
#include <cassert>
#include <queue>
#include <set>
#include <map>
#include <valarray>
#include <bitset>
#include <stack>
using namespace std;

#define REP(i,n) for(int i=0;i<(int)n;++i)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
#define ALL(c) (c).begin(), (c).end()
#define chmax(a,b) (a<(b)?(a=b,1):0)
#define chmin(a,b) (a>(b)?(a=b,1):0)
#define valid(y,x,h,w) (0<=y&&y<h&&0<=x&&x<w)
const int INF = 1<<29;
const double EPS = 1e-8;
const double PI = acos(-1);
typedef pair<int,int> pii;
typedef long long ll;

map<ll, int> factorize(ll n) {  // O(√n)
  map<ll, int> res;
  for (ll i=2; i*i<=n; ++i) {
    int cnt = 0;
    while (n%i==0) {
      n /= i;
      cnt++;
    }
    if (cnt) {
      res[i] = cnt;
    }
  }
  if (n!=1) res[n] = 1;
  return res;
}

int main() {
  int n;
  while(cin>>n,n) {
    map<ll,int> a = factorize(n);
    int ans = 0;
    FOR(it, a) chmax(ans,it->first);
    cout << ans << endl;
  }
}

Submission Info

Judge Result