Submission #1606255
Source Code Expand
#include<iostream> #include<cmath> #define loop(i,a,b) for(long long i=a;i<b;i++) #define rep(i,a) loop(i,0,a) #define eps 1e-6 #define INF 1e12 using namespace std; long long keta(long long a,long long b){ double p=log(a)/log(10),q=log(b)/log(10); if(p>q)return p+1; else return q+1; } int main(){ long long n,ans=INF; cin>>n; loop(i,1,sqrt(n)+1){ if(abs((double)n/i-n/i)<eps){ ans=min((double)ans,(double)keta(i,n/i)); } } cout<<ans<<endl; return 0; }
Submission Info
Submission Time | |
---|---|
Task | C - Digits in Multiplication |
User | tuki_remon |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 495 Byte |
Status | AC |
Exec Time | 4 ms |
Memory | 640 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 | 4 ms | 640 KB |
sample_02.txt | AC | 1 ms | 256 KB |
sample_03.txt | AC | 3 ms | 256 KB |
subtask_1_1.txt | AC | 1 ms | 256 KB |
subtask_1_10.txt | AC | 3 ms | 256 KB |
subtask_1_11.txt | AC | 1 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 | AC | 3 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 | 3 ms | 256 KB |
subtask_1_8.txt | AC | 3 ms | 256 KB |
subtask_1_9.txt | AC | 3 ms | 256 KB |