結果
問題 | No.6 使いものにならないハッシュ |
ユーザー | vwxyz |
提出日時 | 2021-06-26 18:41:25 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 637 ms / 5,000 ms |
コード長 | 2,944 bytes |
コンパイル時間 | 271 ms |
コンパイル使用メモリ | 87,168 KB |
実行使用メモリ | 99,228 KB |
最終ジャッジ日時 | 2023-09-07 15:26:52 |
合計ジャッジ時間 | 18,283 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 273 ms
96,128 KB |
testcase_01 | AC | 282 ms
96,544 KB |
testcase_02 | AC | 637 ms
98,324 KB |
testcase_03 | AC | 378 ms
97,740 KB |
testcase_04 | AC | 426 ms
99,064 KB |
testcase_05 | AC | 414 ms
98,448 KB |
testcase_06 | AC | 524 ms
97,664 KB |
testcase_07 | AC | 499 ms
98,752 KB |
testcase_08 | AC | 517 ms
97,836 KB |
testcase_09 | AC | 559 ms
97,884 KB |
testcase_10 | AC | 274 ms
96,256 KB |
testcase_11 | AC | 382 ms
98,692 KB |
testcase_12 | AC | 530 ms
98,148 KB |
testcase_13 | AC | 543 ms
97,776 KB |
testcase_14 | AC | 544 ms
98,300 KB |
testcase_15 | AC | 498 ms
97,964 KB |
testcase_16 | AC | 564 ms
99,228 KB |
testcase_17 | AC | 601 ms
98,928 KB |
testcase_18 | AC | 610 ms
98,800 KB |
testcase_19 | AC | 579 ms
98,896 KB |
testcase_20 | AC | 544 ms
97,596 KB |
testcase_21 | AC | 349 ms
97,940 KB |
testcase_22 | AC | 568 ms
98,316 KB |
testcase_23 | AC | 528 ms
98,044 KB |
testcase_24 | AC | 543 ms
98,332 KB |
testcase_25 | AC | 491 ms
98,116 KB |
testcase_26 | AC | 603 ms
98,884 KB |
testcase_27 | AC | 605 ms
98,308 KB |
testcase_28 | AC | 451 ms
98,060 KB |
testcase_29 | AC | 607 ms
98,208 KB |
testcase_30 | AC | 573 ms
98,980 KB |
testcase_31 | AC | 555 ms
98,196 KB |
ソースコード
import bisect import copy import decimal import fractions 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): 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] K,N=map(int,read().split()) def hash(n): if n<10: return n s=0 while n>=10: s+=n%10 n//=10 s+=n return hash(s) P=Prime(2*10**5) primes=[p for p in P.primes if K<=p<=N] lst=[hash(p) for p in primes] m=0 ans=None for i in range(N+1): for d in range(1,11): j=i+d if N<j: continue if len(Counter(lst[i:j]))==d: if m<=d: m=d ans=primes[i] print(ans)