結果
問題 | No.1185 完全な3の倍数 |
ユーザー |
|
提出日時 | 2023-05-18 22:03:06 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,134 ms / 2,000 ms |
コード長 | 1,683 bytes |
コンパイル時間 | 345 ms |
コンパイル使用メモリ | 82,688 KB |
実行使用メモリ | 108,092 KB |
最終ジャッジ日時 | 2024-12-16 10:32:18 |
合計ジャッジ時間 | 46,717 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1,074 ms
108,092 KB |
testcase_01 | AC | 1,030 ms
89,984 KB |
testcase_02 | AC | 1,024 ms
90,112 KB |
testcase_03 | AC | 1,075 ms
108,000 KB |
testcase_04 | AC | 1,072 ms
107,844 KB |
testcase_05 | AC | 1,069 ms
107,964 KB |
testcase_06 | AC | 1,073 ms
107,332 KB |
testcase_07 | AC | 1,079 ms
107,324 KB |
testcase_08 | AC | 1,134 ms
107,964 KB |
testcase_09 | AC | 1,035 ms
90,240 KB |
testcase_10 | AC | 1,032 ms
89,984 KB |
testcase_11 | AC | 1,025 ms
90,020 KB |
testcase_12 | AC | 1,032 ms
90,112 KB |
testcase_13 | AC | 1,031 ms
90,240 KB |
testcase_14 | AC | 1,029 ms
90,272 KB |
testcase_15 | AC | 1,026 ms
90,540 KB |
testcase_16 | AC | 1,041 ms
89,728 KB |
testcase_17 | AC | 1,029 ms
90,112 KB |
testcase_18 | AC | 1,035 ms
90,496 KB |
testcase_19 | AC | 1,047 ms
96,384 KB |
testcase_20 | AC | 1,066 ms
103,744 KB |
testcase_21 | AC | 1,053 ms
99,840 KB |
testcase_22 | AC | 1,055 ms
98,176 KB |
testcase_23 | AC | 1,048 ms
96,000 KB |
testcase_24 | AC | 1,061 ms
104,400 KB |
testcase_25 | AC | 1,042 ms
90,624 KB |
testcase_26 | AC | 1,057 ms
99,840 KB |
testcase_27 | AC | 1,047 ms
95,744 KB |
testcase_28 | AC | 1,052 ms
100,352 KB |
testcase_29 | AC | 1,048 ms
99,840 KB |
testcase_30 | AC | 1,045 ms
100,352 KB |
testcase_31 | AC | 1,040 ms
90,496 KB |
testcase_32 | AC | 1,063 ms
107,848 KB |
testcase_33 | AC | 1,037 ms
93,956 KB |
testcase_34 | AC | 1,076 ms
104,132 KB |
testcase_35 | AC | 1,067 ms
108,092 KB |
testcase_36 | AC | 1,060 ms
104,544 KB |
testcase_37 | AC | 1,057 ms
104,608 KB |
testcase_38 | AC | 1,091 ms
100,352 KB |
testcase_39 | AC | 1,023 ms
89,728 KB |
testcase_40 | AC | 1,027 ms
90,368 KB |
testcase_41 | AC | 1,023 ms
90,368 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): if i > N: break if i % 3 == 0: ans += 1 b = set() for bit in product(['0', '3', '6', '9'], repeat=11): p = int(''.join(list(bit))) if 100 <= p <= N and p % 3 == 0: b.add(p) print(len(b) + ans) if __name__ == '__main__': main()