結果
問題 | No.800 四平方定理 |
ユーザー | vwxyz |
提出日時 | 2022-09-22 15:32:04 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 680 ms / 2,000 ms |
コード長 | 3,232 bytes |
コンパイル時間 | 268 ms |
コンパイル使用メモリ | 87,308 KB |
実行使用メモリ | 171,188 KB |
最終ジャッジ日時 | 2023-08-23 20:33:25 |
合計ジャッジ時間 | 17,361 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 338 ms
169,584 KB |
testcase_01 | AC | 337 ms
169,688 KB |
testcase_02 | AC | 338 ms
169,568 KB |
testcase_03 | AC | 336 ms
169,680 KB |
testcase_04 | AC | 338 ms
169,908 KB |
testcase_05 | AC | 345 ms
170,044 KB |
testcase_06 | AC | 340 ms
170,060 KB |
testcase_07 | AC | 345 ms
169,836 KB |
testcase_08 | AC | 336 ms
169,872 KB |
testcase_09 | AC | 335 ms
169,752 KB |
testcase_10 | AC | 470 ms
171,128 KB |
testcase_11 | AC | 511 ms
171,012 KB |
testcase_12 | AC | 481 ms
171,188 KB |
testcase_13 | AC | 486 ms
170,772 KB |
testcase_14 | AC | 482 ms
171,024 KB |
testcase_15 | AC | 486 ms
170,840 KB |
testcase_16 | AC | 488 ms
171,072 KB |
testcase_17 | AC | 486 ms
171,052 KB |
testcase_18 | AC | 487 ms
171,012 KB |
testcase_19 | AC | 492 ms
170,820 KB |
testcase_20 | AC | 327 ms
169,300 KB |
testcase_21 | AC | 326 ms
168,976 KB |
testcase_22 | AC | 486 ms
170,796 KB |
testcase_23 | AC | 618 ms
170,836 KB |
testcase_24 | AC | 624 ms
171,004 KB |
testcase_25 | AC | 618 ms
170,952 KB |
testcase_26 | AC | 327 ms
169,136 KB |
testcase_27 | AC | 325 ms
169,516 KB |
testcase_28 | AC | 680 ms
171,028 KB |
testcase_29 | AC | 616 ms
171,072 KB |
testcase_30 | AC | 619 ms
170,896 KB |
testcase_31 | AC | 603 ms
170,596 KB |
testcase_32 | AC | 620 ms
170,980 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 P=Prime(10**6) N,D=map(int,readline().split()) cnt=[0]*(8*10**6+1) for i in range(1,N+1): for j in range(i,N+1): cnt[(i+j)*(j-i)]+=1 ans=sum(cnt[abs(D-x**2-y**2)] for x in range(1,N+1) for y in range(1,N+1)) print(ans)