Submission #3731073


Source Code Expand

def inpl(): return [int(i) for i in input().split()]
Q = int(input())
for _ in range(Q):
    A, B = sorted(inpl())
    c = int(-(-(A*B)**0.5//1)-1)
    ans = A-1 + max(0, c-A) + (-((-A*B)//(c+1))-1)
    print(ans)

Submission Info

Submission Time
Task D - Worst Case
User Tallfall
Language Python (3.4.3)
Score 700
Code Size 219 Byte
Status AC
Exec Time 19 ms
Memory 3060 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 700 / 700
Status
AC × 1
AC × 12
Set Name Test Cases
Sample s1.txt
All 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, s1.txt
Case Name Status Exec Time Memory
01.txt AC 19 ms 2940 KB
02.txt AC 19 ms 2940 KB
03.txt AC 19 ms 3060 KB
04.txt AC 19 ms 2940 KB
05.txt AC 19 ms 2940 KB
06.txt AC 19 ms 2940 KB
07.txt AC 19 ms 2940 KB
08.txt AC 19 ms 2936 KB
09.txt AC 19 ms 2940 KB
10.txt AC 19 ms 2940 KB
11.txt AC 17 ms 3060 KB
s1.txt AC 18 ms 2940 KB