結果
問題 | No.1580 I like Logarithm! |
ユーザー | kyaneko999 |
提出日時 | 2021-07-02 21:42:30 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 236 ms / 2,000 ms |
コード長 | 3,270 bytes |
コンパイル時間 | 1,262 ms |
コンパイル使用メモリ | 86,988 KB |
実行使用メモリ | 79,596 KB |
最終ジャッジ日時 | 2023-09-11 21:31:44 |
合計ジャッジ時間 | 10,702 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge13 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 147 ms
78,000 KB |
testcase_01 | AC | 145 ms
78,020 KB |
testcase_02 | AC | 148 ms
77,700 KB |
testcase_03 | AC | 143 ms
78,144 KB |
testcase_04 | AC | 144 ms
77,924 KB |
testcase_05 | AC | 146 ms
77,736 KB |
testcase_06 | AC | 203 ms
79,160 KB |
testcase_07 | AC | 229 ms
79,424 KB |
testcase_08 | AC | 146 ms
78,096 KB |
testcase_09 | AC | 156 ms
79,204 KB |
testcase_10 | AC | 163 ms
79,596 KB |
testcase_11 | AC | 202 ms
79,304 KB |
testcase_12 | AC | 203 ms
79,540 KB |
testcase_13 | AC | 194 ms
79,564 KB |
testcase_14 | AC | 225 ms
79,556 KB |
testcase_15 | AC | 207 ms
78,988 KB |
testcase_16 | AC | 146 ms
78,196 KB |
testcase_17 | AC | 146 ms
78,208 KB |
testcase_18 | AC | 144 ms
77,872 KB |
testcase_19 | AC | 145 ms
77,928 KB |
testcase_20 | AC | 144 ms
77,876 KB |
testcase_21 | AC | 143 ms
77,852 KB |
testcase_22 | AC | 146 ms
77,928 KB |
testcase_23 | AC | 141 ms
78,068 KB |
testcase_24 | AC | 141 ms
77,860 KB |
testcase_25 | AC | 145 ms
78,208 KB |
testcase_26 | AC | 228 ms
79,308 KB |
testcase_27 | AC | 229 ms
79,300 KB |
testcase_28 | AC | 226 ms
79,056 KB |
testcase_29 | AC | 226 ms
79,276 KB |
testcase_30 | AC | 228 ms
79,224 KB |
testcase_31 | AC | 230 ms
79,056 KB |
testcase_32 | AC | 228 ms
79,288 KB |
testcase_33 | AC | 229 ms
79,512 KB |
testcase_34 | AC | 227 ms
79,304 KB |
testcase_35 | AC | 228 ms
78,996 KB |
testcase_36 | AC | 233 ms
79,208 KB |
testcase_37 | AC | 228 ms
79,532 KB |
testcase_38 | AC | 228 ms
79,328 KB |
testcase_39 | AC | 228 ms
79,588 KB |
testcase_40 | AC | 230 ms
79,224 KB |
testcase_41 | AC | 230 ms
79,208 KB |
testcase_42 | AC | 229 ms
79,588 KB |
testcase_43 | AC | 236 ms
79,384 KB |
testcase_44 | AC | 229 ms
79,208 KB |
ソースコード
import sys from sys import exit, stdin from collections import deque, defaultdict, Counter from copy import deepcopy from bisect import bisect_left, bisect_right, insort_left, insort_right from heapq import heapify, heappop, heappush from itertools import product, permutations, combinations, combinations_with_replacement from functools import reduce from math import gcd, sin, cos, tan, asin, acos, atan, atan2, degrees, radians, ceil, floor from math import pi as PI from random import randint # from decimal import Decimal sys.setrecursionlimit(500000) INF = (1<<61)-1 EPS = 1e-10 MOD = 10**9+7 # MOD = 998244353 def input(): return stdin.readline()[:-1] def intput(): return int(stdin.readline()) def minput(): return stdin.readline()[:-1].split() def linput(): return stdin.readline()[:-1].split() def mint(): return map(int,stdin.readline().split()) def lint(): return list(map(int,stdin.readline().split())) def ilint(): return int(stdin.readline()), list(map(int,stdin.readline().split())) def lcm(x,y): return x*y//gcd(x,y) def lgcd(l): return reduce(gcd,l) def llcm(l): return reduce(lcm,l) def powmod(n,i,mod=MOD): return pow(n,mod-1+i,mod) if i<0 else pow(n,i,mod) def div2(x): return x.bit_length() def div10(x): return len(str(x))-(x==0) def popcount(x): return bin(x).count('1') def digit(x,i,max_len=None): s = str(x) if max_len: i -= max_len-len(s) return int(s[i-1]) if i>0 else 0 def digitsum(x): ans = 0 for i in range(div10(x)): ans += digit(x,i+1) return ans def pf(x,mode='counter'): C = Counter() p = 2 while x>1: k = 0 while x%p==0: x //= p k += 1 if k>0: C[p] += k p = p+2-(p==2) if p*p<x else x if mode=='counter': return C S = set([1]) for k in C: T = deepcopy(S) for x in T: for i in range(1,C[k]+1): S.add(x*(k**i)) if mode=='set': return S if mode=='list': return sorted(S) def isprime(x): if x<2: return False return len(pf(x,'set'))==2 def matmul(A, B): # import numpy A1, A2 = A >> 15, A & (1 << 15) - 1 B1, B2 = B >> 15, B & (1 << 15) - 1 X = np.dot(A1, B1) % MOD Y = np.dot(A2, B2) Z = np.dot(A1 + A2, B1 + B2) - X - Y return ((X << 30) + (Z << 15) + Y) % MOD def matpow(A, N): P = np.eye(A.shape[0], dtype=np.int64) while N: if N & 1: P = matmul(P, A) A = matmul(A, A) N >>= 1 return P def zash(S): lis = sorted(S) dic = {} for i,x in enumerate(lis): dic[x] = i return lis, dic def pr(*x): print(*x, sep='', end='') if len(x) else print() def lprint(l): for x in l: print(x) def ston(c, c0='a'): return ord(c)-ord(c0) def ntos(x, c0='a'): return chr(x+ord(c0)) def judge(x, l=['Yes', 'No']): print(l[0] if x else l[1]) def debug(*x, flag=1): if flag: print(*x) ###################################################### a=intput() b=input() N=len(b) ans=0 for i in range(N-1): ans+=i*(powmod(a,i+1,MOD)-powmod(a,i,MOD)) B=0 for s in b: B*=a B+=int(s) B%=MOD ans+=(N-1)*(B-powmod(a,N-1,MOD)+1) ans%=MOD print(ans)