Submission #1778332

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
using ll = long long;

int main(){
  ll n, ans, divisor = 1, fin;
  cin >> n;
  fin = sqrt(n);
  for (ll i = 2; i <= fin; i++){
    if (n % i == 0){
      divisor = i;
    }
  }
  ans = max(divisor, n / divisor);
  cout << (to_string(ans)).size() << endl;
  return 0;
}

Submission Info

Judge Result