input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
n=int(eval(input()))
p=[int(i) for i in input().split()]
a=[]
for i in range(n):
if p[i]==i+1:
a.append(i+1)
i=0
b=0
while(i<len(a)):
if a[i]+2 in a:
b+=2
i=a.index(a[i]+2)+1
else:
b+=1
if a[i]+1 in a:
i+=2
else:
i+=1
print(b)
| n=int(eval(input()))
p=[int(i) for i in input().split()]
a=0
b=0
for i in range(n):
if p[i]==i+1:
if a==0 or t==i:
a+=1
else:
b+=(a+1)//2
a=1
t=i+1
b+=(a+1)//2
print(b) | p03614 |
n=int(eval(input()))
a=list(map(int,input().split()))
f=[True if a[i]==i+1 else False for i in range(n)]
ans=0
for i in range(n-1):
if f[i] and f[i+1]:
f[i]=False
f[i+1]=False
ans+=1
ans+=sum(f)
print(ans) | n=int(eval(input()))
a=list(map(int,input().split()))
f=[True if a[i]==i+1 else False for i in range(n)]
ans=0
for i in range(n-1):
if f[i]:
f[i]=False
f[i+1]=False
ans+=1
if f[n-1]:
ans+=1
print(ans) | p03614 |
#!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
input:
3 5
0 0 1
0 1 2
0 2 3
1 0 2
1 1 2
output:
1
2
"""
import sys
from math import ceil, log2, isinf
class SegmentTree(object):
__slots__ = ('dat', 'tree_range')
def __init__(self):
"""
Init a SegmentTree with up... | #!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
input:
3 5
0 0 1
0 1 2
0 2 3
1 0 2
1 1 2
output:
1
2
"""
import sys
import math
class SegmentTree(object):
__slots__ = ('dat', 'tree_range')
def __init__(self, n):
"""
Init a SegmentTree with update and find for ra... | p02345 |
#!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
input:
3 5
0 0 1
0 1 2
0 2 3
1 0 2
1 1 2
output:
1
2
"""
import math
import sys
class SegmentTree(object):
__slots__ = ('dat', 'tree_range')
def __init__(self, n):
"""
Init a SegmentTree with update and find for ra... | #!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
input:
3 5
0 0 1
0 1 2
0 2 3
1 0 2
1 1 2
output:
1
2
"""
import math
import sys
INIT_MAX = pow(2, 31) - 1
class SegmentTree(object):
__slots__ = ('dat', 'tree_range')
def __init__(self, n):
"""
Init a SegmentTre... | p02345 |
#!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
input:
3 5
0 0 1
0 1 2
0 2 3
1 0 2
1 1 2
output:
1
2
"""
import math
import sys
INIT_MAX = pow(2, 31) - 1
class RMQ(object):
def __init__(self, in_data):
"""
Init a SegmentTree with update and find for range minimum qu... | #!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
input:
3 5
0 0 1
0 1 2
0 2 3
1 0 2
1 1 2
output:
1
2
"""
import math
import sys
INIT_MAX = pow(2, 31) - 1
class RMQ(object):
__slots__ = ('queries', 'ext_heap_length', 'dat')
def __init__(self, in_data):
"""
Ini... | p02345 |
n, q = list(map(int, input().split()))
A = [2147483647] * n
def update(i, x):
A[i] = x
def find(s, t):
print((min(A[s:t+1])))
for i in range(q):
com, x, y = list(map(int, input().split()))
if com == 0:
update(x, y)
else:
find(x, y) | n, q = list(map(int, input().split()))
# make a list whose length is 2^i - 1.
num = 1
max_v = 2147483647
while num < n:
num *= 2
A = [max_v for i in range(2 * num - 1)]
def update(i, x):
i += num - 1
A[i] = x
while i > 0:
i = (i - 1) // 2
A[i] = min(A[i * 2 + 1], ... | p02345 |
import math
class SegmentTree:
__slots__ = ["elem_size", "tree_size", "tree"]
def __init__(self, a: list, default: int):
real_size = len(a)
self.elem_size = 1 << math.ceil(math.log2(real_size))
self.tree_size = 2 * self.elem_size
self.tree = [default]*self.elem_size ... | import math
class SegmentTree:
__slots__ = ["elem_size", "tree_size", "tree"]
def __init__(self, a: list, default: int):
real_size = len(a)
self.elem_size = 1 << math.ceil(math.log2(real_size))
self.tree_size = 2 * self.elem_size
self.tree = [default]*self.elem_size ... | p02345 |
import math
class SegmentTree:
__slots__ = ["elem_size", "tree_size", "tree"]
def __init__(self, a: list, default: int):
real_size = len(a)
self.elem_size = 1 << math.ceil(math.log2(real_size))
self.tree_size = 2 * self.elem_size
self.tree = [default]*self.elem_size ... | import math
class SegmentTree:
__slots__ = ["elem_size", "tree_size", "tree", "default"]
def __init__(self, a: list, default: int):
real_size = len(a)
self.elem_size = 1 << math.ceil(math.log2(real_size))
self.tree_size = 2 * self.elem_size
self.tree = [default] * self.e... | p02345 |
import math
class SegmentTree:
__slots__ = ["elem_size", "tree_size", "tree", "default", "op"]
def __init__(self, a: list, default: int, op):
real_size = len(a)
self.elem_size = 1 << math.ceil(math.log2(real_size))
self.tree_size = 2 * self.elem_size
self.tree = [default... | import math
class SegmentTree:
__slots__ = ["elem_size", "tree_size", "tree", "default", "op"]
def __init__(self, a: list, default: int, op):
real_size = len(a)
self.elem_size = 1 << math.ceil(math.log2(real_size))
self.tree_size = 2 * self.elem_size
self.tree = [default... | p02345 |
import math
class SegmentTree:
__slots__ = ["elem_size", "tree_size", "tree", "default", "op"]
def __init__(self, a: list, default: int, op):
real_size = len(a)
self.elem_size = 1 << math.ceil(math.log2(real_size))
self.tree_size = 2 * self.elem_size
self.tree = [default... | import math
import sys
def make_tree(a: list, default: int, op):
real_size = len(a)
elem_size = 1 << math.ceil(math.log2(real_size))
tree = [default] * elem_size + a + [default] * (elem_size - real_size)
for i in range(elem_size-1, 0, -1):
left, right = tree[i << 1], tree[(i << 1) + 1... | p02345 |
import math
import sys
class SegmentTree(object):
__slots__ = ["elem_size", "tree_size", "tree", "default", "op"]
def __init__(self, a: list, default: int, op):
real_size = len(a)
self.elem_size = 1 << math.ceil(math.log2(real_size))
self.tree_size = 2 * self.elem_size
... | import math
import sys
class SegmentTree(object):
__slots__ = ["elem_size", "tree", "default"]
def __init__(self, a: list, default: int):
real_size = len(a)
self.elem_size = elem_size = 1 << math.ceil(math.log2(real_size))
self.tree = tree = [default] * (elem_size * 2)
... | p02345 |
# coding: utf-8
class SqrtDecomposition:
# RMQ用平方分割
# n:要素数 init:配列初期値
def __init__(self,n,init=0):
self.data=[init for i in range(n)]
#self.sqrt_n=int(n**0.5)+1
self.sqrt_n=512
self.bucket=[init for i in range(self.sqrt_n)]
# x を y にする
def updat... | # coding: utf-8
import sys
input=lambda : sys.stdin.readline().rstrip()
class SqrtDecomposition:
# RMQ用平方分割
# n:要素数 init:配列初期値
def __init__(self,n,init=0):
self.data=[init for i in range(n)]
#self.sqrt_n=int(n**0.5)+1
self.sqrt_n=int(n**0.5)+1
self.bucket=[i... | p02345 |
import math
class RangeMinimumQuery:
"""
RangeMinimumQuery by Segment Tree
query:
1. update(i, val): update i-th value to val
2. query(low, high): find minimun value in [low, high)
time complexity: O(log n)
space complexity: O(2n)
"""
def __init__(self, N, INF=float('in... | class SegmentTree:
"""Segment Tree (Point Update & Range Query)
Query
1. update(i, val): update i-th value to val
2. query(low, high): find f(value) in [low, high)
Complexity
time complexity: O(log n)
space complexity: O(n)
"""
def __init__(self, N, f, ... | p02345 |
A = []
def update(i, x):
A[i] = x
def find(s, t):
return min(A[s:t+1])
if __name__ == "__main__":
n, q = list(map(int, input().split()))
A = [2**31 - 1] * n
for i in range(q):
com, x, y = list(map(int, input().split()))
if com == 0:
update(x, y)
... | import sys
INF = 2**31 - 1
class RMQ:
def __init__(self, n):
tmp = 1
while tmp < n:
tmp *= 2
self.n = tmp * 2 - 1
self.A = [INF] * (2 * self.n - 1)
def update(self, i, x):
i = self.n // 2 + i
self.A[i] = x
while i:
... | p02345 |
from math import sqrt, ceil
def_val = 2 ** 31 - 1
n, q = list(map(int, input().split()))
unit = ceil(sqrt(n))
l = [(def_val, [def_val] * unit) for _ in range(unit)]
while q:
op, s, t = list(map(int, input().split()))
sd, sm = s // unit, s % unit
if op:
td, tm = t // unit, t % unit
... | class SegTreeMin:
def __init__(self, n):
n2 = 1
while n2 < n:
n2 <<= 1
self.n2 = n2
self.tree = [(1 << 31) - 1] * (n2 << 1)
self.output = []
def update(self, i, x):
i += self.n2
self.tree[i] = x
while i > 1:
se... | p02345 |
import math
num,query = (int(n) for n in input().split(' '))
table = [2**31 - 1 for n in range(num)]
sqrttable = []
sqrtnum = math.floor(math.sqrt(num))
tempmin = float("inf")
for t in range(num):
if t % sqrtnum == sqrtnum - 1:
tempmin = min(table[t],tempmin)
sqrttable.append(tempmin)
... | import math
def update(index,n):
targ[index] = n
index = (index - 1) // 2
while True:
targ[index] = min(targ[index * 2 + 1],targ[index * 2 + 2])
if index <= 0:
break
index = (index - 1) // 2
def find(i,e,node,inode,enode):
#print(i,e,node,inode,enode)
... | p02345 |
class RMQ:
def __init__(self, length, ini_num = float("inf")):
self.length = 1
while self.length < length:
self.length <<= 1
self.segtree = [ini_num] * (2 * self.length - 1)
def update(self, index, n):
leaf_index = index + self.length - 1
self.segtre... | class RMQ:
def __init__(self, length, ini_num = float("inf")):
self.length = 1
while self.length < length:
self.length <<= 1
self.segtree = [ini_num] * (2 * self.length - 1)
def update(self, index, n):
leaf_index = index + self.length - 1
self.segtre... | p02345 |
n, q = list(map(int, input().split()))
default = 2**31 - 1
mindict = {}
answer_stk = []
for i in range(q) :
query, x, y = list(map(int, input().split()))
if query == 0 :
mindict[x] = y
else :
min_between = default
for k in list(mindict.keys()) :
if k ... | n, q = list(map(int, input().split()))
answer = []
size = 1
while size < n :
size *= 2
size = size * 2 - 1
seg_tree = [2**31 -1 for x in range(size)]
def update(i, x) :
ind = size // 2 + i
seg_tree[ind] = x
while ind :
ind = (ind - 1) // 2
ch1 = seg_tree[ind * 2 ... | p02345 |
from collections import deque
K = int(eval(input()))
G = [[] for i in range(K)]
for n in range(K):
G[n].append([(n + 1) % K, 1])
G[n].append([(10 * n) % K, 0])
que = deque([[1, 1]])
dist = [float('inf')] * K
while que:
node, cost = que.pop()
dist[node] = min(cost, dist[node])
for e,... | from collections import deque
K = int(eval(input()))
G = [[] for i in range(K)]
for i in range(K):
G[i].append(((10 * i) % K, 0))
G[i].append(((i + 1) % K, 1))
dist = [float('inf')] * K
dist[1] = 1
que = deque()
que.append(1)
while que:
n = que.pop()
for v, c in G[n]:
if dist[v]... | p03558 |
from collections import deque
K = int(eval(input()))
G = [None]*K
for i in range(K):
G[i] = ((10*i % K, 0), ((i+1) % K, 1))
s = 1
dist = [10**9] * K
que = deque([s])
dist[s] = 0
while que:
v = que.popleft()
d = dist[v]
for w, c in G[v]:
if d+c < dist[w]:
dist[w] =... | from collections import deque
K = int(eval(input()))
G = [None]*K
for i in range(K):
G[i] = ((10*i % K, 0), ((i+1) % K, 1))
s = 1
dist = [10**9] * K
S = deque([s])
T = deque()
dist[s] = 0
d = 0
while S:
while S:
v = S.popleft()
for w, c in G[v]:
if d+c < dist[w... | p03558 |
from collections import deque
K = int(eval(input()))
G = [None]*K
for i in range(K):
G[i] = ((10*i % K, 0), ((i+1) % K, 1))
s = 1
dist = [10**9] * K
S = deque([s])
T = deque()
dist[s] = 0
d = 0
while S:
while S:
v = S.popleft()
for w, c in G[v]:
if d+c < dist[w... | from collections import deque
K = int(eval(input()))
G = [((10*i % K, 0), ((i+1) % K, 1)) for i in range(K)]
s = 1
dist = [10**9] * K
S = deque([s])
T = deque()
dist[s] = 0
d = 0
while S:
while S:
v = S.popleft()
for w, c in G[v]:
if d+c < dist[w]:
d... | p03558 |
# -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, perm... | # -*- 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... | p03558 |
from collections import deque
K = int(eval(input()))
q = deque()
q.append((1, 1, 1))
used = set()
while True:
x, y, k = q.popleft()
if (x, y, k) in used:
continue
else:
used.add((x, y, k))
# print(x, y, k)
if k % K == 0:
print(x)
break
q.appendlef... | from collections import deque
K = int(eval(input()))
q = deque()
q.append((1, 1, 1))
used = set()
while True:
x, y, k = q.popleft()
if k % K == 0:
print(x)
break
if (x, 0, k*10%K) in used:
continue
else:
used.add((x, 0, k*10%K))
q.appendleft((x, 0, k*1... | p03558 |
#!/usr/bin/env python3
from collections import deque
INF = 10**9
k = int(eval(input()))
# (辺の伸びる先, コスト)
G = [((10 * i % k, 0), ((i + 1) % k, 1)) for i in range(k)]
s = 1
# 01 - BFS
dist = [INF] * k
S = deque([s])
T = deque()
dist[s] = 0
d = 0
while S:
while S:
v = S.popleft()
... | from collections import*
q=deque([(1,1)])
k=int(eval(input()))
m={}
while q:
n,s=q.pop()
if(n in m)-1:m[n]=s;q+=(n*10%k,s),;q.appendleft((-~n%k,s+1))
print((m[0])) | p03558 |
from collections import*
q=[(1,1)]
k=int(eval(input()))
m={}
while q:
n,s=q.pop()
if(n in m)-1:m[n]=s;q+=(n*10%k,s),;q=[(-~n%k,s+1)]+q
print((m[0])) | #!/usr/bin/env python3
from collections import deque
INF = 10**9
k = int(eval(input()))
# (辺の伸びる先, コスト)
G = [((10 * i % k, 0), ((i + 1) % k, 1)) for i in range(k)]
s = 1
# 01 - BFS
dist = [INF] * k
S = deque([s])
T = deque()
dist[s] = 0
d = 0
while S:
while S:
v = S.popleft()
... | p03558 |
import sys
from collections import deque
sys.setrecursionlimit(10000)
INF = float('inf')
K = int(eval(input()))
# ある数に 1 を足すと各桁の和は 1 増える
# ある数に 10 を掛けると各桁の和は 0 増える
# mod K の世界で同じことやっても同じなので
# このグラフ上で 1 から 0 への最短距離が答え。
distances = [INF for _ in range(K)]
# 01BFS
remains = deque()
remains.append((1,... | import sys
from collections import deque
sys.setrecursionlimit(10000)
INF = float('inf')
K = int(eval(input()))
# ある数に 1 を足すと各桁の和は 1 増える
# ある数に 10 を掛けると各桁の和は 0 増える
# mod K の世界で同じことやっても同じなので
# このグラフ上で 1 から 0 への最短距離が答え。
distances = [INF for _ in range(K)]
# 01BFS
distances[1] = 1
remains = deque()
... | p03558 |
n = eval(input())
def get_sum(n):
s = str(n)
arr = list(map(int, list(s)))
return sum(arr)
ans = get_sum(n)
i = 1
for i in range(1, 10000):
m = get_sum(n * i)
if ans > m:
ans = m
print(ans)
| import collections
def ans(n):
dist = [10 ** 5] * n
dist[1] = 1
d = collections.deque()
d.append(1)
while not d.count == 0:
u = d.popleft()
if u == 0:
return dist[u]
if dist[u] < dist[(u * 10) % n]:
dist[(u * 10) % n] = dist[u]
... | p03558 |
#!/usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import *
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(): return list(map(flo... |
#!/usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import *
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(): return list(map(flo... | p03558 |
import sys
# import math
# import queue
# import copy
# import bisect#2分探索
def input():
return sys.stdin.readline()[:-1]
def inputi():
return int(eval(input()))
K=inputi()
vals=[float('inf')]*K
visit=[]
vals[1]=0
q=[1]
flag=False
while len(q)>0:
s=q.pop(0)
vs=vals[s]
if s==0:... | import sys
# import math
# import queue
# import copy
# import bisect#2分探索
from collections import deque
def input():
return sys.stdin.readline()[:-1]
def inputi():
return int(eval(input()))
K=inputi()
vals=[10**5+1]*K
visit=[]
vals[1]=0
q = deque([1])
flag=False
while len(q)>0:
s=q.p... | p03558 |
import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda :sys.stdin.readline().rstrip()
from collections import deque
def resolve():
k=int(eval(input()))
E=[[] for _ in range(k)]
for i in range(k):
E[i].append(((i+1)%k,1))
E[i].append(((10*i)%k,0))
... | import sys
INF = 1 << 60
MOD = 10**9 + 7 # 998244353
sys.setrecursionlimit(2147483647)
input = lambda:sys.stdin.readline().rstrip()
from collections import deque
def resolve():
k = int(eval(input()))
dist = [INF] * k
dist[1] = 1
queue = deque([1])
while queue:
v = queue.pop()
... | p03558 |
import sys
INF = 1 << 60
MOD = 10**9 + 7 # 998244353
sys.setrecursionlimit(2147483647)
input = lambda:sys.stdin.readline().rstrip()
from collections import deque
def resolve():
k = int(eval(input()))
dist = [INF] * k
dist[1] = 1
queue = deque([1])
while queue:
v = queue.pop()
... | import sys
INF = 1 << 60
MOD = 10**9 + 7 # 998244353
sys.setrecursionlimit(2147483647)
input = lambda:sys.stdin.readline().rstrip()
def resolve():
k = int(eval(input()))
dist = [INF] * k
dist[1] = 1
queue = [1]
for v in queue:
tmp = [v]
for v in tmp:
if dis... | p03558 |
k = int(eval(input()))
a = [0]*(10**6)
for i in range(10**6):
a[i] = sum([int(c) for c in str(k*(i+1))])
print((min(a)))
| from collections import deque
k = int(eval(input()))
d = deque()
mat = []
for i in range(k):
mat.append([])
#mark = [False]*k
dis = [10**18]*k
dis[1] = 0
for i in range(k):
mat[i].append(((i+1)%k,True))
if (10*i)%k != i:
mat[i].append(((10*i)%k,False))
#bfs 1->0
d.append(1)
res = ... | p03558 |
K=int(eval(input()))
a=K
while a%2==0:
a//=2
while a%5==0:
a//=5
if a==1:
print((1))
else:
mod=set([])
a=1
while a not in mod:
mod.add(a)
a*=10
a%=K
mod=list(mod)
n=len(mod)
check=1
table=[0 for i in range(0,n)]
for i in range(1,46... | K=int(eval(input()))
a=K
while a%2==0:
a//=2
while a%5==0:
a//=5
if a==1:
print((1))
else:
mod=set([])
a=1
while a not in mod:
mod.add(a)
a*=10
a%=K
mod=list(mod)
n=len(mod)
wei=pow(2,K)-1
check=1
ans=0
for j in range(0,n):
... | p03558 |
import heapq
K=int(eval(input()))
G=[[(1,(i+1)%K)] for i in range(K)]
for i in range(K):
a=(i*10)%K
G[i].append((0,a))
stack=list(G[1])
heapq.heapify(stack)
reached=[0]*K
reached[1]=1
while(stack):
c,g=heapq.heappop(stack)
if g==0:
print((c+1))
quit()
reached[g]=1
... | import heapq
K=int(eval(input()))
G=[[((i+1)%K,1)] for i in range(K)]
for i in range(K):
a=(i*10)%K
G[i].append((a,0))
def dijkstra(G,s):#Gはi->jの辺をG[i]=[(j,cost),...]で保存
INF=10**19
n=len(G)
d=[INF]*n#n=node数
d[s]=0
visited={s}
que=[(0,s)]
while(que):
p=heapq.heappop(que)
v=p... | p03558 |
k=int(eval(input()))
lst = [k+1]*k
queue = [1]
lst[1] = 1
while queue:
a = queue.pop(0)
if lst[a*10%k] > lst[a]:
lst[a*10%k] = lst[a]
queue.insert(0,a*10%k)
if lst[(a+1)%k]>= lst[a]+1:
lst[(a+1)%k] = lst[a]+1
queue.append((a+1)%k)
print((lst[0])) | import collections
k=int(eval(input()))
lst = [k+1]*k
q = collections.deque([1])
lst[1] = 1
while q:
a = q.pop()
if lst[a*10%k] > lst[a]:
lst[a*10%k] = lst[a]
q.append(a*10%k)
if lst[(a+1)%k]>= lst[a]+1:
lst[(a+1)%k] = lst[a]+1
q.appendleft((a+1)%k)
print((lst[0]... | p03558 |
from datetime import datetime
K = int(eval(input()))
start = datetime.now()
def KSum(n):
k = 0
for i in str(n):
k += int(i)
return k
m = KSum(K)
j = 1
while((datetime.now()-start).total_seconds()<1.9):
P = KSum(K*j)
if m > P:
m = P
j += 1
print(m)
| from collections import deque
K=int(eval(input()))
reached=[0 for i in range(K)]
reached[1]=1
dist=[0 for i in range(K)]
q=deque([])
q.append(1)
while(len(q)>0):
r=q.popleft()
v=(r+1)%K
reached[r]=1
if (reached[v]==0):
q.append(v)
dist[v]=dist[r]+1
v=(r*10)%K
if (r... | p03558 |
import heapq
K=int(eval(input()))
dist=[10**15 for i in range(K)]
dist[1]=1
q=[]
heapq.heappush(q,(0,1))
while (len(q)!=0):
prc,src=heapq.heappop(q)
if dist[src]<prc:
continue
if dist[(src+1)%K]>dist[src]+1:
dist[(src+1)%K]=dist[src]+1
heapq.heappush(q,(dist[(src+1)%K],(s... | from collections import deque
K=int(eval(input()))
dist=[10**15 for i in range(K)]
dist[1]=1
q=deque([1])
while(len(q)>0):
r=q.popleft()
s=(r+1)%K
if dist[r]+1<dist[s]:
dist[s]=dist[r]+1
q.append(s)
t=(r*10)%K
if dist[r]<dist[t]:
dist[t]=dist[r]
q.append... | p03558 |
#!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, ... | #!usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from itertools import permutations
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [list(x) for x in... | p03558 |
from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from heapq import heappush, heappop
INF = float("inf")
def main():
K = int(e... | from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from heapq import heappop, heappush
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools... | p03558 |
k=int(eval(input()))
c=float("inf")
for i in range(10**5,10**6+1):
c=min(c,sum([int(d) for d in str(k*i)]))
print(c) | from collections import deque
k=int(eval(input()))
t=[1]*k
q=deque()
q.append((1,1))
while q:
p,r=q.popleft()
if p==0:
print(r)
break
if t[p]:
t[p]=0
q.appendleft(((p*10)%k,r))
q.append(((p+1)%k,r+1)) | p03558 |
import sys
stdin = sys.stdin
sys.setrecursionlimit(10**5)
def li(): return list(map(int, stdin.readline().split()))
def li_(): return [int(x)-1 for x in stdin.readline().split()]
def lf(): return list(map(float, stdin.readline().split()))
def ls(): return stdin.readline().split()
def ns(): return stdin.re... | import sys
stdin = sys.stdin
sys.setrecursionlimit(10**5)
def li(): return list(map(int, stdin.readline().split()))
def li_(): return [int(x)-1 for x in stdin.readline().split()]
def lf(): return list(map(float, stdin.readline().split()))
def ls(): return stdin.readline().split()
def ns(): return stdin.re... | p03558 |
from collections import deque
#q = deque()
q= []
m = {}
K = int(eval(input()))
q.append((1,1))
while len(q):
#n,s = q.popleft()
n,s = q.pop(0)
if n in m:
continue
m[n] = s
#q.appendleft((n*10%K,s))
q.insert(0,(n*10%K,s))
#q.append(((n+1)%K,s+1))
q.append(((n+1)%K,s+1))
print((m[0])) | from collections import deque
q = deque()
ans = {}
K = int(eval(input()))
q.append((1,1))
while len(q):
resid,total = q.popleft()
if resid in ans:
continue
ans[resid] = total
q.appendleft((resid*10%K,total))
q.append(((resid+1)%K,total+1))
print((ans[0])) | p03558 |
from collections import deque
k=int(eval(input()))
v=list(range(k))
stack=deque([1])
inf=float('inf')
visited=[0]*k
dist=[inf]*k
dist[1]=0
while stack:
v=stack.pop()
if not visited[v]:
nv0=10*v%k
nv1=(v+1)%k
if dist[nv0]>dist[v]:
dist[nv0]=dist[v]
stack.append(nv0)
if d... | import sys
from collections import deque
readline=sys.stdin.readline
def main():
k=int(readline())
v=list(range(k))
inf=float('inf')
dist=[inf]*k
visited=[0]*k
stack=deque([1])
dist[1]=0
while stack:
v=stack.pop()
if not visited[v]:
nv0=10*v%k
... | p03558 |
from heapq import heappush, heappop
k = int(eval(input()))
heap = [(1,1)]
dist = [float("inf")]*k
while heap:
cost, cur = heappop(heap)
if dist[cur] <= cost:
continue
dist[cur] = cost
# +1
nxt = (cur+1)%k
heappush(heap, (cost+1, nxt))
# *10
nxt = cur*10 % k
he... | from collections import deque
k = int(eval(input()))
que = deque()
que.append((1,1))
dist = [float("inf")]*k
while que:
cost, cur = que.popleft()
if dist[cur] <= cost:
continue
dist[cur] = cost
# +1
nxt = (cur+1)%k
que.append((cost+1,nxt))
# *10
nxt = cur*10 % k
... | p03558 |
def solve(K):
checked = [99999999999] * (K + 1)
queue = [(1, 1)]
checked[1] = 1
while queue:
x, n = queue.pop(0)
if x == 0:
return n
_ = (x * 10) % K
if n < checked[_]:
queue.insert(0, (_, n))
checked[_] = n
_ = (x ... | from collections import deque
def solve(K):
checked = [99999999999] * (K + 1)
queue = deque()
queue.append((1, 1))
checked[1] = 1
while queue:
x, n = queue.popleft()
if x == 0:
return n
_ = (x * 10) % K
if n < checked[_]:
queue.a... | p03558 |
from collections import deque
def solve(K):
checked = [99999999999] * (K + 1)
queue = deque()
queue.append((1, 1))
checked[1] = 1
while queue:
x, n = queue.popleft()
if x == 0:
return n
_ = (x * 10) % K
if n < checked[_]:
queue.a... | def solve(K):
checked = [False] * K
def calc(x):
while not checked[x]:
checked[x] = True
yield x
x = (x * 10) % K
i = 0
xs = [0]
while 1:
i += 1
ys = []
for x in xs:
for z in calc((x + 1) % K):
... | p03558 |
from heapq import heappop,heappush
k=int(eval(input()))
inf=float("inf")
data=[[] for i in range(k)]
for i in range(1,k):
if i%10==9:
data[i]=[[i*10%k,0]]
else:
data[i]=[[i*10%k,0],[(i+1)%k,1]]
que=[[1,1]]
ans=[inf]*k
count=1
while que:
c,u=heappop(que)
ans[u]=c
for... | from heapq import heappop,heappush
from collections import deque
k=int(eval(input()))
inf=float("inf")
data=[[] for i in range(k)]
for i in range(1,k):
if i%10==9:
data[i]=[[i*10%k,0]]
else:
data[i]=[[i*10%k,0],[(i+1)%k,1]]
que=deque([[1,1]])
ans=[inf]*k
while que:
c,u=que.po... | p03558 |
import heapq
k = int(eval(input()))
dist = [float("inf")] * k
q = []
heapq.heappush(q, (1, 1))
while q:
n, c = heapq.heappop(q)
if dist[n] <= c:
continue
dist[n] = c
if dist[(n+1) % k] > c + 1:
heapq.heappush(q, ((n + 1) % k, c + 1))
if dist[(n*10) % k] > c:
... | import heapq
def small_multiple(k):
# kの倍数で各桁の総数が最も小さくなるような、各桁の総数
dist = [float("inf")] * k
q = []
# kで割った余りが1になるような最小の数は1
heapq.heappush(q, (1, 1))
while q:
n, c = heapq.heappop(q)
if dist[n] <= c:
continue
dist[n] = c
if dist[(n +... | p03558 |
# coding: utf-8
# Your code here!
import sys
sys.setrecursionlimit(10**6)
readline = sys.stdin.readline #文字列入力のときは注意
k = int(eval(input()))
g = [[] for _ in range(k)]
for i in range(k):
g[i].append(((i+1)%k,1))
if i: g[i].append((10*i%k,0))
#print(g)
"""
from collections import deque
q = de... | # coding: utf-8
# Your code here!
"""
01-BFS
辺の重みが0 or 1 のとき、dequeを使ってdijkstraを高速化できる
"""
from collections import deque
def bfs01(g,start):
n = len(g)
res = [float("inf")]*n #startからの最短距離
res[start] = 0
pending = n-1 #未確定の点の個数
q = deque([(0,start)]) #(そこまでの距離、点)
while q and pendin... | p03558 |
from collections import deque
q = deque()
K = int(eval(input()))
q.append((1, 1))
m = {}
while len(q):
n, s = q.popleft()
if n in m:continue
m[n] = s
q.appendleft((n * 10 % K, s))
q.append(((n + 1) % K, s + 1))
print((m[0])) | from collections import deque
q=deque()
K=int(eval(input()))
a=q.append
a((1,1))
m={}
while len(q):
n,s=q.popleft()
if n in m:continue
m[n]=s
q.appendleft((n*10%K,s))
a(((n+1)%K,s+1))
print((m[0])) | p03558 |
from decimal import Decimal
L=int(eval(input()))
l=Decimal(L/3)
print(("{:.12f}".format((l)**3))) | L=int(eval(input()))
print(("{:.12f}".format(L**3/27))) | p02731 |
a,b,c = list(map(int,input().split()))
if b == c:
print(a)
elif a == c:
print(b)
else:
print(c) | a = list(map(int,input().split()))
a.sort()
if a[0]!=a[1]:
print((a[0]))
else:
print((a[2])) | p03573 |
from collections import Counter
cnt = Counter(list(map(int, input().split())))
print((cnt.most_common()[1][0])) | a, b, c = list(map(int, input().split()))
if a == b: print(c)
elif a == c: print(b)
elif b == c: print(a) | p03573 |
from collections import Counter
print((Counter(input().split()).most_common()[-1][0])) | l=input().split();print((min(l,key=lambda x:l.count(x)))) | p03573 |
num = input().split()
num = [int(x) for x in num]
for i in num:
if num.count(i) == 1:
print(i) | num = [int(x) for x in input().split()]
for i in num:
if num.count(i) == 1:
print(i) | p03573 |
A, B, C = list(map(int, input().split()))
if A == B:
print(C)
elif B == C:
print(A)
else:
print(B)
| A, B, C = list(map(int, input().split()))
print((C if A == B else A if B == C else B))
| p03573 |
# -*- coding: utf-8 -*-
def func(a, b, c):
if a == b:
result = c
elif b == c:
result = a
else:
result = b
return result
a, b, c = list(map(int, input().split()))
print((func(a, b, c))) | a, b, c = list(map(int, input().split()))
print((a^b^c)) | p03573 |
a,b,c = list(map(int, input().split()))
if a == b:
print(c)
elif a == c:
print(b)
else:
print(a) | a = [int(_) for _ in input().split()]
a.sort()
if a[0] == a[1]:
print((a[2]))
elif a[0] == a[2]:
print((a[1]))
else:
print((a[0])) | p03573 |
from collections import Counter
ABC = list(map(int, input().split()))
cnt = Counter(ABC)
values, counts = list(zip(*cnt.most_common(2)))
print((values[1])) | A, B, C = list(map(int, input().split()))
if A == B:
print(C)
elif B == C:
print(A)
else:
print(B) | p03573 |
from collections import Counter
a = Counter(list(map(int,input().split()))).most_common()
print((a[1][0])) | from collections import Counter
print((Counter(list(map(int,input().split()))).most_common()[-1][0])) | p03573 |
A, B, C = list(map(int, input().split()))
print((A ^ B ^ C))
| print((eval(input().replace(" ", "^"))))
| p03573 |
A, B, C = list(map(int, input().split()))
print((A if B == C else B if A == C else C)) | integer1, integer2, integer3 = list(map(int, input().split()))
if integer2 == integer3:
print(integer1)
elif integer1 == integer3:
print(integer2)
else:
print(integer3) | p03573 |
a,b,c=list(map(int,input().split()))
print((a if b==c else b if a==c else c)) | print((eval(input().replace(" ","^")))) | p03573 |
a,b,c = input().split()
if a == b:
print(c)
elif b==c:
print(a)
else:
print(b) | a,b,c = list(map(int,input().split()))
print((a^b^c)) | p03573 |
a, b, c = list(map(int, input().split()))
print((a if b == c else b if a == c else c))
| print((eval(input().replace(' ', '^')))) | p03573 |
A,B,C=list(map(int,input().split()))
if A==B:
print(C)
else:
if A==C:
print(B)
else:
print(A)
| A,B,C=list(map(int,input().split()))
if A==B:
print(C)
elif B==C:
print(A)
else:
print(B) | p03573 |
A, B, C = list(map(int,input().split()))
if(A == B):
print(C)
elif(A == C):
print(B)
else:
print(A) | A, B, C = list(map(int,input().split()))
if(A == B):
print(C)
elif(B == C):
print(A)
else:
print(B) | p03573 |
a, b, c = list(map(int, input().split()))
if a == b:
print(c)
elif b == c:
print(a)
else:
print(b) | l1, l2, l3 = list(map(int, input().split()))
print((l1 ^ l2 ^ l3)) | p03573 |
from collections import Counter
A = Counter([int(i) for i in input().split()]).most_common()
print((A[1][0])) | a, b, c = list(map(int, input().split()))
if a == b:
print(c)
elif a == c:
print(b)
else:
print(a) | p03573 |
from collections import Counter
N = int(eval(input()))
A = list(map(int, input().split()))
c = Counter(A)
s = c.most_common()[0][0]
idx_s = [i for i,x in enumerate(A) if x == s]
l = idx_s[0]
r = idx_s[1]
def nCr(n,r):
if n < 0 or r < 0 or n < r: return 0
if n - r < r: r = n - r
if r == 0: return 1
... | from collections import Counter
N = int(eval(input()))
A = list(map(int, input().split()))
c = Counter(A)
s = c.most_common()[0][0]
idx_s = [i for i,x in enumerate(A) if x == s]
l = idx_s[0]
r = idx_s[1]
MOD = 10**9+7
fac = [1,1] + [0]*N
finv = [1,1] + [0]*N
inv = [0,1] + [0]*N
for i in range(2,N+2):
... | p03676 |
MOD = 10**9 + 7
def nCr(n,r):
numerator, denominator = 1, 1
for i in range(r):
# n * N-1 * ... * n-r+1
numerator = numerator * (n-i) % MOD
# r * r-1 * ... * 1
denominator = denominator * (r-i) % MOD
# フェルマーの小定理より、aの逆元（逆数）が、a**(m-2)とのこと
denominator = pow(denomin... | N = int(eval(input()))
A = list(map(int, input().split()))
MOD = 10**9+7
MAXN = N+5
fac = [1,1] + [0]*MAXN
finv = [1,1] + [0]*MAXN
inv = [0,1] + [0]*MAXN
for i in range(2,MAXN+2):
fac[i] = fac[i-1] * i % MOD
inv[i] = -inv[MOD%i] * (MOD // i) % MOD
finv[i] = finv[i-1] * inv[i] % MOD
def nC... | p03676 |
n,*A=list(map(int,open(0).read().split()))
f=[1]*(n+2);r=f[:]
MOD=10**9+7
for i in range(n+1):f[i+1]=e=f[i]*-~i%MOD;r[i+1]=pow(e,MOD-2,MOD)
for i in range(1,n+1):
try:
L=A.index(i);R=A.index(i,L+1)
for k in range(1,n+2):
print(((f[n+1]*r[k]*r[n+1-k]-(k<=L+n+1-R and f[L-1+n+1-R]*r... | n,*A=list(map(int,open(0).read().split()))
f=[1]*(n+2);r=f[:]
MOD=10**9+7
for i in range(n+1):f[i+1]=e=f[i]*-~i%MOD;r[i+1]=pow(e,MOD-2,MOD)
B=[0]*(n+1)
for a in A:B[a]+=1
i=B.index(2)
L=A.index(i);R=A.index(i,L+1)
for k in range(1,n+2):
print(((f[n+1]*r[k]*r[n+1-k]-(k<=L+n+1-R and f[L-1+n+1-R]*r[k-1]*r[L+n... | p03676 |
n = int(eval(input()))
a = list(map(int,input().split()))
c = [1,n-1]
#c[i]:n-1 C i
for i in range(1,n+1):
if n < i+2:
c.append(0)
else:
r = (c[-1]*(n-1-i)//(i+1))
c.append(r)
k = sum(a)- n*(n+1)//2
pp = []
for i in range(n+1):
if a[i] == k:
pp.append(i)
w ... | '''
z<<~``_<<<<<<~ ` _<+zlvzOOwrvvvvvzzzzzzzzzw)` ``<:i.``.XC~(>~~.~.~.~.~.~.~.~.~~~(~~~.~~~.~~~~~~.~~.~~.~~.~~~~~~~~~~?-~(WZZX\..`..J<;;;<_```.``..(XZyyyyyyyyyyyyyyyyyyyZyyyyyWX0OIlwXyyV
:_- ` ` `` ` -~~~~~__<1Orrrrrrvrvvvvvvr\`` ` ` ` ` `?<(>`..C(<~.......~.........~..(:...~...~..(....... | p03676 |
MOD = 10**9 + 7
def egcd(a, b):
if a == 0:
return (b, 0, 1)
else:
g, y, x = egcd(b % a, a)
return (g, x - (b // a) * y, y)
def modinv(a, m):
g, x, y = egcd(a, m)
if g != 1:
raise Exception('modular inverse does not exist')
else:
return x % m
... | MOD = 10**9 + 7
def egcd(a, b):
if a == 0:
return (b, 0, 1)
else:
g, y, x = egcd(b % a, a)
return (g, x - (b // a) * y, y)
def modinv(a, m):
g, x, y = egcd(a, m)
if g != 1:
raise Exception('modular inverse does not exist')
else:
return x % m
... | p03676 |
# -*- coding: utf-8 -*-
import sys
class FactMod():
'''
modの値が素数の時のfactと組み合わせを求める
フェルマーの小定理を用いているため、modが素数以外の時は使えない
'''
def __init__(self, n, mod):
'''
コンストラクタ
f:nまでの i!の値を 配列に入れる
inv: (i!)^-1 の値を配列に入れる
'''
self.mod = mod
... | # -*- coding: utf-8 -*-
import sys
class FactMod():
'''
modの値が素数の時のfactと組み合わせを求める
フェルマーの小定理を用いているため、modが素数以外の時は使えない
'''
def __init__(self, n, mod):
'''
コンストラクタ
f:nまでの i!の値を 配列に入れる
inv: (i!)^-1 の値を配列に入れる
'''
self.mod = mod
... | p03676 |
from sys import exit, setrecursionlimit, stderr
from functools import reduce
from itertools import *
from collections import *
from bisect import bisect
from heapq import *
def read():
return int(eval(input()))
def reads():
return [int(x) for x in input().split()]
MOD = 10**9 + 7
N = read()
A ... | from sys import exit, setrecursionlimit, stderr
from functools import reduce
from itertools import *
from collections import *
from bisect import bisect
from heapq import *
def read():
return int(eval(input()))
def reads():
return [int(x) for x in input().split()]
MOD = 10**9 + 7
N = read()
A ... | p03676 |
n = int(eval(input()))
a = list(map(int,input().split()))
mod = 10**9 + 7
## nCkのmodを求める関数
# テーブルを作る(前処理)
max = 1 * 10**5 + 100
fac, finv, inv = [0]*max, [0]*max, [0]*max
def comInit(max):
fac[0] = fac[1] = 1
finv[0] = finv[1] = 1
inv[1] = 1
for i in range(2,max):
fac[i] = fac[i-... | n = int(eval(input()))
a = list(map(int,input().split()))
mod = 10**9 + 7
## nCkのmodを求める関数
# テーブルを作る(前処理)
max = 1 * 10**5 + 100
fac, finv, inv = [0]*max, [0]*max, [0]*max
def comInit(max):
fac[0] = fac[1] = 1
finv[0] = finv[1] = 1
inv[1] = 1
for i in range(2,max):
fac[i] = fac[i-... | p03676 |
MOD = 10**9 + 7
fact = {i: None for i in range(10**6+1)} # n!
inverse = {i: None for i in range(1, 10**6+1)} # inverse of n in the field Z/(MOD)Z
fact_inverse = {i: None for i in range(10**6+1)} # inverse of n! in the field Z/(MOD)Z
fact[0] = fact[1] = 1
fact_inverse[0] = fact_inverse[1]... | MOD = 10**9 + 7
n = int(eval(input()))
A = list(map(int, input().split()))
fact = {i: None for i in range(n+2)} # n!
inverse = {i: None for i in range(1, n+2)} # inverse of n in the field Z/(MOD)Z
fact_inverse = {i: None for i in range(n+2)} # inverse of n! in the field Z/(MOD)Z
fact[0]... | p03676 |
ai = lambda: list(map(int,input().split()))
ai_ = lambda: [int(x)-1 for x in input().split()]
n = int(eval(input()))
a = ai()
MOD = 10**9+7
from collections import Counter
dup = list(Counter(sorted(a)).values()).index(2)+1
ant = a.index(dup)
post = a[::-1].index(dup)
def nCb(n, r):
fac = [1, 1] ... | ai = lambda: list(map(int,input().split()))
ai_ = lambda: [int(x)-1 for x in input().split()]
n = int(eval(input()))
a = ai()
dup = sum(a)-n*(n+1)//2
ant = a.index(dup)
post = a[::-1].index(dup)
mod = 10**9+7
factorial = [1]
for i in range(1,n+2):
factorial.append(factorial[i-1]*i %mod)
inverse =... | p03676 |
from collections import Counter
mod=10**9+7
N=10**5+11
fac,finv,inv = [0]*N,[0]*N,[0]*N
def cmb_init():
fac[0]=fac[1]=finv[0]=finv[1]=inv[1]=1
for i in range(2,N):
fac[i] = fac[i-1]*i%mod
inv[i] = mod-inv[mod%i] * (mod//i) % mod
finv[i] = finv... | from collections import Counter
mod=10**9+7
N=10**5+11
fac,finv,inv = [0]*N,[0]*N,[0]*N
def cmb_init():
fac[0]=fac[1]=finv[0]=finv[1]=inv[1]=1
for i in range(2,N):
fac[i] = fac[i-1]*i%mod
inv[i] = mod-inv[mod%i] * (mod//i) % mod
finv[i] = finv[... | p03676 |
import sys
stdin = sys.stdin
sys.setrecursionlimit(10**5)
def li(): return list(map(int, stdin.readline().split()))
def li_(): return [int(x)-1 for x in stdin.readline().split()]
def lf(): return list(map(float, stdin.readline().split()))
def ls(): return stdin.readline().split()
def ns(): return stdin.readl... | import sys
stdin = sys.stdin
sys.setrecursionlimit(10**5)
def li(): return list(map(int, stdin.readline().split()))
def li_(): return [int(x)-1 for x in stdin.readline().split()]
def lf(): return list(map(float, stdin.readline().split()))
def ls(): return stdin.readline().split()
def ns(): return stdin.readl... | p03676 |
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return ... | import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return ... | p03676 |
# -*- coding: utf-8 -*-
def inpl(): return tuple(map(int, input().split()))
n = int(eval(input()))
A = inpl()
F = [1 for _ in range(n+2)]
f = 1
for x in range(1, n+2):
f *= x
F[x] = f
def comb(n, r):
global F
if n < r:
return 0
elif r <= 0:
return 0
els... | # -*- coding: utf-8 -*-
def inpl(): return tuple(map(int, input().split()))
n = int(eval(input()))
A = inpl()
mod = 10**9 + 7
fct = [1]
inv = [1]
for i in range(1, n+2):
fct.append((fct[-1]*i)%mod)
inv.append((pow(fct[i], mod-2, mod)))
def comb(n, k):
if k < 0 or k > n:
return 0
... | p03676 |
import queue
def allvisited():
for i in range(w):
for j in range(h):
if (visited[i][j]==False and s[i][j]=='1'):
return (False,i,j)
else:
return (True,-1,-1)
def legal(pos):
if(0<=pos[0]<w) and (0<=pos[1]<h) and s[pos[0]][pos[1]]=='1' and visit... | import queue
def allvisited():
for i in range(w):
for j in range(h):
if (visited[i][j]==False and s[i][j]=='1'):
return (False,i,j)
else:
return (True,-1,-1)
def legal(pos):
if(0<=pos[0]<w) and (0<=pos[1]<h) and s[pos[0]][pos[1]]=='1' and visit... | p00741 |
from math import factorial
def combination(n, r):
return factorial(n) // (factorial(n - r) * factorial(r))
n, m = list(map(int, input().split()))
t = 100*(n-m) + m*1900 # 1回あたり
rs = [0.5**m * ( 1- 0.5**m)**i for i in range(int(1e4))]
ans = 0.0
for i,r in enumerate(rs):
ans += ((i+1)*t)*r
p... | N,M = list(map(int, input().split()))
p = 1/2
print(((1900*M+100*(N-M))*2**M))
| p03549 |
n,m = list(map(int,input().split()))
ans = 0
for i in range(2**m):
ans += 1900*m
ans += 100*(n-m)
print(ans) | n,m = list(map(int,input().split()))
ans = 0
for i in range(2**m):
ans += (1900*m)+((n-m)*100)
print(ans) | p03549 |
from sys import stdin
nii=lambda:list(map(int,stdin.readline().split()))
lnii=lambda:list(map(int,stdin.readline().split()))
n,m=nii()
ms=1900*m+100*(n-m)
ans=0
for i in range(1,10**6):
p1=0.5**m
p2=(1-0.5**m)**(i-1)
p=p1*p2
t_ms=ms*i
ans+=p*t_ms
ans=int(ans)
q=ans%10
if q!=0:
ans+=10... | from sys import stdin
nii=lambda:list(map(int,stdin.readline().split()))
lnii=lambda:list(map(int,stdin.readline().split()))
n,m=nii()
ms=1900*m+100*(n-m)
ans=ms*(2**m)
print(ans) | p03549 |
a , b = list(map(int,input().split()))
print(((1900*b+(a-b)*100)*2**b)) | n,m = list(map(int,input().split()))
print((2**m*1900*m + 2**m*100*(n-m))) | p03549 |
n,m = [int(x) for x in input().split()]
print((( (n - m) * 100 + m * 1900) * 2 ** m)) | n,m = [int(x) for x in input().split()]
ans = (100 * (n-m) + 1900 * m) * 2 ** m
print(ans) | p03549 |
def main():
N, M = (int(i) for i in input().split())
p = (0.5)**M
np = 1 - p
t = (1900*M + 100*(N-M))
ans = 0
for i in range(1, 10**5)[::-1]:
ans += i*t*p*(np**(i-1))
print((round(ans)))
if __name__ == '__main__':
main()
| def main():
N, M = (int(i) for i in input().split())
t = 1900*M + 100*(N-M)
p = 2**M
print((t*p))
if __name__ == '__main__':
main()
| p03549 |
N, M = list(map(int, input().split()))
t = 1900*M + 100*(N-M)
p = 1/((1/2)**M)
print((int(t*p))) | N, M = list(map(int,input().split()))
print(((M * 1900 + (N-M) * 100)*(2 ** M))) | p03549 |
# -*- coding: utf-8 -*-
N, M = list(map(int, input().split()))
L, S = 1900, 100
time = (N - M) * S + M * L
# bunbo = (2**M - 1)**2
print((int((2**M)*time)))
| N, M = list(map(int, input().split()))
t = (N - M) * 100 + M * 1900
print((t * (2 ** M)))
| p03549 |
N, M = list(map(int, input().split()))
Tone = M * 1900 + (N - M) * 100
Pone = 1.0 / 2**M
prob = 1 - 1.0 / 2**M
ans = 1
for time in range(2, 100000):
ans += prob * time
prob *= (1.0 - Pone)
print((int(ans * Tone * Pone + 0.5))) | N, M = list(map(int, input().split()))
tOne = M * 1900 + (N - M) * 100
ans = tOne * (2**M)
print(ans) | p03549 |
#78 C - HSI
N,M = list(map(int,input().split()))
# 全て AC となる確率
p = (1/2)**M
# 全て AC となるときの期待値
# k 回目までに「成功しない」確率の期待値
# E = (1-p)**0 + (1-p)**1 + (1-p)**2+...
E = 0
for k in range(10**6):
E += (1-p)**k
ans = (1900*M + 100*(N-M))*E
ans = round(ans)
print(ans) | #78 C - HSI
N,M = list(map(int,input().split()))
# 全て AC となる確率
p = (1/2)**M
# E = 1/p になる
E = 1/p
ans = (1900*M + 100*(N-M))*E
ans = round(ans)
print(ans) | p03549 |
N, M = list(map(int, input().split()))
p = 0.5 ** M
q = 1 - p
i = 0
sum = 0
while True:
num = (i + 1) * (100 * (N-M) + 1900 * M) * p * (q ** i)
if num < 10 ** (-6):
break
sum += num
i += 1
print((int(sum+1)))
| N, M = list(map(int, input().split()))
print((2**M * (100*(N-M) + 1900*M))) | p03549 |
N, M = list(map(int, input().split()))
ans = 0
for i in range(1, 10**6):
ans += ((1-(1/2)**M)**(i-1)) * ((1/2)**M) * (1900*M+100*(N-M)) * i
print((int(round(ans, -2)))) | N, M = list(map(int, input().split()))
ans = 0
for i in range(1, 10**5):
ans += ((1-(1/2)**M)**(i-1)) * ((1/2)**M) * (1900*M+100*(N-M)) * i
print((int(round(ans, -2)))) | p03549 |
n,m=[int(i) for i in input().split()]
ans=(n-m)*100
ans=(ans+1900*m)*2**m
print(ans) | n,m=list(map(int,input().split()))
print(((m*1900+(n-m)*100)*2**m)) | p03549 |
n,m=list(map(int,input().split()));print((1900*m+100*(n-m)<<m)) | n,m=list(map(int,input().split()));print((100*(18*m+n)<<m)) | p03549 |
N,M = list(map(int, input().split()))
print(((1900*M+100*(N-M))*(2**M))) | import sys
stdin = sys.stdin
sys.setrecursionlimit(10**5)
def li(): return list(map(int, stdin.readline().split()))
def li_(): return [int(x)-1 for x in stdin.readline().split()]
def lf(): return list(map(float, stdin.readline().split()))
def ls(): return stdin.readline().split()
def ns(): return stdin.re... | p03549 |
n, m = list(map(int, input().split()))
print((2**m*(1900*m+100*(n-m)))) | n, m = list(map(int, input().split()))
ans = ((1900 * m) + (100 * (n-m))) * 2 ** m
print(ans) | p03549 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.