結果
問題 | No.1158 GCD Products easy |
ユーザー | McGregorsh |
提出日時 | 2023-05-18 21:19:10 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 378 ms / 2,000 ms |
コード長 | 1,584 bytes |
コンパイル時間 | 2,069 ms |
コンパイル使用メモリ | 86,664 KB |
実行使用メモリ | 93,620 KB |
最終ジャッジ日時 | 2023-08-22 12:50:01 |
合計ジャッジ時間 | 8,992 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 233 ms
92,532 KB |
testcase_01 | AC | 229 ms
92,424 KB |
testcase_02 | AC | 234 ms
92,476 KB |
testcase_03 | AC | 230 ms
92,444 KB |
testcase_04 | AC | 235 ms
92,608 KB |
testcase_05 | AC | 235 ms
93,500 KB |
testcase_06 | AC | 234 ms
92,296 KB |
testcase_07 | AC | 241 ms
93,220 KB |
testcase_08 | AC | 235 ms
92,440 KB |
testcase_09 | AC | 236 ms
92,476 KB |
testcase_10 | AC | 233 ms
92,284 KB |
testcase_11 | AC | 236 ms
92,424 KB |
testcase_12 | AC | 234 ms
93,504 KB |
testcase_13 | AC | 235 ms
92,408 KB |
testcase_14 | AC | 237 ms
92,248 KB |
testcase_15 | AC | 235 ms
92,564 KB |
testcase_16 | AC | 236 ms
92,320 KB |
testcase_17 | AC | 234 ms
92,420 KB |
testcase_18 | AC | 236 ms
92,492 KB |
testcase_19 | AC | 237 ms
92,424 KB |
testcase_20 | AC | 232 ms
92,504 KB |
testcase_21 | AC | 235 ms
92,464 KB |
testcase_22 | AC | 232 ms
92,244 KB |
testcase_23 | AC | 235 ms
92,512 KB |
testcase_24 | AC | 242 ms
93,396 KB |
testcase_25 | AC | 233 ms
92,244 KB |
testcase_26 | AC | 378 ms
93,620 KB |
ソースコード
import sys, re from fractions import Fraction 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, ROUND_HALF_UP 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, N = i_map() ans = 1 for bit in product([i for i in range(A, B+1)], repeat=N): score = bit[0] for i in range(1, N): score = gcd(score, bit[i]) ans *= score ans %= MOD print(ans) if __name__ == '__main__': main()