Submission #10127285

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define mod 1000000007

int d(ll n);

int main(){
    ll t; cin >> t;
    ll sq = sqrtl(t);
    int ma = INT_MIN;
    for(int i = 1; i <= sq; i++){
        if(t%i != 0) continue;
        ll s = t/i;
        ma = max(d(s), d(i));
    }
    cout << ma << endl;
    return 0;
}

int d(ll n){
    int c = 0;
    while(n != 0){
        n/=10;
        c++;
    }
    return c;
}

Submission Info

Judge Result