Submission #1982264
Source Code Expand
#include <iostream> #include <string> #include <algorithm> #include <iomanip> #include <vector> #include <map> #include <cmath> int main() { long long int n; std::cin >> n; std::string s = std::to_string(n); int ans = s.size(); for (int i = 2;i <= 100000;i++) { if (n%i == 0) { if (i < n / i) { std::string t = std::to_string(n / i); if (ans > t.size()) { ans = t.size(); } } else { std::string t = std::to_string(i); if (ans > t.size()) { ans = t.size(); } } } } std::cout << ans << std::endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Digits in Multiplication |
User | kakakakaneko |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 596 Byte |
Status | AC |
Exec Time | 2 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 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 | 2 ms | 256 KB |
sample_02.txt | AC | 2 ms | 256 KB |
sample_03.txt | AC | 2 ms | 256 KB |
subtask_1_1.txt | AC | 2 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 | 2 ms | 256 KB |
subtask_1_2.txt | AC | 2 ms | 256 KB |
subtask_1_3.txt | AC | 2 ms | 256 KB |
subtask_1_4.txt | AC | 2 ms | 256 KB |
subtask_1_5.txt | AC | 2 ms | 256 KB |
subtask_1_6.txt | AC | 2 ms | 256 KB |
subtask_1_7.txt | AC | 2 ms | 256 KB |
subtask_1_8.txt | AC | 2 ms | 256 KB |
subtask_1_9.txt | AC | 2 ms | 256 KB |