結果
問題 | No.144 エラトステネスのざる |
ユーザー | McGregorsh |
提出日時 | 2023-04-29 12:12:23 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 437 ms / 2,000 ms |
コード長 | 1,527 bytes |
コンパイル時間 | 316 ms |
コンパイル使用メモリ | 86,864 KB |
実行使用メモリ | 109,580 KB |
最終ジャッジ日時 | 2023-08-11 16:07:36 |
合計ジャッジ時間 | 8,252 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 252 ms
92,392 KB |
testcase_01 | AC | 249 ms
92,124 KB |
testcase_02 | AC | 252 ms
92,400 KB |
testcase_03 | AC | 251 ms
92,240 KB |
testcase_04 | AC | 252 ms
92,104 KB |
testcase_05 | AC | 253 ms
92,156 KB |
testcase_06 | AC | 253 ms
93,456 KB |
testcase_07 | AC | 255 ms
93,652 KB |
testcase_08 | AC | 255 ms
93,376 KB |
testcase_09 | AC | 253 ms
93,460 KB |
testcase_10 | AC | 255 ms
93,764 KB |
testcase_11 | AC | 256 ms
93,496 KB |
testcase_12 | AC | 253 ms
93,612 KB |
testcase_13 | AC | 416 ms
109,252 KB |
testcase_14 | AC | 422 ms
109,472 KB |
testcase_15 | AC | 428 ms
109,580 KB |
testcase_16 | AC | 436 ms
109,316 KB |
testcase_17 | AC | 414 ms
109,164 KB |
testcase_18 | AC | 432 ms
109,396 KB |
testcase_19 | AC | 437 ms
109,112 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, P = map(float, input().split()) N = int(N) dp = [1] * (N+1) for i in range(2, N+1): for j in range(i+i, N+1, i): dp[j] *= 1 - P print(sum(dp[2:])) if __name__ == '__main__': main()