結果
問題 | No.473 和と積の和 |
ユーザー | vwxyz |
提出日時 | 2023-11-21 05:52:36 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 2,842 ms / 3,000 ms |
コード長 | 4,434 bytes |
コンパイル時間 | 184 ms |
コンパイル使用メモリ | 82,344 KB |
実行使用メモリ | 115,036 KB |
最終ジャッジ日時 | 2024-09-26 07:01:43 |
合計ジャッジ時間 | 24,046 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 130 ms
89,332 KB |
testcase_01 | AC | 130 ms
89,556 KB |
testcase_02 | AC | 129 ms
89,172 KB |
testcase_03 | AC | 1,232 ms
103,972 KB |
testcase_04 | AC | 136 ms
89,540 KB |
testcase_05 | AC | 131 ms
89,308 KB |
testcase_06 | AC | 129 ms
89,352 KB |
testcase_07 | AC | 132 ms
89,376 KB |
testcase_08 | AC | 131 ms
89,440 KB |
testcase_09 | AC | 132 ms
89,356 KB |
testcase_10 | AC | 129 ms
89,368 KB |
testcase_11 | AC | 131 ms
89,536 KB |
testcase_12 | AC | 132 ms
89,644 KB |
testcase_13 | AC | 132 ms
90,000 KB |
testcase_14 | AC | 134 ms
90,116 KB |
testcase_15 | AC | 137 ms
90,300 KB |
testcase_16 | AC | 135 ms
90,016 KB |
testcase_17 | AC | 130 ms
89,304 KB |
testcase_18 | AC | 131 ms
89,160 KB |
testcase_19 | AC | 132 ms
89,348 KB |
testcase_20 | AC | 128 ms
89,036 KB |
testcase_21 | AC | 131 ms
89,584 KB |
testcase_22 | AC | 133 ms
89,148 KB |
testcase_23 | AC | 157 ms
90,168 KB |
testcase_24 | AC | 144 ms
89,912 KB |
testcase_25 | AC | 2,842 ms
97,764 KB |
testcase_26 | AC | 941 ms
99,480 KB |
testcase_27 | AC | 824 ms
95,376 KB |
testcase_28 | AC | 135 ms
89,436 KB |
testcase_29 | AC | 151 ms
90,196 KB |
testcase_30 | AC | 147 ms
90,136 KB |
testcase_31 | AC | 147 ms
90,320 KB |
testcase_32 | AC | 141 ms
90,408 KB |
testcase_33 | AC | 142 ms
90,356 KB |
testcase_34 | AC | 1,332 ms
91,908 KB |
testcase_35 | AC | 2,010 ms
97,436 KB |
testcase_36 | AC | 130 ms
89,604 KB |
testcase_37 | AC | 147 ms
90,404 KB |
testcase_38 | AC | 2,172 ms
102,068 KB |
testcase_39 | AC | 1,358 ms
101,252 KB |
testcase_40 | AC | 1,342 ms
97,692 KB |
testcase_41 | AC | 133 ms
89,492 KB |
testcase_42 | AC | 178 ms
101,540 KB |
testcase_43 | AC | 1,317 ms
113,372 KB |
testcase_44 | AC | 2,318 ms
115,036 KB |
testcase_45 | AC | 131 ms
89,456 KB |
testcase_46 | AC | 133 ms
89,548 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 #import pypyjit #pypyjit.set_param('max_unroll_recursion=-1') #sys.set_int_max_str_digits(10**9) def Extended_Euclid(n,m): stack=[] while m: stack.append((n,m)) n,m=m,n%m if n>=0: x,y=1,0 else: x,y=-1,0 for i in range(len(stack)-1,-1,-1): n,m=stack[i] x,y=y,x-(n//m)*y return x,y class MOD: def __init__(self,p,e=None): self.p=p self.e=e if self.e==None: self.mod=self.p else: self.mod=self.p**self.e def Pow(self,a,n): a%=self.mod if n>=0: return pow(a,n,self.mod) else: #assert math.gcd(a,self.mod)==1 x=Extended_Euclid(a,self.mod)[0] return pow(x,-n,self.mod) def Build_Fact(self,N): assert N>=0 self.factorial=[1] if self.e==None: for i in range(1,N+1): self.factorial.append(self.factorial[-1]*i%self.mod) else: self.cnt=[0]*(N+1) for i in range(1,N+1): self.cnt[i]=self.cnt[i-1] ii=i while ii%self.p==0: ii//=self.p self.cnt[i]+=1 self.factorial.append(self.factorial[-1]*ii%self.mod) self.factorial_inve=[None]*(N+1) self.factorial_inve[-1]=self.Pow(self.factorial[-1],-1) for i in range(N-1,-1,-1): ii=i+1 while ii%self.p==0: ii//=self.p self.factorial_inve[i]=(self.factorial_inve[i+1]*ii)%self.mod def Build_Inverse(self,N): self.inverse=[None]*(N+1) assert self.p>N self.inverse[1]=1 for n in range(2,N+1): if n%self.p==0: continue a,b=divmod(self.mod,n) self.inverse[n]=(-a*self.inverse[b])%self.mod def Inverse(self,n): return self.inverse[n] def Fact(self,N): if N<0: return 0 retu=self.factorial[N] if self.e!=None and self.cnt[N]: retu*=pow(self.p,self.cnt[N],self.mod)%self.mod retu%=self.mod return retu def Fact_Inve(self,N): if self.e!=None and self.cnt[N]: return None return self.factorial_inve[N] def Comb(self,N,K,divisible_count=False): if K<0 or K>N: return 0 retu=self.factorial[N]*self.factorial_inve[K]%self.mod*self.factorial_inve[N-K]%self.mod if self.e!=None: cnt=self.cnt[N]-self.cnt[N-K]-self.cnt[K] if divisible_count: return retu,cnt else: retu*=pow(self.p,cnt,self.mod) retu%=self.mod return retu def Factorize(N): assert N>=1 factors=defaultdict(int) for p in range(2,N): if p**2>N: break while N%p==0: factors[p]+=1 N//=p if N!=1: factors[N]+=1 return factors def Divisors(N): divisors=[] for i in range(1,N+1): if i**2>=N: break elif N%i==0: divisors.append(i) if i**2==N: divisors+=[i]+[N//i for i in divisors[::-1]] else: divisors+=[N//i for i in divisors[::-1]] return divisors N,X=map(int,readline().split()) X+=1 D=Divisors(X) dp={(d,d):1 for d in D if d!=1 and d**N<=X} for n in range(2,N+1): prev=dp dp=defaultdict(int) for (p,mi),c in prev.items(): for d in D: if d<mi: continue if p*d**(N-n)>X: continue if X%(d*p): continue dp[(d*p,d)]+=c ans=sum(c for (p,mi),c in dp.items() if p==X) print(ans)