Submission #1535484

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;  
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
#define rep(i,n) for(ll i=0;i<(n);i++)  
#define pii pair<int,int>
#define piii pair<int,pii>
#define mp make_pair
#define pb push_back  
#define ALL(a) (a).begin(),(a).end()
#define FST first
#define SEC second  
const int INF = (INT_MAX/2);
const ll LLINF = (LLONG_MAX/2);
const double eps = 1e-5;
const double PI = M_PI;  
#define DEB cout<<"!"<<endl
#define SHOW(a,b) cout<<(a)<<" "<<(b)<<endl
#define SHOWARRAY(ar,i,j) REP(a,i)REP(b,j)cout<<ar[a][b]<<((b==j-1)?((a==i-1)?("\n\n"):("\n")):(" "))
  
#define DIV 1000000007
typedef vector<ll> Array;
typedef vector<Array> matrix;
typedef tuple<int,int,int> tiii;
#define mt make_tuple


bool check(ll in){
  if(in == 2 || in == 3) return true;
  for(ll i = 2;i*i <= in;i++){
    if(in % i == 0) return false;
  }
  return true;
}

int main(){
  ll n;
  while(cin >> n,n){
    ll ans = 0;
    for(ll i = 1; i*i <= n;i++){
      if(n%i == 0){
        if(check(i)) ans = max(ans,i);
        if(check(n/i)) ans = max(ans,n/i);
      }
    }
    cout << ans << endl;
  }
}

Submission Info

Judge Result