Submission #10,931

2024-04-20 10:01:28

python3

Accepted 75/75

17ms

13100 KiB

from sys import stdin
input=stdin.readline

def solv():
    N,M=[int(x) for x in input().split()]
    if N>M:
        N,M=M,N
    K=max(1,int((2*N)**0.5)-1)
    while N>=(K+1)**2//2 and M>=((K+1)**2+1)//2:
        K+=1
    return K

print(solv())

	Sum	Test	Verdict		Time	Memory
base	75/75
		1	Accepted	0/0	17ms	11176 KiB
		2	Accepted	0/0	17ms	11656 KiB
		3	Accepted	5/5	17ms	11716 KiB
		4	Accepted	5/5	17ms	12020 KiB
		5	Accepted	5/5	17ms	12184 KiB
		6	Accepted	5/5	17ms	12104 KiB
		7	Accepted	5/5	17ms	12468 KiB
		8	Accepted	5/5	17ms	12548 KiB
		9	Accepted	5/5	17ms	12332 KiB
		10	Accepted	5/5	17ms	12776 KiB
		11	Accepted	7/7	17ms	12680 KiB
		12	Accepted	7/7	17ms	12740 KiB
		13	Accepted	7/7	17ms	13100 KiB
		14	Accepted	7/7	17ms	13040 KiB
		15	Accepted	7/7	17ms	13092 KiB