Submission #2320216
Source Code Expand
import numpy as np
q = input()
n = np.zeros((q, 2), dtype=np.int64)
for i in range(0, q):
n[i, :] = map(int, raw_input().split())
for i in range(0, q):
s = n[i, 0] * n[i, 1]
m = int(np.floor(np.sqrt(s)))
# print m, s
if n[i, 0] == n[i, 1]: #equal
print m * 2 - 2
elif m ** 2 == s: # square
print m * 2 - 3
# elif m ** 2 == s - 1: # square - 1
# print m * 2 - 3
elif m ** 2 < s - m: # square - 1
print m * 2 - 1
else:
print m * 2 - 2
# mmm = []
# for j in range(2, M + 1):
# # print mmm
# mm = M / j
# # print mm
# if mm in mmm or mm < 1:
# print len(mmm)
# break
# else:
# mmm.append(mm)
Submission Info
| Submission Time | |
|---|---|
| Task | D - Worst Case |
| User | shiba24 |
| Language | Python (2.7.6) |
| Score | 700 |
| Code Size | 838 Byte |
| Status | AC |
| Exec Time | 1831 ms |
| Memory | 16136 KiB |
Judge Result
| Set Name | Sample | All | ||||
|---|---|---|---|---|---|---|
| Score / Max Score | 0 / 0 | 700 / 700 | ||||
| Status |
|
|
| 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 | 1831 ms | 16136 KiB |
| 02.txt | AC | 93 ms | 10420 KiB |
| 03.txt | AC | 92 ms | 10420 KiB |
| 04.txt | AC | 92 ms | 10420 KiB |
| 05.txt | AC | 93 ms | 10420 KiB |
| 06.txt | AC | 94 ms | 10420 KiB |
| 07.txt | AC | 92 ms | 10420 KiB |
| 08.txt | AC | 92 ms | 10420 KiB |
| 09.txt | AC | 93 ms | 10420 KiB |
| 10.txt | AC | 92 ms | 10420 KiB |
| 11.txt | AC | 90 ms | 10420 KiB |
| s1.txt | AC | 89 ms | 10420 KiB |