結果
問題 | No.1185 完全な3の倍数 |
ユーザー | McGregorsh |
提出日時 | 2023-05-18 21:55:34 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,647 bytes |
コンパイル時間 | 313 ms |
コンパイル使用メモリ | 86,980 KB |
実行使用メモリ | 113,292 KB |
最終ジャッジ日時 | 2023-08-22 13:10:40 |
合計ジャッジ時間 | 25,984 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 522 ms
109,468 KB |
testcase_01 | AC | 478 ms
93,492 KB |
testcase_02 | AC | 479 ms
93,252 KB |
testcase_03 | AC | 519 ms
109,032 KB |
testcase_04 | AC | 532 ms
113,112 KB |
testcase_05 | AC | 527 ms
109,224 KB |
testcase_06 | AC | 523 ms
109,024 KB |
testcase_07 | AC | 517 ms
109,228 KB |
testcase_08 | AC | 529 ms
113,292 KB |
testcase_09 | AC | 482 ms
93,636 KB |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | AC | 479 ms
93,504 KB |
testcase_13 | AC | 480 ms
93,260 KB |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | AC | 473 ms
93,516 KB |
testcase_18 | AC | 472 ms
93,412 KB |
testcase_19 | AC | 497 ms
100,300 KB |
testcase_20 | AC | 518 ms
108,340 KB |
testcase_21 | AC | 505 ms
105,152 KB |
testcase_22 | AC | 498 ms
102,504 KB |
testcase_23 | AC | 494 ms
100,280 KB |
testcase_24 | AC | 513 ms
108,264 KB |
testcase_25 | AC | 489 ms
94,384 KB |
testcase_26 | AC | 508 ms
105,448 KB |
testcase_27 | AC | 498 ms
100,364 KB |
testcase_28 | AC | 514 ms
106,124 KB |
testcase_29 | AC | 508 ms
102,952 KB |
testcase_30 | AC | 508 ms
105,412 KB |
testcase_31 | AC | 494 ms
93,604 KB |
testcase_32 | AC | 527 ms
109,500 KB |
testcase_33 | AC | 491 ms
96,576 KB |
testcase_34 | AC | 514 ms
108,148 KB |
testcase_35 | AC | 529 ms
112,964 KB |
testcase_36 | AC | 516 ms
108,352 KB |
testcase_37 | AC | 518 ms
108,324 KB |
testcase_38 | AC | 510 ms
105,204 KB |
testcase_39 | AC | 483 ms
93,324 KB |
testcase_40 | AC | 486 ms
93,436 KB |
testcase_41 | AC | 487 ms
93,272 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(): N = int(input()) ans = 0 for i in range(10, 100, 3): if i > N: break ans += 1 b = set() for bit in product(['0', '3', '6', '9'], repeat=10): p = int(''.join(list(bit))) if 100 <= p <= N: b.add(p) print(len(b) + ans) if __name__ == '__main__': main()