code1
stringlengths 17
427k
| code2
stringlengths 17
427k
| similar
int64 0
1
| pair_id
int64 2
181,637B
⌀ | question_pair_id
float64 3.7M
180,677B
⌀ | code1_group
int64 1
299
| code2_group
int64 1
299
|
|---|---|---|---|---|---|---|
if __name__ == '__main__':
n,k = map(int,input().split())
A = list(map(int,input().split()))
A.sort()
num = len(A) - min(n,k)
print(sum(A[0:num]))
|
N,K = map(int,input().split())
hitpoint = list(map(int,input().split()))
hitpoint.sort(reverse=True)
if N<=K:
print(0)
else:
print(sum(hitpoint[K:]))
| 1 | 78,566,398,754,260 | null | 227 | 227 |
n = int(input())
a = list(map(float, input().split()))
b = list(map(float, input().split()))
c = [abs(a[i] - b[i]) for i in range(n)]
for p in range(1, 4):
ans = 0
for d in c:
ans += d ** p
print("{:.6f}".format(ans ** (1 / p)))
print("{:.6f}".format(max(c)))
|
n = int(input())
x = list(map(float, input().split()))
y = list(map(float, input().split()))
list=[]
for j in range(3):
D=0
for i in range(n):
if x[i]<y[i]:
d = (y[i]-x[i])
else:
d = (x[i]-y[i])
list.append(d)
D += (d**(j+1))
print(f"{D**(1/(j+1)):.6f}")
print(f"{max(list):.6f}")
| 1 | 208,911,423,172 | null | 32 | 32 |
n = int(input())
R =[]
for i in range(n):
R.append(int(input()))
maxR = R[1]
minR = R[0]
maxB = R[1] - R[0]
for i in range(1,n):
if R[i] < minR:
minR = R[i]
maxR = R[i] - 1
elif minR <= R[i] and R[i] <= maxR:
continue
else:
maxR = R[i]
if maxR - minR > maxB:
maxB = maxR - minR
print(str(maxB))
|
#coding:utf-8
#1_1_D
n = int(input())
prices = [int(input()) for x in range(n)]
maxv = -2 * 10 ** 9
minv = prices[0]
for i in range(1, n):
maxv = max(maxv, prices[i] - minv)
minv = min(minv, prices[i])
print(maxv)
| 1 | 14,322,967,230 | null | 13 | 13 |
S = input()
S = str.swapcase(S)
print(S)
|
import bisect
N, M = map(int, input().split())
A = list(map(int, input().split()))
A.sort()
# ある値以上のAiがいくつあるかの情報を累積和で保持
num_A_or_more = [0]*(10**5)
for a in A:
num_A_or_more[a-1] += 1
for i in range(1, 10**5):
j = 10**5 - i
num_A_or_more[j-1] += num_A_or_more[j]
# x以上となる手の組み合わせがM種類以上あるかどうかを判定
def check(x):
count = 0
for a in A:
idx = max(x-a-1, 0)
if idx >= 10**5:
continue
count += num_A_or_more[idx]
return count>=M
# 2分探索でM種類以上の手の組み合わせがある満足度の最大値を求める
left = 0
right = 2*10**5 + 1
mid = (left + right) // 2
while right - left > 1:
if check(mid):
left = mid
else:
right = mid
mid = (left + right)//2
# これがM種類以上の手の組み合わせがある満足度の最大値
x = left
# 降順に並べなおして累積和を求めておく
rev_A = A[::-1]
accum_A = [rev_A[0]]
for i, a in enumerate(rev_A):
if i == 0:
continue
accum_A.append(accum_A[-1] + a)
ans = 0
count = 0
surplus = 2*10**5 # M種類を超えた場合は、一番小さくなる握手の組を最後に削る
for ai in rev_A:
idx = bisect.bisect_left(A, x-ai)
if idx == N:
break
ans += (N-idx)*ai + accum_A[N-idx-1]
count += N - idx
surplus = min(surplus, ai+A[idx])
print(ans - (count-M)*surplus)
| 0 | null | 54,806,178,168,064 | 61 | 252 |
import math
r = float(input())
S = math.pi * (r**2)
l = 2 * math.pi * r
print("{} {}".format(S, l))
|
from itertools import product
n,m,x = map(int, input().split())
al = []
cl = []
for _ in range(n):
row = list(map(int, input().split()))
cl.append(row[0])
al.append(row[1:])
ans = 10**9
bit = 2
ite = list(product(range(bit),repeat=n))
for pattern in ite:
skills = [0]*m
cost = 0
for i, v in enumerate(pattern):
if v == 1:
curr_al = al[i]
cost += cl[i]
for j, a in enumerate(curr_al):
skills[j] += a
if min(skills) >= x:
ans = min(ans,cost)
if ans == 10**9: ans = -1
print(ans)
| 0 | null | 11,381,378,548,708 | 46 | 149 |
import sys,collections
input = sys.stdin.readline
N=input().rstrip()
A=list(map(int,input().split()))
Ac = collections.Counter(A)
Q = int(input())
for i in range(Q):
B,C = list(map(int,input().split()))
nb = Ac[B]
Ac[C] += Ac[B]
Ac[B] = 0
if i==0:
ans = 0
for key,val in Ac.items():
ans += key*val
else:
ans +=nb*C - nb*B
print(ans)
|
n=int(input())
A=list(map(int,input().split()) )
q=int(input())
B=[]
C=[]
a_sum = sum(A)
counter = [0]*10**5
for a in A:
counter[a-1] += 1
for i in range(q):
b,c = map(int,input().split())
a_sum += (c-b) * counter[b-1]
counter[c-1]+=counter[b-1]
counter[b-1]=0
print(a_sum)
| 1 | 12,294,218,078,594 | null | 122 | 122 |
"RPN using stack for AOJ ALDS1_3_A: Stack"
# coding: utf-8
def rpn(exp):
"""
rpn calculation
>>> rpn(['1', '2', '+', '3', '4', '-', '*'])
-3
"""
stack = []
for elem in exp:
if elem == '+':
stack.append(int(stack.pop()) + int(stack.pop()))
elif elem == '-':
stack.append(-int(stack.pop()) + int(stack.pop()))
elif elem == '*':
stack.append(int(stack.pop()) * int(stack.pop()))
elif elem == '/':
stack.append(int(stack.pop()) / int(stack.pop()))
else:
stack.append(elem)
print(stack.pop())
def main():
"main function"
exp = list(input().split(' '))
rpn(exp)
if __name__ == '__main__':
# import doctest
# doctest.testmod()
main()
|
def reverse_polish_notation(A):
ops = {'+': lambda a, b: b + a,
'-': lambda a, b: b - a,
'*': lambda a, b: b * a}
stack = []
for i in A:
if i in ops:
stack.append(ops[i](stack.pop(), stack.pop()))
else:
stack.append(int(i))
return stack[0]
if __name__ == '__main__':
A = list(input().split())
print(reverse_polish_notation(A))
| 1 | 34,369,421,450 | null | 18 | 18 |
if __name__ == '__main__':
a, b = map(int, input().split())
if 1 <= a <= 9 and 1 <= b <= 9:
print(a * b)
else:
print(-1)
|
#C - Count Order
#DFS
N = int(input())
P = list(map(int,input().split()))
Q = list(map(int,input().split()))
a = 0
b = 0
cnt = 0
def dfs(A):
global cnt
global a
global b
if len(A) == N:
cnt += 1
if A == P:
a = cnt
if A == Q:
b = cnt
return
for v in range(1,N+1):
if v in A:
continue
A.append(v)
dfs(A)
A.pop()
dfs([])
print(abs(a-b))
| 0 | null | 129,558,264,533,688 | 286 | 246 |
N,X = map(int,input().split())
Y = N - sum(map(int,input().split()))
print(("-1",Y)[Y >= 0])
|
import sys
sys.setrecursionlimit(10 ** 5 + 10)
def input(): return sys.stdin.readline().strip()
def resolve():
"""
https://qiita.com/drken/items/4a7869c5e304883f539b#3-3-dfs-%E3%81%AE%E5%86%8D%E5%B8%B0%E9%96%A2%E6%95%B0%E3%82%92%E7%94%A8%E3%81%84%E3%81%9F%E5%AE%9F%E8%A3%85
cf. https://atcoder.jp/contests/abc138/submissions/13273052
"""
from collections import deque
N = int(input())
M = N-1 # 頂点数，辺数
# グラフ入力受取 (ここでは無向グラフを想定)
G = [[] for _ in range(N)]
for i in range(M):
a, b = map(int, input().split())
a -= 1
b -= 1
G[a].append((b, i))
G[b].append((a, i))
seen = [False]*N
res = [0]*M
def dfs(G, v):
col = 1
parent_col = -1
if col == parent_col:
col += 1
seen[v] = True
stack = deque([(v, -1)])
while stack:
v, parent_col = stack.pop()
col = 1
for next_v, edge_ind in G[v]:
if seen[next_v]:
continue
if col == parent_col:
col += 1
res[edge_ind] = col
seen[next_v] = True
stack.append((next_v, col))
col += 1
# 頂点 0 をスタートとした探索
dfs(G, 0)
print(max(res))
for i in res:
print(i)
resolve()
| 0 | null | 84,302,192,262,740 | 168 | 272 |
def main():
N, M = map(int, input().split())
A = list(map(int, input().split()))
if sum(A) > N:
print(-1)
else:
print(N - sum(A))
if __name__ == '__main__':
main()
|
N, M = map(int, input().split())
A = list(map(int, input().split()))
print(max(-1, N-sum(A)))
| 1 | 32,078,640,126,340 | null | 168 | 168 |
def main():
N = int(input())
def enum_divisors(n):
# 約数列挙
divs = []
for i in range(1, n+1):
if i*i > n:
break
if n % i == 0:
divs.append(i)
if n//i != i:
# i が平方数でない
divs.append(n//i)
return divs
ans = 0
for k in enum_divisors(N-1):
if 2 <= k:
ans += 1
for k in enum_divisors(N):
if 2 <= k:
n = N
while n > 1 and n % k == 0:
n //= k
if n % k == 1:
ans += 1
print(ans)
if __name__ == '__main__':
main()
|
from math import ceil
def enum_divisor(n):
res = []
for i in range(1, int(n ** 0.5) + 1):
if n % i != 0:
continue
res.append(i)
if i * i != n:
res.append(n // i)
return res
ans = 0
n = int(input())
for x in enum_divisor(n):
if x == 1:
continue
tmp = n
while tmp % x == 0:
tmp //= x
if tmp % x == 1:
ans += 1
ans += len(enum_divisor(n - 1)) - 1
print(ans)
| 1 | 41,094,375,240,802 | null | 183 | 183 |
s, t = input().split()
a, b =map(int, input().split())
x = input()
if x == s:
print(a - 1, b)
else:
print(a, b - 1)
|
def q1():
S, T = input().split()
print('{}{}'.format(T, S))
if __name__ == '__main__':
q1()
| 0 | null | 87,614,801,068,066 | 220 | 248 |
import sys
import math
import fractions
from collections import defaultdict
from functools import reduce
import collections
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()))
INF=10**18
mod=10**9+7
N=int(input())
A=nl()
NMAX=10**6
class Sieve:
def __init__(self,n):
self.n=n
self.f=[0]*(n+1)
self.prime=[]
self.f[0]=self.f[1]=-1
for i in range(2,n+1):
if(self.f[i]):
continue
else:
self.prime.append(i)
self.f[i]=i
for j in range(i*i,n+1,i):
if(~self.f[j]):
self.f[j]=i
def isProme(self,x):
return (self.f[x]==x)
def factorList(self,x):
res=[]
while(x!=1):
res.append(self.f[x])
x//=self.f[x]
return res
def factor(self,x):
fl=self.factorList(x)
return collections.Counter(fl)
def get_sieve_of_eratosthenes(n):
prime = [2]
limit = int(n**0.5)
data = [i + 1 for i in range(2, n, 2)]
while True:
p = data[0]
if limit <= p:
return prime + data
prime.append(p)
data = [e for e in data if e % p != 0]
sieve=Sieve(10**6)
mp=defaultdict(int)
for i in range(N):
f=sieve.factor(A[i])
for key,val in f.items():
mp[key]=max(val,mp[key])
lcm=1
for key,val in mp.items():
lcm*=(key**val)
ans=0
for i in range(N):
ans+=lcm//A[i]
print(ans%mod)
|
def make_prime_table(n):
sieve = list(range(n + 1))
sieve[0] = -1
sieve[1] = -1
for i in range(4, n + 1, 2):
sieve[i] = 2
for i in range(3, int(n ** 0.5) + 1, 2):
if sieve[i] != i:
continue
for j in range(i * i, n + 1, i * 2):
if sieve[j] == j:
sieve[j] = i
return sieve
def prime_factorize(n):
result = []
while n != 1:
p = prime_table[n]
e = 0
while n % p == 0:
n //= p
e += 1
result.append((p, e))
return result
N = int(input())
A = list(map(int, input().split()))
m = 1000000007
prime_table = make_prime_table(10 ** 6)
lcm_factors = {}
for a in A:
for p, e in prime_factorize(a):
if p not in lcm_factors or lcm_factors[p] < e:
lcm_factors[p] = e
lcm = 1
for p in lcm_factors:
lcm *= pow(p, lcm_factors[p], m)
lcm %= m
result = 0
for i in range(N):
result += lcm * pow(A[i], m - 2, m)
result %= m
print(result)
| 1 | 88,202,186,101,318 | null | 235 | 235 |
while True:
a,op,b=input().split()
if op=='?': break
eval("print( int(int(a) {0} int(b)) )".format(op))
|
import sys
sys.setrecursionlimit(10 ** 7)
rl = sys.stdin.readline
def solve():
S = rl().rstrip()
print(S[:3])
if __name__ == '__main__':
solve()
| 0 | null | 7,672,840,185,186 | 47 | 130 |
n=int(input())
m=int(n/1.08)
for i in range(-2,3):
if int((m+i)*1.08)==n:
print(m+i)
exit()
print(":(")
|
import sys
n = int(input())
ans = n*100/108
for i in [int(ans), int(ans)+1]:
if int(i*1.08) == n:
print(i)
sys.exit()
print(":(")
| 1 | 125,804,680,335,860 | null | 265 | 265 |
n = int(input())
N = int(n/1.08)
for i in range(3):
if int((N + i) * 1.08) == n:
print(N+i)
break
else:
print(':(')
|
n = int(input())
x = int(n / 1.08)
if int(x * 1.08) == n:
print(x)
elif int((x-1) * 1.08) == n:
print(x-1)
elif int((x+1) * 1.08) == n:
print(x+1)
else:
print(':(')
| 1 | 125,914,711,017,612 | null | 265 | 265 |
N, K = map(int, input().split())
ppp = list(map(int, input().split()))
acc = 0
for i in range(K):
acc += (ppp[i] + 1) / 2
ans = acc
for i in range(K, N):
acc -= (ppp[i - K] + 1) / 2
acc += (ppp[i] + 1 ) / 2
ans = max(ans, acc)
print(ans)
|
N,K=map(int,input().split())
p=list(map(int,input().split()))
exp0 = (sum(p[:K])+K)/2
MAX=exp0
old = exp0
for i in range(1,N-K+1):
new = old + (p[K+i-1]+1)/2 - (p[i-1]+1)/2
if new > MAX: MAX = new
old = new
print(MAX)
| 1 | 74,972,656,139,590 | null | 223 | 223 |
from math import *
a, b, C = map(float, input().split())
c = sqrt(a ** 2 + b ** 2 - 2 * a * b * cos(radians(C)))
s = (a + b + c) / 2
S = sqrt(s * (s - a) * (s - b) * (s - c))
L = a + b + c
h = b * sin(radians(C))
print(S)
print(L)
print(h)
|
import math
N, D = map(int, input().split())
p = [list(map(int, input().split())) for _ in range(N)]
cnt = 0
for x, y in p:
if D >= math.sqrt(x**2 + y**2):
cnt += 1
print(cnt)
| 0 | null | 3,050,983,337,942 | 30 | 96 |
#!/usr/bin/python3
# -*- coding:utf-8 -*-
import numpy
def main():
_, _, k = map(int, input().strip().split())
la = numpy.cumsum([0] + list(map(int, input().strip().split())))
lb = numpy.cumsum([0] + list(map(int, input().strip().split())) + [10**9+5])
def bs(x):
s, t = 0, len(lb) - 1
while t > s + 1:
m = (s + t) // 2
if lb[m] == x:
return m
if lb[m] > x:
t = m
else:
s = m
return s
ans = 0
for i, a in enumerate(la):
if k - a >= 0:
ans = max(ans, i + bs((k - a)))
print(ans)
if __name__=='__main__':
main()
|
from itertools import accumulate
from bisect import bisect_left
ri = lambda S: [int(v) for v in S.split()]
def rii():
return ri(input())
N, M, K = rii()
A = rii()
B = rii()
i = j = 0
pA = [0] + list(accumulate(A))
pB = [0] + list(accumulate(B))
ans = 0
for i, a in enumerate(pA):
br = 0
if K >= a:
r = K - a
br = i
if r:
j = bisect_left(pB, r)
if j != len(pB):
if pB[j] > r:
j -= 1
br += j
ans = max(ans, br)
print(ans)
| 1 | 10,756,042,527,360 | null | 117 | 117 |
"""ABC174E diff: 1158
"""
N,K=map(int,input().split())
A=list(map(int, input().split()))
if K == 0:
print(max(A))
exit()
def f(x):
"""
K回以内のカットで全ての丸太の長さをX以下にできるか？
X: int
Return: bool
"""
cnt = 0
for a in A:
if a % x == 0:
cnt += a//x - 1
else:
cnt += a//x
if cnt <= K:
return True
else:
return False
left = 0
right = max(A) + 10
while right - left > 1:
mid = (left+right) // 2
if f(mid):
right = mid
else:
left = mid
print(right)
|
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,519,329,801,278 | null | 99 | 99 |
N, K = (int(i) for i in input().split())
l, r = [0]*K, [0]*K
for k in range(K):
l[k], r[k] = (int(x) for x in input().split())
# dp : マスiまで移動する方法のパターン数
# TLE
'''
import numpy as np
dp = [0]*N
dp[0] = 1
for i in range(N):
for k in range(K):
for j in range(l[k], r[k]+1):
if (i+j < N):
dp[i+j] = dp[i+j] + dp[i]
if j == r[k]:
print(i, (l[k], r[k]), dp, np.diff(dp))
print(dp[-1]%998244353)
'''
# dp : マスiまで移動する方法のパターン数
# dps : dp[i] と dp[i+1] の 差
dp = [0]*N
dps = [0]*(N-1)
dp[0] = 1
dps[0] = -1
for i in range(N-1):
for k in range(K):
if i + l[k] - 1 < (N - 1):
dps[i + l[k] - 1] += dp[i]
if i + r[k] < (N - 1):
dps[i + r[k] ] -= dp[i]
#print(i, (l[k], r[k]), dp, dps)
dp[i+1] = (dps[i] + dp[i])%998244353
print(dp[-1]%998244353)
|
#もらうDP + 累積和
n, k = map(int, input().split())
mod = 998244353
li = []
for _ in range(k):
l, r = map(int, input().split())
li.append((l, r))
li.sort()
dp = [0]*(2*n+1)
s = [0] * (2*n+1)
dp[1] = 1
s[1] = 1
for i in range(2, n+1):
for t in li:
l, r = t
dp[i] += s[max(i-l, 0)]
dp[i] -= s[max(i-r-1, 0)]
dp[i] %= mod
s[i] = s[i-1] + dp[i]
s[i] %= mod
print(dp[i]%mod)
| 1 | 2,687,129,384,840 | null | 74 | 74 |
n=int(input())
if n==0 or n==1 or n==2:
print(0)
elif n==3:
print(1)
elif n%2==1:#奇数
print(int(n/2))
elif n%2!=1:#偶数
print(int(n/2)-1)
|
a,b,c=map(int,input().split())
x = 0
y = 0
for i in range(a):
x = x + c
y = y + b
if a <= y:
print(x)
break
| 0 | null | 78,769,687,678,070 | 283 | 86 |
n, x, y = int(input()), list(map(int, input().split())), list(map(int, input().split()))
def dist(p):
return pow(sum(pow(abs(a - b), p) for a, b in zip(x, y)), 1.0 / p)
for i in [1, 2, 3]:
print(dist(i))
print(max(abs(a - b) for a, b in zip(x, y)))
|
dim = int(input())
a, b = list(map(int, input().split())), list(map(int, input().split()))
dif = [ abs(x-y) for x, y in zip(a, b)]
print("%lf\n%lf\n%lf\n%lf" % (sum(dif),
sum([i ** 2 for i in dif]) ** (1 / 2),
sum([i ** 3 for i in dif]) ** (1 / 3),
max(dif)
))
| 1 | 210,378,070,332 | null | 32 | 32 |
n,k=map(int,input().split())
#階乗
F = 200005
mod = 10**9+7
fact = [1]*F
inv = [1]*F
for i in range(2,F):
fact[i]=(fact[i-1]*i)%mod
inv[F-1]=pow(fact[F-1],mod-2,mod)
for i in range(F-2,1,-1):
inv[i] = (inv[i+1]*(i+1))%mod
ans=1
for i in range(1,min(n,k+1)):
comb=(fact[n]*inv[i]*inv[n-i])%mod
h=(fact[n-1]*inv[i]*inv[n-1-i])%mod
ans=(ans+comb*h)%mod
print(ans)
|
N, M=map(int, input().split())
s_row = [0 for x in range(M+1)]
for n in range(N):
arr = list(map(int, input().split()))
arr.append(sum(arr))
s_row = [x+y for x,y in zip(s_row, arr)]
print(" ".join([str(x) for x in arr]))
print(" ".join([str(x) for x in s_row]))
| 0 | null | 34,274,830,308,784 | 215 | 59 |
str_search = input().upper()
int_cnt = 0
len_search = len(str_search)
while True:
str_line = input()
if str_line == "END_OF_TEXT":
break
str_line = str_line.upper()
int_cnt = int_cnt + str_line.split().count(str_search)
print(str(int_cnt))
|
def main():
w = input()
wards = []
while True:
wards.extend(ward for ward in input().split())
if wards[-1] == 'END_OF_TEXT':
break
num = 0
for ward in map(lambda ward: ward.lower(), wards):
if ward == w:
num += 1
print(num)
if __name__ == '__main__':
main()
| 1 | 1,836,383,124,268 | null | 65 | 65 |
n = int(input())
c = input()
red = c.count('R')
print(c[red:].count('R'))
|
from collections import deque
N = int(input())
C = input()
r = deque()
lr = 0
for i in range(N):
if C[i] == 'R':
lr += 1
r.append(i)
ans = 0
for i in range(N):
if lr == 0:
break
if C[i] == 'W':
if i < r[-1]:
ans += 1
r.pop()
lr -= 1
else:
break
print(ans)
| 1 | 6,230,029,145,198 | null | 98 | 98 |
import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return map(int, input().split())
sys.setrecursionlimit(10**9)
N, X, mod = mapint()
doubling = [[i*i%mod for i in range(mod)]]
accu = [doubling[0][:]]
for i in range(40):
tmp1 = [None]*mod
tmp2 = [None]*mod
for j in range(mod):
tmp1[j] = doubling[-1][doubling[-1][j]]
tmp2[j] = accu[-1][doubling[-1][j]] + accu[-1][j]
doubling.append(tmp1)
accu.append(tmp2)
now = X
ans = X
for i in range(40):
if (N-1)>>i&1:
ans += accu[i][now]
now = doubling[i][now]
print(ans)
|
n=int(input())
l0=[[] for _ in range(n)]
l1=[[] for _ in range(n)]
for i in range(n):
a=int(input())
for j in range(a):
x,y=map(int,input().split())
if y==0:
l0[i].append(x)
else:
l1[i].append(x)
ans=0
for i in range(2**n):
s0=set()
s1=set()
num=0
num1=[]
num0=[]
for j in range(n):
if (i>>j) & 1:
num1.append(j+1)
for k in range(len(l0[j])):
s0.add(l0[j][k])
for k in range(len(l1[j])):
s1.add(l1[j][k])
else:
num0.append(j+1)
for j in range(len(s1)):
if s1.pop() in num0:
num=1
break
if num==0:
for j in range(len(s0)):
if s0.pop() in num1:
num=1
break
if num==0:
ans=max(ans,len(num1))
print(ans)
| 0 | null | 61,917,437,603,868 | 75 | 262 |
# coding: utf-8
# Here your code !
def func():
data=[]
while(True):
try:
line=[ int(item) for item in input().rstrip().split(" ") ]
if(line == [-1, -1, -1]):
break
data.append(line)
except EOFError:
break
except:
return inputError()
result=""
for score in data:
if( (score[0]<0) or (score[1]<0)):
result+="F\n"
elif(score[0]+score[1] >= 80):
result+="A\n"
elif(score[0]+score[1] >= 65):
result+="B\n"
elif(score[0]+score[1] >= 50):
result+="C\n"
elif(score[0]+score[1] >= 30):
if(score[2] >= 50):
result+="C\n"
else:
result+="D\n"
else:
result+="F\n"
print(result.rstrip())
def inputError():
print("input error")
return -1
func()
|
while True:
M,F,R = map(int,input().split())
if M == -1 and F == -1 and R == -1:
break
if M == -1 or F == -1:
print("F")
elif M+F >= 80:
print("A")
elif M+F >= 65:
print("B")
elif M+F >= 50:
print("C")
elif M+F >= 30:
if R >= 50:
print("C")
else:
print("D")
else:
print("F")
| 1 | 1,206,489,098,688 | null | 57 | 57 |
N,M,L = (int(i) for i in input().split())
A = [[int(i) for i in input().split()] for i in range(N)]
B = [[int(i)for i in input().split()] for i in range(M)]
C = []
for i in range(N):
for i2 in range(L):
ans = 0
for i3 in range(M):
ans += A[i][i3]*B[i3][i2]
if i2 == L-1:
print(ans)
else:
print(ans,end=" ")
|
n1,n2,n3 = map(int,input().split(" "))
list1 = [list(map(int,input().split(" "))) for _ in range(n1)]
list2 = [list(map(int,input().split(" "))) for _ in range(n2)]
mat = [[0 for _ in range(n3)] for _ in range(n1)]
for i in range(n1):
for j in range(n2):
for k in range(n3):
mat[i][k] += list1[i][j] * list2[j][k]
for m in mat:
print(*m)
| 1 | 1,438,820,956,160 | null | 60 | 60 |
def main():
n = int(input())
l_0 = []
r_0 = []
ls_plus = []
ls_minus = []
sum_l = 0
sum_r = 0
for i in range(n):
s = input()
left, right = 0, 0
for j in range(len(s)):
if s[j] == '(':
right += 1
else:
if right > 0:
right -= 1
else:
left += 1
if left == right == 0:
continue
if left == 0:
l_0.append((left, right))
elif right == 0:
r_0.append((left, right))
elif left < right:
ls_plus.append((left, right))
else:
ls_minus.append((left, right))
sum_l += left
sum_r += right
if len(ls_plus) == len(ls_minus) == len(l_0) == len(r_0) == 0:
print("Yes")
return
if len(l_0) == 0 or len(r_0) == 0:
print("No")
return
if sum_l != sum_r:
print("No")
return
# r-lの大きい順
ls_plus.sort(key=lambda x: x[1] - x[0], reverse=True)
# lの小さい順
ls_plus.sort(key=lambda x: x[0])
# l-rの小さい順
ls_minus.sort(key=lambda x: x[0] - x[1])
# lの大さい順
ls_minus.sort(key=lambda x: x[0], reverse=True)
now_r = 0
for ll in l_0:
now_r += ll[1]
for _ in ls_plus:
r = _[1]
x = now_r - _[0]
if x >= 0:
now_r = x + r
else:
print("No")
return
for _ in ls_minus:
r = _[1]
x = now_r - _[0]
if x >= 0:
now_r = x + r
else:
print("No")
return
print("Yes")
main()
|
import sys
def input():
return sys.stdin.readline().strip()
n = int(input())
s = []
for _ in range(n):
s.append(input())
'''
N = sum([len(i) for i in s])
R = sum([i.count('(') for i in s])
if N % 2 == 1 or s.count('(') != N // 2:
print('No')
exit()
'''
bothleft = []
bothright = []
bothneutral = [0]
left = [0]
right = [0]
for i in s:
lnum = 0
now = 0
for j in range(len(i)):
if i[j] == '(':
now -= 1
else:
now += 1
lnum = max([lnum, now])
rnum = 0
now = 0
for j in range(len(i) - 1, -1, -1):
if i[j] == ')':
now -= 1
else:
now += 1
rnum = max([rnum, now])
if lnum > 0:
if rnum > 0:
if lnum > rnum:
bothleft.append((rnum, lnum - rnum))
elif rnum > lnum:
bothright.append((lnum, rnum - lnum))
else:
bothneutral.append(lnum)
else:
left.append(lnum)
elif rnum > 0:
right.append(rnum)
bothneutral = max(bothneutral)
bothleft.sort()
bothright.sort()
lsum = sum(left)
for i in range(len(bothleft)):
if bothleft[i][0] > lsum:
print('No')
exit()
lsum += bothleft[i][1]
if bothneutral > lsum:
print('No')
exit()
rsum = sum(right)
for i in range(len(bothright)):
if bothright[i][0] > rsum:
print('No')
exit()
rsum += bothright[i][1]
if lsum != rsum:
print('No')
exit()
print('Yes')
| 1 | 23,636,643,360,260 | null | 152 | 152 |
def get(n):
for i in range(-1000,1001):
for j in range(-1000,1001):
if(i**5-j**5==n):
print(i,j)
return
n=int(input())
get(n)
|
N, M, X = list(map(int, input().split()))
list = [list(map(int, input().split())) for i in range(N)]
def calc_cost(li):
"""
与えられた部分リストが各アルゴリズムの条件を
満たすか確認し、そのコストを計算。
条件満たさないときは100000000を出力
"""
# flag = True
cost = 0
for item in li:
cost += item[0]
for i in range(M):
algo_sum = 0
for item in li:
algo_sum += item[i + 1]
if algo_sum < X:
return 100000000
return cost
cost = 100000000
for i in range(2 ** N):
in_list = []
for j in range(N):
if (i >> j) & 1:
in_list.append(list[j])
temp_cost = calc_cost(in_list)
if temp_cost == -1:
break
cost = min(cost, temp_cost)
if cost == 100000000:
cost = -1
print(cost)
| 0 | null | 24,034,392,657,882 | 156 | 149 |
#!/usr/bin/env python3
n, k = map(int, input().split())
r, s, p = map(int, input().split())
t = [i for i in input()]
b = [0] * n
for i in range(n - k):
if t[i] == t[i + k] and b[i] == 0:
if t[i] == 's':
b[i + k] -= r
elif t[i] == 'p':
b[i + k] -= s
else:
b[i + k] -= p
print(t.count('s') * r + t.count('p') * s + t.count('r') * p + sum(b))
|
N, K = map(int, input().split())
R, S, P = map(int, input().split())
T = list(input())
for i in range(N):
if i >= K and T[i-K] == T[i]:
T[i] = 'a'
ans = 0
for i in T:
if i == 'r':
ans += P
elif i == 's':
ans += R
elif i == 'p':
ans += S
print(ans)
| 1 | 106,573,749,222,450 | null | 251 | 251 |
S=input()
T=input()
len_s=len(S)
len_t=len(T)
ans=0
for i in range(len_s-len_t+1):
cnt=0
for j in range(len_t):
if S[i+j]==T[j]:
cnt += 1
ans = max(ans,cnt)
print(len_t-ans)
|
s = input()
ans = s + 'es' if s[-1]=='s' else s + 's'
print(ans)
| 0 | null | 3,059,543,066,580 | 82 | 71 |
n = int(input())
a = list(map(int, input().split()))
ruiseki0 = [0] * (n + 10)
for i in range(n):
ruiseki0[i + 1] = ruiseki0[i]
if i % 2 == 0:
ruiseki0[i + 1] += a[i]
l = [0] * (n + 1)
for i in range(n + 1):
l[i] = ruiseki0[i]
if i % 2 == 0:
if i == 0:
l[i] = 0
else:
l[i] = max(l[i - 2] + a[i - 1], l[i])
a = a[::-1]
ruiseki0 = [0] * (n + 10)
for i in range(n):
ruiseki0[i + 1] = ruiseki0[i]
if i % 2 == 0:
ruiseki0[i + 1] += a[i]
r = [0] * (n + 1)
for i in range(n + 1):
r[i] = ruiseki0[i]
if i % 2 == 0:
if i == 0:
r[i] = 0
else:
r[i] = max(r[i - 2] + a[i - 1], r[i])
ans = - 10 ** 20
for i in range(n):
if n - i - 2 < 0:
break
if n % 2 == 0 and i % 2 == 0:
continue
ans = max(ans, l[i] + r[n - i - 2])
if n % 2 == 0:
ans1 = 0
ans2 = 0
for i in range(n):
if i % 2 == 0:
ans1 += a[i]
else:
ans2 += a[i]
ans = max(ans1, ans2, ans)
if n % 2 == 1:
ans = max(ans, sum(a)- ruiseki0[n])
print(ans)
|
from itertools import accumulate
#acumulate [a[0], a[0]+a[1], a[0]+...]
n, k = map(int, input().split())
p = [int(x) - 1 for x in input().split()]
c = list(map(int, input().split()))
ans = -(10 ** 18)
for i in range(n):
pos = i
scores = []
while True:
pos = p[pos]
scores.append(c[pos])
if pos == i:
break
m = len(scores)
s = list(accumulate(scores))
for j in range(min(m, k)):
x = (k - j - 1) // m
ans = max(ans, s[j], s[j] + s[-1] * x)
print(ans)
| 0 | null | 21,270,312,354,980 | 177 | 93 |
N, M = map(int, input().split())
corret_list = [False] * (N+1)
wa_number = [0] * (N+1)
true_ans = 0
penalty = 0
for _ in range(M):
P, S = input().split()
P = int(P)
if S == 'AC':
if not corret_list[P]:
true_ans += 1
corret_list[P] = True
continue
else:
continue
else:
if not corret_list[P]:
wa_number[P] += 1
continue
for i in range(len(corret_list)):
if corret_list[i]:
penalty += wa_number[i]
print(true_ans, penalty)
|
import sys,collections
input = sys.stdin.readline
def main():
N,M,K = list(map(int,input().split()))
fr = [[] for i in range(N+1)]
bl = [[] for i in range(N+1)]
for _ in range(M):
a,b = map(int,input().split())
fr[a].append(b)
fr[b].append(a)
for _ in range(K):
c,d = map(int,input().split())
bl[c].append(d)
bl[d].append(c)
fl = [-1 for i in range(N+1)]
fl[0] = 0
fl[1] = 1
nxt = 1
dic = {}
s = set(range(1,N+1))
while nxt != 0:
q = collections.deque([nxt])
fl[nxt]=nxt
cnt = 0
while q:
now = q.popleft()
s.discard(now)
for f in fr[now]:
if fl[f] == -1:
fl[f] = nxt
cnt +=1
q.append(f)
dic[nxt] = cnt
#try:
#nxt = fl.index(-1)
#except:
#nxt = 0
if len(s) == 0:
nxt = 0
else:
nxt = s.pop()
mbf = collections.deque()
for i in range(1,N+1):
ff = 0
for j in bl[i]:
if fl[j] == fl[i]:
ff -= 1
ff += dic[fl[i]]-len(fr[i])
mbf.append(ff)
print(*mbf)
if __name__ == '__main__':
main()
| 0 | null | 77,212,711,861,962 | 240 | 209 |
# -*- coding: utf-8 -*-
#mitsui f
import sys
import math
import collections
#sys.setrecursionlimit(100000)
#n=int(input())
tmp = input().split()
t1,t2 = list(map(lambda a: int(a), tmp))
tmp = input().split()
a1,a2 = list(map(lambda a: int(a), tmp))
tmp = input().split()
b1,b2 = list(map(lambda a: int(a), tmp))
if(a1*t1+a2*t2==b1*t1+b2*t2):
print("infinity")
sys.exit()
diff=(a1*t1+a2*t2)-(b1*t1+b2*t2)
if(diff>0):
c1=a1-b1
c2=a2-b2
else:
c1=b1-a1
c2=b2-a2
if(c1>0):
print("0")
sys.exit()
diff=c1*t1+c2*t2
pitch=c1*t1*-1
ans=pitch//diff*2+1
if(pitch%diff==0):
ans-=1
print(ans)
|
# coding=utf-8
n = int(raw_input())
nums = raw_input().split()
print ' '.join(reversed(nums))
| 0 | null | 66,051,686,670,500 | 269 | 53 |
N, M = map(int, input().split())
print('Yes') if N == M else print('No')
|
def resolve():
N = int(input())
ans = N % 1000
if ans == 0:
print(0)
else:
print(1000 - ans)
resolve()
| 0 | null | 45,812,928,730,732 | 231 | 108 |
def main():
N,M=map(int,input().split())
S=input()
c,l=N,[]
while c>0:
for i in range(M,0,-1):
if i<=c and S[c-i]=='0':
l+=[i]
c-=i
break
else:
l=[-1]
break
print(*l[::-1])
main()
|
n, m = map(int, input().split())
s = input()
s = ''.join(reversed(s))
ans = []
index = 0
while index < n:
next_index = -1
for j in range(min(index + m, n), index, -1):
if s[j] == '0':
next_index = j
break
if next_index == -1:
ans = [-1]
break
ans.append(next_index - index)
index = next_index
print(' '.join(list(map(str, list(reversed(ans))))))
| 1 | 138,842,927,315,390 | null | 274 | 274 |
N = int(input())
A = list(map(int, input().split()))
V = [0]*(N+1)
flug = 0
Lsum= sum(A)
V[0] = 1
for i in range(N):
V[i+1] = (V[i]*2 - A[i+1])
if V[i+1] < 0 :
flug = 1
Lsum = Lsum - A[i+1]
if V[i+1] > Lsum :
V[i+1] = Lsum
ans = sum(V)+sum(A)
if A[0] != 0 or A[N] == 0:
ans = -1
if flug == 1:
ans = -1
if N == 0 and A[0] != 1:
ans = -1
elif N == 0 and A[0] == 1:
ans = 1
print(ans)
|
import copy
def BubbleSort(C, N):
for i in range(N):
for j in reversed(range(i+1, N)):
if C[j][1:2] < C[j-1][1:2]:
C[j], C[j-1] = C[j-1], C[j]
print(*C)
stableCheck(C, N)
def SelectionSort(C, N):
for i in range(N):
minj = i
for j in range(i, N):
if C[j][1:2] < C[minj][1:2]:
minj = j
C[i], C[minj] = C[minj], C[i]
print(*C)
stableCheck(C, N)
def stableCheck(C, N):
global lst
flag = 1
for i in range(N):
for j in range(i+1, N):
if lst[i][1:2] == lst[j][1:2]:
fir = lst[i]
sec = lst[j]
for k in range(N):
if C[k] == fir:
recf = k
if C[k] == sec:
recs = k
if recf > recs:
print("Not stable")
flag = 0
break
if flag ==0:
break
if flag :
print("Stable")
N = int(input())
lst = list(map(str, input().split()))
lst1 = copy.deepcopy(lst)
lst2 = copy.deepcopy(lst)
BubbleSort(lst1, N)
SelectionSort(lst2, N)
| 0 | null | 9,428,097,390,822 | 141 | 16 |
n,k,c = map(int,input().split())
s = list(input())
L = []
R = []
i = -1
j = n
for ki in range(k):
while i < n:
i += 1
if s[i] == 'o':
L += [i]
i += c
break
for ki in range(k):
while 0 <= j:
j -= 1
if s[j] == 'o':
R += [j]
j -= c
break
for i in range(k):
if L[i] == R[-i-1] :
print(L[i]+1)
|
N, K, C = map(int, input().split())
S = input()
left = []
right = []
i, j = 0, N-1
while len(left) <= K-1:
if S[i] == "o":
left.append(i)
i += C+1
else:
i += 1
while len(right) <= K-1:
if S[j] == "o":
right.append(j)
j -= C+1
else:
j -= 1
right.sort()
for n in range(K):
if left[n] == right[n]:
print(left[n] + 1)
| 1 | 40,773,772,000,608 | null | 182 | 182 |
rc=list(map(int,input().split()))
sheet=[list(map(int,input().split()))+[0] for i in range(rc[0])]
sheet.append([0 for i in range(rc[1]+1)])
for s in sheet:
s[-1]=sum(s[0:-1])
for i in range(rc[1]+1):
r=sum([n[i] for n in sheet[0:-1]])
sheet[-1][i]=r
for sh in sheet:
print(*sh)
|
from sys import stdin
def main():
#入力
readline=stdin.readline
n,r=map(int,readline().split())
if n>=10:
print(r)
else:
print(r+100*(10-n))
if __name__=="__main__":
main()
| 0 | null | 32,351,599,582,846 | 59 | 211 |
n=int(input())
E=[0]*n
for _ in range(n):
u,k,*V=map(int,input().split())
E[u-1]=sorted(V)[::-1]
todo=[1]
seen=[0]*n
d=[0]*n
f=[0]*n
t=0
while 0 in f:
if not todo:
todo.append(seen.index(0)+1)
if seen[todo[-1]-1]==0:
seen[todo[-1]-1]=1
t+=1
d[todo[-1]-1]=t
for v in E[todo[-1]-1]:
if d[v-1]==0:
todo.append(v)
elif f[todo[-1]-1]==0:
t+=1
f[todo.pop()-1]=t
else:
todo.pop()
for i in range(n):
print(i+1,d[i],f[i])
|
import sys
input = lambda: sys.stdin.readline().rstrip()
def main():
a = list(map(int, input().split()))
if sum(a) >= 22:
print('bust')
else:
print('win')
if __name__ == '__main__':
main()
| 0 | null | 59,329,468,427,840 | 8 | 260 |
import sys
def input(): return sys.stdin.readline().rstrip()
def per(n, r, mod=10**9+7): # 順列数
per = 1
for i in range(r):
per = per*(n-i) % mod
return per
def com(n, r, mod=10**9+7): # 組み合わせ数
r = min(n-r, r)
bunshi = per(n, r, mod)
bunbo = 1
for i in range(1, r+1):
bunbo = bunbo*i % mod
return bunshi*pow(bunbo, -1, mod) % mod
def comH(n, r, mod=10**9+7): # n種類からr個取る重複組み合わせ数
return com(n+r-1,r,mod)
def main():
s = int(input())
ans = 0
for i in range(1, (s//3)+1):
k = s-3*i
ans += comH(i,k)
#print(com(k+i,k),k+i,i)
print(ans % (10**9+7))
if __name__ == '__main__':
main()
|
n,m=map(int,input().split())
sc=sorted([list(map(int,input().split())) for i in range(m)])
ans=[0 for i in range(n)]
res=True
for i in range(m):
if (i>0 and sc[i][0]==sc[i-1][0] and sc[i][1]!=sc[i-1][1]) or (n>1 and sc[i][0]==1 and sc[i][1]==0):
res=False
break
else:
ans[sc[i][0]-1]=sc[i][1]
if n>1 and ans[0]==0:
ans[0]=1
ans2=int("".join([str(i) for i in ans])) if res else -1
print(ans2)
| 0 | null | 31,884,115,343,526 | 79 | 208 |
input()
A = list(map(int, input().split()))
sum_list = sum(A)
sum_of_product = 0
for i in A:
sum_list -= i
sum_of_product = ((sum_list * i) % (10 ** 9 + 7) + sum_of_product) % (10 ** 9 + 7)
print(sum_of_product)
|
S,T=map(str, input().split())
a,b=map(int, input().split())
U = str(input())
if S == U :
a -= 1
if T == U:
b -= 1
print(a,b)
| 0 | null | 38,081,500,922,670 | 83 | 220 |
unused = input()
values = [x for x in input().split()]
print(' '.join(values[::-1]))
|
n = int(input())
c = list(input())
x = c.count("R")
ans = 0
for i in range(x):
if c[i] == "W":
ans += 1
print(ans)
| 0 | null | 3,584,324,377,660 | 53 | 98 |
s=input()
s_list=list(s)
x=len(s_list)
if s_list[x-1]=="s":
s_list.append("es")
else:
s_list.append("s")
print("".join(s_list))
|
val = input()
valf=val[-1]
if(valf=="s"):
print(val+"es")
else:
print(val+"s")
| 1 | 2,368,675,813,160 | null | 71 | 71 |
n,k = map(int, input().split())
i=0
a=[]
while n!=0:
a.append(n%k)
n=n//k
i=i+1
print(len(a))
|
N = int(input())
A = list(map(int, input().split()))
res = "APPROVED"
for i in A:
if i % 2 == 0:
if i % 3 != 0 and i % 5 != 0:
res = "DENIED"
print(res)
| 0 | null | 66,623,336,526,432 | 212 | 217 |
def selectionSort(A,N,cnt=0):
for i in range(N):
minj = i
for j in range(i,N):
if A[j] < A[minj]:
minj = j
A[i] , A[minj] = A[minj] , A[i]
if A[i] != A[minj]:
cnt += 1
return A , cnt
N = int(input())
A = list(map(int,input().split()))
X , cnt = selectionSort(A,N)
print(*X)
print(cnt)
|
n = int(raw_input())
a = map(int,raw_input().split(' '))
nswap=0
for i in range(n):
min_v = a[i]
min_p = i
for j in range(i,n):
if min_v > a[j]:
min_v = a[j]
min_p = j
if min_p != i:
a[i],a[min_p]=a[min_p],a[i]
nswap+=1
print ' '.join([str(v) for v in a])
print nswap
| 1 | 22,389,743,762 | null | 15 | 15 |
import bisect,collections,copy,itertools,math,string
import sys
def I(): return int(sys.stdin.readline().rstrip())
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())
def main():
s = S()
k = I()
same = len(set(list(s)))==1
ans = None
if same:
ans = len(s)*k//2
else:
if s[0]!=s[-1]:
cnt = 0
change = False
for i in range(1,len(s)):
if s[i] == s[i-1] and not change:
cnt += 1
change = True
else:
change = False
ans = cnt*k
else:
char = s[0]
start = len(s)
goal = -1
cnt = 0
while s[start-1] == char:
start -= 1
while s[goal+1] == char:
goal += 1
lenth = len(s)-start + goal+1
cnt += lenth//2 * (k-1)
ccnt = 0
change = False
for i in range(goal+1+1,start):
if s[i] == s[i-1] and not change:
ccnt += 1
change = True
else:
change = False
cnt += ccnt * (k-2)
ccnt = 0
change = False
for i in range(1,start):
if s[i] == s[i-1] and not change:
ccnt += 1
change = True
else:
change = False
cnt += ccnt
ccnt = 0
change = False
for i in range(goal+1+1, len(s)):
if s[i] == s[i-1] and not change:
ccnt += 1
change = True
else:
change = False
cnt += ccnt
ans = cnt
print(ans)
main()
|
s = input()
k = int(input())
s_list = []
ans = 0
def rle(s):
tmp, count = s[0], 1
for i in range(1, len(s)):
if tmp == s[i]:
count += 1
else:
s_list.append(count)
tmp = s[i]
count = 1
s_list.append(count)
return
rle(s)
if len(s_list) >= 2:
for i in range(len(s_list)):
if s_list[i] >= 2:
ans += s_list[i] // 2
ans *= k
if (s_list[0] + s_list[-1]) % 2 == 0 and s[0] == s[-1]:
ans += k - 1
else:
ans = len(s) * k // 2
print(ans)
| 1 | 175,418,783,127,758 | null | 296 | 296 |
#データ入力
rowNum, columnNum = map(int, input().split())
inMat = [[0] * columnNum for i in range(rowNum)]
inColumnVec = [[0] for i in range(columnNum)]
for row in range(rowNum):
inMat[row] = [int(i) for i in input().split()]
for column in range(columnNum):
inColumnVec[column] = int(input())
timesAns = [[0] for i in range(rowNum)]
#行列計算
for row in range(rowNum):
timesAns[row] = 0
for column in range(columnNum):
timesAns[row] = timesAns[row] + inMat[row][column] * inColumnVec[column]
for row in range(rowNum):
print(timesAns[row])
|
n,m = map(int,raw_input().split())
a = [[0 for i in range (m)]for j in range(n)]
b = [0 for i in range(m)]
c = [0 for i in range(n)]
for i in range(n):
x = map(int,raw_input().split())
for j in range(m):
a[i][j] = x[j]
for i in range(m):
b[i] = int(raw_input())
for i in range(n):
for j in range(m):
c[i] += a[i][j] * b[j]
print c[i]
| 1 | 1,169,834,721,518 | null | 56 | 56 |
n = int(input())
a = list(map(int, input().split()))
count = 0
for i in range(n):
for j in range(n-1, i, -1):
if a[j] < a[j-1]:
a[j], a[j-1] = a[j-1], a[j]
count += 1
print(' '.join(map(str, a)))
print(count)
|
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))
| 1 | 16,883,607,368 | null | 14 | 14 |
def encode(s):
val = 0
min_val = 0
for c in s:
if c == '(':
val += 1
else:
val -= 1
min_val = min(min_val, val)
return [min_val, val]
def check(s):
h = 0
for p in s:
b = h + p[0]
if b < 0:
return False
h += p[1]
return True
n = int(input())
ls = []
rs = []
l_total = 0
r_total = 0
for _ in range(n):
si = encode(input())
if si[1] > 0:
ls.append(si)
l_total += si[1]
else:
si[0] -= si[1]
si[1] *= -1
rs.append(si)
r_total += si[1]
list.sort(ls, reverse=True)
list.sort(rs, reverse=True)
if check(ls) and check(rs) and l_total == r_total:
print("Yes")
else:
print("No")
|
import math
n=int(input())
num=math.ceil(n/1.08)
check=int(num*1.08)
if check==n:
print(num)
else:
print(':(')
| 0 | null | 74,705,183,096,570 | 152 | 265 |
import sys
import math
from collections import defaultdict
from collections import deque
sys.setrecursionlimit(1000000)
MOD = 10 ** 9 + 7
input = lambda: sys.stdin.readline().strip()
NI = lambda: int(input())
NMI = lambda: map(int, input().split())
NLI = lambda: list(NMI())
SI = lambda: input()
def main():
N = NI()
ans = 0
for a in range(1, N):
ans += N // a
if N % a == 0:
ans -= 1
print(ans)
if __name__ == "__main__":
main()
|
def main():
n, x, y = map(int, input().split())
x -= 1
y-= 1
ans = [0]*n
for i in range(n):
for j in range(i+ 1, n):
d = min(j-i, abs(j-y) + abs(x-i) + 1, abs(j-x) + abs(y-i) + 1)
ans[d] += 1
for i in range(1, n):
print(ans[i])
if __name__ == "__main__":
main()
| 0 | null | 23,481,718,495,030 | 73 | 187 |
n = int(input())
a = list(map(int,input().split()))
a = sorted(a)
aMax = a[-1]
l = len(a)
count = 0
k = 0
kSet = set()
for i in range(n):
value = a[i]
if not(value in kSet):
if i != 0 and a[i-1] == value:
count -= 1
kSet.add(value)
continue
count += 1
j = 2
k = 0
while k < aMax:
k = a[i] * j
kSet.add(k)
j += 1
print(count)
|
A,B = (int(a) for a in input().split())
ans = A - B * 2
print(max(0,ans))
| 0 | null | 90,157,688,543,878 | 129 | 291 |
n = int(input())
a, b = map(list, input().split())
if len(a) == len(b):
for i in range(0, len(a)):
print(a[i] + b[i], end = "")
|
from collections import Counter
S = input()
C = Counter()
MOD = 2019
n = 0
for i, s in enumerate(S[::-1]):
s = int(s)
n += pow(10, i, MOD) * s % MOD
C[n % MOD] += 1
C[0] += 1
ans = 0
for v in C.values():
ans += v * (v - 1) // 2
print(ans)
| 0 | null | 71,633,243,727,264 | 255 | 166 |
n = int(input())
s = set()
for i in range(n):
s.add(input())
print(len(s))
|
X = int(input())
for i in range(1,1000000000):
if ( X * i ) % 360 == 0:
print(i)
quit()
| 0 | null | 21,688,968,335,800 | 165 | 125 |
from sys import stdin
from math import sqrt
x1, y1, x2, y2 = [float(x) for x in stdin.readline().rstrip().split()]
print(sqrt((x2-x1)**2 + (y2-y1)**2))
|
n=int(input())
p=map(int,input().split())
mi = n+1
ans = 0
for i in p:
if mi > i:
mi = i
ans+=1
print(ans)
| 0 | null | 42,571,953,288,722 | 29 | 233 |
a,v=map(int,input().split())
b,w=map(int,input().split())
t=int(input())
if v<w:
print("NO")
elif v==w:
if a==b:
print("YES")
else:
print("NO")
elif v>w:
t0 = abs((a-b)/(v-w))
if t0<=t:
print("YES")
else:
print("NO")
|
A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())
if(W > V):
print('NO')
exit(0)
# 相対速度、距離
S = V - W
D = abs(A - B)
if(D > S * T):
print('NO')
exit(0)
else:
print('YES')
| 1 | 15,225,677,786,608 | null | 131 | 131 |
X=int(input())
ans=1000*(X//500)+5*((X-(X//500*500))//5)
print(ans)
|
X = int(input())
total = 0
happiness_500 = X // 500 *1000
total += happiness_500
y = X % 500
happiness_5 = y //5 *5
total += happiness_5
print(total)
| 1 | 42,777,908,957,938 | null | 185 | 185 |
S=list(str(input()))
ans=0
sofar=0
j=1
nax=0
for i in range(len(S)-1):
if S[i]==S[i+1]:
ans+=j
j+=1
elif S[i]=='<' and S[i+1]=='>':
ans+=j
nax=j
j=1
else:
ans+=j
if nax!=0:
ans-=j
j=1
nax=0
if j>nax:
ans-=nax
nax=0
if j>nax:
ans+=j
ans-=nax
print(ans)
|
#!/usr/bin/env python3
s = input()
c = 0
a = 0
p = ""
n = 0
for i in s:
if i != p:
if i == "<":
if c < 0:
a -= c * n
else:
a -= c * (n - 1)
n = 2
c = 1
else:
n = 2
c -= 1
else:
if i == "<":
c += 1
n += 1
else:
c -= 1
n += 1
a += c
p = i
if p == ">":
if c < 0:
a -= c * n
else:
a -= c * (n - 1)
print(a)
| 1 | 156,849,904,075,680 | null | 285 | 285 |
S = list(str(input()))
S.reverse()
mod = 2019
rem = [0]*mod
num = 0
rem[num] += 1
d = 1
ans = 0
for s in S:
num += int(s) * d
num %= mod
d *= 10
d %= mod
rem[num] += 1
for r in rem:
ans += r*(r-1)//2
print(ans)
|
S = input()[::-1]
S_mod = [0] * (len(S)+1)
S_mod[0] = int(S[0])
d = 10
for i in range(len(S)-1):
S_mod[i + 1] = (S_mod[i] + int(S[i+1])*d)%2019
d = d * 10 % 2019
mod_count = [0] * 2019
for i in range(len(S_mod)):
mod_count[S_mod[i]] += 1
count = 0
for i in range(2019):
count += mod_count[i] * (mod_count[i] - 1) / 2
print(int(count))
| 1 | 30,936,143,374,120 | null | 166 | 166 |
def main():
n, k, s = map(int, input().split())
other = 0
if s == 10**9:
other = 10**9 - 1
else:
other = s + 1
if n > k:
ans = [s for _ in range(k)] + [other for _ in range(n-k)]
else:
ans = [s for _ in range(n)]
print(*ans)
if __name__ == "__main__":
main()
|
n, k, s = map(int, input().split())
a = [s] * n
if s == 1:
s = 2
else:
s -=1
for i in range(k, n):
a[i] = s
print(a[0], end = "")
for i in a[1:]:
print("", i, end = "")
print()
| 1 | 91,415,983,480,772 | null | 238 | 238 |
S = input()
T = input()
max_match = 0
n = len(T)
m = len(S)
for i in range(m-n+1):
tmp = 0
for j in range(i,i+n):
if S[j] == T[j-i]:
tmp += 1
if tmp > max_match:
max_match = tmp
ans = n - max_match
print(ans)
|
print(['No', 'Yes']['7' in input()])
| 0 | null | 18,878,705,454,840 | 82 | 172 |
import math
n=int(input())
l=0
summ=0
for i in range(1,n+1):
for j in range(1,n+1):
for k in range(1,n+1):
ans=math.gcd(i,j,)
ans=math.gcd(ans,k)
summ+=ans
print(summ)
|
import math
from functools import reduce
INT = lambda: int(input())
INTM = lambda: map(int,input().split())
STRM = lambda: map(str,input().split())
STR = lambda: str(input())
LIST = lambda: list(map(int,input().split()))
LISTS = lambda: list(map(str,input().split()))
def do():
k=INT()
ans=0
for i in range(1,k+1):
for j in range(1,k+1):
for h in range(1,k+1):
ans+=math.gcd(math.gcd(i,j),h)
#print(ans,i,j,h)
print(ans)
if __name__ == '__main__':
do()
| 1 | 35,565,924,781,200 | null | 174 | 174 |
d,t,s = map(int,input().split())
print("Yes" if d <= t*s else "No")
|
H,W = [int(i) for i in input().split()]
h1 = H//2
h2 = H-h1
w2 = W//2
w1 = W-w2
if H==1 or W==1:
print(1)
else:
print(h2*w1+h1*w2)
| 0 | null | 27,112,867,483,020 | 81 | 196 |
n=int(input())
d=list(map(int,input().split()))
d2=[m**2 for m in d]
print((sum(d)**2-sum(d2))//2)
|
data = input()
x = []
x = data.split()
a = int(x[0])
b = int(x[1])
if(a > b):
print("a > b")
elif(a < b):
print("a < b")
else:
print('a == b')
| 0 | null | 84,219,054,208,718 | 292 | 38 |
n=int(input())
l=list(map(int,input().split()))
n_lis=[i for i in range(1,n+1)]
dic={i:j for i,j in zip(l,n_lis)}
num_lis=[str(dic[i]) for i in range(1,n+1)]
print(' '.join(num_lis))
|
N=int(input())
L=list(map(int,input().split()))
S=[0]*N
c=1
for i in L:
S[i-1]=c
c+=1
for i in range(N):
print(S[i],end=' ')
| 1 | 181,080,038,206,240 | null | 299 | 299 |
from math import gcd
def lcm(a, b):
return a // gcd(a, b) * b
N, M = map(int, input().split())
As = list(map(int, input().split()))
rightmostbit = As[0] & -As[0]
for A in As[1:]:
if rightmostbit != A & -A:
print(0)
exit()
lcm_of_half_As = 1
for A in As:
lcm_of_half_As = lcm(lcm_of_half_As, A // 2)
if lcm_of_half_As > M:
break
print((M // lcm_of_half_As + 1) // 2)
|
a, b = map(int, input().split())
mat = [map(int, input().split()) for i in range(a)]
vec = [int(input()) for i in range(b)]
for row in mat:
print(sum([x*y for x, y in zip(row, vec)]))
| 0 | null | 51,592,534,884,318 | 247 | 56 |
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)
|
n, m, k = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
aa = [0]
bb = [0]
for i in range(n):
aa.append(a[i]+aa[-1])
for i in range(m):
bb.append(b[i]+bb[-1])
ans = 0
j = m
for i in range(n+1):
r = k - aa[i]
while bb[j] > r and j >= 0:
j -= 1
if j >= 0:
ans = max(ans, i+j)
print(ans)
| 0 | null | 36,801,341,665,440 | 210 | 117 |
s=input()
ans="No"
if len(s)%2==0:
if s=="hi"*(len(s)//2):
ans="Yes"
print(ans)
|
N,M,*f = open(0).read().split()
N = int(N)
M = int(M)
pS = [f[i*2:i*2+2] for i in range(M)]
accepted = [0] * (N+1)
wrong = [0] * (N+1)
penalty = [0] * (N+1)
for p,S in pS:
i = int(p)
if accepted[i] == 0:
if S == 'AC':
penalty[i] = wrong[i]
accepted[i] = 1
else:
wrong[i] += 1
print(sum(accepted),sum(penalty))
| 0 | null | 73,611,450,819,284 | 199 | 240 |
S = input()
if(len(S) % 2 != 0):
print("No")
exit(0)
for i in range(0, len(S), 2):
if S[i:i+2] != "hi":
print("No")
exit(0)
print("Yes")
|
def selection_sort(A):
count = 0
for i in range(len(A)):
min_value = A[i]
min_value_index = i
# print('- i:', i, 'A[i]', A[i], '-')
for j in range(i, len(A)):
# print('j:', j, 'A[j]:', A[j])
if A[j] < min_value:
min_value = A[j]
min_value_index = j
# print('min_value', min_value, 'min_value_index', min_value_index)
if i != min_value_index:
count += 1
A[i], A[min_value_index] = A[min_value_index], A[i]
# print('swap!', A)
return count
n = int(input())
A = list(map(int, input().split()))
count = selection_sort(A)
print(*A)
print(count)
| 0 | null | 26,641,328,288,192 | 199 | 15 |
W,H,x,y,r=map(int,input().split())
print('Yes'if(False if x<r or W-x<r else False if y<r or H-y<r else True)else'No')
|
import sys
W,H,x,y,r = map(int,sys.stdin.readline().split())
if x+r > W or x-r < 0 or y+r > H or y-r < 0:
print('No')
else:
print('Yes')
| 1 | 465,560,578,872 | null | 41 | 41 |
N, M, K = map(int, input().split())
A=list(map(int, input().split()))
B=list(map(int, input().split()))
Asum=[0]
Bsum=[0]
for i, a in enumerate(A):
Asum.append(Asum[i]+a)
for i, b in enumerate(B):
Bsum.append(Bsum[i]+b)
ans, b = 0, M
for a, asum in enumerate(Asum):
if asum > K:
break
while Bsum[b]>K - asum:
b-=1
ans = max(ans, a+b)
print(ans)
|
# -*- coding: utf-8 -*-
"""
Created on Mon Sep 7 17:11:27 2020
@author: liang
"""
N, M = map(int, input().split())
ans = [-1]*N
res = 0
for i in range(M):
s, c = map(int, input().split())
if s == 1 and c == 0 and N != 1:
print(-1)
break
if ans[s-1] == -1 or ans[s-1] == c:
ans[s-1] = c
else:
print(-1)
break
else:
if ans[0] == -1:
ans[0] = 1
if M == 0 and N == 1:
ans[0] = 0
ans = [0 if a == -1 else a for a in ans]
#print(ans)
for i in range(N):
res += ans[-(i+1)]*10**i
print(res)
| 0 | null | 35,611,169,161,412 | 117 | 208 |
N=int(input())
a=list(map(int,input().split()))
ans=0
for i in range(N-1):
if a[i]>=a[i+1]:
ans+=a[i]-a[i+1]
a[i+1]=a[i]
print(ans)
|
n = int(input())
a = map(int,input().split(' '))
tallest = 0
step = 0
for i in a:
if i < tallest:
step = step + tallest - i
else:
tallest = i
print(step)
| 1 | 4,516,807,390,720 | null | 88 | 88 |
def main():
H, W = map(int ,input().split())
if H == 1 or W == 1:
print(1)
else:
L1 = 0
L2 = 0
L1 = L2 = W // 2
if W % 2 == 1:
L1 += 1
ans = (L1 + L2) * (H//2)
if H % 2 == 1:
ans += L1
print(ans)
if __name__ == "__main__":
main()
|
# coding: utf-8
# Your code here!
while(1):
H,W=map(int,input().split(" "))
if H==0 and W==0:
break
else:
for i in range(H):
for j in range(W):
print("#",end="")
print("")
print("")
| 0 | null | 25,962,592,097,392 | 196 | 49 |
n, m = map(int, input().split())
sc = [tuple(map(int, input().split())) for j in range(m)]
for i in range(10**n):
if len(str(i)) == n and all(str(i)[s - 1] == str(c) for s, c in sc):
print(i)
break
else:
print(-1)
|
N, M = map(int, input().split())
S = ['a'] * (N+1)
for i in range(M):
s, c = list(map(int, input().split()))
if S[s] != 'a' and S[s] != str(c):
print(-1)
exit()
S[s] = str(c)
if S[1] == '0' and N > 1:
print(-1)
exit()
for i in range(1, N+1):
if S[i] == 'a':
if i == 1 and N > 1:
S[i] = '1'
else:
S[i] = '0'
print(int(''.join(S[1:])))
| 1 | 60,930,004,840,448 | null | 208 | 208 |
N, K = map(int, input().split())
MOD = 10**9+7
mx = [0]*(K+1)
ans = 0
for i in range(K, 0, -1):
mx[i] = pow(K//i, N, MOD)
for j in range(2*i, K+1, i):
mx[i] -= mx[j]
ans += i*mx[i]
print(ans%MOD)
|
n,k=map(int,input().split())
#k以下のn個の数字
ans=[0]*(k+1)
p=10**9+7
result=0
for i in range(k):
num=k-i
ans[num]=pow(k//num,n,p)
j=2
while num*j<=k:
ans[num]-=ans[num*j]
j+=1
result+=((ans[num]*num)%p)
#print(num,ans)
print(result%p)
| 1 | 36,835,233,054,748 | null | 176 | 176 |
#ALL you can eat
#0-1 なっぷサック問題をとく* N
#要領T-1のバックと 大きさがA,価値がBの荷物がNこずつある。 この時これらを使って価値をT-1をこえない範囲で最大にする方法を考える。
#dpl[N][V]=1番目からN番目までの荷物を用いて、重さをVにする上で実現可能な価値の最大値
N,T=map(int,input().split())
d=[]
for i in range(N):
a,b=map(int,input().split())
d.append((a,b))
dpl=[[0 for i in range(T)] for j in range(N+1)]
for i in range(N):
weight,value=d[i]
for j in range(T):
if j>=weight:
dpl[i+1][j]=max(dpl[i][j],dpl[i][j-weight]+value)
else:
dpl[i+1][j]=dpl[i][j]
#dpr[K][V]=K番目からN番目までの荷物を用いて、重さをVにする上で実現可能な価値の最大値
dpr=[[0 for i in range(T)] for j in range(N+2)]
for i in range(1,N+1):
weight,value=d[-i]
for j in range(T):
if j>=weight:
dpr[N+1-i][j]=max(dpr[N+2-i][j],dpr[N+2-i][j-weight]+value)
else:
dpr[N+1-i][j]=dpr[N+2-i][j]
#dpr[K][V]=K番目からN番目までの荷物を用いて重さをV以下にする上で実現可能な価値の最大値にする
for i in range(1,N+1):
for j in range(1,T):
dpr[i][j]=max(dpr[i][j],dpr[i][j-1])
ans=0
for i in range(N):
sub=d[i][1]
#i+1番目の物を使わない
add=0
for j in range(T):
add=max(add,dpl[i][j]+dpr[i+2][T-1-j])
sub+=add
ans=max(sub,ans)
print(ans)
|
n,m,l=map(int,input().split())
abc=[list(map(int,input().split())) for _ in [0]*m]
q=int(input())
st=[list(map(int,input().split())) for _ in [0]*q]
inf=10**12
dist=[[inf]*n for _ in [0]*n]
for i in range(n):
dist[i][i]=0
for a,b,c in abc:
dist[a-1][b-1]=c
dist[b-1][a-1]=c
for k in range(n):
for i in range(n):
for j in range(n):
dist[i][j]=min(dist[i][j],dist[i][k]+dist[k][j])
inf=10**3
dist2=[[inf]*n for _ in [0]*n]
for i in range(n):
for j in range(n):
if dist[i][j]<=l:
dist2[i][j]=1
for k in range(n):
for i in range(n):
for j in range(n):
dist2[i][j]=min(dist2[i][j],dist2[i][k]+dist2[k][j])
for i in range(n):
for j in range(n):
if dist2[i][j]==inf:
dist2[i][j]=-1
else:
dist2[i][j]-=1
for s,t in st:
print(dist2[s-1][t-1])
| 0 | null | 162,567,155,652,018 | 282 | 295 |
N = int(input())
A = sorted(map(int, input().split()))
X = 0
Y = 0
B = []
for i in range(N-2):
X = i + 1
for j in range(X,N-1):
Y = j + 1
for k in range(Y, N):
if A[k] < A[i] + A[j]:
if A[k] != A[i] and A[i] != A[j] and A[k] != A[j]:
B.append((A[i],A[j],A[k]))
print(len(B))
|
N = int(input())
L = list(map(int, input().split()))
c = 0
for i in range(N):
for j in range(i+1,N):
for k in range(j+1,N):
if L[i]!=L[j] and L[j]!=L[k] and L[k]!=L[i]:
if L[i] + L[j] + L[k] > 2 * max(L[i],L[j],L[k]):
c +=1
print(c)
| 1 | 5,053,270,635,240 | null | 91 | 91 |
import sys
heights = [int(i) for i in sys.stdin.read().split()]
heights.sort(reverse=True)
print("\n".join(map(str, heights[:3])))
|
import sys
# A - Don't be late
D, T, S = map(int, input().split())
if S * T >= D:
print('Yes')
else:
print('No')
| 0 | null | 1,806,056,982,300 | 2 | 81 |
N=int(input());M=10**9+7
print((pow(10,N,M)-2*pow(9,N,M)+pow(8,N,M))%M)
|
n=int(input())
p=10**9+7
total=(10**n)%p
except_0=(9**n)%p
except_9=except_0
except_both=(8**n)%p
# double reduced from [1,8]
# so add that
print((total-except_0-except_9+except_both)%p)
| 1 | 3,147,034,795,620 | null | 78 | 78 |
N, M, L = map(int, input().split())
INF = 10**12
dp = [[INF]*N for i in range(N)]
fp = [[INF]*N for i in range(N)]
for i in range(N):
dp[i][i]=0
fp[i][i]=0
k = [[0]*N for i in range(N)]
for i in range(M):
a, b, c = map(int, input().split())
dp[a-1][b-1] = c
dp[b-1][a-1] = c
for i in range(N):
for j in range(N):
for h in range(N):
dp[j][h] = min(dp[j][h], dp[j][i]+dp[i][h])
for j in range(N):
for h in range(N):
if dp[j][h]<=L:
fp[j][h] = 1
for i in range(N):
for j in range(N):
for h in range(N):
fp[j][h] = min(fp[j][h], fp[j][i]+fp[i][h])
Q = int(input())
for i in range(Q):
s, t = map(int, input().split())
s = s-1
t = t-1
if fp[s][t]==INF:
print(-1)
else:
print(fp[s][t]-1)
|
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])])
| 0 | null | 86,958,579,487,162 | 295 | 34 |
import sys
def input(): return sys.stdin.readline().rstrip()
# ライブラリ参照https://atcoder.jp/contests/practice2/submissions/16580070
class SegmentTree:
__slots__ = ["func", "e", "original_size", "n", "data"]
def __init__(self, length_or_list, func, e):
self.func = func
self.e = e
if isinstance(length_or_list, int):
self.original_size = length_or_list
self.n = 1 << ((length_or_list - 1).bit_length())
self.data = [self.e] * self.n
else:
self.original_size = len(length_or_list)
self.n = 1 << ((self.original_size - 1).bit_length())
self.data = [self.e] * self.n + length_or_list + \
[self.e] * (self.n - self.original_size)
for i in range(self.n-1, 0, -1):
self.data[i] = self.func(self.data[2*i], self.data[2*i+1])
def replace(self, index, value):
index += self.n
self.data[index] = value
index //= 2
while index > 0:
self.data[index] = self.func(
self.data[2*index], self.data[2*index+1])
index //= 2
def folded(self, l, r):
left_folded = self.e
right_folded = self.e
l += self.n
r += self.n
while l < r:
if l % 2:
left_folded = self.func(left_folded, self.data[l])
l += 1
if r % 2:
r -= 1
right_folded = self.func(self.data[r], right_folded)
l //= 2
r //= 2
return self.func(left_folded, right_folded)
def all_folded(self):
return self.data[1]
def __getitem__(self, index):
return self.data[self.n + index]
def max_right(self, l, f):
# assert f(self.e)
if l >= self.original_size:
return self.original_size
l += self.n
left_folded = self.e
while True:
# l //= l & -l
while l % 2 == 0:
l //= 2
if not f(self.func(left_folded, self.data[l])):
while l < self.n:
l *= 2
if f(self.func(left_folded, self.data[l])):
left_folded = self.func(left_folded, self.data[l])
l += 1
return l - self.n
left_folded = self.func(left_folded, self.data[l])
l += 1
if l == l & -l:
break
return self.original_size
# 未verify
def min_left(self, r, f):
# assert f(self.e)
if r == 0:
return 0
r += self.n
right_folded = self.e
while True:
r //= r & -r
if not f(self.func(self.data[r], right_folded)):
while r < self.n:
r = 2 * r + 1
if f(self.func(self.data[r], right_folded)):
right_folded = self.func(self.data[r], right_folded)
r -= 1
return r + 1 - self.n
if r == r & -r:
break
return 0
def orr(x, y):
return x | y
def main():
N = int(input())
S = input()
S = list(map(lambda c: 2**(ord(c) - ord('a')), list(S)))
Q = int(input())
seg = SegmentTree(S, orr, 0)
for _ in range(Q):
num, x, y = input().split()
if num == '1':
seg.replace(int(x)-1, 2**(ord(y) - ord('a')))
else:
bits = seg.folded(int(x)-1, int(y))
print(sum(map(int, list(bin(bits))[2:])))
if __name__ == '__main__':
main()
|
import sys
from operator import or_
input=sys.stdin.readline
class SegTree():
def __init__(self, N, e=float("inf"), operator_func=min):
self.e = e
self.size = N
self.node = [self.e] * (2*N)
self.op = operator_func
def set_list(self, l):
for i in range(self.size):
self.node[i+self.size-1] = l[i]
for i in range(self.size-1)[::-1]:
self.node[i] = self.op(self.node[2*i+1], self.node[2*i+2])
def update(self, k, x):
k += self.size - 1
self.node[k] = x
while k >= 0:
k = (k - 1) // 2
self.node[k] = self.op(self.node[2*k+1], self.node[2*k+2])
def get(self, l, r):
x = self.e
l += self.size; r += self.size
a, b = [], []
while l<r:
if l&1:
a += [l-1]; l += 1
if r&1:
r -= 1; b += [r-1]
l >>= 1; r >>= 1
for i in a+(b[::-1]):
x = self.op(x, self.node[i])
return x
def main():
N = int(input())
S = list(input())[:-1]
trees = {chr(97+i):SegTree(N, e=0, operator_func=or_) for i in range(26)}
for i, s in enumerate(S):
trees[s].update(i, 1)
Q = int(input())
for _ in range(Q):
mode, i, v = input().split()
if mode=="1":
i = int(i)-1
trees[S[i]].update(i, 0)
trees[v].update(i, 1)
S[i] = v
else:
i = int(i)-1
v = int(v)
ans = sum(trees[chr(97+j)].get(i, v) for j in range(26))
print(ans)
if __name__ == "__main__":
main()
| 1 | 62,181,912,685,398 | null | 210 | 210 |
def examE():
N, K = LI()
A = LI()
sumA = [0]*(N+1)
for i in range(1,N+1):
sumA[i] = sumA[i-1]+A[i-1]
d = defaultdict(int)
ans = 0
#連想配列 先頭からの番号 余分な量
que = deque()
for i,a in enumerate(sumA):
#K番目以降は一番左のやつ消していく
if que and que[0][0] <= (i-K):
d[que.popleft()[1]] -= 1
cur = (a-i)%K
ans +=d[cur]
d[cur] +=1
que.append((i,cur))
# print(ans,que,d,a-i)
print(ans)
return
def examF():
return
import sys,copy,bisect,itertools,math
from heapq import heappop,heappush,heapify
from collections import Counter,defaultdict,deque
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def SI(): return sys.stdin.readline().strip()
mod = 10**9 + 7
inf = float('inf')
examE()
|
a=input()
print('Yes' if '7' in a else 'No')
| 0 | null | 85,729,915,064,572 | 273 | 172 |
n = int(input())
s=0
a = list(map(int, input().split()))
b = sum(a)
for i in range(n):
b -= a[i]
s += a[i]*b
s = s % ((10**9)+7)
print(s)
|
import sys
from itertools import combinations
input = lambda: sys.stdin.readline().rstrip()
mod = 10**9 + 7
n = int(input())
a = list(map(int, input().split()))
dp = [0 for _ in range(n)]
dp[0] = a[0]
# 累積和の計算
for i in range(1, n):
dp[i] = (a[i] + dp[i - 1]) % mod
ans = 0
for i in range(n):
ans += a[i] * (dp[n - 1] - dp[i])
ans %= mod
print(ans)
| 1 | 3,841,560,254,550 | null | 83 | 83 |
n=input().split()
if int(n[0])==int(n[1]):
print("Yes")
else:
print("No")
|
import sys
import numpy as np
def Ss():
return sys.stdin.readline().rstrip().split(' ')
def Is():
ss = Ss()
return map(int, ss) if len(ss) > 1 else int(ss[0])
a, b, c, d, e = Is()
print(15 - a - b - c - d - e)
| 0 | null | 48,463,369,699,392 | 231 | 126 |
k = int(input())
l = []
for i in range(k):
l.append('ACL')
ans = ''.join(l)
print(ans)
|
score = input()
leng = len(score)
answer = 'x'*leng
print(answer)
| 0 | null | 37,345,649,939,248 | 69 | 221 |
import math
# a=int(input())
#b=int(input())
# c=[]
# for i in b:
# c.append(i)
e1,e2 = map(int,input().split())
f = list(map(int,input().split()))
#j = [input() for _ in range(3)]
cal=1
for i in range(e1-e2):
if f[i]>=f[i+e2]:
print("No")
else:
print("Yes")
|
N, K = map(int, input().split())
A = [int(i) for i in input().split()]
i_list = [0] * N
for i in range(K, N):
if A[i-K] < A[i]:
print('Yes')
else:
print('No')
| 1 | 7,066,006,125,028 | null | 102 | 102 |
n = int(input())
ret = ''
for i in range(1,n+1):
str = repr(i)
if (i % 3 == 0): ret += ' ' + repr(i)
elif ('3' in str): ret += ' ' + repr(i)
print(ret)
|
x = int(input())
for i in range(1,x+1):
y = i
if y % 3 == 0:
print(" %d" % i, end="")
continue
while True:
if int(y) % 10 == 3:
print(" %d" % i, end="")
break
y /= 10
if int(y) == 0: break
print("")
| 1 | 920,202,275,920 | null | 52 | 52 |
N = input()
def f(x):
p = 1
i = 1
cnt = 0
while p > 0:
p = x // (5**i) // 2
cnt += p
i += 1
return cnt
if int(N[-1])%2 == 1:
print(0)
else:
print(f(int(N)))
|
while(1):
line = input()
words = line.split()
a = int(words[0])
op = words[1]
b = int(words[2])
if op == '+':
print(a + b)
elif op == '-':
print(a - b)
elif op == '*':
print(a * b)
elif op == '/':
print(a // b)
elif op == '?':
break
| 0 | null | 58,283,997,890,000 | 258 | 47 |
n = int(input())
total = 0
out = 1
for _ in range(n):
a, b = map(int, input().split())
if a == b:
total += 1
else:
if total >= 3:
out = 0
else:
total = 0
if total >= 3:
out = 0
if out:
print("No")
else:
print("Yes")
|
count = 0
for i in range(int(input())):
l = list(map(int, input().split()))
if l[0] == l[1]:
count += 1
elif l[0] != l[1]:
count = 0
if count >= 3:
print("Yes")
break
if count < 3:
print("No")
| 1 | 2,450,111,701,400 | null | 72 | 72 |
#
# ACL_A
#
n = input()
n = int(n)
for i in range(n):
print("ACL", end='')
|
def main():
import sys
input = sys.stdin.readline
#Union Find
#xの根を求める
def find(x):
if par[x] < 0:
return x
else:
par[x] = find(par[x])
return par[x]
#xとyの属する集合の併合
def unite(x,y):
x = find(x)
y = find(y)
if x == y:
return False
else:
#sizeの大きいほうがx
if par[x] > par[y]:
x,y = y,x
par[x] += par[y]
par[y] = x
return True
#xとyが同じ集合に属するかの判定
def same(x,y):
return find(x) == find(y)
#xが属する集合の個数
def size(x):
return -par[find(x)]
n,m = map(int,input().split())
#初期化
#根なら-size,子なら親の頂点
par = [-1]*n
for i in range(m):
X,Y = map(int,input().split())
unite(X-1,Y-1)
#tank = set([])
for i in range(n):
find(i)
ans=0
for i in par:
if i<0:
ans=max(ans,-i)
print(ans)
if __name__ == '__main__':
main()
| 0 | null | 3,084,750,807,042 | 69 | 84 |
import sys
read = sys.stdin.read
def main():
N, K = map(int, read().split())
dp1 = [0] * (K + 1)
dp2 = [0] * (K + 1)
dp1[0] = 1
for x in map(int, str(N)):
dp1, dp1_prev = [0] * (K + 1), dp1
dp2, dp2_prev = [0] * (K + 1), dp2
for j in range(K, -1, -1):
if j > 0:
dp2[j] = dp2_prev[j - 1] * 9
if x != 0:
dp2[j] += dp1_prev[j - 1] * (x - 1)
dp2[j] += dp2_prev[j]
if x != 0:
dp2[j] += dp1_prev[j]
if x != 0:
if j > 0:
dp1[j] = dp1_prev[j - 1]
else:
dp1[j] = dp1_prev[j]
print(dp1[K] + dp2[K])
return
if __name__ == '__main__':
main()
|
r, g, b = list(map(int, input().split()))
k = int(input())
count = 0
while r >= g:
g *= 2
count += 1
while g >= b:
b *= 2
count += 1
if k >= count:
print('Yes')
else:
print('No')
| 0 | null | 41,443,131,009,246 | 224 | 101 |
num = 100000
n = int(input())
for i in range(n):
num*=1.05
if num % 1000 >= 1 :
a = num % 1000
num = int(num+1000-a)
else:
num = int(num)
print(num)
|
n, *a = map(int, open(0).read().split())
mod = 10 ** 9 + 7
ans = 0
for i in range(60):
cnt = 0
for j in range(n):
cnt += a[j] >> i & 1
ans = (ans + (1 << i) * cnt * (n - cnt) % mod) % mod
print(ans)
| 0 | null | 61,270,806,634,880 | 6 | 263 |
K = int(input())
s = 'ACL'
print(s * K)
|
K = int(input())
s = "ACL"
print(s*K)
| 1 | 2,201,120,585,742 | null | 69 | 69 |
class UnionFind:
def __init__(self):
self.data = {}
self.heights = {}
self.sizes = {}
def get_num_trees(self):
return len(self.heights)
def get_tree_size(self, a):
return self.sizes[self.get_root(a)]
def add_node(self, a):
self.data[a] = a
self.heights[a] = 1
self.sizes[a] = 1
def get_root(self, a):
nodes = [a]
while nodes[-1] not in self.heights:
nodes.append(self.data[nodes[-1]])
for x in nodes:
self.data[x] = nodes[-1]
return nodes[-1]
def union(self, a, b):
root_a = self.get_root(a)
root_b = self.get_root(b)
if root_a == root_b:
return
if self.heights[root_a] > self.heights[root_b]:
a, b = b, a
root_a, root_b = root_b, root_a
self.data[root_a] = root_b
self.heights[root_b] = max(self.heights.pop(root_a) + 1, self.heights[root_b])
self.sizes[root_b] += self.sizes.pop(root_a)
def find(self, a, b):
return self.get_root(a) == self.get_root(b)
N, M = map(int, input().split())
uf = UnionFind()
for i in range(1, N + 1):
uf.add_node(i)
for _ in range(M):
A, B = map(int, input().split())
uf.union(A, B)
print(max(uf.sizes.values()))
|
n, m = map(int, input().split())
class UnionFind():
def __init__(self, n):
self.n = n
self.parent = [int(x) for x in range(n)]
self.tree_size = [1 for _ in range(n)]
def unite(self, x, y):
x_root = self.find(x)
y_root = self.find(y)
if self.same(x_root, y_root):
return
if self.size(x_root) >= self.size(y_root):
self.parent[y_root] = x_root
self.tree_size[x_root] += self.tree_size[y_root]
else:
self.parent[x_root] = y_root
self.tree_size[y_root] += self.tree_size[x_root]
def find(self, x):
if self.parent[x] == x:
return x
else:
next = self.find(self.parent[x])
self.parent[x] = next
return next
def size(self, x):
return self.tree_size[self.find(x)]
def same(self, x, y):
if self.find(x) == self.find(y):
return True
else:
return False
uf = UnionFind(n)
for _ in range(m):
a, b = map(int, input().split())
uf.unite(a-1, b-1)
# print([uf.size(i) for i in range(n)])
print(max([uf.size(i) for i in range(n)]))
| 1 | 3,960,596,772,670 | null | 84 | 84 |
x = int(input())
count_500 = 0
count_5 = 0
count_500 = x // 500
x -= 500 * count_500
count_5 = x // 5
x -= 5 * count_5
print(1000 * count_500 + 5 * count_5)
|
'''
問題：
高橋君は金色の硬貨が好きです。
自分が持っている 500円硬貨 1枚につき 1000、
5円硬貨 1枚につき 5の嬉しさ を得ます。
高橋君は X 円を持っています。
これを高橋君の嬉しさが最大になるように両替したとき、高橋君の嬉しさはいくらになりますか？
(なお、利用できる硬貨は 500 円玉、100 円玉、50 円玉、10 円玉、5円玉、1 円玉の 6 種類とします。)
'''
'''
Xは整数
0 ≦ X ≦ 1,000,000,000
'''
class Yorokobi:
def __init__(self, money, yorokobi):
self.money = money
self.yorokobi = yorokobi
def calc_yorokobi(self, credit): # credit （残金？）を入力として受け取り、喜びを計算して返す
return (credit // self.money) * self.yorokobi
# 標準入力から X の値を取得する
input_x = int(input())
yorokobi_500 = Yorokobi(500, 1000)
yorokobi_5 = Yorokobi(5, 5)
result = 0 # 結果格納用
if input_x >= 500:
result += yorokobi_500.calc_yorokobi(input_x) # 高橋君 500円の喜び
result += yorokobi_5.calc_yorokobi(input_x % 500) # 高橋君 5円の喜び
else:
result += yorokobi_5.calc_yorokobi(input_x)
print(result)
# ret1 = input_x // 500 # 500円で割った商
# ret2 = ret1 * 1000 # 高橋君 500円の喜び
# ret3 = input_x - (ret1 * 500) # X円から500円の枚数分を引いたお金
# ret4 = ret3 // 5 # （X円から500円の枚数分を引いたお金）÷ 5
# ret5 = ret4 * 5 # 高橋君 5円の喜び
# print(ret2 + ret5)
| 1 | 42,729,276,836,512 | null | 185 | 185 |
S = input()
K = int(input())
N = len(S)
bef = ""
start = 0
l = []
for i, s in enumerate(S):
if bef=="":
start = i
elif bef!=s:
l.append(i-start)
start = i
bef = s
l.append(i-start+1)
if len(set(S))==1:
print((N*K)//2)
else:
if S[0]==S[-1]:
ans = (l[0]//2)+(l[-1]//2)+((l[0]+l[-1])//2)*(K-1)
else:
ans = (l[0]//2)*K+(l[-1]//2)*K
for i in l[1:-1]:
ans += (i//2)*K
print(ans)
|
from fractions import gcd
from functools import reduce
def lcm_base(x,y):
return (x*y)//gcd(x,y)
def lcm(A):
return reduce(lcm_base,A,1)
n,m=map(int,input().split())
A=list(map(int,input().split()))
num=lcm(A)
semi=num//2
ans=0
if any([True for i in range(n) if semi%A[i]==0]):print(0)
elif semi<=m:
ans +=1
m -=semi
ans +=m//num
print(ans)
else:print(0)
| 0 | null | 138,540,641,735,982 | 296 | 247 |
import itertools
import math
N=int(input())
zahyou=[list(map(int,input().split()))for i in range(N)]
jyunban=list(itertools.permutations(range(N)))
dist=list()
for i in range(len(jyunban)):
tmp=0
for j in range(N-1):
tmp+=math.sqrt((zahyou[jyunban[i][j]][0]-zahyou[jyunban[i][j+1]][0])**2+(zahyou[jyunban[i][j]][1]-zahyou[jyunban[i][j+1]][1])**2)
dist.append(tmp)
print(sum(dist)/math.factorial(N))
|
n,m=map(int,input().split())
x=list(map(int,input().split()))
memo=[n+1 for _ in range(n+1)]
memo[n]=0
for i in range(n,-1,-1):
for xx in x:
if i-xx<0:
continue
memo[i-xx]=min(memo[i-xx],memo[i]+1)
print(memo[0])
| 0 | null | 74,607,188,628,366 | 280 | 28 |
import bisect
n, m, k = map(int, input().split())
alist = list(map(int, input().split()))
blist = list(map(int, input().split()))
for i in range(len(alist)-1):
alist[i+1] += alist[i]
for i in range(len(blist)-1):
blist[i+1] += blist[i]
x = bisect.bisect_right(alist, k)
ans = bisect.bisect_right(blist, k)
for i in range(x):
d = k - alist[i]
y = bisect.bisect_right(blist, d) + i + 1
if ans < y:
ans = y
print(ans)
|
n,k=(int(i) for i in input().split())
a=list(map(int, input().split()))
a.sort()
sum=0
for i in range(k):
sum+=a[i]
print(sum)
| 0 | null | 11,218,628,086,692 | 117 | 120 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.