Submission #3731055


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 0
Code Size 217 Byte
Status WA
Exec Time 20 ms
Memory 3060 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 0 / 700
Status
WA × 1
AC × 4
WA × 8
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 3060 KB
03.txt AC 19 ms 3060 KB
04.txt AC 19 ms 3060 KB
05.txt WA 19 ms 3060 KB
06.txt WA 19 ms 3060 KB
07.txt WA 19 ms 2940 KB
08.txt WA 19 ms 2940 KB
09.txt WA 20 ms 3060 KB
10.txt WA 20 ms 2940 KB
11.txt WA 18 ms 2940 KB
s1.txt WA 18 ms 3060 KB