結果
問題 | No.407 鴨等素数間隔列の数え上げ |
ユーザー | vwxyz |
提出日時 | 2022-09-22 06:59:55 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 891 ms / 1,000 ms |
コード長 | 3,108 bytes |
コンパイル時間 | 452 ms |
コンパイル使用メモリ | 87,200 KB |
実行使用メモリ | 224,664 KB |
最終ジャッジ日時 | 2023-08-23 20:24:09 |
合計ジャッジ時間 | 16,534 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 263 ms
91,132 KB |
testcase_01 | AC | 264 ms
91,356 KB |
testcase_02 | AC | 261 ms
91,264 KB |
testcase_03 | AC | 323 ms
106,588 KB |
testcase_04 | AC | 259 ms
91,160 KB |
testcase_05 | AC | 891 ms
224,664 KB |
testcase_06 | AC | 549 ms
161,104 KB |
testcase_07 | AC | 260 ms
91,132 KB |
testcase_08 | AC | 258 ms
91,168 KB |
testcase_09 | AC | 259 ms
91,392 KB |
testcase_10 | AC | 260 ms
91,020 KB |
testcase_11 | AC | 259 ms
91,168 KB |
testcase_12 | AC | 276 ms
95,016 KB |
testcase_13 | AC | 275 ms
94,660 KB |
testcase_14 | AC | 276 ms
94,824 KB |
testcase_15 | AC | 261 ms
91,276 KB |
testcase_16 | AC | 273 ms
94,416 KB |
testcase_17 | AC | 271 ms
94,100 KB |
testcase_18 | AC | 263 ms
91,872 KB |
testcase_19 | AC | 325 ms
107,160 KB |
testcase_20 | AC | 432 ms
133,640 KB |
testcase_21 | AC | 344 ms
110,764 KB |
testcase_22 | AC | 331 ms
108,012 KB |
testcase_23 | AC | 368 ms
119,244 KB |
testcase_24 | AC | 426 ms
133,448 KB |
testcase_25 | AC | 543 ms
158,948 KB |
testcase_26 | AC | 534 ms
159,044 KB |
testcase_27 | AC | 304 ms
103,336 KB |
testcase_28 | AC | 386 ms
122,352 KB |
testcase_29 | AC | 536 ms
157,828 KB |
testcase_30 | AC | 319 ms
105,268 KB |
testcase_31 | AC | 531 ms
149,000 KB |
testcase_32 | AC | 545 ms
158,356 KB |
testcase_33 | AC | 836 ms
219,384 KB |
testcase_34 | AC | 832 ms
219,476 KB |
testcase_35 | AC | 763 ms
211,632 KB |
ソースコード
import bisect import copy import decimal import fractions import heapq import itertools import math import random import sys import time from collections import Counter,deque,defaultdict from functools import lru_cache,reduce from heapq import heappush,heappop,heapify,heappushpop,_heappop_max,_heapify_max def _heappush_max(heap,item): heap.append(item) heapq._siftdown_max(heap, 0, len(heap)-1) def _heappushpop_max(heap, item): if heap and item < heap[0]: item, heap[0] = heap[0], item heapq._siftup_max(heap, 0) return item from math import gcd as GCD read=sys.stdin.read readline=sys.stdin.readline readlines=sys.stdin.readlines write=sys.stdout.write class Prime: def __init__(self,N): assert N<=10**8 self.smallest_prime_factor=[None]*(N+1) for i in range(2,N+1,2): self.smallest_prime_factor[i]=2 n=int(N**.5)+1 for p in range(3,n,2): if self.smallest_prime_factor[p]==None: self.smallest_prime_factor[p]=p for i in range(p**2,N+1,2*p): if self.smallest_prime_factor[i]==None: self.smallest_prime_factor[i]=p for p in range(n,N+1): if self.smallest_prime_factor[p]==None: self.smallest_prime_factor[p]=p self.primes=[p for p in range(N+1) if p==self.smallest_prime_factor[p]] def Factorize(self,N): assert N>=1 factors=defaultdict(int) if N<=len(self.smallest_prime_factor)-1: while N!=1: factors[self.smallest_prime_factor[N]]+=1 N//=self.smallest_prime_factor[N] else: for p in self.primes: while N%p==0: N//=p factors[p]+=1 if N<p*p: if N!=1: factors[N]+=1 break if N<=len(self.smallest_prime_factor)-1: while N!=1: factors[self.smallest_prime_factor[N]]+=1 N//=self.smallest_prime_factor[N] break else: if N!=1: factors[N]+=1 return factors def Divisors(self,N): assert N>0 divisors=[1] for p,e in self.Factorize(N).items(): pow_p=[1] for _ in range(e): pow_p.append(pow_p[-1]*p) divisors=[i*j for i in divisors for j in pow_p] return divisors def Is_Prime(self,N): return N==self.smallest_prime_factor[N] def Totient(self,N): for p in self.Factorize(N).keys(): N*=p-1 N//=p return N def Mebius(self,N): fact=self.Factorize(N) for e in fact.values(): if e>=2: return 0 else: if len(fact)%2==0: return 1 else: return -1 N,L=map(int,readline().split()) P=Prime(L) ans=0 for d in P.primes: ans+=max(0,L-d*(N-1)+1) print(ans)