Submission #1778006
Source Code Expand
#include <bits/stdc++.h> using namespace std; using ll = long long; int main(){ ll n, ans, divisor = 1, half, prev = 1; vector<ll> div_v; cin >> n; half = n / 2 + 1; for (int i = 1; i < half; i++){ if (n % i == 0){ divisor = i; if (prev * i == n || i * i == n){ break; }else{ prev = i; } } } ans = max(n / divisor, divisor); cout << (to_string(ans)).size() << endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Digits in Multiplication |
User | misosoup |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 468 Byte |
Status | TLE |
Exec Time | 2103 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 300 | ||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_01.txt, sample_02.txt, sample_03.txt |
All | 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 | AC | 1 ms | 256 KB |
sample_02.txt | AC | 6 ms | 256 KB |
sample_03.txt | AC | 5 ms | 256 KB |
subtask_1_1.txt | AC | 1 ms | 256 KB |
subtask_1_10.txt | AC | 2 ms | 256 KB |
subtask_1_11.txt | AC | 2 ms | 256 KB |
subtask_1_12.txt | AC | 1 ms | 256 KB |
subtask_1_2.txt | AC | 1 ms | 256 KB |
subtask_1_3.txt | TLE | 2103 ms | 256 KB |
subtask_1_4.txt | AC | 5 ms | 256 KB |
subtask_1_5.txt | AC | 17 ms | 256 KB |
subtask_1_6.txt | AC | 211 ms | 256 KB |
subtask_1_7.txt | TLE | 2103 ms | 256 KB |
subtask_1_8.txt | TLE | 2103 ms | 256 KB |
subtask_1_9.txt | TLE | 2103 ms | 256 KB |