結果
問題 | No.2051 Divide |
ユーザー | McGregorsh |
提出日時 | 2022-08-22 21:34:43 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 153 ms / 2,000 ms |
コード長 | 2,077 bytes |
コンパイル時間 | 179 ms |
コンパイル使用メモリ | 81,908 KB |
実行使用メモリ | 89,868 KB |
最終ジャッジ日時 | 2024-10-10 06:42:37 |
合計ジャッジ時間 | 4,916 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 146 ms
89,656 KB |
testcase_01 | AC | 151 ms
89,160 KB |
testcase_02 | AC | 149 ms
89,484 KB |
testcase_03 | AC | 145 ms
89,684 KB |
testcase_04 | AC | 146 ms
89,568 KB |
testcase_05 | AC | 143 ms
89,412 KB |
testcase_06 | AC | 147 ms
89,308 KB |
testcase_07 | AC | 148 ms
89,368 KB |
testcase_08 | AC | 148 ms
89,364 KB |
testcase_09 | AC | 148 ms
89,340 KB |
testcase_10 | AC | 146 ms
89,480 KB |
testcase_11 | AC | 146 ms
89,648 KB |
testcase_12 | AC | 150 ms
89,700 KB |
testcase_13 | AC | 149 ms
89,456 KB |
testcase_14 | AC | 151 ms
89,652 KB |
testcase_15 | AC | 152 ms
89,580 KB |
testcase_16 | AC | 147 ms
89,640 KB |
testcase_17 | AC | 151 ms
89,820 KB |
testcase_18 | AC | 150 ms
89,868 KB |
testcase_19 | AC | 147 ms
89,696 KB |
testcase_20 | AC | 153 ms
89,640 KB |
testcase_21 | AC | 152 ms
89,580 KB |
testcase_22 | AC | 152 ms
89,744 KB |
testcase_23 | AC | 147 ms
89,700 KB |
testcase_24 | AC | 146 ms
89,784 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()