Submission #1183583

---

Source Code Expand

#include <cstdio>
#include <algorithm>
#include <iostream>
#include <vector>
#define INF (int)1e9
#define pb push_back
using namespace std;
int keta(long long int n){
  int i=1;
  while(n>9){
    i++;
    n/=10;
  }
  return i;
}

int main(void){
  long long int n,nn;
  vector<long long int>fact;
  cin>>n;
  int i=2;

  while(n!=1){
    if(n%i==0){
      fact.pb(i);
      n/=i;
      i=2;
    }
    else i++;
  }
  long long int a,b;
  a=b=1;
  for(i=fact.size()-1;i>=0;i--){
    if(keta(a)>keta(b)){
      b*=fact[i];
    }
    else a*=fact[i];
  }
  cout<<max(keta(a),keta(b))<<endl;
  return 0;
}

Submission Info

Judge Result