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
|
|---|---|---|---|---|---|---|
import sys
N, K = map(int, input().split())
A = [0] + list(map(int, sys.stdin.readline().rsplit()))
for i in range(K + 1, N + 1):
if A[i - K] < A[i]:
print("Yes")
else:
print("No")
|
from collections import defaultdict
N, K, *A = map(int, open(0).read().split())
x = [0] * (N + 1)
for i in range(N):
x[i + 1] = x[i] + A[i]
y = [(x[i] - i) % K for i in range(N + 1)]
ctr = defaultdict(int)
ans = 0
for j in range(N + 1):
ans += ctr[y[j]]
ctr[y[j]] += 1
if j - K + 1 >= 0:
ctr[y[j - K + 1]] -= 1
print(ans)
| 0 | null | 72,150,274,652,644 | 102 | 273 |
X = int(input())
if (X < 30):
print('No')
else:
print('Yes')
|
n,k=map(int,input().split())
P=10**9+7
class FactInv:
def __init__(self,N,P):
fact=[];ifact=[];fact=[1]*(N+1);ifact=[0]*(N+1)
for i in range(1,N):
fact[i+1]=(fact[i]*(i+1))%P
ifact[-1]=pow(fact[-1],P-2,P)
for i in range(N,0,-1):
ifact[i-1]=(ifact[i]*i)%P
self.fact=fact;self.ifact=ifact;self.P=P
def comb(self,n,k):
return (self.fact[n]*self.ifact[k]*self.ifact[n-k])%self.P
C=FactInv(2*n+10,P)
ans=0
for i in range(0,min(k+1,n)):
ans+=(C.comb(n,i)*C.comb(n-1,n-i-1))%P
ans%=P
print(ans)
| 0 | null | 36,604,526,224,620 | 95 | 215 |
A, B, N = map(int, input().split())
if N >= B - 1:
print(int(A * (B - 1) / B))
else:
print(int(A * N / B))
|
import math
import sys
x=input()
x0=x.split()
a=int(x0[0])
b=int(x0[1])
n=int(x0[2])
b0=n%b
b1=0
q1=0
if b==1:
print(0)
sys.exit()
for i in range(1,math.floor(n/b)+1):
b1=b*i-1
q1=max(q1,math.floor(a*b1/b)-a*math.floor(b1/b))
q2=math.floor(a*b0/b)-a*math.floor(b0/b)
print(max(q1,q2))
| 1 | 28,145,228,663,972 | null | 161 | 161 |
n = int(input())
s = input()
A = list(map(int,s.split()))
flag = 1
cnt = 0
while(flag == 1):
flag = 0
for j in range(n-1,0,-1):
if A[j] < A[j-1]:
tmp = A[j]
A[j] = A[j-1]
A[j-1] = tmp
flag = 1
cnt += 1
for k in range(0,len(A)-1):
print(A[k],end=" ")
print(A[len(A)-1])
print (cnt)
|
def bubbleSort(A, N):
flag = 1
count = 0
while flag:
flag = 0
for j in xrange(N-1,0,-1):
if A[j] < A[j-1]:
tmp = A[j]
A[j] = A[j-1]
A[j-1] = tmp
flag += 1
count += 1
return A, count
def main():
N = int(raw_input())
A = map(int, raw_input().split())
new_A, count = bubbleSort(A, N)
print ' '.join(map(str,new_A))
print count
if __name__ == "__main__":
main()
| 1 | 17,990,095,538 | null | 14 | 14 |
a1=list(map(int,input().split()))
a2=list(map(int,input().split()))
a3=list(map(int,input().split()))
n=int(input())
for i in range (n):
num=int(input())
if num in a1:
a1[a1.index(num)]='O'
if num in a2:
a2[a2.index(num)]='O'
if num in a3:
a3[a3.index(num)]='O'
if a1[0] == 'O' and a1[1] == 'O' and a1[2] == 'O':
print('Yes')
elif a2[0] == 'O' and a2[1] == 'O' and a2[2] == 'O':
print('Yes')
elif a3[0] == 'O' and a3[1] == 'O' and a3[2] == 'O':
print('Yes')
elif a1[0] == 'O' and a2[0] == 'O' and a3[0] == 'O':
print('Yes')
elif a1[1] == 'O' and a2[1] == 'O' and a3[1] == 'O':
print('Yes')
elif a1[2] == 'O' and a2[2] == 'O' and a3[2] == 'O':
print('Yes')
elif a1[0] == 'O' and a2[1] == 'O' and a3[2] == 'O':
print('Yes')
elif a1[2] == 'O' and a2[1] == 'O' and a3[0] == 'O':
print('Yes')
else:
print('No')
|
A = [0] * 9
nums = dict()
for i in range(3):
temp = list(map(int, input().split()))
for j, var in enumerate(temp):
nums[var] = i * 3 + j
N = int(input())
for _ in range(N):
i = int(input())
if i in nums:
A[nums[i]] = 1
bingo = [
A[0] + A[1] + A[2],
A[3] + A[4] + A[5],
A[6] + A[7] + A[8],
A[0] + A[3] + A[6],
A[1] + A[4] + A[7],
A[2] + A[5] + A[8],
A[0] + A[4] + A[8],
A[2] + A[4] + A[6]]
if 3 in bingo:
print("Yes")
else:
print("No")
| 1 | 59,662,783,039,680 | null | 207 | 207 |
n = int(input())
s = input()
cnt = 0
for i in range(10):
a = s.find(str(i))
if a == -1:
continue
for j in range(10):
b = s.find(str(j), a + 1)
if b == -1:
continue
for k in range(10):
c = s.find(str(k), b + 1)
if c != -1:
cnt += 1
print(cnt)
|
a, b, c = map(int, raw_input().split())
n = a
count = 0
while True:
x = c % n
if x == 0:
count += 1
if n == b:
break
else:
n += 1
print count
| 0 | null | 64,532,670,975,032 | 267 | 44 |
s = input()
n = len(s)
if n % 2 == 1:
print("No")
exit(0)
for i in range(n):
if i % 2 == 0:
if s[i] != "h":
print("No")
break
elif s[i] != "i":
print("No")
break
else:
print("Yes")
|
x, y, a, b, c = map(int,input().split())
datp = sorted(list(map(int, input().split())), reverse=True)
datq = sorted(list(map(int, input().split())), reverse=True)
datr = list(map(int, input().split()))
dat = sorted(datp[:x] + datq[:y] + datr, reverse=True)
print(sum(dat[:x+y]))
| 0 | null | 48,727,876,742,190 | 199 | 188 |
raw_input()
a = raw_input().split(" ")
a.reverse()
print " ".join(a)
|
n = int(raw_input())
a = map(int, raw_input().split())
for i in range(n):
print a[n-i-1],
| 1 | 983,872,794,880 | null | 53 | 53 |
n = int(input())
if n == 0:
print(1)
else:
print(0)
|
# フェルマーの小定理
def mcomb(n, k):
a = 1
b = 1
for i in range(k):
a *= n - i
a %= m
b *= i + 1
b %= m
return a * pow(b, m - 2, m) % m
n, a, b = map(int, input().split())
m = 1000000007
result = pow(2, n, m) - 1
result -= mcomb(n, a)
result %= m
result -= mcomb(n, b)
result %= m
print(result)
| 0 | null | 34,749,718,146,590 | 76 | 214 |
input()
A=list(map(int,input().split()))
M=[0,1000]
for i in range(0,len(A)-1):
if A[i]>A[i+1]:
M[1]+=A[i]*M[0]
M[0]=0
elif A[i]<A[i+1]:
M[0]+=int(M[1]/A[i])
M[1]=M[1]%A[i]
M[1]+=A[i+1]*M[0]
M[0]=0
print(M[1])
|
n,m =map(int,input().split())
if n <= m:
print('unsafe')
else:
print("safe")
| 0 | null | 18,224,042,817,100 | 103 | 163 |
n=int(input())
a=[0,1,2,0,4,0,0,7,8,0,0,11,0,13,14]
s=0
for i in range(n+1):
if a[i%15]!=0:
s+=a[i%15]+i//15*15
print(s)
|
N = int(input())
data = [list(map(int,input().split())) for i in range(N-1)]
G = {}
for i in range(1,N+1):
G[i] = []
for i in range(N-1):
G[data[i][0]].append((data[i][1],i+1))
G[data[i][1]].append((data[i][0],i+1))
M = max(len(G[i]) for i in range(1,N+1))
print(M)
from collections import deque
E = [0]+[-1]*(N-1) #辺
E[1] = 1
q = deque([[data[0][0],1],[data[0][1],1]])
while q:
n,i = q.pop()
c = 1
for dn,di in G[n]:
if E[di] != -1:
continue
else:
if c == E[i]:
E[di] = M
c += 1
q.append([dn,di])
else:
E[di] = c
c += 1
q.append([dn,di])
for i in range(1,N):
print(E[i])
| 0 | null | 85,797,322,552,760 | 173 | 272 |
X = int(input())
c1 = X//500
X = X - c1*500
c2 = X//5
print(c1*1000 + c2*5)
|
#!/usr/bin/env python3
# Generated by 1.1.7.1 https://github.com/kyuridenamida/atcoder-tools (tips: You use the default template now. You can remove this line by using your custom template)
def main():
N = int(input())
C = list(input())
Rc = len(list(filter(lambda x:x=="R",C)))
Wc = len(C) - Rc
c = 0
for i in range(Rc):
if C[i] == "W":
c+=1
# print(Rc)
# print(Wc)
print(c)
pass
if __name__ == '__main__':
main()
| 0 | null | 24,519,629,100,574 | 185 | 98 |
class Unionfind():
def __init__(self, n):
self.n = n
self.parents = [-1] * (n+1)
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())
uf = Unionfind(N)
f = [0 for _ in range(N)]
n = [0 for _ in range(N)]
for _ in range(M):
a, b = map(int, input().split())
a -= 1
b -= 1
uf.union(a, b)
f[a] += 1
f[b] += 1
for _ in range(K):
c, d = map(int, input().split())
c -= 1
d -= 1
if(uf.same(c, d)):
n[c] += 1
n[d] += 1
ans = []
for i in range(N):
ans.append(uf.size(i)-f[i]-n[i]-1)
print(*ans)
|
def makeRelation():
visited=[False]*(N+1)
g=0 # group
for n in range(1,N+1):
if visited[n]:
continue
q={n}
D.append(set())
while q:
j=q.pop()
for i in F[j]: # search for friend
if not visited[i]:
visited[i]=True
q.add(i)
D[g]|={i}
g+=1
def main():
makeRelation()
#print(D)
for g in D:
for d in g:
ans[d]=len(g) - len(F[d]) - len(g&B[d]) - 1
print(*ans[1:])
if __name__=='__main__':
N, M, K = map(int, input().split())
F=[set() for n in range(N+1)]
AB=[list(map(int, input().split())) for m in range(M)]
for a,b in AB:
F[a].add(b)
F[b].add(a)
B=[set() for n in range(N+1)]
CD=[list(map(int, input().split())) for k in range(K)]
for c,d in CD:
B[c].add(d)
B[d].add(c)
D=[]
#print(F)
#print(B)
ans=[0]*(N+1)
main()
| 1 | 61,575,839,150,848 | null | 209 | 209 |
from collections import deque
def matrix(n):
for _ in range(n):
adj = list(map(int, input().split()))
i = adj[0]
v = adj[2:]
for j in v:
mat[i - 1][j - 1] = 1
def bfs(v):
d[v] = 1
dist[v] = 0
dq.append(v)
while dq:
v = dq.popleft()
for n, i in enumerate(mat[v]):
if i == 1 and not d[n]:
d[n] = 1
dist[n] = dist[v] + 1
dq.append(n)
n = int(input())
mat = [[0] * n for _ in range(n)]
d, dist = [0] * n, [-1] * n
dq = deque()
matrix(n)
bfs(0)
for i, v in enumerate(dist):
print(i + 1, v)
|
from collections import deque
n = int(input())
d = [-1]*n
d[0] = 0
M = []
for i in range(n):
adj = list(map(int,input().split()))
if adj[1] == 0:
M += [[]]
else:
M += [adj[2:]]
Q = deque([0])
while Q != deque([]):
u = Q.popleft()
for i in range(len(M[u])):
v = M[u][i]-1
if d[v] == -1:
d[v] = d[u] + 1
Q.append(v)
for i in range(n):
print(i+1,d[i])
| 1 | 3,896,703,338 | null | 9 | 9 |
s = input()
len_ = len(s)
half = len(s) // 2
ans = 0
if len_ % 2 == 0:
front = s[:half]
back = s[half:][-1::-1]
for i in range(len(front)):
if front[i] != back[i]:
ans += 1
else:
front = s[:half]
back = s[half+1:][-1::-1]
for i in range(len(front)):
if front[i] != back[i]:
ans += 1
print(ans)
|
#coding:utf-8
#1_5_B
def merge_sort(array):
if len(array) > 1:
L, countL = merge_sort(array[0:len(array)//2])
R, countR = merge_sort(array[len(array)//2:])
return merge(L, R, countL+countR)
if len(array) == 1:
return [array, 0]
def merge(L, R, count=0):
L.append(10**9+1)
R.append(10**9+1)
response = []
i = 0
j = 0
for k in range(len(L)-1 + len(R)-1):
if L[i] <= R[j]:
response.append(L[i])
i += 1
count += 1
else:
response.append(R[j])
j += 1
count += 1
return [response, count]
n = int(input())
S = list(map(int, input().split()))
numbers, count = merge_sort(S)
print(*numbers)
print(count)
| 0 | null | 60,235,972,156,712 | 261 | 26 |
import sys
input = sys.stdin.readline
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def main():
mod=10**9+7
T=LI()
A=LI()
B=LI()
d1=(A[0]-B[0])*T[0]
d2=(A[1]-B[1])*T[1]
if d1>=0:
#最初は必ず正の方向へいかないように調整
d1*=-1
d2*=-1
if d1+d2==0:
print("infinity")
elif d1==0:#d1=0のパターンを排除した
print(0)
elif d1+d2<=0:
print(0)
else:
cnt=(-1*d1)//(d1+d2)
ans=cnt*2+1
if cnt*(d1+d2)==-1*d1:
ans-=1
print(ans)
main()
|
import sys
input = sys.stdin.readline
def main():
T1, T2 = map(int, input().split())
A1, A2 = map(int, input().split())
B1, B2 = map(int, input().split())
D1 = T1 * A1 + T2 * A2
D2 = T1 * B1 + T2 * B2
if D1 == D2:
print('infinity')
else:
if D2 > D1:
A1, B1 = B1, A1
A2, B2 = B2, A2
D1, D2 = D2, D1
M1 = T1 * A1
M2 = T1 * B1
if M1 > M2:
print(0)
else:
cnt = (M2 - M1) // (D1 - D2)
ans = cnt * 2
diff = (M2 - M1) % (D1 - D2)
if diff > 0:
ans += 1
print(ans)
if __name__ == '__main__':
main()
| 1 | 132,010,809,291,260 | null | 269 | 269 |
N = int(input())
A = list(map(int, input().split()))
j=0
for i in range(N):
if A[i]==j+1:
j+=1
if j == 0:
print(-1)
else:
print(N-j)
|
def solve():
N = int(input())
A = list(map(int, input().split()))
ans = 0
p = 1
for a in A:
if a==p:
p += 1
else:
ans += 1
if p==1:
ans = -1
return ans
print(solve())
| 1 | 114,682,224,453,862 | null | 257 | 257 |
def main():
N = int(input())
count = 0
for a in range(N) :
a += 1
for b in range(N):
b += 1
c = N - a * b
if c <= 0 :
break
else :
count += 1
print(count)
if __name__ == '__main__':
main()
|
N = int(input())
r = 0
for A in range(1, N+1):
for B in range(1, N+1):
if A * B >= N: break
r += 1
print(r)
| 1 | 2,594,796,476,712 | null | 73 | 73 |
n = int(input())
if n>= 30:print('Yes')
else:print('No')
|
X, Y = list(map(int, input().split()))
for x in range(X + 1):
if x * 2 + (X - x) * 4 == Y:
print("Yes")
break
else:
print("No")
| 0 | null | 9,817,196,927,160 | 95 | 127 |
n,a,b = map(int,input().split())
# (2**n-1)-nCa-nCb
mod = 10**9+7
M = pow(2,n,mod)-1
def comb(v):
ans = 1
for i in range(1,v+1):
ans *= n-i+1
ans *= pow(i,mod-2,mod)
ans %= mod
return ans
print((M-comb(a)-comb(b))%mod)
|
import math
n, a, b = map(int, input().split())
p = 10 ** 9 + 7
#ans = 2 ** n - 1 - N C a - N C b
def modpow(a, n, MOD):
res = 1
while (n > 0):
if (n & 1):
res = res * a % MOD
a = a * a % MOD
n >>= 1
return res
def cmb(n, r, p):
A = 1
for i in range(r):
A *= (n - i)
A *= modpow(i + 1, p - 2, p)
A %= p
return A
ans = (modpow(2, n, p) - 1) % p
ans -= cmb(n, a, p) + cmb(n, b, p)
print(ans % p)
| 1 | 65,939,256,402,252 | null | 214 | 214 |
import sys
from collections import defaultdict
readline = sys.stdin.buffer.readline
#sys.setrecursionlimit(10**8)
def geta(fn=lambda s: s.decode()):
return map(fn, readline().split())
def gete(fn=lambda s: s.decode()):
return fn(readline().rstrip())
from queue import PriorityQueue
def main():
n = gete(int)
que = PriorityQueue()
for _ in range(n):
x, l = geta(int)
que.put((x + l, x - l))
ans = 0
max_r = -10**9
while not que.empty():
r, l = que.get()
if max_r <= l:
max_r = r
ans += 1
print(ans)
if __name__ == "__main__":
main()
|
N=int(input())
lst=list(map(int,input().split(" ")))
now=0
for i in range(N):
if lst[i]==now+1:
now+=1
if now == 0:
print(-1)
else:
print(N-now)
| 0 | null | 102,371,448,051,990 | 237 | 257 |
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')
|
S = input()
list = []
for i in S:
list.append(i)
if list[2]==list[3] and list[4]==list[5]:
print("Yes")
else:
print("No")
| 1 | 41,800,549,117,690 | null | 184 | 184 |
num = int(input())
if num%2==0:
print((num//2) / num)
else:
print(((num//2)+1) / num)
|
n=int(input())
def make(floor,kind,name): #floor=何階層目か,kind=何種類使ってるか
if floor==n+1:
print(name)
return
num=min(floor,kind+1)
for i in range(num):
use=0 #新しい文字使ってるか
if kind-1<i:
use=1
make(floor+1,kind+use,name+chr(i+97))
make(1,0,"")
| 0 | null | 114,677,142,479,812 | 297 | 198 |
def main():
print(list(set(["ABC", "ARC"])-{input()})[0])
if __name__ == "__main__":
main()
|
x1, y1, x2, y2 = map(float,input().split())
r = ((x1-x2)**2+(y1-y2)**2)**.5
print("{:.8f}".format(r))
| 0 | null | 12,091,188,419,440 | 153 | 29 |
nums = list(map(int,input().split()))
print(nums[0]*nums[1],2*nums[0]+2*nums[1])
|
a, b = (int(x) for x in input().split())
area = a*b
perimeter = (a+b)*2
print(area, perimeter)
| 1 | 311,726,745,556 | null | 36 | 36 |
import sys
sys.setrecursionlimit(100000000)
def main():
n, m = map(int, input().split())
res = []
# n = 2m+1を考える
if m % 2 == 0:
half_m = int(m / 2)
for i in range(half_m):
res.append((half_m - i, half_m + 1 + i))
res.append((m + half_m - i, m + half_m + 2 + i))
else:
half_m = int(m / 2)
for i in range(half_m):
res.append((half_m - i, half_m + 2 + i))
res.append((m + half_m + 1 - i, m + half_m + 2 + i))
res.append((m + 1, m + 2 * half_m + 2))
for r in res:
print(str(r[0]) + " " + str(r[1]))
main()
|
'''
N人を円周上に配置し、M本の線分で結ぶ。
このとき、線分を回転させていっても同じ人のペアが生まれないようにする。
基本的には、上から順に結べばよい。
'''
from collections import deque
def main():
N, M = map(int, input().split())
if N&1:
'''
・Nが奇数の場合
上から順に結ぶだけ。
dequeに 1,2,3,...,M*2 を突っ込んで、両端から取り出してペアにする。
'''
q = deque(range(M*2))
while q:
print(q.popleft()+1, q.pop()+1)
else:
'''
[Nが偶数の場合]
上から順に結ぶと、上下の線対称になり、同じ間隔のペアが生まれるためNG。
→ 半分以降は、1つずらしてペアを作っていく
簡単に解決するため、
・上から順に奇数間隔ペアを作る
・下から順に偶数間隔ペアを作る
この2つから、M個を順に、交互に取り出す。
'''
q1 = deque(range(N))
q2 = deque(range(N-1))
p1 = []
while q1:
p1.append((q1.popleft()+1, q1.pop()+1))
p2 = []
while len(q2)>=2:
p2.append((q2.popleft()+1, q2.pop()+1))
p2.reverse()
for _ in range(M):
print(*p1.pop())
p1, p2 = p2, p1
main()
| 1 | 28,535,164,735,040 | null | 162 | 162 |
sec=int(input())
print(":".join(map(str, [int(sec/3600), int(sec/60)%60, sec%60])))
|
N,K = map(int ,input().split())
D = []
A = []
for _ in range(K):
D.append(int(input()))
A.append(list(map(int, input().split())))
# お菓子を持っている人を数える。すると持っていない人間は、Nから持っている人の数を引いたもの
l = [0]*N
for i in range(K):
for j in range(D[i]):
l[A[i][j]-1] = 1
print(N - sum(l))
| 0 | null | 12,380,207,187,260 | 37 | 154 |
N, X, Y = map(int, input().split())
d = Y-X+1
l = [0]*(N+1)
for i in range(1, N+1):
for j in range(i, N+1):
m = min(j-i, abs(X-i)+1+abs(Y - j))
l[m] += 1
print(*l[1:-1], sep="\n")
|
N,X,Y =map(int,input().split())
count = [0] * (N-1)
for i in range(1,N):
path = abs(X-i) +1
for j in range(i+1,N+1):
dist = min(j-i, path+abs(Y-j))
count[dist-1] +=1
print(*count, sep="\n")
| 1 | 44,281,457,101,440 | null | 187 | 187 |
N = int(input())
A = [int(x) for x in input().split()]
M = max(A)
count = [0 for _ in range(M + 1)]
for i in range(N):
count[A[i]] += 1
S = 0
for i in range(M + 1):
m = count[i]
S += (m * (m - 1)) // 2
ans = [S for _ in range(N)]
for i in range(N):
m = count[A[i]]
ans[i] -= m - 1
for i in range(N):
print(ans[i])
|
N = int(input())
A = list(map(int,input().split()))
li = [0] * (N + 1)
total = 0
for i in A:
li[i] += 1
for i in li[1:]:
total += i * (i - 1) // 2
for i in A:
j = li[i]
print(total - (j * (j - 1) // 2) + ((j - 1) * (j - 2) // 2))
| 1 | 47,806,191,539,148 | null | 192 | 192 |
N = int(input())
flag = 'No'
cnt = 0
for i in range(N):
d1, d2 = map(int, input().split())
if d1 == d2:
cnt += 1
if cnt == 3:
flag = 'Yes'
else:
cnt = 0
print(flag)
|
N = int(input())
check = [0, 0, 0]
for i in range(N):
str = input().split()
check[i%3] = 1 if str[0] == str[1] else 0
if sum(check) == 3:
break
print('Yes') if sum(check) == 3 else print('No')
| 1 | 2,462,500,113,728 | null | 72 | 72 |
N = int(input())
S = str(input())
#print(N,S)
stack = []
while len(S) > 0:
if len(stack) == 0:
stack.append(S[0])
S = S[1:]
elif S[0] == stack[-1]:
S = S[1:]
elif S[0] != stack[-1]:
stack.append(S[0])
S = S[1:]
#print(S,stack)
print(len(stack))
|
N = int(input())
S = input()
ans = 1
for i in range(N-1):
if(S[i] != S[i+1]):
ans += 1
print(ans)
| 1 | 170,078,949,479,350 | null | 293 | 293 |
k=int(input())
a,b=map(int,input().split())
flag=0
for i in range(1001):
if a<=k*i<=b:
print("OK")
flag+=1
break
if flag==0:
print("NG")
|
s,t=raw_input().split()
print t+s
| 0 | null | 64,953,668,128,982 | 158 | 248 |
# -*- coding: utf-8 -*-
n = int(input())
st = []
for i in range(n):
st.append([str(i) for i in input().split()])
x = str(input())
tmp = 0
i = 0
while True:
if st[i][0] == x:
tmp += int(st[i][1])
break
else:
tmp += int(st[i][1])
i += 1
sum_t = 0
for i in range(n):
sum_t += int(st[i][1])
print(sum_t - tmp)
|
N = int(input())
music = []
for i in range(N):
music.append(input().split())
X = (input())
Time = 0
kama = False
for s,t in music:
if kama:
Time += int(t)
if s == X:
kama = True
print(Time)
| 1 | 97,006,693,481,572 | null | 243 | 243 |
n=int(input())
s=list(map(int,input().split()))
p=[0]*n
for i in range(n):
p[s[i]-1]=i+1
print(*p)
|
N = int(input())
S, T = input().split()
ans = ""
for p in range(N):
ans += S[p]
ans += T[p]
print(ans)
| 0 | null | 146,293,200,603,250 | 299 | 255 |
N, M, K = map(int, input().split())
ans = 0
def cmb(n, r, p):
if (r < 0) or (n < r):
return 0
r = min(r, n - r)
return fact[n] * factinv[r] * factinv[n-r] % p
p = 998244353
fact = [1, 1] # fact[n] = (n! mod p)
factinv = [1, 1] # factinv[n] = ((n!)^(-1) mod p)
inv = [0, 1] # factinv 計算用
for i in range(2, N + 1):
fact.append((fact[-1] * i) % p)
inv.append((-inv[p % i] * (p // i)) % p)
factinv.append((factinv[-1] * inv[-1]) % p)
for i in range(K+1):
res_i = (M * pow(M-1, N-i-1, p)) % p
res_i = (res_i * cmb(N-1, i, p)) % p
ans = (ans + res_i) % p
print(ans)
|
n, m, k = map(int, input().split())
mod = 998244353
N = 10 ** 6
inv_t = [0]+[1]
for i in range(2, N):
inv_t += [inv_t[mod % i] * (mod - int(mod / i)) % mod]
kai = [1, 1]
rev_kai = [1, inv_t[1]]
for i in range(2, N):
kai.append(kai[-1] * i % mod)
rev_kai.append(rev_kai[-1] * inv_t[i] % mod)
def cmb(n, r):
return kai[n] * rev_kai[r] * rev_kai[n-r] % mod
base = m
ans = 0
for i in range(n-1):
base = base * (m-1) % mod
for i in range(0, k+1):
ans += base * cmb(n-1, n-1-i)
ans %= mod
base = base * inv_t[m-1] % mod
if m == 1 and k == n-1:
print(1)
else:
print(ans)
| 1 | 23,219,917,192,978 | null | 151 | 151 |
try:
inp = input().split()
L = int(inp[0])
R = int(inp[1])
d = int(inp[2])
if L >= 1 and R >= 1 and L <= R and L<=100 and R<=100 and d>=1 and d<=100:
counter = 0
for i in range(L,R+1):
if i%d == 0:
counter += 1
print(counter)
except Exception as e:
print(e)
|
"""
pppppppppppppppppppp
ppppp ppppppppppppppppppp
ppppppp ppppppppppppppppppppp
pppppppp pppppppppppppppppppppp
pppppppppppppppppppppppppppppppp
pppppppppppppppppppppppp
ppppppppppppppppppppppppppppppppppppppppppppppp pppppppppppppppppppp
pppppppppppppppppppppppppppppppppppppppppppppppp ppppppppppppppppppppp
ppppppppppppppppppppppppppppppppppppppppppppppppp pppppppppppppppppppppp
ppppppppppppppppppppppppppppppppppppppppppppppp pppppppppppppppppppppppp
pppppppppppppppppppppppppppppppppppppppppppppp pppppppppppppppppppppppppp
ppppppppppppppppppppppppppppppppppppppppppppp pppppppppppppppppppppppppppp
pppppppppppppppppppppppppppppppp pppppppppppppppppppppppppppppppp
pppppppppppppppppppppppppppp pppppppppppppppppppppppppppppppppppppppppppppp
ppppppppppppppppppppppppppp pppppppppppppppppppppppppppppppppppppppppppppppp
pppppppppppppppppppppppp pppppppppppppppppppppppppppppppppppppppppppppppppp
ppppppppppppppppppppppp ppppppppppppppppppppppppppppppppppppppppppppppppp
pppppppppppppppppppppp ppppppppppppppppppppppppppppppppppppppppppppppp
ppppppppppppppppppppp ppppppppppppppppppppppppppppppppppppppppppppp
pppppppppppppppppppppppp
pppppppppppppppppppppppppppppppp
pppppppppppppppppppppp pppppppp
ppppppppppppppppppppp ppppppp
ppppppppppppppppppp ppppp
pppppppppppppppppppp
"""
import sys
from functools import lru_cache, cmp_to_key
from collections import defaultdict as dd, deque, Counter as C
from bisect import bisect_left as bl, bisect_right as br, bisect
mod = pow(10, 9) + 7
mod2 = 998244353
def data(): return sys.stdin.readline().strip()
def out(var, end="\n"): sys.stdout.write(str(var)+end)
def outa(*var, end="\n"): sys.stdout.write(' '.join(map(str, var)) + end)
def L(): return list(sp())
def sl(): return list(ssp())
def sp(): return map(int, data().split())
def ssp(): return map(str, data().split())
def l1d(n, val=0): return [val for i in range(n)]
def l2d(n, m, val=0): return [l1d(n, val) for j in range(m)]
l, r, d = sp()
answer = 0
for i in range(l, r + 1):
if i % d == 0:
answer += 1
out(answer)
| 1 | 7,526,588,361,448 | null | 104 | 104 |
n, m = map(int, input().split())
days = input().split()
x = 0
for day in days:
x = x + int(day)
if x <= n:
print(n - x)
else:
print(-1)
|
N, M = map(int, input().split())
A = list(map(int, input().split()))
def answer(N: int, M: int, A: list) -> int:
A = sum(A)
if N < A:
return -1
else:
return N - A
print(answer(N, M, A))
| 1 | 31,979,914,237,418 | null | 168 | 168 |
k=int(input())
l=['ACL']*k
print(*l,sep='')
|
n = int(input())
mod = 10**9 + 7
contain_zero = 0
contain_nine = 0
not_contain_zero_and_nine = 0
all_per = pow(10,n,mod)
if n < 2:
print(0)
else:
contain_zero = all_per - pow(9,n,mod)
contain_nine = all_per - pow(9,n,mod)
not_contain_zero_and_nine = pow(8,n,mod)
print((-(all_per - not_contain_zero_and_nine -contain_nine - contain_zero))%mod)
| 0 | null | 2,683,099,985,500 | 69 | 78 |
N = int(input())
ans = pow(10, N, mod=1000000007) - pow(9, N, mod=1000000007) - pow(9, N, mod=1000000007) + pow(8, N, mod=1000000007)
ans %= 1000000007
print(ans)
|
# #
# author : samars_diary #
# 16-09-2020 │ 18:28:11 #
# #
import sys, os.path, math
#if(os.path.exists('input.txt')):
#sys.stdin = open('input.txt',"r")
#sys.stdout = open('output.txt',"w")
sys.setrecursionlimit(10 ** 5)
def mod(): return 10**9+7
def i(): return sys.stdin.readline().strip()
def ii(): return int(sys.stdin.readline())
def li(): return list(sys.stdin.readline().strip())
def mii(): return map(int, sys.stdin.readline().split())
def lii(): return list(map(int, sys.stdin.readline().strip().split()))
#print=sys.stdout.write
def solve():
a=ii();print((pow(10,a,mod())+pow(8,a,mod())-2*pow(9,a,mod()))%mod())
for _ in range(1):
solve()
| 1 | 3,159,998,187,862 | null | 78 | 78 |
import sys
input = sys.stdin.readline
INF = 10**18
sys.setrecursionlimit(10**6)
def li():
return [int(x) for x in input().split()]
N = int(input())
xs, ys = [], []
for i in range(N):
x, y = li()
xs.append(x)
ys.append(y)
def get_max_manhattan_distanse(xs, ys):
X = [xs[i] + ys[i] for i in range(len(xs))]
Y = [xs[i] - ys[i] for i in range(len(xs))]
# return max(max(X) - min(X), max(Y) - min(Y))
X.sort()
Y.sort()
return max(X[-1] - X[0], Y[-1] - Y[0])
ans = get_max_manhattan_distanse(xs, ys)
print(ans)
|
N = int(input())
x, y = map(int, input().split())
d = [x - y, x - y, x + y, x + y]
for i in range(1,N):
x, y = map(int, input().split())
d[0] = max(d[0], x-y)
d[1] = min(d[1], x-y)
d[2] = max(d[2], x+y)
d[3] = min(d[3], x+y)
print(max(d[0]-d[1], d[2]-d[3]))
| 1 | 3,466,384,233,312 | null | 80 | 80 |
def read_int():
return int(input())
def read_ints():
return map(int, input().split(' '))
r, c = read_ints()
s = []
for i in range(r):
s.append(input())
inf = int(1e9)
dp = [[inf for j in range(c)] for i in range(r)]
dp[0][0] = 1 if s[0][0] == '#' else 0
for i in range(r):
for j in range(c):
if i > 0:
dp[i][j] = dp[i - 1][j]
if s[i][j] == '#' and s[i - 1][j] == '.':
dp[i][j] += 1
if j > 0:
another = dp[i][j - 1]
if s[i][j] == '#' and s[i][j - 1] == '.':
another += 1
dp[i][j] = min(dp[i][j], another)
print(dp[r - 1][c - 1])
|
from collections import deque
from enum import Enum, auto
class Color(Enum):
WHITE = auto()
GRAY = auto()
BLACK = auto()
n = int(input())
d = [0 for i in range(n)]
f = [0 for i in range(n)]
colors = [] # 頂点の訪問状態
A = [[0 for j in range(n)] for i in range(n)] # 隣接行列
queue = deque([])
# 隣接行列の初期化
for i in range(n):
arr = list(map(int, input().split(' ')))
u, k, v = arr[0], arr[1], arr[2:]
for j in range(k):
A[u-1][v[j]-1] = 1
def bfs():
global colors, queue, d
colors = [Color.WHITE for i in range(n)]
d = [-1 for i in range(n)] # INF
colors[0] = Color.GRAY
d[0] = 0
queue.append(0)
while len(queue) > 0:
u = queue.popleft()
for v in range(n):
if A[u][v] == 1 and colors[v] == Color.WHITE:
colors[v] = Color.GRAY
d[v] = d[u] + 1
queue.append(v)
colors[u] = Color.BLACK
bfs()
for i in range(n):
print(i+1, d[i])
| 0 | null | 24,687,360,231,360 | 194 | 9 |
def f(A,B,x):
val=((A*x)//B)-A*(x//B)
return val
A,B,n=map(int,input().split())
print(f(A,B,B-1)) if n>=B-1 else print(f(A,B,n))
|
k = int(input())
cnt = 0
mod = [0]
not_found = 1
while cnt<k+1:
cnt+=1
n = mod[-1]*10+7
mod.append(n%k)
if n % k == 0:
not_found = 0
print(cnt)
break
if(not_found):
print(-1)
| 0 | null | 17,051,490,014,328 | 161 | 97 |
import bisect
import sys
from bisect import bisect_left
from operator import itemgetter
sys.setrecursionlimit(10**9)
input = sys.stdin.readline
def ii(): return int(input())
def mi(): return map(int, input().split())
def lmi(): return list(map(int, input().split()))
def lmif(n): return [list(map(int, input().split())) for _ in range(n)]
def main():
N = ii()
L = lmi()
L.sort()
# print(L)
# 2辺を固定して、2辺の和より長い辺の数を数える
count = 0
for i in range(N):
for j in range(i+1, N):
limit = L[i] + L[j]
longer = bisect_left(L, limit)
tmp = longer - (j + 1)
# print(limit, longer, tmp)
count += longer - (j + 1)
print(count)
return
main()
|
import math
a, b, x = map(int, input().split())
if x/a >= a*b/2:
ans = math.atan((b-x/a/a)*2/a)
else:
ans = math.atan(a*b*b/x/2)
print(math.degrees(ans))
| 0 | null | 167,717,795,404,860 | 294 | 289 |
import sys
def main():
input = sys.stdin.buffer.readline
k = int(input())
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,
]
print(a[k - 1])
if __name__ == "__main__":
main()
|
X = int(input())
if X >= 400 and X <= 599:
print(8)
elif X >= 600 and X <= 799:
print(7)
elif X >= 800 and X <= 999:
print(6)
elif X >= 1000 and X <= 1199:
print(5)
elif X >= 1200 and X <= 1399:
print(4)
elif X >= 1400 and X <= 1599:
print(3)
elif X >= 1600 and X <= 1799:
print(2)
elif X >= 1800 and X <= 1999:
print(1)
| 0 | null | 28,462,741,003,762 | 195 | 100 |
# -*- coding: utf-8 -*-
import sys
import math
import os
import itertools
import string
import heapq
import _collections
from collections import Counter
from collections import defaultdict
from collections import deque
from functools import lru_cache
import bisect
import re
import queue
import decimal
class Scanner():
@staticmethod
def int():
return int(sys.stdin.readline().rstrip())
@staticmethod
def string():
return sys.stdin.readline().rstrip()
@staticmethod
def map_int():
return [int(x) for x in Scanner.string().split()]
@staticmethod
def string_list(n):
return [Scanner.string() for i in range(n)]
@staticmethod
def int_list_list(n):
return [Scanner.map_int() for i in range(n)]
@staticmethod
def int_cols_list(n):
return [Scanner.int() for i in range(n)]
MOD = 2019
# INF = int(1e15)
def solve():
S = Scanner.string()
S = S[::-1]
cnt = [0 for _ in range(MOD)]
tmp = 0
ans = 0
x = 1
for s in S:
cnt[tmp] += 1
tmp += int(s) * x
tmp %= MOD
x *= 10
x %= MOD
ans += cnt[tmp]
print(ans)
def main():
# sys.setrecursionlimit(1000000)
# sys.stdin = open("sample.txt")
# T = Scanner.int()
# for _ in range(T):
# solve()
# print('YNeos'[not solve()::2])
solve()
if __name__ == "__main__":
main()
|
X, Y = map(int, input().split())
for k in range(X+1):
t = X - k
if k*4 + t*2 == Y:
print("Yes")
exit()
print("No")
| 0 | null | 22,274,185,448,536 | 166 | 127 |
N=int(input())
count=0
for i in range(1,10):
for j in range(1,10):
if N/i==j:
count+=1
else:
count=count
if count==0:
print("No")
else:
print("Yes")
|
import sys,itertools,collections,bisect
from collections import deque,Counter,defaultdict
from heapq import heappush,heappop,heapify
read=sys.stdin.readline
sys.setrecursionlimit(10**6)
MOD=10**9+7
N=int(input())
A=list(map(int,input().split()))
cum=[0]*(N+1)
for i in range(N):
cum[i+1]=(cum[i]+A[i])%MOD
ans=0
for i in range(N):
res=(cum[N]-cum[i+1]+MOD)%MOD*A[i]%MOD
ans=(ans+res)%MOD
print(ans)
| 0 | null | 81,405,410,358,080 | 287 | 83 |
import numpy as np
n, k = map(int, input().split())
a = np.arange(n+1, dtype='int')
b = np.cumsum(a)
s = 0
for i in range(k, n+1):
s += (b[n] - b[n-i]) - b[i-1] + 1
s = s % 1000000007
s += 1
s = s % 1000000007
print(s)
|
N,K = map(int,input().split())
number = N+1-K+1
W = 0
for i in range(number):
min = (K+i)*(K+i-1)/2
max = (K+i)*(2*N-K-i+1)/2
W += (max-min+1)
w = W % (1000000007)
print(int(w))
| 1 | 33,055,919,299,570 | null | 170 | 170 |
def main():
S = list(input().rstrip())
N = len(S)
if S != list(reversed(S)):
print("No")
elif S[:int((N-1)/2)] != list(reversed(S[:int((N-1)/2)])):
print("No")
elif S[int((N+3)/2) - 1:] != list(reversed(S[int((N+3)/2) - 1:])):
print("No")
else:
print("Yes")
if __name__ == '__main__':
main()
|
def check(str):
str2 = str[::-1]
return str == str2
def main():
s = input()
n = len(s)
first = s[:(n-1)//2]
end = s[((n+3)//2)-1:]
if all((check(s), check(first), check(end))):
print("Yes")
else:
print("No")
main()
| 1 | 46,354,737,086,632 | null | 190 | 190 |
N, M = map(int, input().split())
S = input()
if N <= M:
print(N)
exit()
if '1'*M in S:
print(-1)
exit()
from collections import deque
count = deque([])
for k in range(M+1):
if S[k] == '1':
count.append(-1)
else:
count.append(k)
sgn = deque([])
k = 0
while k < N:
k += 1
if S[k] == '0':
sgn.append(M)
else:
d = 0
while k < N:
if S[k] == '1':
k += 1
d += 1
continue
else:
break
while d > 0:
sgn.append(M-d)
d -= 1
sgn.append(M)
now = M
while now < N:
now += 1
a = sgn.popleft()
if S[now] == '1':
count.append(-1)
else:
count.append(a)
count = list(count)
c = 0
ans = ''
while c < N:
ans = str(count[-1-c]) + ' ' + ans
c += count[-1-c]
print(ans)
|
def solution(arr):
count = 0
for i, j in arr:
if i == j:
count += 1
else:
count = 0
if count == 3:
return 'Yes'
return 'No'
n = int(input())
arr = []
for _ in range(n):
arr.append([ int(i) for i in input().split()])
print(solution(arr))
| 0 | null | 70,483,089,345,948 | 274 | 72 |
import math
r = [float(x) for x in input().split()]
print("{0:f} {1:f}".format(r[0] * r[0] * math.pi, r[0] * 2 * math.pi))
|
import math
r = float(input())
S = math.pi * r * r
L = 2 * math.pi * r
print("{0:.10f}".format(S),end=" ")
print("{0:.10f}".format(L))
| 1 | 639,987,226,048 | null | 46 | 46 |
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(10**8)
INF = float("inf")
def yes():
print("Yes") # type: str
def no():
print("No") # type: str
def solve(N: int, S: "List[str]"):
def f(s):
ans = [0]*(len(s)+1)
m = 0
for i, c in enumerate(s):
if c == "(":
m += 1
else:
m -= 1
ans[i] = m
return min(*ans), m, s
# 数値化(最小値, 到達値)
T = [f(s) for s in S]
front = []
back = []
for a, b, s in T:
if b >= 0:
front.append((a, b, s))
else:
back.append((a, b, s))
front.sort(key=lambda x: x[0], reverse=True)
back.sort(key=lambda x: min(0, x[0]-x[1]), reverse=True)
# print(front)
# print(back)
m = 0
for ma, mb, s in front+back[::-1]:
if m + ma < 0:
no()
# print("負", s)
return
m += mb
if m == 0:
yes()
else:
# print("非零到達")
no()
return
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
N = int(next(tokens)) # type: int
S = [next(tokens) for _ in range(N)] # type: "List[str]"
solve(N, S)
if __name__ == '__main__':
main()
|
import sys,math,collections,itertools,heapq
input = sys.stdin.readline
def f(n):
return -1*int(n)
x,y,a,b,c=list(map(int,input().split()))
p=sorted(list(map(int,input().split())),reverse=1)[:x]
q=sorted(list(map(int,input().split())),reverse=1)[:y]
r=list(map(f,input().split()))
p = collections.deque(p)
q = collections.deque(q)
heapq.heapify(r)
tmp = -1*heapq.heappop(r)
while tmp > p[-1]:
p.appendleft(tmp)
tmp = p.pop()
tmp = -1* heapq.heappushpop(r,-1*tmp)
while tmp > q[-1]:
q.appendleft(tmp)
tmp = q.pop()
tmp = -1 * heapq.heappushpop(r,-1*tmp)
print(sum(p)+sum(q))
| 0 | null | 34,419,060,317,280 | 152 | 188 |
a, b = map(int, input().split())
if 1<=a<=9 and 1<=b<=9:
print(a*b)
else:
print(-1)
|
n = int(input())
A = list(map(int, input().split()))
mod = 10**9+7
A = [a+1 for a in A]
C = [0]*(n+1)
C[0] = 3
ans = 1
for a in A:
if C[a-1] < C[a]:
print(0)
exit()
else:
ans *= C[a-1]-C[a]
ans %= mod
C[a] += 1
print(ans)
| 0 | null | 143,877,286,988,530 | 286 | 268 |
def solve():
from bisect import bisect_right, bisect, bisect_left
x = int(input())
n = 100100
primes = set(range(2, n + 1))
for i in range(2, int(n ** 0.5 + 1)):
if i not in primes:
i += 1
else:
ran = range(i * 2, n + 1, i)
primes.difference_update(ran)
primes = list(primes)
y = bisect_left(primes, x)
print(primes[y])
solve()
|
import sys
x = int(input())
import math
# 素数判定関数
def isPrime(num):
# 2未満の数字は素数ではない
if num < 2: return False
# 2は素数
elif num == 2: return True
# 偶数は素数ではない
elif num % 2 == 0: return False
# 3 ~ numまでループし、途中で割り切れる数があるか検索
# 途中で割り切れる場合は素数ではない
for i in range(3, math.floor(math.sqrt(num))+1, 2):
if num % i == 0:
return False
# 素数
return True
# 素数判定
def callIsPrime(input_num=1000):
numbers = []
# ループしながら素数を検索する
for i in range(1, input_num):
if isPrime(i):
numbers.append(i)
# 素数配列を返す
return numbers
# 関数の呼び出し
# print(callIsPrime(100000+4)[-1])
for i in callIsPrime(100000+4):
if i>=x:
print(i)
sys.exit()
| 1 | 105,485,676,602,720 | null | 250 | 250 |
from math import sqrt, ceil
n = int(input())
def ans(n):
if n == 2:
return 1
# divisors of n-1
count = sum(2*int((n-1)%i==0) for i in range(2, ceil(sqrt(n-1))))
# check the square root of n-1
if ceil(sqrt(n-1)) == int(sqrt(n-1)):
count += 1
# n-1 is always a divisor of n-1
count += 1
# divisors of n
for i in range(2, ceil(sqrt(n))):
if n%i==0:
x = n
while x%i == 0:
x = x//i
count += int((x-1)%i==0)
other_divisor = n//i
x = n
while x%other_divisor == 0:
x = x//other_divisor
count += int((x-1)%other_divisor==0)
# check the square root of n
if ceil(sqrt(n)) == int(sqrt(n)):
i = int(sqrt(n))
x = n
while x%i == 0:
x = x//i
count += int((x-1)%i==0)
# n is always a divisor of n that reduces to 1 by division once
count += 1
return(count)
print(ans(n))
|
def main():
n = int(stdinput())
st = [None] * (4**12)
for _ in range(n):
cmd, value = stdinput().split()
if cmd == 'insert':
st[get_hash(value)] = 1
elif cmd == 'find':
if st[get_hash(value)] == 1:
print('yes')
else:
print('no')
CODES = {'A' : 1, 'C' : 2, 'G' : 3, 'T' : 4}
def get_hash(s):
base = 1
h = 0
for c in s:
code = CODES[c]
h += code * base
base *= 4
return h
def stdinput():
from sys import stdin
return stdin.readline().strip()
if __name__ == '__main__':
main()
# import cProfile
# cProfile.run('main()')
| 0 | null | 20,567,468,509,952 | 183 | 23 |
print(int((int(input())+1)/2-1))
|
import sys
s = sys.stdin.readline().rstrip("\n")
print(s[:3])
| 0 | null | 83,991,876,452,860 | 283 | 130 |
N = int(input())
S = input()
print("Yes" if S[:N//2] == S[N//2:] else "No")
|
n=int(input())
s=list(input())
if n%2==0:
bef=s[:n//2]
aft=s[n//2:]
if bef==aft:
print("Yes")
else:
print("No")
else:
print("No")
| 1 | 146,925,332,973,306 | null | 279 | 279 |
n, m, k = map(int,input().split())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
total = 0
count = 0
flag = n-1
for i in range(n):
total += a[i]
if total > k:
total -= a[i]
flag = i-1
break
count += 1
ans = count
for i in range(m):
if b[i] > k:
break
total += b[i]
count += 1
while total > k:
if flag == -1:
break
else:
total -= a[flag]
flag -= 1
count -= 1
if total > k:
break
ans = max(ans, count)
print(ans)
|
w = raw_input()
t = []
while 1:
x = raw_input()
if x =="END_OF_TEXT":break
t+=x.lower().split()
print t.count(w)
| 0 | null | 6,302,766,296,672 | 117 | 65 |
N=int(input())
rep=0
result="No"
for i in range(N):
a,b=map(int,input().split())
if a==b:
rep+=1
else:
rep=0
if rep==3:
result="Yes"
break
print(result)
|
cnt = 0
for _ in range(int(input())):
a, b = map(int, input().split())
if a == b:
cnt += 1
else:
cnt = 0
if cnt > 2:
print("Yes")
quit()
print("No")
| 1 | 2,511,414,350,240 | null | 72 | 72 |
# ..
# .gMMN;
# .HMMMR ....-, .gggggggJJ...
# .J,. TMMN; ..JgNMMMMMMM{dMMMMMMMMMMMMNNgJ..
# .MMMNx. ?MMb .JNMMMMMMMMMMMMrJMMMMMMMMMMMMMMMMMNmJ.
# ?MMMMMNe. ?MN, .iMMMMMMMMMMMMMMMMP(MMMMMMMMMMMMMMMMMMMMMb .`(zvvvvrOO+. .(wvO- _(vvvvvrOz+. _(ro _(rl
# ?THMMNm. -"!.NMMMMMMMMMMMMMMMMMH%.WHHMMMMMMMMMMMMMMMMMM^ ~ zvC~~~?<?Ovo. !(rrrI `_(vO!~~?<1Oro. _(vI _(rI
# ..... ~7W$ ...MMMMMMMMMMMMB0C1????> dZZZZZZZZZWHMMMMMMMB! ~ zv> _ Orl -.vvrrv; _(vI _(Ov{ _(rI _(rI
# dMMMMMNNNme .jMMNmTMMMMMMMBC?????????> duZuZuZZuZZZZZXHMMY ~ zv> _ zvI ~jvv<?vw. _(rI .zr{ _(rI _(rI
# dMMMMBY"=!`.MMMMMMNmTMMM6????????????z_jZuZZuZuZuZuZZZZC` ~ zv> ._JvZ! _-vI` _jv> _(vI _(rr! _(rO-....(-JrI
# (MMMMMMMMMD ?1??=?=??=???=?=_(ZZZuZZZZZuZuZV! ~ zvw&+xzzwOC! ._zv: _.ww_ _(vr&J+xzzrC! _(rrrrrrvrrrrI
# .dMMMMMMMMMD_.- ?1?=?????=???=_(ZZuZZuZuZZZX=` ~ zvZ7I1vv> _(vv&..-(rro _(rvC777<<` _(vZ!````~_jrI
# .dMMMMMMMMM=.....- ?1??=??????=<(SZZuZZuZZZV! ~ zv> _.1rO- ..wrOOOOOOOrw- _(vZ _(vI _(vI
# (MMMMMMMM#!........- <?=???=??=:.SZuZZuZZ0> ~ zv> -?ww- ~jvv ~(vO _(rI _(rI _(rI
# .MMMMMMMM#!......_(J-.-.<?=?????>.ZZZuZZZC` ~ zv> _(Or+ _.rZ` -zv{ _(rI _(vI _(rI
# dMMMMMMMMt.......(TMNm,.-.<=??=?> XZZZZV! ~ zv> _(Or+..~zv> _(vw._(vI _(rI _(rI
# .MMMMMMMM#_.........?WMNm,.--<=??z_dZZ0=` ~ zw: _.OO>_.rC` _jr>_(rC _(rC _(rC
# (MMMMMMMMD.......-gNNMMMM$...--<?v`dZV~...
# dX0vrOz<_``. -7Y=<~_....... <gMMMMNNmgJJ... <-. (<
# jMMMMMMMNZ???>>+++++(((((----... dMMMMMMMMMMMMMMNNagJ... (<z!
# dMMMMMMMMR??>??>?>??>?>??>?????< ?MMMMMMMMMMMMMMMMMMMMMMNNm, .+>?1.
# JMMMMMMMMK>?????>??>??>?>???<<_(+_ (,?HMMMMMMMMMMMMMMMMMMMMMMMMm. ` `
# (MMMMMMMMN+?>>?>??>?>????<<_(;::<_Jyyx?rttrZVVHMMMMMMMMMMMMMMMMMb ...-....... .... ..-....... .... ...
# .MMMMMMMMNy?>?>?>????<<~_(;::;:;!.Xyyy+(rrtrtrttrrZUWMMMMMMMMMMMM; _.vrOOOOOwvO+. ~(rrw_ _jrrOOOOrvO- - jv> _ wv:
# dMMMMMMMMN+??????<<~-(;;::;;:;< jVyyyWo(trtrrtrtttrtrwMMMMMMMMMM] _.vZ~ ~_zvI. ..wrrvl _jv> ~?Oro -`jr> ~ Ov:
# .MMMMMMMMMR>??<<_-(;;::;;:;:;;!.XyyyyyWo(OrttrtrrtrttrdMMMMMMMMM\ _.vZ_ ~.vv> .~jvOOvr- _jv{ ~(vr_-`jv> ~ Or:
# (MMMMMMMMMC!_-(;;::;:;::;:;;< dVyyyyyyy+(OrrtrtrrtrtrdMMMMMMMMM! _.vZ_ ~.vr: _.vI`~(vI. _jv{ ~-vr!-`jv> _ wr:
# ?MMMMM#5uJ+;;;;:;;:;:;:;::;~.XyyyyyyyyV+(OrtrttrtrrdMMMMMMMMM@ _.vw- ..-(rr> ._zv: -zv: _jvl ..(zvC -`jvO((((J+Jrv:
# ?YY1(gMMMMN+::;:;:;:;;:;;< dyyyyyyyyyyW+.OrtrrtrwdMMMMMMMMMM\ _.vrrrrrrrZ<` _(vI ~(rO. _jrrrrrrvOC! -`jrOCCCCOCOrr:
# dMMMMMMMMNm+;::;:;::;:;`.VyyyyyyyyyyyWo.OrttrQMMMMMMMMMMMF _.vO><~jrw_ .-wrrOzzzwrvl _jvZ!!!~` -`jv> ~ Ov: . d=7n v=7h .d=7h.
# ?MMMMMMMMMMMmx+;:;:;:;< dyyyyyyyyyyyyVy{.zrQNMMMMMMMMMMMF _.vZ_ -.?rw- _(vZ<<<<<71ww_ _jv{ -`jv> ~ Or: (h (3dIJR.W=! .(= .(= ,$ d{
# .TMMMMMMMMMMMMNma+<;<`(yyyyyyyyyyyyyyyV{.dMMMMMMMMMMMMD _.vZ_ _?wr- _.rZ` _jvl _jv{ -`jv> ~ Or: (m$ 4,.,.V .,.(R-... .R-. ..W..f`
# (TMMMMMMMMMMMMMMMN;.dkkWWWWWWkQQQNNMMMm(MMMMMMMMMM#^ _.vZ_ _(wv+ ._jv> __Ov- _jr{ -`jv> ~ Or: `
# .TMMMMMMMMMMMMMM<dMMMMMMMMMMMMMMMMMMMN,HMMMMMM#= _.vZ_ _.Oro._.rZ` _(rI._jv{ -`jv> ~ Ov:
# _THMMMMMMMMMF(MMMMMMMMMMMMMMMMMMMMMN,WMMMD! _.CC` ~.7C`~?C! _7C`_?C! _?7! _.?C!
# _?TMMMMM1MMMMMMMMMMMMMMMMMMMMMMMF `
# ` THMMMMMMMMMMMMMMMB9""!`
import sys
input = sys.stdin.readline
from operator import itemgetter
sys.setrecursionlimit(10000000)
def main():
n = int(input().strip())
ans = 0
for i in range(1, n):
j = n - i
if i == j:
continue
ans += 1
print(ans // 2)
if __name__ == '__main__':
main()
|
N, X, M = map(int, input().split())
pt = [[0] * (M+100) for i in range(70)]
to = [[0] * (M+100) for i in range(70)]
for i in range(M+1):
to[0][i] = (i*i) % M
pt[0][i] = i
for i in range(65):
for j in range(M+1):
to[i+1][j] = to[i][to[i][j]]
pt[i+1][j] = pt[i][j] + pt[i][to[i][j]]
ans = 0
for i in range(60):
if (N>>i)&1:
ans += pt[i][X]
X = to[i][X]
print(ans)
| 0 | null | 77,774,949,725,210 | 283 | 75 |
n = int(input())
t_p = 0
h_p = 0
for i in range(n):
taro, hana = [i for i in input().split()]
if taro > hana:
t_p += 3
elif taro == hana:
t_p += 1
h_p += 1
else:
h_p += 3
print(f'{t_p} {h_p}')
|
point_t = 0
point_h = 0
n = int(input())
for i in range(n):
card_t, card_h = input().split()
if card_t > card_h:
point_t += 3
if card_t < card_h:
point_h += 3
if card_t == card_h:
point_t += 1
point_h += 1
print(point_t, point_h)
| 1 | 1,982,411,542,968 | null | 67 | 67 |
import sys
input = sys.stdin.readline
class Dice:
"""
0:top, 1:south, 2:east, 3:west, 4:north, 5:bottom
"""
def __init__(self, surfaces):
self.surface = surfaces
def roll(self, direction: str):
if direction == "E":
self.surface = [self.surface[3], self.surface[1], self.surface[0],
self.surface[5], self.surface[4], self.surface[2]]
elif direction == "N":
self.surface = [self.surface[1], self.surface[5], self.surface[2],
self.surface[3], self.surface[0], self.surface[4]]
elif direction == "S":
self.surface = [self.surface[4], self.surface[0], self.surface[2],
self.surface[3], self.surface[5], self.surface[1]]
elif direction == "W":
self.surface = [self.surface[2], self.surface[1], self.surface[5],
self.surface[0], self.surface[4], self.surface[3]]
return
def get_top(self):
return self.surface[0]
def main():
surface = [int(i) for i in input().strip().split()]
spins = input().strip()
dice = Dice(surface)
for d in spins:
dice.roll(d)
print(dice.get_top())
if __name__ == "__main__":
main()
|
n = input()
sum = 0;
for i in n:
sum += int(i)
if sum % 9 == 0:
print('Yes')
else:
print('No')
| 0 | null | 2,350,165,815,008 | 33 | 87 |
# -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from fractions import Fraction
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutations, accumulate
from operator import add, mul, sub, itemgetter, attrgetter
import sys
# sys.setrecursionlimit(10**6)
# readline = sys.stdin.buffer.readline
readline = sys.stdin.readline
INF = 2**62-1
def read_int():
return int(readline())
def read_int_n():
return list(map(int, readline().split()))
def read_float():
return float(readline())
def read_float_n():
return list(map(float, readline().split()))
def read_str():
return readline().strip()
def read_str_n():
return readline().strip().split()
def ep(*args):
print(*args, file=sys.stderr)
def mt(f):
import time
def wrap(*args, **kwargs):
s = time.perf_counter()
ret = f(*args, **kwargs)
e = time.perf_counter()
ep(e - s, 'sec')
return ret
return wrap
@mt
def slv(N, U, V, AB):
g = defaultdict(list)
for a, b in AB:
g[a].append(b)
g[b].append(a)
def dfs(u):
s = [u]
d = {u: 0}
while s:
u = s.pop()
for v in g[u]:
if v in d:
continue
d[v] = d[u] + 1
s.append(v)
return d
du = dfs(U)
dv = dfs(V)
ans = 0
for v in sorted(du.keys()):
if du[v] < dv[v]:
ans = max(ans, dv[v] - 1)
return ans
def main():
N, U, V = read_int_n()
AB = [read_int_n() for _ in range(N-1)]
print(slv(N, U, V, AB))
if __name__ == '__main__':
main()
|
A,B=input().split()
A=int(A)
B=100*int(B[0])+10*int(B[2])+int(B[3])
print(A*B//100)
| 0 | null | 66,697,932,671,100 | 259 | 135 |
bun=input()
for i in range(int(input())):
o=input().split()
o[1],o[2]=int(o[1]),int(o[2])
if o[0]=='print':
print(bun[o[1]:o[2]+1])
elif o[0]=='reverse':
bun_bun=bun[o[1]:o[2]+1]
bun_bun=bun_bun[::-1]
bun=bun.replace(bun[o[1]:o[2]+1],bun_bun)
elif o[0]=='replace':
bun=bun[:(o[1])]+o[3]+bun[(o[2]+1):]
|
s = str(input())
q = int(input())
for i in range(q):
arr = list(map(str, input().split()))
c = arr[0]
n1 = int(arr[1])
n2 = int(arr[2])
if c == 'print':
print(s[n1:n2 + 1])
if c == 'replace':
s = s[0:n1] + arr[3] + s[n2 + 1:len(s)]
if c == 'reverse':
l = n2 - n1 + 1
reverse = ''
for i in range(l):
reverse += s[n2 - i]
s = s[0:n1] + reverse + s[n2 + 1:len(s)]
| 1 | 2,085,393,292,320 | null | 68 | 68 |
# https://atcoder.jp/contests/abc150/tasks/abc150_d
import math,itertools,fractions,heapq,collections,bisect,sys,queue,copy
sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def LS(): return sys.stdin.readline().split()
def S(): return input()
# GCD -- START --
def gcd(x,y):
while y:
x,y=y,x%y
return x
# GCD --- END ---
# LCM -- START --
def lcm(x,y):
return x*y//gcd(x,y)
# LCM --- END ---
def f(x):
a=0
while x%2==0:
x//=2
a+=1
return a
def main():
n,m=LI()
_l=LI()
l=[x//2 for x in _l]
t=f(l[0])
for i in range(n):
b=l[i]
if t!=f(b):
return 0
l[i]>>=t
m>>=t
_lcm=1
for x in l:
_lcm=lcm(_lcm,x)
if _lcm>m:
return 0
# print(m,_lcm)
m//=_lcm
return (m+1)//2
# main()
print(main())
|
def resolve():
k,n = map(int,input().split())
a = list(map(int,input().split()))
l = a[0]+k-a[-1]
for i in range(1,n):
l = max(l,a[i]-a[i-1])
print(k-l)
resolve()
| 0 | null | 72,705,297,115,472 | 247 | 186 |
mod=10**9+7
import math
import sys
from collections import deque
import heapq
import copy
import itertools
from itertools import permutations
from itertools import combinations
import bisect
def mi() : return map(int,sys.stdin.readline().split())
def ii() : return int(sys.stdin.readline().rstrip())
def i() : return sys.stdin.readline().rstrip()
a,b=mi()
if (a+b)%3!=0:
print(0)
sys.exit()
s=(a+b)//3
a-=s
b-=s
if a<0 or b<0:
print(0)
sys.exit()
fac=[1]*700000
for i in range(1,700000):
fac[i]=(fac[i-1]*i)%mod
m=a+b
n=min(a,b)
c=1
for j in range(m,m-n,-1):
c*=j
c=c%mod
print((c*pow(fac[n],mod-2,mod))%mod)
|
s=input()
li=list(s)
adana_li=[]
for i in range(3):
adana_li.append(li[i])
adana=li[0]+li[1]+li[2]
print(adana)
| 0 | null | 82,432,532,824,640 | 281 | 130 |
a,b=map(int,input().split())
dic={1:3*10**5,2:2*10**5,3:1*10**5}
c=0
if a in dic and b in dic:
if a==1 and b==1:
c+=dic[a]+dic[b]+4*10**5
print(c)
else:
c+=dic[a]+dic[b]
print(c)
elif a in dic and b not in dic:
c+=dic[a]
print(c)
elif b in dic and a not in dic:
c+=dic[b]
print(c)
else:
print(c)
|
X,Y=map(int,input().split())
if X==Y==1: print(10**6)
else: print((max(0,4-X)+max(0,4-Y))*10**5)
| 1 | 140,573,104,806,562 | null | 275 | 275 |
from sys import stdin
nii=lambda:map(int,stdin.readline().split())
lnii=lambda:list(map(int,stdin.readline().split()))
n=int(input())
l1=[]
l2=[]
for i in range(n):
a,b=nii()
l1.append(a)
l2.append(b)
l1.sort()
l2.sort()
if n%2==1:
ans=l2[n//2]-l1[n//2]
else:
m1=(l2[n//2]+l2[n//2-1])
m2=(l1[n//2]+l1[n//2-1])
ans=m1-m2
print(ans+1)
|
def med(l):
t = len(l)
if t%2:
return l[t//2]
else: return (l[t//2]+l[t//2-1])/2
n = int(input())
a = []
b = []
for i in range(n):
x,y = map(int,input().split())
a+=[x]
b+=[y]
a.sort()
b.sort()
if n%2==0:
print(int((med(b)-med(a))*2)+1)
else:
print(med(b)-med(a)+1)
| 1 | 17,252,954,612,962 | null | 137 | 137 |
class UnionFind:
def __init__(self, n):
self.n = n
self.par = [i for i in range(n+1)] # �?要�?の親要�?の番号を�?�納するリス�?
self.rank = [0] * (n+1)
self.size = [1] * (n+1) # 根?��ルート）�?�場合、そのグループ�?�要�?数を�?�納するリス�?
# 要�? x が属するグループ�?�根を返す
def find(self, x):
if self.par[x] == x:
return x
else:
self.par[x] = self.find(self.par[x])
return self.par[x]
# 要�? x が属するグループと要�? y が属するグループとを併合す�?
def union(self, x, y):
x = self.find(x)
y = self.find(y)
if x == y:
return
if self.rank[x] < self.rank[y]:
self.par[x] = y
self.size[y] += self.size[x]
else:
self.par[y] = x
self.size[x] += self.size[y]
if self.rank[x] == self.rank[y]:
self.rank[x] += 1
# 要�? x, y が同じグループに属するかど�?かを返す
def same_check(self, x, y):
return self.find(x) == self.find(y)
# 要�? x が属するグループに属する要�?をリストで返す
def members(self, x):
root = self.find(x)
return [i for i in range(1,self.n+1) if self.find(i) == root]
# 要�? x が属するグループ�?�サイズ?��要�?数?��を返す
def get_size(self, x):
return self.size[self.find(x)]
# すべての根の要�?をリストで返す
def roots(self):
return [i for i, x in enumerate(self.par) if x == i and i != 0]
# グループ�?�数を返す
def group_count(self):
return len(self.roots())
# {ルート要�?: [そ�?�グループに含まれる要�?のリス�?], ...} の辞書を返す
def all_group_members(self):
return {r: self.members(r) for r in self.roots()}
n,m = map(int,input().split())
uf = UnionFind(n)
for i in range(m):
a,b = map(int,input().split())
uf.union(a,b)
print(len(uf.roots())-1)
|
N, M = map(int, input().split())
t = [-1] * N
import sys
sys.setrecursionlimit(10 ** 9)
root = [-1] * N
def parent(x):
if root[x] < 0:
return x
root[x] = parent(root[x])
return root[x]
def union(x, y):
x_parent = parent(x)
y_parent = parent(y)
if x_parent == y_parent:
return
root[x_parent] += root[y_parent]
root[y_parent] = x
for i in range(M):
a,b = map(int, input().split())
union(a-1,b-1)
ans = -1
for i in root:
if i < 0:
ans += 1
print(ans)
| 1 | 2,281,295,160,608 | null | 70 | 70 |
import sys
import itertools
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)
H,W = map(int,readline().split())
grid = ''
grid += '#'* (W+2)
for _ in range(H):
grid += '#' + readline().decode().rstrip() + '#'
grid += '#'*(W+2)
L = len(grid)
INF = float('inf')
def bfs(start):
dist = [-INF] * L
q = [start]
dist[start] = 0
while q:
qq = []
for x,dx in itertools.product(q,[1,-1,W+2,-W-2]):
y = x+dx
if dist[y] != -INF or grid[y] == '#':
continue
dist[y] = dist[x] + 1
qq.append(y)
q = qq
return max(dist)
ans = 0
for i in range(L):
if grid[i] == '.':
start = i
max_dist = bfs(start)
ans = max(ans,max_dist)
print(ans)
|
c = []
def listcreate():
global c
c = []
for y in range(a[0]):
b = []
for x in range(a[1]):
if y == 0 or y == a[0]-1 or x == 0 or x == a[1]-1:
b.append("#")
else:
b.append(".")
c.append(b)
return
def listdraw():
global c
for y in range(len(c)):
for x in range(len(c[0])):
print(c[y][x], end='')
print()
return
for i in range(10000):
a = list(map(int,input().split()))
if sum(a)==0:
break
listcreate()
listdraw()
print()
| 0 | null | 47,888,702,942,730 | 241 | 50 |
# author: Taichicchi
# created: 12.09.2020 17:49:24
from itertools import permutations
import sys
N = int(input())
P = int("".join(input().split()))
Q = int("".join(input().split()))
perm = permutations([str(i) for i in range(1, N + 1)], N)
ls = []
for i in perm:
ls.append(int("".join(i)))
print(abs(ls.index(P) - ls.index(Q)))
|
n=int(input())
P=[int(x) for x in input().split()]
Q=[int(x) for x in input().split()]
p=tuple(P)
q=tuple(Q)
l=list(range(1,n+1))
L=[]
import itertools
for v in itertools.permutations(l):
L.append(v)
a=L.index(p)
b=L.index(q)
print(abs(a-b))
| 1 | 100,826,384,540,242 | null | 246 | 246 |
import time
MOD = 10 ** 9 + 7
K = int(input())
S = input()
l = len(S)
fac = [1] * (K + l + 1)
invfac = [1] * (K + l + 1)
for i in range(1, K + l + 1):
fac[i] = (fac[i - 1] * i) % MOD
invfac[i] = pow(fac[i], MOD - 2, MOD)
p25 = [1] * (K + 1)
p26 = [1] * (K + 1)
for i in range(1, K + 1):
p25[i] = (p25[i - 1] * 25) % MOD
p26[i] = (p26[i - 1] * 26) % MOD
ans = 0
for en in range(l - 1, l + K):
t = (fac[en] * invfac[en - l + 1]) % MOD
t = (t * invfac[l - 1]) % MOD
t = (t * p25[en - l + 1]) % MOD
t = (t * p26[l + K - 1 - en]) % MOD
ans = (ans + t) % MOD
print(ans)
|
#!python3
import sys
iim = lambda: map(int, sys.stdin.readline().rstrip().split())
def _cmb(N, mod):
N1 = N + 1
fact = [1] * N1
inv = [1] * N1
for i in range(2, N1):
fact[i] = fact[i-1] * i % mod
inv[N] = pow(fact[N], mod-2, mod)
for i in range(N-1, 1, -1):
inv[i] = inv[i+1]*(i+1) % mod
def cmb(a, b):
return fact[a] * inv[b] * inv[a-b] % mod
return cmb
def resolve():
K = int(input())
s = input()
ls = len(s) - 1
mod = 10**9+7
cmb = _cmb(ls+K, mod)
ans = 0
p25 = 1
p26 = pow(26, K, mod)
p26inv = pow(26, mod-2, mod)
for i in range(K+1):
ans += cmb(ls+i, ls) * p25 * p26
ans %= mod
p25 = p25 * 25 % mod
p26 = p26 * p26inv % mod
print(ans)
if __name__ == "__main__":
resolve()
| 1 | 12,792,089,376,000 | null | 124 | 124 |
from collections import OrderedDict
from itertools import cycle, islice
d = OrderedDict(("{} {} {}".format(b, f, r), 0) for b in range(1, 5)
for f in range(1, 4)
for r in range(1, 11))
n = int(input())
for _ in range(n):
s = input()
idx = s.rfind(" ")
d[s[:idx]] += int(s[idx+1:])
data = d.values()
delim = "#" * 20
for i in range(0, 120, 10):
print(" " + " ".join(map(str, islice(cycle(data), i, i+10))))
if i in (20, 50, 80):
print(delim)
|
n =int(input())
S = [[[0 for i in range(10)] for j in range(3)] for k in range(4)]
for i in range(n):
b, f, r, v = map(int, input().split())
S[b-1][f-1][r-1] += v
for i in range(4):
for j in range(3):
for k in range(10):
print(" " + str(S[i][j][k]), end = "")
print("")
if i == 3:
break
print("####################")
| 1 | 1,123,033,048,500 | null | 55 | 55 |
N, M = map(int, input().split())
A = sorted(list(map(int,input().split())), reverse=True)
# jとの組み合わせがx以上になるiの個数
def combinations(x):
s = 0
i = 0
for j in reversed(range(N)):
while i<N and A[i]+A[j]>=x:
i += 1
s += i
return s
#↑のような組み合わせの合計幸福度
def koufukudo(x):
s = 0
si = 0
i = 0
for j in reversed(range(N)):
while i<N and A[i]+A[j]>=x:
si += A[i]
i += 1
s += si + A[j]*i
return s
#
def bsearch(l, u):
m = (l+u)//2
c = combinations(m)
# print(f"m{m}, c{c},c-M{c-M}")
if c<M:
return bsearch(l, m)
else:
if l==m:
return (l, c-M)
return bsearch(m, u)
x, dm = bsearch(0, A[0]*2+1)
print(koufukudo(x)-dm*x)
|
#Greatest Common Diveser
def gcd(x, y):
if x >= y:
x = x % y
if x == 0:
return y
return gcd(x, y)
else:
y = y % x
if y == 0:
return x
return gcd(x, y)
x, y = map(int, input().split())
print(gcd(x, y))
| 0 | null | 54,151,586,829,350 | 252 | 11 |
#a = list(map(int,input().split()))
#b = list(map(int,input().split()))
a = int(input())
x = int(100)
count= 0
while a > x:
count+=1
x += x//100
print(count)
|
N = int(input())
if (N%2 == 1):
print(0)
elif N == 0:
print(0)
else:
N //= 2
res = 0
div_coef = 1
while True:
tmp_add = N // (5 ** div_coef)
res += int(tmp_add)
div_coef += 1
# print(int(tmp_add))
if tmp_add < 1:
break
# print(N)
print(int(res))
| 0 | null | 71,563,431,449,680 | 159 | 258 |
import sys
N, K = map(int, input().split())
if K == 10:
print(len(str(N)))
sys.exit()
p = 0
while True:
num = K ** p
if N < num:
break
p += 1
print(p)
|
n=input()
data=input().split()
data.reverse()
print(' '.join(data))
| 0 | null | 32,571,425,633,852 | 212 | 53 |
print(*sorted(map(int,input().split())))
|
def gcd(a, b):
return b if a % b == 0 else gcd(b, a % b)
def lcm(a, b):
return a // gcd(a, b) * b
a, b = map(int, input().split())
print(lcm(a, b))
| 0 | null | 57,147,388,293,620 | 40 | 256 |
def update(A,N):
B=[0 for i in range(N+1)]
for i in range(N):
l = max(0,i-A[i])
r = min(N,i+A[i]+1)
B[l]+=1
B[r]-=1
x = A[0] == B[0]
A[0]=B[0]
for i in range(1,N):
B[i]+=B[i-1]
x = x and A[i] == B[i]
A[i]=B[i]
return x
def resolve():
N,M = map(int,input().split())
A = list(map(int,input().split()))
for i in range(M):
x=update(A,N)
if x:
break
print(" ".join(map(str,A)))
resolve()
|
import math
a,b,c = [int(x) for x in input().split()]
c = math.radians(c)
s = a * b * math.sin(c) / 2
l = a + b + math.sqrt(a**2 + b**2 - 2*a*b*math.cos(c))
h = 2 * s / a
for i in [s,l,h]:
print('{:.12f}'.format(i))
| 0 | null | 7,765,986,333,340 | 132 | 30 |
N = int(input())
r, mod = divmod(N, 2)
print(r - 1 + mod)
|
# -*- coding: utf-8 -*-
def main():
from math import ceil
n = int(input())
count = 0
for i in range(1, ceil(n / 2)):
j = n - i
if i != j:
count += 1
print(count)
if __name__ == '__main__':
main()
| 1 | 153,488,593,619,968 | null | 283 | 283 |
import numpy as np
from numba import njit
@njit #処理の並列化
def imos(n,k,a):
l=np.zeros((n+1),dtype=np.int64)
for i in range(n):
ai=a[i]
start=max(0,i-ai) #StartIndex
end=min(n,i+ai+1) #EndIndex + 1
l[start]+=1
l[end]-=1
return np.cumsum(l)[:n]
if __name__=="__main__":
n,k=map(int, input().split())
a=list(map(int, input().split()))
for _ in range(k):
a=imos(n,k,a)
if a.min()==n:
break
print(*a)
|
N,K = map(int,input().split())
A = list(map(int,input().split()))
R = [N]*N
def update(A):
b = [0]*N
for i,a in enumerate(A):
l = max(0,i-a)
r = min(N-1,i+a)
b[l] += 1
if r+1 < N:
b[r+1] -= 1
res = []
s = 0
for i in b:
s += i
res.append(s)
return res
for _ in range(K):
A = update(A)
if A == R:
break
print(*A)
| 1 | 15,425,029,720,660 | null | 132 | 132 |
N,K = map(int, input().split())
A = [0] + list(map(int, input().split()))
for i in range(K+1, N+1):
if A[i-K] >= A[i]:
print('No')
else:
print('Yes')
|
def main():
n, k = [int(x) for x in input().split()]
scores = [int(x) for x in input().split()]
for index in range(n - k):
if scores[index] < scores[index + k]:
print('Yes')
else:
print('No')
if __name__ == '__main__':
main()
| 1 | 7,021,537,445,534 | null | 102 | 102 |
from collections import Counter
n = int(input())
a = sorted(map(int, input().split()))
c = Counter(a)
s = set()
for i in range(n):
if a[i] in s:
continue
elif c[a[i]] >= 2:
s.add(a[i])
for j in range(2,10**6//a[i]+1):
s.add(a[i]*j)
print(sum(not (ai in s) for ai in a))
|
#!/usr/bin/env python3
import sys
def input(): return sys.stdin.readline().rstrip()
def main():
n=int(input())
A=list(map(int, input().split()))
counts=[0]*(10**6+5)
for AA in A:
counts[AA]+=1
ans=0
for i in range(1,10**6+5):
if counts[i]>0:
for j in range(i+i,10**6+5,i):
counts[j]=-1
if counts[i]==1:
ans+=1
print(ans)
if __name__ == '__main__':
main()
| 1 | 14,354,670,378,478 | null | 129 | 129 |
num = int(input())
A=list(map(int,input().split(" ")))
chg = 0
for i in range(num-1):
minv = i+1
for j in range(i+2,num):
if A[minv] > A[j]:
minv = j
if A[i] > A[minv]:
A[i],A[minv] = A[minv],A[i]
chg += 1
print(*A)
print(chg)
|
def selectionSort(lst, n):
cnt = 0
for i in range(0, n):
minj = i
for j in range(i, n):
if lst[j] < lst[minj]:
minj = j
if i != minj:
tmp = lst[i]
lst[i] = lst[minj]
lst[minj] = tmp
cnt += 1
return (lst, cnt)
if __name__ == "__main__":
n = int(input())
lst = [int(n) for n in input().split()]
result, cnt = selectionSort(lst, n)
print(" ".join(str(n) for n in result))
print(cnt)
| 1 | 20,128,464,950 | null | 15 | 15 |
X,Y = map(int,input().split())
for i in range(2*X):
for j in range(2*X):
if i+j == X and 2*i+4*j == Y:
print("Yes")
exit()
else:
print("No")
|
x, y = map(int, input().split())
ans = 0
for i in range(x+1):
if 2 * i + 4*(x-i) == y:
ans = 1
print('Yes' if ans == 1 else 'No')
| 1 | 13,662,841,844,830 | null | 127 | 127 |
N, T = map(int, input().split())
# 1-index
A = [0]
B = [0]
for _ in range(N):
a, b = map(int, input().split())
A.append(a)
B.append(b)
# dp1[i][j] 1 ~ i の料理で j 分以内に完食できる美味しさの合計の最大値
# dp2[i][j] i ~ N の料理で j 分以内に〃
# max(DP1[i − 1][j] + DP2[i + 1][T − 1 − j]) i番目以外で T - 1 以内
dp1 = [[0] * T for _ in range(N+2)]
dp2 = [[0] * T for _ in range(N+2)]
for i in range(1, N+1):
for j in range(T):
dp1[i][j] = dp1[i-1][j]
if j - A[i] >= 0:
dp1[i][j] = max(dp1[i][j], dp1[i-1][j - A[i]] + B[i])
for i in range(N, 0, -1):
for j in range(T):
dp2[i][j] = dp2[i+1][j]
if j - A[i] >= 0:
dp2[i][j] = max(dp2[i][j], dp2[i+1][j - A[i]] + B[i])
ans = 0
for i in range(1, N+1):
for j in range(T):
ans = max(ans, dp1[i-1][j] + B[i] + dp2[i+1][T - 1 - j])
print(ans)
|
from subprocess import*
call(('pypy3','-c',"""
n,t=[int(j) for j in input().split()]
ab=[]
ans=[]
dp=[0]*t
for i in range(n):
tmp=[int(j) for j in input().split()]
ab.append(tmp)
ab.sort()
for a,b in ab:
for i in range(t)[::-1]:
if dp[i]!=0 or i==0:
if i+a>=t:
ans.append(dp[i]+b)
else:
dp[i+a]=max(dp[i+a],dp[i]+b)
if ans:
print(max(ans))
else:
print(max(dp))
"""))
| 1 | 151,960,245,104,810 | null | 282 | 282 |
while 1 :
try:
h,w=map(int,input().split())
#print(h,w)
if( h==0 and w==0 ):
break
else:
for hi in range(h):
print("#" * w)
print() #??????
if( h==0 and w==0 ): break
except (EOFError):
#print("EOFError")
break
|
h,w,k=map(int,input().split())
cnt=1
ss=[input() for i in range(h)]
ans=[[0 for i in range(w)]for f in range(h)]
misyori=0
for ok in range(h):
s=ss[ok]
if set(s)!=set("."):
v=[gg for gg in range(w) if s[gg]=="#"]
l=[0]*w
for k in v[:-1]:
l[k+1]=1
l[0]=cnt
for i in range(1,w):
l[i]+=l[i-1]
for tate in range(misyori,ok+1):
ans[tate]=l
misyori=ok+1
cnt+=len(v)
for t in range(misyori,h):
ans[t]=l
for i in range(h):
print(*ans[i],sep=" ")
| 0 | null | 72,069,503,198,340 | 49 | 277 |
n = int(input()[-1])
if n in [2, 4, 5, 7, 9]:
print('hon')
elif n in [0, 1, 6, 8]:
print('pon')
else:
print('bon')
|
int = int(input())
dev = int % 10
if dev==3:
print("bon")
elif dev==0 or dev==1 or dev==6 or dev==8:
print("pon")
else:
print("hon")
| 1 | 19,272,060,575,108 | null | 142 | 142 |
n,a,b=map(int, input().split())
if (b-a)%2==0:
print((b-a)//2)
else:
print(min(a+(b-a-1)//2, n-b+1+(b-a-1)//2))
|
n, a, b = [int(i) for i in input().split()]
a_distance = a-1
b_distance = n-b
ab_distance = b - a
if ab_distance % 2 == 0:
result = ab_distance//2
else:
if a_distance < b_distance:
result = a_distance + (ab_distance-1)//2 + 1
else:
result = b_distance + (ab_distance-1)//2 + 1
print(result)
| 1 | 109,380,565,363,040 | null | 253 | 253 |
'''
研究室PCでの解答
'''
import math
#import numpy as np
import queue
import bisect
from collections import deque,defaultdict
import heapq as hpq
from sys import stdin,setrecursionlimit
#from scipy.sparse.csgraph import dijkstra
#from scipy.sparse import csr_matrix
ipt = stdin.readline
setrecursionlimit(10**7)
mod = 10**9+7
def main():
x,y = map(int,ipt().split())
#nCrをmodで割った余りを求める。Nに最大値を入れて使用。
N = 7*10**5
g1 = [1, 1] # 元テーブル
g2 = [1, 1] #逆元テーブル
inverse = [0, 1] #逆元テーブル計算用テーブル
def cmb(n,r,mod=(10**9+7)):
if r<0 or r>n :
return 0
r = min(r,n-r)
return g1[n]*g2[r]*g2[n-r]%mod
for i in range(2,N+1):
g1.append((g1[-1]*i)%mod)
inverse.append((-inverse[mod % i]*(mod//i))%mod)
g2.append((g2[-1]*inverse[-1])%mod)
if (2*x-y)%3 == 0 and 2*x-y >= 0 and (2*y-x)%3 == 0 and 2*y-x >= 0:
print(cmb((x+y)//3,(2*x-y)//3))
else:
print(0)
return None
if __name__ == '__main__':
main()
|
n=int(input())
s=list()
for i in range(n):
s.append(input())
import collections
c=collections.Counter(s)
l=list()
max_=0
for cc in c.values():
max_=max(cc, max_)
for ca,cb in c.items():
if max_==cb:
l.append(ca)
l.sort()
for ll in l:
print(ll)
| 0 | null | 109,806,513,875,742 | 281 | 218 |
import numpy as np
import itertools
N = int(input())
info = []
for i in range(N):
A = int(input())
for _ in range(A):
x,y = map(int,input().split())
info.append((i,x-1,y))
A = np.array(list(itertools.product([0,1],repeat=N)),np.bool)
for i,x,y in info:
bl = (~A[:,i]) | (A[:,x] == bool(y))
A = A[bl]
answer = A.sum(axis = 1).max()
print(answer)
|
def gcd(a,b):
if b==0:
return a
else:
return gcd(b,a%b)
mod=10**9+7
n=int(input())
dic={}
cnt=0
for _ in range(n):
a,b=map(int,input().split())
if a!=0 and b!=0:
g=gcd(abs(a),abs(b))
if a*b>0:
if (abs(a)//g,abs(b)//g) not in dic:
dic[(abs(a)//g,abs(b)//g)]=1
else:
dic[(abs(a)//g,abs(b)//g)]+=1
else:
if (-abs(a)//g,abs(b)//g) not in dic:
dic[(-abs(a)//g,abs(b)//g)]=1
else:
dic[(-abs(a)//g,abs(b)//g)]+=1
else:
if a==0 and b==0:
cnt+=1
elif a==0:
if (1,0) not in dic:
dic[(1,0)]=1
else:
dic[(1,0)]+=1
elif b==0:
if (0,1) not in dic:
dic[(0,1)]=1
else:
dic[(0,1)]+=1
ans=1
s=set()
for a,b in dic.keys():
if (a,b) in s:
continue
s.add((a,b))
if a!=0 and b!=0:
if a>0:
if (-b,a) in dic:
s.add((-b,a))
cnt1=dic[(a,b)]
cnt2=dic[(-b,a)]
ans*=(pow(2,cnt1,mod)+pow(2,cnt2,mod)-1)%mod
ans%=mod
else:
ans*=pow(2,dic[(a,b)])
ans%=mod
elif a<0:
if (b,-a) in dic:
s.add((b,-a))
cnt1=dic[(a,b)]
cnt2=dic[(b,-a)]
ans*=(pow(2,cnt1,mod)+pow(2,cnt2,mod)-1)%mod
ans%=mod
else:
ans*=pow(2,dic[(a,b)],mod)
ans%=mod
else:
if (b,a) in dic:
s.add((b,a))
cnt1=dic[(a,b)]
cnt2=dic[(b,a)]
ans*=(pow(2,cnt1,mod)+pow(2,cnt2,mod)-1)%mod
ans%=mod
else:
ans*=pow(2,dic[(a,b)],mod)
ans%=mod
print((ans+cnt-1)%mod)
| 0 | null | 71,016,805,453,760 | 262 | 146 |
import sys
stdin=sys.stdin
ip=lambda: int(sp())
fp=lambda: float(sp())
lp=lambda:list(map(int,stdin.readline().split()))
sp=lambda:stdin.readline().rstrip()
yp='Yes'
np='No'
s=sp()
t=sp()
l=len(s)
if s[0:l]==t[0:l]:
print(yp)
else:
print(np)
|
j = []
for i in range(10) :
j.append(int(input()))
j.sort(reverse = True)
for k in range(3) :
print(j[k])
| 0 | null | 10,712,019,464,958 | 147 | 2 |
'''
ITP-1_8-B
??°?????????
?????????????????°???????????????????¨??????????????????°?????????????????????????????????
???Input
?????°??????????????????????????\?????¨??????????????????????????????????????????????????????????????´??° x ?????????????????§?????????????????????
x ??? 1000 ?????\????????´??°??§??????
x ??? 0 ?????¨?????\?????????????????¨??????????????????????????????????????????????????????????????£????????????????????????
???Output
????????????????????????????????????x ???????????????????????????????????????????????????
'''
while True:
# inputData
inputData = input()
if inputData == '0':
break
# outputData
outputData = 0
for cnt0 in inputData:
outputData += int(cnt0)
print(outputData)
|
k=int(input())
if k%2==0 or k%5==0:
print(-1)
exit()
ans=1
num=7
while num%k!=0:
num=10*num+7
num%=k
ans+=1
print(ans)
| 0 | null | 3,814,060,795,910 | 62 | 97 |
a=input()
l=a.split(" ")
b=l.index("0")
print(b+1)
|
x = list(map(int,input().split()))
i = 0
while (x[i] != 0):
i+=1
print(i+1)
| 1 | 13,432,163,112,510 | null | 126 | 126 |
import math
N, K = map(int, input().split())
A = [int(x) for x in input().split()]
left, right = 0, max(A)
while right - left > 1:
mid = (left + right) // 2
res = 0
for i in range(N):
res = res + math.ceil(A[i]/mid) - 1
if res <= K:
right = mid
else:
left = mid
print(right)
|
l = map(int, raw_input().split())
print l[0] * l[1],
print l[0] *2 + l[1] * 2
| 0 | null | 3,433,868,272,900 | 99 | 36 |
S = input()
T = input()
num = 0
length = len(S)
for i in range(length):
if S[i] != T[i]:
num += 1
print(num)
|
str1 = input()
str2 = input()
idx = 0
cnt = 0
for _ in range(len(str1)):
if str1[idx] != str2[idx]:
cnt += 1
idx += 1
print(cnt)
| 1 | 10,356,332,164,108 | null | 116 | 116 |
# E - Payment
N = input().strip()
s = 0
carry = 0
five = False
for c in reversed(N):
x = int(c) + carry
if x == 5 and not five:
s += x
carry = 0
five = True
elif x >= 5:
if five:
x += 1
s += 10 - x
carry = 1
five = False
else:
s += x
carry = 0
five = False
s += carry
print(s)
|
from collections import Counter
N = int(input())
A = list(map(int, input().split()))
Q = int(input())
su = sum(A)
counter = Counter(A)
lis = {}
for i in range(Q):
B, C = map(int, input().split())
su -= B * counter[B]
su += C * counter[B]
counter[C] += counter[B]
counter[B] = 0
print(su)
| 0 | null | 41,747,500,481,130 | 219 | 122 |
import bisect
X, N = map(int, input().split())
P = set(map(int, input().split()))
A = {i for i in range(102)}
S = list(A - P)
T = bisect.bisect_left(S, X)
if T == 0:
print(S[0])
elif X - S[T-1] > S[T] - X:
print(S[T])
else:
print(S[T-1])
|
import math
A,B,C,D=map(int,input().split())
print("Yes" if math.ceil(A/D) >= math.ceil(C/B) else "No")
| 0 | null | 21,864,094,022,094 | 128 | 164 |
import heapq
import sys
input = sys.stdin.readline
def dijkstra_heap(s,edge,n):
#始点sから各頂点への最短距離
d = [10**20] * n
used = [True] * n #True:未確定
d[s] = 0
used[s] = False
edgelist = []
for a,b in edge[s]:
heapq.heappush(edgelist,a*(10**6)+b)
while len(edgelist):
minedge = heapq.heappop(edgelist)
#まだ使われてない頂点の中から最小の距離のものを探す
if not used[minedge%(10**6)]:
continue
v = minedge%(10**6)
d[v] = minedge//(10**6)
used[v] = False
for e in edge[v]:
if used[e[1]]:
heapq.heappush(edgelist,(e[0]+d[v])*(10**6)+e[1])
return d
def main():
N, u, v = map(int, input().split())
u -= 1
v -= 1
edge = [[] for i in range(N)]
for _ in range(N-1):
A, B = map(int, input().split())
A -= 1
B -= 1
edge[A].append([1,B])
edge[B].append([1,A])
d1 = dijkstra_heap(u,edge, N)
d2 = dijkstra_heap(v,edge, N)
ans = 0
for i in range(N):
if d1[i] < d2[i]:
ans = max(ans, d2[i]-1)
print(ans)
if __name__ == "__main__":
main()
|
N, A, B = [int(i) for i in input().split()]
if (B-A) % 2 == 0:
print((B-A)//2)
else:
x = min(A-1, N-B)
print((B-A-1)//2+x+1)
| 0 | null | 113,196,966,019,872 | 259 | 253 |
n,k = map(int,input().split())
a = abs(n-k*(n//k))
b = abs(n-k*(-(-n//k)))
print(min(a,b))
|
from itertools import accumulate
def main():
N, K = map(int, input().split())
A = list(map(int, input().split()))
for _ in range(K):
arr = [0]*(N+1)
for i, a in enumerate(A):
left = max(0, i-a)
right = min(N, i+a+1)
arr[left] += 1
arr[right] -= 1
A = list(accumulate(arr[:-1]))
if all(a == N for a in A):
break
print(*A, sep=" ")
if __name__ == "__main__":
main()
| 0 | null | 27,183,133,058,750 | 180 | 132 |
_, _, m = map(int, input().split())
a = [int(i) for i in input().split()]
b = [int(i) for i in input().split()]
low = min(a) + min(b)
for _ in range(m):
x, y, c = map(int, input().split())
low = min(low, a[x - 1] + b[y - 1] - c)
print(low)
|
x = list(map(int, input().split()))
if x[0] == 0:
print('1')
elif x[1] == 0:
print('2')
elif x[2] == 0:
print('3')
elif x[3] == 0:
print('4')
else:
print('5')
| 0 | null | 33,645,479,611,730 | 200 | 126 |
a, b = map(int, input().split())
n = max([a - 2 * b, 0])
print(n)
|
a, b = map(int, input().split())
ans = a - b*2
print(ans if ans > 0 else 0)
| 1 | 166,792,353,264,640 | null | 291 | 291 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.