Submission #1444629

---

Source Code Expand

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <vector>
#include <queue>
 
using namespace std;
 
#define FOR(i,a,b) for (ll i = (a); i < (b); i++)
#define REP(i,n) FOR(i,0,n)
 
long gcd(long a, long b){
	if (a%b==0){
		return b;
	}
	else{
		return gcd(b,a%b);
	}
}
 
long lcm(long a, long b){
	return (a*b) / gcd(a,b);
}
 
template<typename A, typename B> inline bool chmax(A &a, B b) { if (a < b) { a = b; return 1; } return 0; }
template<typename A, typename B> inline bool chmin(A &a, B b) { if (a > b) { a = b; return 1; } return 0; }
 
typedef long long ll;

const ll INF = 1ll<<60;
const ll MOD = 1000000007;
const double EPS = 1e-10;

ll f(ll a, ll b){
	return max((ll)log10(a)+1, (ll)log10(b)+1);
}

int main(){
	ll n;
	
	cin >> n;
	
	double root = pow(n, 0.5);
	
	ll r = (ll)root;
	r++;
	
	ll a = 1;
	
	FOR(i,2,r+1){
		if (n%i == 0) a = i;
	}
	
	cout << f(a, n/a) << endl;
	
	return 0;
}

Submission Info

Judge Result