Submission #2695964


Source Code Expand

Copy
#include <bits/stdc++.h>
using namespace std;

#define NDEBUG
#ifdef DEBUG
#include "../cout11.h"
#undef NDEBUG
#endif
#include <cassert>

typedef long long ll;
typedef long double Double;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> llll;
typedef pair<double,double> dd;

typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<ll> vll;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<long double> vD;

#define sz(a)  int((a).size())
#define pb  push_back
#define FOR(var,from,to) for(int var=(from);var<=(to);++var)
#define rep(var,n)  for(int var=0;var<(n);++var)
#define rep1(var,n)  for(int var=1;var<=(n);++var)
#define repC2(vari,varj,n)  for(int vari=0;vari<(n)-1;++vari)for(int varj=vari+1;varj<(n);++varj)
#define ALL(c)  (c).begin(),(c).end()
#define RALL(c)  (c).rbegin(),(c).rend()
#define tr(i,c)  for(auto i=(c).begin(); i!=(c).end(); ++i)
#define found(s,e)  ((s).find(e)!=(s).end())
#define mset(arr,val)  memset(arr,val,sizeof(arr))
#define mid(x,y) ((x)+((y)-(x))/2)
#define IN(x,a,b) ((a)<=(x)&&(x)<=(b))


int keta(ll x) {
    if (x == 0) return 1;
    int k = 0;
    while (x) {
        x /= 10;
        ++k;
    }
    return k;
}

ll solve(ll N){
    int best = keta(N);
    int sq = ceil(sqrt(N));
    for (int a=1; a<=sq; ++a) {
        if (N % a == 0) {
            ll b = N / a;
            // fprintf(stderr, "%lld = %d x %lld\n", N, a, b);
            int score = max(keta(a), keta(b));
            best = min(best, score);
        }
    }
    return best;
}

int main() {
    ll N; cin >> N;
    cout << solve(N) << endl;
    return 0;
}

Submission Info

Submission Time
Task C - Digits in Multiplication
User naoya_t
Language C++14 (GCC 5.4.1)
Score 300
Code Size 1765 Byte
Status
Exec Time 2 ms
Memory 256 KB

Test Cases

Set Name Score / Max Score Test Cases
Sample 0 / 0 sample_01.txt, sample_02.txt, sample_03.txt
All 300 / 300 sample_01.txt, sample_02.txt, sample_03.txt, subtask_1_1.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_2.txt, subtask_1_3.txt, subtask_1_4.txt, subtask_1_5.txt, subtask_1_6.txt, subtask_1_7.txt, subtask_1_8.txt, subtask_1_9.txt
Case Name Status Exec Time Memory
sample_01.txt 1 ms 256 KB
sample_02.txt 1 ms 256 KB
sample_03.txt 2 ms 256 KB
subtask_1_1.txt 1 ms 256 KB
subtask_1_10.txt 2 ms 256 KB
subtask_1_11.txt 1 ms 256 KB
subtask_1_12.txt 1 ms 256 KB
subtask_1_2.txt 1 ms 256 KB
subtask_1_3.txt 2 ms 256 KB
subtask_1_4.txt 2 ms 256 KB
subtask_1_5.txt 2 ms 256 KB
subtask_1_6.txt 2 ms 256 KB
subtask_1_7.txt 2 ms 256 KB
subtask_1_8.txt 2 ms 256 KB
subtask_1_9.txt 2 ms 256 KB