code1
stringlengths 16
427k
| code2
stringlengths 16
427k
| similar
int64 0
1
| pair_id
int64 2
178,025B
⌀ | question_pair_id
float64 27.1M
177,113B
⌀ | code1_group
int64 1
297
| code2_group
int64 1
297
|
|---|---|---|---|---|---|---|
import sys
from sys import stdin
input = stdin.readline
class UnionFind():
def __init__(self, n):
self.n = n
self.d = [-1] * n
def find(self, x):
if (self.d[x] < 0):
return x
else:
self.d[x] = self.find(self.d[x])
return self.d[x]
def unite(self, x, y):
x = self.find(x)
y = self.find(y)
if (x == y): return
if (self.d[x] > self.d[y]):
x, y = y, x
self.d[x] += self.d[y]
self.d[y] = x
def same(self, x, y): return self.find(x) == self.find(y)
def size(self, x): return -self.d[self.find(x)]
n, m = map(int, input().split())
uf = UnionFind(n)
for i in range(m):
a, b = map(int, input().split())
a -= 1
b -= 1
uf.unite(a,b)
ans = 0
for i in range(n):
ans = max(ans, uf.size(i))
print(ans)
|
"""
UnionFindにはいろいろな実装があるが, 本問ではparents配列にノード数を保持する実装だと非常に簡単に解ける.
以下のようにしてノード数を保持する.
自身が子のとき, 親ノード番号を格納する.
自身が根のとき, ノード数を負の数で格納する.
つまり, 負の数のときは自身が根であり, その絶対値がその木のノード数を表す.
初期化時は、すべてのノードを−1で初期化する.
"""
N,M = map(int,input().split())
#UnionFind木の実装
#-1で初期化し、併合のたびに-1していく
par = [-1] * N #親
rank = [0] * N #木の深さ
#木の根を求める
def find(x):
#par[x]が負のとき(自分が代表のとき)、自身を返す
if par[x] < 0:
return x
else:
return find(par[x])
#xとyの属する集合を併合
def unite(x,y):
x = find(x)
y = find(y)
#もとから同じ集合のときは何もしない
if (x == y):
return
#x側を常に小さくする
if par[x] > par[y]:
x, y = y, x
#x側に併合する、その際xの代表にノード数を加算する
par[x] += par[y]
par[y] = x
#xとyが同じ集合に属するかどうか
def same(x,y):
return find(x) == find(y)
for i in range(M):
x,y = map(int,input().split())
x -= 1; y -= 1
unite(x,y)
ans = min(par)
print(abs(ans))
| 1 | 3,946,731,462,300 | null | 84 | 84 |
from itertools import accumulate
n, k = map(int, input().split())
a = list(map(int, input().split()))
for _ in range(k):
b = [0] * n
for i in range(n):
b[max(0, i-a[i])] += 1
tmp = i + a[i] + 1
if tmp < n:
b[tmp] -= 1
a = list(accumulate(b))
if a == [n] * n:
break
print(*a)
|
from itertools import accumulate
N, K = map(int, input().split())
*A, = map(int, input().split())
for i in range(K):
a = [0]*N
allN = True
for j in range(N):
l, r = max(j-A[j], 0), (j+A[j]+1)
a[l] += 1
if r < N:
a[r] -= 1
if A[j] != N:
allN = False
A = list(accumulate(a))
if allN:
break
print(*A)
| 1 | 15,388,791,750,908 | null | 132 | 132 |
cnt = 0
coefficients = [1]
n = 1
_list = []
length = int(input())
for i in range(length):
try:
_list.append(int(input()))
except EOFError:
continue
for i in range(1,length):
if i < n:
continue
coefficients.append(i)
n = i*2.25 + 1
for c in coefficients[::-1]:
for i in range(length):
val = _list[i]
j = i - c
while j >= 0 and _list[j] > val:
_list[j + c] = _list[j]
j -= c
cnt += 1
_list[j+c] = val
print(len(coefficients))
print(*coefficients[::-1])
print(cnt)
print(*_list, sep='\n')
|
def insertionSort(A, n, g):
cnt = 0
for i in range(g, n):
v = A[i]
j = i - g
while j >= 0 and A[j] > v:
A[j+g] = A[j]
j = j - g
cnt += 1
A[j+g] = v
return cnt
def shellSort(A, n):
cnt = 0
nn = n
G = []
g = 1
while g <= n:
G.insert(0, g)
g = g*3 + 1
m = len(G)
for g in G:
cnt += insertionSort(A, n, g)
return cnt, m, G
n = int(input())
A = [int(input()) for i in range(n)]
cnt, m, G = shellSort(A, n)
print(m)
print(" ".join(map(str, G)))
print(cnt)
for a in A:
print(a)
| 1 | 31,156,382,430 | null | 17 | 17 |
import math
n = int(input())
x = list(map(int, input().split()))
y = list(map(int, input().split()))
p_1, p_2, p_3, p_infinit = 0, 0, 0, 0
dis_list = []
for i in range(n):
dis_list.append(abs(x[i] - y[i]))
sum_d = abs(x[i] - y[i])
p_1 += sum_d
p_2 += sum_d ** 2
p_3 += sum_d ** 3
p_2 = math.sqrt(p_2)
p_3 = p_3 ** (1 / 3)
print(p_1)
print(p_2)
print(p_3)
print(max(dis_list))
|
import math
n = int(input())
x = [int(i) for i in input().split()]
y = [int(i) for i in input().split()]
for p in range(1,4):
s = [math.fabs(x[i]-y[i])**p for i in range(n)]
z = math.pow(sum(s), 1/p)
print("{:.6f}".format(z))
t = [math.fabs(x[i]-y[i]) for i in range(n)]
print("{:.6f}".format(max(t)))
| 1 | 208,442,970,944 | null | 32 | 32 |
data = list(map(int, input().split()))
n = int(input())
dice = ['12431', '03520', '01540', '04510', '02530', '13421']
for i in range(n):
up, front = map(int, input().split())
u = data.index(up)
f = data.index(front)
a = dice[u].find(str(f))
print(data[int(dice[u][a+1])])
|
import sys
s = sys.stdin.readline().rstrip('\r\n')
p = sys.stdin.readline().rstrip('\r\n')
s += s
if p in s:
print('Yes')
else:
print('No')
| 0 | null | 1,000,749,475,222 | 34 | 64 |
import sys
import math
import fractions
from collections import defaultdict
stdin = sys.stdin
ns = lambda: stdin.readline().rstrip()
ni = lambda: int(stdin.readline().rstrip())
nm = lambda: map(int, stdin.readline().split())
nl = lambda: list(map(int, stdin.readline().split()))
A=int(input())
B=int(input())
A2=min(A,B)
B2=max(A,B)
if(A2==1 and B2==2):
print(3)
sys.exit(0)
if(A2==2 and B2==3):
print(1)
sys.exit(0)
if(A2==1 and B2==3):
print(2)
sys.exit(0)
|
input_line = set([])
input_line.add(int(input()))
input_line.add(int(input()))
for i in range(1,4):
if i not in input_line:
print(i)
| 1 | 110,295,131,958,328 | null | 254 | 254 |
I = input()
for i in range(len(I)):
if 'a' <= I[i] <= 'z':
print(I[i].upper(), end = '')
continue
if 'A' <= I[i] <= 'Z':
print(I[i].lower(), end = '')
continue
print(I[i], end = '')
print()
|
def convert(s):
o = ord(s)
if o >= 65 and o <= 90:
return s.lower()
elif o >= 97 and o <= 122:
return s.upper()
return s
def main():
strings = input()
answer = ""
for s in strings:
s = s
answer += convert(s)
print(answer)
if __name__ == "__main__":
main()
| 1 | 1,524,885,089,552 | null | 61 | 61 |
def main():
N, M = (int(i) for i in input().split())
from math import gcd
def lcm(x, y):
return x*y//gcd(x, y)
def prime_factorize(n):
res = {2: 0}
for i in range(2, 3):
if i*i > n:
break
if n % i != 0:
continue
ex = 0
while n % i == 0:
ex += 1
n //= i
res[i] = ex
if n != 1:
res[n] = 1
return res
B = [int(i)//2 for i in input().split()]
c = set()
L = 1
for b in B:
L = lcm(L, b)
c.add(prime_factorize(b)[2])
if len(c) != 1:
print(0)
else:
ans = 0
i = 1
while L*i <= M:
ans += 1
i += 2
print(ans)
if __name__ == '__main__':
main()
|
import sys
input = sys.stdin.readline
import math
MOD = 10**9+7
N = int(input())
F = []
zero_v = 0
inf = 0
zero = 0
for _ in range(N):
x,y = map(int,input().split())
if x==0 and y==0:
zero_v += 1
elif x==0:
inf += 1
elif y==0:
zero += 1
else:
G = math.gcd(abs(x),abs(y))
F.append((x//G,y//G))
all_keys = set()
for x,y in F:
if x*y >0:
if x>0:
all_keys.add((x,y))
else:
all_keys.add((-x,-y))
x,y = -y,x
if x*y >0:
if x>0:
all_keys.add((x,y))
else:
all_keys.add((-x,-y))
all_dic = {k:[0,0] for k in all_keys}
for x,y in F:
if x*y > 0:
if x>0:
all_dic[(x,y)][0] += 1
else:
all_dic[(-x,-y)][0] += 1
else:
if x>0:
all_dic[(-y,x)][1] += 1
else:
all_dic[(y,-x)][1] += 1
ans = (pow(2,inf,MOD)) + (pow(2,zero,MOD))-1
ans %= MOD
for k in all_keys:
P,N = all_dic[k]
ans *= (pow(2,P,MOD)) + (pow(2,N,MOD))-1
ans %= MOD
ans += zero_v-1
print(ans%MOD)
| 0 | null | 61,190,810,582,884 | 247 | 146 |
def colorchange(i,l,r,col):
k=i-1
while(k>=0):
if not '#' in G[k]:
for j in range(l+1,r+1):
A[k][j]=col
else:
break
k-=1
k=i+1
while(k<H):
if not '#' in G[k]:
for j in range(l+1,r+1):
A[k][j]=col
else:
break
k+=1
H,W,K=map(int,input().split())
G=[list(input()) for i in range(H)]
s=set()
A=[[-1]*W for i in range(H)]
now=1
for i in range(H):
if not '#' in G[i]:
continue
last=-1
first=True
for j in range(W):
if G[i][j]=='#' and j==0:
first=False
A[i][j]=now
if j==W-1:
colorchange(i,last,j,now)
now+=1
elif G[i][j+1]=='#':
if first:
first=False
else:
colorchange(i,last,j,now)
last=j
now+=1
for i in range(H):
print(*A[i])
|
N = int(input())
while N > 0:
es = sorted(list(map(int, input().split())))
if es[2] ** 2 == es[1] ** 2 + es[0] ** 2:
print('YES')
else:
print('NO')
N -= 1
| 0 | null | 72,110,915,416,640 | 277 | 4 |
time = raw_input()
time = int(time)
h = time / 3600
m = (time - h * 3600) / 60
s = time - (h * 3600 + m * 60)
print "%d:%d:%d" % (h, m, s)
|
l = int(input())
ans = 0
edge = l/3
ans = edge**3
print(ans)
| 0 | null | 23,700,546,694,894 | 37 | 191 |
s=list(input());print(sum([1 for i,j in list(zip(s[:(len(s)//2)],s[len(s)//2:][::-1])) if i!=j]))
|
n, k= map(int, input().split())
x = [0]*n
for i in range(k):
z = int(input())
if z == 1:
x[int(input())-1] +=1
else:
a = list(map(int, input().split()))
for j in a:
x[j-1] +=1
print(x.count(0))
| 0 | null | 72,679,941,622,720 | 261 | 154 |
from functools import reduce
def comb(n, r, mod=10 ** 9 + 7):
numerator = reduce(lambda x, y: x * y % mod, [n - r + k + 1 for k in range(r)])
denominator = reduce(lambda x, y: x * y % mod, [k + 1 for k in range(r)])
return numerator * pow(denominator, mod - 2, mod) % mod
n, a, b = map(int, input().split())
mod = 1000000007
print((pow(2, n, mod) - 1 - comb(n, a, mod) - comb(n, b, mod)) % mod)
|
import re
def main():
S , T =map(str, input().split())
print (T+S)
if __name__ == '__main__':
main()
| 0 | null | 84,526,850,227,010 | 214 | 248 |
def main():
N, M = list(map(lambda n: int(n), input().split(" ")))
if M == 0:
print("0 0")
return 0
AC = [0] * N
WA = [0] * N
for i in range(M):
tmp = input().split(" ")
No = int(tmp[0]) - 1
if tmp[1] == "AC":
AC[No - 1] = 1
if tmp[1] == "WA" and AC[No - 1] == 0:
WA[No - 1] += 1
totAC = sum(AC)
totWA = sum([AC[i] * WA[i] for i in range(len(AC))])
print(totAC, end=" ")
print(totWA)
main()
|
n, m = map(int,input().split())
lst = [[0, 0] for i in range(n)]
for i in range(m):
p, s = map(str,input().split())
p = int(p) - 1
if (lst[p][0] == 0):
if (s == "AC"):
lst[p][0] = 1
else:
lst[p][1] = lst[p][1] + 1
ans = 0
pena = 0
for i in range(n):
if (lst[i][0] == 1):
ans = ans + 1
pena = pena + lst[i][1]
print(ans, pena)
| 1 | 93,183,845,601,378 | null | 240 | 240 |
import math
n, m = map(int, input().split(" "))
start = 1
end = n
wq = n // 4
for i in range(m):
if i == wq and n % 2 == 0:
start += 1
print(start, end)
start += 1
end -= 1
|
import math
N, M = map(int, input().split())
if N%2 == 1:
a = 1
b = N
for i in range(M):
print(a,b)
a += 1
b -= 1
else:
m = N//2 - 1
a = N//4
b = a + 1
c = N//2 + N//4
d = c + 2
for i in range(M):
if i%2 == 0:
print(a,b)
a -= 1
b += 1
else:
print(c,d)
c -= 1
d += 1
| 1 | 28,818,501,033,676 | null | 162 | 162 |
n = int(input().rstrip())
red = []
white = []
stones = input().rstrip()
for idx, stone in enumerate(stones):
if stone == "R":
red.append(idx)
if stone == "W":
white.append(idx)
red_len = len(red)
white_len = len(white)
cnt = 0
for i in range(min(red_len, white_len)):
red_idx = red[-1-i]
white_idx = white[i]
if red_idx> white_idx:
cnt += 1
else:
break
print(cnt)
|
a = input()
print('Yes') if (a[2] == a[3] and a[4] == a[5]) else print('No')
| 0 | null | 24,122,148,116,572 | 98 | 184 |
#!/usr/bin/env python3
from typing import *
YES = 'Yes'
NO = 'No'
# def solve(D: int, T: int, S: int) -> str:
def solve(D, T, S):
return YES if D <= T*S else NO
def main():
D, T, S = map(int, input().split())
a = solve(D, T, S)
print(a)
if __name__ == '__main__':
main()
|
a, b, c = map(int,input().split())
time = a/c
if time <= b:
print('Yes')
else:
print('No')
| 1 | 3,554,435,508,900 | null | 81 | 81 |
i = input()
print(["No", "Yes"]["7" in i])
|
a=int(input())
str_a=str(a)
list_a=list(str_a)
count=0
for i in range(0,len(list_a)):
if(list_a[i]=='7'):
count+=1
else:
count+=0
if(count>1 or count==1):
print('Yes')
else:
print('No')
| 1 | 34,565,148,799,202 | null | 172 | 172 |
from bisect import bisect_left
class score:
def __init__(self,t) -> None:
self.t = t
score = 0
last = [[] for i in range(26)]
for i,ti in enumerate(t):
score += s[i][ti-1]
last[ti-1].append(i+1)
for tj in range(26):
if last[tj-1] == []:
score -= c[tj-1]*(i+1)
else:
#print(last)
score -= c[tj-1]*((i+1)-last[tj-1][-1])
print(score)
self.score = score
def a__init__(self,t) -> None:
score = 0
last = [[] for i in range(26)]
for i,ti in enumerate(t):
# 開催分を加算
score += s[i][ti-1]
# 減らす
if last[ti-1] == []:
score -= c[i]*i+1
else:
score -= c[i]*((i+1)-last[ti-1][-1])
last[ti-1].append(i+1)
print(score)
for i in range(26):
if last[i] == []:
score -= c[i]*D
else:
score -= c[i]*(D-last[i][-1])
self.score = score
self.t = t
D = int(input())
c = list(map(int,input().split()))
s = [list(map(int,input().split())) for i in range(D)]
t = [int(input()) for i in range(D)]
sc = score(t)
#print(sc.score)
|
# -*- coding:utf-8 -*-
stack = list()
def deal_expression(x):
if x.isdigit():
stack.append(int(x))
else:
a = stack.pop()
b = stack.pop()
if x == '+':
stack.append(b + a)
elif x == '-':
stack.append(b - a)
elif x == '*':
stack.append(b * a)
elif x == '/':
stack.append(b / a)
for x in input().split():
deal_expression(x)
print(stack[0])
| 0 | null | 4,984,425,096,860 | 114 | 18 |
s = ''
while True:
try:
s += input().lower()
except EOFError:
break
for c in 'abcdefghijklmnopqrstuvwxyz':
print('{} : {}'.format(c, s.count(c)))
|
import sys
import string
def main():
tmp = ''
try:
while True:
tmp += input()
except EOFError:
pass
tmp = list(filter(lambda x: x in string.ascii_lowercase, tmp.lower()))
for c in string.ascii_lowercase:
print('{} : {}'.format(c, tmp.count(c)))
return 0
if __name__ == '__main__':
sys.exit(main())
| 1 | 1,679,297,000,180 | null | 63 | 63 |
n,k,s = map(int,input().split())
rem = s+1
if rem > 10**9:
rem = 1
li = []
for i in range(n):
if i < k:
li.append(s)
else:
li.append(rem)
print(*li)
|
# -*- coding: utf-8 -*-
a = [e for e in input().split()]
# a = ['1', '2', '+', '3', '4','-', '*']
# a = ['1', '2', '+']
l = []
for x in a:
if x not in ['+', '-', '*']:
x = int(x)
l.append(x)
else:
a = l.pop()
b = l.pop()
if x == '+':
l.append(b + a)
elif x == '-':
l.append(b - a)
elif x == '*':
l.append(b * a)
print(sum(l))
| 0 | null | 45,398,935,588,226 | 238 | 18 |
import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return map(int, input().split())
sys.setrecursionlimit(10**9)
N = list(input())
K = int(input())
length = len(N)
dp = [[[0]*2 for _ in range(K+1)] for _ in range(length+1)]
dp[0][0][1] = 1
for i in range(length):
n = int(N[i])
for k in range(K+1):
if k==K:
dp[i+1][k][0]+=dp[i][k][0]
if n==0:
dp[i+1][k][1]+=dp[i][k][1]
else:
dp[i+1][k][0]+=dp[i][k][1]
continue
for j in range(10):
if j==0:
if n==0:
dp[i+1][k][0]+=dp[i][k][0]
dp[i+1][k][1]+=dp[i][k][1]
else:
dp[i+1][k][0]+=dp[i][k][0]+dp[i][k][1]
elif j==n:
dp[i+1][k+1][1]+=dp[i][k][1]
dp[i+1][k+1][0]+=dp[i][k][0]
elif j<n:
dp[i+1][k+1][0]+=dp[i][k][0]+dp[i][k][1]
else:
dp[i+1][k+1][0]+=dp[i][k][0]
print(sum(dp[-1][K]))
|
def f(x):
cnt=0
for i in range(N):
num=x//F[i]
if A[i]>num:
cnt+=A[i]-num
return cnt
N,K=map(int,input().split())
A=list(map(int,input().split()))
F=list(map(int,input().split()))
A.sort()
F.sort(reverse=True)
low=0
high=10**12+1
while high-low>0:
mid=(high+low)//2
xxx=f(mid)
if xxx<=K:
high=mid
else:
if low==mid:
low=high
else:
low=mid
print(low)
| 0 | null | 119,997,647,668,922 | 224 | 290 |
from functools import reduce
print(reduce(lambda a, b: 'a {} b'.format('<' if a < b else (
'>' if a > b else '==')),
map(int, input().split())))
|
a,b=list(map(int,input().split()))
if a==b:
print("a == b")
elif a<b:
print("a < b")
else:
print("a > b")
| 1 | 366,234,516,790 | null | 38 | 38 |
def combination(n, r, m):
res = 1
r = min(r, n - r)
for i in range(r):
res = res * (n - i) % m
res = res * pow(i + 1, m - 2, m) % m
return res
mod = 10**9 + 7
n, a, b = map(int, input().split())
total = pow(2, n, mod) - 1
total -= (combination(n, a, mod) + combination(n, b, mod)) % mod
print(total % mod)
|
n, a, b = map(int, input().split())
MOD = 10**9 + 7
def comb(n, r, mod):
if r > n-r:
r = n - r
res_X = 1
for i in range(n-r+1, n+1):
res_X = (res_X * i)%mod
res_Y = 1
for i in range(1, r+1):
res_Y = (res_Y * i)%mod
return (res_X * pow(res_Y, mod-2, mod))%mod
base = (pow(2, n, MOD) - 1)%MOD
a = comb(n, a, MOD)
b = comb(n, b, MOD)
print((base - a - b)%MOD)
| 1 | 66,384,626,594,100 | null | 214 | 214 |
h, a = map(int, input().split())
ans = 0
while True:
if h > 0:
h = h - a
ans += 1
else:
print(ans)
exit()
|
N,*X = map(int, open(0).read().split())
ans = float('inf')
for i in range(1,max(X)+1):
temp = 0
for j in range(N):
temp += (X[j]-i) ** 2
ans = min(ans,temp)
print(ans)
| 0 | null | 70,622,410,431,690 | 225 | 213 |
#!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
????????????
"""
inp = input().strip().split(" ")
n = int(inp[0])
m = int(inp[1])
l = int(inp[2])
# ?????????????????????????¢????
# A[n][m] B[m][l] C[n][l]
A = [[0 for i in range(m)] for j in range(n)]
B = [[0 for i in range(l)] for j in range(m)]
C = [[0 for i in range(l)] for j in range(n)]
# A???????????°??????????????????
for i in range(n):
inp = input().strip().split(" ")
for j in range(m):
A[i][j] = int(inp[j])
# B???????????°??????????????????
for i in range(m):
inp = input().strip().split(" ")
for j in range(l):
B[i][j] = int(inp[j])
# A x B
for i in range(n):
for j in range(l):
for k in range(m):
C[i][j] += A[i][k] * B[k][j]
print(" ".join(map(str,C[i])))
|
import sys
(n, m, l) = [int(i) for i in sys.stdin.readline().split()]
a = []
for i in range(n):
a.append([int(i) for i in sys.stdin.readline().split()])
b = []
for i in range(m):
b.append([int(j) for j in sys.stdin.readline().split()])
for i in range(n):
row = []
for j in range(l):
c_ij = 0
for k in range(m):
c_ij += a[i][k] * b[k][j]
row.append(str(c_ij))
print(" ".join(row))
| 1 | 1,424,005,795,488 | null | 60 | 60 |
import sys
prime = lambda x: True if x==2 else False if x<2 or not x%2 else pow(2,x-1,x)==1
inp = sys.stdin.readlines()
print(len([prime(e) for e in list(map(int, inp[1:])) if prime(e)==1]))
|
A,B,N=map(int,input().split())
i=min(B-1,N)
tmp=(A*i)//B-A*(i//B)
print(tmp)
| 0 | null | 13,954,021,423,312 | 12 | 161 |
N = int(input())
A = list(map(int,input().split()))
s = [0]*(N+1)
for i in range(N):
s[i+1] = s[i] + A[i]
cnt = 0
for j in range(N):
cnt = (cnt + (A[j]*(s[N] - s[j+1])))%(10**9+7)
print(cnt)
|
import itertools
#h,w=map(int,input().split())
#S=[list(map(int,input().split())) for _ in range(h)]
n=int(input())
A=list(map(int,input().split()))
Ar=list(itertools.accumulate(A))
ans=0
for i in range(n-1):
ans+=A[i]*(Ar[n-1]-Ar[i])
ans%=10**9+7
print(ans)
| 1 | 3,851,222,374,428 | null | 83 | 83 |
n = int(input())
A = list(map(int,input().split()))
A.sort(reverse=True)
B = sorted(A+A[1:],reverse=True)
print(sum(B[:n-1]))
|
from collections import deque
def main():
n = int(input())
l = list(map(int, input().split()))
comfort = 0
l_sorted = sorted(l, reverse=True)
q = deque([l_sorted[0]])
for i in range(1, n):
comfort += q[0]
q.popleft()
for _ in range(2):
q.append(l_sorted[i])
print(comfort)
if __name__ == '__main__':
main()
| 1 | 9,113,202,444,710 | null | 111 | 111 |
n = int(input())
s = input()
print(sum([1 for i in range(n-2) if s[i:i+3] == 'ABC']))
|
#!python3.8
# -*- coding: utf-8 -*-
# abl/abl_a
import sys
s2nn = lambda s: [int(c) for c in s.split(' ')]
ss2nn = lambda ss: [int(s) for s in list(ss)]
ss2nnn = lambda ss: [s2nn(s) for s in list(ss)]
i2s = lambda: sys.stdin.readline().rstrip()
i2n = lambda: int(i2s())
i2nn = lambda: s2nn(i2s())
ii2ss = lambda n: [i2s() for _ in range(n)]
ii2nn = lambda n: ss2nn(ii2ss(n))
ii2nnn = lambda n: ss2nnn(ii2ss(n))
def main():
K = i2n()
print('ACL' * K)
return
main()
| 0 | null | 50,724,395,482,918 | 245 | 69 |
import sys
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
def resolve():
N, M = lr()
if N%2 == 1:
for i in range(0, M):
print(f'{2+i} {1+2*M-i}')
else:
k = N//4
for i in range(M):
if i < k:
print(f'{i+1} {N-i}')
else:
print(f'{i+2} {N-i}')
resolve()
|
#!/usr/bin/env python
# -*- coding: utf-8 -*-
POSITIONS = ["top", "south", "east", "west", "north", "bottom"]
class Dice(object):
def __init__(self, initial_faces):
self.faces = {p: initial_faces[i] for i, p in enumerate(POSITIONS)}
self.store_previous_faces()
def store_previous_faces(self):
self.previous_faces = self.faces.copy()
def change_face(self, after, before):
self.faces[after] = self.previous_faces[before]
def change_faces(self, rotation):
self.change_face(rotation[0], rotation[1])
self.change_face(rotation[1], rotation[2])
self.change_face(rotation[2], rotation[3])
self.change_face(rotation[3], rotation[0])
def roll(self, direction):
self.store_previous_faces()
if direction == "E":
self.change_faces(["top", "west", "bottom", "east"])
elif direction == "N":
self.change_faces(["top", "south", "bottom", "north"])
elif direction == "S":
self.change_faces(["top", "north", "bottom", "south"])
elif direction == "W":
self.change_faces(["top", "east", "bottom", "west"])
def rolls(self, directions):
for d in directions:
self.roll(d)
def main():
dice = Dice(input().split())
q = int(input())
for x in range(q):
[qtop, qsouth] = input().split()
if qsouth == dice.faces["west"]:
dice.roll("E")
elif qsouth == dice.faces["east"]:
dice.roll("W")
while qsouth != dice.faces["south"]:
dice.roll("N")
while qtop != dice.faces["top"]:
dice.roll("W")
print(dice.faces["east"])
if __name__ == "__main__":
main()
| 0 | null | 14,357,833,981,628 | 162 | 34 |
import sys
# import re
import math
import collections
# import decimal
import bisect
import itertools
import fractions
# import functools
import copy
import heapq
import decimal
# import statistics
import queue
# import numpy as np
sys.setrecursionlimit(10000001)
INF = 10 ** 16
MOD = 10 ** 9 + 7
# MOD = 998244353
ni = lambda: int(sys.stdin.readline())
ns = lambda: map(int, sys.stdin.readline().split())
na = lambda: list(map(int, sys.stdin.readline().split()))
# ===CODE===
def main():
s = input()
cnt = [0 for _ in range(2019)]
cnt[0] += 1
dec = 1
num = 0
for i in reversed(s):
num += int(i) * dec
num %= 2019
dec *= 10
dec %= 2019
cnt[num] += 1
ans = 0
for c in cnt:
ans += c * (c - 1) // 2
print(ans)
if __name__ == '__main__':
main()
|
from collections import Counter
S = input()
S = S[::-1]
# 1桁のmod2019, 2桁の2019, ...
# 0桁のmod2019=0と定めると都合が良いので入れておく
l = [0]
num = 0
for i in range(len(S)):
# 繰り返し二乗法で累乗の部分を高速化
# 自分で書かなくてもpow()で既に実装されている
# 一つ前のmodを利用するとPythonで通せた、それをしなくてもPyPyなら通る
num += int(S[i]) * pow(10,i,2019)
l.append(num % 2019)
# print(l)
ans = 0
c = Counter(l)
for v in c.values():
ans += v*(v-1)//2
print(ans)
| 1 | 30,800,680,281,548 | null | 166 | 166 |
for i in range(1,10):
for j in range(1,10):
print "%d%s%d%s%d" % (i,"x",j,"=",i*j)
|
#!/usr/bin/env python
# -*- coding: utf-8 -*-
"""
input:
15 6
1 2 7 8 12 50
output:
2
"""
import sys
def solve():
rec[0] = 0
for i in range(c_num):
for j in range(coins[i], money + 1):
rec[j] = min(rec[j], rec[j - coins[i]] + 1)
return rec
if __name__ == '__main__':
_input = sys.stdin.readlines()
money, c_num = map(int, _input[0].split())
coins = list(map(int, _input[1].split()))
# assert len(coins) == c_num
rec = [float('inf')] * (money + 1)
ans = solve()
print(ans.pop())
| 0 | null | 74,194,553,200 | 1 | 28 |
# coding=utf-8
import math
N = int(input())
for i in range(N):
length_list = list(map(int, input().split()))
length_list.sort()
if math.pow(length_list[0], 2) + math.pow(length_list[1], 2) == math.pow(length_list[2], 2):
print('YES')
else:
print('NO')
|
n = int(input())
for i in range(n):
a,b,c = list(map(int, input().split()))
M = max([a,b,c])
result = False
if a == M:
result = (a * a == b * b + c * c)
elif b == M:
result = (b * b == a * a + c * c)
elif c == M:
result = (c * c == a * a + b * b)
if result:
print("YES")
else:
print("NO")
| 1 | 254,665,080 | null | 4 | 4 |
n, k = map(int, input().split())
p = list(map(int, input().split()))
#logging.debug("デバッグスタート") #
l = [[] for i in range(n)]#期待値
m = [[] for i in range(n - k + 1)] #k個の合計
for i in range(n):
l[i] = (1 + p[i]) / 2
#logging.debug("l = {}".format(l))#
m[0] = sum(l[0:k])
ans = m[0]
for i in range(1, n - k + 1):
#logging.debug("m[i-1] = {} ,l[i-1] = {} ,l[i+k] = {}".format(m[i - 1], l[i - 1], l[i + k - 1])) #
m[i] = m[i - 1] - l[i - 1] + l[i + k - 1]
if m[i] > ans:
ans = m[i]
#logging.debug(m)#
print(ans)
|
n,k=[int(i) for i in input().split()]
p=[(int(i)+1)/2 for i in input().split()]
ans=0
sum_num=sum(p[:k])
for i in range(n-k+1):
if i==0:
sum_num = sum(p[:k])
else:
sum_num+=p[i+k-1]-p[i-1]
ans=max(ans,sum_num)
print(ans)
| 1 | 74,952,627,889,720 | null | 223 | 223 |
import sys
N, R = map(int, sys.stdin.buffer.read().split())
rate = R
if N < 10:
rate += 100 * (10 - N)
print(rate)
|
n,k=list(map(int,input().split()))
if(n>=10):
print(int(k))
else:
rating =k + 1000 - 100*n
print(rating)
| 1 | 63,352,580,935,960 | null | 211 | 211 |
X,K,D = map(int,input().split())
y = abs(X)//D
if K<=y:
print(abs(abs(X)-K*D))
else :
a = (abs(X)-y*D)
b = (abs(X)-(y+1)*D)
C = abs(a)
D = abs(b)
if (K-y)%2==0:
print(C)
else:
print(D)
#print(y+1)
#print(1000000000000000)
|
N = int(input())
K = int(input())
dp = [[[0]*2 for _ in range(4)] for _ in range(105)]
# dp[i][j][k]:上からi桁まで決めて0でない数字をj個用いた数字で
# k = 0の時Nと一致,k=1の時N未満が確定
# 求める答えはdp[len(str(N))][K][0] + dp[len(str(N))][K][1]
# k=0からk=1の遷移が不可逆
dp[0][0][0] = 1
length = len(str(N))
for i in range(length):
for j in range(4):
for k in range(2):
next_digit = int(str(N)[i])
for d in range(10):
ni = i+1
nj = j
nk = k
if d != 0:
nj += 1
if nj > K:
continue
if k == 0:
if next_digit < d:
continue
if next_digit > d:
nk = 1
dp[ni][nj][nk] += dp[i][j][k]
ans = dp[length][K][0] + dp[length][K][1]
print(ans)
| 0 | null | 40,362,377,367,660 | 92 | 224 |
S = [s for s in input()]
stack1 = []
stack2 = []
for i in range(len(S)):
if S[i] == '\\':
stack1.append(i)
elif S[i] == '/':
if len(stack1) != 0:
pos = stack1.pop()
area = i - pos
while len(stack2) != 0:
pair = stack2.pop()
if pos < pair[0]:
area += pair[1]
else:
stack2.append(pair)
break
stack2.append((pos, area))
print(sum([s[1] for s in stack2]))
print(len(stack2), *[s[1] for s in stack2])
|
down = []
edge = []
pool = []
for i,c in enumerate(input()):
if c == "\\":
down.append(i)
elif c == "/" and down:
left = down.pop()
area = i - left
while edge:
if edge[-1] > left:
edge.pop()
area += pool.pop()
else:
break
edge.append(left)
pool.append(area)
print(sum(pool))
print(" ".join(map(str,[len(pool)]+pool)))
| 1 | 58,731,051,488 | null | 21 | 21 |
def main():
from decimal import Decimal
N, M = (Decimal(i) for i in input().split())
print(int(N * M))
if __name__ == '__main__':
main()
|
A, B = input().split()
A = int(A)
B = int(''.join([b for b in B if b != '.']))
print(A * B // 100)
| 1 | 16,614,972,323,772 | null | 135 | 135 |
n=int(input())
a=list(map(int,input().split()))
q=int(input())
st=set()
for i in range(1<<n):
sm=0
for j in range(n):
if (i & (1<<j)):
sm+=a[j]
st.add(sm)
Q=list(map(int,input().split()))
for i in Q:
if i in st:
print("yes")
else:
print("no")
|
def main():
input()
array_a = list(map(int, input().split()))
input()
array_q = map(int, input().split())
def can_construct_q (q, i, sum_sofar):
if sum_sofar == q or sum_sofar + array_a[i] == q:
return True
elif sum_sofar > q or i >= len (array_a) - 1:
return False
if can_construct_q(q, i + 1, sum_sofar + array_a[i]):
return True
if can_construct_q(q, i + 1, sum_sofar):
return True
sum_array_a = sum(array_a)
for q in array_q:
#print(q)
if sum_array_a < q:
print('no')
elif can_construct_q(q, 0, 0):
print('yes')
else:
print('no')
return
main()
| 1 | 102,903,614,300 | null | 25 | 25 |
#unionfind木_集合の管理_同じ集合の数を数える場合：
#parには集合の数と親の名前を同時にメモ化する（根なら-size, 子なら親）
def find(k):#要素k
if par[k] < 0:#初期はparがすべて負の値
return k
else:
par[k] = find(par[k])
return par[k]
def unite(i, j):
i = find(i)
j = find(j)
if i==j:#すでに同じ集合
return False
else:
#sizeが大きい方がi
if i > j:#sizeはマイナス管理なので、i>jの時jの方がサイズが大きい
i, j = j, i
par[i] += par[j] #親は負の値で大きくなる
par[j] = i
return True
def size(x):
return -par[find(x)]
n, m = map(int, input().split())
par = [-1]*n#初めは自分自身が親
for i in range(m):
a, b = map(lambda x:int(x)-1, input().split())
unite(a, b)
ans = 0
for i in range(n):
if -par[i]>0:
ans += 1
print(ans-1)
|
# This code is generated by [Atcoder_base64](https://github.com/kyomukyomupurin/AtCoder_base64)
# Original source code :
"""
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstring>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <utility>
#include <vector>
using namespace std;
using int64 = long long;
#define all($) begin($), end($)
#define rall($) rbegin($), rend($)
class UnionFind {
public:
UnionFind(int n) : n_(n) { init(); }
int root(int x) {
assert(0 <= x && x < n_);
if (par_[x] == -1)
return x;
else
return par_[x] = root(par_[x]);
}
bool same(int x, int y) {
assert(0 <= x && x < n_ && 0 <= y && y < n_);
return root(x) == root(y);
}
void unite(int x, int y) {
assert(0 <= x && x < n_ && 0 <= y && y < n_);
x = root(x);
y = root(y);
if (x == y) return;
if (rank_[x] < rank_[y]) std::swap(x, y);
if (rank_[x] == rank_[y]) ++rank_[x];
par_[y] = x;
return;
}
private:
const int n_;
std::vector<int> par_;
std::vector<int> rank_;
void init() {
par_.assign(n_, -1);
rank_.assign(n_, 0);
}
};
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
int n, m; cin >> n >> m;
UnionFind uf(n);
for (int i = 0; i < m; ++i) {
int a, b; cin >> a >> b;
--a;
--b;
uf.unite(a, b);
}
set<int> st;
for (int i = 0; i < n; ++i) {
st.emplace(uf.root(i));
}
cout << (int)st.size() - 1 << endl;
return 0;
}
"""
import base64
import subprocess
import zlib
exe_bin = "c%0>1eRxw<n!oud4YVXd3l;^5ZeR;YY@lERGB#}kH=05hiZTjb(j=vkG^xoA6xNT<wngrQKp%HTSyxAPbf0Br$7h&b_YvKFlv2K&QKx=9E<276vomTUepFE8OS12K?m5Z5w~6!d%zt}%()Yf<`+l7FJ?}a9-g6HRdVI_DIvvLj1NSWsxsz2g-$3zwH|9kEtLMhU-)p()+&JKk3OOx3r&Ci?-jA$Tua|i(oyMuDPC?7K(uZl9nsS^iuZL~5O{eH|n~I*Jem9h<_4HJ)p6b<8c}A^Nk5Lw%k^b5!uBFYKni?r>eP0Zcd`^{lEe&#N%JlvQ^u}?2{9&bZ74=stFDGex8D;%&V<g<ZsP4u{a9$)FP4>*|sb4g2QJo_ZbId1gvQpXQE7lNs>~FoI%~ce`>-EOWSI?Z1HqU$MrR~<?OLrVd%)B3Er*MUS!wl;{a|*RlwWqQv@klu{Ip+9h_+3#1H|dJwH6`!~;Nkir_&p`;uPK3lR>J<*CGhJ?;6e%fp%VCeCGb!Q{MHiq2Cg_hgJUB_eH<xaXR5w9ZY^PFNeO(kM0@TBzmvGBT!T&4veJV6kdyHZ*U5M_D`cqSgcuCWor|@*h!cd3U9qT;5dCpc5IDix)*=K$@zBO_LJY;*TACuUXsFHK9tp|UieI^N#p-Z8;aL?Xr?E)FgJ-M7x==J2@dj3lPG_Lg9~Z>9KP)D^0gq=DU<=y)iEu!OCB%5h-{ox++G+*Q>O}%ko$nG>wSz(^B!r`h5VX!84TAf2f5aaRgxXudKz&{$8ViO5Fc(@~E38^ATUZbXM@f6c`fw~kuGV>@VX@ii*-QkSHwl8+8INs&YeB&uiNpeUAsA`htkH8WOl*w?ge_sQ6H*ln$2{$rxt<=OI}}gEqW(x&+$wCY1-0mwu3}D`nA5sIEGf$F3(XIP0`X8+C@PkS3VUs1ARr{L)0~{JCb}gI*;o}yB)iDP0P9WY$iOBc(78$I@P{J+_!A^~lneCu1-}^T35%5J2xH^7K_3ceh89AXA5yoxsYzJisO6UXyp2u5d`DgWY`$Y5*R*!6yU{B+9SdZ5?OG77<8ao)e+K&3KzSql%IMw2KnhXDb@1;wU12=5&e~dmGIR6uubz90Uay5;RX98mXVe9H8B1Or9*;BYQiZ&ZE6n$A{&Z6r-a)-oUYz}~34OEs5}WtgeeC39nbv6V{q*^uR)g=Q@+O-aXZ*+vnX=~wcAQY)Rt0`ifh)&*MuA_cz(*B$l>$Gfz$YtkD{U9%$gIHG{DF@HQxrIxKM=o4iBtRKT;U#xN2dZ;-mJP6xIuyUC~)O-POk!2-sg8H@Nxw{sK8AMe2)SjufX>z@Cgchp8~H?;QJMLr2;>oz$Ys3g9_ZDz>h2NNeZ0r``E;%$~=>896xYS)aOR{zQd+rF1PTpDjS!Z`8fQw%xHi!<U3I%dol;d%!iT3F364${=3Ly>azz4|98k^%Cq|kzYTdT#q3_f$C1a>X9o#?5AvAuY%k&4k;mp{y9s|M@|fc62EwmG9#flbCH$?(V@k6Pgl|M1Q<<$L{9@!Wg;^Wn=Od4)%UTIP2l$RbmKXOO?%SO?_ZoNGn$`SwK0X0ZkWU$B)?m)0e*1Bt&V!jU(B#viy_HWd-HJIpR(AUoIn%!Mv-Uwk@3U{nT)Hd^w(-)j%xB01K+Btcz~qxI@W=Y?dsv6S`Ci5OKE?Td#rXln`9XRv$sUh2+ewNtH$gi1fDH2Kh<zRSv%%GML{a)EGX(@vZT7Z-H!Qp2(3j44eCeQltuH<ACy<R(T^$a~jD9(qz>s(7q<%%ZvfQ20^_|OE2Bw07>veI7FD18(4;=CZ{)Z=0RZpN&OS+PCr<_eo>h|0>$udw0)zEiT=aWXH*WHp+sx0pt*16W%+bp}jL>JNrKIyZ}8(%|mq)#zV$KW*8Y+svhMY3+-4XF(nJ}3F?>nuA~LNTS};H2YUjkr!XSROw%l$p`cf6UT9A1=B+x1{F)<x~Gf((4Nxl4GcX81xuJ|4c}e>*xbD0|$HTzQFOuRMqaj3lQ5AP{`6Dw{!({0H$`HCtWykeg!6T;V&__>80-idEu`>A~OdXTgVp}eA6|0|1bH#@n$gUCRQhdRkx&*hO&pjmSqOKlt5gqE$NLW=#@^nJDcs@tY3G~e)UN~dyh|g+TKenTXucQ<wGAhYuVKSQ8+&#_VTf&Z+M23#Hm};RX57f4%`Ag_7YZb=9x>moG%rzck|LwX|1hg;FILF*|l()wcnfaSf9tyjkCfOuXMznT4Qs)dEbX{q1yQ}pvjN=U$zV!#^n6!zFJ=TD#L@(v`6QHkRDh`o5%MZ(YcOVb_bz}*%wLFy`(e-J`sP>;(Grj^kErzl|=blAJpW-7a`4ka_~B8?!lj>WB@XL+G^v{-MP%1OIRnzWcie6@AgT#Ovr?GzRFB2$KlDR9w!4e$S;^iMy_SxL#&7I9LDi{*LwFl_j>o;Zeh4%(6=OF@3HjX1I>gY<R#H=%Iu+*O{rE}_NpAVor73*eFZ%Yy|Cjmtkl4XROOR>=OMcfW4iUyaP}V{Oqe^CthZrBX6>Lk=yO3Awn*<M|A|DLwGc-z5VBuF9B$WXOL{Mu^T0^l@hF_M1b*I_GVUhb_HUrjELH8s!PhK}WS@uYuD30_V%QFl-w4zfcmw1g1^MLNjYPJpJbN<=ylmOA3>99p?D`gI@at60ELA><#UUNfddM)a?3zv^n@j|uax0;7F}CM1Hshnx(5au}b!;=re}a7w7->#Td(_=`F_#Q9qR^r2HncZtNxynYws!=}Eikf-$yI{fZZ`<x`11_BW7+W($-)^+`Y|~128Ma58S-v?h$P_0;C-1i?a^lG#Hk}hTm-3R*L#*-n~I1(L-Iw$vzu}#2(dR_LQjwk*CovEP@^oJoZBo_?rw%0Oea(M#6&q6-lOA4u}uc<1$_R?+;(0L<-$cd^wSqHq~j3MZW2-#g!GUb67*A)dh4Q`fLDmr37@piZUxaNiD-lrm0KE?jL(tkKzl#DDBFLmn8v+Ijq6y>Vi#!=Ixb>JZ?Xc|2D#de!H1co=OWGS%@_0Os%GiJy9W>RkQH+F5UQ<bYG&r3tcaRHr%_v*lOs5BL5^tT0*RzCRrh4y<($|G;}WB)^}#G&<AXWe=0kftoLPCmOqpYP#RQf@(G-fNP&9?2DHH|F1j&99YYkG8HPd3-a6$IJR_%8M^~<B*2J~BxE^E<w4M4U`tHv#lZX3{TJ$kG~-!%Z)&@1*tHSLL`m*q%5ptbSd`Qn~=*>jt{-dFGpL1o_7X*~0?XOt{>_Ko%2ceya>@zQXn%OKBtc!%Mo-(;qL1-JjqS)3t<Pkn$c$Q@c5<_B_OS>^|Lh5AM0mCQ~+P8})Szo7OHO|+56!_0mnz0_F&e0uU?LKZ$vt{ygJ8{ullpz{;2^!nYr^uK)H??+qPeCe|98qmtbD+yWp6OhVHetUwA`$E1?rI+f!&>B8nb{;_9b&i+b7pKCb=#MAJkD?RT=S~*dvwj$#LRIY>nm`)z!UQxk`!eYBLzfM_G|CTUZsB!D`PVOtP%>rrQiGLfu#~;trLR}Qb6fI8zHjLaPymzAo=OP&R^T%4ehK;HA%vr4KLR-&s+0TJnc)r+4~nnP;*D752hQS?W6%1Og_pi|ef~fjpL)>52j1g{ey8WtRWryPIXV6=X%y~4aQ}hl1*dE1fqA~bNhqIxf&NWa!mU{^jpA);c#wxDqkT9-rPg5a|B%=H>eO!_y-(}Obmb;w=}J9&8hQK+<<m&V;A&pF2u-lj{{I3k{jCYPiFajpf04g0-^Jn~3Vk0#0&n3{O;&#PIezGzo`-UOsFzf0lPRV5NkjbX^Zd|xxbWJRx%|LcaSAV;=cUt<j_(^X@_iral3(!Yo1fz)@YZ*@`Yy~I*!Q`PiB`CuO67dtF{9UYF8O6j&(D4hElQ_529^5Wv~fQ#HL3K`)h7NxPCjmdc5Mmp=^Oq-ezJubf|u&-n6%+D7%Bp(I=e4ztVvDar9*?#1itSO*#8vUms$de;3b0(oWRd2eqVN#-F$}ir}Lo4dGOSUjPVSns)6`l;BNCumoQUj_*A0WCw-WCpLEeCD~>@IdLH<Mmrf;5l1@ZDRxkK|;g$XyUod>>nU{@ZD9jsIX5&`7rLVoxS>NpU$-CLm*M`g;r->!e=6omrJT6`ENoSj-&)m7HU-R%B&AZ-BeuM*3@mMohsDLxW^j(j<-HknP{h~=|ibbQLfG9MD#c(L$2y}OIwYHm=+InoWX2GAEZBc>BYhgSi*j7B-suU$hI4auKM8mP@vT!uGcyT-y6KepQ&8}~bg@a0gWHc;>P~rv~5z}2`Sb}Tu_(IqHc`k?3*#<}pKFD<g{WZ*_-Efzxg%Pk9DAwqHxYOhMWdl6T;JR}+KGgsngvoO!&=H(OK_1^12kD{#Tg%XGTgB;mth#F|%T0s2ax3EasiPWf&sD@#T%P0XRQ|xI+y>5UU1qMn)l#v=)XUv+^^!RY?AJ4W{5H`GF)7y%a77DW(++??(u2)r>rTDfT)o}kHrx7)?Gwz^O=fGO+0;~V7o5Avd1D3o{2u(Q5c?d|gA09nkTCfw+-4K`Ui2*dY;b*=PQJb!?e-a#n``weWm6!ztfEJ8t`Fpy+bV7VwR7;h1U43<kLB35=6u_NtT~?Hqpxs^Z%f-+eI!fe|EPmPzlP<im6P+e6LNJHl3@H#U>eQV-TFpz^)5rR*_Jjonrn8Jxy`lP$GOe*edWu|gL=b=VS>3HFt@p;(QE_RMw$?s*T=zjJ=~HV==?Ub^=^nCbNwvfz0md$r}E>;`{B_KkA7Or4e??=$lBQ@u(J>BDA${EIo-5bOE~VZZq}=lxbu4J@k!i!Wh1($CUGxL`lb(R|IZJ${>j!m+4`pPd!&*+r&IH9(G#{twudgRv9+=OYMIi{d-?U(YbejwLa(Njt+%q;Wn=Tp%efe_Pdh!|rSycY86Kq9*&5#l%CogS+8osyDIRQ%lBer+thQQdd~Cj9YmjVhlpn9gttNH5>#06li)8+<<<xR8-H`Zn6uM0LL25WhdDhNR%5R|8&r@Ex=KPmD*!N)Vag-+dZAw3&^em<0XyT_(I*ZaplrE$6c1k-a-Aw6rN*_@!&i)w(Tc2mg@}{Q6wwg8V$*7pL-Q-y4sGYYUNjT>N&U!~}-E0~CV{99s*XoOWsWm9RJE(C3Cl<wx`TADlW%;^R<Kv2M7BE0HZYVE?oAULf#>eODR*g@{*S8w4$d7Y1Udin*icjSB7U@3&XXf@7#Vz@HLycRxy+!d!`TYZG{0eSgQT$3Sb4@Y4DnCD|@yYplNsUh_IxY+_JFs~~jYH#Y#qh%STs4067!0QqBlmeui_3cntoezSh22PT8wHpbT<g?h{^`W#pm;x#pUQ2$-j?@=$KRLm`vYpns+mytQoL1z|2xI^YVen--yV(M6Xbks{&UpMNsXNf9m<dG$5QQ|L*%dEeqW>>ipk6K`Ph29jo2Am4{b!gYE1h>6xX)1hu9fgKf6loH+WZv`!~#7Fa3x&hvJ`+Z>ZH=wWh9S8?gq)*5O&Qub?o#*nOm|#D0dkCGa~->?e7UL;1pZKTGGE%_Z!-2>2v@^_Y447bWC>R|3Bb_;p~1eFtUJ+~hKpA3M)nZIJUhLT~VkDSnTkxc&YT_&lQ=FWYCv-d*;TkpI^bc%}p%BlgG6!$zZ=H*LRLjm7tk{IyZ86Ky?gAoVkq>%Cr$*BND8Yrnx*Vjm98gO%nvMDb(^`A16N&lrpElX<y>{BMnNKkldFVj7LNqD*d2FKrLItzJ`BeE*EIthoKwvf|^ey{vdU@1^pibiV4R`1TU=drSB&zE~jKdFKjO{w=-^-|{_SkJBXxt*bn3ZQmA_ty$63=3Ti0xBRGN7m^o#Pq?J?a^K2Ew@(lf$#%gjZxq4JEWUa{2*<*p%mw0NLQHmaI09T@Cy^j_2?5+Ol;8v*7!x)|V(tEj5ENtagy2v1aDiA?cO)c+f{vROx$27x;ck_%;E%`sTZK?mjBn*S;{L9X5KMM;Z3PttCty=lqJpq&mAl0wcvduH9K!MyYXlEZLB4qvCp3S1g}cSu1lLr`K{Y^j$mH{|a@n%go;IP)-RSfD1vV}<G$=RI2+E#mo{u|-LP5Xi=LGLcvJWXLBom=v$<0h-tbOyACXKjie-OP!H~;+kd%Ltgf{B>W2?<i|BGU>f_Asg2(R_y^9_nzE*ouYWvP65s;nku`@CKn6K)@UJKm?IcB7tXq_~WS;T7*y>GULG>TA=D7xUSkfrOgIz8Pg^^x}{4C{YiViv`J9!>?*VXueG%_vASkk%*G@d>W0;>(4I)J^Wt08wAy5ESRj!k1EJ{Fw}uAAj<EbLK#iSm+FhvH(*}BU_Zey6qRlYD#p2$u+*Qsx=&O!!B!ZO@-Wc_Ct-39&Y$eVU`8|L|V=3%&)Apru$dOHZnjMlwX4XHjHL}S5Lv@=tM`CN2=x+xq#%0>c&cabJ+08kkF)`$T{LT~o8!5Ljnsl@$!;#>;aF8Qhr$5ojIf7fGU{9uET)wgyItv=DVg$Gr4@LYaNYA<>BD#b=##6_}7@R=G!(Wn8M?6O6A4jN@PPU!Fc!2}!fq)R|352>uK_u}z3Nxo{gPns<e^)pFC&VCBB<Fy801k*^x4A#{z{hvIWwZNvsr~ls&}n%5c%$6IrrpnO)5vSrS)3Yu_I}T({SWBl`smqQF2?lPIsl_J6lbsd+Sm0JoV>=x^x1j=qYaeeI+;$P&mMno=hS=H^NuLppjm&==I?G!UZY}SZ2f^zwvfWi>NRu|C$D)io~=_b+RGK%Z{Wtpzm1b~%JkWK2BT~pPMbd#e?Qf4q&!>qV6;`Ce^n9vU7T_+e_<VzQRQArjvL$ml187cqcA$Ek+*8-_cZ!!y@gS2zDyeWgw}tBn!cgj1j(uQu;THQMxVV`F{)ig(#HQIPCb6vduX0&<ZT-MXBz!d|F5K!|CcoSY~6^_22K5I^ZBwypRF%3s%@`!{Jg`-`*Yd)ZsGr_$h<b++Wy1+{}zQlTW_eHUc9|p{WDx)Y~fM(e?Zi~V*XI-v3BjDF=^M)`57|LwoR7ue@UaCe;=hpyX>cpM^6{dnLc~Zt)}|g{%g?am+NHz+67;xKU;$r`#w_aKkM*Re+O;wH0nb;e~eeOU3rYqiT{XZomX2wlS=4+pDyfKH40k&{{yGp2ZR"
open("./kyomu", 'wb').write(zlib.decompress(base64.b85decode(exe_bin)))
subprocess.run(["chmod +x ./kyomu"], shell=True)
subprocess.run(["./kyomu"], shell=True)
| 1 | 2,259,504,025,670 | null | 70 | 70 |
def solve():
n, k = map(int, input().split())
s = list(map(int, input().split()))
s.sort(reverse=True)
if k >= n:
print(0)
exit()
else:
print(sum(s[k:]))
solve()
|
N, K = map(int, input().split())
Hlist = list(map(int, input().split()))
Hlist = sorted(Hlist)[::-1]
#user K super attack for largest K enemy
remainHlist = Hlist[K:]
attackTimes = sum(remainHlist)
print(attackTimes)
| 1 | 79,303,780,377,800 | null | 227 | 227 |
import sys
import time
import random
import math
from collections import deque
import heapq
import itertools
from decimal import Decimal
import bisect
from operator import itemgetter
MAX_INT = int(10e18)
MIN_INT = -MAX_INT
mod = 1000000000+7
sys.setrecursionlimit(1000000)
def IL(): return list(map(int,input().split()))
def SL(): return input().split()
def I(): return int(sys.stdin.readline())
def S(): return input()
def tami(ans):
res = 0
LastDay = [0]*26
for i in range(D):
res += s[i][ans[i]]
for j in range(26):
if ans[i] == j:
continue
res -= (i+1 - LastDay[j]) * c[j]
LastDay[ans[i]] = i+1
return res
def nasu():
res = []
LastDay = [0]*26
for d in range(1,D+1):
tmp = ["", 0]
for i in range(26):
if tmp[1] < s[d-1][i] + (d - LastDay[i]) * c[i]:
tmp = [i, s[d-1][i] + (d - LastDay[i]) * c[i]]
res.append(tmp[0])
LastDay[tmp[0]] = d
return res
def nbo(ans, score, num):
tmp_ans = ans[:]
for _ in range(num):
random_date = random.randint(0,D-1)
random_val = random.randint(0,25)
tmp_ans[random_date] = random_val
scoscore = tami(tmp_ans)
if scoscore > score:
return (True, tmp_ans, scoscore)
else:
return (False, tmp_ans, scoscore)
start = time.time()
D = I()
c = IL()
s = [IL() for i in range(D)]
ans = nasu()
#print(ans)
score = tami(ans)
#print(score)
end = time.time()
num = 4
while (time.time() - start) < 1.8:
judge, anans, scoscore = nbo(ans, score, num)
if judge == True:
ans, score = anans, scoscore
#print(ans)
#print(tami(ans))
for i in ans:
print(i+1)
|
import math
def main():
a,b,c = map(int,input().split())
left = 4*a*b
right = (c-a-b)**2
if (c-a-b)<0:
return 'No'
if left < right:
return 'Yes'
else:
return 'No'
print(main())
| 0 | null | 30,662,149,216,192 | 113 | 197 |
if __name__ == "__main__":
T = input()
ans = T
ans = ans.replace("P?", 'PD')
ans = ans.replace("??", 'PD')
ans = ans.replace("?D", 'PD')
ans = ans.replace("?", 'D')
print(ans)
|
b=1
input()
for a in map(int,input().split()):b|=b<<a
input()
for m in map(int,input().split()):print(['no','yes'][(b>>m)&1])
| 0 | null | 9,299,891,336,862 | 140 | 25 |
N = int(input())
if N%2==1:
print(0)
else:
counter = 0
tmp = 1
while True:
tmp *= 5
if tmp>N:
print(counter)
break
counter += N//(tmp*2)
|
import sys
n = int(input())
if n%2 == 1:
print(0)
sys.exit()
else:
cur_two, cur_ten = 2, 10
num_two, num_ten = 0, 0
while cur_two <= n:
num_two += n//cur_two
cur_two *= 2
while cur_ten <= n:
num_ten += n//cur_ten
cur_ten *= 5
print(min(num_two, num_ten))
| 1 | 116,546,866,516,850 | null | 258 | 258 |
def cube(x):
return x**3
n = int(input())
print(cube(n))
|
class XCubic:
def exe(self, x):
return x*x*x
if __name__ == "__main__":
x = int(raw_input())
xc = XCubic()
print(xc.exe(x))
| 1 | 278,496,438,720 | null | 35 | 35 |
N = int(input())
A = input().split()
num_list = [0] * 10**5
ans = 0
for i in range(N):
num_list[int(A[i])-1] += 1
for i in range(10**5):
ans += (i+1) * num_list[i]
Q = int(input())
for i in range(Q):
B, C = map(int, input().split())
ans = ans + C * num_list[B-1] - B * num_list[B-1]
num_list[C-1] += num_list[B-1]
num_list[B-1] = 0
print(ans)
|
class UnionFind(object):
def __init__(self, n=1):
self.par = [i for i in range(n)]
self.rank = [0 for _ in range(n)]
self.size = [1 for _ in range(n)]
def find(self, x):
if self.par[x] == x:
return x
else:
self.par[x] = self.find(self.par[x])
return self.par[x]
def union(self, x, y):
x = self.find(x)
y = self.find(y)
if x != y:
if self.rank[x] < self.rank[y]:
x, y = y, x
if self.rank[x] == self.rank[y]:
self.rank[x] += 1
self.par[y] = x
self.size[x] += self.size[y]
def is_same(self, x, y):
return self.find(x) == self.find(y)
def get_size(self, x):
x = self.find(x)
return self.size[x]
N, M = map(int, input().split())
u = UnionFind(N+1)
for i in range(M):
A, B = map(int, input().split())
u.union(A, B)
print(max([u.get_size(i) for i in range(1, N+1)]))
| 0 | null | 8,001,947,076,162 | 122 | 84 |
s=input()
n=len(s)
a="x"
for i in range(n-1):
a+="x"
print(a)
|
def a():
x :int = int(input())
if x == 1:
return 0
else:
return 1
if __name__ == '__main__':
print(a())
| 0 | null | 37,771,699,901,948 | 221 | 76 |
h,*s=open(0)
h,w,k,*m=map(int,h.split())
b=512
while b:
b-=1;r=t=j=0;d=[0]*h
while w-j:
i=c=0
while h-i:
d[c]+=s[i][j]>'0';f=d[c]>k
if(t<j)&f:r+=1;t=j;d=[0]*h;break
r+=h*w*f;c+=b>>i&1;i+=1
else:j+=1
m+=r+bin(b).count('1'),
print(min(m))
|
def d_semi_common_multiple():
from fractions import gcd
from functools import reduce
N, M = [int(i) for i in input().split()]
A = [int(i) // 2 for i in input().split()] # 先に2で割っておく
def count_divide_2(n):
"""n に含まれる因数 2 の指数"""
return (n & -n).bit_length()
def lcm(a, b):
return a * b // gcd(a, b)
# A の全要素について，2で割れる回数は等しいか？
tmp = count_divide_2(A[0])
for a in A:
if count_divide_2(a) != tmp:
return 0
t = reduce(lambda x, y: lcm(x, y), A)
return (M // t) - (M // (2 * t))
print(d_semi_common_multiple())
| 0 | null | 75,316,114,518,490 | 193 | 247 |
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())
from collections import defaultdict
from collections import Counter
import bisect
def main():
X = LS()
S_ = X[0]
T = X[1]
A, B = MI()
U = S()
if U == S_:
print(A - 1, B)
else:
print(A, B - 1)
if __name__ == "__main__":
main()
|
import math
N=int(input())
A=[int(x) for x in input().split()]
ans=0
A=sorted(A)
ans+=A[N-1]
for i in range(1,N-1):
ans+=A[N-1-math.ceil(i/2)]
print(ans)
| 0 | null | 40,672,212,795,982 | 220 | 111 |
a, b, c = list(map(int, input().split()))
if a == b == c:
print('No')
elif a == b:
print('Yes')
elif b == c:
print('Yes')
elif a == c:
print('Yes')
else:
print('No')
|
N = int(input())
S = input()
res = ''
for c in S:
res += chr((ord(c) - ord('A') + N) % 26 + ord('A'))
print(res)
| 0 | null | 101,065,643,518,320 | 216 | 271 |
x, k, d = map(int, input().split())
x = abs(x)
if x > k*d:
print(x-k*d)
else:
p = x//d
c = k-p
if (c%2 == 0):
print(abs(x-p*d))
else:
print(abs(d-abs(x-p*d)))
|
n=int(input())
s=input()
if n%2==1:
print('No')
else:
t=n//2
x=s[:t]
y=s[t:]
if x==y:
print('Yes')
else:
print('No')
| 0 | null | 75,950,645,902,428 | 92 | 279 |
D = int(input())
c = list(map(int, input().split()))
s = [list(map(int, input().split())) for i in range(D)]
t = [int(input()) for i in range(D)]
last = [0]*26
S = 0
for d in range(1, D+1):
# last更新
for j in range(26):
if j == t[d-1]-1:
last[j] = d
# plus部分
S += s[d-1][t[d-1]-1]
# minus部分
m = 0
for j in range(26):
m += c[j] * (d-last[j])
S -= m
print(S)
|
def main():
N = input()
len_N = len(N)
K = int(input())
dp = [[[0] * 2 for _ in range(K + 5)] for _ in range(len_N + 5)]
dp[0][0][0] = 1
for i in range(len_N):
tmp = int(N[i])
for j in range(K+1):
# l : 1 => N より小さいことが確定
for l in range(2):
for x in range(10):
if l == 0:
if x > tmp:
continue
elif x == tmp:
if x == 0:
dp[i+1][j][0] += dp[i][j][0]
else:
dp[i+1][j+1][0] += dp[i][j][0]
else:
if x == 0:
dp[i+1][j][1] += dp[i][j][0]
else:
dp[i+1][j+1][1] += dp[i][j][0]
if l == 1:
if x == 0:
dp[i+1][j][1] += dp[i][j][1]
else:
dp[i+1][j+1][1] += dp[i][j][1]
print(dp[len_N][K][0] + dp[len_N][K][1])
if __name__ == "__main__":
main()
| 0 | null | 43,071,763,706,972 | 114 | 224 |
def resolve():
k = int(input())
a, b = list(map(int, input().split()))
for i in range(a, b + 1):
if i % k == 0:
print('OK')
return
print('NG')
resolve()
|
if(int(input()) %2 == 1):
print("No")
exit()
t = input()
if(t[:len(t)//2] == t[len(t)//2:]):
print("Yes")
else:
print("No")
| 0 | null | 86,726,760,617,698 | 158 | 279 |
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:
card = input()
if card == '-' : break
n = int(input())
for _ in range(n):
x = int(input())
card = card[x:len(card)] + card[0:x]
print(card)
| 1 | 1,881,243,297,228 | null | 66 | 66 |
N, K = map(int, input().split())
MOD = 998244353
t = []
for _ in range(K):
l, r = map(int, input().split())
t.append((l, r))
dp = [0]*(N+1)
dp[1] = 1
dps = [0]*(N+1)
dps[1] = 1
for i in range(2, N+1):
for j in range(K):
li = i-t[j][0]
ri = i-t[j][1]
if li < 0:
continue
ri = max(ri, 1)
dp[i] += dps[li]-dps[ri-1]
dp[i] %= MOD
dps[i] = dps[i-1]+dp[i]
dps[i] %= MOD
print(dp[N])
|
import math
import sys
import os
sys.setrecursionlimit(10**7)
def _S(): return sys.stdin.readline().rstrip()
def I(): return int(_S())
def LS(): return list(_S().split())
def LI(): return list(map(int,LS()))
if os.getenv("LOCAL"):
inputFile = basename_without_ext = os.path.splitext(os.path.basename(__file__))[0]+'.txt'
sys.stdin = open(inputFile, "r")
INF = float("inf")
MOD = 998244353
# もらうDP(forcus on destination), 区間の和を足しこむ=累積和
N,K = LI()
LRs = [LI() for _ in range(K)]
dp = [0]*(N+1)
cum = [0]*(N+1)
dp[1] = 1
cum[1] = 1
for i in range(2, N+1):
for j in range(K):
l, r = LRs[j]
start = max(0,i-r-1)
end = max(0,i-l)
dp[i] += cum[end] - cum[start]
dp[i] %= MOD
# 累積和を更新
cum[i] = (cum[i-1] + dp[i]) % MOD
ans = dp[N]
print(ans)
| 1 | 2,661,652,894,278 | null | 74 | 74 |
import random
s = input()
len_s = len(s)
if len_s==3:
num = 0
else:
num = random.randint(0,len_s-4)
name = s[num]+s[num+1]+s[num+2]
print(name)
|
import sys
import collections
input_methods=['clipboard','file','key']
using_method=0
input_method=input_methods[using_method]
tin=lambda : map(int, input().split())
lin=lambda : list(tin())
mod=998244353
#+++++
def main():
n = int(input())
#b , c = tin()
#s = input()
al = lin()
if al[0] != 0:
return 0
if al.count(0) != 1:
return 0
alc = collections.Counter(al)
mm = max(alc.keys())
b = alc.keys()
b=list(b)
b.sort()
if list(range(mm+1)) != b:
#pa('rrrr')
return 0
v = 1
p=1
for k in range(1, mm+1):
num = alc[k]
add = pow(p, num, mod)
v *= add
v %= mod
p = num
return v
#+++++
isTest=False
def pa(v):
if isTest:
print(v)
def input_clipboard():
import clipboard
input_text=clipboard.get()
input_l=input_text.splitlines()
for l in input_l:
yield l
if __name__ == "__main__":
if sys.platform =='ios':
if input_method==input_methods[0]:
ic=input_clipboard()
input = lambda : ic.__next__()
elif input_method==input_methods[1]:
sys.stdin=open('inputFile.txt')
else:
pass
isTest=True
else:
pass
#input = sys.stdin.readline
ret = main()
if ret is not None:
print(ret)
| 0 | null | 84,831,562,857,090 | 130 | 284 |
cin = open(0).read().strip().split('\n')
n = int(cin[0])
g = [list(map(lambda x: int(x)-1, a.split(' ')[2:])) for a in cin[1:]]
first_order = [-1] * n
last_order = [-1] * n
ptr = 1
def dfs(g, seen, idx):
global first_order, first_order, ptr
first_order[idx] = ptr
ptr += 1
seen[idx] = True
for i in g[idx]:
# idxから行ける各頂点について
if seen[i]: continue
dfs(g, seen, i)
last_order[idx] = ptr
ptr += 1
seen = [False] * n
dfs(g, seen, 0)
# 孤立している頂点対策
for i in range(n):
if not seen[i]:
ans = dfs(g, seen, i)
# 出力
for idx, (f, l) in enumerate(zip(first_order, last_order)):
print(idx+1, f, l)
|
n = int(input())
graph = [[0 for i in range(n)] for j in range(n)]
d = [0] * n
f = [0] * n
g = [0] * n
time = 0
for i in range(n):
a = list(map(int, input().split()))
for j in range(0, a[1], 1):
graph[a[0] - 1][a[2 + j] - 1] = 1
def search(i):
global time
time = time + 1
d[i] = time
g[i] = 1
for j in range(n):
if (graph[i][j] == 1) & (g[j] == 0):
search(j)
time = time + 1
f[i] = time
for i in range(n):
if g[i] == 0:
search(i)
[print(i+1, d[i], f[i]) for i in range(n)]
| 1 | 2,781,186,910 | null | 8 | 8 |
a = list(input())
b = list(input())
ans = 0
for p, q in zip(a, b):
if p != q:
ans += 1
print(ans)
|
N, K, *A = map(int, open(0).read().split())
MAX = 10 ** 5 + 1
MOD = 10 ** 9 + 7
# Factorial
fac = [0] * (MAX + 1)
fac[0] = 1
fac[1] = 1
for i in range(2, MAX + 1):
fac[i] = fac[i - 1] * i % MOD
# Inverse factorial
finv = [0] * (MAX + 1)
finv[MAX] = pow(fac[MAX], MOD - 2, MOD)
for i in reversed(range(1, MAX + 1)):
finv[i - 1] = finv[i] * i % MOD
def comb(n, k):
if n < k or k < 0:
return 0
return (fac[n] * finv[k] * finv[n - k]) % MOD
A.sort()
ans = 0
for i in range(N):
if i >= K - 1:
ans += comb(i, K - 1) * A[i]
if i + K - 1 < N:
ans -= comb(N - i - 1, K - 1) * A[i]
ans %= MOD
print(ans)
| 0 | null | 53,377,527,060,480 | 116 | 242 |
S , W = (int(a) for a in input().split())
if S <= W :
print("unsafe")
else : print("safe")
|
#import numpy as np
#import math
#from decimal import *
#from numba import njit
#@njit
def main():
S,W = map(int, input().split())
if S <= W:
print('unsafe')
else:
print('safe')
main()
| 1 | 29,100,242,389,052 | null | 163 | 163 |
# coding: utf-8
import sys
ans = []
while ( 1 ):
strings = input()
if (len(strings) == 1 and int(strings[0]) == 0):
break
ans = 0
for s in strings:
ans += int(s)
print(ans)
|
x = 1
while x != '0':
x = input()
if x != '0':
sum = 0
for s in x:
sum += int(s)
print(sum)
| 1 | 1,613,649,335,390 | null | 62 | 62 |
a, b = map(int, input().split())
print('{} {} {:f}'.format(a//b, a%b, a/b))
|
a, b = map(int, input().split())
print('{:d} {:d} {:.10f}'.format(a//b, a%b, a/b))
| 1 | 600,467,014,080 | null | 45 | 45 |
n, m = map(int, input().split())
x, y = (m+1) // 2, m // 2
for i in range(x):
print(1+i, 2*x-i)
for i in range(y):
print(2*x+1+i, 2*x+1+2*y-i)
|
class UnionFind():
def __init__(self, n):
self.parents = [-1]*n
def root(self, x):
if self.parents[x] < 0:
return x
else:
return self.root(self.parents[x])
def unite(self, x, y):
x = self.root(x)
y = self.root(y)
if x == y:
return
else:
if x > y:
x, y = y, x
self.parents[x] += self.parents[y]
self.parents[y] = x
return
n, m, k = map(int, input().split())
ab = [list(map(int, input().split())) for _ in range(m)]
cd = [list(map(int, input().split())) for _ in range(k)]
u = UnionFind(n)
f = [set() for _ in range(n)]
l = [set() for _ in range(n)]
for a, b in ab:
a, b = a-1, b-1
f[a].add(b)
f[b].add(a)
u.unite(a, b)
for c, d in cd:
c, d = c-1, d-1
l[c].add(d)
l[d].add(c)
ans = [0] * n
for i in range(n):
r = u.root(i)
bl = 0
for j in l[i]:
if u.root(j) == r:
bl += 1
ans[i] = -u.parents[r] - len(f[i]) - bl - 1
print(*ans)
| 0 | null | 45,437,670,297,408 | 162 | 209 |
num = input()
num1,num2 = num.split(' ')
num1 = int(num1)
num2 = int(num2)
if num1 > 9 or num2 > 9:
print('-1')
else:
print (num1 * num2)
|
n,m = map(int,input().split())
if 0 < n and n < 10 and 0 < m and m < 10:
print(n*m)
else:
print(-1)
| 1 | 158,023,192,525,080 | null | 286 | 286 |
s = input()
t = input()
cnt = 0
for i in range (len(s)):
if s[i] == t[i]:
cnt += 1
if cnt == len(s) and len(t) - len(s) == 1:
print("Yes")
else:
print("No")
|
S = input()
T = input()
if S == T[:-1]:
print('Yes')
else:
print('No')
| 1 | 21,466,475,977,264 | null | 147 | 147 |
n = int(input())
a = list(map(int,input().split()))
q = int(input())
m = list(map(int,input().split()))
cnt = [0] * (2000 * 20)
for i in range(1, 2**n + 1):
SUM = 0
for j in range(n):
if i>>j & 1:
SUM += a[j]
cnt[SUM] = 1
for _m in m:
if cnt[_m] == 1:
print("yes")
else:
print("no")
|
n = int(raw_input())
A = map(int, raw_input().split())
d = {}
def soleve(i, m, n):
if m == 0:
return True
if i >= n:
return False
if d.has_key((i, m)):
return d[(i, m)]
res = soleve(i + 1, m, n) or soleve(i + 1, m - A[i], n)
d[(i, m)] = res
return res
q = int(raw_input())
M = map(int, raw_input().split())
for m in M:
if soleve(0, m, n):
print 'yes'
else:
print 'no'
| 1 | 102,794,944,252 | null | 25 | 25 |
n=int(input())
a=list(map(int,input().split(' ')))
sw=0
flag=False
for i in range(n):
flag=False
for j in range(i+1,n)[::-1]:
if a[j]<a[j-1]:
a[j],a[j-1]=a[j-1],a[j]
flag=True
sw=sw+1
if not flag: break
print(" ".join(map(str,a)))
print(str(sw))
|
n, m, l = map(int, input().split())
a = [list(map(int, input().split())) for _ in range(n)]
b = [list(map(int, input().split())) for _ in range(m)]
for i in range(n):
for j in range(l):
print(sum(a[i][k] * b[k][j] for k in range(m)), end='')
if j != l - 1:
print(' ', end='')
print('')
| 0 | null | 733,784,572,406 | 14 | 60 |
#!/usr/bin/env python3
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 998244353
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def C(n, r):
return fact[n] * pow(fact[n-r], mod-2, mod) * pow(fact[r], mod-2, mod) % mod
n, m, k = LI()
fact = [1] * (n+1)
for i in range(1, n+1):
fact[i] = fact[i-1] * i
fact[i] %= mod
ans = 0
for i in range(k+1):
ans += C(n-1, i) * m * pow(m-1, n-1-i, mod)
ans %= mod
print(ans)
|
def main():
N, M, K = [int(x) for x in input().split()]
if M == 1:
if K == N - 1:
return 1
else:
return 0
if N == 1:
return M
mod = 998244353
fact = [1]
for i in range(1, N):
fact.append(fact[-1] * i % mod)
fact_inv = [pow(fact[-1], mod - 2, mod)]
for n in range(N - 1, 0, -1):
fact_inv.append(fact_inv[-1] * n % mod)
fact_inv = fact_inv[::-1]
m_1_pow = [1]
for _ in range(N):
m_1_pow.append(m_1_pow[-1] * (M - 1) % mod)
count = 0
for k in range(K + 1):
current = ((((m_1_pow[N - k - 1] * M) % mod) * fact[N - 1] % mod) * fact_inv[k] % mod) * fact_inv[N - 1 - k] % mod
count = (count + current) % mod
return count
if __name__ == "__main__":
print(main())
| 1 | 23,219,954,147,170 | null | 151 | 151 |
from collections import namedtuple
Card = namedtuple('Card', 'suit value')
def BubbleSort(C):
for i in range(len(C)):
for j in range(len(C)-1,i,-1):
if C[j].value < C[j-1].value:
C[j],C[j-1] = C[j-1],C[j]
def SelectionSort(C):
for i in range(len(C)):
mini = i
for j in range(i,len(C)):
if C[j].value < C[mini].value:
mini = j
C[i],C[mini] = C[mini],C[i]
def checkStable(C0, C1):
result = True
for i in range(1,10):
f0 = [x.suit for x in list(filter(lambda c: c.value==i,C0))]
f1 = [x.suit for x in list(filter(lambda c: c.value==i,C1))]
if f0!=f1:
result = False
return result
if __name__=='__main__':
N = int(input())
Co = list(map(lambda X: Card(X[0],int(X[1])), map(list, input().split())))
Cb,Cs = [Co[:] for _ in range(2)]
for C, Sort in zip([Cb,Cs], [BubbleSort, SelectionSort]):
Sort(C)
print(*["".join([X.suit,str(X.value)]) for X in C])
print("Stable" if checkStable(Co,C) else "Not stable")
|
N = int(input())
Al = input().split()
A = list( map((lambda x: int(x)), Al))
num = 0
ma = 10**9 + 7
li = 0
for i in range(N-1, 0, -1):
li += A[i]
num += A[i-1] * li
num = num % ma
print(num)
| 0 | null | 1,938,985,702,686 | 16 | 83 |
n, m = map(int, input().split())
ar = list(map(int, input().split()))
add = sum(ar)
check = add / (4 * m)
amt = 0
for num in ar:
if num >= check:
amt += 1
if amt >= m:
print("Yes")
else:
print("No")
|
N = int(input())
print(N // 2 - 1 if N % 2 == 0 else (N-1) // 2)
| 0 | null | 96,301,442,921,530 | 179 | 283 |
S = input()
l = [0] * (len(S)+1)
r = [0] * (len(S)+1)
for i in range(len(S)):
if S[i] == '<':
l[i+1] = l[i] + 1
for i in range(len(S)-1,-1,-1):
if S[i] == '>':
r[i] = r[i+1] + 1
print(sum([max(l[i],r[i]) for i in range(len(S)+1)]))
|
a, b, c = map(int, input().split())
print('Yes' if (a==b and a!=c) or (a==c and a!=b) or (b==c and b!=a) else 'No')
| 0 | null | 112,154,540,244,508 | 285 | 216 |
from collections import defaultdict
d = defaultdict(list)
for i in range(-120, 121):
for j in range(-120, 121):
x = i**5 - j**5
if x >= 1:
d[x] = [i, j]
X = int(input())
print('{0[0]} {0[1]}'.format(d[X]))
|
X = int(input())
A = []
for i in range(200):
A.append(pow(i, 5))
for i in range(200):
for j in range(200):
a = abs(A[i] - A[j])
b = A[i] + A[j]
if a == X:
if i <= j:
B = [j, i]
else:
B = [i, j]
print(' '.join(map(str, B)))
exit()
elif b == X:
B = [i, -j]
print(' '.join(map(str, B)))
exit()
| 1 | 25,670,334,382,704 | null | 156 | 156 |
n = int(input())
ans = 0
for i in range(1,n+1):
if (i % 3 == 0) or (i % 5 == 0):
pass
else:
ans += i
print(ans)
|
x=int(input())
t=0
for i in range(1,x+1):
if i%3!=0 and i%5!=0:
t+=i
print(t)
| 1 | 35,093,221,195,678 | null | 173 | 173 |
import sys
read = sys.stdin.read
readlines = sys.stdin.readlines
from math import ceil
def main():
n, k = map(int, input().split())
a = tuple(map(int, input().split()))
def kaisu(long):
return(sum([ceil(ae/long) - 1 for ae in a]))
def bs_meguru(key):
def isOK(index, key):
if kaisu(index) <= key:
return True
else:
return False
ng = 0
ok = max(a)
while abs(ok - ng) > 1:
mid = (ok + ng) // 2
if isOK(mid, key):
ok = mid
else:
ng = mid
return ok
print(bs_meguru(k))
if __name__ == '__main__':
main()
|
N,K = list(map(int,input().split()))
A = list(map(int,input().split()))
NG=0
OK=max(A)+1
while OK-NG>1:
mid = (OK+NG)//2
cur=0
for x in A:
cur += (x-1)//mid
if cur > K:
NG=mid
else:
OK=mid
print(OK)
| 1 | 6,529,826,679,630 | null | 99 | 99 |
import sys, bisect, math, itertools, heapq, collections
from operator import itemgetter
# a.sort(key=itemgetter(i)) # i番目要素でsort
from functools import lru_cache
# @lru_cache(maxsize=None)
sys.setrecursionlimit(10**8)
input = sys.stdin.readline
INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inp():
'''
一つの整数
'''
return int(input())
def inpl():
'''
一行に複数の整数
'''
return list(map(int, input().split()))
class SegmentTree():
def __init__(self, init_val, N):
"""
Parameters
----------
init_val:int
identity element
N:int
the number of nodes
"""
self.init_val=init_val
# Range Minimum Query
self.N0 = 2**(N-1).bit_length()
# 0-indexedで管理
self.data = [self.init_val] * (2 * self.N0)
def _segfunc(self, left, right):
res= left | right
return res
def update(self,k, x):
"""
Parameters
----------
k:int
target index(0-index)
x:any
target value
"""
k += self.N0-1
self.data[k] = x
while k > 0:
k = (k - 1) // 2
self.data[k] = self._segfunc(self.data[2*k+1], self.data[2*k+2])
def query(self, l, r):
"""
Parameters
----------
l,r:int
target range [l,r)
Return
----------
res:any
val
"""
L = l + self.N0
R = r + self.N0
s = self.init_val
while L < R:
if R & 1:
R -= 1
s = self._segfunc(s, self.data[R-1])
if L & 1:
s = self._segfunc(s,self.data[L-1])
L += 1
L >>= 1; R >>= 1
return s
n=inp()
s=input()
st = SegmentTree(0,n)
for i in range(n):
st.update(i,1<<(int.from_bytes(s[i].encode(),'little')-int.from_bytes('a'.encode(),'little')))
q = inp()
ans = []
for i in range(q):
mode, first, second = input().split()
if mode == "1":
st.update(int(first)-1,1<<(int.from_bytes(second.encode(),'little')-int.from_bytes('a'.encode(),'little')))
else:
ans.append(bin(st.query(int(first) - 1, int(second))).count("1"))
for i in ans:
print(i)
|
from bisect import bisect_left, bisect_right, insort_left
import sys
readlines = sys.stdin.readline
def main():
n = int(input())
s = list(input())
q = int(input())
d = {}
flag = {}
for i in list('abcdefghijklmnopqrstuvwxyz'):
d.setdefault(i, []).append(-1)
flag.setdefault(i, []).append(-1)
for i in range(n):
d.setdefault(s[i], []).append(i)
for i in range(q):
q1,q2,q3 = map(str,input().split())
if q1 == '1':
q2 = int(q2) - 1
if s[q2] != q3:
insort_left(flag[s[q2]],q2)
insort_left(d[q3],q2)
s[q2] = q3
else:
ans = 0
q2 = int(q2) - 1
q3 = int(q3) - 1
if q2 == q3:
print(1)
continue
for string,l in d.items():
res = 0
if d[string] != [-1]:
left = bisect_left(l,q2)
right = bisect_right(l,q3)
else:
left = 0
right = 0
if string in flag:
left2 = bisect_left(flag[string],q2)
right2 = bisect_right(flag[string],q3)
else:
left2 = 0
right2 = 0
if left != right:
if right - left > right2 - left2:
res = 1
ans += res
#print(string,l,res)
print(ans)
if __name__ == '__main__':
main()
| 1 | 62,809,952,520,800 | null | 210 | 210 |
X, K, D = map(int,input().split())
res = 0
X = abs(X)
if X >= K * D:
res = X - K * D
else:
i = X // D
j = K - i
if j % 2 == 0:
res = X - D * i
else:
res = X - D * (i + 1)
print(abs(res))
|
first_place, K, Distance = map(int, input().split())
first_place = abs(first_place)
test = first_place
if first_place - Distance*K > 0:
print(first_place -Distance*K)
else:
for i in range(1,K+1):
test -= Distance
if test <= 0:
a = i
#print(a)
break
if (K-a)%2 == 0 or K-a == 0:
print(abs(first_place - Distance*a))
else:
print(abs(first_place - Distance*(a-1)))
| 1 | 5,178,965,246,752 | null | 92 | 92 |
def solution(N):
ans = 0
for i in range(N-1, int(N/2), -1):
j = N-i
ans+=1
return ans
test_input = input()
test_input = int(test_input)
print(solution(test_input))
|
n, x, t = map(int, input().split())
answer = -((-n)//x)*t
print(answer)
| 0 | null | 78,943,094,469,262 | 283 | 86 |
n = int(input())
a = list(map(int, input().split()))
num = 1
if 0 in a:
num = 0
else:
for i in a:
num *= i
if 10**18 < num:
num = -1
break
print(num)
|
#https://atcoder.jp/contests/ddcc2020-qual/tasks/ddcc2020_qual_a
XY=input().split()
X=int(XY[0])
Y=int(XY[1])
award=0
if X==1 and Y==1:
award+=400000
for num in [X,Y]:
if num==3:
award+=100000
if num==2:
award+=200000
if num==1:
award+=300000
print(award)
| 0 | null | 78,757,523,622,400 | 134 | 275 |
n,k = map(int,input().split())
print(min(n%k,-((n%k)-k)))
|
N, K = map(int, input().split())
if N < K:
print(min(abs(N - K), N))
else:
div, mod = divmod(N, K)
print(min(abs(mod-K), mod))
| 1 | 39,213,116,345,890 | null | 180 | 180 |
def mod_inverse(x, mod):
return pow(x, mod - 2, mod)
# return nCk % mod
# it takes O(k)
def mod_comb(n, k, mod):
numer, denom = 1, 1
for i in range(k):
numer = numer * ((n - i) % mod) % mod
denom = denom * ((i + 1) % mod) % mod
return numer * mod_inverse(denom, mod) % mod
mod = 10**9 + 7
n, a, b = map(int, input().split())
ans = pow(2, n, mod) - 1
ans = (ans - mod_comb(n, a, mod)) % mod
ans = (ans - mod_comb(n, b, mod)) % mod
ans = (ans + mod) % mod
print(ans)
|
n, a, b = map(int, input().split())
MOD = 10**9 + 7
def comb(n, r, mod):
if r > n-r:
r = n - r
res_X = 1
for i in range(n-r+1, n+1):
res_X = (res_X * i)%mod
res_Y = 1
for i in range(1, r+1):
res_Y = (res_Y * i)%mod
return (res_X * pow(res_Y, mod-2, mod))%mod
base = (pow(2, n, MOD) - 1)%MOD
a = comb(n, a, MOD)
b = comb(n, b, MOD)
print((base - a - b)%MOD)
| 1 | 66,372,258,592,288 | null | 214 | 214 |
# coding: utf-8
# Here your code !
import collections
p,q=map(int,input().split())
count =0
deq = collections.deque()
finished=[]
while 1:
try:
deq.append(input().split())
except EOFError:
break
while deq:
d = deq.popleft()
d[1]=int(d[1])
if d[1]<=q:
count+=d[1]
d[1]=count
finished.append(map(str,d))
elif d[1]>q:
d[1]-=q
count+=q
deq.append(d)
for f in finished:
print(" ".join(f))
|
A,B,C,D,E=map(int,input().split())
if A==0 :
print(1)
elif B==0:
print(2)
elif C==0:
print(3)
elif D==0:
print(4)
else :
print(5)
| 0 | null | 6,675,124,526,720 | 19 | 126 |
n = int(input())
M = int(n**(0.5))
ans = [0]*(n+1)
for x in range(1,M+1):
for y in range(1,10**2):
for z in range(1,10**2):
if x**2+y**2+z**2+x*y+y*z+z*x > n:
break
ans[x**2+y**2+z**2+x*y+y*z+z*x] += 1
if x**2+y**2 > n:
break
for i in range(n):
print(ans[i+1])
|
n=int(input())
a=[0]*10001
for i in range(1,101):
for j in range(1,101):
for k in range(1,101):
v=i**2+j**2+k**2+i*j+j*k+k*i
if v<10001:
a[v]+=1
for m in range(n):
print(a[m+1])
| 1 | 7,911,867,344,008 | null | 106 | 106 |
# shell sort
def insertion_sort(a, n, g, cnt):
for i in range(g, n):
v = a[i]
j = i - g
while j>=0 and a[j]>v:
a[j+g] = a[j]
j = j - g
cnt += 1
a[j+g] = v
return cnt
def shell_sort(a, n, G, cnt):
for i in range(m):
cnt = insertion_sort(a, n, G[i], cnt)
return cnt
# input
N = int(input())
nums = [0]*N
for i in range(N):
nums[i] = int(input())
# initialization
G = [1]
h = 1
while h<N:
h = 3*h + 1
while h>1:
h = (h - 1) // 3
G.append(h)
G = sorted(list(set(G)), reverse=True)
m = len(G)
cnt = 0
# sorting
cnt = shell_sort(nums, N, G, cnt)
# output
print(m)
print(" ".join(map(str, G)))
print(cnt)
for i in range(N):
print(nums[i])
|
from math import gcd
n=int(input())
a=list(map(int,input().split()))
x=[-1]*(10**6+5)
x[0]=0
x[1]=1
i=2
while i<=10**6+1:
j=2*i
if x[i]==-1:
x[i]=i
while j<=10**6+1:
x[j]=i
j+=i
i+=1
z=[0]*(10**6+5)
g=gcd(a[0],a[0])
for i in range(n):
g=gcd(g,a[i])
if g!=1:
print("not coprime")
else:
f=0
for i in range(n):
p=1
while a[i]>=2:
if p==x[a[i]]:
a[i]=a[i]//p
continue
else:
p=x[a[i]]
z[p]+=1
a[i]=a[i]//p
for i in range(10**6+1):
if z[i]>=2:
f=1
print("pairwise coprime" if f==0 else "setwise coprime")
| 0 | null | 2,059,780,836,990 | 17 | 85 |
n,m=map(int,input().split())
p,s=[],[]
for i in range(m):
a,b=map(str,input().split())
p.append(int(a))
s.append(b)
c,e=0,0
l=[0]*n
for i in range(m):
if s[i]=="WA" and l[p[i]-1]==0:
e+=1
elif s[i]=="AC" and l[p[i]-1]==0:
c+=1
l[p[i]-1]=1
for i in range(m):
if s[i]=="WA" and l[p[i]-1]==0:
e-=1
print(str(c)+" "+str(e))
|
n, m = map(int, input().split())
ans = [0, 0]
ac = [0 for _ in range(n)]
for _ in range(m):
p, s = input().split()
p = int(p) - 1
if ac[p] == -1:
continue
elif s == "AC":
ans[0] += 1
ans[1] += ac[p]
ac[p] = -1
else:
ac[p] += 1
print(*ans)
| 1 | 93,327,639,340,820 | null | 240 | 240 |
n = int(input())
a = [i for i in range(1,n+1) if (i%3==0 or "3" in list(str(i)))]
print(" ",end="")
print(*a,sep=" ")
|
def call(n):
s = ""
for i in range(1,n+1):
if i%3 == 0:
s += " {0}".format(i)
else:
x = i
while x > 0:
if x%10 == 3:
s += " {0}".format(i)
break
x = x // 10
print(s)
m = int(input())
call(m)
| 1 | 931,099,384,000 | null | 52 | 52 |
import os, sys, re, math
S = input()
dow = ['SUN', 'MON', 'TUE', 'WED', 'THU', 'FRI', 'SAT']
print(7 - dow.index(S))
|
#!/usr/bin/env python3
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
s = input()
day = ['SUN', 'MON', 'TUE', 'WED', 'THU', 'FRI', 'SAT']
print(7 - day.index(s))
| 1 | 133,224,909,035,428 | null | 270 | 270 |
def check_x(x: int) -> int:
return 1 if x == 0 else 0
if __name__=='__main__':
print(check_x(int(input())))
|
print(int(not(int(input()))))
| 1 | 2,974,811,394,390 | null | 76 | 76 |
N = int(input())
S = input()
r = S.count('R')
ans = r - S[:r].count('R')
print(ans)
|
N=int(input())
c=str(input())
num_R = c.count("R")
num_W = 0
ans = []
if num_R >= num_W:
ans.append(num_R)
else:
ans.append(num_W)
#print(ans)
for i in range(len(c)):
if c[i] == "R":
num_R -= 1
else:
num_W += 1
if num_R >= num_W:
ans.append(num_R)
else:
ans.append(num_W)
#print(ans)
print(min(ans))
| 1 | 6,329,103,977,056 | null | 98 | 98 |
import sys
n = int(sys.stdin.readline().rstrip("\n"))
if n % 2 == 0:
print(n // 2)
else:
print(n // 2 + 1)
|
N,X,T=map(int,input().split())
count = 0
ans = 0
while count < N:
count += X
ans +=T
print(ans)
| 0 | null | 31,722,558,146,400 | 206 | 86 |
n=int(input())
s=input()
ans=""
for i in s:
ans+=chr(ord("A")+(ord(i)-ord("A")+n)%26)
print(ans)
|
# 与えられた数値の桁数と桁値の総和を計算する.
def calc_digit_sum(num):
digits = sums = 0
while num > 0:
digits += 1
sums += num % 10
num //= 10
return digits, sums
n = int(input())
s = [((ord(ch) - 65 + n) % 26) + 65 for ch in input()]
print("".join(map(chr, s)))
| 1 | 133,827,053,709,932 | null | 271 | 271 |
s = input()
k = int(input())
if len(set(s)) == 1:
print((len(s)*k)//2)
exit()
ss = s + s
shoko = 0
prev = ''
cnt = 0
for i in range(len(s)):
if s[i] == prev:
cnt += 1
else:
shoko += cnt // 2
cnt = 1
prev = s[i]
shoko += cnt // 2
kosa = 0
prev = ''
cnt = 0
for i in range(len(ss)):
if ss[i] == prev:
cnt += 1
else:
kosa += cnt // 2
cnt = 1
prev = ss[i]
kosa += cnt // 2
kosa -= shoko
print(shoko + (k-1)*kosa)
|
s=input()
k=int(input())
cnt=1
temp=[]
for i in range(len(s)-1):
if s[i]==s[i+1]: cnt+=1
else:
temp.append([s[i],cnt])
cnt=1
if cnt>=1: temp.append([s[-1],cnt])
if len(temp)==1:
print(k*len(s)//2)
exit()
ans=0
if temp[0][0]!=temp[-1][0]:
for pair in temp:
if pair[1]!=1: ans+=pair[1]//2
print(ans*k)
else:
for pair in temp[1:-1]:
if pair[1]!=1: ans+=pair[1]//2
ans*=k
ans+=(k-1)*((temp[0][1]+temp[-1][1])//2)
ans+=temp[0][1]//2+temp[-1][1]//2
print(ans)
| 1 | 175,252,061,296,632 | null | 296 | 296 |
n, m = map(int, input().split())
ans = 0
if n >= 2: ans += n * (n - 1) / 2
if m >= 2: ans += m * (m - 1) / 2
print(int(ans))
|
N, M = map(int, input().split())
totalN = 1/2*(N-1)*N
totalM = 1/2*(M-1)*M
import math
print(math.floor(totalN + totalM))
| 1 | 45,426,616,760,640 | null | 189 | 189 |
N = int(input())
ST = []
cnt = 0
for _ in range(N):
s, t = input().split()
ST.append([s, t])
cnt += int(t)
X = input()
for i in range(N):
s, t = ST[i]
cnt -= int(t)
if s == X:
break
print(cnt)
|
n = int(input())
playlists = []
for _ in range(n):
title, playtime = input().split()
playlists.append([title, int(playtime)])
titles, playtimes = list(zip(*playlists))
lastmusic = input()
lastmusic_timing = titles.index(lastmusic)
print(sum(playtimes[lastmusic_timing + 1:]))
| 1 | 96,883,167,877,898 | null | 243 | 243 |
import sys
sys.setrecursionlimit(10**6) #再帰関数の上限
import math
from copy import copy, deepcopy
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#累積和
#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する
def input(): return sys.stdin.readline()[:-1]
def printl(li): print(*li, sep="\n")
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 main():
mod = 10**9+7
#w.sort(key=itemgetter(1),reversed=True) #二個目の要素で降順並び替え
N = 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)) #改行行列
if N%2!=0:
print(N//2+1)
exit()
print(N//2)
if __name__ == "__main__":
main()
|
from math import gcd
K = int(input())
count = 0
for a in range(1,K+1):
for b in range(1,K+1):
l = gcd(a,b)
for c in range(1,K+1):
count += gcd(l,c)
print(count)
| 0 | null | 47,201,930,649,720 | 206 | 174 |
def main(S, T):
N = len(S)
ans = 0
for i in range(N//2):
if S[i] != T[i]:
ans += 1
if S[-1-i] != T[-1-i]:
ans += 1
if N%2 == 1:
if S[N//2] != T[N//2]:
ans += 1
return ans
if __name__ == '__main__':
S = input()
T = input()
ans = main(S, T)
print(ans)
|
n = input()
p = input()
s = len(n)
count = 0
for i in range(s):
if n[i] != p[i]:
count += 1
print(count)
| 1 | 10,549,679,387,610 | null | 116 | 116 |
import sys, math
input = sys.stdin.readline
rs = lambda: input().strip()
ri = lambda: int(input())
rl = lambda: list(map(int, input().split()))
mod = 10**9 + 7
N = ri()
print(math.ceil(N / 2) / N)
|
N=int(input())
if N%2==0:
print(1/2)
else:
print((N+1)/(2*N))
| 1 | 176,915,010,714,206 | null | 297 | 297 |
def gcd(a,b):
if a > b:
x = a
y = b
else:
x = b
y = a
while y > 0:
r = x % y
x = y
y = r
return x
def lcm(a,b,c):
return int(a*b/c)
while 1:
try:
a,b = [int(x) for x in input().split()]
res_gcd = gcd(a,b)
res_lcm = lcm(a,b,res_gcd)
print('{} {}'.format(res_gcd,res_lcm))
except:
break
|
import sys
for i in sys.stdin:
a, b = map(int, i.split())
p, q = max(a, b), min(a, b)
while p % q != 0:
p, q = q, p % q
print("{} {}".format(q, int(a * b / q)))
| 1 | 501,295,418 | null | 5 | 5 |
n,m = map(int, input().split())
H_list = list(map(int, input().split()))
line = [1 for i in range(n)]
for i in range(m):
a,b = map(int, input().split())
if H_list[a-1] < H_list[b-1]:
line[a-1] = 0
elif H_list[a-1] > H_list[b-1]:
line[b-1] = 0
else:
line[a-1] = 0
line[b-1] = 0
print(sum(line))
|
n,m = map(int,input().split())
h = list(map(int,input().split()))
l = [list(map(int,input().split())) for i in range(m)]
a,b = [list(i) for i in zip(*l)]
z = [1] * n
for i in range(m):
x = a[i] - 1
y = b[i] - 1
if h[x] < h[y]:
z[x] = 0
elif h[x] > h[y]:
z[y] = 0
else:
z[x] = 0
z[y] = 0
print(n - z.count(0))
| 1 | 25,097,501,832,012 | null | 155 | 155 |
import sys
import itertools
def main():
N = int(input())
songs = []
time = []
for _ in range(N):
s, t = input().split()
t = int(t)
songs.append(s)
time.append(t)
X = input()
time = list(itertools.accumulate(time))
ans = time[-1] - time[songs.index(X)]
print(ans)
if __name__ == '__main__':
main()
|
N=int(input())
p=[list(map(str,input().split())) for _ in range(N)]
X=input()
flag=0
cnt=0
for i in range(N):
if flag==1:
cnt=cnt+int(p[i][1])
if p[i][0]==X:
flag=1
print(cnt)
| 1 | 97,182,463,151,774 | null | 243 | 243 |
import math
member = []
score = []
while True:
num = int(raw_input())
if num == 0: break
member.append(num)
score.append(map(int, raw_input().split()))
alpha = []
for m, s in zip(member, score):
average = sum(s)/float(m)
sigma = 0
for t in s:
sigma += (t - average)**2
else:
alpha += [sigma/m]
for a in alpha:
#print '%.8f' % math.sqrt(a)
print math.sqrt(a)
|
import math
while True:
n = int(input())
if n == 0:
break
s = [int(s) for s in input().split()]
ave = sum(s) / n
a = 0
for N in s:
a += (N - ave)**2
a = math.sqrt((a / n))
print(a)
| 1 | 188,454,880,252 | null | 31 | 31 |
import copy
# a = get_int()
def get_int():
return int(input())
# a = get_string()
def get_string():
return input()
# a_list = get_int_list()
def get_int_list():
return [int(x) for x in input().split()]
# a_list = get_string_list():
def get_string_list():
return input().split()
# a, b = get_int_multi()
def get_int_multi(): # a, b = get_int_multi()
return map(int, input().split())
# a_list = get_string_char_list()
def get_string_char_list():
return list(str(input()))
# print("{} {}".format(a, b))
# for num in range(0, a):
# a_list[idx]
# a_list = [0] * a
'''
while (idx < n) and ():
idx += 1
'''
def main():
n, k = get_int_multi()
a_list = get_int_list()
for i in range(0, n-k):
if a_list[i] < a_list[k+i]:
print("Yes")
else:
print("No")
if __name__ == '__main__':
main()
|
from sys import stdin
freq = {}
for line in stdin:
string = line.lower()
for i in string:
if i.isalpha():
freq[i] = freq.get(i, 0) + 1
for char in range(ord('a'), ord('z')+1):
char = chr(char)
print('%s : %d' % (char, freq.get(char, 0)))
| 0 | null | 4,387,637,759,290 | 102 | 63 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.