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
|
|---|---|---|---|---|---|---|
N, M = map(int, input().split())
A = list(map(int, input().split()))
assert len(A) == M
# M個の宿題, それぞれAi日かかる
yasumi = N - sum(A)
if yasumi >= 0:
print(yasumi)
else:
print(-1) | import copy
h, w, k = map(int, input().split())
clist0 = []
result = 0
for i0 in range(h):
c = list(input())
clist0.append(c)
for i in range(2**h):
for j in range(2**w):
clist = copy.deepcopy(clist0)
for hi in range(h):
#print(i, hi)
if((i & 2**hi) == 2**hi):
#print(i, hi)
for j2 in range(w):
clist[hi][j2] = "1"
for wi in range(w):
if((j & 2**wi) == 2**wi):
for i2 in range(h):
clist[i2][wi] = "1"
temp = 0
#print(clist)
for ci in clist:
temp += ci.count("#")
if(temp == k):
result +=1
print(result) | 0 | null | 20,552,908,120,832 | 168 | 110 |
a, b, c, d = map(int,input().split())
while True:
c = c - b
a = a - d
if c <= 0:
print('Yes')
break
elif a <= 0:
print('No')
break
else:
pass | from math import ceil
a, b, c, d = map(int, input().split())
x = ceil(c/b)
y = ceil(a/d)
if x <= y:
print('Yes')
else:
print('No') | 1 | 29,747,320,448,310 | null | 164 | 164 |
X = int(input())
a = []
c = []
if X % 2 == 1:
while a == []:
for i in range(3,X,2):
b = X % i
a.append(b)
if 0 in a:
a = []
X += 1
else:
print(X)
elif X == 2:
print(X)
else:
X += 1
while c == []:
for i in range(3,X,2):
d = X % i
c.append(d)
if 0 in c:
c = []
X += 1
else:
print(X) | str = input() *2
pattern = input()
if pattern in str:
print("Yes")
else:
print("No") | 0 | null | 53,820,876,878,190 | 250 | 64 |
import collections
n = int(input())
numbers = []
while n%2 == 0:
numbers.append(2)
n //= 2
i = 3
while i*i <= n:
if n%i == 0:
numbers.append(i)
n //= i
else:
i += 2
if n != 1:
numbers.append(n)
factors = collections.Counter(numbers)
ans = 0
for num in factors.values():
k = 1
while num >= k:
num -= k
ans += 1
k += 1
print(ans)
| from collections import defaultdict
from math import sqrt
def main():
n = int(input())
wi = 2
cnt = 0
d = defaultdict(lambda:0)
fi = int(sqrt(1e12)+1)
for i in range(2, fi):
while n % i == 0:
d[i] += 1
n //= i
if n != 1:
d[n] = 1
for val in d.values():
x = val
wi = 1
while(x >= wi):
x -= wi
wi += 1
cnt += 1
print(cnt)
if __name__ == "__main__":
main() | 1 | 16,876,068,801,968 | null | 136 | 136 |
A,B,C,K=map(int,input().split())
ans=1*min(A,K)
K=max(0,K-A-B)
print(ans-(1*K))
| def easy_linear_programming():
A, B, C, K = map(int, input().split())
if K <= A:
print(K)
elif K - A <= B:
print(A)
else:
k = K - A - B
print(A - k)
easy_linear_programming() | 1 | 21,833,346,762,600 | null | 148 | 148 |
from collections import Counter,defaultdict,deque
from heapq import heappop,heappush
from bisect import bisect_left,bisect_right
import sys,math,itertools,fractions
sys.setrecursionlimit(10**8)
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
n = inp()
s,t = input().split()
print(''.join([s[i] + t[i] for i in range(n)])) |
N = int(input())
S, T = map(str, input().split())
ans = ""
for s, t in zip(S, T):
ans += s + t
print(ans)
| 1 | 112,324,243,067,840 | null | 255 | 255 |
for i in range(1, 10):
for j in range(1, 10):
print(i, end="")
print("x", end="")
print(j, end="")
print("=", end="")
print(i*j) | for i in range(1,10):
for j in range(1,10):
s = i * j
print("{0}{3}{1}={2}".format(i, j, s, "x")) | 1 | 682,298 | null | 1 | 1 |
from itertools import permutations
input()
P = int(''.join(input().split()))
Q = int(''.join(input().split()))
s = sorted(permutations(str(P)))
pi = s.index(tuple(str(P)))
qi = s.index(tuple(str(Q)))
print(abs(pi - qi)) | import os, sys, re, math
import itertools
N = int(input())
P = tuple([int(n) for n in input().split()])
Q = tuple([int(n) for n in input().split()])
nums = [n for n in range(1, N + 1)]
patterns = itertools.permutations(nums, N)
i = 0
for pattern in patterns:
if pattern == P:
pi = i
if pattern == Q:
qi = i
i += 1
print(abs(pi - qi)) | 1 | 100,144,120,129,152 | null | 246 | 246 |
X=int(input())
DP=[0 for i in range(X+1)]
DP[0]=1
L=[100,101,102,103,104,105]
for s in range(6):
for x in range(X+1):
if DP[x]==1 and x+L[s]<=X:
DP[x+L[s]]=1
print(DP[X]) | X = int(input())
dp = [False]*(X+1)
dp[0] = True
for i in range(100, X+1):
if i < 106:
dp[i] = True
continue
if dp[i-100] or dp[i-101] or dp[i-102] or dp[i-103] or dp[i-104] or dp[i-105]:
dp[i] = True
print(1) if dp[len(dp)-1] else print(0) | 1 | 127,343,532,824,592 | null | 266 | 266 |
a = input().split()
if int(a[0]) <= int(a[1]) * 2:
print("0")
else:
print(int(int(a[0]) - int(a[1]) * 2)) | A, B = map(int, input().split())
if A <= 2 * B:
print('0')
else:
print(A - 2 * B) | 1 | 166,391,820,821,990 | null | 291 | 291 |
s,w = map(int, input().split())
ans = ['unsafe' if w >= s else 'safe']
print(ans[0]) | s, w = list(map(int, input().split()))
output = "safe"
if s <= w:
output = "un" + output
print(output) | 1 | 29,255,950,875,122 | null | 163 | 163 |
A, B, C, K = map(int, input().split())
ret = 0
for numberOfCards, point in [(A, 1), (B, 0), (C, -1)]:
if K >= numberOfCards:
K -= numberOfCards
ret += numberOfCards * point
else:
ret += K * point
break
print(ret)
| n, m = [int(i) for i in input().split()]
matrix = []
for ni in range(n):
matrix.append([int(a) for a in input().split()])
vector = []
for mi in range(m):
vector.append(int(input()))
b = []
for ni in range(n):
sum = 0
for mi in range(m):
sum += matrix[ni][mi] * vector[mi]
print(sum) | 0 | null | 11,420,309,126,828 | 148 | 56 |
import sys
sys.setrecursionlimit(10 ** 8)
ini = lambda: int(sys.stdin.readline())
inl = lambda: [int(x) for x in sys.stdin.readline().split()]
ins = lambda: sys.stdin.readline().rstrip()
debug = lambda *a, **kw: print("\033[33m", *a, "\033[0m", **dict(file=sys.stderr, **kw))
def solve():
n, a, b = inl()
if a > b:
a, b = b, a
if (b - a) % 2 == 0:
return (b - a) // 2
d1 = a - 1
d2 = n - b
if d1 < d2:
return d1 + 1 + (b - a) // 2
else:
return d2 + 1 + (b - a) // 2
print(solve())
| def main():
n, m = map(int, input().split())
left = 1
right = n
is_shift = False
ans = []
while left < right:
if right - left <= n // 2 and not is_shift and n % 2 == 0:
left += 1
is_shift = True
ans.append([left, right])
left += 1
right -= 1
for l in range(m):
print(*ans[l])
if __name__ == "__main__":
main()
| 0 | null | 69,056,795,512,412 | 253 | 162 |
s=str(input())
w=["SUN","MON","TUE","WED","THU","FRI","SAT"]
for i in range(7):
if w[i]==s:
print(7-i)
break | wd = ['SUN','MON','TUE','WED','THU','FRI','SAT']
s = input()
print(str(7 - wd.index(s) % 7)) | 1 | 132,629,306,263,970 | null | 270 | 270 |
N = int(input())
A = list(map(int, input().split()))
result = [0] * N
for a in A:
result[a-1] += 1
for i in range(N):
print(result[i])
| a = int(input())
x = list(map(str,input().split()))
y = reversed(x)
print(" ".join(y)) | 0 | null | 16,756,118,702,400 | 169 | 53 |
digits = [int(i) for i in list(input())]
Sum = 0
for i in digits:
Sum += i
if Sum%9 == 0:
print("Yes")
else:
print("No") | import math
import numpy as np
n,k=(int(x) for x in input().split())
a = [int(x) for x in input().split()]
for _ in range(k):
new_a = np.zeros(n+1,dtype=int)
np.add.at(new_a, np.maximum(0,np.arange(0, n)-a), 1)
np.add.at(new_a, np.minimum(n,np.arange(0, n)+a+1), -1)
a = new_a.cumsum()[:-1]
if np.all(a==n):
break
print(" ".join([str(x) for x in a])) | 0 | null | 9,851,011,855,302 | 87 | 132 |
n, W = map(int, input().split())
ab = [tuple(map(int, input().split()))for _ in range(n)]
ab.sort()
dp = [[0]*W for _ in range(n+1)]
for i in range(1, n+1):
w, v = ab[i-1]
for j in range(W):
if dp[i][j] < dp[i-1][j]:
dp[i][j] = dp[i-1][j]
if 0 <= j-w and dp[i][j] < dp[i-1][j-w]+v:
dp[i][j] = dp[i-1][j-w]+v
ans = 0
for i in range(n):
a, b = ab[i]
if ans < dp[i][W-1]+b:
ans = dp[i][W-1]+b
print(ans)
| from subprocess import*
call(('pypy3','-c',"""
n,t=[int(j) for j in input().split()]
ab=[]
ans=[]
dp=[0]*t
for i in range(n):
tmp=[int(j) for j in input().split()]
ab.append(tmp)
ab.sort()
for a,b in ab:
for i in range(t)[::-1]:
if dp[i]!=0 or i==0:
if i+a>=t:
ans.append(dp[i]+b)
else:
dp[i+a]=max(dp[i+a],dp[i]+b)
if ans:
print(max(ans))
else:
print(max(dp))
""")) | 1 | 151,686,658,415,012 | null | 282 | 282 |
A, B = map(int, input().split())
#最大公約数
def gcd(x, y):
while y:
x, y = y, x % y
return x
#最小公倍数
def lcm(x, y):
return x * y // gcd(x, y)
print(lcm(A, B))
| a,b=map(int,input().split())
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==[]:
arr.append([n,1])
return arr
a_arr = factorization(a)
b_arr = factorization(b)
a_map = {str(arr[0]):arr[1] for arr in a_arr}
b_map = {str(arr[0]):arr[1] for arr in b_arr}
factor = set(list(a_map.keys())+list(b_map.keys()))
ans = 1
for i in factor:
if str(i) in a_map.keys():
a_num = a_map[str(i)]
else:
a_num = 0
if str(i) in b_map.keys():
b_num = b_map[str(i)]
else:
b_num = 0
ans *= int(i)**(max(a_num,b_num))
print(ans) | 1 | 113,251,447,498,622 | null | 256 | 256 |
def main():
string_s = input()
string_p = input()
print('Yes') if string_p in (string_s + string_s) else print('No')
main() | s=[ord(i) for i in input()]
n=[ord(i) for i in input()]
flag=0
flack=0
for i in range(len(s)):
flack=0
if n[0]==s[i]:
flack=1
for j in range(1,len(n)):
if i+j>=len(s):
if n[j]==s[i+j-len(s)]:
flack=flack+1
else:
break
else:
if n[j]==s[i+j]:
flack=flack+1
else:
break
if flack==len(n):
flag=1
break
if flag:
print('Yes')
else:
print('No') | 1 | 1,730,805,500,652 | null | 64 | 64 |
list = list(map(int, input().split())) #i_1 i_2を取得し、iに値を入れる
print(15-list[0]-list[1]-list[2]-list[3]-list[4]) | str = input().split()
print(str.index('0')+1) | 1 | 13,520,837,713,708 | null | 126 | 126 |
s = input()
ans = s + 'es' if s[-1]=='s' else s + 's'
print(ans) | import sys
input = sys.stdin.readline
n, x, res = int(input()), 1, 0
if n & 1: print(0)
else:
n //= 2
while x < n:
x *= 5
res += n // x
print(res) | 0 | null | 59,014,843,274,950 | 71 | 258 |
X=int(input())
a=X%500
to=X//500*1000+a//5*5
print(to) | X=int(input())
ans=(X//500)*1000
X%=500
ans+=(X//5)*5
print(ans)
| 1 | 42,699,219,672,320 | null | 185 | 185 |
N=input()
total=0
for i in N:
total += int(i)
print('Yes' if total % 9 == 0 else 'No') | from collections import Counter
n = int(input())
s = Counter([str(input()) for _ in range(n)])
l = []
c = 1
for stri, count in s.items():
if count == c:
c = count
l.append(stri)
elif count > c:
c = count
l.clear()
l.append(stri)
sort_l = sorted(l)
for i in sort_l:
print(i)
| 0 | null | 37,412,555,806,080 | 87 | 218 |
p = 998244353
max = 2 * (10**5)
fact = [1,1]
facti = [1,1]
inv = [0,1]
for i in range(2, max + 1):
fact.append((fact[-1] * i) % p)
inv.append((-inv[p % i] * (p // i)) % p)
facti.append((facti[-1] * inv[-1]) % p)
def comb(n,r):
if (r < 0) or (n < r):
return 0
r = min(r, n - r)
return fact[n] * facti[r] * facti[n-r] % p
n,m,k = map(int, input().split())
ans = 0
for i in range(k+1):
a = comb(n-1,i)
b = m * pow(m-1,n-1-i,998244353)
ans += (a * b)% 998244353
print(ans%998244353) | n,m,k=map(int, input().split( ))
mod = 998244353
ans=0
if m==1:##コーナー
print(1 if k==n-1 else 0)
exit()
tmp=m*pow(m-1,n-1,mod)
m_inv=pow(m-1,mod-2,mod)
invs=[0]+[pow(i+1,mod-2,mod) for i in range(n)]
for i in range(1,k+2):
ans+=tmp
#print(ans)
tmp*=m_inv
if i<n:##?
tmp*=n-i
tmp*=invs[i]
tmp%=mod
print(ans%mod)
| 1 | 23,313,886,445,796 | null | 151 | 151 |
while True:
h, w = map(int, input().split())
if h == 0 and w == 0:
break
width = ''
for j in range(h):
if j == 0 or j == h - 1:
for i in range(w):
width += '#'
else:
for i in range(w):
if i == 0 or i == w - 1:
width += '#'
else:
width += '.'
print(width)
width = ''
print('')
| all_N = []
while True:
N = list(map(int, input().split(' ')))
if N[0] == 0 and N[0] == 0:
break
all_N.append(N)
for i in range(len(all_N)):
print('#' * all_N[i][1])
for j in range(all_N[i][0]-2):
print('#%s#' % ((all_N[i][1]-2) * '.'))
print('#' * all_N[i][1])
print('') | 1 | 822,019,934,620 | null | 50 | 50 |
s = input()
t = input()
ans = 1e+9
for si in range(len(s)):
if si + len(t) > len(s):
continue
cnt = 0
for ti in range(len(t)):
if s[si+ti] != t[ti]:
cnt += 1
ans = min(ans, cnt)
print(ans) | st = list()
while True:
a = list(map(lambda x: int(x),input().split(" ")))
if min(a[0:2]) == -1:
if max(a) == -1:
break
else:
st += {"F"}
else:
if 80 <= sum(a[0:2]):
st += {"A"}
elif 65 <= sum(a[0:2]):
st += {"B"}
elif 50 <= sum(a[0:2]):
st += {"C"}
elif 30 <= sum(a[0:2]):
if 50 <= a[2]:
st += {"C"}
else:
st += {"D"}
else:
st += {"F"}
for s in st:
print(s) | 0 | null | 2,466,469,866,120 | 82 | 57 |
suit = {"S": 0, "H": 1, "C": 2, "D": 3}
suit_keys = list(suit.keys())
deck = [[suit_keys[i] + " " + str(j + 1) for j in range(13)] for i in range(4)]
for _ in range(int(input())):
card = input().split()
deck[suit[card[0]]][int(card[1]) - 1] = ""
for i in range(4):
for j in deck[i]:
if j != "":
print(j)
| import math
def koch(d, p1, p2):
if d == 0:
return
v = [p2[0] - p1[0], p2[1] - p1[1]]
s = [p1[0] + v[0] / 3, p1[1] + v[1] / 3]
t = [p1[0] + 2 * v[0] / 3, p1[1] + 2 * v[1] / 3]
u = [p1[0] + v[0] / 2 - v[1] * math.sqrt(3) / 6, p1[1] + v[1] / 2 + v[0] * math.sqrt(3) / 6]
koch(d - 1, p1, s)
print(" ".join(map(str, s)))
koch(d - 1, s, u)
print(" ".join(map(str, u)))
koch(d - 1, u, t)
print(" ".join(map(str, t)))
koch(d - 1, t, p2)
n = int(input())
print("0 0")
koch(n, [0, 0], [100, 0])
print("100 0")
| 0 | null | 586,976,933,980 | 54 | 27 |
# coding: utf-8
input_nums = raw_input().rstrip().split()
a, b = [int(x) for x in input_nums]
menseki = a * b
syutyo = 2 * (a + b)
print menseki, syutyo | a = input().split()
c = int(a[0]) * int(a[1])
d = (int(a[0])*2) + (int(a[1])*2)
print('%d %d' %(c,d))
| 1 | 313,794,477,220 | null | 36 | 36 |
from collections import deque
# 隣り合ったマスへ移動するためのテーブル
dx = [0, 0, 1, -1]
dy = [1, -1, 0, 0]
H, W = map(int, input().split())
maze = [input() for _ in range(H)]
# 全ての"."の地点からBFSしてスタートからの各地点への移動回数(深さ)を調べ、最大のものを出力する
def solve():
ans = 0
for i in range(H):
for j in range(W):
# スタートが壁の場合
if maze[i][j] == "#":
continue
# BFSの初期化、初期条件
dist = [[-1] * W for _ in range(H)]
dist[i][j] = 0
que = deque()
que.append([i, j])
# BFSループ
while que:
y, x = que.popleft()
for k in range(4):
nx = x + dx[k]
ny = y + dy[k]
# 迷路から外れる場合
if nx >= W or nx < 0 or ny >= H or ny < 0:
continue
# 既に探索済みの場合
if dist[ny][nx] != -1:
continue
# 隣が壁の場合
if maze[ny][nx] == "#":
continue
dist[ny][nx] = dist[y][x] + 1
que.append([ny, nx])
ans = max(ans, max(max(steps) for steps in dist))
print(ans)
if __name__ == "__main__":
solve()
| while True:
n, x = map(int, input().split())
if n == 0 and x == 0:
break
c = 0
for i in range(1, int(x/3)+2):
for j in range(i+1, int(x/2)+2):
k = x - i - j
if k <= j:
break
elif k <= n:
c += 1
print(c) | 0 | null | 47,670,860,352,180 | 241 | 58 |
S = input().split()
M = int(S[0])
N = int(S[1])
a = int((M*(M-1)/2) + (N*(N-1)/2))
print(a)
| import bisect
N, M = map(int, input().split())
A = [int(x) for x in input().split()]
A.sort()
INF = 10 ** 9
A.append(INF)
left, right = 0, 2 * max(A)
while left + 1 < right:
mid = (left + right) >> 1
cnt = sum(N - bisect.bisect_left(A, mid-A[i]) for i in range(N))
if cnt >= M:
left = mid
else:
right = mid
acc = [0]
for i in range(N):
acc.append(acc[-1] + A[i])
ans = 0
cnt, min_val = 0, INF
for i in range(N):
idx = bisect.bisect_left(A, left-A[i])
cnt += N - idx
min_val = min(min_val, A[i] + A[idx])
ans += (N - idx) * A[i] + acc[N] - acc[idx]
ans -= (cnt - M) * min_val
print(ans)
| 0 | null | 76,515,795,910,612 | 189 | 252 |
from statistics import median
#import collections
#aa = collections.Counter(a) # list to list || .most_common(2)で最大の2個とりだせるお a[0][0]
from fractions import gcd
from itertools import combinations # (string,3) 3回
from collections import deque
from collections import defaultdict
import bisect
#
# d = m - k[i] - k[j]
# if kk[bisect.bisect_right(kk,d) - 1] == d:
#
#
#
# pythonで無理なときは、pypyでやると正解するかも！！
#
#
import sys
sys.setrecursionlimit(10000000)
mod = 10**9 + 7
def readInts():
return list(map(int,input().split()))
def I():
return int(input())
dic = {'SUN':0,'MON':1,'TUE':2,'WED':3,'THU':4,'FRI':5,'SAT':6}
print(7 - dic[input()])
| import sys
readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)
def main():
S = input()
p = ["SUN", "MON", "TUE", "WED", "THU", "FRI", "SAT"]
print(7 - p.index(S))
if __name__ == '__main__':
main()
| 1 | 132,815,973,171,762 | null | 270 | 270 |
color = input()
kosuu = input()
trashc = input()
_ = 0
color = color.split()
kosuu = kosuu.split()
trashc = trashc.split()
while True:
if(trashc[0] == color[_]):
kosuu[_] = int(kosuu[_]) -1
break
_= _+1
print(" ".join(map(str, kosuu)))
| import math
A,B,C,D = map(int, input().split())
Taka=A/D
Aoki=C/B
if math.ceil(Taka)>=math.ceil(Aoki):
print("Yes")
else:
print("No") | 0 | null | 50,956,924,929,878 | 220 | 164 |
a, b, c = map(int, input().split())
def black (a,b,c):
if a+b+c >= 22:
return "bust"
else:
return "win"
print(black(a,b,c)) | A,B,C = map(int,input().split())
if A+B+C <= 21:
print("win")
else:
print("bust") | 1 | 118,661,239,230,130 | null | 260 | 260 |
# bit全探索 典型といえば典型（問題文の意味がよくわからんので読解力コンテスト）
n = int(input())
syogen = []
for i in range(n):
syogen.append([])
for _ in range(int(input())):
syogen[i].append(list(map(int, input().split())))
ans = 0
for bit in range(1 << n):
p = ["不親切"] * n
ng = False
# bitの立っているのを正直者と仮定
for i in range(n):
if bit >> i & 1 == 1:
# 上位bit = 小さいインデックス、になる（ように実装してしまった わかりづらい
p[n - i - 1] = "正直者"
for i in range(n):
if p[i] == "不親切":
# まあ不親切な人間のことなんて聞かなくていい
continue
for s in syogen[i]:
if p[s[0] - 1] == "正直者" and s[1] == 1:
# 証言と一致する
continue
elif p[s[0] - 1] == "不親切" and s[1] == 0:
# 証言と一致する
continue
else:
# 証言と一致しない
ng = True
break
if not ng:
ans = max(ans, p.count("正直者"))
print(ans)
| s = 0
a = 0
for i in map(int, input().split()):
s += max(0, (4 - i) * 100000)
if i == 1:
a += 1
if a == 2:
s += 400000
print(s) | 0 | null | 130,982,219,091,360 | 262 | 275 |
N = int(input())
S = str(input())
cnt = 1
for i in range(1,N):
if S[i] == S[i-1]:
pass
else:
cnt += 1
print(cnt)
| n = int(input())
s = str(input())
ans = n
for i in range(1,n):
if s[i-1] == s[i]:
ans -= 1
print(ans) | 1 | 169,903,960,661,680 | null | 293 | 293 |
import math
T_1, T_2 = map(int, input().split())
A_1, A_2 = map(int, input().split())
B_1, B_2 = map(int, input().split())
ans = 0
if T_1 * A_1 + T_2 * A_2 == T_1 * B_1 + T_2 * B_2:
print("infinity")
else:
# 速いほうをＡと仮定
if T_1 * A_1 + T_2 * A_2 < T_1 * B_1 + T_2 * B_2:
A_1, A_2, B_1, B_2 = B_1, B_2, A_1, A_2
if A_1 < B_1:
sa_12 = T_1 * A_1 + T_2 * A_2 - (T_1 * B_1 + T_2 * B_2) # 1サイクルでできる差
sa_1 = -T_1 * A_1 + T_1 * B_1 # T_1でできる差
if sa_1 % sa_12 == 0:
ans = int((sa_1 / sa_12)*2)
else:
kari = math.ceil(sa_1 / sa_12)
ans = (kari-1)*2+1
print(ans)
| def main():
t1,t2=map(int,input().split())
a1,a2=map(int,input().split())
b1,b2=map(int,input().split())
if a1<b1:
a1,b1,a2,b2 = b1,a1,b2,a2
d1 = a1*t1
d2 = b1*t1
dd1 = d1 - d2
d1 += a2*t2
d2 += b2*t2
if d1 == d2:
return "infinity"
dd2 = d1 - d2
if dd1 * dd2 > 0:
return 0
else:
d1 += a1*t1
d2 += b1*t1
dd3 = d1 - d2
if dd2 * dd3 > 0:
return 1
else:
d1 += a2*t2
d2 += b2*t2
dd4 = d1 - d2
if dd3 * dd4 > 0:
return 2
else:
if dd1 > dd3:
if dd1 % (dd1-dd3) == 0:
return (dd1 // (dd1-dd3) )*2
else:
return (dd1 // (dd1-dd3) )*2+1
else:
if dd2 % (dd2-dd4) == 0:
return (dd2 // (dd2-dd4) )*2 +1
else:
return (dd2 // (dd2-dd4) )*2+2
print(main()) | 1 | 131,072,257,653,080 | null | 269 | 269 |
import sys
readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)
def main():
A = list(map(int, readline().split()))
if sum(A) >= 22:
print("bust")
else:
print("win")
if __name__ == '__main__':
main()
| a1,a2,a3=map(int,input().split())
if a1+a2+a3<=21 :
print("win")
else :
print("bust") | 1 | 118,656,411,206,132 | null | 260 | 260 |
import fractions
import math
N,M = map(int,input().split())
A = list(map(int,input().split()))
A = [ a//2 for a in A ]
flg = True
times = None
for i,a in enumerate(A):
t = 0
while a%2==0:
a //= 2
t += 1
if times is None:
times = t
else:
if times != t:
flg = False
break
A[i] = a
M >>= times
if not flg:
print(0)
exit()
lcm = 1
for i in range(N):
lcm = lcm * A[i] // fractions.gcd(lcm, A[i])
if lcm > M:
print(0)
exit()
print(math.ceil((M // lcm)/2)) | from fractions import gcd
n, m = map(int, input().split())
a = list(map(int, input().split()))
b = [a[i]//2 for i in range(n)]
lcm_a = 1
for i in range(n):
lcm_a = (lcm_a * b[i]) // gcd(lcm_a, b[i])
for i in range(n):
if (lcm_a//b[i]) % 2 == 0:
print(0)
exit()
if m < lcm_a:
print(0)
else:
m -= lcm_a
print(1 + m // (lcm_a*2)) | 1 | 102,154,431,514,652 | null | 247 | 247 |
# Function for calc
def match(n, a, b):
if (b - a)% 2 == 0:
print((b-a)/2)
else:
if (n - b) >= a:
print((a)+((b-(a+1))/2))
else:
x=(n-b+1)
print(x+((n-(a+x))/2))
# Run match
in_string = raw_input()
[N, A, B] = [int(v) for v in in_string.split()]
match(N, A, B)
| import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
n, a, b = map(int, input().split())
if abs(a - b) % 2 == 0:
print(abs(a - b) // 2)
else:
small, big = min(a, b), max(a, b)
print(min(
(small - 1) + 1 + ((big - (small - 1) - 1 - 1) // 2),
(n - big) + 1 + ((n - (small + (n - big) + 1)) // 2)
))
| 1 | 109,769,999,828,510 | null | 253 | 253 |
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
def main():
N = int(readline())
cnt = 0
ans = -1
for _ in range(N):
x, y = map(int, readline().split())
if x == y:
cnt += 1
ans = max(ans, cnt)
else:
cnt = 0
if ans >=3:
print('Yes')
else:
print('No')
if __name__ == '__main__':
main()
| n = int(input())
ans = "No"
count = 0
for i in range(n):
D1,D2 = map(int,input().split())
count=count+1 if D1==D2 else 0
ans="Yes" if count>=3 else ans
print(ans) | 1 | 2,500,596,484,092 | null | 72 | 72 |
n = int(input())
x = list(map(int, input().split()))
y = list(map(int, input().split()))
d = [abs(x[i] - y[i]) for i in range(n)]
for i in range(1,4):
print('{0:f}'.format(sum(j ** i for j in d) ** (1 / i)))
print('{0:f}'.format(max(d))) | import math
n = int(input())
x = list(map(int, input().split()))
y = list(map(int, input().split()))
def p1(x, y, n):
D = []
for i in range(n):
D.append(abs(x[i] - y[i]))
return sum(D)
def p2(x, y, n):
D = []
for i in range(n):
D.append(abs(x[i] - y[i]))
D[i] *= D[i]
Sum = sum(D)
return math.sqrt(Sum)
def p3(x, y, n):
D = []
for i in range(n):
D.append(abs(x[i] - y[i]))
D[i] = D[i] * D[i] * D[i]
Sum = sum(D)
return math.pow(Sum, 1 / 3)
def pX(x, y, n):
D = []
for i in range(n):
D.append(abs(x[i] - y[i]))
return max(D)
print('{:6f}'.format(p1(x, y, n)))
print('{:6f}'.format(p2(x, y, n)))
print('{:6f}'.format(p3(x, y, n)))
print('{:6f}'.format(pX(x, y, n)))
| 1 | 213,137,960,530 | null | 32 | 32 |
while 1:
n,x=map(int,input().split())
if n+x==0:break
c=0
for i in range(3,n+1):
for j in range(2,x-i):
if x-i-j<j<i:
c+=1
print(c) | ans = [f'{x} {y + 1}' for x in "SHCD" for y in range(13)]
n = int(input())
for i in range(n):
a = input()
ans.remove(a)
for v in ans:
print(v)
| 0 | null | 1,161,143,720,608 | 58 | 54 |
class UnionFind:
def __init__(self, n):
self.par = [i for i in range(n+1)]
self.rank = [0] * (n+1)
self.size = [1] * (n+1)
# 検索
def find(self, x):
if self.par[x] == x:
return x
else:
self.par[x] = self.find(self.par[x])
return self.par[x]
# 併合
def union(self, x, y):
x = self.find(x)
y = self.find(y)
if x == y:
return
if self.rank[x] < self.rank[y]:
self.par[x] = y
self.size[y] += self.size[x]
else:
self.par[y] = x
self.size[x] += self.size[y]
if self.rank[x] == self.rank[y]:
self.rank[x] += 1
# 同じ集合に属するか判定
def same_check(self, x, y):
return self.find(x) == self.find(y)
n,m = map(int,input().split())
uf = UnionFind(n)
for i in range(m):
a,b = map(int,input().split())
uf.union(a,b)
print(max(uf.size)) | N, K = map(int, input().split())
A = list(map(int, input().split()))
def is_ok(n):
cnt = 0
for a in A:
if n >= a:
continue
cnt += a // n
return cnt <= K
def meguru_bisect(ng, ok):
while (abs(ok - ng) > 1):
mid = (ok + ng) // 2
if is_ok(mid):
ok = mid
else:
ng = mid
return ok
print(meguru_bisect(0, 10**9+1))
| 0 | null | 5,208,117,704,340 | 84 | 99 |
class Dice:
def __init__(self,faces):
self.faces = tuple(faces)
def N(self):
self.faces = (self.faces[1], self.faces[5], self.faces[2],
self.faces[3], self.faces[0], self.faces[4])
def S(self):
self.faces = (self.faces[4], self.faces[0], self.faces[2],
self.faces[3], self.faces[5], self.faces[1])
def W(self):
self.faces = (self.faces[2], self.faces[1], self.faces[5],
self.faces[0], self.faces[4], self.faces[3])
def E(self):
self.faces = (self.faces[3], self.faces[1], self.faces[0],
self.faces[5], self.faces[4], self.faces[2])
def number(self, face_id):
return self.faces[face_id - 1]
dice = Dice(list(map(int, input().split())))
x=input()
for i in x:
if i == "N":
dice.N()
elif i == "S":
dice.S()
elif i == "W":
dice.W()
elif i == "E":
dice.E()
print(dice.number(1)) | K = ord(input())
print(chr(K+1)) | 0 | null | 46,154,925,091,200 | 33 | 239 |
from collections import Counter, deque
N, K = map(int, input().split())
A = list(map(int, input().split()))
INF = 10**18
cnt = Counter()
cnt[0] = 1
que = deque([0])
sumR = 0
ans = 0
for right, a in enumerate(A, start=1):
if len(que) >= K:
cnt[que.popleft()] -= 1
sumR = (a + sumR) % K
D = (sumR - right) % K
ans += cnt[D]
cnt[D] += 1
que.append(D)
print(ans)
| from collections import defaultdict
n,k = map(int,input().split())
a = list(map(int,input().split()))
ruisekiwa = [0 for _ in range(n+1)]
for i in range(n):
ruisekiwa[i+1] = (ruisekiwa[i] + a[i] - 1) % k
dp = defaultdict(lambda: 0)
ans = 0
tmp = 0
for i in range(n+1):
tmp += 1
if tmp > k:
dp[ruisekiwa[i-k]] -= 1
ans += dp[ruisekiwa[i]]
dp[ruisekiwa[i]] += 1
print(ans) | 1 | 137,681,100,414,400 | null | 273 | 273 |
'''
def main():
a = input()
if a < 'a':
print("A")
else:
print("a")
'''
def main():
a = input()
if a.islower():
print("a")
else:
print("A")
if __name__ == "__main__":
main() | alp=input()
if alp==alp.upper():
print("A")
elif alp==alp.lower():
print("a") | 1 | 11,333,829,544,990 | null | 119 | 119 |
def resolve():
s = input()
if s == s[::-1]:
s_1 = s[:len(s)//2]
s_2 = s[(len(s)+1)//2:]
if (s_1 == s_1[::-1]) and (s_2 == s_2[::-1]):
print('Yes')
else:
print('No')
else:
print('No')
resolve() | import sys
import numpy as np # noqa
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
K = int(readline())
C = readline().rstrip().decode()
a = 0 # a: 赤から白に変える操作
b = 0 # b: 白から赤に変える操作
for i in range(len(C)):
if C[i] == 'R':
a += 1
mn = a
for i in range(len(C)):
if C[i] == 'R':
a -= 1
else:
b += 1
mn = min(mn, min(a, b) + abs(a-b))
print(mn)
| 0 | null | 26,469,361,454,900 | 190 | 98 |
def division(x,y):
if y == 0:
return x
return division(y, x%y)
x,y=map(int,input().split())
kotae = division(x,y)
print(kotae) | data = list(map(int,input().split()))
if(data[0] < data[1]): data[0],data[1] = data[1],data[0]
def gcd(x,y):
return x if y == 0 else gcd(y,x%y)
print(gcd(data[0],data[1]))
| 1 | 7,725,348,060 | null | 11 | 11 |
import sys
input = sys.stdin.readline
a = input()
n = int(a)
s = [[0] * 9 for _ in range(9)]
for i in range(1, n+1):
j = str(i)
k = int(j[0])
l = int(j[-1])
if l != 0:
s[k-1][l-1] += 1
ans = 0
#print(s)
for i in range(1, 10):
for j in range(1, 10):
ans += s[i-1][j-1] * s[j-1][i-1]
print(ans)
| from math import factorial
n=int(input())
d=[[0]*10 for _ in range(10)]
for i in range(1,n+1):
j=i
while True:
if j//10:j//=10
else:break
d[j][i%10]+=1
ans=0
for i in range(10):
for j in range(10):
ans+=d[i][j]*d[j][i]
print(ans) | 1 | 86,520,666,799,260 | null | 234 | 234 |
nums = input().split()
a = int(nums[0])
b = int(nums[1].replace('.', ''))
result = str(a * b)
if len(result) < 3:
print(0)
else:
print(result[:-2]) | def main(istr, ostr):
x, y = istr.readline().strip().split()
a = int(x)
b0, _, b1, b2 = y
b0, b1, b2 = list(map(int, [b0, b1, b2]))
c = a * (100 * b0 + 10 * b1 + b2)
res = c // 100
print(res, file=ostr)
if __name__ == "__main__":
import sys
main(sys.stdin, sys.stdout)
| 1 | 16,532,912,210,248 | null | 135 | 135 |
A,B,C,K = map(int,input().split())
if K<=A:
Ans = K
elif K<=A+B:
Ans = A
elif K<=A+B+C:
Ans = A-(K-A-B)
else:
Ans = A-C
print(Ans)
|
a,b,c,k = map(int,input().split())
ans = min(a,k)
k -= ans
if k == 0:
print(ans)
exit(0)
k -= min(b,k)
if k == 0:
print(ans)
exit(0)
ans -= min(c,k)
print(ans) | 1 | 21,885,056,547,754 | null | 148 | 148 |
def main():
X = int(input())
tmp = 0
cnt = 0
while True:
tmp += X
cnt += 1
tmp %= 360
if tmp == 0:
break
return cnt
print(main())
| a=0
while True:
z=str(input())
if z == '0' :
break
for i in z:
k=int(i)
a+=k
print(a)
a=0 | 0 | null | 7,410,898,255,462 | 125 | 62 |
n = int(input())
#a, b = map(int, input().split())
#l = list(map(int, input().split()))
#s = input()
for i in range(1,10):
q, mod = divmod(n,i)
if mod == 0:
if (q >= 1 and q <= 9):
print("Yes")
exit()
print("No")
| import sys
N = int(sys.stdin.readline())
for i in range(1, 10):
for j in range(1, 10):
if i * j == N:
print("Yes")
sys.exit()
print("No") | 1 | 159,759,356,347,022 | null | 287 | 287 |
target = int(input()) + 1
fib = [0 for n in range(target + 1)]
for i in range(target + 1):
if i == 0:
continue
elif i == 1:
fib[i] = 1
else:
fib[i] = fib[i - 1] + fib[i - 2]
print(fib[target]) | a=[0]*45
def Fib(n):
if n == 0:
a[0]=1
return 1
elif n == 1:
a[1]=1
return 1
else:
if a[n]==0:
a[n]=Fib(n-1)+Fib(n-2)
return a[n]
else:
return a[n]
n=int(input())
print(Fib(n))
| 1 | 2,039,601,088 | null | 7 | 7 |
S, T = [input() for _ in range(2)]
count = 0
for i, j in zip(S, T):
count += i != j
print(count)
| s = input()
t = input()
counter = 0
for index, character in enumerate(s):
if t[index] != character:
counter += 1
print(counter) | 1 | 10,526,276,178,338 | null | 116 | 116 |
#!/usr/bin/env python3
import sys
from typing import Any, Callable, Deque, Dict, List, Mapping, Optional, Sequence, Set, Tuple, TypeVar, Union
# import time
# import math
# import numpy as np
# import scipy.sparse.csgraph as cs # csgraph_from_dense(ndarray, null_value=inf), bellman_ford(G, return_predecessors=True), dijkstra, floyd_warshall
# import random # random, uniform, randint, randrange, shuffle, sample
# import string # ascii_lowercase, ascii_uppercase, ascii_letters, digits, hexdigits
# import re # re.compile(pattern) => ptn obj; p.search(s), p.match(s), p.finditer(s) => match obj; p.sub(after, s)
# from bisect import bisect_left, bisect_right # bisect_left(a, x, lo=0, hi=len(a)) returns i such that all(val<x for val in a[lo:i]) and all(val>-=x for val in a[i:hi]).
# from collections import deque # deque class. deque(L): dq.append(x), dq.appendleft(x), dq.pop(), dq.popleft(), dq.rotate()
# from collections import defaultdict # subclass of dict. defaultdict(facroty)
# from collections import Counter # subclass of dict. Counter(iter): c.elements(), c.most_common(n), c.subtract(iter)
# from datetime import date, datetime # date.today(), date(year,month,day) => date obj; datetime.now(), datetime(year,month,day,hour,second,microsecond) => datetime obj; subtraction => timedelta obj
# from datetime.datetime import strptime # strptime('2019/01/01 10:05:20', '%Y/%m/%d/ %H:%M:%S') returns datetime obj
# from datetime import timedelta # td.days, td.seconds, td.microseconds, td.total_seconds(). abs function is also available.
# from copy import copy, deepcopy # use deepcopy to copy multi-dimentional matrix without reference
# from functools import reduce # reduce(f, iter[, init])
# from functools import lru_cache # @lrucache ...arguments of functions should be able to be keys of dict (e.g. list is not allowed)
# from heapq import heapify, heappush, heappop # built-in list. heapify(L) changes list in-place to min-heap in O(n), heappush(heapL, x) and heappop(heapL) in O(lgn).
# from heapq import nlargest, nsmallest # nlargest(n, iter[, key]) returns k-largest-list in O(n+klgn).
# from itertools import count, cycle, repeat # count(start[,step]), cycle(iter), repeat(elm[,n])
# from itertools import groupby # [(k, list(g)) for k, g in groupby('000112')] returns [('0',['0','0','0']), ('1',['1','1']), ('2',['2'])]
# from itertools import starmap # starmap(pow, [[2,5], [3,2]]) returns [32, 9]
# from itertools import product, permutations # product(iter, repeat=n), permutations(iter[,r])
# from itertools import combinations, combinations_with_replacement
# from itertools import accumulate # accumulate(iter[, f])
# from operator import itemgetter # itemgetter(1), itemgetter('key')
# from fractions import Fraction # Fraction(a, b) => a / b ∈ Q. note: Fraction(0.1) do not returns Fraciton(1, 10). Fraction('0.1') returns Fraction(1, 10)
def main():
mod = 1000000007 # 10^9+7
inf = float('inf') # sys.float_info.max = 1.79e+308
# inf = 2 ** 63 - 1 # (for fast JIT compile in PyPy) 9.22e+18
sys.setrecursionlimit(10**6) # 1000 -> 1000000
def input(): return sys.stdin.readline().rstrip()
def ii(): return int(input())
def isp(): return input().split()
def mi(): return map(int, input().split())
def mi_0(): return map(lambda x: int(x)-1, input().split())
def lmi(): return list(map(int, input().split()))
def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
def li(): return list(input())
L = list(map(int, reversed(li())))
n = len(L)
payment = L[:]
payment.append(0)
ans = 0
carry = False
for i in range(n):
if 5 < payment[i] or (5 == payment[i] and 5 <= payment[i+1]):
ans += 9 - L[i] if carry else 10 - L[i]
payment[i] = 0
payment[i+1] += 1
carry = True
else:
carry = False
# print(L)
# print(list(reversed(payment)))
ans += sum(payment)
# ans = 0
# ans += sum(payment)
# a = int(''.join(list(map(str, reversed(L)))))
# b = int(''.join(list(map(str, reversed(payment)))))
# # print(f"required {a}, paid: {b}")
# ans += sum(map(int, list(str(b - a))))
print(ans)
if __name__ == "__main__":
main()
| N = list(map(int, input()))
# print(N)
ans = 0
DP = [0] *2
DP[0] = 0
DP[1] = 1
for i in N:
a, b = DP[0] ,DP[1]
DP[0] = a + i if a+i < b +(10-i) else b +(10-i)
DP[1] = a + i+1 if a + i+1 < b + (9-i) else b + (9-i)
# print(DP)
print(DP[0] if DP[0] <= DP[1]+1 else DP[1] +1) | 1 | 70,668,871,554,698 | null | 219 | 219 |
def main():
input()
A = list(map(int, input().split()))
cusum = [0] * len(A)
cusum[-1] = A[-1]
if A[0] > 1:
print(-1)
return
for i in range(len(A)-2, -1, -1):
cusum[i] = cusum[i+1] + A[i]
pre_node = 1
ans = 1
for i in range(1, len(A)):
node = (pre_node - A[i-1]) * 2
if node < A[i]:
print(-1)
return
pre_node = min(node, cusum[i])
ans += pre_node
print(ans)
if __name__ == '__main__':
main()
| def main():
n = int(input())
a = list(map(int,input().split()))
ki = [0 for i in range(n+1)]
ki[0] = 1
for i in range(1,n+1):
ki[i] = 2*(ki[i-1] - a[i-1])
if ki[i]<=0:
print(-1)
return
if ki[-1]<a[-1]:
print(-1)
return
ki[-1] = a[-1]
for i in range(n):
ki[n-1-i] = min(ki[n-1-i],ki[n-i]+a[n-1-i])
print(sum(ki))
if __name__ == "__main__":
main()
| 1 | 18,816,300,452,962 | null | 141 | 141 |
from collections import deque
infinity=10**6
import sys
input = sys.stdin.readline
N,u,v = map(int,input().split())
u -= 1
v -= 1
G=[[] for i in range(N)]
for i in range(N-1):
A,B = map(int,input().split())
A -= 1
B -= 1
G[A].append(B)
G[B].append(A)
ends = []
for i in range(N):
if len(G[i]) == 1:
ends.append(i)
#幅優先探索
def BFS (s):
queue = deque()
d = [infinity]*N
queue.append(s)
d[s]= 0
while len(queue)!=0:
u = queue.popleft()
for v in G[u]:
if d[v] == infinity:
d[v] = d[u]+1
queue.append(v)
return d
d_nigeru = BFS(u)
d_oni = BFS(v)
ans=0
for u in ends:
if d_nigeru[u] < d_oni[u]:
ans = max(ans,d_oni[u]-1)
print(ans) | N,u,v=map(int,input().split())
from collections import deque
g=[[] for _ in range(N)]
for i in range(N-1):
A,B=map(int,input().split())
g[A-1].append(B-1)
g[B-1].append(A-1)
def bfs(n):
stack=deque([])
depth=[-1]*N
depth[n-1]=0
stack.append(n-1)
while stack:
a=stack.popleft()
for b in g[a]:
if depth[b]==-1:
depth[b]=depth[a]+1
stack.append(b)
return depth
U=bfs(u)
V=bfs(v)
List=[]
for i in range(N):
if len(g[i])==1 and U[i]<V[i]:
List.append(i)
ans=0
for i in List:
ans=max(ans,V[i]-1)
print(ans) | 1 | 117,138,810,345,660 | null | 259 | 259 |
from collections import defaultdict
N, K = map(int, input().split())
d = {i: [] for i in range(1, N+1)}
for _ in range(K):
candy = int(input())
for i in map(int, input().split()):
d[i].append(candy)
print(list(d.values()).count([]))
| n,k = map(int,input().split())
sunuke = []
for _ in range(k):
d = input()
tmp = [int(s) for s in input().split()]
for i in range(len(tmp)):
sunuke.append(tmp[i])
print(n - len(set(sunuke))) | 1 | 24,660,824,800,420 | null | 154 | 154 |
from itertools import accumulate
n,k = map(int,input().split())
l = [0] + list(map(int,input().split()))
for i in range(n):
l[i+1] = (l[i+1]+1)/2
acc = list(accumulate(l))
# print(acc)
maxi = 0
for i in range(n-k+1):
maxi = max(maxi,acc[i+k]-acc[i])
print(maxi) | n, k = map(int,input().split())
a = list(map(int, input().split()))
dst = [1] #今まで行った町（最初も含む）のリスト
dsts = set(dst) #今まで行った町（最初も含む）のset
twn = 1 #テレポーター転送先
for _ in range(k):
if a[twn - 1] in dsts: #テレポーター転送先が今まで行った町setに入っていたら（そこから先の転送はループする）
index = dst.index(a[twn - 1]) #今まで行った町リストでのテレポーター転送先のindex取得
ld = len(dst[:index]) #ループする前の長さとループ部分の周期を求める
cyc = len(dst[index:])
print(dst[(ld - 1) + (k + 1 - ld) % cyc] if (k + 1 - ld) % cyc != 0 else dst[-1])
exit()
else: #テレポーター転送先が今まで行った町setに入っていなかったら
dst.append(a[twn - 1]) #入っていなかったら今まで行った町リストに追加
dsts.add(a[twn - 1])
twn = a[twn - 1] #テレポーター転送先の更新
print(dst[-1]) | 0 | null | 48,660,661,308,662 | 223 | 150 |
import math
a, b, n = list(map(int, input().split()))
output = 0
if n < b:
output = math.floor(a * n / b)
else:
output = math.floor(a * (b-1) / b)
print(output) | import sys
s=input().split()
n=int(s[0]);m=int(s[1]);l=int(s[2])
a=[[0 for j in range(m)]for i in range(n)]
b=[[0 for j in range(l)]for i in range(m)]
c=[[0 for j in range(l)]for i in range(n)]
for i in range(n):
t=input().split()
for j in range(m):
a[i][j]=int(t[j])
for i in range(m):
t=input().split()
for j in range(l):
b[i][j]=int(t[j])
for i in range(n):
for j in range(l):
for k in range(m):
c[i][j]+=a[i][k]*b[k][j]
sys.stdout.write("{0}".format(c[i][j]))
if j==l-1:
sys.stdout.write("\n")
else:
sys.stdout.write(" ") | 0 | null | 14,808,198,819,148 | 161 | 60 |
N=int(input())
for x in range(1,N+1):
if int(1.08*x)==N:
print(x)
break
if x==N:
print(":(")
| # cook your dish here
a,b,c = map(int, input().split())
k = int(input())
c1, c2 = 0, 0
while b<=a:
b=b*2
c1 = c1 + 1
while c <= b:
c=c*2
c2 = c2 +1
if c1 + c2 <= k:
print('Yes')
else:
print('No')
| 0 | null | 66,217,045,936,668 | 265 | 101 |
import sys
input = sys.stdin.readline
#l = list(map(int, input().split()))
#import numpy as np
#arr = np.array([int(i) for i in input().split()])
'''
a,b=[],[]
for i in range(n):
A, B = map(int, input().split())
a.append(A)
b.append(B)'''
n=int(input())
a,x=[],[]
for i in range(n):
A = int(input())
a.append(A)
B=[]
for j in range(A):
B.append(list(map(int, input().split())))
x.append(B)
ma=0
for i in range(2**n):
now=0
flg=True
e=[0]*n
for j in range(n):
if (i>>j)&1:
now+=1
e[j]=1
for j in range(n):
#print(e)
if (i>>j)&1:
if e[j]==0:
flg=False
break
elif not flg:
break
for k in range(a[j]):
"""if e[x[j][k][0]-1]==-1:
if x[j][k][1] and
e[x[j][k][0]-1]=x[j][k][1]"""
if (e[x[j][k][0]-1]==0 and x[j][k][1]==1) or (e[x[j][k][0]-1]==1 and x[j][k][1]==0):
flg=False
break
if flg and ma<now:
ma=now
#print(ma)
print(ma)
| S=input()
Sa=len(S)
a="x"*Sa
print(a) | 0 | null | 97,292,888,884,392 | 262 | 221 |
from sys import stdin
import sys
a = stdin.readline().rstrip()
b = stdin.readline().rstrip()
count = 0
for i in range(len(a)):
if a[i] != b[i]: count = count + 1
print (count)
| first_string = input()
second_string = input()
count = 0
for x, y in zip(first_string, range(len(first_string))):
if(second_string[y] != x):
count += 1
print(count) | 1 | 10,479,008,732,694 | null | 116 | 116 |
def main():
s,w = map(int,input().split())
if s <= w:
print('unsafe')
else:
print('safe')
main() | def main():
S, W = map(int, input().split())
un = "un" if W >= S else ""
print(un + "safe")
if __name__ == "__main__":
main()
| 1 | 29,259,616,348,710 | null | 163 | 163 |
x = [1,2,3,4,5,6,7,8,9]
y = [1,2,3,4,5,6,7,8,9]
for w in x :
for c in y :
print(w,"x",c,"=",w*c,sep="")
| a, b, c = map(int, input().split())
DivisorCount = 0
DivideNum = a
for var in range(a, b+1):
if c % DivideNum == 0:
DivisorCount += 1
DivideNum += 1
print(DivisorCount) | 0 | null | 271,217,049,672 | 1 | 44 |
a, b, c, d = map(int, input().split())
if b >= 0 and d >= 0 and a <= 0 and c <= 0:# - + - +
e = b*d
f = a*c
if e > f:
print(e)
else:
print(f)
elif a >= 0 and b >= 0 and c >= 0 and d >= 0: #+ + + +
print(b*d)
elif a <= 0 and b <= 0 and c <= 0 and d <= 0: #- - - -
print(a*c)
elif a >= 0 and b >= 0 and c <= 0 and d <= 0: #+ + - -
print(a*d)
elif a >= 0 and b >= 0 and c <= 0 and d >= 0: # + + - +
print(b*d)
elif a <= 0 and b <= 0 and c >= 0 and d >= 0: # - - + +
print(b*c)
elif a <= 0 and b <= 0 and c <= 0 and d >= 0: # - - - +
print(a*c)
elif a <= 0 and b >= 0 and c >= 0 and d >= 0: # - + + +
print(b*d)
elif a <= 0 and b >= 0 and c <= 0 and d <= 0: # - + - -
print(a*c) | a,b,c,d = map(int,input().split(' '))
matrix = []
matrix.append(a*c)
matrix.append(a*d)
matrix.append(b*d)
matrix.append(b*c)
matrix = sorted(matrix, reverse=True)
print(str(matrix[0])) | 1 | 3,085,204,943,760 | null | 77 | 77 |
#E問題
N, M, K = map(int, input().split())
MOD = 998244353
P = MOD
Y = max(N, M)
inv_t = [0]+[1]
for i in range(2, Y):
inv_t += [inv_t[P % i] * (P - int(P / i)) % P]
#print(inv_t)
if K == N - 1:
ans = 1
for i in range(N):
ans = ans * M % MOD
print(ans % MOD)
quit()
#if M == 1:
#if
#print("1")
# quit()
# M * ((M - 1) ** (N - L - 1)) * combination(N-1, L)のLを0からKまで足した総和が答え
B = [1] * N
ans1 = 1
for i in range(1, N):
ans1 = (ans1 * (M - 1)) % MOD
B[i] = (ans1 * M) % MOD
ans = 0
ans2 = 1
#X = 1
for i in range(K + 1):
if i == 0:
X = 1
else:
X = (X * (N - i) * inv_t[i]) % MOD
ans2 = X * B[N - 1 - i] % MOD
ans += ans2
ans = ans % MOD
print(ans)
|
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()
| 1 | 23,229,581,247,220 | null | 151 | 151 |
s=input()
p=input()
s=s+s
a=s.find(p)
if a==-1:
print('No')
else:
print('Yes')
| n = int( input() )
a = list( map(int, input().split()) )
x = 0
for i in a:
x ^= i
print( * list( map( lambda y: x^y , a ) ) ) | 0 | null | 7,134,114,959,566 | 64 | 123 |
name = str(input())
print(name[0:3])
| str = input()
str_length = len(str)
import random
start_num = random.randint(0,str_length-3)
print(str[start_num:start_num+3])
| 1 | 14,824,047,751,370 | null | 130 | 130 |
N=int(input())
A=list(map(int,input().split()))
count=0
i=N-1
while i>0:
j=0
while j<i:
if A[N-1-j]<A[N-2-j]:
(A[N-1-j],A[N-2-j])=(A[N-2-j],A[N-1-j])
count+=1
#print(' '.join(map(str,A)))
j+=1
i-=1
print(' '.join(map(str,A)))
print(count) | print((int(input())) ** 3)
| 0 | null | 143,804,031,760 | 14 | 35 |
import sys
k = int(input())
a = dict()
cnt = 0
base = 0
while True:
cnt += 1
base = (base*10+7)%k
if base == 0:
break
if base in a:
cnt = -1
break
else:
a[base] = 1
print(cnt) | n, k = map(int, input().split())
lst = [0] + list(map(int, input().split()))
dic = {1:0}
loc = 1
for i in range(1, k + 1):
loc = lst[loc]
if loc not in dic:
dic[loc] = i
else:
span = i - dic[loc]
initial = dic[loc]
z = (k - initial) % span
for j in range(z):
loc = lst[loc]
print(loc)
exit()
print(loc) | 0 | null | 14,377,706,645,280 | 97 | 150 |
N = int(input())
t = 0
max_run_length = 0
for _ in range(N):
D1, D2 = map(int, input().split())
if D1 == D2:
t += 1
else:
t = 0
max_run_length = max(max_run_length, t)
if max_run_length >= 3:
print('Yes')
else:
print('No')
| n=int(input())
alist=[0]*n
for i in range(n):
a,b=map(int, input().split())
if a==b:
alist[i]=alist[max(i-1,0)]+1
if max(alist)>=3:
print('Yes')
else:
print('No')
| 1 | 2,478,472,302,268 | null | 72 | 72 |
n=input()
ans=0
if n=="0":
print("Yes")
else:
for i in n:
ans+=int(i)
if ans%9==0:
print("Yes")
else:
print("No") | n=list(input())
a=0
for i in n:
a+=int(i)
if a%9==0:
print('Yes')
else:
print('No') | 1 | 4,367,708,646,860 | null | 87 | 87 |
from itertools import product
N=int(input())
datas=[]
for i in range(N):
A=int(input())
for j in range(A):
x,y=map(int,input().split())
datas.append((i,x-1,y)) #誰が 誰に どう判断した？
#print(datas)
ans=0
for i in product([0,1],repeat=N):
ok=True
for j in datas:
if i[j[0]]==1 and i[j[1]]!=j[2]:
ok=False
break
if ok:
ans=max(ans,sum(i))
print(ans) | N = int(input())
Assertions = []
ansnum = 0
for i in range(N):
b = []
n = int(input())
for j in range(n):
xi,yi = map(int,input().split())
b.append([xi-1,yi])
Assertions.append(b)
for i in range(2**N):
select = []
ans = [0 for _ in range(N)]
index = []
flag = True
for j in range(N):
if ((i >> j) & 1):
select.append(Assertions[j])
index.append(j)
ans[j] = 1
for idx in index:
for Assert in Assertions[idx]:
if ans[Assert[0]] != Assert[1]:
flag = False
break
if flag:
ansnum = max(ansnum,len(index))
print(ansnum) | 1 | 121,781,955,048,952 | null | 262 | 262 |
N = int(input())
alp = {"a":1, "b":2, "c":3, "d":4, "e":5, "f":6, "g":7, "h":8, "i":9, "j":10}
alp2 = "abcdefghij"
def solve(N):
ans = []
if N == 1:
ans.append("a")
else:
pre = solve(N-1)
for i in range(len(pre)):
tmp = sorted(pre[i])
num = alp[tmp[len(tmp)-1]]
for j in range(num+1):
ans.append(pre[i]+alp2[j])
return ans
f_ans = solve(N)
f_ans.sort()
for i in range(len(f_ans)):
print(f_ans[i])
| # https://atcoder.jp/contests/panasonic2020/submissions/12881278
# D - String Equivalence
import sys
sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7
def resolve():
n = int(input())
def dfs(S, available):
if len(S) == n:
print("".join(S))
return
for i in range(available + 1):
S.append(chr(97 + i))
dfs(S, max(available, i + 1))
S.pop()
dfs([], 0)
if __name__ == '__main__':
resolve()
| 1 | 52,475,734,722,180 | null | 198 | 198 |
N = int(input())
dp = [[0] * 9 for _ in range(9)]
for i in range(1, N+1):
if i % 10 != 0:
si = str(i)
start = int(si[0])
fin = int(si[-1])
dp[start-2][fin-2] += 1
ans = 0
for i in range(9):
for j in range(9):
ans += dp[i][j] * dp[j][i]
print(ans)
| print(int(int(input()) == 0)) | 0 | null | 44,833,406,396,468 | 234 | 76 |
N = int(input())
S = set(input() for _ in range(N))
print(len(S))
| s=input().split()
print(s[1]+s[0])
| 0 | null | 66,521,273,572,220 | 165 | 248 |
t=input()
h=t/3600
m=(t%3600)/60
s=t%60
print "%d:%d:%d" %(h,m,s) | S = int(input())
S = S % (24 * 3600)
hour = S // 3600
S %= 3600
minutes = S // 60
S %= 60
seconds = S
print("%d:%d:%d" % (hour, minutes, seconds))
| 1 | 335,137,453,148 | null | 37 | 37 |
# 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))
N, K = map(int, input().split())
A = list(map(int, input().split()))
# B = list(map(int, input().split()))
# tree = [[] for _ in range(N + 1)]
# B_C = [list(map(int,input().split())) for _ in range(M)]
# S = 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.insert(0, 0)
cnt = [0] * (N + 1)
j = 1
times_s = 0
times_e = 0
cycle = 0
for i in range(N + 1):
if i == K:
print(j)
sys.exit()
cnt[j] += 1
if cnt[j] == 2:
times_e = i
cycle = j
break
j = A[j]
j = 1
for i in range(N + 1):
if j == cycle:
times_s = i
break
j = A[j]
#print(A, cnt)
#print(times_s, times_e, cycle)
K_eff = (K - times_s) % (times_e - times_s)
for i in range(N + 1):
if i == K_eff:
print(j)
sys.exit()
j = A[j] | from collections import Counter
N, K = map(int,input().split())
A = list(map(int,input().split()))
i = k = 0
B = [1]
while k <= 10 ** 6:
i = A[i] - 1
B.append(i + 1)
k += 1
S = Counter(B)
idx = S.most_common(1)[0][0]
i = k = cnt = 0
k_s = None
while k < 10 ** 6:
if B[k] == idx and cnt == 1:
k_s = k
break
elif B[k] == idx:
k_f = k
cnt += 1
k += 1
if k_s and k_s < K:
k_max = (K - B.index(idx)) % (k_s - k_f) + B.index(idx)
else:
k_max = K
i = k = 0
while k < k_max:
i = A[i] - 1
k += 1
print(i + 1) | 1 | 22,632,752,744,030 | null | 150 | 150 |
def main():
l, r, d = map(int, input().split())
res = r // d - (l-1) // d
print(res)
if __name__ == '__main__':
main()
| l, r, d = map(int, input().split())
ans = 0
for i in range(l, r+1):
if i % d == 0: ans += 1
print(ans) | 1 | 7,568,242,888,822 | null | 104 | 104 |
N = input ()
P = '0168'
H = '24579'
if N[-1] in P:
print ('pon')
elif N[-1] in H:
print ('hon')
else:
print ('bon') | import math
import collections
#2,4,5,7,9 hon
#0,1,6,8 pon
#3, bon
N = int(input())
a = N%10
B = [0,1,6,8]
if a == 3:
print('bon')
elif a in B:
print('pon')
else:
print('hon') | 1 | 19,327,378,585,800 | null | 142 | 142 |
import sys
for line in sys.stdin:
n,x = map(int,line.split())
if n==0 and x==0:
break
_range = list(range(1,n+1))
conb = []
for i in _range[::-1]:
d = x - i
if i - 1 <= 0:
continue
for j in _range[:i-1][::-1]:
d2 = d - j
if j - 1 <= 0:
continue
for k in _range[:j-1][::-1]:
if d2 - k == 0:
conb.append((i,j,k))
print(len(conb)) | s = input()
if ('A' in s) and ('B' in s):
print('Yes')
else:
print('No')
| 0 | null | 28,112,674,340,412 | 58 | 201 |
l = []
while True:
i = str(input())
if i == '0':
break
else:
l.append(i)
t = 0
for i in l:
t += 1
print('Case '+str(t)+': '+i)
| N = int(input())
A = list(map(int, input().split()))
s = sum(A)
res = 0
mod = 10**9 + 7
for i in range(N-1):
s -= A[i]
res += s*A[i]
print(res%mod) | 0 | null | 2,142,303,989,000 | 42 | 83 |
import numpy as np
# 初期入力
mod = 10**9 +7
ans =0
N =int(input())
A =list(map(int,input().split()))
A_np =np.array(A,dtype=np.int64)
# xor 各桁の０と1の数を求め
for i in range(60):
c =np.count_nonzero(A_np &1)
ans +=2**i*c*(N-c)
A_np >>=1
print(ans %mod) | N = int(input())
As = list(map(int, input().split()))
P = 10**9 + 7
rlt = 0
pw = 1
for i in range(61):
c0 = 0
c1 = 0
for j in range(N):
a = As[j]
if a % 2 == 0:
c0 += 1
else:
c1 += 1
As[j] = a//2
rlt += c0*c1*pw % P
rlt %= P
pw *= 2
print(rlt) | 1 | 122,577,759,033,532 | null | 263 | 263 |
x,n=map(int,input().split())
if n==0:
print(x)
exit()
p=[int(y) for y in input().split()]
a=0
for i in range(101):
if x-a not in p:
print(x-a)
break
elif x+a not in p:
print(x+a)
break
a+=1 | import sys
sys.setrecursionlimit(10**7)
input = sys.stdin.readline
INF = 10**9
# 個数制限なしナップザック問題
h,n = map(int, input().split())
dp = [INF]*(h+1)
dp[0] = 0
for i in range(n):
a,b = map(int, input().split())
for j in range(h):
nj = min(a+j, h)
dp[nj] = min(dp[nj], dp[j]+b)
print(dp[-1])
| 0 | null | 47,468,390,689,542 | 128 | 229 |
from collections import deque
INF = 1e9
def BFS(n, adj):
d = [INF] * N
d[0] = 0
next_v = deque([0]) # ?¬??????????????????????
while next_v:
u = next_v.popleft()
for v in adj[u]:
if d[v] == INF:
d[v] = d[u] + 1
next_v.append(v)
return d
N = int(input())
Adj = [None] * N
for i in range(N):
u, k, *vertex = [int(i)-1 for i in input().split()]
Adj[u] = vertex
distance = BFS(N, Adj)
for i, di in enumerate(distance, start = 1):
if di == INF:
print(i, -1)
else:
print(i, di) | n = int(input())
G = [[0]]+[list(map(int, input().split()))[2:] for _ in range(n)]
# print(G)
from collections import deque
d = deque([1])
dist = [10**10 for _ in range(n+1)]
dist[1] = 0
while len(d) != 0:
now = d.popleft()
# print(now)
for nexte in G[now]:
if dist[now] +1 < dist[nexte]:
dist[nexte] = dist[now] + 1
d.append(nexte)
for i,d in enumerate(dist[1:]):
if d != 10**10:
print(i+1,d)
else:
print(i+1,-1)
| 1 | 4,367,001,590 | null | 9 | 9 |
import math
#A , B = map(float,input().split())
a , b = input().split()
a = int(a)
b = round(100*float(b))
#ans = int (A *(B*100)/100)
print(a*b//100)
| a,b= input().split()
a = int(a)
b,c = map(int,b.split("."))
print(a*(100*b+c)//100)
| 1 | 16,651,861,796,088 | null | 135 | 135 |
n,x,y = map(int, input().split())
g = [0]*(n)
for i in range(1,n+1):
for j in range(1,i):
e = abs(y-i)+1+abs(x-j)
f = i-j
g[min(e,f)]+=1
for i in g[1:]:
print(i) | X = int(input())
def is_prime(n):
if n == 2: return True
if n < 2 or n%2 == 0: return False
m = 3
while m*m <= n:
if n%m == 0: return False
m += 2
return True
while 1:
if is_prime(X):
print(X)
exit()
X += 1 | 0 | null | 74,709,921,209,700 | 187 | 250 |
def resolve():
L = list(map(int, input().split()))
print("Yes" if len(L)-1 == len(set(L)) else "No")
if '__main__' == __name__:
resolve() | from collections import deque
import math
import sys
x,y,a,b,c = list(map(int,sys.stdin.readline().split()))
p = sorted(list(map(int,sys.stdin.readline().split())), reverse=True)
q = sorted(list(map(int,sys.stdin.readline().split())), reverse=True)
r = sorted(list(map(int,sys.stdin.readline().split())), reverse=True)
eat=[]
if x<len(p):
[eat.append(red) for red in p[:x]]
else:
[eat.append(red) for red in p]
if y<len(q):
[eat.append(green) for green in q[:y]]
else:
[eat.append(green) for green in q]
[eat.append(apple) for apple in r]
eat = sorted(eat, reverse=True)
#print(sum(eat[:x + y]))
ans = 0
for taste in eat[:x + y]:
ans += taste
print(ans)
| 0 | null | 56,521,640,641,892 | 216 | 188 |
from sys import stdin
import math
from functools import reduce
n,k = [int(x) for x in stdin.readline().rstrip().split()]
m = n % k
print(min([m, k-m])) | 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)
| 0 | null | 44,622,835,870,592 | 180 | 194 |
S, W = [int(n) for n in input().split()]
print('unsafe' if S <= W else 'safe') | t_p, t_a, a_p, a_a = map(int, input().split())
while True:
a_p -= t_a
if a_p <= 0 :
print('Yes')
exit()
t_p -= a_a
if t_p <= 0 :
print('No')
exit()
| 0 | null | 29,536,717,586,652 | 163 | 164 |
#!/usr/bin/env python
# -*- coding: utf-8 -*-
def main():
N = int(input())
A = [(i, v) for i, v in enumerate(map(int, input().split()))]
values = [[0] * (N + 1) for _ in range(N + 1)]
A.sort(key=lambda x:-x[1])
for i, (p, v) in enumerate(A):
for j in range(i + 1):
left = abs((p - j) * v)
right = abs((N - 1 - (i - j) - p) * v)
values[i + 1][j + 1] = max(values[i][j] + left, values[i + 1][j + 1])
values[i + 1][j] = max(values[i][j] + right, values[i + 1][j])
print(max(values[-1]))
if __name__ == '__main__':
main()
| N = int(input())
A = list(map(int, input().split()))
t = 0
for c in A:
t ^= c
ans = []
for b in A:
ans.append(t^b)
print(*ans) | 0 | null | 23,054,672,974,540 | 171 | 123 |
from collections import deque
# データの入力
N = int(input())
DG = {}
for i in range(N):
tmp = input().split()
if int(tmp[1]) != 0:
DG[i] = [int(x)-1 for x in tmp[2:]]
else:
DG[i] = []
result = {}
is_visited = {key: False for key in range(N)}
# bfs
# 初期queue
que = deque([(0, 0)]) # 必要なものはnodeidと原点からの距離
while que:
nodeid, cost = que.popleft() # 先入れ先出し
result[nodeid] = cost
is_visited[nodeid] = True # この文は最初の1for目しか意味ないんだけどなんかうまい方法ないのか
for nextnode in DG[nodeid]:
if is_visited[nextnode]:
pass
else: # 未訪問のものについては探索候補に入れる
que.append((nextnode, cost + 1))
is_visited[nextnode] = True # 探索候補に入れた瞬間に訪問管理しないと重複を生じる場合がある
for i in range(N):
if is_visited[i]:
print(i + 1, result[i])
else:
print(i+1, -1)
| def divider(A,N):
"""
リストA内の全要素が全て2**nで割れるときTrueを返す
"""
cnt_list=[]
same=True
for n in range(N):
tmp=A[n]
cnt=0
while tmp%2==0:
tmp//=2
cnt+=1
cnt_list.append(cnt)
if n>=1 and cnt!=cnt_list[n-1]:
same=False
break
return same
def cal_minX(A,N,M):
"""
hit A内の数全てでXが割り切れ、かつ商が奇数だったらTrue
"""
max_A=max(A)
if divider(A,N)==False:
no_ans=True
minX=0
else:
fin=False
no_ans=False
i=0
while fin==False:
coef=2*i+1
if max_A*coef>M:
fin=True
no_ans=True
else:
hit=True
for n in range(N):
if max_A*coef%A[n]==0:
if (max_A*coef//A[n])%2==1:
pass
else:
hit=False
break
else:
hit=False
break
if hit==False:
i+=1
else:
fin=True
minX=max_A*coef
return no_ans,minX
def main():
#input
N,M=map(int,input().strip().split())
A=list(map(int,input().strip().split()))
A=list(map(lambda x:x//2,A))
#題意を満たす最小のXを求める。
no_ans,minX=cal_minX(A,N,M)
#1-Mの中にminXの奇数倍数がいくつあるか調べる
if no_ans:
return 0
else:
if M//minX%2==1:
return M//minX//2+1
else:
return M//minX//2
if __name__=="__main__":
print(main()) | 0 | null | 51,021,841,544,140 | 9 | 247 |
n = int(input())
a = list(map(int, input().split()))
org = [[i, a[i]] for i in range(n)]
lis = sorted(org, key=lambda x: x[1], reverse=True)
dp = [[0 for i in range(n+1)] for j in range(n+1)]
for i in range(0, n, 1):
for j in range(0, n-i, 1):
if i + j == n:
break
dp[i+1][j] = max(dp[i+1][j], dp[i][j] + lis[i+j][1]*abs(lis[i+j][0] - i))
dp[i][j+1] = max(dp[i][j+1], dp[i][j] + lis[i+j][1]*abs(lis[i+j][0] - (n-j-1)))
ans = 0
for i in range(n):
for j in range(n):
ans = max(ans, dp[i][j])
print(ans) | n = int(input())
xs = list(enumerate(map(int, input().split())))
xs.sort(key=lambda x: x[1])
xs.reverse()
dp = [[0 for _ in range(n + 1)] for _ in range(n + 1)]
for i in range(1, n + 1):
(j, a) = xs[i - 1]
for x in range(0, i + 1):
y = i - x
if x == 0:
dp[x][y] = dp[x][y - 1] + a * (n - y - j)
elif y == 0:
dp[x][y] = dp[x - 1][y] + a * (j - x + 1)
else:
dp[x][y] = max(dp[x][y - 1] + a * (n - y - j),
dp[x - 1][y] + a * (j - x + 1))
print(max([dp[i][n - i] for i in range(n + 1)])) | 1 | 33,595,976,420,632 | null | 171 | 171 |
import numpy as np
a,b,x=map(int,input().split())
if x<=a*a*b/2:
y=2*x/(a*b)
print(360/((2*np.pi)/np.arctan(b/y)))
else:
y=2*x/(a**2)-b
print(360/((2*np.pi)/np.arctan((b-y)/a))) | from math import *
a,b,x=map(int,input().split())
x=x/a
if x<=a*b/2:
t=2*x/b
c=sqrt(b**2+t**2)
ans=90-degrees(asin(t/c))
else:
t=2*(a*b-x)/a
c=sqrt(a**2+t**2)
ans=90-degrees(asin(a/c))
print(ans) | 1 | 163,651,315,680,412 | null | 289 | 289 |
X,N=map(int,input().split())
*P,=sorted(map(int,input().split()))
from bisect import bisect_left
if N==0:
t=X
else:
l = bisect_left(P, X)
for i in range(100):
t=X-i
if l-i<0 or t!=P[l-i]: break
t=X+i
if N<=l+i or t!=P[l+i]: break
print(t) | X, N = list(map(int, input().split()))
p = set(map(int, input().split()))
dist = 0
if N == 0:
print(X)
dist_max = -2
else:
dist_max = max(abs(max(p) - X), abs(min(p) - X))
while dist <= dist_max+1:
if (X - dist in p) and (X + dist in p):
dist += 1
continue
if not (X - dist in p):
print(X - dist)
break
elif not (X + dist in p):
print(X + dist)
break | 1 | 14,183,445,529,400 | null | 128 | 128 |
card = []
suit = ["S","H","C","D"]
for s in suit:
for i in range(1,14):
card.append(s + " " + str(i))
n = int(input())
for i in range(n):
card.remove(input())
for c in card:
print(c) | import math
n=int(input())
print((n-math.floor(n/2))/n) | 0 | null | 88,680,110,949,188 | 54 | 297 |
#coding:utf-8
num = input()
print num * num * num | n,k,c = map(int,input().split())
s = list(input())
L = []
R = []
i = -1
j = n
for ki in range(k):
while i < n:
i += 1
if s[i] == 'o':
L += [i]
i += c
break
for ki in range(k):
while 0 <= j:
j -= 1
if s[j] == 'o':
R += [j]
j -= c
break
for i in range(k):
if L[i] == R[-i-1] :
print(L[i]+1) | 0 | null | 20,411,087,139,390 | 35 | 182 |
while True:
a, b, c = map(int, input().split())
if a == -1 and b == -1 and c == -1:
break
if a == -1 or b == -1 or a + b < 30:
print("F")
elif a + b >= 80:
print("A")
elif a + b >= 65:
print("B")
elif a + b >= 50 or c >= 50:
print("C")
else:
print("D")
| while True:
m, f, r = map(int, raw_input().split())
if (m+f+r) == -3:
break
if (m * f) < 0:
print "F"
elif (m + f) >= 80:
print 'A'
elif 65 <= (m + f) < 80:
print 'B'
elif 50 <= (m + f) < 65:
print 'C'
elif 30 <= (m + f) < 50:
if r < 50:
print 'D'
else:
print 'C'
elif (m + f) < 30:
print 'F' | 1 | 1,214,268,729,810 | null | 57 | 57 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.