Submission #2120054

Source Code Expand

n=int(input())
import sys
ans = sys.maxint
for h in range(n):
    for w in range(n):
        if h*w > n: break
        ans = min(max((n-h*w), 0)+abs(h-w), ans)

print(ans)

    
b

Submission Info

Submission Time
Task B - □□□□□
User d0iasm
Language Python (3.4.3)
Score 0
Code Size 190 Byte
Status RE
Exec Time 17 ms
Memory 2940 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 100
Status
RE × 3
RE × 15
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 RE 17 ms 2940 KB
sample_02.txt RE 17 ms 2940 KB
sample_03.txt RE 17 ms 2940 KB
subtask1_01.txt RE 17 ms 2940 KB
subtask1_02.txt RE 17 ms 2940 KB
subtask1_03.txt RE 17 ms 2940 KB
subtask1_04.txt RE 17 ms 2940 KB
subtask1_05.txt RE 17 ms 2940 KB
subtask1_06.txt RE 17 ms 2940 KB
subtask1_07.txt RE 17 ms 2940 KB
subtask1_08.txt RE 17 ms 2940 KB
subtask1_09.txt RE 17 ms 2940 KB
subtask1_10.txt RE 17 ms 2940 KB
subtask1_11.txt RE 17 ms 2940 KB
subtask1_12.txt RE 17 ms 2940 KB