結果
問題 | No.644 G L C C D M |
ユーザー | vwxyz |
提出日時 | 2021-08-11 23:17:20 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 219 ms / 2,000 ms |
コード長 | 3,254 bytes |
コンパイル時間 | 193 ms |
コンパイル使用メモリ | 81,856 KB |
実行使用メモリ | 91,628 KB |
最終ジャッジ日時 | 2023-10-26 01:18:38 |
合計ジャッジ時間 | 5,992 ms |
ジャッジサーバーID (参考情報) |
judge15 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 138 ms
88,412 KB |
testcase_01 | AC | 138 ms
88,408 KB |
testcase_02 | AC | 140 ms
88,412 KB |
testcase_03 | AC | 142 ms
88,412 KB |
testcase_04 | AC | 138 ms
88,420 KB |
testcase_05 | AC | 140 ms
88,412 KB |
testcase_06 | AC | 140 ms
88,408 KB |
testcase_07 | AC | 143 ms
88,408 KB |
testcase_08 | AC | 141 ms
88,404 KB |
testcase_09 | AC | 141 ms
88,416 KB |
testcase_10 | AC | 146 ms
88,992 KB |
testcase_11 | AC | 163 ms
89,668 KB |
testcase_12 | AC | 150 ms
89,144 KB |
testcase_13 | AC | 177 ms
90,640 KB |
testcase_14 | AC | 157 ms
89,636 KB |
testcase_15 | AC | 149 ms
89,132 KB |
testcase_16 | AC | 148 ms
89,120 KB |
testcase_17 | AC | 140 ms
88,448 KB |
testcase_18 | AC | 139 ms
88,452 KB |
testcase_19 | AC | 140 ms
88,452 KB |
testcase_20 | AC | 138 ms
88,452 KB |
testcase_21 | AC | 150 ms
89,132 KB |
testcase_22 | AC | 219 ms
91,572 KB |
testcase_23 | AC | 197 ms
91,048 KB |
testcase_24 | AC | 190 ms
91,628 KB |
testcase_25 | AC | 154 ms
89,932 KB |
testcase_26 | AC | 158 ms
89,936 KB |
ソースコード
import bisect import copy import decimal import fractions import functools import heapq import itertools import math import random import sys 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 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 factorize=defaultdict(int) if N<=len(self.smallest_prime_factor)-1: while N!=1: factorize[self.smallest_prime_factor[N]]+=1 N//=self.smallest_prime_factor[N] else: for p in self.primes: while N%p==0: N//=p factorize[p]+=1 if N<p*p: if N!=1: factorize[N]+=1 break if N<=len(self.smallest_prime_factor)-1: while N!=1: factorize[self.smallest_prime_factor[N]]+=1 N//=self.smallest_prime_factor[N] break else: if N!=1: factorize[N]+=1 return factorize def Divisors(self,N): assert N>0 divisors=[1] for p,e in self.Factorize(N).items(): A=[1] for _ in range(e): A.append(A[-1]*p) divisors=[i*j for i in divisors for j in A] 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,M=map(int,readline().split()) ans=0 if N>=M: P=Prime(N) mod=10**9+7 for i in range(1,N+1): if i%M: continue ans+=P.Mebius(i//M)*(N//i)*(N//i-1) ans%=mod for i in range(1,N-1): ans*=i ans%=mod print(ans)