結果

問題 No.2125 Inverse Sum
ユーザー vwxyzvwxyz
提出日時 2023-11-21 06:14:09
言語 Python3
(3.12.2 + numpy 1.26.4 + scipy 1.12.0)
結果
AC  
実行時間 396 ms / 2,000 ms
コード長 4,405 bytes
コンパイル時間 176 ms
コンパイル使用メモリ 13,056 KB
実行使用メモリ 18,816 KB
最終ジャッジ日時 2024-09-26 07:02:02
合計ジャッジ時間 4,600 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 44 ms
12,288 KB
testcase_01 AC 45 ms
12,288 KB
testcase_02 AC 44 ms
12,160 KB
testcase_03 AC 44 ms
12,288 KB
testcase_04 AC 45 ms
12,288 KB
testcase_05 AC 47 ms
12,160 KB
testcase_06 AC 45 ms
12,160 KB
testcase_07 AC 50 ms
12,160 KB
testcase_08 AC 46 ms
12,160 KB
testcase_09 AC 46 ms
12,160 KB
testcase_10 AC 46 ms
12,288 KB
testcase_11 AC 45 ms
12,288 KB
testcase_12 AC 45 ms
12,160 KB
testcase_13 AC 44 ms
12,160 KB
testcase_14 AC 67 ms
12,288 KB
testcase_15 AC 46 ms
12,160 KB
testcase_16 AC 51 ms
12,160 KB
testcase_17 AC 45 ms
12,288 KB
testcase_18 AC 46 ms
12,288 KB
testcase_19 AC 45 ms
12,160 KB
testcase_20 AC 51 ms
12,288 KB
testcase_21 AC 44 ms
12,288 KB
testcase_22 AC 47 ms
12,288 KB
testcase_23 AC 45 ms
12,288 KB
testcase_24 AC 50 ms
12,160 KB
testcase_25 AC 51 ms
12,288 KB
testcase_26 AC 45 ms
12,288 KB
testcase_27 AC 396 ms
18,816 KB
testcase_28 AC 302 ms
17,280 KB
testcase_29 AC 267 ms
14,976 KB
testcase_30 AC 44 ms
12,288 KB
testcase_31 AC 299 ms
17,280 KB
testcase_32 AC 139 ms
12,160 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

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

P,Q=map(int,readline().split())
ans_lst=[]
F=Factorize(Q)
for p in F:
    F[p]*=2
primes=[p for p in F]
for E in itertools.product(*[range(F[p]+1) for p in primes]):
    d=1
    for p,e in zip(primes,E):
        d*=p**e
    if d%P==(-Q)%P and Q*Q//d%P==(-Q)%P and (d+Q)//P and (Q*Q//d+Q)//P:
        ans_lst.append(((d+Q)//P,(Q*Q//d+Q)//P))
ans_lst.sort()
print(len(ans_lst))
for ans in ans_lst:
    print(*ans)
0