code1
stringlengths 16
427k
| code2
stringlengths 16
427k
| similar
int64 0
1
| pair_id
int64 6.82M
181,637B
⌀ | question_pair_id
float64 101M
180,471B
⌀ | code1_group
int64 2
299
| code2_group
int64 2
299
|
|---|---|---|---|---|---|---|
import sys
sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7
class BIT:
def __init__(self, L):
self.n = len(L)
self.bit = [0] * (self.n + 1)
def update(self, idx, x):
while idx <= self.n:
self.bit[idx] += x
idx += idx & (-idx)
def query(self, idx):
res = 0
while idx > 0:
res += self.bit[idx]
idx -= idx & (-idx)
return res
def sec_sum(self, left, right):
return self.query(right) - self.query(left - 1)
def debug(self):
print(*[self.sec_sum(i, i) for i in range(1, self.n + 1)])
def resolve():
n = int(input())
S = list(input().rstrip())
q = int(input())
bits = [BIT(S) for _ in range(26)]
for idx in range(1, n + 1):
s = S[idx - 1]
bits[ord(s) - ord("a")].update(idx, 1)
for _ in range(q):
query = list(input().split())
if query[0] == "1":
i, c = int(query[1]), query[2]
prev = S[i - 1]
bits[ord(prev) - ord("a")].update(i, -1)
bits[ord(c) - ord("a")].update(i, 1)
S[i - 1] = c
else:
l, r = int(query[1]), int(query[2])
res = 0
for j in range(26):
if bits[j].sec_sum(l, r):
res += 1
print(res)
if __name__ == '__main__':
resolve()
|
import sys,queue,math,copy,itertools,bisect,collections,heapq
def main():
sys.setrecursionlimit(10**7)
INF = 10**18
MOD = 10**9 + 7
LI = lambda : [int(x) for x in sys.stdin.readline().split()]
NI = lambda : int(sys.stdin.readline())
N = NI()
R = 2**(N.bit_length())
st = [0] * (R*2)
def update(i,s):
x = 2 ** (ord(s) - ord('a'))
i += R-1
st[i] = x
while i > 0:
i = (i-1) // 2
st[i] = st[i*2+1] | st[i*2+2]
def query(a,b,n,l,r):
ret = 0
if a <= l and r <= b: return st[n]
if a < r and b > l:
vl = query(a,b,n*2+1,l,(l+r)//2)
vr = query(a,b,n*2+2,(l+r)//2,r)
ret = vl | vr
return ret
for i,s in enumerate(sys.stdin.readline().rstrip()):
update(i+1,s)
Q = NI()
for _ in range(Q):
c,a,b = sys.stdin.readline().split()
if c == '1':
update(int(a),b)
else:
ret = query(int(a),int(b)+1,0,0,R)
cnt = 0
b = 1
for i in range(26):
cnt += (b & ret) > 0
b <<= 1
print(cnt)
if __name__ == '__main__':
main()
| 1 | 62,297,850,335,040 | null | 210 | 210 |
import sys
input = sys.stdin.readline
import collections
def main():
N = int(input())
A = list(map(int, input().split()))
v_freq = collections.Counter(A)
v_sum = 0
for v, freq in v_freq.items():
v_sum += v * freq
Q = int(input())
for _ in range(Q):
B, C = map(int, input().split())
if B in v_freq:
v_sum -= (B - C) * v_freq[B]
if C in v_freq:
v_freq[C] += v_freq[B]
else:
v_freq[C] = v_freq[B]
del v_freq[B]
print(v_sum)
else:
print(v_sum)
if __name__ == '__main__':
main()
|
N=int(input())
if N%2==0:
print(1/2)
else:
print((N+1)/(2*N))
| 0 | null | 94,836,801,868,568 | 122 | 297 |
import sys
input = sys.stdin.readline
class Dice:
"""
0:top, 1:south, 2:east, 3:west, 4:north, 5:bottom
"""
def __init__(self, surfaces):
self.surface = surfaces
def roll(self, direction: str):
if direction == "E":
self.surface = [self.surface[3], self.surface[1], self.surface[0],
self.surface[5], self.surface[4], self.surface[2]]
elif direction == "N":
self.surface = [self.surface[1], self.surface[5], self.surface[2],
self.surface[3], self.surface[0], self.surface[4]]
elif direction == "S":
self.surface = [self.surface[4], self.surface[0], self.surface[2],
self.surface[3], self.surface[5], self.surface[1]]
elif direction == "W":
self.surface = [self.surface[2], self.surface[1], self.surface[5],
self.surface[0], self.surface[4], self.surface[3]]
return
def get_top(self):
return self.surface[0]
def main():
surface = [int(i) for i in input().strip().split()]
spins = input().strip()
dice = Dice(surface)
for d in spins:
dice.roll(d)
print(dice.get_top())
if __name__ == "__main__":
main()
|
N = int(input())
st = [list(input().split()) for _ in range(N)]
kyoku = input()
flg = False
ans = 0
for s, t in st:
if flg:
ans += int(t)
if s == kyoku:
flg = True
print(ans)
| 0 | null | 48,389,885,405,028 | 33 | 243 |
N = int(input())
A = list(map(int,input().split()))
ans = 0
for i in range(N):
for j in range(i+1,N):
temp = A[i]*A[j]
ans += temp
print(ans)
|
import itertools
def resolve():
n = int(input())
d = tuple(map(int,input().split()))
ans = 0
for a in itertools.combinations(d,2):
ans += a[0]*a[1]
print(ans)
resolve()
| 1 | 169,035,648,709,330 | null | 292 | 292 |
# -*- coding: utf-8 -*-
input = input().strip().split(" ")
a = int(input[0])
b = int(input[1])
print(a * b, 2 * a + 2 * b)
|
# -*- coding: utf-8 -*-
list = map(int, raw_input().split())
a = list[0]
b = list[1]
print a*b ,
print 2*(a+b)
| 1 | 295,919,274,972 | null | 36 | 36 |
#!usr/bin/env python3
def main():
while True:
numbers = input()
if int(numbers) == 0:
break
res = 0
for i in numbers:
res += int(i)
print(res)
if __name__ == '__main__':
main()
|
while True:
x = input().rstrip('\r\n')
if x == '0':
break
sum = 0
for ii in range(len(x)):
sum += int(x[ii])
print(sum)
| 1 | 1,564,543,096,960 | null | 62 | 62 |
n, k = map(int, input().split())
p_list = list(map(lambda x: int(x) - 1, input().split()))
c_list = list(map(int, input().split()))
max_score = -(1 << 64)
cycles = []
cycled = [False] * n
for i in range(n):
if cycled[i]:
continue
cycle = [i]
cycled[i] = True
while p_list[cycle[-1]] != cycle[0]:
cycle.append(p_list[cycle[-1]])
cycled[cycle[-1]] = True
cycles.append(cycle)
for cycle in cycles:
cycle_len = len(cycle)
accum = [0]
for i in range(cycle_len * 2):
accum.append(accum[-1] + c_list[cycle[i % cycle_len]])
cycle_score = accum[cycle_len]
max_series_sums = [max([accum[i + length] - accum[i]
for i in range(cycle_len)])
for length in range(cycle_len + 1)]
if cycle_len >= k:
score = max(max_series_sums[1:k + 1])
elif cycle_score <= 0:
score = max(max_series_sums[1:])
else:
max_cycle_num, cycle_rem = divmod(k, cycle_len)
score = max(cycle_score * (max_cycle_num - 1) + max(max_series_sums),
cycle_score * max_cycle_num + max(max_series_sums[:cycle_rem + 1]))
max_score = max(max_score, score)
print(max_score)
|
n = int(input())
ans = n // 2
ans += 1 if n % 2 != 0 else 0
print(ans)
| 0 | null | 32,220,618,753,000 | 93 | 206 |
n = int(input())
a = list( map(int, input().split()))
p =10**9+7
cnt= [0]*n
cnt[0]=1
ans = 3
if a[0]!=0:
print(0)
exit()
for i in range(1,n):
if a[i]==0:
ans *= (3-cnt[a[i]])
else:
ans *= (cnt[a[i]-1] - cnt[a[i]])
if cnt[a[i]-1]==0:
print(0)
exit()
ans%=p
cnt[a[i]] += 1
if cnt[a[i]]>3:
print(0)
exit()
print(ans%p)
|
import math, sys
N=int(input())
S=input()
R_count=0
if "R" not in S:
print(0)
sys.exit()
if "W" not in S:
print(0)
sys.exit()
if "R" not in S[S.index("W"):]:
print(0)
sys.exit()
for i in range(N):
if S[i]=="R":
R_count+=1
S=S[:R_count]
ans=S.count("W")
print(ans)
| 0 | null | 68,431,048,957,570 | 268 | 98 |
import math
a,b,c=map(int,input().split())
C=(c/180)*math.pi
S=(a*b*math.sin(C))/2
L=a+b+(a**2+b**2-2*a*b*math.cos(C))**0.5
h=b*math.sin(C)
print("%.5f\n%.5f\n%.5f\n"%(S,L,h))
|
import math
a,b,C = (int(x) for x in input().split())
S = a * b * math.sin(math.radians(C)) / 2
L = math.sqrt(a ** 2 + b ** 2 - 2 * a * b * math.cos(math.radians(C))) + a + b
h = b * math.sin(math.radians(C))
print(round(S,8),round(L,8),round(h,8))
| 1 | 172,657,826,282 | null | 30 | 30 |
N = int(input())
S = input()
if N % 2 or S[:N//2] != S[N//2:]:
print("No")
else:
print("Yes")
|
import operator
from functools import reduce
N, K = map(int, input().split())
A = list(map(int, input().split()))
MOD = 10 ** 9 + 7
positives = [a for a in A if a > 0]
negatives = [a for a in A if a < 0]
positive_cnt = len(positives)
negative_cnt = len(negatives)
zero_cnt = A.count(0)
if 2 * min(K // 2, negative_cnt // 2) + positive_cnt >= K:
ans = 1
positives.sort(key=lambda x: abs(x), reverse=True)
negatives.sort(key=lambda x: abs(x), reverse=True)
if K % 2 == 1:
ans *= positives.pop(0)
K -= 1
X = []
for pair in zip(*[iter(positives)] * 2):
X.append(reduce(operator.mul, pair, 1))
for pair in zip(*[iter(negatives)] * 2):
X.append(reduce(operator.mul, pair, 1))
X.sort(reverse=True)
ans *= reduce(lambda a, b: a * b % MOD, X[:K // 2], 1)
print(ans % MOD)
elif zero_cnt:
print(0)
else:
A.sort(key=lambda x: abs(x))
print(reduce(lambda a, b: a * b % MOD, A[:K], 1) % MOD)
| 0 | null | 78,301,690,199,290 | 279 | 112 |
import collections
def resolve():
n = int(input())
a = tuple(map(int,input().split()))
A = collections.Counter(a)
cnt_0 = 0
for i in A.values():
cnt_0 += int(i*(i-1)/2)
for i in a:
cnt_1 = A[i]-1
print(cnt_0-cnt_1)
resolve()
|
N = int(input())
A = list(map(int,input().split()))
from collections import Counter
ctr = Counter(A)
tmp = sum(v*(v-1)//2 for v in ctr.values())
for a in A:
print(tmp - ctr[a] + 1)
| 1 | 47,838,336,956,000 | null | 192 | 192 |
h,a=map(int,input().split())
i=0
while True:
i+=1
h-=a
if h<=0:
break
print(i)
|
N = int(input())
ans = [0]*(N+1)
for x in range(1,105):
for y in range(1,105):
for z in range(1,105):
tmp = x**2 + y**2 + z**2 +x*y + y*z + z*x
if tmp > N:
continue
ans[tmp]+=1
for i in range(1,N+1):
print(ans[i])
| 0 | null | 42,196,216,951,518 | 225 | 106 |
a,b,c=map(int,input().split())
d=0
while b<=a:
b*=2
d+=1
while c<=b:
c*=2
d+=1
print("Yes"if d<=int(input())else"No")
|
X,Y=map(int,input().split())
if X==1 :
x=300000
elif X==2 :
x=200000
elif X==3 :
x=100000
else :
x=0
if Y==1 :
y=300000
elif Y==2 :
y=200000
elif Y==3 :
y=100000
else :
y=0
if X==1 and Y==1 :
print(x+y+400000)
else :
print(x+y)
| 0 | null | 73,500,362,143,562 | 101 | 275 |
import sys
def ISI(): return map(int, sys.stdin.readline().rstrip().split())
n, m=ISI()
if(n==m):print("Yes")
else:print("No")
|
x, y = input().split()
print('Yes' if x == y else 'No')
| 1 | 83,023,181,044,250 | null | 231 | 231 |
N = int(input())
A = list(map(int, input().split()))
ans = 0
h = A[0]
for a in A:
if h > a:
ans += h - a
else:
h = a
print(ans)
|
n = int(input())
L = list(map(int, input().split()))
a = L[0]
b = 0
for i in range(n-1):
if L[i+1] < a:
b = b + (a - L[i+1])
else:
a = L[i+1]
print(b)
| 1 | 4,560,409,561,888 | null | 88 | 88 |
n, m = map(int, input().split())
s = []
c = []
for _ in range(m):
S, C = map(int, input().split())
s.append(S)
c.append(C)
for i in range(m):
if s[i] == 1 and c[i] == 0 and n != 1:
print(-1)
exit()
for i in range(m):
for j in range(m-1):
if s[i] == s[-j-1] and c[i] != c[-j-1]:
print(-1)
exit()
if n == 3:
one_hundred = False
ten = False
one = False
for i in range(m):
if s[i] == 1:
one_hundred = c[i]
elif s[i] == 2:
ten = c[i]
else:
one = c[i]
if one_hundred == False:
one_hundred = 1
if ten == False:
ten = 0
if one == False:
one = 0
print(one_hundred*100 + ten*10 + one)
exit()
elif n == 2:
ten = False
one = False
for i in range(m):
if s[i] == 1:
ten = c[i]
else:
one = c[i]
if ten == False:
ten = 1
if one == False:
one = 0
print(ten*10 + one)
exit()
else:
one = False
for i in range(m):
if s[i] == 1:
one = c[i]
if one == False:
one = 0
print(one)
exit()
print(-1)
|
N,M = map(int, input().split())
dp = [-1] * N
for i in range(M):
s, c = map(int, input().split())
s -= 1
if dp[s] != -1 and dp[s] != c:
print(-1)
exit()
dp[s] = c
if N != 1:
if dp[0] == 0:
print(-1)
exit()
if dp[0] == -1:
dp[0] = 1
for i in range(1, N):
if dp[i] == -1:
dp[i] = 0
else:
if dp[0] == -1:
dp[0] = 0
print(''.join(map(str, dp)))
| 1 | 60,384,181,135,758 | null | 208 | 208 |
a,b=map(int,raw_input().split())
print a*b,a+a+b+b
|
n, m = map(int, input().split())
h = list(map(int, input().split()))
d = [1] * n
for i in range(m):
a, b = map(int, input().split())
a -= 1
b -= 1
if h[a] > h[b]:
d[b] = 0
elif h[b] > h[a]:
d[a] = 0
else:
d[a] = 0
d[b] = 0
print(sum(d))
| 0 | null | 12,673,980,137,728 | 36 | 155 |
#!/usr/bin/env python3
import sys
input = sys.stdin.buffer.readline
N = int(input())
A = list(map(int,input().split()))
XY = list()
for i in range(N):
XY.append((A[i], i+1))
XY.sort()
Ans = list()
for x,y in XY:
Ans.append(y)
print(*Ans)
|
X, K, D = map(int, input().split())
X = abs(X)
if K - (X // D) < 0:
X -= K * D
print(X)
else:
K = K - (X // D)
X -= D * (X // D)
if K % 2 == 0:
print(abs(X))
else:
print(abs(X-D))
| 0 | null | 92,748,596,946,912 | 299 | 92 |
s = list(input())
q = int(input())
l1 = []
l2 = []
rev = False
for i in range(q):
inp = input()
if inp[0] == "1":
if rev:
rev = False
else:
rev = True
elif inp[2] == "1":
a = inp[4]
if rev:
l2.append(a)
else:
l1.append(a)
else:
a = inp[4]
if rev:
l1.append(a)
else:
l2.append(a)
l1.reverse()
ans = l1 + s + l2
if rev:
ans.reverse()
print("".join(ans))
|
S = list(input())
N = int(input())
normalFlag = True
front = []
back = []
for _ in range(N):
q = list(map(str,input().split()))
if q[0] == '1':
normalFlag = not normalFlag
else:
if q[1] == '1':
if normalFlag:
front.append(q[2])
else:
back.append(q[2])
else:
if normalFlag:
back.append(q[2])
else:
front.append(q[2])
if normalFlag:
front.reverse()
ans = front+S+back
else:
back.reverse()
S.reverse()
ans = back+S+front
print(''.join(map(str,ans)))
| 1 | 57,409,718,118,500 | null | 204 | 204 |
K = int(input())
if K % 2 == 0:
print(-1)
else:
seen = set()
ans = 1
num = 7
while ans <= K:
mod = num % K
if mod in seen:
ans = -1
break
else:
seen.add(mod)
if mod == 0:
break
else:
num = mod * 10 + 7
ans += 1
print(ans)
|
from bisect import bisect_left
def main():
n, m = map(int, input().split())
a = list(map(int, input().split()))
a.sort()
b = [0]*(n+1)
for i in range(n):
b[i+1] = a[i] + b[i]
ok = 0; ng = 2 * 10**5 + 5
while ok+1 < ng:
mid = (ok + 1 + ng) // 2
buf = 0
for i in range(n):
p = mid - a[i]
buf += n - bisect_left(a, p)
if buf >= m:
ok = mid
else:
ng = mid
ans = 0
num = 0
tot = 0
for i in range(n):
p = ok - a[i]
index = bisect_left(a, p)
num += n - index
tot += b[n] - b[index]
tot += a[i] * (n-index)
ans = tot - (num - m) * ok
print(ans)
if __name__ == "__main__":
main()
| 0 | null | 57,185,574,020,152 | 97 | 252 |
import sys
nums = sorted( [ int( val ) for val in sys.stdin.readline().split( " " ) ] )
print( "{:d} {:d} {:d}".format( nums[0], nums[1], nums[2] ) )
|
a=map(int,raw_input().split(" "))
#a = sorted(a)
#print a[0],a[1],a[2]
print" ".join(map(str,sorted(a)))
| 1 | 418,974,760,772 | null | 40 | 40 |
def main():
n = int(input())
t = (n+1) // 2
if n == 1:
print(1)
elif n % 2 == 0:
print(0.5)
else:
print(t*1.0 / n)
main()
|
N = int(input())
print((N //2 + N % 2) / N)
| 1 | 176,884,810,687,060 | null | 297 | 297 |
n,k=[int(i) for i in input().strip().split(" ")]
arr=[int(i) for i in input().strip().split(" ")]
ans=0
arr=sorted(arr)
for i in range(k):
ans+=arr[i]
print(ans)
|
# -*- coding: utf-8 -*-
# input
a, b = map(int, input().split())
x = list(map(int, input().split()))
x.sort()
o = 0
for i in range(b):
o = o+x[i]
print(o)
| 1 | 11,681,615,432,772 | null | 120 | 120 |
from math import ceil
def main():
N, K = map(int, input().split())
A = list(map(int, input().split()))
def check(Min):
kill = 0
for a in A:
kill += (ceil(a/Min)-1)
return kill <= K
l = 0
r = 1000000000
while r-l > 1:
mid = (l+r)//2
if check(mid):
r = mid
else:
l = mid
print(r)
if __name__ == '__main__':
main()
|
N, K = map(int, input().split())
A = list(map(int, input().split()))
left, right = 0, max(A)
while right - left != 1:
mid = (left + right) // 2
tmp = 0
for i in A:
tmp += i // mid - 1 if i % mid == 0 else i // mid
if tmp > K:
left = mid
else:
right = mid
print(right)
| 1 | 6,460,743,482,010 | null | 99 | 99 |
import math
a,b,c,d=map(float,input().split())
x=math.sqrt((a-c)**2 + (b-d)**2)
print(round(x,8))
#round(f,6)でfを小数点以下6桁にまとめる。
|
L=int(input())
print("{:.6f}".format((L/3)**3))
| 0 | null | 23,587,141,960,590 | 29 | 191 |
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def main():
mod=10**9+7
N,M=MI()
S=list(input())
S2=S[::-1]
now=0
ans=[]
while now!=N:
nxt=now+M
if nxt>N:
nxt=N
while S2[nxt]=="1":
nxt-=1
if now==nxt:
ans=[-1]
break
ans.append(nxt-now)
now=nxt
print(' '.join(map(str, ans[::-1])))
main()
|
h,w = map(int, input().split())
sl = []
for _ in range(h):
row = list(input())
sl.append(row)
dp = [ [10000]*w for _ in range(h) ]
dp[0][0] = 0
for h_i in range(h):
for w_i in range(w):
if h_i+1 < h:
if sl[h_i][w_i] == '.' and sl[h_i+1][w_i] == '#':
dp[h_i+1][w_i] = min( dp[h_i+1][w_i], dp[h_i][w_i]+1 )
else:
dp[h_i+1][w_i] = min( dp[h_i+1][w_i], dp[h_i][w_i] )
if w_i+1 < w:
if sl[h_i][w_i] == '.' and sl[h_i][w_i+1] == '#':
dp[h_i][w_i+1] = min( dp[h_i][w_i+1], dp[h_i][w_i]+1 )
else:
dp[h_i][w_i+1] = min( dp[h_i][w_i+1], dp[h_i][w_i] )
ans = dp[h-1][w-1]
if sl[0][0] == '#': ans += 1
print(ans)
| 0 | null | 94,335,746,619,840 | 274 | 194 |
X,N = map(int,input().split())
P = list(map(int,input().split()))
if X not in P:
print(X)
else:
d = 1
while True:
if X-d not in P:
print(X-d)
break
if X+d not in P:
print(X+d)
break
d += 1
|
X, N = map(int, input().split())
P = list(map(int, input().split()))
occupied = set(P)
for i in range(200):
if X - i not in occupied:
print(X - i)
break
if X + i not in occupied:
print(X + i)
break
| 1 | 14,232,226,593,342 | null | 128 | 128 |
n,m=map(int,input().split())
H=list(map(int,input().split()))
ans = [1]*n
for i in range(m):
a,b=map(int,input().split())
if H[a-1]>H[b-1]:
ans[a-1] *= 1
ans[b-1] *= 0
elif H[a-1]<H[b-1]:
ans[a-1] *= 0
ans[b-1] *= 1
else:
ans[a-1] *= 0
ans[b-1] *= 0
print(sum(ans))
|
n, m = map(int, input().split())
h = [int(x) for x in input().split()]
cnt = [1] * n
for _ in range(m):
a, b = map(int, input().split())
if h[a-1] > h[b-1]:
cnt[b-1] = 0
elif h[a-1] < h[b-1]:
cnt[a-1] = 0
else:
cnt[a-1] = 0
cnt[b-1] = 0
print(cnt.count(1))
| 1 | 25,092,398,976,162 | null | 155 | 155 |
# from collections import Counter
# n = int(input())
# li = list(map(int, input().split()))
# a, b = map(int, input().split())
n = int(input())
print(n//2 if n&1 else n//2-1)
|
N = int(input())
print(N//2 if N%2 else N//2-1)
| 1 | 152,552,544,956,490 | null | 283 | 283 |
N = int(input())
S = [input() for _ in range(N)]
print('AC x ' + str(S.count('AC')))
print('WA x ' + str(S.count('WA')))
print('TLE x ' + str(S.count('TLE')))
print('RE x ' + str(S.count('RE')))
|
count = int(input())
lists = []
for i in range(count):
new = input()
lists.append(new)
ac_count = lists.count('AC')
wa_count = lists.count('WA')
tle_count = lists.count('TLE')
re_count = lists.count('RE')
print("AC x " + str(ac_count))
print("WA x " + str(wa_count))
print("TLE x " + str(tle_count))
print("RE x " + str(re_count))
| 1 | 8,653,770,202,340 | null | 109 | 109 |
from collections import deque
import itertools
def main():
H, W = list(map(int, input().split()))
A = [['#'] * (W + 2)] + [['#', ] + list(input()) + ['#', ] for _ in range(H)] + [['#'] * (W + 2)]
DXY = [[1, 0], [-1, 0], [0, 1], [0, -1]]
ans = 0
INF = 10000
for h in range(1, H + 1):
for w in range(1, W + 1):
if A[h][w] == '#':
continue
count = [[-1 if i == '#' else INF for i in a] for a in A]
count[h][w] = 0
stack = deque([[h, w], ])
visited = [[0] * W for _ in range(H)]
while stack:
x, y = stack.popleft()
if visited[x - 1][y - 1] == 1:
continue
else:
visited[x - 1][y - 1] = 1
for (dx, dy) in DXY:
X = x + dx
Y = y + dy
if A[X][Y] == '.':
if visited[X - 1][Y - 1] == 0:
stack.append([X, Y])
count[X][Y] = min(count[X][Y], count[x][y] + 1)
count = list(itertools.chain.from_iterable(count))
ans = max(ans, max(count))
print(ans)
if __name__ == '__main__':
main()
|
N=int(input())
A=list(map(int,input().split()))
m=int(input())
q=list(map(int,input().split()))
num_list=set()
for i in range(2**N):
ans=0
for j in range(N):
if i>>j&1:
ans+=A[j]
num_list.add(ans)
for i in q:
if i in num_list:
print("yes")
else:print("no")
| 0 | null | 47,068,884,989,700 | 241 | 25 |
import sys
import numpy as np
import math
def Ii():return int(sys.stdin.readline())
def Mi():return map(int,sys.stdin.readline().split())
def Li():return list(map(int,sys.stdin.readline().split()))
n,k = Mi()
a = np.array(sys.stdin.readline().split(), np.int64)
maxa = np.max(a)
mina = maxa//(k+1)
while maxa > mina+1:
mid = (mina+maxa)//2
div = np.sum(np.ceil(a/mid-1))
if div > k:
mina = mid
else:
maxa = mid
print(maxa)
|
num_list = list(map(int, input().split()))
num = num_list[0]
distance = num_list[1]
res = 0
for i in range(num):
nmb_list = list(map(int, input().split()))
if(nmb_list[0]*nmb_list[0]+nmb_list[1]*nmb_list[1] <= distance*distance):
res += 1
print(res)
| 0 | null | 6,136,558,195,170 | 99 | 96 |
k, y = [int(i) for i in input().split()]
print('Yes' if 500 * k >= y else 'No')
|
x=int(input())
a=0
while True:
for b in range(10**3):
if a**5-b**5==x:
print(a,b)
exit()
elif a**5+b**5==x:
print(a,-b)
exit()
elif -a**5+b**5==x:
print(-a,-b)
exit()
a+=1
| 0 | null | 61,929,783,051,302 | 244 | 156 |
A, B = map(int, input().split())
C = A - (B*2)
C = 0 if C < 0 else C
print(C)
|
[A,B] = list(map(int,input().split()))
nokori = A - B*2
if nokori>=0:
print(nokori)
else:
print(0)
| 1 | 167,136,278,711,440 | null | 291 | 291 |
import math
N = int(input())
A = list(map(int,input().split()))
A.sort(reverse=True)
comfortPoint = A[0]
for i in range(N-1)[1::]:
comfortPoint += A[math.ceil(i/2)]
print(comfortPoint)
|
taro, hanako = 0, 0
n = int(input())
for _ in range(n):
a, b = input().split()
if a > b:
taro += 3
elif a < b:
hanako += 3
else:
taro += 1
hanako += 1
print(taro, hanako)
| 0 | null | 5,568,822,910,400 | 111 | 67 |
X, Y, Z = [int(x) for x in input().split()]
print('{} {} {}'.format(Z, X, Y))
|
N=int(input())
S=[input() for i in range(N)]
L=dict()
for i in range(N):
if S[i] in L:
L[S[i]]+=1
else:
L[S[i]]=1
M=max(L.values())
ans=list()
for X in L:
if L[X]==M:
ans.append(X)
ans.sort()
for X in ans:
print(X)
| 0 | null | 53,909,281,298,620 | 178 | 218 |
from collections import deque
S = deque(list(input()))
Q = int(input())
q = [list(input().split()) for _ in range(Q)]
r = 0
for i in range(Q):
if q[i][0] == "1":
r += 1
else:
if (q[i][1] == "1" and r%2==0)or (q[i][1] == "2" and r%2==1 ):
S.appendleft(q[i][2])
else:
S.append(q[i][2])
S = "".join(S)
if r%2==1:
S = S[::-1]
print(S)
|
n, k = map(int,input().split())
H = sorted(list(map(int, input().split())), reverse=True)
cnt = 0
for i in range(n):
if H[i] >= k:
cnt += 1
elif H[i] < k:
break
print(cnt)
| 0 | null | 117,906,194,011,012 | 204 | 298 |
n = int(input())
kuku = []
for i in range(1, 10):
for j in range(1, 10):
kuku.append(i * j)
if n in kuku:
print("Yes")
else:
print("No")
|
from itertools import product
H, W, K = map(int, input().split())
grid = ""
for _ in range(H):
grid += input()
ans = 10000
for Hcut in product((0, 1), repeat = H-1):
Gr_num = sum(Hcut) + 1
old = [0]*Gr_num
cnt = 0
for i in range(W):
#縦一列のchocoを見る
choco = grid[i::W]
new = [0]*Gr_num
gr = 0
for j in range(H):
new[gr] += int(choco[j])
if j < H-1:
if Hcut[j] == 1:
gr += 1
#そもそも一列でオーバーしてたら詰み。
if max(new) > K:
cnt += 10000
break
#新しい一列を追加しても大丈夫か確認
check = [old[gr] + new[gr] for gr in range(Gr_num)]
if max(check) > K:
old = new[:]
cnt += 1
else:
old = check[:]
ans = min(ans, cnt+sum(Hcut))
print(ans)
| 0 | null | 104,471,079,973,038 | 287 | 193 |
n = int(input())
def solve1(n: int) -> str:
k = 0
for i in range(len(n)):
k += int(n[i])
if k % 9 == 0:
return "Yes"
else:
return "No"
def solve2(n: int) -> str:
if n % 9 == 0:
return "Yes"
else:
return "No"
print(solve2(n))
|
import sys
read = sys.stdin.read
#readlines = sys.stdin.readlines
from math import ceil
def main():
n = tuple(map(int, tuple(input())))
if sum(n) % 9 == 0:
print('Yes')
else:
print('No')
if __name__ == '__main__':
main()
| 1 | 4,381,938,716,320 | null | 87 | 87 |
N=int(input())
d={"AC":0,"WA":0,"TLE":0,"RE":0}
for _ in range(N):
d[input()]+=1
print("AC x",d["AC"])
print("WA x",d["WA"])
print("TLE x",d["TLE"])
print("RE x",d["RE"])
|
x,y,z,k=map(int,input().split())
s=min(k,x)
k=k-s
if(k>0):
k=k-min(k,y)
if(k>0):
f=min(k,z)
s=s-f
print(s)
| 0 | null | 15,349,474,143,300 | 109 | 148 |
N,M,K=map(int,input().split())
MOD=998244353
def inv(a):
return pow(a,MOD-2,MOD)
fact=[0,1]
for i in range(2,N+1):
fact.append((fact[-1]*i)%MOD)
def choose(n,r):
if r==0 or r==n:
return 1
else:
return fact[n]*inv(fact[r])*inv(fact[n-r])%MOD
exp=[1]
def pow_k(x,n):
if n==0:
return 1
K=1
while n>1:
if n%2!=0:
K=K*x%MOD
x=x**2%MOD
n=(n-1)//2
else:
x=x**2%MOD
n=n//2
return K*x%MOD
ans=0
for i in range(K+1):
ans+=(M*choose(N-1,i)*pow_k(M-1,N-1-i)%MOD)
ans%=MOD
print(ans)
|
import math
x = int(input())
z = (x * 360) // math.gcd(x, 360)
print(z//x)
| 0 | null | 18,003,285,939,392 | 151 | 125 |
str=input()
maxcnt=0
cnt=0
for i in range(len(str)):
if(str[i]=="R"):
cnt+=1
maxcnt=max(cnt,maxcnt)
else:
cnt=0
print(maxcnt)
|
def main():
MOD = 998244353
n, m, k = map(int, input().split())
fact = [0] * 220000
invfact = [0] * 220000
fact[0] = 1
for i in range(1, 220000):
fact[i] = fact[i-1] * i % MOD
invfact[220000 - 1] = pow(fact[220000 - 1], MOD-2, MOD)
for i in range(220000-2, -1, -1):
invfact[i] = invfact[i+1] * (i+1) % MOD
def nCk(n, k):
if k < 0 or n < k: return 0
return fact[n] * invfact[k] * invfact[n - k] % MOD
ans = 0
for i in range(0, k+1):
ans += m * pow(m-1, n-i-1, MOD) * nCk(n-1, i) % MOD
print(ans%MOD)
if __name__ == '__main__':
main()
| 0 | null | 14,113,755,604,572 | 90 | 151 |
#-*-coding:utf-8-*-
import sys
input=sys.stdin.readline
def main():
numbers=[]
a,b = map(int,input().split())
tmp1=int(a/0.08)
tmp2=int(b/0.10)
ans=[]
for i in range(min(tmp1,tmp2),max(tmp1,tmp2)+2):
if int(i*0.08) == a and int(i*0.10) == b:
ans.append(i)
if len(ans)>0:
print(min(ans))
else:
print("-1")
if __name__=="__main__":
main()
|
A, B = map(int, input().split())
Xbmin = 10 * B
Xbmax = 10 * B + 10
ans = -1
for x in range(Xbmin, Xbmax):
if 100 * A <= x * 8 and x * 8 < 100 * (A + 1):
ans = x
break
print(ans)
| 1 | 56,500,632,902,448 | null | 203 | 203 |
def solve():
can_positive = False
if len(P) > 0:
if k < n: can_positive = True
else: can_positive = len(M)%2 == 0
else: can_positive = k%2 == 0
if not can_positive: return sorted(P+M, key=lambda x:abs(x))[:k]
P.sort()
M.sort(reverse=True)
a = [P.pop()] if k%2 else [1]
while len(P) >= 2: a.append(P.pop() * P.pop())
while len(M) >= 2: a.append(M.pop() * M.pop())
return a[:1] + sorted(a[1:], reverse=True)[:(k-k%2)//2]
n, k = map(int, input().split())
P, M = [], []
for a in map(int, input().split()):
if a < 0: M.append(a)
else: P.append(a)
ans, MOD = 1, 10**9 + 7
for a in solve(): ans *= a; ans %= MOD
ans += MOD; ans %= MOD
print(ans)
|
a,b,c = map(int, input().split())
if a==b==c:
print('No')
elif a==b or b==c or c==a:
print('Yes')
else:
print('No')
| 0 | null | 38,910,045,039,710 | 112 | 216 |
N, X, Y = map(int, input().split())
def f(i, j):
v1 = j - i
v2 = abs(X - i) + 1 + abs(j - Y)
v3 = abs(Y - i) + 1 + abs(j - X)
return min(v1, v2, v3)
D = [0] * N
for i in range(1, N):
for j in range(i + 1, N + 1):
d = f(i, j)
D[d] += 1
for d in D[1:]:
print(d)
|
n, x, y = map(int,input().split())
cnt = [0] * (n - 1)
for i in range(1, n):
for j in range(i + 1, n + 1):
temp1 = j - i
temp2 = abs(i - x) + abs(j - y) + 1
dis = min(temp1, temp2)
cnt[dis - 1] += 1
print(*cnt, sep='\n')
| 1 | 44,042,923,769,360 | null | 187 | 187 |
def main():
s = input()
if s[2]==s[3] and s[4]==s[5]:
print("Yes")
else:
print("No")
if __name__ == "__main__":
main()
|
n=list(input())
#print(n)
if n[2]==n[3] and n[4]==n[5]:
#if n[2]!=n[4]:
print('Yes')
else:
print('No')
| 1 | 42,033,169,086,790 | null | 184 | 184 |
ans = []
add = ans.append
for line in open(0).readlines():
H, W = map(int, line.split())
if not H:
break
r = "#"*W+"\n"
add(r)
add(("#"+"."*(W-2)+"#\n")*(H-2))
add(r)
add("\n")
open(1, 'w').writelines(ans)
|
N,M=map(int,input().split())
S,r,s=input(),[],N
for _ in range(2*N):
if S[s]=='1':
s+=1
else:
if N-s:
r.append(N-s)
N,s=s,max(0,s-M)
print(*[-1] if s else r[::-1])
| 0 | null | 69,977,385,544,572 | 50 | 274 |
n, m = map(int, input().split())
a = list(map(int, input().split()))
a.sort(reverse=True)
if len(list(filter(lambda v: v * 4 * m >= sum(a), a[:m]))) == m:
print("Yes")
else:
print("No")
|
n,m=map(int,input().split())
a=list(map(int,input().split()))
cnt=0
a.sort(reverse=True)
ALL=0
for i in a:
ALL+=i
for i in range(m):
if a[i]>=ALL/(4*m):
cnt+=1
if cnt==m:
print("Yes")
else:
print("No")
break
| 1 | 38,465,370,020,980 | null | 179 | 179 |
a,b,n = map(int,input().split())
i = min(b-1,n)
calc = (a*i)//b - (a * (i//b))
print(calc)
|
N = int(input())
if (N % 10 == 0) or (N % 10 == 1) or (N % 10 == 6) or (N % 10 == 8):
print("pon")
elif N % 10 == 3:
print("bon")
else:
print("hon")
| 0 | null | 23,729,372,545,020 | 161 | 142 |
H,N = map(int,input().split())
AB = [list(map(int,input().split())) for _ in range(N)]
dp = [[10000000000000]*(H+1) for _ in range(N+1)]
for y in range(N):
a,b = AB[y]
for x in range(H+1):
if x <= a:
dp[y+1][x] = min(dp[y][x], b)
else:
dp[y+1][x] = min(dp[y][x], dp[y+1][x-a]+b)
print(dp[-1][-1])
|
import numpy as np
H,N= map(int, input().split())
m = np.array([list(map(int, input().split())) for _ in range(N)])
max_a = np.max(m[:,0])
dp = np.zeros(H+max_a+1, dtype='i8')
for i in range(max_a+1, H+max_a+1):
dp[i] = np.min(dp[i-m[:,0]] + m[:,1])
print(dp[H+max_a])
| 1 | 81,071,327,789,466 | null | 229 | 229 |
def merge(arr, left: int, mid: int, right: int) -> int:
n1 = mid - left
n2 = right - mid
L = [arr[left + i] for i in range(n1)]
R = [arr[mid + i] for i in range(n2)]
L.append(10 ** 9)
R.append(10 ** 9)
i = 0
j = 0
cnt = 0
for k in range(left, right):
cnt += 1
if L[i] <= R[j]:
arr[k] = L[i]
i += 1
else:
arr[k] = R[j]
j += 1
return cnt
def merge_sort(arr, left: int, right: int) -> int:
cnt = 0
if left + 1 < right:
mid = (left + right) // 2
cnt += merge_sort(arr, left, mid)
cnt += merge_sort(arr, mid, right)
cnt += merge(arr, left, mid, right)
return cnt
n = int(input())
S = list(map(int, input().split()))
cnt = merge_sort(S, 0, n)
print(*S)
print(cnt)
|
import sys
n = int(input())
sort_list = list(map(int,input().split()))
cnt = []
def merge(A, left,mid,right):
n1 = mid -left
n2 = right - mid
L = [i for i in A[left : left + n1]]
R = [i for i in A[mid : mid + n2]]
L.append(sys.maxsize)
R.append(sys.maxsize)
i = 0
j = 0
c = 0
for k in range(left,right):
if L[i] <= R[j]:
A[k] = L[i]
i = i + 1
else:
A[k] = R[j]
j = j + 1
c += 1
cnt.append(c)
def mergesort(A,left,right):
if left + 1 < right:
mid = (left + right) // 2
mergesort(A,left,mid)
mergesort(A,mid,right)
merge(A,left,mid,right)
mergesort(sort_list, 0, len(sort_list))
print(' '.join([str(i) for i in sort_list]))
print(sum(cnt))
| 1 | 113,498,151,008 | null | 26 | 26 |
#!/usr/bin/env python
# -*- coding: utf-8 -*-
s = input()
print("ARC") if s == "ABC" else print("ABC")
|
S = input()
if S == 'ABC':
print('ARC')
else:print('ABC')
| 1 | 24,185,305,162,788 | null | 153 | 153 |
def resolve():
t = input()
print(t.replace('?','D'))
if __name__ == "__main__":
resolve()
|
N = int(input())
A = sorted(list(map(int, input().split())), reverse=True)
ans = 0
cnt = 1
# 最大値は一回だけ
ans += A[0]
# N-2個は、2,2,3,3,..i,i,...のように取る
flag = False
for i in range(1, len(A)-1):
ans += A[cnt]
if flag == False:
flag = True
else:
flag = False
cnt += 1
print(ans)
| 0 | null | 13,704,394,434,980 | 140 | 111 |
n=int(input())
t=0
flag=False
for i in range(1,10):
for j in range(1,10):
if n==i*j:
print('Yes')
t+=1
flag=True
break
if flag:
break
if t==0:
print('No')
|
k,n = map(int,input().split())
A = list(map(int,input().split()))
B=[]
t=0
for a in A:
B.append(a-t)
t=a
B[0] +=k-t
print(k-max(B) )
| 0 | null | 101,365,773,857,696 | 287 | 186 |
import sys
input = sys.stdin.readline
# from collections import deque
def linput(_t=int):
return list(map(_t, input().split()))
def gcd(n,m):
while m: n,m = m, n%m
return n
def lcm(n,m): return n*m//gcd(n,m)
def main():
# N = int(input())
# vA = [int(input()) for _ in [0,]*N]
h,m,H,M,K = linput()
res = 60*H + M - 60*h - m - K
print(res)
# print(("No","Yes")[res%2])
# print(*vR, sep="\n")
main()
|
a, b, c, d, e = map(int, input().split())
f = (c - a) * 60
f += (d - b)
print(f - e)
| 1 | 18,101,857,949,840 | null | 139 | 139 |
a, b = map(int, input().split())
print(str(a * b) + " " + str(2 * a + 2 * b))
|
x=input()
y=str
if x=="ABC":
y="ARC"
else: y="ABC"
print(y)
| 0 | null | 12,302,471,153,608 | 36 | 153 |
count = [0 for i in range(26)]
while True:
try:
s = input()
except:
break
for i in range(len(s)):
m = ord(s[i]) - ord("a")
if(m >= 0 and m <= 26):
count[m] += 1
m = ord(s[i]) - ord("A")
if(m >= 0 and m <= 26):
count[m] += 1
for i in range(26):
print(chr(i + ord("a")), ":", count[i])
|
text = ''
while True:
try:
s = input().lower()
except EOFError:
break
if s == '':
break
text += s
for i in 'abcdefghijklmnopqrstuvwxyz':
print(i+' : '+str(text.count(i)))
#print("{0} : {1}".format(i, text.count(i)))
| 1 | 1,691,587,151,338 | null | 63 | 63 |
d = int(input())
C = list(map(int,input().split()))
S = [list(map(int,input().split())) for i in range(d)]
ans = [0]*d
last = [0]*26
def score(day, last, today, C, S):
res = 0
res += S[day][today]
last[today] = day+1
for i in range(26):
res -= C[i]*(day+1 - last[i])
return res
for i in range(d):
t = int(input())
if i > 0:ans[i] += ans[i-1]
ans[i] += score(i,last,t-1,C,S)
print("\n".join(str(i) for i in ans))
|
from sys import stdin
# stdin = open("sample.txt")
a = int(stdin.readline().rstrip())
b = [1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51]
print(b[a-1])
| 0 | null | 30,124,389,741,292 | 114 | 195 |
n, m = map(int, input().split())
a = list(map(int, input().split()))
a_sort = sorted(a, reverse=True)
a_sum = sum(a)
if a_sort[m - 1] < a_sum / (4 * m):
print('No')
else:
print('Yes')
|
k=int(input())
count=1
num=7
for _ in range(k):
if num%k == 0:
print(count)
break
else:
count += 1
num = (num % k)*10 + 7
else:
print(-1)
| 0 | null | 22,531,831,157,352 | 179 | 97 |
N=int(input())
Ai=list(map(int,input().split()))
# ans=[]
ans=[0]*N
# for i in range(1,N+1):
# a=Ai.index(i)+1
# ans.append(str(a))
for i in range (N):
ans[Ai[i]-1]=str(i+1)
print(' '.join(ans))
|
n=int(input())
a=list(map(int,input().split()))
import numpy as np
x = np.argsort(a)
for i in range(n):
print(x[i]+1)
| 1 | 180,772,471,511,872 | null | 299 | 299 |
deck = {"S":[0]*13, "H":[0]*13, "C":[0]*13, "D":[0]*13}
n = input()
for i in range(0, n):
suit, num = raw_input().split(" ")
deck[suit][int(num)-1] = 1
for i in ["S", "H", "C", "D"]:
for j in range(0, 13):
if (deck[i][j] == 0):
print("%s %d" % (i, j+1))
|
m={"S":[], "D":[], "H":[], "C":[]}
for i in range(int(input())):
mark, num=input().split()
m[mark].append(int(num))
for j in ["S", "H", "C", "D"]:
nai=set(range(1,14))-set(m[j])
for k in nai:
print(j, k)
| 1 | 1,032,410,879,476 | null | 54 | 54 |
N, S = map(int, input().split())
A = list(map(int, input().split()))
MOD = 998244353
def solution(A, S):
N = len(A)
dp = [[0]*(S+1) for _ in range(N+1)]
dp[0][0] = 1
for i in range(1, N+1):
for j in range(S+1):
dp[i][j] += 2*dp[i-1][j]
dp[i][j] %= MOD
if j >= A[i-1]:
dp[i][j] += dp[i-1][j-A[i-1]]
dp[i][j] %= MOD
return dp[N][S]
print(solution(A, S))
|
j=0
N,D=map(int,input().split())
for i in range(N):
X,Y=map(int,input().split())
if (X**2+Y**2)**0.5<=D:
j=j+1
print(j)
| 0 | null | 11,839,852,027,442 | 138 | 96 |
alp=input()
if alp==alp.upper():
print("A")
elif alp==alp.lower():
print("a")
|
def dfs(seq):
ans = 0
if len(seq) == n:
score = 0
for a, b, c, d in req:
if seq[b-1] - seq[a-1] == c:
score += d
return score
else:
for i in range(seq[-1], m+1):
next_seq = seq + (i,)
score = dfs(next_seq)
ans = max(ans, score)
return ans
n, m, q = list(map(int, input().split()))
req = [list(map(int, input().split())) for _ in range(q)]
print(dfs((1,)))
| 0 | null | 19,523,694,208,282 | 119 | 160 |
def main():
H,W,K = list(map(int, input().split()))
S = ['' for i in range(H)]
for i in range(H):
S[i] = input()
ans = H*W
for i in range(0,1<<(H-1)):
g = 0
id = [0 for j in range(H)]
for j in range(0,H):
id[j] = g
if i>>j&1 == 1:
g += 1
g_cnt = [0 for j in range(g+1)]
c_ans = g
j = 0
div_w = 0
while j < W:
for k in range(0, H):
if S[k][j] == '1':
g_cnt[id[k]] += 1
for k in range(0,g+1):
if g_cnt[k] > K:
c_ans += 1
g_cnt = [0 for j in range(g+1)]
if div_w == j:
c_ans += H*W
break
j -= 1
div_w = j
break
j += 1
if c_ans > ans:
break
ans = min(ans, c_ans)
print(ans)
main()
|
h,w,k=map(int,input().split())
S=[input() for i in range(h)]
LIS=[]
def saiki(x,st):
if x==h-1:
LIS.append(st)
return
else:
saiki(x+1,st+st[-1])
saiki(x+1,st+str(int(st[-1])+1))
saiki(0,"0")
DIC1={c:0 for c in "0123456789"}
DIC2={c:0 for c in "0123456789"}
ans=10**9
for cod in LIS:
for ele in DIC1:
DIC1[ele]=0
cnt=int(cod[-1])
end=False
for i in range(w):
for ele in DIC2:
DIC2[ele]=0
for q in range(h):
if S[q][i]=="1":
DIC2[cod[q]]+=1
if max(DIC2.values())>k:
end=True
break
flg=True
for ele in DIC1:
if DIC1[ele]+DIC2[ele]>k:
flg=False
break
if flg:
for ele in DIC1:
DIC1[ele]+=DIC2[ele]
else:
for ele in DIC1:
DIC1[ele]=DIC2[ele]
cnt+=1
if end:
continue
ans=min(ans,cnt)
#print(cod,cnt)
print(ans)
| 1 | 48,576,449,450,560 | null | 193 | 193 |
N = int(input())
A = list(map(int, input().split()))
money = 1000
stock = 0
for day in range(N-1):
today_price = A[day]
tommorow_price = A[day+1]
if today_price < tommorow_price:
div,mod = divmod(money, today_price)
stock += div
money = mod
elif today_price > tommorow_price:
money += today_price * stock
stock = 0
money += A[N-1] * stock
print(money)
|
N = int(input())
A = list(map(int, input().split()))
iStock = 0
iMoney = 1000
for i in range(N-1):
if A[i] < A[i + 1]:
# A[i]Day 株購入 & A[i+1]Day 株売却
iStock = iMoney // A[i]
iMoney %= A[i]
iMoney += iStock * A[i+1]
print(iMoney)
| 1 | 7,356,669,869,712 | null | 103 | 103 |
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():
a=INT()
print(a+a**2+a**3)
if __name__ == '__main__':
do()
|
def resolve():
a = int(input())
print(a + a ** 2 + a ** 3)
resolve()
| 1 | 10,276,709,334,720 | null | 115 | 115 |
def comb(n):
if n <= 1:
return 0
return n * (n - 1) // 2
def check(L):
r = {}
a = 0
c = 0
for i in range(len(L)):
if a != L[i]:
if i != 0:
r[a] = [comb(c), comb(c - 1)]
a = L[i]
c = 1
else:
c += 1
r[a] = [comb(c), comb(c - 1)]
#print(r)
return r
N = int(input())
A = [int(n) for n in input().split(" ")]
D = {}
for i in range(len(A)):
D[i] = A[i]
D = sorted(D.items(), key=lambda x: x[1])
V = {}
for i in range(len(D)):
V[D[i][0]] = i
AA = sorted(A)
rr = check(AA)
ss = 0
for k, v in rr.items():
ss += v[0]
#print(ss)
for k in range(N):
index = A[k]
a = rr[index][0] - rr[index][1]
print(ss - a)
|
n,m,k = map(int,input().split())
def cmb(n, r, mod):#コンビネーションの高速計算
if ( r<0 or r>n ):
return 0
r = min(r, n-r)
return g1[n] * g2[r] * g2[n-r] % mod
mod = 998244353 #出力の制限
N = n #Nの最大値
g1 = [0]*(N+1) #元テーブル(p(n,r))
g1[0] = g1[1] = 1
g2 = [0]*(N+1) #逆元テーブル
g2[0] = g2[1] = 1
inverse = [0]*(N+1) #逆元テーブル計算用テーブル
inverse[0],inverse[1] = 0,1
for i in range(2,N+1):
g1[i] = (g1[i-1] * i) % mod
inverse[i] = (-inverse[mod % i] * (mod//i)) % mod
g2[i] = (g2[i-1] * inverse[i]) % mod
# i組 -> m * (n-1)Ci * (m-1)^(n-1-i)
ans = 0
for i in range(k+1):
ans += m * cmb(n-1,i,mod) * pow(m-1,n-1-i,mod)
ans %= mod
print(ans)
| 0 | null | 35,542,460,657,348 | 192 | 151 |
class Combination:
def __init__(self, max_n, _mod):
self.mod = _mod
self.fac = [0 for _ in range(max_n + 10)]
self.finv = [0 for _ in range(max_n + 10)]
self.inv = [0 for _ in range(max_n + 10)]
self.fac[0], self.fac[1] = 1, 1
self.finv[0], self.finv[1] = 1, 1
self.inv[1] = 1
for i in range(2, max_n + 10):
self.fac[i] = self.fac[i - 1] * i % self.mod
self.inv[i] = self.mod
self.inv[i] -= self.inv[self.mod % i] * (self.mod // i) % self.mod
self.finv[i] = self.finv[i - 1] * self.inv[i] % self.mod
def mod_comb(self, n, k):
if n < k or n < 0 or k < 0:
return 0
res = self.fac[n] * (self.finv[k] * self.finv[n - k] % self.mod)
res %= self.mod
return res
def main():
mod = 998244353
N, M, K = map(int, input().split())
comb = Combination(N, mod)
ans = 0
for i in range(K + 1):
add_v = M * pow(M - 1, N - i - 1, mod) % mod
add_v = (add_v * comb.mod_comb(N - 1, i)) % mod
ans = (ans + add_v) % mod
print(ans)
main()
|
N=int(input())
A = list(map(int, input().split()))
ans = 0
for i in range(0, N, 2):
ans += A[i] % 2 != 0
print(ans)
| 0 | null | 15,625,209,155,930 | 151 | 105 |
N = int(input())
A = [int(x) for x in input().split()]
cnt = dict()
for i in range(N):
cnt[A[i]] = cnt.get(A[i], 0) + 1
if max(cnt.values()) > 1:
print('NO')
else:
print('YES')
|
from collections import Counter
N,*A = map(int, open(0).read().split())
ac = Counter(A)
if len(ac) == N:
print('YES')
else:
print('NO')
| 1 | 73,892,066,046,708 | null | 222 | 222 |
#AIsing2020 d
def f(n):
cnt = 0
while n:
cnt+= 1
n = n%bin(n).count('1')
return cnt
def main():
N = int(input())
X = input()
X10 = int(X,2)
X10_num1 = X.count('1')
X10_pulse = X10%(X10_num1+1)
X10_ninus = X10%(X10_num1-1) if X10_num1 >1 else 0
for i in range(N,0,-1):
if (X10>>(i-1) & 1) and X10_num1 >1:
mod = X10_num1-1
amari = (X10_ninus - pow(2,i-1,mod))%(mod)
elif (X10>>(i-1) & 1) and X10_num1 ==1:
print(0)
continue
else:
mod = X10_num1+1
amari = (X10_pulse + pow(2,i-1,mod))%(mod)
print(1+f(amari))
main()
|
N, K = map(int, input().split())
A = [int(i) for i in input().split()]
mod = 10**9 + 7
list_size = 10**5 + 1
f_list = [1] * list_size
f_r_list = [1] * list_size
for i in range(list_size-1):
f_list[i+1] = (f_list[i] * (i+1)) % mod
f_r_list[-1] = pow(f_list[-1], mod - 2, mod)
for i in range(list_size-2, -1, -1):
f_r_list[i] = (f_r_list[i+1] * (i+1)) % mod
def comb(n, r, mod):
if n < r or r < 0:
return 0
elif n == 0 or r == 0 or n == r:
return 1
else:
return (f_list[n] * f_r_list[n-r] * f_r_list[r]) % mod
A.sort()
ans = 0
for i, a in enumerate(A, start=1):
if i <= N-K+1:
ans -= (a * comb(N-i, K-1, mod))%mod
ans %= mod
A.sort(reverse=True)
for i, a in enumerate(A, start=1):
if i <= N-K+1:
ans += (a * comb(N-i, K-1, mod))%mod
ans %= mod
print(ans)
| 0 | null | 52,095,148,601,510 | 107 | 242 |
from itertools import permutations as per
n=int(input())
ans=[]
l=list(per(list(range(1,n+1))))
xy=[[] for i in range(n+1)]
for i in range(n):
x,y=map(int,input().split())
xy[i+1].append(x)
xy[i+1].append(y)
def f(x):
m=1
while x>0:
m*=x
x=x-1
return m
for i in range(f(n)):
dis=0
for j in range(n-1):
dis+=((xy[l[i][j]][0]-xy[l[i][j+1]][0])**2+(xy[l[i][j]][1]-xy[l[i][j+1]][1])**2)**(0.5)
ans.append(dis)
print(sum(ans)/f(n))
|
import math
N = int(input())
Prime = []
ans = 0
def func(n):
while n % 2 == 0:
n = n // 2
Prime.append(2)
for i in range(3, int(math.sqrt(n)) + 1, 2):
while n % i == 0:
n = n //i
Prime.append(i)
if n > 2:
Prime.append(n)
func(N)
for i in set(Prime):
c = i
while N % c == 0:
N = N // c
ans += 1
c = c * i
print(ans)
| 0 | null | 82,951,762,586,420 | 280 | 136 |
n = int(input())
s = input()
cnt = 0
for i in range(n-1):
if s[i] == s[i+1]:
cnt += 1
print(n-cnt)
|
n, d, a = map(int, input().split())
xh = []
for _ in range(n):
x, h = map(int, input().split())
xh.append((x, h))
xh.sort(key=lambda x:x[0])
def bisect(x):
ok = n
ng = -1
while abs(ok-ng)>1:
mid = (ok+ng)//2
if xh[mid][0]>x:
ok = mid
else:
ng = mid
return ok
out = [0]*(n+1)
ans = 0
accu = 0
for ind, (x, h) in enumerate(xh):
accu -= out[ind]
h -= accu
if h<=0:
continue
ans += (h+a-1)//a
accu += ((h+a-1)//a)*a
out[bisect(x+2*d)] += ((h+a-1)//a)*a
print(ans)
| 0 | null | 125,869,252,888,938 | 293 | 230 |
from sys import stdin
input = stdin.buffer.readline
a, b, c = map(int, input().split())
k = int(input())
cnt = 0
while b <= a:
cnt += 1
b *= 2
while c <= b:
cnt += 1
c *= 2
if cnt <= k:
print('Yes')
else:
print('No')
|
A,B,C=map(int,input().split())
K=int(input())
count=0
if B<=A:
while B<=A:
B*=2
count+=1
if count>K:
print('No')
else:
C*=2**(K-count)
if C>B:
print('Yes')
else:
print('No')
| 1 | 6,903,371,139,600 | null | 101 | 101 |
l=int(input())
print(str(l*l*l/27)+"\n")
|
n,m=map(int,input().split())
AClst=[0]*n
WAlst=[0]*n
AC=0
WA=0
for i in range(m):
res = input().rstrip().split(' ')
no=int(res[0])
ans=str(res[1])
if AClst[no-1]==0 and ans=="WA":
WAlst[no-1]+=1
elif AClst[no-1]==0 and ans=="AC":
AClst[no-1]=1
for j in range(n):
if AClst[j]==0 and WAlst[j]>0:
WAlst[j]=0
AC+=AClst[j]
WA+=WAlst[j]
print(AC, WA)
| 0 | null | 70,452,747,033,444 | 191 | 240 |
class My_Queue:
def __init__(self, S):
self.S = S
self.q = [0 for i in range(S)]
self.head = 0
self.tail = 0
def enqueue(self, x):
if self.isFull():
print('overflow')
raise
else:
self.q[self.tail] = x
if self.tail + 1 == self.S:
self.tail = 0
else:
self.tail += 1
def dequeue(self):
if self.isEmpty():
print('underflow')
raise
else:
x = self.q[self.head]
self.q[self.head] = 0
if self.head + 1 == self.S:
self.head = 0
else:
self.head += 1
return x
def isEmpty(self):
return self.head == self.tail
def isFull(self):
return self.head == (self.tail + 1) % self.S
def main():
n, qms = map(int, input().split())
elapsed_time = 0
q = My_Queue(n + 1)
for i in range(n):
name, time = input().split()
time = int(time)
q.enqueue([name, time])
while(q.head != q.tail):
a = q.dequeue()
if a[1] <= qms:
elapsed_time += a[1]
print(a[0], elapsed_time)
else:
a[1] -= qms
elapsed_time += qms
q.enqueue(a)
if __name__ == "__main__":
main()
|
from itertools import accumulate
mod = 10**9 + 7
n, k = map(int, input().split())
arr = []
for i in range(n+1):
arr.append(i)
ls = [0] + list(accumulate(arr))
ans = 0
for i in range(k, n+2):
ans += (((ls[-1] - ls[-1-i]) - ls[i]) + 1)%mod
ans %= mod
print(ans)
| 0 | null | 16,482,957,807,250 | 19 | 170 |
N, K = map(int, input().split(' '))
H_ls = list(map(int, input().split(' ')))
H_ls.sort(reverse=True)
print(sum(H_ls[K:]))
|
import bisect
import statistics
n = int(input())
a = list((int(x) for x in input().split()))
a.sort()
incl = []
score = 0
for i in range(len(a)):
ain = a.pop()
incl.append(ain)
if i==0: continue
if (len(incl)%2 == 1):
score += incl[ int(len(incl)/2) ]
else:
# smaller of middle two
score += incl[ int(len(incl)/2)-1 ]
print(score)
| 0 | null | 43,843,626,249,590 | 227 | 111 |
s = input()
t = input()
print(sum([1 for a,b in zip(list(s), list(t)) if a != b]))
|
s = list(input())
t = list(input())
if s == t:
print(0)
else:
changes = 0
for i in range(0, len(s)):
if s[i] != t[i]:
changes += 1
print(changes)
| 1 | 10,478,934,326,040 | null | 116 | 116 |
#!/usr/bin/env python3
import sys
import math
from collections import defaultdict
def main():
mod = 1000000007 # 10^9+7
sys.setrecursionlimit(10**6) # 1000 -> 1000000
def input(): return sys.stdin.readline().rstrip()
def ii(): return int(input())
def lmi(): return list(map(int, input().split()))
class Eratos:
def __init__(self, num):
self.table_max = num
# self.table[i] は i が素数かどうかを示す (bool)
self.table = [False if i == 0 or i == 1 else True for i in range(num+1)]
for i in range(2, int(math.sqrt(num)) + 1):
if self.table[i]:
for j in range(i ** 2, num + 1, i): # i**2 からスタートすることで定数倍高速化できる
self.table[j] = False
# self.table_max 以下の素数を列挙したリスト
self.prime_numbers = [2] if self.table_max >= 2 else []
for i in range(3, self.table_max + 1, 2):
if self.table[i]:
self.prime_numbers.append(i)
def is_prime(self, num):
if num > self.table_max:
raise ValueError('Eratos.is_prime(): exceed table_max({}). got {}'.format(self.table_max, num))
return self.table[num]
def prime_factorize(self, num):
if num > self.table_max:
raise ValueError('Eratos.prime_factorize(): exceed table_max({}). got {}'.format(self.table_max, num))
factorized_dict = defaultdict(int) # 素因数分解の結果を記録する辞書
candidate_prime_numbers = [i for i in range(2, int(math.sqrt(num)) + 1) if self.is_prime(i)]
# n について、√n 以下の素数で割り続けると最後には 1 or 素数となる
# 背理法を考えれば自明 (残された数が √n より上の素数の積であると仮定。これは自明に n を超えるため矛盾)
for p in candidate_prime_numbers:
# これ以上調査は無意味
if num == 1:
break
while num % p == 0:
num //= p
factorized_dict[p] += 1
if num != 1:
factorized_dict[num] = 1
return factorized_dict
# import time
# s = time.time()
n = ii()
L = lmi()
a_max = max(L)
# O(AlglgA) で前処理
eratos = Eratos(a_max)
# print('preprocessed (Eratostenes)')
# print(time.time() - s)
# O(n) * O(√A) で LCM を素因数分解した形で保存する
lcm_dict = eratos.prime_factorize(L[0])
for i in range(1, n):
d = eratos.prime_factorize(L[i])
for k, v in d.items():
lcm_dict[k] = max(lcm_dict[k], v)
# print('prime factorized')
# print(time.time() - s)
# O(√A)
lcm_mod = 1
for k, v in lcm_dict.items():
lcm_mod = (lcm_mod * pow(k, v, mod)) % mod
# O(n)
ans = 0
for a in L:
# a^p-2 ≡ 1/a
inverse_element = pow(a, mod-2, mod)
ans = (ans + lcm_mod * inverse_element) % mod
print(ans)
# print(time.time() - s)
if __name__ == "__main__":
main()
|
def factorization(n):
arr = []
temp = n
for i in range(2, int(-(-n**0.5//1))+1):
if temp%i==0:
cnt=0
while temp%i==0:
cnt+=1
temp //= i
arr.append([i, cnt])
if temp!=1:
arr.append([temp, 1])
if arr==[]:
arr.append([n, 1])
return arr
def main():
n=int(input())
a=list(map(int,input().split()))
mod=pow(10,9)+7
lcma={}
for ai in a:
f=factorization(ai)
for fi in f:
if fi[0] in lcma:
lcma[fi[0]]=max(lcma[fi[0]],fi[1])
else:
lcma[fi[0]]=fi[1]
l=1
for k,v in lcma.items():
l*=pow(k,v,mod)
l%=mod
ans=0
for ai in a:
ans+=l*pow(ai,mod-2,mod)
ans%=mod
print(ans)
main()
| 1 | 87,470,263,910,090 | null | 235 | 235 |
import sys
S=list(input())
reverse_S = S[::-1]
if S==reverse_S:
for i in range(int(len(S)/2)):
if S[i]==S[int(len(S)/2)-i-1] and S[int(len(S)/2)+1+i]==S[len(S)-1-i]:
continue
else:
print("No")
sys.exit()
print("Yes")
else:
print("No")
|
from sys import stdin
n,m = [int(x) for x in stdin.readline().rstrip().split()]
if n == m:
print("Yes")
else:
print("No")
| 0 | null | 64,937,365,366,580 | 190 | 231 |
import math
N,D = map(int,input().split())
X = [None]*N
Y = [None]*N
for i in range(N):
X[i],Y[i] = map(int,input().split())
ans=0
for i in range(N):
if(math.sqrt(X[i]**2+Y[i]**2) <=D):
ans+=1
print(ans)
|
n,d=map(int,input().split())
count=0
for i in range(n):
x,y=map(int,input().split())
if d**2>=x**2+y**2:
count+=1
print(count)
| 1 | 5,945,373,441,820 | null | 96 | 96 |
import sys
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
read = sys.stdin.buffer.read
sys.setrecursionlimit(10 ** 7)
INF = float('inf')
H, W = map(int, readline().split())
masu = []
for _ in range(H):
masu.append(readline().rstrip().decode('utf-8'))
# print(masu)
dp = [[INF]*W for _ in range(H)]
dp[0][0] = int(masu[0][0] == "#")
dd = [(1, 0), (0, 1)]
# 配るDP
for i in range(H):
for j in range(W):
for dx, dy in dd:
ni = i + dy
nj = j + dx
# はみ出す場合
if (ni >= H or nj >= W):
continue
add = 0
if masu[ni][nj] == "#" and masu[i][j] == ".":
add = 1
dp[ni][nj] = min(dp[ni][nj], dp[i][j] + add)
# print(dp)
ans = dp[H-1][W-1]
print(ans)
|
import collections
H, W, *S = open(0).read().split()
H, W = [int(_) for _ in [H, W]]
dist = [[float('inf')] * W for _ in range(H)]
dist[0][0] = 0
Q = collections.deque([0])
while True:
if not Q:
break
i = Q.popleft()
x, y = divmod(i, W)
d = dist[x][y]
for dx, dy in ((1, 0), (0, 1)):
nx, ny = x + dx, y + dy
if 0 <= nx < H and 0 <= ny < W:
if S[nx][ny] == '#' and S[x][y] == '.':
if dist[nx][ny] > d + 1:
dist[nx][ny] = d + 1
Q += [nx * W + ny]
elif dist[nx][ny] > d:
dist[nx][ny] = d
Q += [nx * W + ny]
ans = dist[-1][-1]
if S[0][0] == '#':
ans += 1
print(ans)
| 1 | 49,643,412,288,690 | null | 194 | 194 |
from sys import stdin
input = stdin.readline
def main():
A, B = input().split()
A = int(A)
# B = int(100*float(B))
B = int(B[0]+B[2:])
# print((A*B)//100)
if A*B < 100:
print(0)
else:
print(str(A*B)[:-2])
if(__name__ == '__main__'):
main()
|
import sys
input = sys.stdin.readline
def main():
S = input().strip()
assert len(S) == 6
print("Yes") if S[2] == S[3] and S[4] == S[5] else print("No")
if __name__ == '__main__':
main()
| 0 | null | 29,247,267,105,112 | 135 | 184 |
str = input()
if '7' in str:
print("Yes")
else:
print("No")
|
import sys
i,j = input().split()
matrixa = []
for _ in range(int(i)):
matrixa += [[int(n) for n in sys.stdin.readline().split()]]
matrixb =[ int(num) for num in sys.stdin.readlines() ]
matrixc = [ 0 for _ in range(int(i))]
for n in range(int(i)):
for a,b in zip(matrixa[n],matrixb):
matrixc[n] += a*b
for c in matrixc:
print(c)
| 0 | null | 17,773,374,037,368 | 172 | 56 |
count = int(input())
line = input().split()
line.reverse()
for i in range(count):
print(line[i], end = "")
if i != count-1:
print(" ", end = "")
print()
|
from itertools import repeat
print(sum((lambda a, b, c: map(lambda r, n: n % r == 0,
range(a, b+1), repeat(c))
)(*map(int, input().split()))))
| 0 | null | 781,948,532,198 | 53 | 44 |
t = input()
ans = ""
for i in range(len(t)):
if t[i] != '?':
ans += t[i]
else:
ans += 'D'
print(ans)
|
T = input()
T_list = list(T)
i = 0
for s in T_list:
if i == len(T_list):
break
if i == 0:
if T_list[i] == "?":
if 1 < len(T_list):
if T_list[i+1] == "D":
T_list[i] = "P"
elif T_list[i+1] == "?":
T_list[i] = "P"
T_list[i+1] = "D"
i = i + 2
continue
else:
T_list[i] = "D"
else:
T_list[i] = "D"
else:
if T_list[i] == "?":
if T_list[i-1] == "P":
T_list[i] = "D"
elif i+1 < len(T_list):
if T_list[i+1] == "D":
T_list[i] = "P"
elif T_list[i+1] == "?":
T_list[i] = "P"
T_list[i+1] = "D"
i = i + 2
continue
else:
T_list[i] = "D"
else:
T_list[i] = "D"
i = i + 1
T = "".join(T_list)
print(T)
| 1 | 18,395,525,503,152 | null | 140 | 140 |
n=int(input())
for i in range(n):
p=list(map(int,input().split(" ")))
p.sort()
if pow(p[0],2) + pow(p[1],2) == pow(p[2],2):
print('YES')
else:
print('NO')
|
import bisect
import copy
def check(a, b, bar):
sm = 0
cnt = 0
n = len(a)
for x in a:
i = bisect.bisect_left(a, bar - x)
if i == n:
continue
cnt += n - i
sm += b[i] + x * (n-i)
return cnt, sm
n,m = map(int, input().split())
a = list(map(int, input().split()))
a.sort()
b = copy.deepcopy(a)
for i,_ in enumerate(b[:-1]):
b[n-i-2] += b[n-i-1]
left = 0
right = b[0] * 2
while right - left > 1:
middle = ( right + left ) // 2
if check(a, b, middle)[0] < m:
right = middle
else:
left = middle
print(check(a, b, left)[1] - left * (check(a, b, left)[0]-m) )
| 0 | null | 53,937,432,336,732 | 4 | 252 |
N = int(input())
count = {}
max_count = 0
for _ in range(N):
s = input()
if s not in count:
count[s] = 0
count[s] += 1
max_count = max(max_count, count[s])
longest = []
for s, c in count.items():
if c == max_count:
longest.append(s)
longest.sort()
for s in longest:
print(s)
|
from collections import Counter
def solve():
N = int(input())
c = Counter([input() for _ in range(N)])
cnt = -1
ans = []
for i in c.most_common():
if cnt == -1:
cnt = i[1]
ans.append(i[0])
elif cnt == i[1]:
ans.append(i[0])
else:
break
for a in sorted(ans):
print(a)
if __name__ == "__main__":
solve()
| 1 | 69,976,832,030,788 | null | 218 | 218 |
n, m = map(int, input().split())
S = list(map(int, input()))[::-1]
L = []
now = 0
while now < n:
if n - now <= m:
L.append(n - now)
break
for i in range(m, 0, -1):
if not S[now+i]:
now += i
L.append(i)
break
else:
print(-1)
exit()
print(*L[::-1])
|
S=int(input())
T=list(input())
t=S//2
p=0
for i in range(t):
if S%2==1:
p=-1
break
elif T[i]!=T[i+t]:
p=-1
break
if p==-1 or t==0:
print("No")
elif p==0:
print("Yes")
| 0 | null | 143,376,151,095,492 | 274 | 279 |
from queue import Queue
def isSafe(row, col):
return row >= 0 and col >= 0 and row<h and col<w and mat[row][col] != '#'
def bfs(row, col):
visited = [[False]*w for _ in range(h)]
que = Queue()
dst = 0
que.put([row, col, 0])
visited[row][col] = True
moves = [[-1, 0],[1, 0], [0, -1], [0, 1]]
while not que.empty():
root = que.get()
row, col, dst = root
for nrow, ncol in moves:
row2 = row + nrow
col2 = col + ncol
if isSafe(row2, col2) is True and visited[row2][col2] is False:
visited[row2][col2] = True
que.put([row2, col2, dst+1])
return dst
h, w = map(int, input().split())
mat = [input() for _ in range(h)]
ans = 0
for row in range(h):
for col in range(w):
if mat[row][col] == '.':
ans = max(ans, bfs(row, col))
print(ans)
|
def main():
s = input()
t = input()
ans = 0
for i, char in enumerate(s):
if char != t[i]:
ans += 1
print(ans)
if __name__ == '__main__':
main()
| 0 | null | 52,489,651,579,428 | 241 | 116 |
from time import perf_counter
t0 = perf_counter()
import sys
sys.setrecursionlimit(300000)
from collections import defaultdict
from random import randint
def I(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def MI0(): return map(lambda s: int(s) - 1, sys.stdin.readline().split())
def LMI(): return list(map(int, sys.stdin.readline().split()))
def LMI0(): return list(map(lambda s: int(s) - 1, sys.stdin.readline().split()))
MOD = 10 ** 9 + 7
INF = float('inf')
D = I()
C = LMI()
S = [LMI() for _ in range(D)]
# 初期解の生成
last = defaultdict(int)
ans0 = []
for d in range(D):
m = -INF
ans = -1
for i in range(26):
lans = S[d][i]
for j in range(26):
if i == j:
lans -= C[j] * (d + 1 - d - 1)
else:
lans -= C[j] * (d + 1 - last[j])
if lans > m:
m = lans
ans = i
ans0.append(ans)
T = ans0
last = [[i + 1] * 26 for i in range(D)]
for d in range(D):
i = T[d]
j = 0
for dd in range(d, D):
last[dd][i] = j
j += 1
def eval(d, q):
i = T[d]
val = S[d][q] - S[d][i]
contrib = 0
if d == 0:
j = 1
else:
j = last[d - 1][i] + 1
for dd in range(d, D):
if dd > d and last[dd][i] == 0:
break
contrib += j - last[dd][i]
last[dd][i] = j
j += 1
val -= contrib * C[i]
contrib = 0
j = 0
for dd in range(d, D):
if last[dd][q] == 0:
break
contrib += last[dd][q] - j
last[dd][q] = j
j += 1
val += contrib * C[q]
T[d] = q
return val
# TLまで焼きなましで1点更新
i = 0
while perf_counter() - t0 < 1.8:
for _ in range(30):
d = randint(0, D - 1)
q = randint(0, 25)
i = T[d]
val = eval(d, q)
if val < 0:
if randint(0, (i + 1) ** 2) == 0:
pass
else:
eval(d, i)
i += 1
for t in T:
print(t + 1)
|
import time
import random
def main():
start = time.time()
for d in range(D):
res[d] = d%26
ma = check(res)
while 1:
idx1 = random.randint(0,D-1)
idx2 = random.randint(0,D-1)
if idx1==idx2:
continue
taihi = res[idx1]
res[idx1] = res[idx2]
res[idx2] = taihi
tmp = check(res)
if tmp > ma:
ma = tmp
if time.time() - start > 1.75:
break
return res
def check(res):
last = [0] * 26
score = 0
for d in range(D):
sd = s[d]
score += sd[res[d]]
last[res[d]] = d+1
for i in range(26):
score -= c[i]*(d+1-last[i])
return score
if __name__ == '__main__':
D = int(input())
c = list(map(int, input().split()))
s = [list(map(int, input().split())) for _ in range(D)]
res = [0] * D
ans = main()
for val in ans:
print(val+1)
| 1 | 9,640,837,192,780 | null | 113 | 113 |
import sys
def merge(A, left, mid, right):
n1 = mid - left
n2 = right - mid
L = []
R = []
for i in range(n1):
L.append(A[left+i])
for i in range(n2):
R.append(A[mid+i])
L.append("INFTY")
R.append("INFTY")
i = 0
j = 0
for k in range(left, right):
if L[i] <= R[j]:
A[k] = L[i]
i += 1
else:
A[k] = R[j]
j += 1
global c
c += 1
def mergeSort(A, left, right):
if left+1 < right:
mid = (left + right) / 2
mergeSort(A, left, mid)
mergeSort(A, mid, right)
merge(A, left, mid, right)
if __name__ == "__main__":
lines = sys.stdin.readlines()
N = int(lines[0])
nums = [int(n) for n in lines[1].split(" ")]
c = 0
mergeSort(nums, 0, N)
print " ".join(map(str, nums))
print c
|
def main():
N = int(input())
A = [[i for i in input().split()] for j in range(N)]
X = input()
ans = 0
flag = False
for a, b in A:
if a == X:
flag = True
continue
if flag:
ans += int(b)
print(ans)
if __name__ == '__main__':
main()
| 0 | null | 48,240,445,311,588 | 26 | 243 |
import numpy as np
n = int(input())
s = np.array(input().split(), np.int64)
mod = 10 ** 9 + 7
res = 0
po2 = 1
for i in range(61):
bit = (s >> i) & 1
x = np.count_nonzero(bit)
y = n - x
res += x * y % mod * po2
res %= mod
po2 *= 2 % mod
print(res)
|
n=int(input())
a=list(map(int,input().split()))
mod=10**9+7
c=[0]*60
for aa in a:
for i in range(60):
if aa&(1<<i):c[i]+=1
ans=0
for i,cc in enumerate(c):
ans+=cc*(n-cc)*2**i
ans%=mod
print(ans)
| 1 | 122,549,667,767,296 | null | 263 | 263 |
n,k = map(int,input().split())
if n > 2*k :
n = n%(2*k)
while True:
mae = n
n = abs(k-n)
if mae <= n:
break
print(mae)
|
N, K = map(int, input().split())
if N % K == 0:
print(0)
elif N % K > abs((N%K)-K):
print(abs((N%K)-K))
else:
print(N%K)
| 1 | 39,233,093,586,502 | null | 180 | 180 |
n = int(input())
p = list(map(int, input().split()))
minp = 2*10**5
ans = 0
for i in range(n):
if minp >= p[i]:
minp = p[i]
ans += 1
print(ans)
|
import sys
read = sys.stdin.read
readlines = sys.stdin.readlines
import numpy as np
def main():
n, *a = map(int, read().split())
p = np.array(a)
minp = np.minimum.accumulate(p)
r = np.count_nonzero(minp >= p)
print(r)
if __name__ == '__main__':
main()
| 1 | 85,764,721,911,220 | null | 233 | 233 |
N,K=map(int,input().split())
A=list(map(int,input().split()))
B=[0]*(N+1)
B[0]=1;c=0;d=0
if B[0] in A:c=B[0]
for i in range(1,N+1):
B[i]=A[B[i-1]-1]
d=B.index(B[-1])+1
if K<=N:print(B[K]);exit()
#if (K+1-d)%(N+1-d)==0:print(B[-1])
print(B[d-1+(K+1-d)%(N+1-d)])
|
a=str(input())
b=''
for i in range(len(a)):
if a[i].isupper():
b+=a[i].lower()
elif a[i].islower:
b+=a[i].upper()
print(b)
| 0 | null | 12,202,576,902,592 | 150 | 61 |
import math
MAX=510000
fac=[0]*MAX
finv=[0]*MAX
inv=[0]*MAX
MOD=10**9+7
#テーブルを作る前処理
def COMinit():
fac[0]=fac[1]=1
finv[0]=finv[1]=1
inv[1]=1
for i in range(2,MAX):
fac[i] = fac[i-1] * i % MOD
inv[i] = MOD - inv[MOD%i] * (MOD // i) % MOD
finv[i] = finv[i - 1] * inv[i] % MOD
#二項係数計算
def comb(n,k):
if (n < k):
return 0
if (n < 0 or k < 0):
return 0
else:
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD
COMinit()
N,K=map(int,input().split())
A=list(map(int,input().split()))
A.sort()
#print(A)
sum=0
for i in range(N-K+1):
sum+=(A[N-1-i]-A[i])*(comb(N-i-1,K-1))%(10**9+7)
print(sum%(10**9+7))
|
n, k = map(int, input().split())
if n == k:
print(0)
elif n < k:
print(min(n, k - n))
else:
n = n % k
print(min(n, k - n))
| 0 | null | 67,575,404,637,620 | 242 | 180 |
from collections import deque
def run():
n = int(input())
dq = deque()
for _ in range(n):
order = input()
if order[0] == 'i':
dq.appendleft(order[7:])
elif order[6] == ' ':
key = order.split()[1]
if not key in dq:
continue
for i in range(len(dq)):
if dq[i] == key:
dq.remove(key)
break
elif order[6] == 'F':
dq.popleft()
elif order[6] == 'L':
dq.pop()
print(' '.join(dq))
if __name__ == '__main__':
run()
|
import sys
from collections import deque
d = deque()
n = int(input())
lines = sys.stdin.readlines()
for i in range(n):
ins = lines[i].split()
command = ins[0]
if command == "insert":
d.appendleft(ins[1])
elif command == "delete":
try:
d.remove(ins[1])
except:
pass
elif command == "deleteFirst":
d.popleft()
elif command == "deleteLast":
d.pop()
print(" ".join(d))
| 1 | 51,153,449,902 | null | 20 | 20 |
N = int(input())
S = [str(input()) for i in range(N)]
gocha = {}
for s in S:
gocha[s] = 1
print(len(gocha))
|
A = int(input())
B = int(input())
ans = 6 - (A+B)
print(ans)
| 0 | null | 70,191,557,250,430 | 165 | 254 |
n,k=map(int,input().split())
# 1以上k以下の整数がn個
mod=int(1e+9 + 7)
d=[0]*(k+1)
ans=0
for i in range(k,0,-1):
m=k//i
d[i]=pow(m,n, mod)
d[i]-=sum([d[j*i]for j in range(2,m+1)])
ans+=(d[i]*i)%mod
print((ans)%mod)
#print(d)
|
'''
@sksshivam007 - Template 1.0
'''
import sys, re, math
from collections import deque, defaultdict, Counter, OrderedDict
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from heapq import heappush, heappop, heapify, nlargest, nsmallest
def STR(): return list(input())
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def list2d(a, b, c): return [[c] * b for i in range(a)]
def sortListWithIndex(listOfTuples, idx): return (sorted(listOfTuples, key=lambda x: x[idx]))
def sortDictWithVal(passedDic):
temp = sorted(passedDic.items(), key=lambda kv: (kv[1], kv[0]))[::-1]
toret = {}
for tup in temp:
toret[tup[0]] = tup[1]
return toret
def sortDictWithKey(passedDic):
return dict(OrderedDict(sorted(passedDic.items())))
INF = float('inf')
mod = 10 ** 9 + 7
n, k = MAP()
a = [0]*(k+1)
for i in range(k, 0, -1):
temp = pow((k//i), n, mod)
ans = temp%mod
for j in range(2, k//i + 1):
ans -= a[j*i]%mod
a[i] = ans%mod
final = 0
for i in range(len(a)):
final+=(a[i]*i)%mod
print(final%mod)
| 1 | 36,777,152,010,368 | null | 176 | 176 |
M = int(input())
A = [int(_) for _ in input().split()]
N = 1000
kabu = 0
if A[0] < A[1]:
kabu, N = divmod(N, A[0])
for a, b, c in zip(A, A[1:], A[2:]):
if a <= b >= c:
N += kabu * b
kabu = 0
elif a >= b <= c:
dkabu, N = divmod(N, b)
kabu += dkabu
N += kabu * A[-1]
print(N)
|
n = int(input())
data = list(map(int, input().split()))
ans = 0
money = 1000
for idx in range(n-1):
today = data[idx]
tmr = data[idx+1]
if tmr > today:
money += (tmr-today) * (money//today)
print(money)
| 1 | 7,326,789,276,642 | null | 103 | 103 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.