結果
問題 | No.144 エラトステネスのざる |
ユーザー | McGregorsh |
提出日時 | 2023-04-29 12:12:23 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 308 ms / 2,000 ms |
コード長 | 1,527 bytes |
コンパイル時間 | 162 ms |
コンパイル使用メモリ | 82,232 KB |
実行使用メモリ | 106,340 KB |
最終ジャッジ日時 | 2024-04-29 08:03:41 |
合計ジャッジ時間 | 5,224 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 149 ms
89,216 KB |
testcase_01 | AC | 142 ms
89,472 KB |
testcase_02 | AC | 148 ms
89,472 KB |
testcase_03 | AC | 146 ms
89,328 KB |
testcase_04 | AC | 144 ms
89,472 KB |
testcase_05 | AC | 141 ms
89,588 KB |
testcase_06 | AC | 143 ms
89,856 KB |
testcase_07 | AC | 146 ms
90,112 KB |
testcase_08 | AC | 142 ms
90,240 KB |
testcase_09 | AC | 148 ms
90,240 KB |
testcase_10 | AC | 144 ms
90,240 KB |
testcase_11 | AC | 146 ms
90,240 KB |
testcase_12 | AC | 145 ms
90,112 KB |
testcase_13 | AC | 299 ms
106,216 KB |
testcase_14 | AC | 303 ms
106,208 KB |
testcase_15 | AC | 302 ms
106,080 KB |
testcase_16 | AC | 298 ms
106,340 KB |
testcase_17 | AC | 308 ms
106,340 KB |
testcase_18 | AC | 296 ms
105,960 KB |
testcase_19 | AC | 291 ms
106,084 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()