Submission #1607694
Source Code Expand
import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner sc = new Scanner(System.in); long N = sc.nextLong(); int ans = kazoeru(N); for(long i = 1L;i * i <= N; i++) { if(N % i != 0) { continue; } long b = N / i; int s = Math.max(kazoeru(i), kazoeru(b)); if(ans > s) { ans = s; } } System.out.println(ans); } public static int kazoeru(long i) { int ret = 1; while(i >=10) { i /= 10; ret++; } return ret; } }
Submission Info
Submission Time | |
---|---|
Task | C - Digits in Multiplication |
User | naoppy |
Language | Java8 (OpenJDK 1.8.0) |
Score | 300 |
Code Size | 530 Byte |
Status | AC |
Exec Time | 105 ms |
Memory | 21844 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 | 93 ms | 19924 KB |
sample_02.txt | AC | 92 ms | 19796 KB |
sample_03.txt | AC | 94 ms | 20564 KB |
subtask_1_1.txt | AC | 95 ms | 21844 KB |
subtask_1_10.txt | AC | 105 ms | 19024 KB |
subtask_1_11.txt | AC | 101 ms | 17748 KB |
subtask_1_12.txt | AC | 92 ms | 18900 KB |
subtask_1_2.txt | AC | 91 ms | 19796 KB |
subtask_1_3.txt | AC | 94 ms | 20692 KB |
subtask_1_4.txt | AC | 92 ms | 21076 KB |
subtask_1_5.txt | AC | 92 ms | 21076 KB |
subtask_1_6.txt | AC | 97 ms | 21204 KB |
subtask_1_7.txt | AC | 104 ms | 18644 KB |
subtask_1_8.txt | AC | 95 ms | 16976 KB |
subtask_1_9.txt | AC | 101 ms | 21844 KB |