結果
問題 | No.2051 Divide |
ユーザー | McGregorsh |
提出日時 | 2022-08-22 21:34:43 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 150 ms / 2,000 ms |
コード長 | 2,077 bytes |
コンパイル時間 | 153 ms |
コンパイル使用メモリ | 82,300 KB |
実行使用メモリ | 89,728 KB |
最終ジャッジ日時 | 2024-04-18 13:30:52 |
合計ジャッジ時間 | 4,474 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 135 ms
89,088 KB |
testcase_01 | AC | 141 ms
89,344 KB |
testcase_02 | AC | 134 ms
89,432 KB |
testcase_03 | AC | 136 ms
89,728 KB |
testcase_04 | AC | 140 ms
89,472 KB |
testcase_05 | AC | 134 ms
89,572 KB |
testcase_06 | AC | 134 ms
89,088 KB |
testcase_07 | AC | 135 ms
89,328 KB |
testcase_08 | AC | 127 ms
89,472 KB |
testcase_09 | AC | 136 ms
89,632 KB |
testcase_10 | AC | 130 ms
89,216 KB |
testcase_11 | AC | 131 ms
89,472 KB |
testcase_12 | AC | 135 ms
89,728 KB |
testcase_13 | AC | 138 ms
89,344 KB |
testcase_14 | AC | 133 ms
89,728 KB |
testcase_15 | AC | 133 ms
89,344 KB |
testcase_16 | AC | 134 ms
89,600 KB |
testcase_17 | AC | 147 ms
89,728 KB |
testcase_18 | AC | 150 ms
89,344 KB |
testcase_19 | AC | 134 ms
89,472 KB |
testcase_20 | AC | 136 ms
89,728 KB |
testcase_21 | AC | 138 ms
89,592 KB |
testcase_22 | AC | 132 ms
89,472 KB |
testcase_23 | AC | 133 ms
89,472 KB |
testcase_24 | AC | 132 ms
89,500 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 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 = i_map() nums = make_divisors(A) ans = 0 for i in range(len(nums)): if nums[i] % B == 0: ans += 1 print(ans) if __name__ == '__main__': main()