input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
# -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, produc... | # -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, produc... | p02960 |
# -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, produc... | # -*- coding: utf-8 -*-
import sys
# sys.setrecursionlimit(10**6)
# buff_readline = sys.stdin.buffer.readline
buff_readline = sys.stdin.readline
readline = sys.stdin.readline
INF = 2**62-1
def read_int():
return int(buff_readline())
def read_int_n():
return list(map(int, buff_readline().spli... | p02960 |
# 17:02-17:26
MOD = pow(10,9)+7
S = input()[::-1]
N = len(S)
F = [0]*N
for i in range(N):
F[i] = pow(10,i,13)
D = [[[0]*13 for j in range(10)] for i in range(N)]
for i in range(N):
if S[i]=="?":
for j in range(10):
k = (F[i]*j)%13
if i==0:
D[i][j][k... | MOD = pow(10,9)+7
S = input()[::-1]
N = len(S)
DP = [[0]*13 for i in range(N)]
K = 1
for i in range(N):
if S[i]=="?":
for j in range(10):
if i==0:
DP[0][(j*K)%13] = 1
else:
for k in range(13):
DP[i][(j*K+k)%13] += DP[i... | p02960 |
MOD = pow(10,9)+7
S = input()[::-1]
N = len(S)
DP = [[0]*13 for i in range(N)]
K = 1
for i in range(N):
if S[i]=="?":
for j in range(10):
if i==0:
DP[0][(j*K)%13] = 1
else:
for k in range(13):
DP[i][(j*K+k)%13] += DP[i... | MOD = pow(10,9)+7
S = input()[::-1]
N = len(S)
DP = [[0]*13 for i in range(N)]
K = 1
for i in range(N):
if S[i]=="?":
for j in range(10):
if i==0:
DP[0][(j*K)%13] = 1
else:
for k in range(13):
DP[i][(j*K+k)%13] += DP[i... | p02960 |
import sys
sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in ... | import sys
sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in ... | p02960 |
import sys
sys.setrecursionlimit(4100000)
import logging
# logging.basicConfig(level=logging.DEBUG)
logger = logging.getLogger(__name__)
import re
def resolve():
S = sys.stdin.readline().split()[0]
logger.debug(S)
dp = [[0] * 13 for i in range(len(S))]
i = 0
if S[i] == '?':
... | import sys
sys.setrecursionlimit(4100000)
import logging
# logging.basicConfig(level=logging.DEBUG)
logger = logging.getLogger(__name__)
import re
# @profile
def resolve():
S = sys.stdin.readline().split()[0]
logger.debug(S)
dp = [[0] * 13 for i in range(len(S))]
i = 0
if S... | p02960 |
def main():
s = input()[::-1]
mod = 10**9+7
dp = [[0 for j in range(13)] for i in range(len(s)+1)]
dp[0][0] = 1
ten = 1
for i in range(len(s)):
if s[i] == "?":
for k in range(10):
x = k*ten%13
for j in range(13):
... | def main():
s = input()[::-1]
mod = 10**9+7
dp = [[0 for j in range(13)] for i in range(len(s)+1)]
dp[0][0] = 1
ten = 1
for i in range(len(s)):
if s[i] == "?":
for k in range(10):
x = k*ten%13
for j in range(13):
... | p02960 |
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
mod = 10**9+7
s = readline().rstrip().decode('utf-8')
dp = [0]*13 #あまりが0~12の13通りとなる場合の数
dp[0] = 1
dig = 1 #今見てる桁数
for i in range(len(s)-1,-1,-1): #小さい方の桁から見ていく
c = s[i]
next_dp = [0... | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
mod = 10**9+7
s = readline().rstrip().decode('utf-8')
dp = [0]*13 #あまりが0~12の13通りとなる場合の数
dp[0] = 1
dig = 1 #今見てる桁数
for i in range(len(s)-1,-1,-1): #小さい方の桁から見ていく
c = s[i]
next_dp = [0... | p02960 |
# python template for atcoder1
import sys
sys.setrecursionlimit(10**9)
input = sys.stdin.readline
MOD = 10**9+7
def solve():
S = input()[:-1]
dp = [[0]*13 for _ in range(len(S)+1)]
dp[0][0] = 1
S = list(reversed(S))
for i in range(len(S)):
if S[i] == "?":
#dig =... | import sys
sys.setrecursionlimit(10**9)
input = sys.stdin.readline
MOD = 10**9+7
S = input()[:-1]
#dp[文字列をしたの桁からI番目まで見て][あまりがjになる数] = のこすう
dp = [[0]*13 for _ in range(len(S)+1)]
dp[0][0] = 1
# 文字列を逆順から見ていく
S = list(reversed(S))
for i in range(len(S)):
if S[i] == "?":
dig = pow(10, i, 13)
... | p02960 |
from sys import stdin, setrecursionlimit
def main():
mod = 10 ** 9 + 7
input = stdin.buffer.readline
s = list(input()[:-1].decode())
s.reverse()
n = len(s)
p10 = [0] * n
p10[0] = 1
for i in range(1, n):
p10[i] = 10 * p10[i - 1]
dp = [0] * 13
if s[0] ==... | from sys import stdin, setrecursionlimit
def main():
mod = 10 ** 9 + 7
input = stdin.buffer.readline
s = list(input()[:-1].decode())
n = len(s)
dp = [0] * 13
if s[0] == '?':
for i in range(10):
dp[i % 13] += 1
else:
dp[int(s[0]) % 13] += 1
... | p02960 |
import sys,math,copy
# import numpy as np
input = sys.stdin.readline
S = ''.join(reversed(input().strip()))
# dp = np.zeros((13), dtype=int)
# dp_ = np.zeros((13), dtype=int)
dp = [0] * 13
dp_ = [0] * 13
mod13_list = [i % 13 for i in range(12 ** 2 + 1)]
list10 = list(range(10))
list13 = list(range(13))
div... | import sys,math,copy
def main():
# import numpy as np
input = sys.stdin.readline
S = ''.join(reversed(input().strip()))
# dp = np.zeros((13), dtype=int)
# dp_ = np.zeros((13), dtype=int)
dp = [0] * 13
dp_ = [0] * 13
mod13_list = [i % 13 for i in range(12 ** 2 + 1)]
list... | p02960 |
N = input()[::-1]
iv = 1
MOD = 10**9+7
pdp = [0 for i in range(13)]
pdp[0]=1
dp = [0 for i in range(13)]
for i in range(len(N)):
x = N[i]
if x=='?':
for j in range(13):
for h in range(10):
dp[(h*iv+j)%13] += pdp[j]
for j in range(13):
pdp[j] = (dp[j]%MOD)
dp[j] = 0
... | N = input()[::-1]
iv = 1
MOD = 10**9+7
dp = [0 for i in range(13)]
dp[0]=1
ls = [0 for i in range(13)]
for i in range(len(N)):
x = N[i]
if x=='?':
for j in range(13):
for h in range(10):
ls[(h*iv+j)%13] += dp[j]
for j in range(13):
dp[j] = (ls[j]%MOD)
ls[j] = 0
els... | p02960 |
N = input()[::-1]
iv = 1
MOD = 10**9+7
dp = [0]*13
dp[0]=1
ls = [0]*13
for i in range(len(N)):
x = N[i]
if x=='?':
for j in range(13):
for h in range(10):
ls[(h*iv+j)%13] += dp[j]
else:
x = int(x)
for j in range(13):
ls[(j+x*iv)%13]+=dp[j]
fo... | N = input()[::-1]
iv = 1
MOD = 10**9+7
dp = [0]*13
dp[0]=1
ls = [0]*13
for i in range(len(N)):
x = N[i]
if x=='?':
for j in range(13):
for h in range(10):
ls[(h*iv+j)%13] += dp[j]
else:
x = int(x)
for j in range(13):
ls[(j+x*iv)%13]+=dp[j]
fo... | p02960 |
from sys import stdin
input = stdin.readline
def main():
S = input()[:-1]
dp = [[0]*13 for _ in range(len(S)+1)]
dp[0][0] = 1
for i in range(1, len(S)+1):
if S[i-1] == '?':
for s in range(10):
for j in range(13):
dp[i][(10*j + s) % 13] += dp[i-1][j]
else:
... | from sys import stdin
input = stdin.readline
def main():
S = input()[:-1]
dp = [[0]*13 for _ in range(len(S)+1)]
dp[0][0] = 1
MOD = 1_000_000_007
for i in range(1, len(S)+1):
if S[i-1] == '?':
for s in range(10):
for j in range(13):
dp[i][(10*j + s) % 13] += (dp[i-... | p02960 |
import sys
stdin = sys.stdin
inf = 1 << 60
mod = 1000000007
ni = lambda: int(ns())
nin = lambda y: [ni() for _ in range(y)]
na = lambda: list(map(int, stdin.readline().split()))
nan = lambda y: [na() for _ in range(y)]
nf = lambda: float(ns())
nfn = lambda y: [nf() for _ in range... | import sys
stdin = sys.stdin
inf = 1 << 60
mod = 1000000007
ni = lambda: int(ns())
nin = lambda y: [ni() for _ in range(y)]
na = lambda: list(map(int, stdin.readline().split()))
nan = lambda y: [na() for _ in range(y)]
nf = lambda: float(ns())
nfn = lambda y: [nf() for _ in range... | p02960 |
s = input().strip()
DIV = 10**9 + 7
digit = 1
log = []
for i, c in enumerate(reversed(s)):
if i == 0:
if c == '?':
log.append([int(t < 10) for t in range(13)])
else:
log.append([int(t == int(c)) for t in range(13)])
else:
log.append([0 for t in rang... | s = input().strip()
DIV = 10**9 + 7
digit = 1
log = []
for i, c in enumerate(reversed(s)):
if i == 0:
if c == '?':
log.append([int(t < 10) for t in range(13)])
else:
log.append([int(t == int(c)) for t in range(13)])
else:
log.append([0 for t in rang... | p02960 |
import sys
sys.setrecursionlimit(10 ** 7)
read = sys.stdin.buffer.read
inp = sys.stdin.buffer.readline
def inpS(): return inp().rstrip().decode()
readlines = sys.stdin.buffer.readlines
MOD = 10**9+7
S = inpS()
N = len(S)
dp = [[0]*13 for _ in range(N+1)]
dp[0][0] = 1
for dgt in range(N):
for mo in r... | import sys
sys.setrecursionlimit(10 ** 7)
read = sys.stdin.buffer.read
inp = sys.stdin.buffer.readline
def inpS(): return inp().rstrip().decode()
readlines = sys.stdin.buffer.readlines
MOD = 10**9+7
S = inpS()
N = len(S)
dp = [0]*13
dp[0] = 1
mul = 1
for i in range(N-1, -1, -1):
nextDP = [0]*13
... | p02960 |
# -*- coding: utf-8 -*-
import sys
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(eval(input()))
def MAP(): r... | # -*- coding: utf-8 -*-
import sys
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(eval(input()))
def MAP(): r... | p02960 |
import sys
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
MOD = 10 ** 9 + 7
S = sr()
# 桁DP, 上から
dp = [0] * 13
dp[0] = 1
for s in S:
prev = [x for x in dp]
num = s
dp = [0] * 13
if num != '?':
num = int(num)
f... | import sys
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
MOD = 10 ** 9 + 7
S = sr()
# 桁DP, 上から
dp = [0] * 13
dp[0] = 1
for s in S:
prev = [x for x in dp]
dp = [0] * 13
if s == '?':
loop = list(range(10))
else:
... | p02960 |
import sys
input = sys.stdin.readline
mod = 10**9 + 7
s = input().rstrip()
n = len(s)
s = s[::-1]
dp = [[0]*13 for _ in range(n + 1)] # dp[i][j] : i桁目まで見て13で割ってj余る個数
dp[0][0] = 1
for i in range(n):
if s[i] != '?':
s_ = int(s[i]) * 10**i
for j in range(13):
dp[i + 1][(j + ... | import sys
input = sys.stdin.readline
mod = 10**9 + 7
s = input().rstrip()
n = len(s)
s = s[::-1]
dp = [[0]*13 for _ in range(n + 1)] # dp[i][j] : i桁目まで見て13で割ってj余る個数
dp[0][0] = 1
mul = 1
for i in range(n):
if i > 0:
mul *= 10
mul %= 13
if s[i] != '?':
s_ = int(s[i]) * m... | p02960 |
import sys
def main():
input = sys.stdin.readline
MOD = 10**9 + 7
S = list(str(input().strip()))
n = len(S)
dp = [[0] * 13 for _ in range(n)]
s = S.pop()
if s == '?':
for i in range(10):
dp[0][i] = 1
else:
s = int(s)
dp[0][s] = 1
... | import sys
def main():
input = sys.stdin.readline
MOD = 10**9 + 7
T = list(str(input().strip()))
S = [int(t) if t != '?' else -1 for t in T]
n = len(S)
dp = [[0] * 13 for _ in range(n)]
s = S.pop()
if s < 0:
for i in range(10):
dp[0][i] = 1
else:
... | p02960 |
s=input()[::-1]
if s[0]=="?":
p=[1]*10+[0]*3
else:
p=[0]*13
p[int(s[0])]=1
q=10
for i in s[1:]:
if i!="?":
i=int(i)
s=q*i%13
p=p[-s:]+p[:-s]
else:
d=[0]*13
for j in range(10):
s=q*j%13
r=p[-s:]+p[:-s]
d=[(r[... | s=input()[::-1]
p=[1]+[0]*12
q=1
t=[[(i*k)%13 for i in range(10)]for k in range(13)]
for i in s:
if i!="?":
i=int(i)
g=t[q][i]
p=p[-g:]+p[:-g]
else:
d=[0]*13
for j in t[q]:
r=p[-j:]+p[:-j]
d=[(r[i]+d[i])%(10**9+7)for i in range(13)]
... | p02960 |
S=input()
l=len(S)
dp=[ 0 for j in range(13) ]
dp[0]=1
mod=10**9+7
dp2=[ 0 for _ in range(13) ]
for i in range(1,l+1):
dp2=[0]*13
for j in range(13):
if dp[j]!=0:
if S[i-1]=="?":
for k in range(10):
next=(k*pow(10,l-i,13)+j)%13
dp2[next]+=dp[j]
dp2[next]%=mod
else:
... | S=input()
S=S[::-1]
l=len(S)
dp=[ 0 for j in range(13) ]
dp[0]=1
mod=10**9+7
dp2=[ 0 for _ in range(13) ]
keta=1
for i in range(1,l+1):
dp2=[0]*13
for j in range(13):
if dp[j]!=0:
if S[i-1]=="?":
for k in range(10):
next=(k*keta+j)%13
dp2[next]+=dp[j]
dp2[next]%=mod
... | p02960 |
# -*- coding: utf-8 -*-
import sys
S=sys.stdin.readline().strip()
N=len(S)
mod=10**9+7
dp=[ [ 0 for j in range(13) ] for i in range(N) ]
for i,x in enumerate(S[::-1]): #i桁目
if i==0:
if x!="?":
x=int(x)
dp[i][(x*pow(10,i,13))%13]=1
else:
for x in r... | # -*- coding: utf-8 -*-
import sys
S=sys.stdin.readline().strip()
N=len(S)
mod=10**9+7
dp=[ [ 0 for j in range(13) ] for i in range(N) ]
for i,x in enumerate(S[::-1]): #i桁目
if i==0:
if x!="?":
x=int(x)
dp[i][(x*pow(10,i,13))%13]=1
else:
for x in r... | p02960 |
# -*- coding: utf-8 -*-
import sys
from collections import defaultdict
S=sys.stdin.readline().strip()
N=len(S)
mod=10**9+7
S=S[::-1]
dp=defaultdict(lambda: 0)
for i,x in enumerate(S): #i桁目
if i==0:
if x!="?":
x=int(x)
dp[(i,(x*pow(10,i,13))%13)]=1
else:
... | # -*- coding: utf-8 -*-
import sys
S=sys.stdin.readline().strip()
N=len(S)
mod=10**9+7
S=S[::-1]
dp=[ [ 0 for j in range(13) ] for i in range(N) ]
for i,x in enumerate(S): #i桁目
if i==0:
num=pow(10,i,13)
if x!="?":
x=int(x)
dp[i][(x*num)%13]=1
else:
... | p02960 |
mo=10**9+7
t=input()[::-1]
dp=[0]*13
dp[0]=1
for d in range(len(t)):
p=[0]*13
if t[d]=='?':
for x in range(10):
r=int(x)*pow(10,d,13)
for i in range(13):
p[(i+r)%13]+=dp[i]
else:
r=int(t[d])*pow(10,d,13)
for i in range(13):
p[(i+r)%13]=dp[i]
dp=[j%mo for j in... | m=10**9+7
t=input()[::-1]
dp=[0]*13
dp[0]=1
for d in range(len(t)):
p=[0]*13
if t[d]=='?':
for x in range(10):
r=int(x)*pow(10,d,13)
for i in range(13):
p[(i+r)%13]+=dp[i]
else:
r=int(t[d])*pow(10,d,13)
for i in range(13):
p[(i+r)%13]=dp[i]
dp=[j%m for j in p... | p02960 |
z=10
m=z**9+7
k=13
t=input()[::-1]
dp=[0]*k
dp[0]=1
for d in range(len(t)):
p=[0]*k
f=(t[d]=='?')
for i in range(k):
for x in range(1+f*9):
r=pow(z,d,k)
r*=int(x if f else t[d])
p[(i+r)%k]+=dp[i]
dp=[j%m for j in p]
print((dp[5]%m))
| z=10
m=z**9+7
k=13
t=input()[::-1]
dp=[0]*k
dp[0]=1
for d in range(len(t)):
p=[0]*k
f=(t[d]=='?')
for i in range(k):
l=pow(z,d,k)
for x in range(1+f*9):
r=l*int(x if f else t[d])
p[(i+r)%k]+=dp[i]
dp=[j%m for j in p]
print((dp[5]%m))
| p02960 |
p = 10**9+7
def pow(x,m):
if m==0:
return 1
if m==1:
return x%13
if m%2==0:
return (pow(x,m//2)**2)%13
else:
return (x*(pow(x,(m-1)//2)**2)%13)%13
S = input().strip()
n = len(S)
A = [0 for _ in range(n)]
for i in range(n):
A[i] = pow(10,i)
dp = [[0 for ... | p = 10**9+7
S = input().strip()
n = len(S)
dp = [[0 for _ in range(13)] for _ in range(n+1)]
dp[0][0] = 1
for i in range(n):
for j in range(13):
if S[i]!="?":
dp[i+1][(10*j+int(S[i]))%13] = dp[i][j]
else:
for k in range(10):
dp[i+1][(10*j+k)%13] = (... | p02960 |
p = 10**9+7
S = input().strip()
A = [[0 for k in range(13)] for j in range(13)]
for j in range(13):
for k in range(13):
for m in range(10):
if (10*k+m)%13==j:
A[j][k] = 1
break
B = [[0 for _ in range(10)] for _ in range(13)]
for j in range(13):
for ... | p = 10**9+7
S = input().strip()
N = len(S)
dp = [[0 for _ in range(13)] for _ in range(N+1)]
for m in range(13):
dp[0][0] = 1
for i in range(1,N+1):
for m in range(13):
if S[i-1]=="?":
for j in range(10):
dp[i][(m*10+j)%13] = (dp[i][(m*10+j)%13]+dp[i-1][m])%p
... | p02960 |
from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools
sys.setrecursionlimit(10**8)
mod = 10**9+7
mod2 = 998244353
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))... | from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools
sys.setrecursionlimit(10**8)
mod = 10**9+7
mod2 = 998244353
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))... | p02960 |
#coding utf-8
S=list(input().strip())
S=[0]+S
mod=10**9+7
dp=[[0 for i in range(13)] for j in range(len(S)+1)]
dp[0][0]=1
for i in range(len(S)):
if S[i]=="?":
for j in range(13):
for k in range(10):
dp[i+1][(j*10+k)%13]+=dp[i][j]%mod
else:
for j in range(13):
dp[i+1... | #coding utf-8
S=list(input().strip())
S=[0]+S
l=len(S)
mod=10**9+7
dp=[[0 for i in range(13)] for j in range(l+1)]
dp[0][0]=1
for i in range(l):
if S[i]=="?":
for j in range(13):
for k in range(10):
dp[i+1][(j*10+k)%13]+=dp[i][j]%mod
else:
for j in range(13):
dp[i+1... | p02960 |
MOD = 10**9 + 7
def main():
s = open(0).read()[:-1][::-1]
n = len(s)
prev = [0] * 13
if s[0] == '?':
for j in range(10):
prev[j] = 1
else:
prev[int(s[0])] = 1
mod13 = [1, 10, 9, 12, 3, 4]
for i, cur_s in enumerate(s[1:], start=1):
next = ... | MOD = 10**9 + 7
def main():
s = [int(in_i) if in_i != '?' else -1 for in_i in list(open(0).read())[:-1]]
n = len(s)
cnt = [0] * 13
if s[0] == -1:
for j in range(10):
cnt[j] = 1
else:
cnt[s[0]] = 1
for cur_s in s[1:]:
dp = [0] * 26
for ... | p02960 |
import sys,math,collections,itertools
input = sys.stdin.readline
s = input().rstrip()[::-1]
DP=[0 for _ in range(13)]
DP[0]=1
m = 10**9+7
mul = 1
for i in range(len(s)):
dig = s[i]
nextDP = [0 for _ in range(13)]
if dig == '?':
for j in range(10):
for k in range(13):
... | import sys,math,collections,itertools
input = sys.stdin.readline
s = input().rstrip()[::-1]
DP=[0 for _ in range(13)]
DP[0]=1
m = 10**9+7
mul = 1
for i in range(len(s)):
dig = s[i]
nextDP = [0 for _ in range(13)]
if dig == '?':
for j in range(10):
for k in range(13):
... | p02960 |
import sys
readline = sys.stdin.readline
sys.setrecursionlimit(10**8)
mod = 10**9+7
#mod = 998244353
INF = 10**18
eps = 10**-7
S = readline().rstrip()
S = S[::-1]
dp = [0]*13
dp[0] = 1
for i,s in enumerate(S):
dpnew = [0]*13
if s != '?':
k = int(s)
for j in range(13):
... | import sys
readline = sys.stdin.readline
sys.setrecursionlimit(10**8)
mod = 10**9+7
#mod = 998244353
INF = 10**18
eps = 10**-7
S = readline().rstrip()
S = S[::-1]
dp = [0]*13
dp[0] = 1
for i,s in enumerate(S):
dpnew = [0]*13
pow10 = pow(10,i,13)
if s != '?':
k = int(s)
fo... | p02960 |
import sys
readline = sys.stdin.readline
sys.setrecursionlimit(10**8)
mod = 10**9+7
#mod = 998244353
INF = 10**18
eps = 10**-7
S = readline().rstrip()
S = S[::-1]
dp = [0]*13
dp[0] = 1
pow10 = 4
for i,s in enumerate(S):
dpnew = [0]*13
pow10 = pow10*10%13
if s != '?':
k = int(s)
... | import sys
readline = sys.stdin.readline
sys.setrecursionlimit(10**8)
mod = 10**9+7
#mod = 998244353
INF = 10**18
eps = 10**-7
S = readline().rstrip()
S = S[::-1]
dp = [0]*13
dp[0] = 1
pow10 = 4
for i,s in enumerate(S):
dpnew = [0]*13
pow10 = (pow10*10)%13
if s != '?':
k = int(s)
... | p02960 |
M = 10 ** 9 + 7
s = input().strip()
num = 0
q_list = []
d = 1
l = len(s)
for i in range(l - 1, -1, -1):
c = s[i]
if c != "?":
num = (num + int(c) * d) % 13
else:
q_list.append(d)
d *= 10
counts = [0] * 13
counts[0] = 1
for d in q_list:
new_counts = [0] * 13
for n in range(10):
r = (d *... | M = 10 ** 9 + 7
s = input().strip()
num = 0
q_list = []
d = 1
l = len(s)
for i in range(l - 1, -1, -1):
c = s[i]
if c != "?":
num = (num + int(c) * d) % 13
else:
q_list.append(d)
d = (d * 10) % 13
counts = [0] * 13
counts[0] = 1
for d in q_list:
new_counts = [0] * 13
for n in range(10):
... | p02960 |
def slove():
import sys
input = sys.stdin.readline
s = [int(v) if v != "?" else -1 for v in list(str(input().rstrip('\n')))]
dp = [[0] * 13 for _ in range(2)]
mod = 10 ** 9 + 7
for i in range(1):
if s[-i-1] == -1:
for j in range(10):
dp[0][j % 13] +... | def slove():
import sys
input = sys.stdin.readline
s = [int(v) if v != "?" else -1 for v in list(str(input().rstrip('\n')))]
dp = [[0] * 13 for _ in range(2)]
mod = 10 ** 9 + 7
for i in range(1):
if s[-i-1] == -1:
for j in range(10):
dp[0][j % 13] +... | p02960 |
def slove():
import sys
input = sys.stdin.readline
s = str(input().rstrip('\n'))
is_first = True
ls = [[0] * 13 for _ in range(len(s))]
mod = 10 ** 9 + 7
for i in range(len(s)):
if is_first:
is_first = False
if s[-i-1] == "?":
for j ... | def slove():
import sys
input = sys.stdin.readline
s = str(input().rstrip('\n'))
is_first = True
ls = [[0] * 13 for _ in range(len(s))]
mod = 10 ** 9 + 7
for i in range(len(s)):
if is_first:
is_first = False
if s[-i-1] == "?":
for j ... | p02960 |
def slove():
import sys
input = sys.stdin.readline
s = str(input().rstrip('\n'))
is_first = True
ls = [[0] * 13 for _ in range(len(s))]
mod = 10 ** 9 + 7
for i in range(len(s)):
if is_first:
is_first = False
if s[-i-1] == "?":
for j ... | import sys
def solve():
input = sys.stdin.readline
mod = 10 ** 9 + 7
s = str(input().rstrip('\n'))
ls = [[0] * 13 for _ in range(len(s))]
for i in range(len(s)):
if i == 0:
if s[-i-1] == "?":
for j in range(10):
ls[i][j] += 1
... | p02960 |
import sys
def solve():
readline = sys.stdin.buffer.readline
mod = 10 ** 9 + 7
s = str(readline().rstrip().decode('utf-8'))
dp = [[0] * 13 for _ in range(len(s))]
for i in range(len(s)):
ts = s[-i-1]
if i == 0:
if ts == "?":
for j in range(10... | import sys
def solve():
readline = sys.stdin.buffer.readline
mod = 10 ** 9 + 7
s = str(readline().rstrip().decode('utf-8'))
dp = [[0] * 13 for _ in range(len(s))]
for i in range(len(s)):
if i == 0:
if s[-i-1] == "?":
for j in range(10):
... | p02960 |
s=input()[::-1]
mod=10**9+7
if s[0]=='?':
dp=[[1]*10]
for _ in range(3):
dp[0].append(0)
else:
dp=[[0]*13]
dp[0][int(s[0])]=1
dp.append([0]*13)
now=1
for i in range(1,len(s)):
now=now*10
x=s[i]
if x!='?':
x=(now*int(x))%13
for j in range(13):
dp[i%2][(j+x)%13]=dp[i%2-1][... | s=input()[::-1]
mod=10**9+7
dp=[[0]*13 for i in range(len(s))]
if s[0]=='?':
for i in range(10):
dp[0][i]=1
else:
dp[0][int(s[0])]=1
now=1
for i in range(1,len(s)):
now=(now*10)%13
x=s[i]
if x!='?':
x=now*int(x)
for j in range(13):
dp[i][(j+x)%13]=dp[i-1][j]
else:
for ... | p02960 |
def inpl(): return list(map(int, input().split()))
MOD = 10**9 + 7
S = input()[::-1]
x = 1
DP = [0]*13
DP[0] = 1
for i in range(len(S)):
DP2 = [0]*13
if S[i] != "?":
s = int(S[i])
for i in range(13):
DP2[(i + s*x)%13] = DP[i]%MOD
else:
for j in range(10):... | def inpl(): return list(map(int, input().split()))
MOD = 10**9 + 7
S = input()[::-1]
x = 1
DP = [0]*13
DP[0] = 1
for i in range(len(S)):
DP2 = [0]*13
if S[i] != "?":
s = int(S[i])
for i in range(13):
DP2[(i + s*x)%13] = DP[i]%MOD
else:
for j in range(10):... | p02960 |
S = input().strip()
mod = 10**9 + 7
d = {i:i*10%13 for i in range(13)}
dp = [[0]*13 for _ in range(len(S)+1)]
dp[0][0] = 1
for i, c in enumerate(S, 1):
if c != '?':
c = int(c)
for j in range(13):
dp[i][(d[j] + c) % 13] = dp[i-1][j] % mod
else:
for c in range(10):
... | S = input().strip()
mod = 10**9 + 7
d = [i*10%13 for i in range(13)]
dp = [[0]*13 for _ in range(len(S)+1)]
dp[0][0] = 1
for i, c in enumerate(S, 1):
if c != '?':
c = int(c)
for j in range(13):
dp[i][(d[j] + c) % 13] = dp[i-1][j]
else:
for c in range(10):
... | p02960 |
import sys
if sys.platform =='ios':
sys.stdin=open('Untitled.txt')
input = sys.stdin.readline
def INT(): return int(eval(input()))
def MAP(): return [int(s) for s in input().split()]
S = input().rstrip()
dp = [[0] * 13 for _ in range(len(S)+1)]
dp[0][0] = 1
#print(dp)
for i in range(len(S)):
for ... | import sys
if sys.platform =='ios':
sys.stdin=open('Untitled.txt')
input = sys.stdin.readline
def INT(): return int(eval(input()))
def MAP(): return [int(s) for s in input().split()]
S = input().rstrip()
dp = [[0] * 13 for _ in range(len(S)+1)]
dp[0][0] = 1
#print(dp)
for i in range(len(S)):
for ... | p02960 |
def main():
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
#from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby
#from itertools import product
from bisect import bisec... | def main():
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
#from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby
#from itertools import product
from bisect import bisec... | p02960 |
import sys
S = sys.stdin.readline()[:-1]
l = len(S)
# S = S[::-1]
S = list(reversed(S))
dp =[[0 ] * 13 for _ in range(l + 1)]
kurai = 1
MOD = (10 ** 9) + 7
dp[0][0] = 1
for keta in range(len(S)):
c =S[keta]
if c == "?":
for j in range(0,10):
kurai %= 13
t... |
import sys
S = sys.stdin.readline()[:-1]
l = len(S)
# S = S[::-1]
S = list(reversed(S))
dp =[[0 ] * 13 for _ in range(l + 1)]
kurai = 1
MOD = (10 ** 9) + 7
dp[0][0] = 1
for keta in range(len(S)):
c =S[keta]
if c == "?":
for j in range(0,10):
kurai %= 13
t... | p02960 |
import sys
input = sys.stdin.readline
P = 10 ** 9 + 7
Q = 13
def main():
S = input().rstrip()
N = len(S)
dp = [[0] * Q for _ in range(N + 1)]
dp[0][0] = 1
for i in range(N):
base = pow(10, N - 1 - i, Q)
D = S[i]
if D == "?":
for d in range(1... | import sys
input = sys.stdin.readline
P = 10 ** 9 + 7
Q = 13
def main():
S = input().rstrip()
N = len(S)
dp = [[0] * Q for _ in range(N + 1)]
dp[0][0] = 1
for i in range(N):
D = S[i]
if D == "?":
for d in range(10):
for j in range(Q)... | p02960 |
import sys
readline = sys.stdin.readline
conv = {}
for i in range(13):
conv[i] = (i * 10) % 13
S = readline().rstrip()
N = len(S)
DIV = 10 ** 9 + 7
dp = [[0] * 13 for i in range(N)]
x0 = S[0]
if x0 == "?":
for i in range(10):
dp[0][i] = 1
else:
dp[0][int(x0)] = 1
for i in range(1, N... | import sys
readline = sys.stdin.readline
S = readline().rstrip()
N = len(S)
DIV = 10 ** 9 + 7
dp = [[0] * 13 for i in range(N)]
x0 = S[0]
if x0 == "?":
for i in range(10):
dp[0][i] = 1
else:
dp[0][int(x0)] = 1
for i in range(1, N):
x = S[i]
if x == "?":
for j in range(13):
... | p02960 |
# -*- coding: utf-8 -*-
import sys
import math
from bisect import bisect_left
from bisect import bisect_right
import collections
import copy
import heapq
from collections import defaultdict
from heapq import heappop, heappush
import itertools
input = sys.stdin.readline
from collections import defaultdict
f... | # -*- coding: utf-8 -*-
import sys
import math
from bisect import bisect_left
from bisect import bisect_right
import collections
import copy
import heapq
from collections import defaultdict
from heapq import heappop, heappush
import itertools
input = sys.stdin.readline
from collections import defaultdict
f... | p02960 |
import sys
readline = sys.stdin.readline
MOD = 10 ** 9 + 7
def main():
S = readline().rstrip()
N = 13
dp = [0] * 13 # dp[k]: 13で割った余りがkのパターン数
dp[0] = 1
mul = 1
for i in range(len(S)-1, -1, -1):
next_dp = [0] * N
s = S[i]
if s == '?':
for ... | import sys
readline = sys.stdin.readline
MOD = 10 ** 9 + 7
def main():
S = readline().rstrip()
N = 13
dp = [0] * 13 # dp[k]: 13で割った余りがkのパターン数
dp[0] = 1
mul = 1
for s in S[::-1]:
next_dp = [0] * N
if s == '?':
for k in range(10):
f... | p02960 |
import sys,heapq,math,resource
from collections import deque,defaultdict
printn = lambda x: sys.stdout.write(x)
inn = lambda : int(eval(input()))
inl = lambda: list(map(int, input().split()))
inm = lambda: list(map(int, input().split()))
DBG = True # and False
R = 10**9 + 7
def ddprint(x):
if DBG:... | #printn = lambda x: sys.stdout.write(x)
inn = lambda : int(eval(input()))
inl = lambda: list(map(int, input().split()))
inm = lambda: list(map(int, input().split()))
DBG = True # and False
R = 10**9 + 7
def ddprint(x):
if DBG:
print(x)
rem = [1,10,9,12,3,4]
s = input().strip()
sr = s[::-... | p02960 |
s = list(input().rstrip())
n = len(s)
dp = [[0] * 13 for _ in range(n + 1)]
dp[0][0] = 1
for i in range(n):
c = -1 if s[i] == '?' else int(s[i])
for j in range(10):
if c != -1 and c != j:
continue
for ki in range(13):
dp[i + 1][(ki * 10 + j) % 13] += dp[i][ki]... | s = list(input().rstrip())
n = len(s)
dp = [[0] * 13 for _ in range(n + 1)]
dp[0][0] = 1
for i in range(n):
c = -1 if s[i] == '?' else int(s[i])
for j in range(10):
if c != -1 and c != j:
continue
for ki in range(13):
dp[i + 1][(ki * 10 + j) % 13] += dp[i][ki]... | p02960 |
from sys import exit, stderr, stdin
input = stdin.readline
# setrecursionlimit(10**7)
# def debug(var, name="hoge"):
# print(name +":" + str(type(var)) + " = " + repr(var), file=stderr)
# return
def main():
MOD = 10**9 + 7
S = list(input()[:-1])
L = len(S)
modsum = 0
# 余り
... | from sys import exit, stderr, stdin
input = stdin.readline
def main():
MOD = 10**9 + 7
S = input()[:-1]
L = len(S)
# 余り
memo = [0 for _ in range(13)]
memo[0] = 1
for i in range(L):
memo_prev = [x for x in memo]
memo = [0 for _ in range(13)]
# 数字なら以前ま... | p02960 |
mod=10**9+7
s=input()[::-1]
l=len(s)
dp=[[0]*13 for i in range(l+1)]
dp[0][0]=1
for i in range(l):
s_sub=s[i]
if s_sub=="?":
for j in range(13):
for k in range(10):
dp[i+1][(j+k*(10**i))%13]+=dp[i][j]
dp[i+1][(j+k*(10**i))%13]%=mod
else:
... | mod=10**9+7
s=input()[::-1]
l=len(s)
dp=[[0]*13 for i in range(l+1)]
dp[0][0]=1
#累乗が大きすぎるので前計算
p=[0]*l
p[0]=1
for i in range(l-1):
p[i+1]=(p[i]*10)%13
for i in range(l):
s_sub=s[i]
if s_sub=="?":
for j in range(13):
for k in range(10):
dp[i+1][(j+k*p[i])%13... | p02960 |
n=int(eval(input()));a,b,c,p=1,1,n,n-1
for i in range(n-1):
p+=a-1;a,b,c=b,c,((n-1)**2+p+c)%(10**9+7)
print(c) | n=int(eval(input()))-1;a,b,c,p=1,1,n+1,n
for _ in[0]*n:p+=a-1;a,b,c=b,c,(n*n+p+c)%(10**9+7)
print(c) | p03766 |
for _ in range(int(eval(input()))):
p,q=list(map(int,input().split()))
c=0
for i in range(143):
for j in range(143):
if (i>0 or j>0)and(j*p+i*q)%(j*j+i*i)==0 and (j*q-i*p)%(j*j+i*i)==0:c+=1
print(('P' if c<5 else 'C')) | for _ in range(int(eval(input()))):
p,q=list(map(int,input().split()))
c=0
for i in range(142):
for j in range(142):
if (i>0 or j>0)and(j*p+i*q)%(j*j+i*i)==0 and (j*q-i*p)%(j*j+i*i)==0:c+=1
print(('P' if c<5 else 'C')) | p00904 |
import sys
import itertools
# import numpy as np
import time
import math
sys.setrecursionlimit(10 ** 7)
from collections import defaultdict
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
from functools import reduce
# from math import *... | import sys
import itertools
# import numpy as np
import time
import math
sys.setrecursionlimit(10 ** 7)
from collections import defaultdict
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
from functools import reduce
# from math import *... | p02803 |
import sys
import itertools
# import numpy as np
import time
import math
sys.setrecursionlimit(10 ** 7)
from collections import defaultdict
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
from functools import reduce
# from math import *... | import sys
import itertools
# import numpy as np
import time
import math
sys.setrecursionlimit(10 ** 7)
from collections import defaultdict
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
from functools import reduce
# from math import *... | p02803 |
from itertools import product
def solve(string):
h, w, *s = string.split()
h, w = list(map(int, [h, w]))
s = ["#" * (w + 2)] + ["#" + _s + "#" for _s in s] + ["#" * (w + 2)]
ans = 0
d = [(1, 0), (-1, 0), (0, 1), (0, -1)]
for _h, _w in product(list(range(1, h + 1)), list(range(1, w + 1... | from itertools import product
def solve(string):
h, w, *s = string.split()
h, w = list(map(int, [h, w]))
s = ["#" * (w + 2)] + ["#" + _s + "#" for _s in s] + ["#" * (w + 2)]
ans = 0
d = [(1, 0), (-1, 0), (0, 1), (0, -1)]
for _h, _w in product(list(range(1, h + 1)), list(range(1, w + 1... | p02803 |
# D - Maze Master
from collections import deque, defaultdict
INF = 1 << 30
MOD = 10 ** 9 + 7
dxy = [(-1, 0), (0, -1), (0, 1), (1, 0)]
def bfs(sx: int, sy: int):
queue = deque([(sx, sy)])
dist = defaultdict(lambda: INF)
dist[sx * MOD + sy] = 0
while queue:
x, y = queue.popleft()
... | # D - Maze Master
from collections import deque, defaultdict
INF = 1 << 30
MOD = 10 ** 9 + 7
dxy = [(-1, 0), (0, -1), (0, 1), (1, 0)]
def bfs(sx: int, sy: int):
queue = deque([(sx, sy)])
dist = defaultdict(lambda: INF)
dist[sx * MOD + sy] = 0
while queue:
x, y = queue.popleft()
... | p02803 |
# D - Maze Master
from collections import deque
MOD = 10 ** 9 + 7
dxy = [(-1, 0), (0, -1), (0, 1), (1, 0)]
def bfs(sx: int, sy: int):
queue = deque([(sx, sy)])
dist = {sx * MOD + sy: 0}
while queue:
x, y = queue.popleft()
for dx, dy in dxy:
nx, ny = x + dx, y + dy... | # D - Maze Master
from collections import deque
def bfs(start: int):
queue = deque([start])
dist = {start: 0}
while queue:
x = queue.popleft()
for nx in (x + 1, x - 1, x + W, x - W):
if maze[nx] and nx not in dist:
dist[nx] = dist[x] + 1
... | p02803 |
# D - Maze Master
from collections import deque
def bfs(start: int):
queue = deque([start])
dist = {start: 0}
while queue:
x = queue.popleft()
for nx in (x + 1, x - 1, x + W, x - W):
if maze[nx] == "." and nx not in dist:
dist[nx] = dist[x] + 1
... | # D - Maze Master
from collections import deque
def bfs(start: int):
queue = deque([start])
dist = [0] * (H * W)
dist[start] = 1
while queue:
x = queue.popleft()
for nx in (x + 1, x - 1, x + W, x - W):
if maze[nx] == "." and not dist[nx]:
dist[nx... | p02803 |
import sys
input = sys.stdin.readline
from collections import deque
def main():
H, W = [int(x) for x in input().split()]
A = [["" for i in range(W)] for j in range(H)]
for j in range(H):
S = input().strip()
for i, s in enumerate(list(S)):
A[j][i] = s
ma = ... | import sys
input = sys.stdin.readline
from collections import deque
def main():
H, W = [int(x) for x in input().split()]
A = [["" for i in range(W)] for j in range(H)]
for j in range(H):
S = input().strip()
for i, s in enumerate(list(S)):
A[j][i] = s
ma = 0
... | p02803 |
import sys
input = sys.stdin.readline
from collections import deque
H, W = list(map(int, input().split()))
S = [list(input().split()[0]) for _ in range(H)]
def bfs(S, H, W, start, goal):
INF = 100000000
stack=deque([start])
distance = [[INF]*W for _ in range(H)]
distance[start[1]][start[0]]... | import sys
input = sys.stdin.readline
from collections import deque
H, W = list(map(int, input().split()))
S = [list(input().split()[0]) for _ in range(H)]
def bfs(S, H, W, start):
INF = -1
stack=deque([start])
distance = [[INF]*W for _ in range(H)]
distance[start[1]][start[0]] = 0
whi... | p02803 |
from collections import deque
from copy import deepcopy
# 初期入力
import sys
input = sys.stdin.readline
H,W = (int(i) for i in input().split())
map_initial =[["#"]*(W+2) for i in range(H+2)] #周囲を壁にするため＋２
for h in range(1,H+1):
map_initial[h] =["#"] +list(input().strip()) +["#"]
def BSF(x,y):
dist =0
... | from collections import deque
from copy import deepcopy
# 初期入力
import sys
input = sys.stdin.readline
H,W = (int(i) for i in input().split())
map_initial =[["#"]*(W+2) for i in range(H+2)] #周囲を壁にするため＋２
for h in range(1,H+1):
map_initial[h] =["#"] +list(input().strip()) +["#"]
def BSF(x,y):
dist =0
... | p02803 |
import queue
import sys
input = sys.stdin.readline
class Solution:
def main(self):
H, W = list(map(int, input().split()))
S = [list(input().rstrip()) for _ in range(H)]
for i in range(H):
S[i] = ["#"] + S[i] + ["#"]
S = [["#"] * (W + 2)] + S + [["#"] * (W... | import queue
import sys
input = sys.stdin.readline
class Solution:
def main(self):
H, W = list(map(int, input().split()))
S = [list(input().rstrip()) for _ in range(H)]
for i in range(H):
S[i] = ["#"] + S[i] + ["#"]
S = [["#"] * (W + 2)] + S + [["#"] * (W... | p02803 |
import sys
from collections import deque
input = sys.stdin.readline
H,W=list(map(int,input().rstrip().split()))
maze=[list(input().rstrip()) for i in range(H)]
def resolve():
seen=[[0 for i in range(W)] for j in range(H)]
ans=0
for i in range(H):
for j in range(W):
for k in r... | import sys
from collections import deque
input = sys.stdin.readline
H,W=list(map(int,input().rstrip().split()))
maze=[list(input().rstrip()) for i in range(H)]
def resolve():
seen=[[0 for i in range(W)] for j in range(H)]
ans=0
for i in range(H):
for j in range(W):
if maze[i]... | p02803 |
import sys
read = sys.stdin.readline
def read_ints():
return list(map(int, read().split()))
def read_a_int():
return int(read())
def read_matrix(H):
'''
H is number of rows
'''
return [list(map(int, read().split())) for _ in range(H)]
def read_map(H):
'''
H i... | import sys
read = sys.stdin.readline
def read_ints():
return list(map(int, read().split()))
def read_a_int():
return int(read())
def read_matrix(H):
'''
H is number of rows
'''
return [list(map(int, read().split())) for _ in range(H)]
def read_map(H):
'''
H i... | p02803 |
import sys
from queue import Queue
def print_costs(costs):
for c in costs:
print(c)
def solve(inp):
(H, W) = list(map(int, inp.readline().strip().split(' ')))
S = [list(inp.readline().strip()) for i in range(H)]
max_cost = 0
for start_y in range(H):
for start_x in... | import sys
from queue import Queue
def print_costs(costs):
for c in costs:
print(c)
def solve(inp):
(H, W) = list(map(int, inp.readline().strip().split(' ')))
S = [list(inp.readline().strip()) for i in range(H)]
max_cost = 0
for start_y in range(H):
for start_x in... | p02803 |
import queue
import copy
def main():
H, W = list(map(int, input().split()))
S = []
for i in range(H):
S.append(list(input()))
def bfs(start, S2):
q = queue.Queue()
q.put(start)
candidates = [[0, 1], [1, 0], [0, -1], [-1, 0]]
dist = [[0]*W for _ ... | import queue
import copy
def main():
H, W = list(map(int, input().split()))
S = []
for i in range(H):
S.append(list(input()))
def bfs(start, S2):
q = queue.Queue()
q.put(start)
candidates = [[0, 1], [1, 0], [0, -1], [-1, 0]]
dist = [[0]*W for _ ... | p02803 |
import sys
import itertools
import collections
def search(H, W, S, start, end):
wall_i = ord(b'#')
used = [[-1 for h in range(W)] for w in range(H)]
qu = collections.deque()
qu.append(start)
used[start[0]][start[1]] = 0
while qu:
h, w = qu.popleft()
cost = used... | import sys
import itertools
import collections
def search(H, W, S, start):
wall_i = ord(b'#')
used = [[-1 for h in range(W)] for w in range(H)]
qu = collections.deque()
qu.append(start)
used[start[0]][start[1]] = 0
while qu:
h, w = qu.popleft()
cost = used[h][w... | p02803 |
from sys import stdin
import queue
H, W = [int(x) for x in stdin.readline().rstrip().split()]
maze = [stdin.readline().rstrip().split()[0] for _ in range(H)]
ans = 0
for h in range(H):
for w in range(W):
if maze[h][w] == '#':
continue
else:
q = queue.Queue()
... | from sys import stdin
import queue
H, W = [int(x) for x in stdin.readline().rstrip().split()]
maze = [stdin.readline().rstrip().split()[0] for _ in range(H)]
ans = 0
for h in range(H):
for w in range(W):
if maze[h][w] == '#':
continue
else:
q = queue.Queue()
... | p02803 |
from sys import stdin
import queue
H, W = [int(x) for x in stdin.readline().rstrip().split()]
maze = [stdin.readline().rstrip().split()[0] for _ in range(H)]
ans = 0
for h in range(H):
for w in range(W):
if maze[h][w] == '#':
continue
else:
q = queue.Queue()
... | from sys import stdin
import queue
H, W = [int(x) for x in stdin.readline().rstrip().split()]
maze = [stdin.readline().rstrip().split()[0] for _ in range(H)]
ans = 0
for h in range(H):
for w in range(W):
if maze[h][w] == '#':
continue
else:
q = queue.Queue()
... | p02803 |
from sys import stdin
import queue
H, W = [int(x) for x in stdin.readline().rstrip().split()]
maze = [stdin.readline().rstrip().split()[0] for _ in range(H)]
ans = 0
for h in range(H):
for w in range(W):
if maze[h][w] == '#':
continue
else:
q = queue.Queue()
... | from sys import stdin
import queue
H, W = [int(x) for x in stdin.readline().rstrip().split()]
maze = [stdin.readline().rstrip().split()[0] for _ in range(H)]
ans = 0
for h in range(H):
for w in range(W):
if maze[h][w] == '#':
continue
else:
q = queue.Queue()
... | p02803 |
from queue import Queue
h, w = list(map(int, input().split()))
s = []
for i in range(h):
s.append(input().strip())
ans = 0
for i in range(h):
for j in range(w):
start = s[i][j]
if start == "#":
continue
else:
visited = [[False for k in range(w)] fo... | from queue import Queue
h, w = list(map(int, input().split()))
s = []
for i in range(h):
s.append(input().strip())
ans = 0
for i in range(h):
for j in range(w):
start = s[i][j]
if start == "#":
continue
else:
visited = [[False for _ in range(w)] fo... | p02803 |
import sys
stdin = sys.stdin
inf = 1 << 60
mod = 1000000007
ni = lambda: int(ns())
nin = lambda y: [ni() for _ in range(y)]
na = lambda: list(map(int, stdin.readline().split()))
nan = lambda y: [na() for _ in range(y)]
nf = lambda: float(ns())
nfn = lambda y: [nf() for _ in range... | import sys
stdin = sys.stdin
inf = 1 << 60
mod = 1000000007
ni = lambda: int(ns())
nin = lambda y: [ni() for _ in range(y)]
na = lambda: list(map(int, stdin.readline().split()))
nan = lambda y: [na() for _ in range(y)]
nf = lambda: float(ns())
nfn = lambda y: [nf() for _ in range... | p02803 |
h, w = list(map(int, input().split()))
maze = [list(input()) for i in range(h)]
INF = 10 ** 10
my = [-1, 0, 1, 0]
mx = [0, -1, 0, 1]
def bfs(sy, sx, ey, ex):
q = [(sy, sx)]
dp = [ [INF for j in range(w)] for i in range(h) ]
dp[sy][sx] = 0
while q:
(y, x) = q.pop(0)
if (y, x)... | h, w = list(map(int, input().split()))
maze = [list(input()) for i in range(h)]
INF = 10 ** 10
my = [-1, 0, 1, 0]
mx = [0, -1, 0, 1]
def bfs(sy, sx):
q = [(sy, sx)]
dp = [ [INF for j in range(w)] for i in range(h) ]
dp[sy][sx] = 0
while q:
(y, x) = q.pop(0)
for (dy, dx) in z... | p02803 |
h,w=list(map(int,input().split()))
s = [[0]*w for _ in range(h)]
for i in range(h):
s[i] = list(*input().split())
def cango(now,h,w):
ans = []
if now[0]>0:
ans.append( (now[0]-1,now[1]) )
if now[0]<h-1:
ans.append( (now[0]+1,now[1]) )
if now[1]>0:
ans.append( (no... | h,w=list(map(int,input().split()))
s = [[0]*w for _ in range(h)]
for i in range(h):
s[i] = list(*input().split())
def cango(now,h,w):
ans = []
if now[0]>0:
ans.append( (now[0]-1,now[1]) )
if now[0]<h-1:
ans.append( (now[0]+1,now[1]) )
if now[1]>0:
ans.append( (no... | p02803 |
# -*- coding: utf-8 -*-
import sys
from collections import deque
from collections import defaultdict
H,W=list(map(int, sys.stdin.readline().split()))
S=[ sys.stdin.readline().strip() for _ in range(H) ]
D=[(1,0),(-1,0),(0,1),(0,-1)]
def bfs(start):
Visit={}
q=deque()
q.append(start)
... | # -*- coding: utf-8 -*-
import sys
from collections import deque
from collections import defaultdict
H,W=list(map(int, sys.stdin.readline().split()))
S=[ sys.stdin.readline().strip() for _ in range(H) ]
D=[(1,0),(-1,0),(0,1),(0,-1)]
def bfs(start):
Visit={}
q=deque()
q.append(start)
... | p02803 |
# -*- coding: utf-8 -*-
import sys
from collections import deque
from collections import defaultdict
H,W=list(map(int, sys.stdin.readline().split()))
S=[ sys.stdin.readline().strip() for _ in range(H) ]
D=[(1,0),(-1,0),(0,1),(0,-1)]
def bfs(start):
Visit={}
q=deque()
q.append(start)
... | # -*- coding: utf-8 -*-
import sys
from collections import deque
from collections import defaultdict
H,W=list(map(int, sys.stdin.readline().split()))
S=[ sys.stdin.readline().strip() for _ in range(H) ]
D=[(1,0),(-1,0),(0,1),(0,-1)]
def bfs(start):
Visit={}
q=deque()
q.append(start)
Vis... | p02803 |
from collections import deque
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
def bfs(field, sx, sy, gx, gy, seen):
queue = deque([(sx, sy)])
seen[sx][sy] += 1
while queue:
x, y = queue.popleft()
if (x, y) == (gx, gy):
... | from collections import deque
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
def bfs(field, sx, sy, seen):
queue = deque([(sx, sy)])
seen[sx][sy] += 1
while queue:
x, y = queue.popleft()
for dx, dy in [(-1, 0), (0, 1), (1, 0... | p02803 |
from collections import deque
H,W = list(map(int,input().split()))
S = [input().strip() for _ in range(H)]
cmax = 0
for i in range(H):
for j in range(W):
for k in range(H):
for l in range(W):
if (i,j)!=(k,l) and S[i][j]=="." and S[k][l]==".":
... | import heapq
INFTY = 10**3
H,W = list(map(int,input().split()))
S = [input().strip() for _ in range(H)]
dist = {(i,j):{(k,l):INFTY for k in range(H) for l in range(W)} for j in range(W) for i in range(H)}
for i in range(H):
for j in range(W):
if S[i][j]==".":
hist = {(k,l):0 for k in ran... | p02803 |
from collections import deque
h,w = list(map(int, input().split()))
grid = []
for i in range(h):
s = list(input().rstrip())
grid.append(s)
dxdy = [[0, 1], [1,0], [-1, 0], [0, -1]]
visited = [[0]*w for _ in range(h)]
dist = [[0]*w for _ in range(h)]
for i in range(h):
for j in range(w):
if... | from collections import deque
h,w = list(map(int, input().split()))
grid = []
for i in range(h):
s = list(input().rstrip())
grid.append(s)
dydx = [[0, 1], [1,0], [-1, 0], [0, -1]]
def find_longest_path(xy):
visited = [[0]*w for _ in range(h)]
dist = [[0]*w for _ in range(h)]
visited[xy... | p02803 |
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)
from copy import deepcopy
h, w = list(map(int, readline().split()))
s = [readline().rstrip().decode() for _ in range(h)]
move = [(0, 1), (0, -1), (1, 0), (-1, 0)... | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)
from copy import deepcopy
h, w = list(map(int, readline().split()))
s = [readline().rstrip().decode() for _ in range(h)]
move = [(0, 1), (0, -1), (1, 0), (-1, 0)... | p02803 |
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
from collections import deque
INF = 100000
dir = ((1, 0), (-1, 0), (0, 1), (0, -1))
def main():
H, W = list(map(int, readline().split()))
maze = []
for _ in range(H):
s = ... | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
from collections import deque
dir = ((-1, 0), (1, 0), (0, -1), (0, 1))
def main():
h, w = list(map(int, readline().split()))
grid = []
for _ in range(h):
grid.append(readl... | p02803 |
import sys
from collections import defaultdict, deque, Counter
import math
# import copy
from bisect import bisect_left, bisect_right
import heapq
sys.setrecursionlimit(1000000)
# input aliases
input = sys.stdin.readline
getS = lambda: input().strip()
getN = lambda: int(eval(input()))
getList = lambd... | import sys
from collections import defaultdict, deque, Counter
import math
# import copy
from bisect import bisect_left, bisect_right
import heapq
sys.setrecursionlimit(1000000)
# input aliases
input = sys.stdin.readline
getS = lambda: input().strip()
getN = lambda: int(eval(input()))
getList = lambd... | p02803 |
import copy
from collections import deque
H, W = list(map(int, input().split()))
field_s = []
# フィールドを作る
for h in range(H + 2):
field_s.append(["#"] * (W + 2))
if 1 <= h <= (H):
field_s[h][1:-1] = list(map(str, input().rstrip()))
# 動き方のセットを準備
moves = [[1, 0], [-1, 0], [0, 1], [0, -1]]... | import copy
from collections import deque
H, W = list(map(int, input().split()))
field_s = []
# フィールドを作る
for h in range(H + 2):
field_s.append(["#"] * (W + 2))
if 1 <= h <= (H):
field_s[h][1:-1] = list(map(str, input().rstrip()))
# 動き方のセットを準備
moves = [[1, 0], [-1, 0], [0, 1], [0, -1]]
... | p02803 |
import copy
from collections import deque
H, W = list(map(int, input().split()))
field_s = []
# フィールドを作る
for h in range(H + 2):
field_s.append(["#"] * (W + 2))
if 1 <= h <= (H):
field_s[h][1:-1] = list(map(str, input().rstrip()))
# 動き方のセットを準備
moves = [[1, 0], [-1, 0], [0, 1], [0, -1]]
... | import copy
from collections import deque
def bfs(s, f):
f[s[0]][s[1]] = 0
moves = [[1, 0], [-1, 0], [0, 1], [0, -1]]
q = deque([s])
while q:
c = q.popleft()
for m in moves:
my, mx = c[0] + m[0], c[1] + m[1]
if f[my][mx] == ".":
... | p02803 |
import copy
from collections import deque
def bfs(s, f):
f[s[0]][s[1]] = 0
moves = [[1, 0], [-1, 0], [0, 1], [0, -1]]
q = deque([s])
while q:
c = q.popleft()
for m in moves:
my, mx = c[0] + m[0], c[1] + m[1]
if f[my][mx] == ".":
... | import copy
from collections import deque
def bfs(s, f):
f[s[0]][s[1]] = 0
moves = [[1, 0], [-1, 0], [0, 1], [0, -1]]
q = deque([s])
while q:
c = q.popleft()
for m in moves:
my, mx = c[0] + m[0], c[1] + m[1]
if f[my][mx] == ".":
... | p02803 |
import copy
from collections import deque
def bfs(s, f):
f[s[0]][s[1]] = 0
moves = [[1, 0], [-1, 0], [0, 1], [0, -1]]
q = deque([s])
while q:
c = q.popleft()
for m in moves:
my, mx = c[0] + m[0], c[1] + m[1]
if f[my][mx] == ".":
... | import copy
from collections import deque
def bfs(s, f):
f[s[0]][s[1]] = 0
moves = [[1, 0], [-1, 0], [0, 1], [0, -1]]
q = deque([s])
while q:
c = q.popleft()
for m in moves:
my, mx = c[0] + m[0], c[1] + m[1]
if f[my][mx] == ".":
... | p02803 |
import sys
# import re
# import math
# import collections
# import decimal
# import bisect
# import itertools
# import fractions
# import functools
# import copy
# import heapq
# import decimal
# import statistics
import queue
sys.setrecursionlimit(10000001)
INF = 10 ** 10
MOD = 10 ** 9 + 7
ni = ... | import sys
# import re
# import math
# import collections
# import decimal
# import bisect
# import itertools
# import fractions
# import functools
# import copy
# import heapq
# import decimal
# import statistics
import queue
sys.setrecursionlimit(10000001)
INF = 10 ** 10
MOD = 10 ** 9 + 7
ni = ... | p02803 |
# すべてのスタートを試し、最大値の最大値を取る
import sys
readline = sys.stdin.readline
H,W = list(map(int,readline().split()))
grid = [readline().rstrip() for i in range(H)]
ans = 0
cases = ((0,1),(0,-1),(1,0),(-1,0))
from collections import deque
for i in range(H):
for j in range(W):
q = deque([[i,j,0]])
visited... | import sys
readline = sys.stdin.readline
H,W = list(map(int,readline().split()))
S = [None] * H
for i in range(H):
S[i] = readline().rstrip()
ans = 0
from collections import deque
cases = ((1,0),(-1,0),(0,1),(0,-1))
for i in range(H):
for j in range(W):
q = deque([[i,j,0]])
seen = set()
... | p02803 |
import sys
from collections import deque
from itertools import product
read = sys.stdin.read
readline = sys.stdin.readline
H, W = list(map(int, readline().split()))
S = [list(readline()) for i in range(H)]
def bfs(grid, start):
distance = [[-1] * W for _ in range(H)]
queue = deque([start])
... | import sys
from collections import deque
read = sys.stdin.read
readline = sys.stdin.readline
H, W = list(map(int, readline().split()))
S = [list(readline()) for i in range(H)]
def bfs(grid, start):
distance = [[-1] * W for _ in range(H)]
queue = deque([start])
distance[start[0]][start[1]] =... | p02803 |
import sys
from collections import deque
read = sys.stdin.read
readline = sys.stdin.readline
H, W = list(map(int, readline().split()))
S = tuple(map(tuple, read().split()))
def bfs(grid, start):
distance = [[-1] * W for _ in range(H)]
queue = deque([start])
distance[start[0]][start[1]] = 0
... | import sys
from collections import deque
read = sys.stdin.readline
H, W = list(map(int, input().split()))
S = [list('#' * (W + 2))] + [['#'] + list(read().rstrip()) + ['#'] for _ in range(H)] + [list('#' * (W + 2))]
def bfs(grid, start):
distance = [[-1] * (W + 2) for _ in range(H + 2)]
queue = d... | p02803 |
from collections import deque
INF = -1
sizeI, sizeJ = list(map(int, input().split()))
a = [input().rstrip() for _ in range(sizeI)]
def bfs(startI, startJ, targetI, targetJ):
dist = [[INF for _ in range(sizeJ)] for _ in range(sizeI)]
dist[startI][startJ] = 0
q = deque([(startI, startJ)])
wh... | from collections import deque
INF = -1
sizeI, sizeJ = list(map(int, input().split()))
a = [input().rstrip() for _ in range(sizeI)]
def bfs(startI, startJ):
dist = [[INF for _ in range(sizeJ)] for _ in range(sizeI)]
dist[startI][startJ] = 0
q = deque([(startI, startJ)])
while q:
i,... | p02803 |
import sys
from sys import exit
from collections import deque
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... | import sys
from sys import exit
from collections import deque
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... | p02803 |
from collections import deque
INF = float("inf")
def MAIN():
n = int(eval(input()))
G = [[i, INF] for i in range(n)]
G[0][1] = 0
m = {}
for _ in range(n):
A = list(map(int, input().split()))
m[A[0]] = {}
for i in range(2, len(A), 2):
m[A[0]][A[i]] = A[i... | from heapq import heapify, heappush, heappop
INF = float("inf")
def MAIN():
n = int(eval(input()))
G = [[i, INF] for i in range(n)]
G[0][1] = 0
m = {}
for _ in range(n):
A = list(map(int, input().split()))
m[A[0]] = {}
for i in range(2, len(A), 2):
m[A[... | p02242 |
def dijkstra(s):
global d
color=[0]*n
d=[float('inf')]*n
d[s]=0
while True:
mincost=float('inf')
for i in range(n):
if color[i]!=2 and d[i]<mincost:
mincost=d[i]
u=i
if mincost==float('inf'):
break
c... | import heapq
def dijkstra(s,g,c):
d=[float('inf')]*n
d[s]=0
heapq.heappush(pq,[0,s])
while len(pq)!=0:
t,u=heapq.heappop(pq)
if d[u]<t:
continue
for v in g[u]:
if d[u]+c[u][v]<d[v]:
d[v]=d[u]+c[u][v]
heapq.heap... | p02242 |
import sys
global nodes
nodes = {}
def shortest_path(GRAPH):
global nodes
p1 = 0
nodes[p1][1] = 0;
edge={}
total = 0
mini = 0
while True:
nodes[p1][0]=True
for p2 in range(len(nodes)):
if nodes[p2][0]==False and (p1, p2) in GRAPH:
... | import sys
def shortest_path(GRAPH, distance):
nodes = set()
p1 = 0
distance[p1] = 0
while True:
dp1 = distance[p1]
gp1 = GRAPH[p1]
status[p1]=1
for p2 in list(gp1.keys()):
tmp = gp1[p2] + dp1
if status[p2]==0 and tmp < dis... | p02242 |
import sys
input = sys.stdin.readline
from collections import Counter
MAX = 2*10**6+100
MOD = 10**9+7
fact = [0]*MAX #fact[i]: i!
inv = [0]*MAX #inv[i]: iの逆元
finv = [0]*MAX #finv[i]: i!の逆元
fact[0] = 1
fact[1] = 1
finv[0] = 1
finv[1] = 1
inv[1] = 1
for i in range(2, MAX):
fact[i] = fact[i-1]*i%... | import sys
input = sys.stdin.readline
MAX = 2*10**6+100
MOD = 10**9+7
fact = [0]*MAX #fact[i]: i!
inv = [0]*MAX #inv[i]: iの逆元
finv = [0]*MAX #finv[i]: i!の逆元
fact[0] = 1
fact[1] = 1
finv[0] = 1
finv[1] = 1
inv[1] = 1
for i in range(2, MAX):
fact[i] = fact[i-1]*i%MOD
inv[i] = MOD-inv[MOD%i]*... | p02632 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.