結果
問題 | No.1644 Eight Digits |
ユーザー | McGregorsh |
提出日時 | 2023-05-10 14:37:35 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 273 ms / 1,000 ms |
コード長 | 1,606 bytes |
コンパイル時間 | 414 ms |
コンパイル使用メモリ | 87,096 KB |
実行使用メモリ | 94,128 KB |
最終ジャッジ日時 | 2023-08-17 20:02:51 |
合計ジャッジ時間 | 9,876 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 269 ms
93,624 KB |
testcase_01 | AC | 273 ms
94,128 KB |
testcase_02 | AC | 266 ms
93,684 KB |
testcase_03 | AC | 269 ms
93,836 KB |
testcase_04 | AC | 272 ms
94,092 KB |
testcase_05 | AC | 267 ms
93,660 KB |
testcase_06 | AC | 272 ms
93,688 KB |
testcase_07 | AC | 264 ms
93,724 KB |
testcase_08 | AC | 268 ms
93,768 KB |
testcase_09 | AC | 267 ms
93,728 KB |
testcase_10 | AC | 264 ms
93,872 KB |
testcase_11 | AC | 271 ms
93,872 KB |
testcase_12 | AC | 266 ms
93,632 KB |
testcase_13 | AC | 270 ms
93,772 KB |
testcase_14 | AC | 270 ms
93,836 KB |
testcase_15 | AC | 267 ms
93,956 KB |
testcase_16 | AC | 271 ms
93,776 KB |
testcase_17 | AC | 272 ms
93,772 KB |
testcase_18 | AC | 268 ms
93,848 KB |
testcase_19 | AC | 265 ms
93,856 KB |
testcase_20 | AC | 264 ms
93,860 KB |
testcase_21 | AC | 266 ms
93,692 KB |
testcase_22 | AC | 265 ms
93,976 KB |
testcase_23 | AC | 268 ms
93,680 KB |
testcase_24 | AC | 265 ms
93,688 KB |
testcase_25 | AC | 269 ms
93,932 KB |
testcase_26 | AC | 260 ms
93,772 KB |
testcase_27 | AC | 263 ms
93,760 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(): K = int(input()) ans = 0 nums = [1, 2, 3, 4, 5, 6, 7, 8] for per in permutations(nums, 8): mozi = '' for i in range(8): mozi += str(nums[per[i]-1]) num = int(mozi) if num % K == 0: ans += 1 print(ans) if __name__ == '__main__': main()