結果
問題 | No.1185 完全な3の倍数 |
ユーザー | McGregorsh |
提出日時 | 2023-05-18 21:58:51 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,662 bytes |
コンパイル時間 | 841 ms |
コンパイル使用メモリ | 86,888 KB |
実行使用メモリ | 113,516 KB |
最終ジャッジ日時 | 2023-08-22 13:14:01 |
合計ジャッジ時間 | 54,275 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1,229 ms
111,176 KB |
testcase_01 | AC | 1,203 ms
93,404 KB |
testcase_02 | AC | 1,204 ms
93,492 KB |
testcase_03 | AC | 1,233 ms
111,164 KB |
testcase_04 | AC | 1,237 ms
113,516 KB |
testcase_05 | AC | 1,228 ms
111,252 KB |
testcase_06 | AC | 1,227 ms
111,128 KB |
testcase_07 | AC | 1,237 ms
111,276 KB |
testcase_08 | AC | 1,233 ms
113,392 KB |
testcase_09 | AC | 1,200 ms
93,232 KB |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | AC | 1,199 ms
93,260 KB |
testcase_13 | AC | 1,211 ms
93,412 KB |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | AC | 1,199 ms
93,476 KB |
testcase_18 | AC | 1,201 ms
93,232 KB |
testcase_19 | AC | 1,208 ms
100,728 KB |
testcase_20 | AC | 1,225 ms
111,192 KB |
testcase_21 | AC | 1,212 ms
104,212 KB |
testcase_22 | AC | 1,217 ms
102,964 KB |
testcase_23 | AC | 1,206 ms
100,728 KB |
testcase_24 | AC | 1,231 ms
110,900 KB |
testcase_25 | AC | 1,197 ms
94,524 KB |
testcase_26 | AC | 1,211 ms
104,312 KB |
testcase_27 | AC | 1,208 ms
100,884 KB |
testcase_28 | AC | 1,217 ms
104,040 KB |
testcase_29 | AC | 1,216 ms
103,128 KB |
testcase_30 | AC | 1,220 ms
104,220 KB |
testcase_31 | AC | 1,199 ms
93,560 KB |
testcase_32 | AC | 1,242 ms
111,092 KB |
testcase_33 | AC | 1,207 ms
96,992 KB |
testcase_34 | AC | 1,234 ms
111,036 KB |
testcase_35 | AC | 1,233 ms
113,368 KB |
testcase_36 | AC | 1,248 ms
111,112 KB |
testcase_37 | AC | 1,233 ms
111,324 KB |
testcase_38 | AC | 1,233 ms
104,228 KB |
testcase_39 | AC | 1,207 ms
93,516 KB |
testcase_40 | AC | 1,204 ms
93,284 KB |
testcase_41 | AC | 1,205 ms
93,460 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=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()