結果
問題 | No.816 Beautiful tuples |
ユーザー | McGregorsh |
提出日時 | 2022-07-04 20:15:22 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,129 bytes |
コンパイル時間 | 1,190 ms |
コンパイル使用メモリ | 86,328 KB |
実行使用メモリ | 93,056 KB |
最終ジャッジ日時 | 2023-08-21 04:25:37 |
合計ジャッジ時間 | 5,949 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | WA | - |
testcase_01 | AC | 237 ms
92,524 KB |
testcase_02 | AC | 244 ms
92,924 KB |
testcase_03 | WA | - |
testcase_04 | AC | 237 ms
92,948 KB |
testcase_05 | AC | 241 ms
92,892 KB |
testcase_06 | AC | 242 ms
92,888 KB |
testcase_07 | AC | 240 ms
92,948 KB |
testcase_08 | AC | 238 ms
92,768 KB |
testcase_09 | AC | 236 ms
92,772 KB |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | AC | 239 ms
92,880 KB |
testcase_13 | AC | 240 ms
92,888 KB |
testcase_14 | AC | 234 ms
92,396 KB |
ソースコード
###約数列挙### def make_divisors(n): lower_divisors, upper_divisors = [], [] i = 1 while i * i <= n: if n % i == 0: lower_divisors.append(i) if i != n // i: upper_divisors.append(n//i) i += 1 return lower_divisors + upper_divisors[::-1] ###順列### def nPr(n, r): npr = 1 for i in range(n, n-r, -1): npr *= i return npr ###組合せ### def nCr(n, r): factr = 1 r = min(r, n - r) for i in range(r, 1, -1): factr *= i return nPr(n, r)/factr import sys, re from math import ceil, floor, sqrt, pi, factorial, gcd from copy import deepcopy from collections import Counter, deque, defaultdict from heapq import heapify, heappop, heappush from itertools import accumulate, product, combinations, combinations_with_replacement, permutations from bisect import bisect, bisect_left, bisect_right from functools import reduce from decimal import Decimal, getcontext def i_input(): return int(input()) def i_map(): return map(int, input().split()) def i_list(): return list(i_map()) def i_row(N): return [i_input() for _ in range(N)] def i_row_list(N): return [i_list() for _ in range(N)] def s_input(): return input() def s_map(): return input().split() def s_list(): return list(s_map()) def s_row(N): return [s_input for _ in range(N)] def s_row_str(N): return [s_list() for _ in range(N)] def s_row_list(N): return [list(s_input()) for _ in range(N)] def lcm(a, b): return a * b // gcd(a, b) def get_distance(x1, y1, x2, y2): d = sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2) return d def rotate(table): n_fild = [] for x in zip(*table[::-1]): n_fild.append(x) return n_fild sys.setrecursionlimit(10 ** 7) INF = float('inf') MOD = 10 ** 9 + 7 MOD2 = 998244353 def main(): a, b = i_map() num = a + b nums = make_divisors(num) nums.sort() for i in range(len(nums)): c = nums[i] if (a + c) % b != 0: continue if (b + c) % a != 0: continue print(c) exit() print(-1) if __name__ == '__main__': main()