結果
問題 | No.1200 お菓子配り-3 |
ユーザー | Kiri8128 |
提出日時 | 2020-08-28 22:20:14 |
言語 | PyPy3 (7.3.13) |
結果 |
WA
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 2,690 bytes |
コンパイル時間 | 439 ms |
コンパイル使用メモリ | 87,232 KB |
実行使用メモリ | 83,604 KB |
最終ジャッジ日時 | 2023-08-09 08:58:55 |
合計ジャッジ時間 | 9,681 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge15 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 68 ms
71,564 KB |
testcase_01 | AC | 69 ms
71,352 KB |
testcase_02 | AC | 77 ms
76,428 KB |
testcase_03 | AC | 71 ms
71,376 KB |
testcase_04 | AC | 72 ms
71,568 KB |
testcase_05 | AC | 69 ms
71,624 KB |
testcase_06 | AC | 74 ms
75,564 KB |
testcase_07 | AC | 97 ms
76,560 KB |
testcase_08 | AC | 95 ms
76,704 KB |
testcase_09 | AC | 91 ms
76,720 KB |
testcase_10 | AC | 96 ms
76,744 KB |
testcase_11 | AC | 97 ms
76,864 KB |
testcase_12 | AC | 199 ms
78,368 KB |
testcase_13 | AC | 196 ms
78,160 KB |
testcase_14 | AC | 198 ms
78,660 KB |
testcase_15 | AC | 196 ms
78,696 KB |
testcase_16 | AC | 193 ms
78,008 KB |
testcase_17 | AC | 339 ms
80,480 KB |
testcase_18 | AC | 410 ms
81,968 KB |
testcase_19 | AC | 203 ms
78,400 KB |
testcase_20 | AC | 508 ms
83,604 KB |
testcase_21 | AC | 492 ms
81,784 KB |
testcase_22 | AC | 531 ms
82,604 KB |
testcase_23 | AC | 486 ms
81,988 KB |
testcase_24 | AC | 510 ms
82,476 KB |
testcase_25 | AC | 478 ms
81,836 KB |
testcase_26 | AC | 516 ms
83,236 KB |
testcase_27 | AC | 67 ms
71,400 KB |
testcase_28 | AC | 549 ms
80,124 KB |
testcase_29 | AC | 366 ms
80,168 KB |
testcase_30 | AC | 387 ms
80,512 KB |
testcase_31 | WA | - |
testcase_32 | WA | - |
ソースコード
import sys input = lambda: sys.stdin.readline().rstrip() def gcd(a, b): while b: a, b = b, a % b return a def isPrimeMR(n): d = n - 1 d = d // (d & -d) L = [2, 7, 61] if n < 1<<32 else [2, 3, 5, 7, 11, 13, 17] if n < 1<<48 else [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37] for a in L: t = d y = pow(a, t, n) if y == 1: continue while y != n - 1: y = y * y % n if y == 1 or t == n - 1: return 0 t <<= 1 return 1 def findFactorRho(n): m = 1 << n.bit_length() // 8 for c in range(1, 99): f = lambda x: (x * x + c) % n y, r, q, g = 2, 1, 1, 1 while g == 1: x = y for i in range(r): y = f(y) k = 0 while k < r and g == 1: ys = y for i in range(min(m, r - k)): y = f(y) q = q * abs(x - y) % n g = gcd(q, n) k += m r <<= 1 if g == n: g = 1 while g == 1: ys = f(ys) g = gcd(abs(x - ys), n) if g < n: if isPrimeMR(g): return g elif isPrimeMR(n // g): return n // g return findFactorRho(g) def primeFactor(n): i = 2 ret = {} rhoFlg = 0 while i * i <= n: k = 0 while n % i == 0: n //= i k += 1 if k: ret[i] = k i += i % 2 + (3 if i % 3 == 1 else 1) if i == 101 and n >= 2 ** 20: while n > 1: if isPrimeMR(n): ret[n], n = 1, 1 else: rhoFlg = 1 j = findFactorRho(n) k = 0 while n % j == 0: n //= j k += 1 ret[j] = k if n > 1: ret[n] = 1 if rhoFlg: ret = {x: ret[x] for x in sorted(ret)} return ret def divisors(N): pf = primeFactor(N) ret = [1] for p in pf: ret_prev = ret ret = set() for i in range(pf[p]+1): for r in ret_prev: ret.add(r * (p ** i)) return ret S = int(input()) for _ in range(S): X, Y = map(int, input().split()) d1 = {a+1 for a in divisors(abs(X - Y))} d2 = {a-1 for a in divisors(X + Y)} d = d1 & d2 ans = 0 for a in d: bmc = (X - Y) // (a - 1) bpc = (X + Y) // (a + 1) if (bmc ^ bpc) & 1: continue b = bmc + bpc >> 1 c = bpc - bmc >> 1 if b > 0 and c > 0: ans += 1 print(ans)