結果

問題 No.316 もっと刺激的なFizzBuzzをください
ユーザー mattu34
提出日時 2024-09-08 20:47:25
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 150 ms / 1,000 ms
コード長 2,613 bytes
コンパイル時間 439 ms
コンパイル使用メモリ 82,388 KB
実行使用メモリ 89,352 KB
最終ジャッジ日時 2024-09-08 20:47:33
合計ジャッジ時間 7,083 ms
ジャッジサーバーID
(参考情報)
judge3 / judge4
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 4
other AC * 33
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

from collections import *
import sys
import heapq
from heapq import heapify, heappop, heappush
import bisect
from bisect import bisect_left, bisect_right
import itertools
from functools import lru_cache
from types import GeneratorType
from fractions import Fraction
import math
import copy
import random
# import numpy as np
# sys.setrecursionlimit(int(1e7))
# @lru_cache(maxsize=None) # CPython
# @bootstrap # PyPy() yield dfs(), yield None
def bootstrap(f, stack=[]): # yield
def wrappedfunc(*args, **kwargs):
if stack:
return f(*args, **kwargs)
else:
to = f(*args, **kwargs)
while True:
if type(to) is GeneratorType:
stack.append(to)
to = next(to)
else:
stack.pop()
if not stack:
break
to = stack[-1].send(to)
return to
return wrappedfunc
dxdy1 = ((0, 1), (0, -1), (1, 0), (-1, 0)) #
dxdy2 = (
(0, 1),
(0, -1),
(1, 0),
(-1, 0),
(1, 1),
(-1, -1),
(1, -1),
(-1, 1),
) # 8
dxdy3 = ((0, 1), (1, 0)) # or
dxdy4 = ((1, 1), (1, -1), (-1, 1), (-1, -1)) #
INF = float("inf")
_INF = 1 << 60
MOD = 998244353
mod = 998244353
MOD2 = 10**9 + 7
mod2 = 10**9 + 7
# memo : len([a,b,...,z])==26
# memo : 2^20 >= 10^6
# : x/y -> (x*big)//y ex:big=10**9
# @:, ~:,None:
# gcd(x,y)=gcd(x,y-x)
# memo : d p p^d-1
#
# memo : (X,Y) -> (X+Y,X−Y) <=> 45√2
# memo : (x,y)x(-ππ] math.atan2(y, x)
# memo : a < b ⌊a⌋ ≦ ⌊b⌋
input = lambda: sys.stdin.readline().rstrip()
mi = lambda: map(int, input().split())
li = lambda: list(mi())
ii = lambda: int(input())
py = lambda: print("Yes")
pn = lambda: print("No")
pf = lambda: print("First")
ps = lambda: print("Second")
# O(2 ^ n)
# |A1 ⋁ A2 ⋁ ... ⋁ An| = |Ai| - |Ai ⋀ Aj| + ... + (-1) ^ (n - 1)|A1 ⋀ ... ⋀ An|
N = ii()
K = li()
L = len(K)
ans = 0
for i in range(1, 1 << L):
use = []
for j in range(L):
if (i >> j) & 1:
use.append(K[j])
lcm = math.lcm(*use)
ans += (-1) ** (len(use) - 1) * (N // lcm)
print(ans)
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0