Submission #1440527
Source Code Expand
def ri(): return int(input()) def rli(): return list(map(int, input().split())) def rls(): return list(input()) def pli(a): return "".join(list(map(str, a))) n = ri() mi = 1145148101919 for i in range(1000): for j in range(317): if(i*j <= n): mi = min(mi, n - i*j + abs(i-j)) print(mi)
Submission Info
Submission Time | |
---|---|
Task | B - □□□□□ |
User | AokabiC |
Language | Python (3.4.3) |
Score | 100 |
Code Size | 323 Byte |
Status | AC |
Exec Time | 173 ms |
Memory | 3060 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 100 / 100 | ||||
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, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample_01.txt | AC | 47 ms | 3060 KB |
sample_02.txt | AC | 49 ms | 3060 KB |
sample_03.txt | AC | 173 ms | 3060 KB |
subtask1_01.txt | AC | 51 ms | 3060 KB |
subtask1_02.txt | AC | 49 ms | 2940 KB |
subtask1_03.txt | AC | 49 ms | 2940 KB |
subtask1_04.txt | AC | 145 ms | 3060 KB |
subtask1_05.txt | AC | 144 ms | 3060 KB |
subtask1_06.txt | AC | 140 ms | 3060 KB |
subtask1_07.txt | AC | 122 ms | 3060 KB |
subtask1_08.txt | AC | 139 ms | 2940 KB |
subtask1_09.txt | AC | 133 ms | 3060 KB |
subtask1_10.txt | AC | 54 ms | 3060 KB |
subtask1_11.txt | AC | 118 ms | 2940 KB |
subtask1_12.txt | AC | 114 ms | 3060 KB |