結果
問題 | No.1185 完全な3の倍数 |
ユーザー | McGregorsh |
提出日時 | 2023-05-18 21:57:24 |
言語 | PyPy3 (7.3.15) |
結果 |
WA
|
実行時間 | - |
コード長 | 1,647 bytes |
コンパイル時間 | 286 ms |
コンパイル使用メモリ | 86,960 KB |
実行使用メモリ | 115,268 KB |
最終ジャッジ日時 | 2023-08-22 13:12:29 |
合計ジャッジ時間 | 55,910 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1,261 ms
112,440 KB |
testcase_01 | AC | 1,196 ms
93,604 KB |
testcase_02 | AC | 1,206 ms
93,604 KB |
testcase_03 | AC | 1,227 ms
111,884 KB |
testcase_04 | AC | 1,223 ms
113,936 KB |
testcase_05 | AC | 1,240 ms
112,436 KB |
testcase_06 | AC | 1,242 ms
110,972 KB |
testcase_07 | AC | 1,230 ms
110,992 KB |
testcase_08 | AC | 1,238 ms
115,268 KB |
testcase_09 | AC | 1,208 ms
93,512 KB |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | AC | 1,211 ms
93,448 KB |
testcase_13 | AC | 1,219 ms
93,468 KB |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | AC | 1,214 ms
93,188 KB |
testcase_18 | AC | 1,222 ms
93,184 KB |
testcase_19 | AC | 1,261 ms
100,572 KB |
testcase_20 | AC | 1,268 ms
112,852 KB |
testcase_21 | AC | 1,269 ms
104,168 KB |
testcase_22 | AC | 1,263 ms
102,924 KB |
testcase_23 | AC | 1,253 ms
100,936 KB |
testcase_24 | AC | 1,272 ms
112,404 KB |
testcase_25 | AC | 1,246 ms
94,548 KB |
testcase_26 | AC | 1,271 ms
103,976 KB |
testcase_27 | AC | 1,258 ms
100,700 KB |
testcase_28 | AC | 1,265 ms
104,440 KB |
testcase_29 | AC | 1,258 ms
103,128 KB |
testcase_30 | AC | 1,265 ms
103,896 KB |
testcase_31 | AC | 1,244 ms
93,404 KB |
testcase_32 | AC | 1,277 ms
111,012 KB |
testcase_33 | AC | 1,252 ms
96,840 KB |
testcase_34 | AC | 1,275 ms
112,484 KB |
testcase_35 | AC | 1,283 ms
114,004 KB |
testcase_36 | AC | 1,281 ms
111,160 KB |
testcase_37 | AC | 1,273 ms
111,064 KB |
testcase_38 | AC | 1,258 ms
103,896 KB |
testcase_39 | AC | 1,223 ms
93,588 KB |
testcase_40 | AC | 1,212 ms
93,376 KB |
testcase_41 | AC | 1,216 ms
93,508 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: b.add(p) print(len(b) + ans) if __name__ == '__main__': main()