code1
stringlengths 16
24.5k
| code2
stringlengths 16
24.5k
| similar
int64 0
1
| pair_id
int64 2
181,637B
⌀ | question_pair_id
float64 3.71M
180,628B
⌀ | code1_group
int64 1
299
| code2_group
int64 1
299
|
|---|---|---|---|---|---|---|
import math
N = int(input())
min = math.floor(N / 1.08)
max = math.ceil(N/ 1.08)
flag = False
for i in range(min,max+1):
ans = math.floor(i*1.08)
if N == ans:
X = i
flag = True
break
if(flag):
print(X)
else:
print(':(') | n=int(input())
for x in range(n+1):
if x*108//100==n:
print(x)
break
else:
print(":(") | 1 | 125,435,065,099,580 | null | 265 | 265 |
n, m = map(int, input().split())
print(int((n * (n - 1)) / 2) + int((m * (m - 1)) / 2))
| ri = lambda S: [int(v) for v in S.split()]
N, M = ri(input())
c = 0
c += (M * (M-1)) / 2
c += (N * (N-1)) / 2
print(int(c)) | 1 | 45,414,629,999,330 | null | 189 | 189 |
n = int(input())
s = input()
for i in range(1, n):
if s[0] == s[i] and s[:i] == s[i:]:
print("Yes")
break
else:
print("No") | S,T=map(str,input().split())
ans = T+S
print(ans)
| 0 | null | 124,674,646,320,540 | 279 | 248 |
from collections import deque
d = deque()
for a in range(int(input())):
com = input().split()
if com[0] == "insert":
d.appendleft(com[1])
elif com[0] == "delete":
if com[1] in d:
d.remove(com[1])
elif com[0] == "deleteFirst":
d.popleft()
elif com[0] == "deleteLast":
d.pop()
else:
break
print(*d)
| from collections import deque
num = deque()
n = int(input())
for i in range(n):
com = input().split()
if com[0] == "deleteFirst":
num.popleft()
elif com[0] == "deleteLast":
num.pop()
elif com[0] == "insert":
num.insert(0, com[1])
elif com[0] == "delete":
if num.count(com[1]):
num.remove(com[1])
print(" ".join(num))
| 1 | 49,843,110,438 | null | 20 | 20 |
N = int(input())
M0 = M1 = -float('inf')
m0 = m1 = float('inf')
for _ in range(N):
x, y = map(int, input().split())
M0 = max(M0, x - y)
m0 = min(m0, x - y)
M1 = max(M1, x + y)
m1 = min(m1, x + y)
print(max(M0 - m0, M1 - m1)) | N, *XY = map(int, open(0).read().split())
XY = [(x, y) for x, y in zip(*[iter(XY)] * 2)]
XY = list(set(XY))
Ax, Ay = max(XY, key=lambda t: t[0] + t[1])
Bx, By = max(XY, key=lambda t: -t[0] + t[1])
Cx, Cy = max(XY, key=lambda t: t[0] - t[1])
Dx, Dy = max(XY, key=lambda t: -t[0] - t[1])
print(max(
max(abs(x - Ax) + abs(y - Ay),
abs(x - Bx) + abs(y - By),
abs(x - Cx) + abs(y - Cy),
abs(x - Dx) + abs(y - Dy),
) for x, y in XY
)) | 1 | 3,428,635,078,528 | null | 80 | 80 |
import sys
input = sys.stdin.readline
def solve(N):
res = 0
flg = 0
for n in reversed(N):
if flg == 2:
if n >= 5:
flg = 1
else:
flg = 0
m = flg + n
if m == 5:
res += 5
flg = 2
elif m < 5:
res += m
flg = 0
else:
res += (10 - m)
flg = 1
return res + flg%2
N = list(map(int, input().strip()))
print(solve(N))
# N = 1
# q = 0
# while True:
# p = solve(list(map(int, str(N))))
# if abs(p-q) > 1:
# print(N, "OK")
# exit()
# q = p
# N += 1 | A,B = [int(v) for v in input().split()]
if A > 0 and A < 10 and B > 0 and B < 10:
print(A*B)
else:
print(-1)
| 0 | null | 114,595,630,238,908 | 219 | 286 |
L, R, d = map(int, input().split())
count = 0
if ((L and R and d >=1) and (L and R and d <= 100) ):
for L in range(L, R+1):
if (L%d == 0):
count +=1
print(count)
| l, r, d = map(int, input().split())
rest = l%d
if(rest == 0):
num = int(r/d) - int(l/d) + 1
else:
num = int(r/d) - int(l/d)
print(num) | 1 | 7,479,508,436,868 | null | 104 | 104 |
N=int(input())
S={}
for n in range(N):
s=input()
S[s]=S.get(s,0)+1
maxS=max(S.values())
S=[k for k,v in S.items() if v==maxS]
print('\n'.join(sorted(S)))
| a, b = map(int, input().split())
ans = 1001
for n in range(1001):
if n * 8 // 100 == a and n * 10 // 100 == b:
ans = min(ans, n)
if ans < 1001:
print(ans)
else:
print(-1) | 0 | null | 63,183,794,665,860 | 218 | 203 |
N = int(input())
P = tuple(map(int,input().split()))
Q = tuple(map(int,input().split()))
import itertools
nums = list(itertools.permutations(range(1,N+1)))
print(abs(nums.index(P)-nums.index(Q)))
| from itertools import permutations
N = int(input())
P = tuple(map(int, input().split()))
Q = tuple(map(int, input().split()))
M = []
for i in range(N):
M.append(i+1)
p, q = 0, 0
for i, n in enumerate(list(permutations(M))):
if n == P:
p = i
if n == Q:
q = i
print(abs(p - q)) | 1 | 100,050,374,714,852 | null | 246 | 246 |
import itertools,sys
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
N = I()
A = LI()
ans = float('INF')
sum_A = sum(A)
accumulate_A = list(itertools.accumulate(A))
for i in range(N-1):
ans = min(ans,abs(sum_A-accumulate_A[i]*2))
print(ans)
| N=int(input())
alist=list(map(int,input().split()))
slist=[0]
for a in alist:
slist.append(slist[-1]+a)
#print(slist)
answer=float("inf")
for i in range(N+1):
s1=slist[i]
s2=slist[-1]-s1
answer=min(answer,abs(s1-s2))
print(answer) | 1 | 141,874,820,601,320 | null | 276 | 276 |
import math;print(360//math.gcd(360,int(input()))) | def cycle_getter(N, start):
"""
:param N: 移動回数
:param start: 初期条件
:return front: cycleまでの要素のリスト
cycle: cycle内の要素のリスト
end: cycle後の余った部分の要素のリスト
cnt: cycle回数
"""
p = start
front, cycle, end = [], [], []
cnt = 0
visit = {p:0}
L, R = N, -1
P = [p]
for i in range(1,N):
p = lift(p)
if p in visit:
"""
(L, R) = (サイクルに入るまでに移動した回数, サイクルの終端に着くまでに移動した回数)
[6,2,3,4,0,1,2] ⇒ (L, R) = (1, 6)
"""
L, R = visit[p], i
period = R-L
break
visit[p] = i
P.append(p)
front = P[:L]
if L != N:
cycle, end = P[L:R], P[L:L+(N-L)%period]
cnt = (N-L)//period
return front, cycle, end, cnt
################################################################################
import sys
input = sys.stdin.readline
def lift(x): return pow(x,2,M)
N, X, M = map(int, input().split())
front, cycle, end, cnt = cycle_getter(N,X)
# print(front, cycle, end, cnt)
print(sum(front)+sum(cycle)*cnt+sum(end)) | 0 | null | 8,006,883,369,312 | 125 | 75 |
import sys
for line in sys.stdin:
list = line.split()
print len(str(eval(list[0])+eval(list[1]))) | while True:
try:print(len(str(sum(map(int,input().split())))))
except:break
| 1 | 110,257,760 | null | 3 | 3 |
n=int(input())
num=[int(input()) for i in range(n)]
maxv=num[1]-num[0]
minv=num[0]
for j,n in enumerate(num[1:]):
maxv=max(maxv,n-minv)
minv=min(minv,num[j+1])
print(maxv) | def main():
n = int(input())
ans = 10000000000000
for i in range(1, int(n ** 0.5 + 0.5) + 1):
if n % i == 0:
ans = min(ans, i + n // i - 2)
print(ans)
if __name__ == '__main__':
main()
| 0 | null | 80,880,631,976,270 | 13 | 288 |
def gcd(x, y):
if x % y == 0:
return y
else:
return gcd(y, x % y)
x, y = map(int, input().split())
print(gcd(x, y))
| while 1:
H,W=map(int,raw_input().split())
if H==W==0:break
print(W*'#')
while H>2:
print('#'+(W-2)*'.'+'#')
H=H-1
print(W*'#'+'\n') | 0 | null | 421,315,221,042 | 11 | 50 |
import sys
n = int(input())
A=[[[0 for _ in range(10)] for _ in range(3)] for _ in range(4)]
#0??§?????????
#[[[0 0 0 0 0 0 0 0 0 0],
# [0 0 0 0 0 0 0 0 0 0],
# [0 0 0 0 0 0 0 0 0 0]],
# [[0 0 0 0 0 0 0 0 0 0],
# [0 0 0 0 0 0 0 0 0 0],
# [0 0 0 0 0 0 0 0 0 0]],
# [[0 0 0 0 0 0 0 0 0 0],
# [0 0 0 0 0 0 0 0 0 0],
# [0 0 0 0 0 0 0 0 0 0]],
# [[0 0 0 0 0 0 0 0 0 0],
# [0 0 0 0 0 0 0 0 0 0],
# [0 0 0 0 0 0 0 0 0 0]]]
#?£? Building = b
#??? Floor = f
#??? Room = r
#??° Number = num
for i in range(n):
b,f,r,num = input().strip().split()
A[int(b)-1][int(f)-1][int(r)-1]+=int(num)
for i in range(4):
for j in range(3):
print('',' '.join(map(str,A[i][j])))
if i!=3:
print('#'*20) | '''
いちばん簡単なのは建物とフロアごとにリスト作って、足し引き
'''
#部屋、フロア、建物をクラスで定義。まあ、クラスにしなくてもいいんだけど
a = int(input())
n = 10
m = 3
o = 4
h = [
[
[0 for i in range(n)]
for j in range(m)]
for k in range(o)]
#w, x, y, z = 3, 1, 8, 4
for i in range(a):
w,x,y,z = map(int, input().split())
h[w-1][x-1][y-1] += z
#print(h[1][1])
#建物と建物仕切り
def makeFence():
fence = '#' * 20
print(fence)
#部屋を表示する関数
def showRoom(f):
for k in range(len(f)-1):
print(' ' + str(f[k]), end='')
print(' ' + str(f[len(f)-1]))
#フロアを表示する関数
def showFloor(b):
j = 0
while j < len(b):
f = b[j]
showRoom(f)
j += 1
def statusShow(h):
for i in range(len(h)-1):
b = h[i]
showFloor(b)
makeFence()
showFloor(h[len(h)-1])
statusShow(h)
#b = statusShow(h)
#makeFence()
#print(b)
| 1 | 1,100,541,311,802 | null | 55 | 55 |
# -*-coding:utf-8
def main():
while True:
inputNumber = input()
if(inputNumber == '0'):
break
else:
print(sum(list(map(int, inputNumber))))
if __name__ == '__main__':
main() | 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()
| 0 | null | 9,131,143,804,472 | 62 | 135 |
import sys
sys.setrecursionlimit(10**6)
n,k = map(int, input().split())
h = list(map(int, input().split()))
h.sort()
l = -1; r = n # 二分探索時は探索範囲は取り得る値+-1しておく
while l+1 < r:
c = (l+r)//2
if h[c] < k:
l = c
else:
r = c
print(n-(l+1)) | print(''.join(map(str, ["ACL" for _ in range(int(input()))]))) | 0 | null | 90,446,998,819,266 | 298 | 69 |
from collections import Counter
from math import gcd
N=int(input())
def factorize(x):
i=2
ret=[]
while i*i<=x:
while x%i==0:
ret.append(i)
x//=i
i+=1
if x>1:
ret.append(x)
return Counter(ret)
ans=1
for v in factorize(N-1).values():
ans*=v+1
ans-=1
cnt=1
for v in factorize(gcd(N,N-1)).values():
cnt*=v+1
cnt-=1
ans-=cnt
k=2
while k*k<=N:
if N%k==0:
n=N//k
while n%k==0:
n//=k
if n%k==1:
ans+=1
k+=1
ans+=1
print(ans) | def getN():
return int(input())
def getNM():
return map(int, input().split())
def getList():
return list(map(int, input().split()))
def getArray(intn):
return [int(input()) for i in range(intn)]
def input():
return sys.stdin.readline().rstrip()
def rand_N(ran1, ran2):
return random.randint(ran1, ran2)
def rand_List(ran1, ran2, rantime):
return [random.randint(ran1, ran2) for i in range(rantime)]
def rand_ints_nodup(ran1, ran2, rantime):
ns = []
while len(ns) < rantime:
n = random.randint(ran1, ran2)
if not n in ns:
ns.append(n)
return sorted(ns)
def rand_query(ran1, ran2, rantime):
r_query = []
while len(r_query) < rantime:
n_q = rand_ints_nodup(ran1, ran2, 2)
if not n_q in r_query:
r_query.append(n_q)
return sorted(r_query)
from collections import defaultdict, deque, Counter
from sys import exit
from decimal import *
import heapq
import math
from fractions import gcd
import random
import string
import copy
from itertools import combinations, permutations, product
from operator import mul, itemgetter
from functools import reduce
from bisect import bisect_left, bisect_right
import sys
sys.setrecursionlimit(1000000000)
mod = 10 ** 9 + 7
#############
# Main Code #
#############
def prime_factorize(n):
divisors = []
# 27(2 * 2 * 7)の7を出すためにtemp使う
temp = n
for i in range(2, int(math.sqrt(n)) + 1):
if temp % i == 0:
cnt = 0
while temp % i == 0:
cnt += 1
# 素因数を見つけるたびにtempを割っていく
temp //= i
divisors.append([i, cnt])
if temp != 1:
divisors.append([temp, 1])
if divisors == []:
divisors.append([n, 1])
return divisors
def make_divisors(n):
divisors = []
for i in range(1, int(math.sqrt(n)) + 1):
if n % i == 0:
divisors.append(i)
# √nで無い数についてもう一個プラス
if i != n // i:
divisors.append(n // i)
return sorted(divisors)
N = getN()
# 手順としては
# ① kで出来るだけ割る
# ② kで引いていく N = mk + d(d = 1, 2, 3...)とすると, 引いて残る数はm(k - 1) + d
# つまりkで割り切れず、引いても引いても永遠に①に戻ることはない
# N = k ** i * (mk + 1)となるkの数を求める
# i == 0の時
# N - 1の約数の数 - 1(1)
ans = set()
for i in make_divisors(N - 1):
if i != 1:
ans.add(i)
# 割れるだけ割る関数
def dividor(x, k):
if k == 1:
return 0
n = x
while True:
if n % k == 0:
n //= k
else:
break
return n
# i >= 1の時
for prim in make_divisors(N):
if prim == 1:
continue
# Nを割れるだけ割る
alta = dividor(N, prim)
if alta == 1:
ans.add(prim)
continue
if alta >= prim and alta % prim == 1:
ans.add(prim)
# Nが素数でない場合はN自身が追加されない
ans.add(N)
print(len(ans)) | 1 | 41,387,718,600,810 | null | 183 | 183 |
H, W, K = map(int, input().split())
S = [list(input()) for _ in range(H)]
ans = [[0] * W for _ in range(H)]
def calc(h, w, k):
#上下方向の限界を決める
up = h
for i in range(1, h + 1):
if S[h - i][w] == '.' and ans[h - i][w] == 0:
if h == i:
up = 0
continue
else:
up = h - (i - 1)
break
down = h
for i in range(1, H - h):
if S[h + i][w] == '.' and ans[h + i][w] == 0:
if i == H - h - 1:
down = H - 1
continue
else:
down = h + (i - 1)
break
# print ('up, down =', up, down, i)
# up から down までの縦の長さの長方形を作る。
for i in range(up, down + 1):
ans[i][w] = k
flag = True
for i in range(1, w + 1):
for j in range(up, down + 1):
if ans[j][w - i] == 0 and S[j][w - i] == '.':
continue
else:
flag = False
break
if not flag:
break
for j in range(up, down + 1):
ans[j][w - i] = k
flag = True
for i in range(1, W - w):
for j in range(up, down + 1):
if ans[j][w + i] == 0 and S[j][w + i] == '.':
continue
else:
flag = False
break
if not flag:
break
for j in range(up, down + 1):
ans[j][w + i] = k
k = 1
for w in range(W):
for h in range(H):
if S[h][w] == '#':
# print (h, w)
calc(h, w, k)
k += 1
for tmp in ans:
print (*tmp, sep = ' ') | a = int(input())
b = int(input())
for i in range(1,4):
if i !=a and i!= b:
print(i) | 0 | null | 126,923,556,941,192 | 277 | 254 |
import math
def is_prime(x):
root = int(math.sqrt(x))+1
if x == 2:
return True
else:
for i in range(2, root+1):
if x % i == 0:
return False
return True
'''
def find_prime(x):
while True:
if x == 2:
return x
else:
for i in range(2, x+1):
if x % i == 0:
if i == x:
return x
else:
break
else:
continue
x += 1
'''
def main():
x = int(input())
while True:
if is_prime(x) == False:
x += 1
else:
print(x)
break
if __name__ == "__main__":
main()
| import math
n = int(input())
def is_prime(n):
if n == 1: return False
for k in range(2, int(math.sqrt(n)) + 1):
if n % k == 0:
return False
return True
i = 1
while i > 0:
if is_prime(n):
break
n += 1
print (n) | 1 | 105,747,483,341,490 | null | 250 | 250 |
N = int(input())
#リスト内包表記
Ss = [input() for _ in range(N)]
Ss_set = set(Ss)
print(len(Ss_set)) | N = int(input())
GACHA=set()
for n in range(N):
GACHA.add(input())
print(len(GACHA))
| 1 | 30,287,117,821,672 | null | 165 | 165 |
from collections import deque
N, M = map(int, input().split())
G = [[] for _ in range(N+1)]
for _ in range(M):
a, b = map(int, input().split())
G[a].append(b)
G[b].append(a)
q = deque([1])
closed = [False] * (N+1)
closed[1] = True
Ans = [0] * (N+1)
while q:
v = q.popleft()
for u in G[v]:
if not closed[u]:
closed[u] = True
q.append(u)
Ans[u] = v
print("Yes")
print("\n".join(map(str, Ans[2:])))
| #import numpy as np
#import math
#from decimal import *
#from numba import njit
#@njit
def main():
(N, M) = map(int, input().split())
neighbor = [[] for _ in range(N+1)]
for _ in range(M):
(A,B) = map(int, input().split())
neighbor[A] += B,
neighbor[B] += A,
guide = [0 for _ in range(N+1)]
# 1の部屋から幅優先で道しるべを置く
# 探索候補
target = [1]
checked = [1]
while len(target) > 0:
# 候補の先頭から取る
n = target.pop(0)
# nから伸びる行き先
dests = neighbor[n]
# すでに道しるべがあるものは除く
dests = filter(lambda d: guide[d] == 0, dests)
# 道しるべを置く
for d in dests:
guide[d] = n
checked += d,
# 探索候補の末尾に追加
target += d,
print('Yes')
for i in range(2,N+1):
print(guide[i])
main()
| 1 | 20,525,753,539,522 | null | 145 | 145 |
import sys
import heapq
import math
import fractions
import bisect
import itertools
from collections import Counter
from collections import deque
from operator import itemgetter
def input(): return sys.stdin.readline().strip()
def mp(): return map(int,input().split())
def lmp(): return list(map(int,input().split()))
h,n=mp()
a=sum(lmp())
print("Yes" if a>=h else "No") | A = [list(map(int,input().split())) for _ in range(3)]
N = int(input())
b = [int(input()) for _ in range(N)]
c = [[0]*3 for _ in range(3)]
for x in b:
for i in range(3):
for j in range(3):
if A[i][j] == x:
c[i][j] = 1
if c[0] == [1,1,1] or c[1] == [1,1,1] or c[2] == [1,1,1]:
print("Yes")
elif [c[0][0], c[1][0], c[2][0]] == [1,1,1] or [c[0][1], c[1][1], c[2][1]] == [1,1,1] or [c[0][2], c[1][2], c[2][2]] == [1,1,1]:
print("Yes")
elif [c[0][0], c[1][1], c[2][2]] == [1,1,1] or [c[2][0], c[1][1], c[0][2]] == [1,1,1]:
print("Yes")
else:
print("No") | 0 | null | 68,665,067,312,570 | 226 | 207 |
# import itertools
# import math
import sys
# sys.setrecursionlimit(500*500)
# import numpy as np
N = int(input())
# S = input()
# n, *a = map(int, open(0))
# X, K, D = map(int, input().split())
# A = list(map(int, input().split()))
# C = list(map(int, input().split()))
# tree = [[] for _ in range(N + 1)]
# B_C = [list(map(int,input().split())) for _ in range(M)]
C = input()
# B_C = sorted(B_C, reverse=True, key=lambda x:x[1])
# all_cases = list(itertools.permutations(P))
# a = list(itertools.combinations_with_replacement(range(1, M + 1), N))
# itertools.product((0,1), repeat=n)
# A = np.array(A)
# cum_A = np.cumsum(A)
# cum_A = np.insert(cum_A, 0, 0)
# def dfs(tree, s):
# for l in tree[s]:
# if depth[l[0]] == -1:
# depth[l[0]] = depth[s] + l[1]
# dfs(tree, l[0])
# dfs(tree, 1)
a = C.count("R")
b = C[:a].count("R")
print(a - b) | while True:
try:
a, b = map(int, input().split())
if a < b:
b, a = a, b
x, y = a, b
while b: a, b = b, a%b
gcd = a
lcm = (x*y)//gcd
print(gcd, lcm)
except:
break | 0 | null | 3,159,347,262,852 | 98 | 5 |
import math
r = float(input())
print('%.6f %.6f' %(math.pi*r**2, math.pi*2*r)) | import math
r = float(input())
S = math.pi * r**2
L = 2 * math.pi * r
print(S, L) | 1 | 656,589,627,288 | null | 46 | 46 |
import sys
from itertools import combinations
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
H, W, K = map(int, readline().split())
S = [readline().strip() for _ in range(H)]
ans = INF
for r in range(H):
for comb in combinations(range(1, H), r):
sep = [0]
sep.extend(list(comb))
sep.append(H)
res = r
A = [0] * (r + 1)
for j in range(W):
B = [0] * (r + 1)
for k in range(r + 1):
for i in range(sep[k], sep[k + 1]):
if S[i][j] == '1':
B[k] += 1
ok = True
divided = False
for k in range(r + 1):
if B[k] > K:
ok = False
break
if A[k] + B[k] > K:
divided = True
break
else:
A[k] += B[k]
if not ok:
res = INF
break
if divided:
A = B
res += 1
if ans > res:
ans = res
print(ans)
return
if __name__ == '__main__':
main()
| from copy import deepcopy
import numpy as np
H, W, K = map(int, input().split())
matrix = []
for i in range(H):
matrix.append(input())
matrix_int = np.ones((H, W), dtype=np.uint8)
# 1 == 黒、 0 == 白
for row in range(H):
for column in range(W):
if matrix[row][column] == ".":
matrix_int[row, column] = 0
count = 0
for row_options in range(2**H):
for col_options in range(2**W):
tmp_matrix_int = deepcopy(matrix_int)
tmp_row_options = row_options
tmp_col_options = col_options
for row in range(H):
mod = tmp_row_options % 2
if mod == 0:
tmp_matrix_int[row,:] = 0
tmp_row_options = tmp_row_options // 2
for col in range(W):
mod = tmp_col_options % 2
if mod == 0:
tmp_matrix_int[:,col] = 0
tmp_col_options = tmp_col_options // 2
# print(tmp_matrix_int.sum())
if tmp_matrix_int.sum() == K:
count += 1
print(count) | 0 | null | 28,713,992,005,508 | 193 | 110 |
def Warshall_Floyd(dist,n,restoration=False):
next_point = [[j for j in range(n)] for _ in range(n)]
for i in range(n):
for j in range(n):
for k in range(n):
if dist[j][k] > dist[j][i] + dist[i][k]:
next_point[j][k] = next_point[j][i]
dist[j][k] = min(dist[j][k], dist[j][i] + dist[i][k])
if restoration:
return dist,next_point
else:
return dist
n,m,l = map(int,input().split())
inf = 10**18
dist = [[inf for i in range(n)] for j in range(n)]
for i in range(n):
dist[i][i] = 0
for i in range(m):
a,b,c = map(int,input().split())
a -= 1
b -= 1
if c <= l:
dist[a][b] = c
dist[b][a] = c
dist = Warshall_Floyd(dist,n)
route = [[inf for i in range(n)] for j in range(n)]
for i in range(n):
for j in range(n):
if i == j:
route[i][j] = 0
elif dist[i][j] <= l:
route[i][j] = 1
route = Warshall_Floyd(route,n)
q = int(input())
for i in range(q):
s,t = map(int,input().split())
s -= 1
t -= 1
print(route[s][t]-1 if route[s][t] < inf else -1) | N = int(input())
b=[]
c=[]
for j in range(N):
a = input()
b.append(a)
c = set(b)
print(len(c)) | 0 | null | 102,253,472,239,398 | 295 | 165 |
n,m=map(int,input().split())
C=list(map(int,input().split()))
dp=[[float('inf')]*(n+1) for i in range(m+1)]
for i in range(m+1):
dp[i][0]=0
for i in range(1,m+1):
c=C[i-1]
for j in range(1,n+1):
dp[i][j]=dp[i-1][j]
if j>=c:
dp[i][j]=min(dp[i][j],dp[i-1][j-c]+1,dp[i][j-c]+1)
print(dp[m][n])
| # -*- coding: utf-8 -*-
n, m = map(int, input().split())
cs = list(map(int, input().split()))
f = dict() #k?????§??????????????????????°??????????????????¨?????°
f[0] = 0
for k in range(1,n+1):
f[k] = float('inf')
for c in cs:
if k - c < 0:
continue
f[k] = min(f[k], f[k - c] + 1)
print(f[n]) | 1 | 147,121,735,340 | null | 28 | 28 |
N = int(input())
if N%2 != 0:
print("No")
exit()
S=input()
N=N//2
if (S[:N]==S[-N:]):
print("Yes")
else:
print("No") | b=int(input())
a=input()
c=[]
for i in range(b):
c.append(a[i])
#a = list(map(int,input().split()))
#b = list(map(int,input().split()))
if b==1:
print("No")
elif c[:int(b/2)]==c[int(b/2):]:
print("Yes")
else:
print("No")
| 1 | 147,188,611,639,456 | null | 279 | 279 |
import sys
sys.setrecursionlimit(200001)
N, M = [int(n) for n in input().split()]
S = input()
p1 = False
x1 = 0
m1 = N
c1 = 0
for n in S:
if n == "1":
if p1:
c1 += 1
else:
c1 = 1
p1 = True
else:
p1 = False
if c1 > 0:
if c1 > x1:
x1 = c1
if c1 < m1:
m1 = c1
def rest(l, ans):
s = M
while s > 0:
if s >= l:
ans.append(l)
return ans
if S[l-s] == "1":
if s == 1:
return -1
s -= 1
continue
l -= s
if rest(l, ans) == -1:
s -= 1
else:
ans.append(s)
return ans
return -1
if x1 > M - 1:
ans = -1
else:
ans = rest(N, [])
if ans == -1:
print(-1)
else:
print(" ".join([str(n) for n in ans])) | from bisect import *
n,m = map(int,input().split())
S = input()
ok = []
for i,s in enumerate(S[::-1]):
if s == '0':
ok.append(i)
now = 0
ans = []
while now != n:
nxt = ok[bisect_right(ok, now + m) - 1]
if nxt == now:
ans = [str(-1)]
break
else:
ans.append(str(nxt - now))
now = nxt
print(' '.join(ans[::-1]))
| 1 | 139,163,177,121,992 | null | 274 | 274 |
i = raw_input().split()
print int(i[0])*int(i[1]),
print (int(i[0])+int(i[1]))*2 | N, M, K = list(map(int, input().split()))
A = [0] + [int(i) for i in input().split() ]
B = [0] + [int(i) for i in input().split() ]
best = 0
a_time = 0
b_time = sum(B)
b_i = len(B)-1
end_flag = False
for a_i in range(N+1):
a_time += A[a_i]
while a_time + b_time > K:
if b_i == 0:
end_flag = True
break
b_time -= B[b_i]
b_i -= 1
if end_flag == True:
break
if a_i + b_i > best:
best = a_i + b_i
print(best) | 0 | null | 5,493,423,712,140 | 36 | 117 |
#!/usr/bin/env python3
def main():
from scipy.special import comb
N = int(input())
A = [int(x) for x in input().split()]
num_lst = [0] * (N + 1)
for a in A:
num_lst[a] += 1
ans = 0
for num in num_lst:
ans += comb(num, 2, exact=True)
for a in A:
print(ans - (num_lst[a] - 1))
if __name__ == '__main__':
main()
| import collections
N = int(input())
A = list(map(int, input().split()))
c = collections.Counter(A)
ans = 0
for i in c:
ans+=c[i]*(c[i]-1)//2
for i in range(N):
print(ans-(c[A[i]]-1)) | 1 | 47,713,564,133,200 | null | 192 | 192 |
N, M = map(int, input().split())
edge = [[] for _ in range(N)]
for i in range(M):
a,b = map(int, input().split())
edge[a-1].append(b-1)
edge[b-1].append(a-1)
from collections import deque
def solve():
prev = [-1]*N
prev[0]='Yes'
d = deque([(0,0)])
while len(d):
v,cnt = d.popleft()
for u in edge[v]:
if prev[u]==-1:
prev[u]=v+1
d.append((u,cnt+1))
if -1 in prev:
return ['No']
return prev
print(*solve(),sep='\n')
| def dist(x0, y0, x1, y1):
from math import sqrt
return sqrt((x1-x0)**2 + (y1-y0)**2)
from itertools import permutations
N = int(input())
points = [tuple(map(int, input().split())) for _ in range(N)] #; print(points)
dsum = 0
for i, j in permutations(points, 2):
dsum += dist(*i, *j)
print(dsum/N) | 0 | null | 84,797,383,550,620 | 145 | 280 |
x, k, d = [int(i) for i in input().split()]
if x < 0:
x = -x
l = min(k, x // d)
k -= l
x -= l * d
if k % 2 == 0:
print(x)
else:
print(d - x) | X,K,D = map(int,input().split())
X = abs(X)
if X >= K*D:
ans = X - K*D
else:
k = X // D
if (K - k) % 2 == 0:
ans = X - k*D
else:
ans = abs(X-(k+1)*D)
print(ans)
| 1 | 5,289,352,345,586 | null | 92 | 92 |
import sys
from collections import Counter
input = sys.stdin.readline
N = int(input())
C = list(input().strip())
counter = Counter(C)
if len(counter) == 1:
print(0)
else:
red_n = counter["R"]
ans = 0
for i in range(N):
if red_n <= i:
break
if C[i] == "W":
ans += 1
print(ans) | N = int(input())
#stones = list(input())
stones = input()
#print(stones)
a = stones.count('W')
b = stones.count('R')
left_side =stones.count('W', 0, b)
print(left_side) | 1 | 6,263,365,564,738 | null | 98 | 98 |
N, u, v = map(int, input().split())
AB = [list(map(int, input().split())) for _ in range(N - 1)]
graph = [[] for _ in range(N)]
for i, (Ai, Bi) in enumerate(AB):
graph[Ai - 1].append(Bi - 1)
graph[Bi - 1].append(Ai - 1)
import heapq
MY_INF = 10 ** 18
q = [(0, u - 1)]
d_u = [MY_INF] * N
d_u[u - 1] = 0
while len(q) > 0:
dist, src = heapq.heappop(q)
for dst in graph[src]:
dist_tmp = dist + 1
if d_u[dst] > dist_tmp:
d_u[dst] = dist_tmp
heapq.heappush(q, (dist_tmp, dst))
q = [(0, v - 1)]
d_v = [MY_INF] * N
d_v[v - 1] = 0
while len(q) > 0:
dist, src = heapq.heappop(q)
for dst in graph[src]:
dist_tmp = dist + 1
if d_v[dst] > dist_tmp:
d_v[dst] = dist_tmp
heapq.heappush(q, (dist_tmp, dst))
# print("#", d_u)
# print("#", d_v)
ans = 0
for i in range(N):
if d_u[i] < d_v[i] and ans < d_v[i] - 1:
ans = d_v[i] - 1
print(ans) | from collections import deque
def bfs(start, g, visited):
q = deque([start])
visited[start] = 0
while q:
curr_node = q.popleft()
for next_node in g[curr_node]:
if visited[next_node] >= 0: continue
visited[next_node] = visited[curr_node] + 1
q.append(next_node)
def main():
n,u,v = map(int, input().split())
gl = [ [] for _ in range(n+1)]
visited_u = [-1] * (n+1)
visited_v = [-1] * (n+1)
for i in range(n-1):
a, b = map(int, input().split())
gl[a].append(b)
gl[b].append(a)
bfs(u, gl, visited_u)
bfs(v, gl, visited_v)
# print(visited_u)
# print(visited_v)
# target_i = 0
# max_diff_v = 0
ans = 0
for i in range(1,n+1):
if visited_u[i] < visited_v[i] and visited_v[i]:
# if (visited_v[i]-visited_u[i])%2 == 0:
val = visited_v[i]-1
ans = max(ans,val)
# else:
# val = visited_v[i]
# ans = max(ans,val)
print(ans)
if __name__ == "__main__":
main() | 1 | 117,106,983,036,460 | null | 259 | 259 |
from itertools import permutations
n = int( input())
p = tuple(map(int, input().split()))
q = tuple(map(int, input().split()))
a = [i for i in range(1,n+1)]
x = list(permutations(a,n))
y = x.index(p)
z = x.index(q)
print(abs(y-z))
| a, b, c, d = map(int, input().split())
x = [a, min(a+1, b), max(a, b-1), b]
y = [c, min(c+1, d), max(c, d-1), d]
ans = -int(1e19)
for i in x:
for j in y:
ans = max(ans, i*j)
print(ans) | 0 | null | 52,024,718,239,832 | 246 | 77 |
n=int(input())
A=100000
for i in range(n):
A=A*1.05
if (A%1000!=0):
A=(A-A%1000)+1000
print(int(A))
| #E
N,K = map(int,input().split())
A = list(map(int,input().split()))
F = list(map(int,input().split()))
A.sort(reverse=True)
F.sort()
left = 0
right = 10**12
while True:
mid = (left+right)//2
if right - left <= 1:
count = 0
for i in range(N):
a = left//F[i]
count+=max(0,A[i]-a)
if count <= K:
ans = left
else:
ans = right
break
count = 0
for i in range(N):
a = mid//F[i]
count+=max(0,A[i]-a)
if count <= K:
right = mid
else:
left = mid
print(ans)
| 0 | null | 82,717,190,148,252 | 6 | 290 |
n=int(input())
s,t=input().split()
ans=""
for i,j in zip(list(s),list(t)):ans+=i+j
print(ans) | n=int(input())
s,t=input().split()
ans=str()
for i in range(n):
ans+=s[i]+t[i]
print(ans)
| 1 | 111,871,950,684,072 | null | 255 | 255 |
s,t=map(str,input('').split(' '))
a,b=map(int,input('').split(' '))
u=input('')
if u==s:
a=a-1
elif u==t:
b=b-1
print(str(a)+' '+str(b)) | N=int(input())
S=input()
if N%2==1:
print('No')
exit()
n=N//2
for i in range(n):
if S[i]!=S[n+i]:
print('No')
break
else:
print('Yes')
| 0 | null | 108,936,218,614,270 | 220 | 279 |
MOD = 998244353
n, m, k = map(int, input().split())
fact = [0 for _ in range(n)]
invfact = [0 for _ in range(n)]
fact[0] = 1
for i in range(1, n):
fact[i] = fact[i - 1] * i % MOD
invfact[n - 1] = pow(fact[n - 1], MOD - 2, MOD)
for i in range(n - 2, -1, -1):
invfact[i] = invfact[i + 1] * (i + 1) % MOD
def nCk(n, k):
if k < 0 or n < k:
return 0
else:
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) | N, M = map(int, input().split())
A = list(map(int, input().split()))
ans = max(-1, N-sum(A))
print(ans) | 0 | null | 27,514,156,302,064 | 151 | 168 |
A, B, H, M = map(int, input().split())
import math
H_angle =(M * math.pi) / 30
M_angle = (60 * H + M) * math.pi / 360
H_x, H_y = (A * math.cos(H_angle), A * math.sin(H_angle))
M_x, M_y = (B * math.cos(M_angle), B * math.sin(M_angle))
d = math.sqrt((H_x - M_x) ** 2 + (H_y - M_y) ** 2)
print(d) | # -*- coding: utf-8 -*-
def main():
from math import cos
from math import pi
from math import sqrt
import sys
input = sys.stdin.readline
a, b, h, m = map(int, input().split())
# KeyInsight:
# 時針: h + m / 60時間で動いた角度 = 分針が動いた分も考慮する必要がある
# 余弦定理
hour = (60 * h + m) / 720 * 2 * pi
minute = m / 60 * 2 * pi
angle = abs(hour - minute)
c = (a ** 2) + (b ** 2) - 2 * a * b * cos(angle)
print(sqrt(c))
if __name__ == '__main__':
main()
| 1 | 20,086,002,798,950 | null | 144 | 144 |
import numpy as np
a = int(input())
print(int( np.ceil((2000-a)/200)))
| X = int(input())
up = 599
down = 400
i=8
while(i>=1):
if(X <= up and X >= down):
print(i)
break
else:
up += 200
down += 200
i -= 1 | 1 | 6,710,354,104,958 | null | 100 | 100 |
import math
R = float(input())
print(float(2*R*math.pi)) | MOD = 10**9+7
n, k = map(int, input().split())
a = list(map(int, input().split()))
a.sort()
#print(a)
kai = [1]
gai = []
for i in range(n):
j = (kai[i] * (i+1)) % MOD
kai.append(j)
for i in range(n+1):
j = kai[i]
l = pow(j, MOD-2, MOD)
gai.append(l)
#print(kai)
#print(gai)
ans = 0
for i in range(n):
if i <= (n-k):
#print('xあり')
x = (a[i] * kai[n-i-1] * gai[n-i-k] * gai[k-1]) % MOD
else:
x = 0
#print('xha', x)
if i >= (k-1):
#print('yあり')
y = (a[i] * kai[i] * gai[i-k+1] * gai[k-1]) % MOD
else:
y = 0
#print('yha', y)
ans = (ans + y - x) % MOD
#print(ans)
print(ans) | 0 | null | 63,351,203,067,188 | 167 | 242 |
N=int(input())
x=(10**N-2*(9**N)+8**N)%(10**9+7)
print(x) | def main():
from math import gcd
def lcm(a, b):
return a // gcd(a, b) * b
x = int(input())
print(lcm(x, 360) // x)
if __name__ == '__main__':
main()
| 0 | null | 8,119,483,645,728 | 78 | 125 |
def main():
N = input()
L = len(N)
K = int(input())
dp = [[0 for _ in range(L + 1)] for _ in range(K + 1)]
dpp = [[0 for _ in range(L + 1)] for _ in range(K + 1)]
dpp[0][0] = 1
for i in range(1, L + 1):
n = int(N[i - 1])
for k in range(K + 1):
# from dpp
kk = k + (1 if n > 0 else 0)
if kk <= K:
dpp[kk][i] = dpp[k][i - 1]
if n > 0:
dp[k][i] += dpp[k][i - 1]
if k + 1 <= K:
dp[k + 1][i] += (n - 1) * dpp[k][i - 1]
# from dp
dp[k][i] += dp[k][i - 1]
if k + 1 <= K:
dp[k + 1][i] += 9 * dp[k][i - 1]
print(dp[K][L] + dpp[K][L])
if __name__ == '__main__':
main() | # https://atcoder.jp/contests/abc154/tasks/abc154_e
def digit(N, M):
"""
:param N: 0 <= n <= N の整数 (※ 下限が 1 の場合は返り値を -= 1 等する)
:param M: 状態数（例: 0<= (0の個数) <= M）
dp[0][i][*]: 上からi桁目までが N と一致
dp[1][i][*]: 上からi桁目までで N である事が確定
dp[*][*][j]: 状態 j の個数（今回は j = (0 の個数) ）
"""
def f(j,k):
"""状態 j からの繊維。 i+1 桁目の数( = j)に依存"""
return min2(j + (k != 0), M - 1)
L = len(N)
dp = [[[0] * M for i in range(L + 1)] for j in range(2)]
dp[0][0][0] = 1
for i in range(L):
for j in range(M):
for k in range(10):
if k < N[i]:
dp[1][i+1][f(j, k)] += dp[0][i][j] + dp[1][i][j]
elif k == N[i]:
dp[0][i+1][f(j, k)] += dp[0][i][j]
dp[1][i+1][f(j, k)] += dp[1][i][j]
else:
dp[1][i+1][f(j, k)] += dp[1][i][j]
return dp[0][L][K] + dp[1][L][K]
##########################################################################################
N = list(map(int, input().strip())) # 整数を桁毎のリストとして読み込む
K = int(input())
M = K + 2 # 状態数
def min2(x,y):
return x if x < y else y
print(digit(N, M)) | 1 | 75,734,104,470,762 | null | 224 | 224 |
import sys
X, K, D = map(int, input().split())
X = abs(X)
if X // D >= K:
print(X - K*D)
sys.exit()
K = K - (X // D)
A = X - X//D*D
if K % 2 == 0:
print(A)
else:
print(abs(A - D)) | x, k, d = map(int, input().split())
x = abs(x)
k_ = min(k, x // d)
k = k - k_
x = x-k_*d
if k % 2 != 0:
x = abs(x-d)
print(x)
| 1 | 5,283,615,854,592 | null | 92 | 92 |
H,W=map(int,input().split())
if (H==1)|(W==1):
print(1)
elif (H%2==1)&(W%2==1):
print(int((H*W+1)/2))
else:
print(int(H*W/2)) | H, W = map(int, input().split())
h = H // 2
w = W // 2
if H == 1 or W == 1:
print(1)
exit()
if W % 2 == 1:
w += 1
if H % 2 == 1:
print(h * W + w)
else:
print(h * W) | 1 | 50,770,347,613,272 | null | 196 | 196 |
h = [[[0]*10 for i in range(3)] for j in range(4)]
n = int(input())
for i in range(n):
b,f,r,v = map(int,input().split())
h[b-1][f-1][r-1] += v
s = ""
for i in range(4):
for j in range(3):
for k in range(10):
s += " " + str(h[i][j][k])
s += "\n"
if i < 3:
s += "####################\n"
print(s,end="") | import sys
while 1:
H,W = map(int, raw_input().split())
if H == 0 and W == 0:
break
for i in range(H):
for j in range(W):
if i%2 == 0:
if j%2 == 0:
sys.stdout.write("#")
else:
sys.stdout.write(".")
if i%2 != 0:
if j%2 != 0:
sys.stdout.write("#")
else:
sys.stdout.write(".")
if j == W-1:
print ""
print "" | 0 | null | 992,904,070,300 | 55 | 51 |
def factorization(n):
arr = []
tmp = n
for i in range(2, int(-(-n**0.5//1))+1):
if tmp % i == 0:
cnt = 0
while tmp % i == 0:
cnt += 1
tmp //= i
arr.append([i, cnt])
if tmp != 1:
arr.append([tmp, 1])
if arr == [] and n != 1:
arr.append([n, 1])
return arr
n = int(input())
c = factorization(n)
ans = 0
for k, v in c:
cnt = 1
while v >= cnt:
v -= cnt
cnt += 1
ans += (cnt - 1)
print(ans)
| import math
def factrization_prime(number):
factor = {}
div = 2
s = math.sqrt(number)
while div < s:
div_cnt = 0
while number % div == 0:
div_cnt += 1
number //= div
if div_cnt != 0:
factor[div] = div_cnt
div += 1
if number > 1:
factor[number] = 1
return factor
N = int(input())
v = list(factrization_prime(N).values())
ans = 0
for i in range(len(v)):
k = 1
while(True):
if v[i] >= k:
v[i] -= k
k += 1
ans += 1
else:
break
print(ans)
| 1 | 16,846,109,788,676 | null | 136 | 136 |
H,N = map(int,input().split())
magics = [list(map(int,input().split())) for _ in range(N)]
max_A = max(a for a,b in magics)
INF = 10**10
DP = [INF]*(H+max_A)
DP[0] = 0
for i in range(1,H+max_A):
DP[i] = min(DP[i-a] + b for a,b in magics)
ans = min(DP[H:])
print(ans)
| H, N = map(int, input().split())
A = []
max_A = 0
for i in range(N):
A.append(tuple(map(int, input().split())))
max_A = max(max_A, A[i][0])
INF = 10**9
dp = [INF] * (2 * 10 ** 4 + 1)
dp[0] = 0
for i in range(2 * 10 ** 4):
for a, b in A:
if i + a <= 2 * 10 ** 4:
dp[i+a] = min(dp[i]+b, dp[i+a])
print(min(dp[H:])) | 1 | 81,447,160,589,912 | null | 229 | 229 |
a,b = map(int,input().split())
c = a*b
if a>=10 or b >= 10:
print("-1")
else:
print(c)
| W,H,x,y,r=[int(x) for x in input().split()]
print("No" if x < r or y < r or (x+r) > W or (y+r) > H else "Yes")
| 0 | null | 79,522,286,463,350 | 286 | 41 |
import sys
import heapq
input = sys.stdin.readline
N = int(input())
forward = []
backward = []
for _ in range(N):
pos = 0
Min = 0
for c in input()[:-1]:
if c == '(':
pos += 1
else:
pos -= 1
Min = min(Min, pos)
if pos >= 0:
heapq.heappush(forward, (-Min, pos))
else:
heapq.heappush(backward, (pos-Min, -pos))
ansflg = True
pos1 = 0
while forward:
down, pos = heapq.heappop(forward)
if pos1 >= down:
pos1 += pos
else:
ansflg = False
break
pos2 = 0
if ansflg:
while backward:
down, pos = heapq.heappop(backward)
if pos2 >= down:
pos2 += pos
else:
ansflg = False
break
if pos1 != pos2:
ansflg = False
if ansflg:
print("Yes")
else:
print("No")
| n = int(input())
s = [input() for _ in range(n)]
l = 0
r = 0
m = []
def fin():
print("No")
exit()
for word in s:
stack = []
for e in word:
if stack and stack[-1] == "(" and e == ")":
stack.pop()
else:
stack.append(e)
if stack:
if stack[0] == ")" and stack[-1] == "(":
m.append(stack)
elif stack[0] == ")":
r += len(stack)
else:
l += len(stack)
ml = []
mm = 0
mr = []
for word in m:
ll = word.index("(")
rr = len(word) - ll
if ll > rr:
mr.append([ll, rr])
elif ll < rr:
ml.append([ll, rr])
else:
mm = max(mm, ll)
ml.sort()
for ll, rr in ml:
l -= ll
if l < 0:
fin()
l += rr
mr.sort(key=lambda x: x[1])
for ll, rr in mr:
r -= rr
if r < 0:
fin()
r += ll
if mm <= l or mm <= r:
if l == r:
print("Yes")
exit()
fin()
| 1 | 23,792,151,172,192 | null | 152 | 152 |
N = int(input())
A = list(map(int,input().split()))
Adict = {}
for i in range(N):
Adict[A[i]] = (i+1)
ans = []
for i in range(1,N+1):
ans.append(str(Adict[i]))
print(" ".join(ans)) | N=int(input())
A=map(int, input().split())
A=list(A)
ans= [0] * len(A)
for i,a in enumerate(A):
ans[a-1]= i+1
print(' '.join(map(str,ans)))
| 1 | 181,546,217,687,132 | null | 299 | 299 |
N=input()
A=map(int,raw_input().split())
for i in range(N-1):
for k in range(N-1):
print A[k],
print A[N-1]
v=A[i+1]
j=i
while j>=0 and A[j] >v:
A[j+1]=A[j]
j=j-1
A[j+1]=v
for m in range(N-1):
print str(A[m]),
print A[N-1] | def main():
import sys
def input(): return sys.stdin.readline().rstrip()
n, k = map(int, input().split())
a = list(map(int, input().split()))
mod = 10 ** 9+ 7
ans = 1
def answer(a):
ans =1
for x in a:
ans *= x
ans %= mod
return ans
if n == k:
print(answer(a))
return
a.sort(reverse=True, key= lambda x:abs(x))
if sum(x<0 for x in a[:k])%2 == 0:
print(answer(a[:k]))
else:
if all(x < 0 for x in a):
print(answer(a[-k:]))
else:
try:
x1, y1= min([x for x in a[:k] if x > 0]), min([x for x in a[k:] if x < 0])
except ValueError:
x1, y1 = 1, 0
try:
x2, y2= max([x for x in a[:k] if x < 0]),\
max([x for x in a[k:] if x >= 0])
except ValueError:
x2, y2 = 1, 0
if abs(x2*y1) > abs(x1*y2):
a[a.index(x1)] = y1
else:
a[a.index(x2)] = y2
print(answer(a[:k]))
if __name__ == '__main__':
main() | 0 | null | 4,672,494,169,548 | 10 | 112 |
n, m, l = [int(_) for _ in input().split()]
matrix1 = []
for i in range(n):
matrix1.append([int(_) for _ in input().split()])
matrix2 = []
for i in range(m):
matrix2.append([int(_) for _ in input().split()])
for i in range(n):
for j in range(l):
x = 0
for k in range(m):
x += matrix1[i][k] * matrix2[k][j]
print(x, end=" " if j < l - 1 else "\n")
| a, b, c, d = input().split()
a = int(a)
b = int(b)
c = int(c)
d = int(d)
A = []
w = a * c
x = a * d
y = b * c
z = b * d
A.append(w)
A.append(x)
A.append(y)
A.append(z)
B = max(A)
print(B) | 0 | null | 2,226,212,774,848 | 60 | 77 |
# -*- coding:utf-8 -*-
def reac(H,W):
for i in range(H):
for l in range(W):
print('#',end='')
print('')
data = []
while True:
try:
di = input()
if di == '0 0':
break
data.append(di)
except:
break
for i in range(len(data)):
x = data[i]
h = x.split()
reac(int(h[0]),int(h[1]))
print('') | from sys import stdin
while True:
h, w = (int(n) for n in stdin.readline().rstrip().split())
if h == w == 0:
break
for _ in range(h):
print("#" * w)
print()
| 1 | 756,336,713,022 | null | 49 | 49 |
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
from collections import deque
sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7
DR = [1, -1, 0, 0]
DC = [0, 0, 1, -1]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def main():
N, K = LI()
A = LI()
cumsum = [0] * (N+1)
c = collections.defaultdict(list)
memo = [0] * (N+1)
c[0].append(0)
for i in range(N):
# cumsum[i] ... [0, i)
cumsum[i+1] = (cumsum[i] % K + A[i]) % K
val = (cumsum[i+1] - (i+1)) % K
memo[i+1] = val
c[val].append(i+1)
# print(cumsum)
# print(memo)
# print(c)
ans = 0
for i in range(N+1):
val = memo[i]
l_ix = bisect.bisect_right(c[val], i)
r_ix = bisect.bisect_right(c[val], i + (K-1))
# print('i: {}, memo[i]: {}, c[val]: {}, l_ix: {}, r_ix: {}'.format(i, memo[i], c[val], l_ix, r_ix))
ans += r_ix - l_ix
# for i in range(N):
# if A[i] % K == 1:
# ans += 1
print(ans)
main()
| import math
from functools import reduce
from copy import deepcopy
n,m = map(int,input().split())
A = list(map(int,input().split()))
def lcm_base(x, y):
return (x * y) // math.gcd(x, y)
def lcm_list(numbers):
return reduce(lcm_base, numbers, 1)
Acopy = deepcopy(A)
flag = -1
for i in range(n):
cnt = 0
while True:
if Acopy[i] % 2 == 1:
break
else:
Acopy[i] //= 2
cnt += 1
if i == 0:
flag = cnt
else:
if flag != cnt:
print(0)
break
else:
A = [a//2 for a in A]
lcm = lcm_list(A)
print((lcm+m)//2//lcm)
| 0 | null | 119,659,678,368,400 | 273 | 247 |
# 最小公倍数(mathは3.5以降) fractions
from functools import reduce
import fractions #(2020-0405 fractions→math)
def lcm_base(x, y):
return (x * y) // fractions.gcd(x, y) # 「//」はフロートにせずにintにする
def lcm(*numbers):
return reduce(lcm_base, numbers, 1)
def lcm_list(numbers):
return reduce(lcm_base, numbers, 1)
N,M = (int(x) for x in input().split())
A = list(map(int, input().split()))
lcm =lcm_list(A)
han_lcm =lcm//2
han_lcm_num =M//han_lcm
han_lcm_num =(han_lcm_num +1)//2 #偶数を除く
#半公倍数がA自身の中にある時は✖
if han_lcm in A:
han_lcm_num =0
#半公倍数がaiで割り切れるときは✖
for a in A:
if han_lcm % a ==0:
han_lcm_num =0
print(han_lcm_num) | #atcoder template
def main():
import sys
imput = sys.stdin.readline
#文字列入力の時は上記はerrorとなる。
#ここにコード
#input
a = int(input())
#output
print(a + a**2 + a**3)
#N = 1のときなどcorner caseを確認！
if __name__ == "__main__":
main() | 0 | null | 56,206,491,952,522 | 247 | 115 |
from bisect import bisect
N = int(input())
S = [input() for _ in range(N)]
def count(s):
n = len(s)
n1 = 0
n2 = 0
for i in range(n):
if s[i]=='(':
n2 += 1
else:
if n2 > 0:
n2 -= 1
else:
n1 += 1
return n1,n2
l1 = []
l2 = []
m1 = 0
m2 = 0
for i in range(N):
n1,n2 = count(S[i])
if n1+n2==0:
continue
if n1 == 0:
m1 += n2
continue
if n2 == 0:
m2 += n1
continue
if n2-n1>=0:
l1.append([n1,n2])
else:
l2.append([n1,n2])
ans = 'Yes'
l1.sort()
for i in range(len(l1)):
n1,n2 = l1[i]
if m1 < n1:
ans = 'No'
break
m1 += n2-n1
l2.sort(key=lambda x:x[1])
for i in range(len(l2)):
n1,n2 = l2[i]
if m2 < n2:
ans = 'No'
break
m2 += n1-n2
if m1!=m2:
ans = 'No'
print(ans)
| import sys
x,k,d=map(int,input().split())
x=abs(x)
a=x//d
if a>=k:
ans=x-k*d
elif (k-a)%2==0:
ans=x-d*a
else:
ans=x-d*a-d
print(abs(ans)) | 0 | null | 14,372,295,129,852 | 152 | 92 |
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")
| N=int(input())
f=0
for i in range(N):
a,b=map(int,input().split())
if a==b:
f+=1
else:
f=0
if f==3:
print('Yes')
break
else:
print('No') | 1 | 2,486,744,737,162 | null | 72 | 72 |
N=int(input())
S=['A']*N
T=[0]*N
for i in range(N):
s,t=input().split()
S[i]=s
T[i]=int(t)
print(sum(T[S.index(input())+1:])) | N = list(input())
l = len(N)
if N[l-1] == '2' or N[l-1] == '4' or N[l-1] == '5' or N[l-1] == '7' or N[l-1] == '9':
print('hon')
elif N[l-1] == '0' or N[l-1] == '1' or N[l-1] == '6' or N[l-1] == '8':
print('pon')
elif N[l-1] == '3':
print('bon') | 0 | null | 57,949,278,257,178 | 243 | 142 |
s = str(input())
#s = "<>>><<><<<<<>>><"
ans = 0
def leftmore(ln):
ret = [0]
cur = 0
for c in ln:
if c == "<":
cur += 1
else:
cur = 0
ret.append(cur)
return ret
def rightless(ln):
revl = reversed(ln)
ret = [0]
cur = 0
for c in revl:
if c == ">":
cur += 1
else:
cur = 0
ret.append(cur)
return list(reversed(ret))
lm = leftmore(s)
rl = rightless(s)
for i in range(len(s)+1):
ans += max(lm[i],rl[i])
print(ans) | s = input()
big = 0
small = 0
n = 0
big2 =0
for i in range(len(s)):
if s[i]=='<':
big += 1
n += big
small =0
big2 = big
else:
small += 1
n += small
if small<=big2:
n-=1
big =0
print(n) | 1 | 156,591,718,511,228 | null | 285 | 285 |
def a():
data_set=[]
while True:
s=input().split()
data_set.append(s)
if ["0","0"] in data_set:
break
data_set=data_set[:-1]
import itertools
for i in data_set:
count=0
n=int(i[0])
x=int(i[1])
num=list(itertools.combinations(range(1,n+1),3))
for j in num:
if sum(j)==x:
count+=1
print(count)
a()
| while(1):
n, x = map(int, input().split())
if n == 0 and x == 0:
break
count = 0
for i in range(1, n-1):
if i*3 >= x:
break
for j in range(i+1, n):
if i+2*j >= x:
break
if x-i-j <= n:
count += 1
print(count) | 1 | 1,291,987,952,100 | null | 58 | 58 |
n, k = [int(_) for _ in input().split()]
s = []
for i in range(k):
s.append([int(_) for _ in input().split()])
dp = [0 for i in range(n)]
dp[0] = 1
dp_s = [0 for i in range(n+1)]
dp_s[1] = 1
for i in range(1, n):
for j in range(len(s)):
r, l = s[j]
if i-r >= 0:
if i-l >= 0:
dp[i] += dp_s[i-r+1] - dp_s[i-l]
else:
dp[i] += dp_s[i-r+1] - dp_s[0]
dp[i] = dp[i] % 998244353
dp_s[i+1] += dp_s[i] + dp[i]
dp_s[i+1] = dp_s[i+1] % 998244353
print(dp[-1]) | W = input().lower()
count = 0
while True:
l = input()
if l == 'END_OF_TEXT':
break
for i in l.lower().split():
if i == W:
count += 1
print(count) | 0 | null | 2,252,084,586,848 | 74 | 65 |
from collections import defaultdict
def readInt():
return int(input())
def readInts():
return list(map(int, input().split()))
def readChar():
return input()
def readChars():
return input().split()
n = readInt()
a = readInts()
v = sum(a)/2
t = 0
for i in range(len(a)):
t+=a[i]
if t>v:
break
z1 = sum(a[:i])
k1 = sum(a[i:])
z2 = sum(a[:i+1])
k2 = sum(a[i+1:])
if abs(z1-k1)<abs(z2-k2):
z = z1
k = k1
else:
z = z2
k = k2
print(abs(z-k))
| n = input()
a = map(int,raw_input().split())
for i in xrange(len(a)):
v = a[i]
j = i - 1
while j >= 0 and a[j] > v :
a[j+1] = a[j]
j = j - 1
a[j+1] = v
print " ".join(map(str,a)) | 0 | null | 70,771,139,221,120 | 276 | 10 |
s = list(input())
if s.count('R') == 3:
print(3)
elif s.count('R') == 1:
print(1)
elif s.count('R') == 0:
print(0)
else:
if s[1] == 'R':
print(2)
else:
print(1) | S=input()
T=input()
ans=0
for i in range(len(S)-len(T)+1):
c=0
I=i
t=0
for j in range(len(T)):
if S[I]==T[t]:
c+=1
t+=1
I+=1
ans=max(c,ans)
print(len(T)-ans)
| 0 | null | 4,281,738,585,216 | 90 | 82 |
import math
a = float(input())
print("{0:.6f} {1:.6f}".format(a*a*math.pi, a*2.0*math.pi)) | a,b,c,k=map(int,open(0).read().split())
#while k:k-=1;t=a<b;b*=2-t;c*=1+t
while k:k-=1;vars()['bc'[a<b]]*=2
print('NYoe s'[b<c::2]) | 0 | null | 3,744,193,744,642 | 46 | 101 |
x, y = map(int, input().split())
total_money = 0
if x >= 4:
total_money += 0
elif x == 3:
total_money += 100000
elif x == 2:
total_money += 200000
elif x == 1:
total_money += 300000
if y >= 4:
total_money += 0
elif y == 3:
total_money += 100000
elif y == 2:
total_money += 200000
elif y == 1:
total_money += 300000
if x == 1 and y == 1:
total_money += 400000
print(total_money)
| X,Y=map(int,input().split());print(max((4-X)*10**5,0)+max((4-Y)*10**5,0)+(400000 if (X,Y)==(1,1) else 0))
| 1 | 140,543,124,140,128 | null | 275 | 275 |
s = []
s = input()
if s[-1:] == "s":
s += "es"
print(s)
else:
s += "s"
print(s)
| noun = input()
end="s"
if noun[-1] == 's':end="es"
noun += end
print(noun) | 1 | 2,382,032,084,800 | null | 71 | 71 |
#coding:utf-8
x=[[[0 for i in range(10)] for j in range(3)]for k in range(4)]
n=int(input())
for i in range(n):
b,f,r,v=list(map(int,input().split()))
x[b-1][f-1][r-1]+=v
for line,i in enumerate(x):
for j in i:
for k in j:
print(" "+str(k),end="")
print("")
if line!=3:
for i in range(20):
print("#",end="")
print("") | N,A,B=map(int,input().split())
t=N//(A+B)
s=N%(A+B)
ans = t*A + min(s,A)
print(ans) | 0 | null | 28,454,616,784,088 | 55 | 202 |
#http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ALDS1_1_D
#?????§??????
#??????????????????????????°???????????????????????¢?????´?????????????????????
def get_maximum_profit(value_list, n_list):
minv = pow(10,10) + 1
profit = -minv
for v in value_list:
profit = max(profit, v - minv)
minv = min(minv, v)
return profit
def main():
n_list = int(input())
target_list = [int(input()) for i in range(n_list)]
print(get_maximum_profit(target_list, n_list))
if __name__ == "__main__":
main() | N = int(input())
ans = [0 for _ in range(10050)]
for x in range(1,100):
for y in range(1,100):
for z in range(1,100):
a = x**2 + y**2 + z**2 + x*y + y*z + z*x
if a < 10050:
ans[a] += 1
for i in range(1,N+1):
print(ans[i])
| 0 | null | 4,029,507,726,046 | 13 | 106 |
n = input()
x = len(n)
inf = 10 ** 9
#dp[i][flg]...i桁目まで、未満フラグ=1
dp = [[inf] * 2 for _ in range(x+1)]
dp[0][0] = 0
dp[0][1] = 1
for i in range(x):
s = int(n[i])
dp[i+1][0] = min(dp[i][0] + s, dp[i][1] + 10 - s)
dp[i+1][1] = min(dp[i][0] + s + 1, dp[i][1] + 9 - s)
print(dp[x][0])
| import sys
def input():
return sys.stdin.readline()[:-1]
n, p = map(int, input().split())
snacks = sorted([list(map(int, input().split())) for _ in range(n)], key=lambda x: x[0])
dp = [0 for _ in range(p)]
ans = snacks[0][1]
for i in range(1, n):
x, y = snacks[i-1]
z = snacks[i][1]
for j in range(p-1, 0, -1):
if j >= x:
dp[j] = max(dp[j], dp[j-x]+y)
ans = max(ans, dp[j]+z)
print(ans) | 0 | null | 111,082,059,925,240 | 219 | 282 |
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
import string
from bisect import bisect_left, bisect_right
from math import factorial, ceil, floor
from operator import mul
from functools import reduce
from pprint import pprint
sys.setrecursionlimit(2147483647)
INF = 10 ** 13
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def I(): return int(sys.stdin.buffer.readline())
def LS(): return sys.stdin.buffer.readline().rstrip().decode('utf-8').split()
def S(): return sys.stdin.buffer.readline().rstrip().decode('utf-8')
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def LSR(n): return [LS() for i in range(n)]
def SRL(n): return [list(S()) for i in range(n)]
def MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]
mod = 1000000007
n, t = LI()
ab = sorted(LIR(n))
dp = [0] * t
ans = 0
for a, b in ab:
ans = max(ans, dp[-1] + b)
for i in range(a, t)[::-1]:
dp[i] = max(dp[i], dp[i - a] + b)
print(ans)
| 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)
| 0 | null | 100,269,411,696,102 | 282 | 193 |
s = input()
if s[0] == "S":
if s[1] == "S":
if s[2] == "S":
print("0")
else:
print("1")
if s[1] == "R":
if s[2] == "S":
print("1")
else:
print("2")
if s[0] == "R":
if s[1] == "S":
if s[2] == "S":
print("1")
else:
print("1")
if s[1] == "R":
if s[2] == "S":
print("2")
else:
print("3") | s = input()
if s == "S" :
print('天気が雨である日が連続していた最大の日数を入力せよ')
elif s == "RRR" :
print(3)
elif s == "RRS" or s =="SRR" :
print(2)
elif s == "SSS" :
print(0)
else :
print(1) | 1 | 4,880,595,262,598 | null | 90 | 90 |
import heapq
from collections import deque
must_red, must_green, a,b,c = map(int,input().split())
delicious_red_ls = list(map(int, input().split()))
delicious_green_ls = list(map(int, input().split()))
delicious_free_ls = list(map(int, input().split()))
delicious_red_ls.sort(reverse=True)
delicious_green_ls.sort(reverse=True)
first_red = delicious_red_ls[:must_red]
first_green = delicious_green_ls[:must_green]
first_set = first_green + first_red
first_set.sort()
delicious_free_ls.sort()
while delicious_free_ls:
to_be_erased = heapq.heappop(first_set)
erase = delicious_free_ls[-1]
if to_be_erased < erase:
new = delicious_free_ls.pop()
heapq.heappush(first_set, new)
else:
heapq.heappush(first_set, to_be_erased)
break
print(sum(first_set))
| from sys import stdin, setrecursionlimit
def main():
input = stdin.buffer.readline
x, y, a, b, c = map(int, input().split())
pqr = []
p = list(map(int, input().split()))
q = list(map(int, input().split()))
r = list(map(int, input().split()))
for i in range(a):
pqr.append([p[i], 1])
for i in range(b):
pqr.append([q[i], 2])
for i in range(c):
pqr.append([r[i], 0])
pqr.sort(reverse=True)
ans = 0
c_a = 0
c_b = 0
c_c = 0
for v, k in pqr:
if k == 1 and c_a < x:
ans += v
c_a += 1
elif k == 2 and c_b < y:
ans += v
c_b += 1
elif k == 0 and c_a + c_b + c_c < x + y:
ans += v
c_c += 1
if c_a + c_b + c_c == x + y:
print(ans)
exit()
if __name__ == "__main__":
setrecursionlimit(10000)
main()
| 1 | 44,730,187,366,968 | null | 188 | 188 |
A,B,C,D=map(int,input().split())
nT = 0
nA = 0
while C-B>0:
C -= B
nT += 1
while A-D>0:
A -= D
nA += 1
if nT <= nA:
print('Yes')
else:
print('No')
| class monster:
def __init__(self, hp: int, ap: int):
self.hit_point = hp
self.attack_point = ap
self.status = 'healthy'
def attack(self, enemy: 'monster'):
enemy.defend(self.attack_point)
def defend(self, enemy_ap: int):
self.hit_point -= enemy_ap
if self.hit_point <= 0:
self.status = 'dead'
def is_alive(self) -> bool:
return not self.is_dead()
def is_dead(self) -> bool:
return self.status == 'dead'
def answer(t_hp: int, t_ap: int, a_hp: int, a_ap: int) -> str:
taka_monster = monster(t_hp, t_ap)
aoki_monster = monster(a_hp, a_ap)
while taka_monster.is_alive() and aoki_monster.is_alive():
taka_monster.attack(aoki_monster)
if aoki_monster.is_dead():
return 'Yes'
aoki_monster.attack(taka_monster)
if taka_monster.is_dead():
return 'No'
def main():
a, b, c, d = map(int, input().split())
print(answer(a, b, c, d))
if __name__ == '__main__':
main() | 1 | 29,627,378,759,832 | null | 164 | 164 |
in_sec = int(raw_input())
sec = in_sec%60
in_sec = (in_sec-sec)/60
min = in_sec%60
h = (in_sec-min)/60
print str(h) + ":" + str(min) + ":" + str(sec) | s = int(input())
h = s // 3600
s = s % 3600
m = s // 60
s = s % 60
print("%d:%d:%d" % (h,m,s))
| 1 | 324,743,547,450 | null | 37 | 37 |
from collections import defaultdict
def main():
N = int(input())
d = defaultdict(int)
results = ["AC", "WA", "TLE", "RE"]
for _ in range(N):
d[input()] += 1
for r in results:
print(f"{r} x {d[r]}")
if __name__ == '__main__':
main()
| def sep():
return map(int,input().strip().split(" "))
def lis():
return list(sep())
n=int(input())
ar=[]
for _ in range(n):
ar.append(input())
from collections import Counter
c=Counter(ar)
print("AC x",c["AC"])
print("WA x",c["WA"])
print("TLE x",c["TLE"])
print("RE x",c["RE"]) | 1 | 8,805,760,369,120 | null | 109 | 109 |
if __name__ == '__main__':
p_taro, p_hanako = 0, 0
n = int(input())
for i in range(n):
animal_taro, animal_hanako = input().split()
if animal_taro > animal_hanako:
p_taro += 3
elif animal_taro < animal_hanako:
p_hanako += 3
else:
p_taro, p_hanako = p_taro+1, p_hanako+1
print(p_taro, p_hanako) | N=int(input())
D=list(map(int,input().split()))
isOK=True
if D[0]!=0:
isOK=False
for i in range(1,N):
if D[i]==0:
isOK=False
break
cnt=[0]*(max(D)+1)
MOD=998244353
for i in range(N):
cnt[D[i]]+=1
ans=1
for i in range(len(cnt)-1):
for r in range(cnt[i+1]):
ans=ans*cnt[i]%MOD
if isOK:
print(ans)
else:
print(0) | 0 | null | 78,710,254,480,348 | 67 | 284 |
from collections import deque
# リストでグラフを表現する
n = int(input())
G = [input().split()[2:] for _ in range(n)]
# 頂点1から各頂点への距離を-1 (頂点1からたどり着けない)で初期化する
d = [-1] * n
que = deque() # 訪問予定の頂点を格納する
# 初期状態をキューに入れる
que.append(0)
d[0] = 0
while que:
p = que.popleft() # FIFOでキューの要素を取り出し、その頂点を訪ねる。
for v in G[p]:
v = int(v) - 1
if d[v] < 0: # まだ訪れたことがない
que.append(v)
# 距離を記録する
d[v] = d[p] + 1
for i in range(n):
print(i+1, d[i])
| n=int(input())
s=100000
for i in range(n):
s*=1.05
m = s % 1000
if m!=0:
s=s-m+1000
print(int(s))
| 0 | null | 2,744,662,128 | 9 | 6 |
s = str(input())
if s.count('RRR') == 1:
print(3)
elif s.count('RR') == 1:
print(2)
elif 1 <= s.count('R'):
print(1)
else:
print(0) | S=input()
if "RRR" in S:
print(3)
elif "RR" in S:
print(2)
elif "R" in S:
print(1)
else:
print(0) | 1 | 4,895,720,060,002 | null | 90 | 90 |
m = []
for _ in range(10):
r = int(input())
m.append(r)
m.sort()
print (m[9]);
print (m[8]);
print (m[7]); | import sys
heights = [int(i) for i in sys.stdin.read().split()]
heights.sort(reverse=True)
print("\n".join(map(str, heights[:3]))) | 1 | 20,158,322 | null | 2 | 2 |
n = int(input())
# 動的計画法
def fibonacci(n):
F = [0]*(n+1)
F[0] = 1
F[1] = 1
for i in range(2, n+1):
F[i] = F[i-2] + F[i-1]
return F
f = fibonacci(n)
print(f[n])
| #!/usr/bin/env python
from __future__ import division, print_function
from sys import stdin
def fibo(n):
a, b = 1, 1
while n:
a, b = b, a + b
n -= 1
return a
print(fibo(int(stdin.readline()))) | 1 | 1,953,777,098 | null | 7 | 7 |
import statistics
N = int(input())
A = []
B = []
for _ in range(N):
a, b = map(int, input().split())
A.append(a)
B.append(b)
A.sort()
B.sort()
if N % 2 == 1:
med_min = A[N // 2]
med_max = B[N // 2]
print(med_max - med_min + 1)
else:
med_min_db = A[N // 2] + A[N // 2 - 1]
med_max_db = B[N // 2] + B[N // 2 - 1]
print(med_max_db - med_min_db + 1)
| #!/usr/bin/env python
import sys
sys.setrecursionlimit(10**9)
from collections import deque
import heapq
from itertools import combinations
import bisect
n=int(input())
l=[]
for i in range(n):
l.append(list(input()))
p=0
q=0
for i in range(n):
for j in l[i]:
if j=='(':
p+=1
else:
q+=1
if p!=q:
print('No')
exit()
pl=[]
ql=[]
ml=[]
for i in range(n):
a=l[i]
p=0
q=0
for j in a:
if j=='(':
p+=1
else:
q+=1
if p>q:
pl.append(a)
elif p<q:
ql.append(a)
else:
ml.append(a)
if pl:
pp=[]
for i in pl:
d=0
t=0
for j in i:
if j=='(':
d+=1
else:
d-=1
t=max(t,-d)
pp.append([t,d])
pp.sort(key=lambda x: x[0]*(10**6)-x[1])
dd=0
for a,b in pp:
if dd<a:
print('No')
exit()
dd+=b
if ml:
pp=[]
for i in ml:
d=0
t=0
for j in i:
if j=='(':
d+=1
else:
d-=1
t=max(t,-d)
pp.append([t,d])
pp.sort(key=lambda x: x[0]*(10**6)-x[1])
#d=0
if not pl:
dd=0
for a,b in pp:
if dd<a:
print('No')
exit()
dd+=b
if ql:
pp=[]
for i in ql:
d=0
t=0
for j in range(len(i)):
if i[len(i)-1-j]==')':
d+=1
else:
d-=1
t=max(t,-d)
pp.append([t,d])
pp.sort(key=lambda x: x[0]*(10**6)-x[1])
dd=0
for a,b in pp:
if dd<a:
print('No')
exit()
dd+=b
if ml:
pp=[]
for i in ml:
d=0
t=0
for j in range(len(i)):
if i[len(i)-1-j]==')':
d+=1
else:
d-=1
t=max(t,-d)
pp.append([t,d])
pp.sort(key=lambda x: x[0]*(10**6)-x[1])
if not ql:
dd=0
for a,b in pp:
if dd<a:
print('No')
exit()
dd+=b
print('Yes')
| 0 | null | 20,345,962,166,084 | 137 | 152 |
#xs = [int(x) for x in input().split()]
import sys
for line in sys.stdin:
a, b = map(int, line.split())
i = a + b
j = 1
while i >= 10:
i = i / 10
j = j + 1
print(j) | def main():
N = int(input())
if N%2==0:
print(N//2-1)
else:
print((N-1)//2)
if __name__ == '__main__':
main() | 0 | null | 76,332,992,844,418 | 3 | 283 |
N = int(input())
a = list(map(int, input().split()))
b = []
j = N-1
while j > 0:
print("{} ".format(a[j]),end = "")
j -= 1
print(a[j]) | # C Marks
N, K = map(int, input().split())
A = list(map(int, input().split())) # リストがうまく作れてない？
j = 0
i = K
ct = 1
while ct <= (N - K):
if A[j] < A[i]:
print("Yes")
else:
print("No")
j += 1
i += 1
ct += 1
| 0 | null | 4,056,600,914,814 | 53 | 102 |
# collections.deque is implemented using doubly linked list at C level..
from collections import deque
linkedlist = deque()
for _ in range(int(input())):
input_command = input()
if input_command == 'deleteFirst':
linkedlist.popleft()
elif input_command == 'deleteLast':
linkedlist.pop()
else:
com, num = input_command.split()
if com == 'insert':
linkedlist.appendleft(num)
elif com == 'delete':
try:
linkedlist.remove(num)
except:
pass
print(' '.join(linkedlist))
| from collections import deque
que = deque()
n = int(input())
for _ in range(n):
command = input()
if command == 'deleteFirst':
que.popleft()
elif command == 'deleteLast':
que.pop()
else:
x, y = command.split()
if x == 'insert':
que.appendleft(int(y))
elif int(y) in que:
que.remove(int(y))
print(' '.join(map(str, que)))
| 1 | 49,770,538,268 | null | 20 | 20 |
x=int(input())
a=1
while True:
if (a*x%360==0):
print(a)
break
a+=1
| from collections import deque
n, u, v = map(int, input().split())
u -= 1
v -= 1
edges = [[] for i in range(n)]
for i in range(n - 1):
a, b = map(int, input().split())
edges[a - 1].append(b - 1)
edges[b - 1].append(a - 1)
def bfs(u):
visited = [-1] * n
Q = deque()
visited[u] = 0
Q.append(u)
while Q:
p = Q.popleft()
for v in edges[p]:
if visited[v] == -1:
visited[v] = visited[p] + 1
Q.append(v)
return visited
tak_dist = bfs(u)
aok_dist = bfs(v)
ans = []
for i in range(n):
if tak_dist[i] < aok_dist[i]:
ans.append(aok_dist[i])
print(max(ans) - 1) | 0 | null | 65,453,319,056,928 | 125 | 259 |
def gcd(a, b):
while b:
a, b = b, a % b
return a
def lcm(a, b):
return a * b // gcd (a, b)
c,d=[int(i) for i in input().split()]
print(gcd(c,d)) | a,b=map(int,input().split())
if a<b:
(a,b)=(b,a)
while b!=0:
(a,b)=(b,a%b)
print(a) | 1 | 8,307,765,760 | null | 11 | 11 |
cards = [
"{0} {1}".format(s, r)
for s in ('S', 'H', 'C', 'D')
for r in range(1, 13 + 1)
]
count = int(input())
for n in range(count):
card = input()
cards.remove(card)
for n in cards:
print(n) | from itertools import product
(lambda *_: None)(
*(lambda full, hand: map(print,
filter(lambda c: c not in hand, full)))(
map(' '.join, product('SHCD', map(str, range(1, 14)))),
set(map(lambda _: input(), range(int(input())))))) | 1 | 1,039,205,854,982 | null | 54 | 54 |
N=int(input())
s=set()
for _ in range(N):
S=input()
s|={S}
print(len(s))
| from decimal import Decimal
import math
AB = input().split()
A, B = int(AB[0]), Decimal(AB[1])
print(math.floor(A*B))
| 0 | null | 23,412,183,066,172 | 165 | 135 |
a, b = map(str, input().split())
if (len(a) == 1 and len(b) ==1):
print(int(a) * int(b))
else:
print(-1) | x = input().split()
a = int(x[0])
b = int(x[1])
if a <= 9 and b <= 9:
print(a * b)
else:
print('-1') | 1 | 158,393,746,831,232 | null | 286 | 286 |
S = input()
P =2019
ans = 0
count = [0] * P
count[0] = 1
u = 0
for i, s in enumerate(reversed(S)):
u = (int(s) * pow(10, i, P) + u) % P
ans += count[u]
count[u] += 1
print(ans)
| N = int(input())
A = list(map(int,input().split()))
Q = int(input())
S = [list(map(int, input().split())) for l in range(Q)]
numList = {}
sum = 0
for n in range(N):
if A[n] not in numList:
numList[A[n]] = 0
numList[A[n]] += 1
sum += A[n]
for q in range(Q):
if S[q][0] in numList:
if S[q][1] not in numList:
numList[S[q][1]] = 0
sum += (S[q][1] - S[q][0]) * numList[S[q][0]]
numList[S[q][1]] += numList[S[q][0]]
numList[S[q][0]] = 0
print(sum) | 0 | null | 21,528,012,172,128 | 166 | 122 |
import itertools as it
a,b,c = map(int,input().split())
k = int(input())
allcase = list(it.product([0,1,2,3],repeat=k))
for case in allcase:
nums = [a,b,c]
for step in case:
if step == 3:
continue
nums[step] *= 2
if nums[0] < nums[1] and nums[1] < nums[2]:
print('Yes')
exit()
print('No') | n,x,m=map(int,input().split())
ans=x
count=1
table=[0]*m
table[x]=1
r=[0,x] #一般項
f=1
for i in range(n-1):
x=pow(x,2,m)
ans+=x
count+=1
if table[x]:
f=0
break
r.append(x)
table[x]=count
if f or table[0]:
print(ans)
exit()
ans=0
'''
table[x]項目とcount項目が同じ
loop前の項+loopの項*loop数+足りない分
'''
ans=sum(r[:table[x]])
loop=(n-table[x]+1)//(count-table[x])
ans+=sum(r[table[x]:])*loop
nokori=(n-table[x]+1)%(count-table[x])
for i in range(nokori):
ans+=r[table[x]+i]
print(ans) | 0 | null | 4,896,478,646,400 | 101 | 75 |
#python 3.7.1
N=int(input())
if (N%2)==0:
ans=N//2-1
else:
ans=N//2
print(ans) | import collections
def Z(): return int(input())
def ZZ(): return [int(_) for _ in input().split()]
def main():
H, W, K = ZZ()
C = [input() for _ in range(H)]
atode = collections.deque()
last = -1
cakeId = 0
output = [[0] * W for _ in range(H)]
for i in range(H):
if not '#' in C[i]:
atode.append(i)
continue
ichigo = []
last = i
for j in range(W):
if C[i][j] == '#': ichigo.append(j)
itr = 0
for j in ichigo:
cakeId += 1
while itr <= j:
output[i][itr] = cakeId
itr += 1
while itr < W:
output[i][itr] = cakeId
itr += 1
while atode:
j = atode.popleft()
for k in range(W): output[j][k] = output[i][k]
while atode:
j = atode.popleft()
for k in range(W): output[j][k] = output[last][k]
for i in range(H): print(*output[i])
return
if __name__ == '__main__':
main()
| 0 | null | 148,762,012,572,654 | 283 | 277 |
#C
K, N=map(int,input().split())
A=list(map(int,input().split()))
for i in range(N):
A.append(A[i]+K)
Right=[]
for i in range(N):
Right.append(A[N-1+i]-A[i])
print(min(Right)) | [K, N] = [int(i) for i in input().split()]
A = [int(i) for i in input().split()]
t = K - A[N-1] + A[0]
for i in range(N-1):
if t < A[i+1] - A[i]:
t = A[i+1] - A[i]
print(K-t) | 1 | 43,514,798,132,642 | null | 186 | 186 |
# でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)
import sys
def main(N, K, A, F):
A.sort()
F.sort(reverse=True)
def f(x):
sy = 0
for a, f in zip(A, F):
m = a * f
if m > x:
sy += (m - x + f - 1) // f
return sy
under = -1
hi = 10**12 + 1
while hi - under > 1:
m = (hi + under) // 2
if f(m) <= K: hi = m
else: under = m
print(hi)
if __name__ == '__main__':
input = sys.stdin.readline
N, K = map(int, input().split())
*A, = map(int, input().split())
*F, = map(int, input().split())
main(N, K, A, F)
| h , w , k = map(int,input().split())
ans = []
cake = []
cou = 0
for i in range(h):
cake.append(list(input()))
fla = 0
for i in range(h):
if cake[i].count("#") == 0:
if i == 0:
fla = 1
ans.append([])
elif i != 0:
if fla == 0:
ans.append(ans[i-1])
elif fla == 1:
ans.append([])
else:
cou += 1
p = 0
kar = []
for j in range(w):
if cake[i][j] == "#":
if p == 0:
p = 1
elif p != 0:
cou += 1
kar.append(cou)
ans.append(kar)
if fla == 1:
fla = 0
tyu = 0
while True:
if ans[tyu] == []:
ans[tyu] = kar
else:
break
tyu += 1
for i in range(h):
print(*ans[i]) | 0 | null | 154,041,428,664,900 | 290 | 277 |
# coding:utf-8
while True:
array = map(int, list(raw_input()))
if array[0] == 0:
break
print sum(array)
| while True:
x_sum = sum([int(x) for x in raw_input()])
if x_sum == 0:
break
print x_sum | 1 | 1,566,057,115,012 | null | 62 | 62 |
import sys
n = int(input())
A=[[[0 for _ in range(10)] for _ in range(3)] for _ in range(4)]
#0??§?????????
#[[[0 0 0 0 0 0 0 0 0 0],
# [0 0 0 0 0 0 0 0 0 0],
# [0 0 0 0 0 0 0 0 0 0]],
# [[0 0 0 0 0 0 0 0 0 0],
# [0 0 0 0 0 0 0 0 0 0],
# [0 0 0 0 0 0 0 0 0 0]],
# [[0 0 0 0 0 0 0 0 0 0],
# [0 0 0 0 0 0 0 0 0 0],
# [0 0 0 0 0 0 0 0 0 0]],
# [[0 0 0 0 0 0 0 0 0 0],
# [0 0 0 0 0 0 0 0 0 0],
# [0 0 0 0 0 0 0 0 0 0]]]
#?£? Building = b
#??? Floor = f
#??? Room = r
#??° Number = num
for i in range(n):
b,f,r,num = input().strip().split()
A[int(b)-1][int(f)-1][int(r)-1]+=int(num)
for i in range(4):
for j in range(3):
print('',' '.join(map(str,A[i][j])))
if i!=3:
print('#'*20) | a = [[[0 for r in range (10)] for f in range(3)] for b in range(4)]
ans = ""
n = input()
for i in range(0, n):
b, f, r, v = map(int, raw_input().split(" "))
a[b-1][f-1][r-1] += v
for b in range(4):
for f in range(3):
for r in range(10):
ans += " "+str(a[b][f][r])
if (b!=3 or f!=2 or r!=9):
ans += "\n"
if (b != 3):
ans += "#"*20+"\n"
print(ans) | 1 | 1,097,509,234,692 | null | 55 | 55 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.