結果
問題 | No.7 プライムナンバーゲーム |
ユーザー | McGregorsh |
提出日時 | 2023-05-11 22:44:42 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 291 ms / 5,000 ms |
コード長 | 2,112 bytes |
コンパイル時間 | 258 ms |
コンパイル使用メモリ | 82,304 KB |
実行使用メモリ | 90,240 KB |
最終ジャッジ日時 | 2024-05-05 18:32:48 |
合計ジャッジ時間 | 4,645 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 137 ms
89,472 KB |
testcase_01 | AC | 139 ms
89,472 KB |
testcase_02 | AC | 291 ms
90,240 KB |
testcase_03 | AC | 157 ms
90,112 KB |
testcase_04 | AC | 148 ms
89,856 KB |
testcase_05 | AC | 153 ms
89,984 KB |
testcase_06 | AC | 190 ms
89,984 KB |
testcase_07 | AC | 175 ms
90,112 KB |
testcase_08 | AC | 161 ms
89,728 KB |
testcase_09 | AC | 207 ms
90,112 KB |
testcase_10 | AC | 135 ms
89,472 KB |
testcase_11 | AC | 172 ms
89,984 KB |
testcase_12 | AC | 239 ms
90,112 KB |
testcase_13 | AC | 246 ms
89,984 KB |
testcase_14 | AC | 275 ms
89,856 KB |
testcase_15 | AC | 270 ms
89,728 KB |
testcase_16 | AC | 263 ms
89,728 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 import math def sieve_of_eratosthenes(n): prime = [True for i in range(n+1)] prime[0] = False prime[1] = False sqrt_n = math.ceil(math.sqrt(n)) for i in range(2, sqrt_n+1): if prime[i]: for j in range(2*i, n+1, i): prime[j] = False return prime def main(): N = int(input()) flag = sieve_of_eratosthenes(N) nums = [] for i in range(N+1): if flag[i]: nums.append(i) ans = [0] * (N+1) ans[0] = 1 ans[1] = 1 for i in range(2, N+1): p = set() for j in nums: if i - j >= 0: p.add(ans[i-j]) for k in range(10010): if k not in p: ans[i] = k break if ans[-1] == 0: print('Lose') else: print('Win') if __name__ == '__main__': main()