code1
stringlengths 16
427k
| code2
stringlengths 16
427k
| similar
int64 0
1
| pair_id
int64 6.82M
181,637B
⌀ | question_pair_id
float64 101M
180,471B
⌀ | code1_group
int64 2
299
| code2_group
int64 2
299
|
|---|---|---|---|---|---|---|
x = int(input())
print(2*x*3.14) | N = int(input())
z = []
w = []
for i in range(N):
x,y = map(int,input().split())
z.append(x+y)
w.append(x-y)
z_max = max(z)
z_min = min(z)
w_max = max(w)
w_min = min(w)
print(max(z_max-z_min,w_max-w_min)) | 0 | null | 17,301,080,736,186 | 167 | 80 |
a, b = map(int,input().split())
print(sorted([str(a)*b,str(b)*a])[0])
| import sys
for i in sys.stdin.readlines()[:-1]:
h,w = map(int,i.strip().split())
for i in range(h):
for j in range(w):
if (i+j) % 2 == 0:
print('#',end='')
else:
print('.',end='')
print()
print() | 0 | null | 42,578,412,589,204 | 232 | 51 |
n = int(input())
stones = input()
r = stones.count("R")
w = stones.count("W")
ans = stones[0:r].count("W")
print(ans) | a, b, c = map(int, input().split())
k = int(input())
ans = False
for i in range(k + 1):
for j in range(k-i+1):
for l in range(k-i-j+1):
aa = a * pow(2,i)
bb = b * pow(2,j)
cc = c * pow(2,l)
# print("{0} {1} {2}".format(aa,bb,cc))
if(aa < bb and bb < cc):
ans = True
if(ans):
print("Yes")
else:
print("No") | 0 | null | 6,593,324,372,380 | 98 | 101 |
n = int(input())
a = [int(x) for x in input().split()]
res = 0
for i in range(n):
for j in range(i+1,n):
res += a[i] * a[j]
print(res) | n = int(input())
P = list(map(int, input().split( )))
mas = P[0]
ans = 1
for i in range(n-1):
if mas >= P[i+1]:
ans += 1
mas = min(mas,P[i+1])
print(ans) | 0 | null | 127,113,263,055,076 | 292 | 233 |
n,m = input().split()
n=int(n)
m=float(m)*100+0.5
m=int(m)
ans = int(n*m//100)
print(ans) | num = list(map(int,input().split()))
c = 0
for i in range(num[0],num[1]+1):
if(num[2]%i == 0): c = c+1
print(c)
| 0 | null | 8,479,555,625,628 | 135 | 44 |
h,w,k=map(int,input().split())
b=[input()for _ in range(h)]
ans=[w*[0]for _ in range(h)]
f=[1]*h
j=-1
bb=[]
for i in range(h):
if "#"in b[i]:
f[i]=0
j=i
if len(bb)==0:continue
for k in bb:ans[k]=ans[j]
bb=[]
else:
if j<0:bb.append(i)
else:ans[i]=ans[j]
a=1
for i in range(h):
if f[i]:continue
fl=False
for j in range(w):
if b[i][j]=="#":
if fl:a+=1
fl=True
ans[i][j]=a
if fl:a+=1
for i in ans:print(*i) | n = int(input())
a = list(map(int, input().split()))
ans = [0]*n
for i in range(n):
ans[a[i]-1] += i+1
ans[a[i]-1] = str(ans[a[i]-1])
print(" ".join(ans)) | 0 | null | 161,449,881,028,652 | 277 | 299 |
N = int(input())
ls = list(map(int,input().split()))
cnt = [0] * (N+1)
for i in range(N-1):
cnt[ls[i]] += 1
for i in range(1,N+1):
print(cnt[i]) | N = int(input())
A = [int(i) for i in input().split()]
ans = [0 for i in range(N)]
for i in A:
ans[i-1] += 1
for i in ans:
print(i) | 1 | 32,644,728,728,190 | null | 169 | 169 |
n,m = map(int, input().split())
#a = list(map(int, input().split()))
class UnionFind:
def __init__(self,n):
self.par=[i for i in range(n)]
self.siz=[1]*n
def root(self,x):
while self.par[x]!=x:
self.par[x]=self.par[self.par[x]]
x=self.par[x]
return x
def unite(self,x,y):
x=self.root(x)
y=self.root(y)
if x==y:
return False
if self.siz[x]<self.siz[y]:
x,y=y,x
self.siz[x]+=self.siz[y]
self.par[y]=x
return True
def is_same(self,x,y):
return self.root(x)==self.root(y)
def size(self,x):
return self.siz[self.root(x)]
uni = UnionFind(n)
for i in range(m):
a,b = map(int, input().split())
uni.unite(a-1, b-1)
cnt = [0]*(n)
for i in range(n):
cnt[uni.root(i)] = 1
print(sum(cnt)-1) | def cmb(n, r, p):
if r < 0 or n < r:
return 0
r = min(r, n - r)
return fact[n] * fact_inv[r] * fact_inv[n - r] % p
n, k = map(int, input().split())
a = sorted(list(map(int, input().split())), reverse=True)
p = 10 ** 9 + 7
fact = [1, 1] # fact[n] = (n! mod p)
fact_inv = [1, 1] # fact_inv[n] = ((n!)^(-1) mod p)
inv = [0, 1] # fact_invの計算用
for i in range(2, n + 1):
fact.append(fact[-1] * i % p)
inv.append((-inv[p % i] * (p // i)) % p)
fact_inv.append(fact_inv[-1] * inv[-1] % p)
i = 0
sum_max = 0
sum_min = 0
while n - i - 1 >= k - 1:
cnt = cmb(n - i - 1, k - 1, p)
sum_max += a[i] * cnt
sum_min += a[n - i - 1] * cnt
# print(i, a[i] * cnt, a[n - i - 1] * cnt)
i += 1
ans = (sum_max - sum_min) % p
print(ans)
| 0 | null | 48,780,857,994,308 | 70 | 242 |
def main():
a,b = map(int,input().split())
if a > b:
print('a > b')
elif a < b:
print('a < b')
elif a == b:
print('a == b')
else:
print('error')
if __name__=="__main__":
main()
| a, b = map(int, input().split())
if a > b:
print('a > b')
elif a < b:
print('a < b')
else: print ('a == b')
| 1 | 354,350,264,510 | null | 38 | 38 |
import sys
input = sys.stdin.readline
MAX = 2*10**6+100
MOD = 10**9+7
fact = [0]*MAX #fact[i]: i!
inv = [0]*MAX #inv[i]: iの逆元
finv = [0]*MAX #finv[i]: i!の逆元
fact[0] = 1
fact[1] = 1
finv[0] = 1
finv[1] = 1
inv[1] = 1
for i in range(2, MAX):
fact[i] = fact[i-1]*i%MOD
inv[i] = MOD-inv[MOD%i]*(MOD//i)%MOD
finv[i] = finv[i-1]*inv[i]%MOD
def C(n, r):
if n<r:
return 0
if n<0 or r<0:
return 0
return fact[n]*(finv[r]*finv[n-r]%MOD)%MOD
K = int(input())
S = input()[:-1]
L = len(S)
ans = 0
for i in range(L, L+K+1):
ans += C(i-1, L-1)*pow(25, i-L, MOD)*pow(26, L+K-i, MOD)
ans %= MOD
print(ans) | K = int(input())
S = input()
N = len(S)
MOD = 10 ** 9 + 7
# 逆元の前計算
factorial = [1, 1]
inverse = [1, 1]
invere_base = [0, 1]
for i in range(2, K + N + 1):
factorial.append((factorial[-1] * i) % MOD)
invere_base.append((-invere_base[MOD % i] * (MOD // i)) % MOD)
inverse.append((inverse[-1] * invere_base[-1]) % MOD)
def nCr(n, r):
if (r < 0 or r > n):
return 0
r = min(r, n - r)
return factorial[n] * inverse[r] * inverse[n - r] % MOD
ans = 0
for i in range(K + 1):
ans += pow(25, i, MOD) * nCr(i + N - 1, N - 1) * pow(26, K - i, MOD) % MOD
ans %= MOD
print(ans % MOD)
| 1 | 12,903,028,281,520 | null | 124 | 124 |
def input_int():
return map(int, input().split())
def one_int():
return int(input())
def one_str():
return input()
def many_int():
return list(map(int, input().split()))
import math
from decimal import Decimal
A, B = input().split()
# A=int(A)
# B=float(B)
temp = Decimal(A)*Decimal(B)
print(int(math.floor(temp))) | import sys
import heapq
sys.setrecursionlimit(10 ** 8)
input = sys.stdin.readline
def main():
N, K = [int(x) for x in input().split()]
A = [int(x) for x in input().split()]
MOD = 10 ** 9 + 7
plus = []
minus = []
for a in A:
if a >= 0:
heapq.heappush(plus, -a)
else:
heapq.heappush(minus, a)
ans = 1
# 絶対マイナスになる場合
if len(plus) < K - min((K - K % 2), (len(minus) - len(minus) % 2)):
plus = []
minus = []
for a in A:
if a >= 0:
heapq.heappush(plus, a)
else:
heapq.heappush(minus, -a)
while K > 0:
if plus:
x = plus[0]
else:
x = float("inf")
if minus:
y = -minus[0]
else:
y = float("inf")
if abs(x) <= abs(y):
ans *= x
if plus:
heapq.heappop(plus)
else:
ans *= y
if minus:
heapq.heappop(minus)
ans %= MOD
K -= 1
print(ans)
else:
while K > 0:
if K >= 2 and len(minus) >= 2 and len(plus) >= 2:
x1 = plus[0]
x2 = plus[1]
y1 = minus[0]
y2 = minus[1]
if x1 * x2 <= y1 * y2:
y1 = heapq.heappop(minus)
y2 = heapq.heappop(minus)
ans *= (y1 * y2)
ans %= MOD
K -= 2
else:
x1 = -heapq.heappop(plus)
ans *= x1
ans %= MOD
K -= 1
elif K >= 2 and len(minus) >= 2:
y1 = heapq.heappop(minus)
y2 = heapq.heappop(minus)
ans *= (y1 * y2)
ans %= MOD
K -= 2
else:
x = -heapq.heappop(plus)
ans *= x
ans %= MOD
K -= 1
print(ans % MOD)
if __name__ == '__main__':
main()
| 0 | null | 13,022,375,855,748 | 135 | 112 |
lst = list(input())
tmp = 0
ans = 0
for i in lst:
if i == "R":
tmp = tmp + 1
ans = max(ans, tmp)
else:
tmp = 0
print(ans) | import re
n = input()
if len(re.findall("2|4|5|7|9", n[-1])) > 0:
print("hon")
elif len(re.findall("0|1|6|8", n[-1])) > 0:
print("pon")
else:
print("bon")
| 0 | null | 12,068,457,589,620 | 90 | 142 |
N, K = map(int, input().split(' '))
print(min(N % K, abs(N % K - K))) | N, K = map(int, input().split(' '))
rst = 0
rst = min(N % K, abs(N % K - K))
print(rst) | 1 | 39,390,063,939,748 | null | 180 | 180 |
a,b,c = input().split()
if a==b and b==c:
print('No')
elif a==b or b==c or c==a:
print('Yes')
else:
print('No') | if len(set(map(int, input().split()))) == 2:
print('Yes')
else:
print('No') | 1 | 68,403,085,502,880 | null | 216 | 216 |
class COM:
def __init__(self, n: int, mod: int):
self.n = n
self.mod = mod
self.fact = [0] * (n + 1)
self.factinv = [0] * (n + 1)
self.inv = [0] * (n + 1)
self.fact[0] = self.fact[1] = 1
self.factinv[0] = self.factinv[1] = 1
self.inv[1] = 1
for i in range(2, n + 1):
self.fact[i] = (self.fact[i - 1] * i) % mod
self.inv[i] = (-self.inv[mod % i] * (mod // i)) % mod
self.factinv[i] = (self.factinv[i - 1] * self.inv[i]) % mod
def get_cmb(self, n: int, k: int):
if (k < 0) or (n < k):
return 0
k = min(k, n - k)
return self.fact[n] * self.factinv[k] % self.mod * self.factinv[n - k] % self.mod
def solve():
n, k = map(int, input().split())
MOD = 10 ** 9 + 7
com = COM(n, MOD)
ans = 0
for i in range(min(n, k + 1)):
ans += com.get_cmb(n, i) * com.get_cmb(n - 1, i)
ans %= MOD
print(ans)
if __name__ == '__main__':
solve()
| n = int(input())
l = list(map(int, input().split()))
ans = 0
for i in range(n):
for ii in range(i+1, n):
ans += l[i]*l[ii]
print(ans) | 0 | null | 117,433,285,400,288 | 215 | 292 |
A, B, C, K = (int(x) for x in input().split())
AB = A + B
if K < A:
print(K)
elif AB < K:
print(A - (K-AB))
else:
print(A)
| a = list(map(int, input().split()))
if a[3] <= a[0]:
print(a[3])
elif a[3] <= a[0] + a[1]:
print(a[0])
else:
print(a[0] - (a[3] - a[0] -a[1])) | 1 | 21,919,082,559,650 | null | 148 | 148 |
H, W, K = map(int, input().split())
S = [''] * H
for i in range(H):
S[i] = input()
A = [[0] * W] * H
bg = 1
inflg = 0
outcnt = 1
for i in range(H):
if '#' not in S[i]:
if inflg == 0:
outcnt += 1
else:
A[i] = A[i-1]
print(" ".join(str(k) for k in A[i]))
else:
inflg += 1
for j in range(S[i].find('#')):
A[i][j] = bg
for j in range(S[i].find('#'),W):
if S[i][j] == '#':
A[i][j] = bg
bg += 1
else:
A[i][j] = A[i][j-1]
if inflg == 1:
for s in range(outcnt):
print(" ".join(str(k) for k in A[i]))
else:
print(" ".join(str(k) for k in A[i]))
| N, M, K = map(int, input().split())
chess = [input() for i in range(N)]
ans = [[0 for i in range(M)] for j in range(N)]
index = 0
def ok(r, h, t):
for i in range(h, t+1):
if ans[r][i] or chess[r][i] == '#':
return False
return True
def color(r, h, t):
for i in range(h, t+1):
ans[r][i] = index
# mother fucker
for i in range(N):
j = 0
while j < M:
if chess[i][j] == '.':
j += 1
continue
index += 1
l = j - 1
while l >= 0 and chess[i][l] == '.' and ans[i][l] == 0:
l -= 1
l += 1
r = j + 1
while r < M and chess[i][r] == '.' and ans[i][r] == 0:
r += 1
r -= 1
# [l,r]
# color
color(i, l, r)
for k in range(i-1, -1, -1):
if ok(k, l, r):
color(k, l, r)
else:
break
for k in range(i+1, N):
if ok(k, l, r):
color(k, l, r)
else:
break
j = r + 1
for i in range(N):
for j in range(M-1):
print(ans[i][j], end='')
print(' ', end='')
print(ans[i][M-1], end='')
print("")
| 1 | 144,283,931,724,562 | null | 277 | 277 |
a = int(input())
res = a > 29 and 'Yes' or 'No'
print(res)
| a = int(input())
ans = a >= 30 and 'Yes' or 'No'
print(ans) | 1 | 5,737,481,806,810 | null | 95 | 95 |
import sys
input = sys.stdin.readline
class Combination: # 計算量は O(n_max + log(mod))
def __init__(self, n_max, mod=10**9+7):
self.mod = mod
f = 1
self.fac = fac = [f]
for i in range(1, n_max+1): # 階乗(= n_max !)の逆元を生成
f = f * i % mod # 動的計画法による階乗の高速計算
fac.append(f) # fac は階乗のリスト
f = pow(f, mod-2, mod) # 階乗から階乗の逆元を計算。フェルマーの小定理より、 a^-1 = a^(p-2) (mod p) if p = prime number and p and a are coprime
# python の pow 関数は自動的に mod の下での高速累乗を行ってくれる
self.facinv = facinv = [f]
for i in range(n_max, 0, -1): # 上記の階乗の逆元から階乗の逆元のリストを生成（＝ facinv ）
f = f * i % mod
facinv.append(f)
facinv.reverse()
def __call__(self, n, r): # self.C と同じ
if not 0 <= r <= n: return 0
return self.fac[n] * self.facinv[r] % self.mod * self.facinv[n-r] % self.mod
def H(self, n, r): # (箱区別:〇 ボール区別:× 空箱:〇) 重複組み合わせ nHm
if (n == 0 and r > 0) or r < 0: return 0
return self.fac[n+r-1] * self.facinv[r] % self.mod * self.facinv[n-1] % self.mod
n, k = map(int, input().split())
MOD = 10**9 + 7
C = Combination(n)
k = min(k,n-1)
res = 0
for l in range(k+1):
res += C(n,l)*C.H(n-l,l)
print(res%MOD)
| def resolve():
S = list(input())
T = list(input())
cnt = 0
for i in range(len(S)):
if S[i] != T[i]:
cnt += 1
print(cnt)
if '__main__' == __name__:
resolve() | 0 | null | 38,923,029,791,968 | 215 | 116 |
import copy
n = int(input())
a = input().split()
b = copy.deepcopy(a)
for i in range(n):
for j in range(n - 1 - i):
if int(a[j][1]) > int(a[j + 1][1]):
tmp = a[j]
a[j] = a[j + 1]
a[j + 1] = tmp
ra = " ".join(a)
print(ra)
print("Stable")
for i in range(n - 1):
minj = i
for j in range(i + 1, n):
if int(b[j][1]) < int(b[minj][1]):
minj = j
if minj != i:
tmp = b[i]
b[i] = b[minj]
b[minj] = tmp
rb = " ".join(b)
print(rb)
if ra == rb:
print("Stable")
else:
print("Not stable") | C = input()
num = ord(C)
print(chr(num+1)) | 0 | null | 45,996,473,157,180 | 16 | 239 |
s = raw_input()
p = raw_input()
slen = len(s)
plen = len(p)
flag = False
for i in xrange(len(s)):
j = 0
while(j < plen and s[(i+j)%slen] == p[j]):
j += 1
if (j == plen):
flag = True
if(flag):
print "Yes"
else:
print "No" | def getN():
return int(input())
def getNM():
return map(int, input().split())
def getList():
return list(map(int, input().split()))
from collections import defaultdict, deque
from sys import exit
import math
import copy
from bisect import bisect_left, bisect_right
from heapq import *
import sys
# sys.setrecursionlimit(1000000)
INF = 10 ** 17
MOD = 1000000007
from fractions import *
def inverse(f):
# return Fraction(f.denominator,f.numerator)
return 1 / f
def combmod(n, k, mod=MOD):
ret = 1
for i in range(n - k + 1, n + 1):
ret *= i
ret %= mod
for i in range(1, k + 1):
ret *= pow(i, mod - 2, mod)
ret %= mod
return ret
MOD = 10 ** 9 + 7
def solve():
n = getN()
bit_array = [[0, 0] for i in range(61)]
nums = getList()
for num in nums:
digit = 0
while(digit < 61):
if num % 2 == 0:
bit_array[digit][0] += 1
else:
bit_array[digit][1] += 1
digit += 1
num //= 2
# print(bit_array)
ans = 0
for i, tgt in enumerate(bit_array):
ans += pow(2, i, MOD) * tgt[0] * tgt[1]
ans %= MOD
print(ans )
def main():
n = getN()
for _ in range(n):
solve()
if __name__ == "__main__":
solve() | 0 | null | 62,403,466,423,672 | 64 | 263 |
N = int(input())
for i in range(1, 10):
m = N/i
if(m.is_integer() and m <= 9):
print("Yes")
break
else:
print("No")
| N = int(input())
# A*B=Nとなるような1以上9以下の整数(A, B)が存在するかどうか全探索を行う
ans = 'No'
for i in range(1, 10):
for j in range(1, 10):
if i*j == N:
ans = 'Yes'
break
print(ans) | 1 | 159,686,514,832,068 | null | 287 | 287 |
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 *
from heapq import heapify, heappop, heappush
import math
import random
import string
from copy import deepcopy
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 #
#############
N, M = getNM()
W = []
V = []
for i in range(M):
a, b = getNM()
W.append(b)
V.append(a)
# magicを重複ありで適当に組み合わせて合計Nを目指す
def knapsack_4(N, limit, weight, value):
dp = [float('inf')] * (limit + 1)
dp[0] = 0
for i in range(1, limit + 1):
for j in range(N):
if i < value[j]:
dp[i] = min(dp[i], weight[j])
else:
dp[i] = min(dp[i], dp[i - value[j]] + weight[j])
return dp[-1]
print(knapsack_4(M, N, W, V))
| H, N = map(int,input().split())
ls = [list(map(int,input().split())) for _ in range(N)]
dp = [0]*(H+1)
for i in range(1, H+1):
for j in range(N):
if j == 0:
if ls[j][0] <= i:
dp[i] = dp[i-ls[j][0]] + ls[j][1]
else:
dp[i] = ls[j][1]
else:
if ls[j][0] <= i:
dp[i] = min([dp[i], dp[i-ls[j][0]] + ls[j][1]])
else:
dp[i] = min([dp[i], ls[j][1]])
print(dp[H]) | 1 | 81,145,858,051,872 | null | 229 | 229 |
x = int(input())
print(2*x*3.14) | n,a,b = map(int,input().split())
mod = pow(10,9)+7
ans = pow(2,n,mod)
ans -= 1
def choose(n,k):
x,y = 1,1
for i in range(1,k+1):
x *= (n-i+1)
x %= mod
y *= i
y %= mod
x *= pow(y,mod-2,mod)
x %= mod
return x
ans -= choose(n,a)
ans -= choose(n,b)
ans %= mod
print(ans) | 0 | null | 48,550,768,695,930 | 167 | 214 |
S = int(input())
if S < 3:
print(0)
import sys
sys.exit()
DP = [0]*(S+1)
DP[0] = 0
DP[1] = 0
DP[2] = 0
for i in range(3, S + 1):
DP[i] += 1
for j in range(i - 3 + 1):
DP[i] += DP[j]
print(DP[S] % (10 ** 9 + 7))
| from scipy.special import comb
import copy
MOD = 10**9+7
s = int(input())
cnt = 0
ans = 1
if s <= 2:
print(0)
else :
s = s-3
while s >= 3:
s -= 3
cnt += 1
if s > 0:
ans += comb(s+cnt, cnt, exact=True)
ans %= MOD
else :
ans += 1
ans %= MOD
print(ans)
| 1 | 3,246,553,003,020 | null | 79 | 79 |
N,M=map(int,input().split())
A=[int(x) for x in input().split()]
print(max(-1,(N-sum(A)))) | n, m = map(int, input().split())
a = list(map(int, input().split()))
total = 0
for i in range(m):
total = total + a[i]
if (n -total) < 0:
print(-1)
else:
print(n - total) | 1 | 31,768,479,798,950 | null | 168 | 168 |
class ModComb:
def __init__(self, MAX, mod=10 ** 9 + 7):
fac = [1, 1]
finv = [1, 1]
inv = [0, 1]
for i in range(2, MAX):
fac.append(fac[i - 1] * i % mod)
inv.append(mod - inv[mod % i] * (mod // i) % mod)
finv.append(finv[i - 1] * inv[i] % mod)
self.fac, self.finv, self.mod = fac, finv, mod
def nCk(self, n, k):
if n < k or n < 0 or k < 0:
return 0
fac, finv, mod = self.fac, self.finv, self.mod
return fac[n] * (finv[k] * finv[n - k] % mod) % mod
mod = 998244353
N, M, K = map(int, input().split())
mc = ModComb(N, mod)
ans = 0
for k in range(K + 1):
ans += M * pow(M - 1, N - 1 - k, mod) * mc.nCk(N - 1, k)
ans %= mod
print(ans) | MOD = 998244353
n, k = map(int, input().split())
l, r = [0]*k, [0]*k
for i in range(k):
_l, _r = map(int, input().split())
l[i], r[i] = _l, _r
dp, dpsum = [0]*(n+1), [0]*(n+1)
dp[1], dpsum[1] = 1, 1
for i in range(2, n+1):
for j in range(k):
li = i - r[j]
ri = i - l[j]
if ri<0: continue
li = max(li, 1)
dp[i] += dpsum[ri] - dpsum[li-1]
dp[i] %= MOD
dpsum[i] = dpsum[i-1] + dp[i]
print(dp[n])
| 0 | null | 12,843,771,890,122 | 151 | 74 |
ALPHA = input()
if ALPHA.isupper():
print("A")
else:
print("a") | lis=[]
for i in range(10):
h=int(input())
lis.append(h)
for i in range(10):
for j in range(i+1,10):
if lis[i]<lis[j]:
a=lis[i]
lis[i]=lis[j]
lis[j]=a
for i in range(3):
print(lis[i]) | 0 | null | 5,629,306,481,888 | 119 | 2 |
X = int(input())
if X < 30:
ans = 'No'
else:
ans = 'Yes'
print(ans) | print("Yes" if int(input()) >= 30 else "No")
| 1 | 5,748,096,976,490 | null | 95 | 95 |
w,h,x,y,r = map(int, raw_input().split())
if x >= r and x <= (w-r) and y >= r and y <= (h-r):
print 'Yes'
else:
print 'No' | WHxyr = input().split()
W = int(WHxyr[0])
H = int(WHxyr[1])
x = int(WHxyr[2])
y = int(WHxyr[3])
r = int(WHxyr[4])
if x-r<0 or x+r>W or y-r<0 or y+r>H:
print("No")
else:
print("Yes") | 1 | 452,613,139,244 | null | 41 | 41 |
def cmb(a,b,c):
b = min(b,a-b)
num = 1
for i in range(b):
num = num*(a-i) % c
den = 1
for i in range(b):
den = den*(i+1) % c
return num * pow(den,c-2,c) % c
mod = 10**9+7
n,k = map(int,input().split())
a = list(map(int,input().split()))
a.sort()
ans = 0
c = cmb(n-1,k-1,mod)
if k == 1:
print(0)
exit()
for i in range(n-k+1):
ans -= a[i] * c
ans += a[-i-1] * c
ans %= mod
c = (c * (n-k-i) * pow(n-i-1,mod-2,mod)) % mod
if ans < 0:
ans += mod
print(ans)
| def main():
S = ''
while True:
try:
S = S + input()
except:
break
s = S.lower()
for i in range(97, 123):
c = chr(i)
n = s.count(c)
print('{} : {}'.format(c, n))
main() | 0 | null | 48,666,673,481,998 | 242 | 63 |
N = int(input())
L = list(map(int, input().split()))
le = len(L)
score = 0
for i in range(le):
for j in range(i+1,le):
for k in range(j+1,le):
if (L[i] + L[j] > L[k] and
L[i] + L[k] > L[j] and
L[k] + L[j] > L[i] ):
if (L[i] != L[j] and
L[i] != L[k] and
L[k] != L[j]):
score += 1
print(score) | R,G,B=map(int,input().split())
K=int(input())
for i in range (K+1):
if R < G < B:
print ('Yes')
exit()
else:
pass
if G < B:
pass
else:
B*=2
continue
if R < G:
pass
else:
G*=2
continue
print('No')
| 0 | null | 6,047,651,933,960 | 91 | 101 |
n=int(input())
c=0
for i in range(1,n+1):
if i%2!=0:
c+=1
print("{0:.10f}".format(c/n)) | x = int(input())
i = 0
while x >= 500:
x = x - 500
i = i + 1000
while x >= 5:
x = x - 5
i = i + 5
print(int(i)) | 0 | null | 109,803,802,797,792 | 297 | 185 |
import math
A,B,N = map(int,input().split())
if N >= B:
N = B - 1
print(math.floor(A*N/B) - A * math.floor(N/B)) | n,m = map(int, input().split())
h = list(map(int, input().split()))
ab = [map(int, input().split()) for _ in range(m)]
a,b = [list(i) for i in zip(*ab)]
Max = []
for i in range(n):
Max.append(0)
# print(Max)
ans = 0
for i in range(m):
Max[a[i]-1] = max(Max[a[i]-1],h[b[i]-1])
Max[b[i]-1] = max(Max[b[i]-1],h[a[i]-1])
for i in range(n):
if h[i] > Max[i]:
ans += 1
print(ans) | 0 | null | 26,698,162,203,988 | 161 | 155 |
a = [0]
n = 0
def main():
global n
for s in input():
if s == "<":
nproc()
a.append(a[-1]+1)
else:
n += 1
nproc()
print(sum(a))
def nproc():
global n, a
if n > 0 and n > a[-1]:
a[-1] = n
for i in list(range(n))[::-1]:
a.append(i)
n = 0
if __name__ == "__main__":
main() | #! /usr/bin/env python3
import sys
import numpy as np
from itertools import groupby
int1 = lambda x: int(x) - 1
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(500000)
S = readline().decode().rstrip()
cnt = [0] * (len(S) + 1)
for i in range(len(S)):
if S[i] == '<':
cnt[i + 1] = max(cnt[i + 1], cnt[i] + 1)
for i in range(len(S) - 1, -1, -1):
if S[i] == '>':
cnt[i] = max(cnt[i], cnt[i + 1] + 1)
print(sum(cnt)) | 1 | 156,377,576,509,220 | null | 285 | 285 |
import math
h,a=map(int,input().split())
num = h/a
ans = math.ceil(num)
print(ans) | import math
n,m=map(int,input().split())
print(math.ceil(n/m)) | 1 | 76,784,469,172,710 | null | 225 | 225 |
while True:
C=input()
if C=="-":
break
else:
m=int(input())
for i in range(m):
h=int(input())
c=C[0 : h]
C=C[h : len(C) + 1]
C+=c
print(C)
| while 1:
s=input();l=len(s);n=0
if'-'==s:break
for _ in range(int(input())):n+=int(input())
print((s+s)[n%l:][:l]) | 1 | 1,946,486,048,320 | null | 66 | 66 |
a = input()
b = list(a)
if len(a) >= 6:
if b[2] == b[3]:
if b[4] == b[5]:
print("Yes")
else:
print("No")
else:
print("No")
else:
print("No")
| import sys
BIG_NUM = 2000000000
MOD = 1000000007
EPS = 0.000000001
NUM = 20005
table = [""]*NUM
while True:
T = str(input())
if T == '-':
break
left = 0
right = 0
#長い配列にパターン文字列を転記
for i in range(len(T)):
# print(T[right])
table[left+right] = T[right]
right += 1
num_suffle = int(input())
for loop in range(num_suffle):
pick_num = int(input())
#先頭からpick_num文字を末尾に転記し、論理削除
for i in range(pick_num):
table[right+i] = table[left+i]
left += pick_num
right += pick_num
for i in range(left,right):
print("%s"%(table[i]),end = "")
print()
| 0 | null | 22,029,793,358,574 | 184 | 66 |
from math import floor, ceil
def solve(X, D, lb, ub):
# min abs(X + t * D) (lb <= t <= ub) (lb, ub, t are int)
ts = [
lb,
ub,
max(min(floor(-X / D), ub), lb),
max(min(ceil(-X / D), ub), lb),
]
return min([abs(X + t * D) for t in ts])
X, K, D = map(int, input().split())
if K % 2 == 0:
ans = solve(X, D * 2, -(K // 2), +(K // 2))
else:
ans1 = solve(X + D, D * 2, -((K + 1) // 2), +((K - 1)) // 2)
ans2 = solve(X - D, D * 2, -((K - 1) // 2), +((K + 1)) // 2)
ans = min(ans1, ans2)
print(ans)
| X, K, D = map(int, input().split())
t = X // D
if abs(t) >= K:
if X > 0:
print(abs(X-(D*K)))
elif X < 0:
print(abs(X+(D*K)))
exit(0)
nokori = K - t
if X-(D*t) <= 0:
if nokori % 2 == 0:
print(abs(X-(D*t)))
else:
print(abs(X-(D*(t-1))))
else:
if nokori % 2 == 0:
print(abs(X-(D*t)))
else:
print(abs(X-(D*(t+1))))
| 1 | 5,222,762,652,392 | null | 92 | 92 |
L=list(map(int,input().split()))
a=L[0]
b=L[1]
c=L[2]
d=L[3]
print(max(a*c,b*d,a*d,b*c)) | def main():
N = int(input())
ans = 0
for n in range(1, N + 1):
d = N // n
ans += d * (d + 1) / 2 * n
print(int(ans))
if __name__ == '__main__':
main() | 0 | null | 7,072,542,799,032 | 77 | 118 |
N = int(input())
L = [x * y for x in range(1, 10) for y in range(1, 10)]
if L.count(N) != 0:
print("Yes")
else:
print("No") | def f(s):
return sum(map(int, s))
while True:
s = input()
if s == "0":
break
print(f(s)) | 0 | null | 80,346,047,991,938 | 287 | 62 |
poi = [0,0]
for mak in range(int(input())) :
tem = input().split()
if tem[0] == tem[1] :
poi[0] += 1
poi[1] += 1
else :
che = sorted(tem)
if tem[0] != che[0] : poi[0] += 3
else : poi[1] += 3
print(poi[0],poi[1]) | a,b,c=map(int,input().split())
import math
d=math.sin(math.radians(c))
print(a*b*d/2)
e=math.cos(math.radians(c))
x=math.sqrt(a**2+b**2-2*a*b*e)
print(a+b+x)
print(2*(a*b*d/2)/a)
| 0 | null | 1,064,358,078,818 | 67 | 30 |
A,B,C,K=map(int,input().split())
if K<=A:
print(K)
elif K<=A+B:
print(A)
else:
m=K-(A+B)
print(A-m) | numbers = input()
numbers = numbers.split(" ")
for i in range(3):
numbers[i] = int(numbers[i])
numbers.sort()
print("{0} {1} {2}".format(numbers[0], numbers[1], numbers[2])) | 0 | null | 11,067,418,090,850 | 148 | 40 |
import math
class Triangle():
def __init__(self, edge1, edge2, angle):
self.edge1 = edge1
self.edge2 = edge2
self.angle = angle
self.edge3 = math.sqrt(edge1 ** 2 + edge2 ** 2 - 2 * edge1 * edge2 * math.cos(math.radians(angle)))
self.height = edge2 * math.sin(math.radians(angle))
self.area = edge1 * self.height / 2
a, b, theta = [int(i) for i in input().split()]
triangle = Triangle(a, b, theta)
print(triangle.area)
print(triangle.edge1 + triangle.edge2 + triangle.edge3)
print(triangle.height)
| from math import *
a,b,C=map(int,input().split())
C=C*pi/180
S=a*b*sin(C)/2
print(S,a+b+(a*a+b*b-2*a*b*cos(C))**0.5,2*S/a,sep='\n') | 1 | 174,594,722,984 | null | 30 | 30 |
S = input()
Sliststr = list(S)
Slist = [int(s) for s in Sliststr]
Smod = [0]
mod10 = [1]
count = [0]*2019
ans = 0
for i in range(len(S)-1):
mod10.append(mod10[i]*10%2019)
for i in range(len(S)):
Smod.append((Smod[i]+Slist[-i-1]*mod10[i])%2019)
for i in range(len(Smod)):
count[Smod[i]] += 1
for i in range(2019):
ans += count[i] * (count[i]-1) // 2
print(ans) | s=[int(_) for _ in input()]
m = [0 for i in range(2019)]
d=0
m[d]+=1
p=1
for i in range(len(s)):
d=(d+s[-i-1]*p)%2019
m[d]+=1
p=(p*10)%2019
#print(d)
ans=0
for i in range(2019):
ans+=m[i]*(m[i]-1)//2
print(ans) | 1 | 30,646,428,295,648 | null | 166 | 166 |
while True:
s = input()
if s == '0':
break
sum = 0
for d in s:
sum += int(d)
print(sum) | num = list(map(int,input().split()))
print("%d %d %f" %(num[0]/num[1],num[0]%num[1],num[0]/num[1] ))
| 0 | null | 1,095,324,793,628 | 62 | 45 |
input = int(input())
if input == 0: print (1)
else: print (0) | a2=list(input())
if a2[0]!=a2[1] and a2[2]==a2[3] and a2[4]==a2[5]:
print('Yes')
else:
print('No') | 0 | null | 22,373,131,863,940 | 76 | 184 |
from math import pi
x=float(input())
ans=2*pi*x
print(ans) | while True:
[h,w] = map(int,input().split())
if h==0 and w ==0: break
s = ['#'*w+'\n', (('#' + '.'*(w-2) + '#')[0:w]+'\n')*(h-2), '#'*w+'\n' ]
t = list(filter(lambda x: x!='', s))
print(''.join(t[0:h])) | 0 | null | 15,970,764,777,350 | 167 | 50 |
n = int(input())
def dfs(i,s):
if i == n:
print(s)
return
ma = 0
for j in s:
ma = max(ma,ord(j))
for j in range(ma - 95):
dfs(i+1,s+chr(97+j))
return
dfs(1,"a") | N = int(input())
alpha=list('abcdefghijklmnopqrstuvwxyz')
res=['']
for i in range(N):
tmp = []
for j in res:
for k in alpha[:len(set(list(j))) +1]:
tmp.append(j+k)
res = tmp
for i in res:
print(i) | 1 | 52,510,030,946,540 | null | 198 | 198 |
import sys
input = sys.stdin.readline
P = 10 ** 9 + 7
def main():
N, K = map(int, input().split())
ans = 0
n_gcd = [0] * (K + 1)
for k in reversed(range(1, K + 1)):
n = pow(K // k, N, mod=P)
for kk in range(2 * k, K + 1, k):
n -= n_gcd[kk]
n_gcd[k] = n % P
ans += k * n_gcd[k]
ans %= P
print(ans)
if __name__ == "__main__":
main()
| n, k = map(int, input().split())
mod = 10**9+7
def power(a, n, mod):
bi=str(format(n,"b")) #2進数
res=1
for i in range(len(bi)):
res=(res*res) %mod
if bi[i]=="1":
res=(res*a) %mod
return res
D = [0]*(k+1)
ans = 0
for i in reversed(range(1, k+1)):
a = k//i
d = power(a, n, mod)
j = 1
while i*j <= k:
d -= D[i*j]
j += 1
D[i] = d
ans += (d*i)%mod
print(ans%mod) | 1 | 36,866,589,086,080 | null | 176 | 176 |
s1 = str(input())
s2 = str(input())
n = len(s1)
if s1 == s2[:n]:
print('Yes')
else:
print('No') | S = input()
T = input()
if T.startswith(S) and len(T) == len(S) + 1:
print("Yes")
else:
print("No") | 1 | 21,446,092,473,816 | null | 147 | 147 |
s = input()
if s.isupper():
print("A")
else:
print("a")
| #!/usr/bin/env python3
a = input()
ans = "a" if a == a.lower() else "A"
print(ans)
| 1 | 11,302,797,432,712 | null | 119 | 119 |
N=input()
N=list(N)
N=map(lambda x: int(x),N)
if sum(N)%9==0:
print("Yes")
else:
print("No")
| # -*- coding: utf-8
s = list(map(str,input().split()))
sum = 0
for i in range(len(s)):
sum += (int) (s[i])
if sum %9 == 0:
print("Yes")
else:
print("No") | 1 | 4,378,369,556,588 | null | 87 | 87 |
n=int(input())
a=list(map(int,input().split()))
b=[]
for i in range(n):
tmp=[i+1,a[i]]
b.append(tmp)
b=sorted(b,key=lambda x:x[1])
ans=[]
for j in b:
ans.append(j[0])
print(*ans) | K, N = map(int, input().split())
A = list(map(int, input().split()))
A2 = [K+a for a in A]
A3 = A + A2
dist = [0] * N
for i in range(N):
j = i + N - 1
dist[i] = A3[j] - A[i]
print(min(dist))
| 0 | null | 111,606,208,186,208 | 299 | 186 |
# -*- coding: utf-8 -*-
# ITP1_10_A
import math
pos = list(map(float, input().split()))
x = abs(pos[2] - pos[0])
y = abs(pos[3] - pos[1])
print(math.sqrt(x**2 + y**2))
| def sep():
return map(int,input().strip().split(" "))
def lis():
return list(sep())
n,m,k=sep()
a=lis()
b=lis()
from bisect import bisect_right
a_c=[a[0]]
b_c=[b[0]]
for i in range(1,n):
a_c.append(a_c[-1]+ a[i])
for i in range(1,m):
b_c.append(b_c[-1] + b[i])
m=-1
m=max(m,bisect_right(b_c,k))
for i in range(n):
if a_c[i]<=k:
t=k-a_c[i]
t2=bisect_right(b_c,t)
m=max(i+1+t2,m)
else:
break
print(max(0,m))
| 0 | null | 5,446,579,422,280 | 29 | 117 |
A, B, M = map(int, input().split())
As = list(map(int, input().split()))
Bs = list(map(int, input().split()))
coupons = []
for _ in range(M):
x, y, c = map(int, input().split())
coupons.append((x, y, c))
price_min = min(As) + min(Bs)
coupon_min = min([As[x - 1] + Bs[y - 1] - c for (x, y, c) in coupons])
print(min((price_min, coupon_min)))
| H,W,K = map(int, input().split())
def cv(S,cn,pr):
SS=S
ans = []
for i in range(cn):
ans += [pr+i+1]*(SS.find("#")+1)
if SS.find("#")<len(SS):
SS = SS[SS.find("#")+1:]
else:
SS = ""
ans += [pr+cn]*len(SS)
return ans
cnt_pre = 0 #最初のall #no
cnt = 0 # "#"の個数
for i in range(H):
Lin = input()
tmp = Lin.count("#")
if tmp == 0 and cnt == 0:
cnt_pre +=1
elif tmp == 0:
print(*pS)
else:
pS = cv(Lin,tmp,cnt)
for i in range(0,cnt_pre+1):
print(*pS)
cnt_pre = 0
cnt += tmp | 0 | null | 99,178,752,112,100 | 200 | 277 |
#!/usr/bin/env python3
from pprint import pprint
import sys
sys.setrecursionlimit(10 ** 6)
X, Y, A, B, C = map(int, input().split())
apples_A = sorted(list(map(int, input().split())))
apples_B = sorted(list(map(int, input().split())))
apples_C = sorted(list(map(int, input().split())))
# 赤のリンゴからおいしさが大きい順に X 個選ぶ (1)
# 緑のリンゴからおいしさが大きい順に Y 個選ぶ (2)
# (1), (2) そして 無色のリンゴのから、おいしさが大きいものから順に X + Y 個選べば良い
apples_rest = sorted(apples_A[-X:] + apples_B[-Y:] + apples_C)
ans = sum(apples_rest[ -(X + Y):])
print(ans)
| def main():
S=input()
Q=int(input())
Left=[]
Right=[]
reverse_flag=0
for i in range(Q):
query=input().split()
if query[0]=="1":
if reverse_flag==1:
reverse_flag=0
else:
reverse_flag=1
else:
if query[1]=="1":
if reverse_flag==0:
Left.append(query[2])
else:
Right.append(query[2])
else:
if reverse_flag==0:
Right.append(query[2])
else:
Left.append(query[2])
res=""
if reverse_flag==0:
Left.reverse()
res+="".join(Left)
res+=S
res+="".join(Right)
else:
Right.reverse()
res+="".join(Right)
S=list(S)
S.reverse()
res+="".join(S)
res+="".join(Left)
print(res)
if __name__=="__main__":
main() | 0 | null | 50,907,880,923,962 | 188 | 204 |
n = int(input())
i = 0
while (i < n):
L = map(int, raw_input().split())
L.sort(reverse = True)
if (pow(L[0], 2) == pow(L[1], 2) + pow(L[2], 2)):
print "YES"
else:
print "NO"
i += 1 | import sys
N = int(raw_input())
for line in sys.stdin:
a, b, c = sorted(map(int, line.split()))
if a ** 2 + b ** 2 == c ** 2:
print 'YES'
else:
print 'NO' | 1 | 332,011,438 | null | 4 | 4 |
import math
n = int(input())
sq = int(math.sqrt(n))
i=sq
for i in range(sq,0,-1):
if n%i==0:
j=n//i
break
print(i+j-2) | N = int(input())
num = set()
for n in range(2, 10**7):
if N % n == 0:
num.add(tuple(sorted([n, N//n])))
if N == n:
break
ans = (10**12, 10**12)
if not num:
print(N - 1)
else:
for s in num:
if s[0]+s[1] < ans[0]+ans[1]:
ans = s
print(ans[0] + ans[1] - 2) | 1 | 161,972,116,235,420 | null | 288 | 288 |
import bisect
def main():
N,D,A=map(int,input().split())
XH=[list(map(int,input().split())) for _ in range(N)]
XH.sort()
for i in range(N):
XH[i][1]=-(-XH[i][1]//A)
X=[x for x,a in XH]
far=[0]*N
for i in range(N):
far[i]=bisect.bisect_right(X,X[i]+2*D)-1
ans=0
carry=0
outrange=[0]*(N+1)
for i in range(N):
x=XH[i][0]
hp=XH[i][1]
carry-=outrange[i]
if carry>=hp:
continue
outrange[bisect.bisect_right(X,X[i]+2*D)]+=hp-carry
ans+=hp-carry
carry+=hp-carry
print(ans)
if __name__ == '__main__':
main() | def main():
import sys
input = sys.stdin.readline
n, d, a = [int(i) for i in input().split()]
chk = []
for i in range(n):
x, h = [int(i) for i in input().split()]
chk.append((x, 0, h))
from heapq import heapify, heappop, heappush
heapify(chk)
atk_cnt = 0; ans = 0
while chk:
x, t, h = heappop(chk)
if t == 0:
if atk_cnt * a >= h:
continue
remain = h - atk_cnt * a
new_atk = (remain - 1) // a + 1
heappush(chk, (x + 2 * d, 1, new_atk))
ans += new_atk
atk_cnt += new_atk
else:
atk_cnt -= h
print(ans)
if __name__ == '__main__':
main()
| 1 | 81,720,861,907,950 | null | 230 | 230 |
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
N, K = map(int, readline().split())
n = N % K
print(min(n, K - n))
return
if __name__ == '__main__':
main()
| N,K = map(int,input().split())
min = N%K
if min>abs(min-K):
min = abs(min-K)
print (min) | 1 | 39,534,694,816,270 | null | 180 | 180 |
n = int(input())
a = list(map(int, input().split()))
b = a[0]
for v in a[1:]:
b ^= v
print(*map(lambda x: x ^ b, a))
| N = int(input())
A=list(map(int,input().split()))
sumxor=0
for i in range(N):
sumxor=sumxor^A[i]
for i in range(N):
print(sumxor^A[i],"",end='')
print() | 1 | 12,476,328,991,478 | null | 123 | 123 |
import math
A, B = map(int, input().split())
arange = set(range(math.ceil(A*100/8), math.ceil((A+1)*100/8)))
brange = set(range(math.ceil(B*100/10), math.ceil((B+1)*100/10)))
ans_range = arange & brange
if len(ans_range) == 0:
print(-1)
else:
print(min(ans_range))
| a = map(int, raw_input().split())
a.sort()
for i in range(len(a)):
print a[i], | 0 | null | 28,458,828,671,868 | 203 | 40 |
A,B,C = map(int,input().split())
if A == B:
if A != C:
print("Yes")
else:
print("No")
else:
if B == C or A == C:
print("Yes")
else:
print("No") | N,M,X=[int(s) for s in input().split()]
Book=[[int(s) for s in input().split()] for _ in range(N)]
INF=10**7
ans=set()
ans.add(INF)
#深さ優先探索
def DFS(n,cost,Xls):
if n==N:
if min(Xls)>=X:
ans.add(cost)
else:
Xnext=[Xls[i]+Book[n][i+1] for i in range(M)]
DFS(n+1,cost+Book[n][0],Xnext)
DFS(n+1,cost,Xls)
DFS(0,0,[0 for _ in range(M)])
if min(ans)==INF:
print(-1)
else:
print(min(ans)) | 0 | null | 45,239,841,453,532 | 216 | 149 |
import sys
from functools import reduce
import copy
import math
from pprint import pprint
import collections
import bisect
import itertools
import heapq
sys.setrecursionlimit(4100000)
def inputs(num_of_input):
ins = [input() for i in range(num_of_input)]
return ins
def int_inputs(num_of_input):
ins = [int(input()) for i in range(num_of_input)]
return ins
def solve(input):
nums = string_to_int(input)
def euclid(large, small):
if small == 0:
return large
l = large % small
return euclid(small, l)
nums.sort(reverse=True)
eee = euclid(nums[0], nums[1])
return int((nums[0] * nums[1]) / eee)
def string_to_int(string):
return list(map(lambda x: int(x), string.split()))
if __name__ == "__main__":
ret = solve(input())
print(ret)
| from math import atan, degrees
def is_divisible(a):
return 'Yes' if any(int(a/x) == a/x and a/x <= 9 for x in range(1,10)) and a <= 81 else 'No'
print(is_divisible(int(input()))) | 0 | null | 135,896,108,043,098 | 256 | 287 |
import itertools
N,K = map(int,input().split())
A = list(map(int,input().split()))
for i in range(K):
TEMP = [0]*(N+1)
for j in range(N):
TEMP[max(0,j-A[j])] +=1
TEMP[min(N,j+A[j]+1)] -=1
A = list(itertools.accumulate(TEMP))
if A[0] == N and A[N-1] == N:
break
A.pop()
print(*A) | S = list(map(str, input()))
T = list(map(str, input()))
ans = 0
for i in range(len(S)):
if S[i]!=T[i]:
ans += 1
print(ans) | 0 | null | 12,837,605,870,948 | 132 | 116 |
X, K, D = map(int, input().split())
X = abs(X)
if X - K * D >= 0:
print(X - K * D)
exit()
else:
n = X // D
x = X - n * D
if (K - n) % 2 == 0:
print(x)
else:
print(min(x + D, D - x))
| import heapq
n = int(input())
A = list(map(int, input().split()))
A = sorted(A, reverse=True)
ans = 0
q = []
heapq.heappush(q, A[0]*-1)
for i in range(1, n):
tmp = heapq.heappop(q)
ans += tmp
heapq.heappush(q, A[i] * -1)
heapq.heappush(q, A[i] * -1)
print(ans*-1) | 0 | null | 7,206,071,900,490 | 92 | 111 |
n = int(input())
for i in range(1,10):
if n // i == n/i and n//i in range(1,10):
print('Yes')
break
else:
print('No') | N = int(input())
a = 0
for i in range(1,10):
if N%i == 0 and N <= 9*i:
print("Yes")
a = 1
break
if a == 0:
print("No") | 1 | 159,502,824,018,912 | null | 287 | 287 |
import math
a,aa,b,bb=map(float,input().split())
A=(math.sqrt(abs(a-b)**2+abs(aa-bb)**2))
print(A)
| N,M = map(int,input().split())
A = list(map(int,input().split()))
homeworks = 0
for i in A:
homeworks += i
if N >= homeworks:
print(N-homeworks)
else:
print(-1)
| 0 | null | 16,151,075,164,810 | 29 | 168 |
def solve():
a1, a2, a3 = map(int, input().split())
print('bwuisnt'[a1+a2+a3<=21::2])
if __name__ == '__main__':
solve()
| from sys import stdin, setrecursionlimit
def gcd(x, y):
if x % y == 0:
return y
return gcd(y, x % y)
def main():
input = stdin.buffer.readline
n, m = map(int, input().split())
a = list(map(int, input().split()))
a = [a[i] // 2 for i in range(n)]
a = list(set(a))
n = len(a)
lcm = 1
for i in range(n):
lcm = lcm * a[i] // gcd(lcm, a[i])
for i in range(n):
if (lcm // a[i] % 2) == 0:
print(0)
exit()
ans = m // lcm
print(ans - ans // 2)
if __name__ == "__main__":
setrecursionlimit(10000)
main()
| 0 | null | 109,899,497,967,380 | 260 | 247 |
#144_C
import math
n = int(input())
m = math.floor(math.sqrt(n))
div = 1
for i in range(1,m+1):
if n % i == 0:
div = i
print(int(div + n/div -2)) | import sys
S = input()
if not ( S == 'ABC' or S == 'ARC' ): sys.exit()
print('ABC') if S == 'ARC' else print('ARC') | 0 | null | 93,104,055,227,170 | 288 | 153 |
n = int(input())
s = input()
if n % 2 != 0:
print('No')
exit()
if s[:n//2] == s[n//2:n]:
print('Yes')
else:
print('No')
| while 1:
S = raw_input()
if (S == '-'):
break
N = input()
for i in range(N):
h = input()
S = S[h : len(S)] + S[0 : h]
print S
| 0 | null | 74,324,287,331,940 | 279 | 66 |
n,k,c=map(int,input().split())
s=input()
if k==1:
if s.count("o")==1:
print(s.index("o")+1)
exit()
l=[-c]*k
r=[n+c]*k
ll=0
for i in range(n):
if ll==0:
if s[i]=="o":
l[ll]=i
ll+=1
continue
if s[i]=="x" or l[ll-1]+c>=i:continue
l[ll]=i
ll+=1
if ll==k:break
rr=k-1
for i in range(n):
if rr==k-1:
if s[(n-1)-i]=="o":
r[rr]=(n-1)-i
rr-=1
continue
if s[(n-1)-i]=="x" or r[rr+1]-c<=(n-1)-i:continue
r[rr]=(n-1)-i
rr-=1
if rr==-1:break
for i in range(k):
if l[i]==r[i]:print(l[i]+1) | a,b = map(int,input().split())
s = list(map(int,input().split()))
num1 =0
num2 =0
if b ==0:
print(a)
exit()
for i in range(100):
num1 = a-i
num2 = a+i
if not num1 in s and not num2 in s:
print(num1)
exit()
if not num1 in s:
print(num1)
exit()
if not num2 in s:
print(num2)
exit() | 0 | null | 27,409,886,163,898 | 182 | 128 |
import sys
input = lambda: sys.stdin.readline().rstrip()
sys.setrecursionlimit(10**7)
INF = 10**20
def I(): return int(input())
def F(): return float(input())
def S(): return input()
def LI(): return [int(x) for x in input().split()]
def LI_(): return [int(x)-1 for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LS(): return input().split()
def resolve():
N = I()
fact = []
for i in range(1, int(N ** 0.5) + 1):
if N % i == 0:
fact.append((i, N // i))
print(sum(fact[-1]) - 2)
if __name__ == '__main__':
resolve()
| X,N = map(int,input().split())
P = list(map(int,input().split()))
if X not in P:
print(X)
else:
d = 1
while True:
if X-d not in P:
print(X-d)
break
if X+d not in P:
print(X+d)
break
d += 1 | 0 | null | 87,786,467,163,790 | 288 | 128 |
n = int(input())
s = input()
if n % 2 == 1:
print('No')
else:
head = s[:n // 2]
tail = s[n // 2:]
if head == tail:
print('Yes')
else:
print('No')
| n = int(input())
s = input()
if n % 2 == 1:
print('No')
exit()
mid= int(len(s)/2)
if s[:mid] == s[mid:]:
print('Yes')
else:
print('No')
| 1 | 146,452,329,780,480 | null | 279 | 279 |
import sys
h, w = map(int, input().split())
s = [list(x.rstrip()) for x in sys.stdin.readlines()]
dp = [[10**6]*w for _ in range(h)]
if s[0][0] == "#":
dp[0][0] = 1
else:
dp[0][0] = 0
for j in range(h):
for i in range(w):
for k in range(2):
nx, ny = i + (k + 1)%2, j + k%2
if nx >= w or ny >= h:
continue
else:
add = 0
if s[ny][nx] == "#" and s[j][i] == ".":
add = 1
dp[ny][nx] = min(dp[ny][nx], dp[j][i] + add)
print(dp[h-1][w-1]) | def main():
C = input()
ans = chr(ord(C) + 1)
print(ans)
if __name__ == "__main__":
main()
| 0 | null | 70,342,424,294,780 | 194 | 239 |
D = int(input())
c = list(map(int, input().split()))
last = [0] * 26
S = []
for d in range(1, D+1):
sd = list(map(int, input().split()))
S += [sd]
score = 0
for d in range(1, D+1):
td = int(input()) - 1
cumsump = 0
for i in range(26):
if td != i:
tmp = -c[i] * (d - last[i])
cumsump += tmp
last[td] = d
score += S[d-1][td]+cumsump
print(score) | x,n = map(int,input().split())
p = list(map(int,input().split()))
dic = {}
lis = []
for i in range(0,102):
if i not in p:
dic[i] = abs(x-i)
lis.append(i)
mini = min(dic.values())
for j in lis:
if mini == dic[j]:
print(j)
break | 0 | null | 12,049,480,532,252 | 114 | 128 |
from collections import Counter as C
n=int(input())
S=list(input())
a=1
L=C(S).most_common(3)
for l in L:
a*=l[1]
for i in range(1,n):
for j in range(n-2*i):
if len(set((S[j],S[j+i],S[j+2*i])))==3:
a-=1
print(a if len(L)>2 else 0) | def main():
n = int(input())
s = input()
if n < 4:
print(0)
return
ans = s.count("R") * s.count("G") * s.count("B")
for i, si in enumerate(s[:-2]):
for j, sj in enumerate(s[i+1:-1]):
if si == sj:
continue
if i + 2*j+2 < n and si != s[i + 2*j+2] != sj:
ans -= 1
print(ans)
if __name__ == '__main__':
main()
| 1 | 35,965,452,164,022 | null | 175 | 175 |
num = int(input())
array = list(map(int, input().split()))
count = 0
max = 0
sum = 0
for i in array:
if count == 0:
min = i
max = i
count += 1
sum = sum + i
if i < min:
min = i
if max < i:
max = i
print(min, max, sum)
| n = int(input())
ns = list(map(int, input().split()))
print(min(ns), max(ns), sum(ns))
| 1 | 727,696,745,732 | null | 48 | 48 |
c = input()
if c == "RRR":
print(3)
elif "RR" in c:
print(2)
elif "R" in c:
print(1)
else:
print(0) | s = input()
if s == 'RRR':
print(3)
elif s=='RSR' or s=='SRS' or s=='SSR' or s=='RSS':
print(1)
elif s == s=='RRS' or s=='SRR':
print(2)
else:
print(0) | 1 | 4,902,741,961,014 | null | 90 | 90 |
#事前に階乗を計算しておく maximにnの最大値をいれる
maxim = 10**6+1
MOD = 10**9+7
kaijou = [1]*(maxim)
for i in range(1,maxim):
kaijou[i]=(kaijou[i-1]*i)%MOD
#nCr
def nCr(n,r):
if n < r:
return 0
return ((kaijou[n]*pow(kaijou[r],MOD-2,MOD))%MOD*pow(kaijou[n-r],MOD-2,MOD))%MOD
#nHr
def nHr(n,r):
if r == 0:
if n == 0:
return 1
return 0
return ((kaijou[n+r-1]*pow(kaijou[n],MOD-2,MOD))%MOD*pow(kaijou[r-1],MOD-2,MOD))%MOD
N = int(input())
ans = 0
for i in range(1,(N//3)+1):
tmp = nHr(N-3*i,i)
ans = (ans+tmp)%MOD
print(ans) | s = int(input())
MOD = 1000000007
def mod(n):
return n % MOD
MAX = 1000000 #適当な数を入力
fac, finv, inv = [[0]*MAX for i in range(3)]
def combinit(): #MAXまでの下準備
fac[0] = fac[1] = 1
finv[0] = finv[1] = 1
inv[1] = 1
for i in range(2, MAX):
fac[i] = fac[i - 1] * i % MOD
inv[i] = MOD - inv[MOD%i] * (MOD // i) % MOD
finv[i] = finv[i - 1] * inv[i] % MOD
def modcomb(n, k): #mod(nCk)を計算、ただしn<MAX
if (n < k):
return 0
if (n < 0 or k < 0):
return 0
return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD
combinit() #下準備の実行 O(MAX)
ans = 0
count = 0
s -= 3
while s >= 0:
ans += modcomb(s + count, count)
count += 1
s -= 3
print(mod(ans)) | 1 | 3,296,623,144,500 | null | 79 | 79 |
N, M = map(int, input().split())
a, w = 0, 0
P = set()
W = {}
for _ in range(M):
p, S = map(str, input().split())
if p in P:
continue
if S == 'WA':
W.setdefault(p, 0)
W[p] += 1
if S == 'AC':
a += 1
P.add(p)
if p in W:
w += W[p]
print(a, w) | s,t=map(str,input().split())
print(t,s,sep="")
| 0 | null | 98,640,330,524,768 | 240 | 248 |
s = str(input())
if s == 'ABC':
print('ARC')
elif s == 'ARC':
print('ABC') | #bit全探索
n,m,x=map(int,input().split())
c=[]
a=[]
for i in range(n):
l=list(map(int,input().split()))
c.append(l[0])
a.append(l[1:])
min_cost=float('inf')
for i in range(2**n):
flag=True
cost_total=0
a_total=[0]*m
for j in range(n):
if (i>>j)&1:
cost_total+=c[j]
for k in range(m):
a_total[k]+=a[j][k]
for s in range(m):
if a_total[s]<x:flag=False
if flag:
min_cost=min(min_cost,cost_total)
if min_cost==float('inf'):
print(-1)
else:
print(min_cost) | 0 | null | 23,195,898,368,832 | 153 | 149 |
from statistics import pstdev, variance, mean
while 1:
num = int(input())
if num == 0:
break
else:
data = list(map(int, input().split()))
st = float(pstdev(data))
print(st)
| while int(input()) != 0:
m = list(map(int, input().split()))
mean = sum(m) / len(m)
std = (sum([(i - mean) ** 2 for i in m]) / len(m)) ** 0.5
print("{:4f}".format(std))
| 1 | 201,998,800,042 | null | 31 | 31 |
mod = 10**9+7
s = int(input())
dp = [0]*2500
dp[0] = 1
for i in range(1, s+1):
for j in range(0, i-2):
dp[i]+=dp[j]
dp[i]%=mod
print(dp[s]) | import math
def comb(n, r):
return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))
s = int(input())
x = s // 3
ans = 0
for xi in range(1, x+1):
tmp = s - xi*3
ans += comb(tmp+xi-1, xi-1)
ans %= 1000000007
print(ans)
| 1 | 3,336,466,300,960 | null | 79 | 79 |
H, N, *AB = map(int, open(0).read().split())
A = AB[::2]
B = AB[1::2]
dp = [float("inf")] * (H + 1)
dp[0] = 0
for i in range(N):
for h in range(H):
dec_health = min(h + A[i], H)
dp[dec_health] = min(dp[dec_health], dp[h] + B[i])
print(dp[-1])
| H, N = map(int, input().split())
AB = []
INF = 10**8 + 1
dp = [INF]*(H+1)
dp[0] = 0
for _ in range(N):
a, b = map(int, input().split())
AB.append((a, b))
for i in range(1, H+1):
for j in range(N):
dp[i] = min(dp[i], dp[max(0, i - AB[j][0])] + AB[j][1])
print(dp[-1]) | 1 | 81,234,297,718,028 | null | 229 | 229 |
s=input()
if s=="RSR":
print("1")
else:
ans=s.count("R")
print(ans)
| s = input()
res = 0
cur = 0
for i in s:
if i =='S':
cur = 0
else:
cur += 1
res = max(cur, res)
print(res) | 1 | 4,920,796,683,000 | null | 90 | 90 |
n,k,s = map(int,input().split())
if s != 10**9:
ans_ls = [s+1] * n
for i in range(k):
ans_ls[i] = s
ans_ls = list(map(str,ans_ls))
else:
ans_ls = [1] * n
for i in range(k):
ans_ls[i] = s
ans_ls = list(map(str,ans_ls))
print(' '.join(ans_ls))
| n, k, s = map(int, input().split())
A = [0] * n
if s == 10 ** 9:
for i in range(k):
A[i] = 10 ** 9
for i in range(k, n):
A[i] = 1
else:
for i in range(k):
A[i] = s
for i in range(k, n):
A[i] = s + 1
print(*A) | 1 | 91,075,282,797,280 | null | 238 | 238 |
n,k,c=map(int,input().split())
s=list(input())
for i in range(len(s)):
if s[i]=="o":
s[i]=True
else:
s[i]=False
i=0
work1=[]
while len(work1)<k:
if s[i]:
work1.append(i)
i+=c+1
else:
i+=1
i=n-1
work2=[]
while len(work2)<k:
if s[i]:
work2.append(i)
i-=c+1
else:
i-=1
work2.sort()
for i in range(k):
if work1[i]==work2[i]:
print(work1[i]+1) | l = [list(map(int,input().split())) for i in range(3)]
n = int(input())
b = list(int(input()) for _ in range(n))
for i in range(3) :
for j in range(3) :
for k in range(n) :
if l[i][j] == b[k] :
l[i][j] = 0
for i in range(3) :
if l[i][0] + l[i][1] + l[i][2] == 0 :
print('Yes')
exit()
if l[0][i] + l[1][i] + l[2][i] == 0 :
print('Yes')
exit()
if l[0][0] + l[1][1] + l[2][2] == 0 :
print('Yes')
exit()
if l[0][2] + l[1][1] + l[2][0] == 0 :
print('Yes')
exit()
print('No') | 0 | null | 50,177,147,729,412 | 182 | 207 |
t,h=0,0
n=int(input())
for i in range(n):
a,b=input().split()
if a > b:
t+=3
elif a < b:
h+=3
else:
t+=1
h+=1
print(t, h) | from sys import stdin
for x in sorted([int(l) for l in stdin],reverse=True)[0:3]:
print(x) | 0 | null | 1,003,314,289,562 | 67 | 2 |
N, M = (int(x) for x in input().split())
ans=0
if N>=2:
ans+=N*(N-1)/2
if M>=2:
ans+=M*(M-1)/2
print(int(ans)) | n,m = map(int,input().split())
h = list(map(int,input().split()))
r = ['t'] * n
for i in range(m):
x,y = map(int,input().split())
if h[x-1] > h[y-1]:
r[y-1] = 'f'
elif h[x-1] < h[y-1]:
r[x-1] = 'f'
else:
r[y-1] = 'f'
r[x-1] = 'f'
s = 0
for i in range(n):
if r[i] == 't':
s += 1
print(s) | 0 | null | 35,321,733,656,000 | 189 | 155 |
N = int(input())
S = []
for _ in range(N):
S.append(input())
ans = set(S)
print(len(ans)) | N = int(input())
S = set([])
for i in range(N):
temp = str(input())
S.add(temp)
ans = len(S)
print(ans) | 1 | 30,131,210,918,468 | null | 165 | 165 |
n,a,b=map(int,input().split())
if a>b: a,b=b,a
if (a-b)%2==0: print((b-a)//2)
else: print(min(a-1,n-b)+1+(b-a-1)//2)
| import sys
sys.setrecursionlimit(10**7)
readline = sys.stdin.buffer.readline
def readstr():return readline().rstrip().decode()
def readstrs():return list(readline().decode().split())
def readint():return int(readline())
def readints():return list(map(int,readline().split()))
def printrows(x):print('\n'.join(map(str,x)))
def printline(x):print(' '.join(map(str,x)))
n,a,b = readints()
if (b-a)%2==0:
print((b-a)//2)
else:
print(min(n-b+(b-a)//2+1,a-1+(b-a)//2+1))
| 1 | 108,815,257,020,130 | null | 253 | 253 |
text = raw_input()
t = list(text)
for i in range(len(t)):
if t[i].isupper():
t[i] = t[i].lower()
elif t[i].islower():
t[i] = t[i].upper()
print "".join(t) | # coding: utf-8
line = raw_input()
print ''.join([((s.lower() if s.isupper() else s.upper()) if s.isalpha() else s) for s in line]) | 1 | 1,521,597,802,020 | null | 61 | 61 |
h,w,K = map(int, input().split())
g = [[0]*w for _ in range(h)]
for i in range(h):
s=input()
for j in range(w):
g[i][j] = s[j]
ans=1001001001
for i in range(1<<(h-1)):
seg = [0]*h
segnow = 0
for j in range(h-1):
if i & 1 << j:
segnow += 1
seg[j+1] = segnow
segnow += 1
flag = True
div = 0
cnt = [0 for _ in range(segnow)]
for j in range(w):
now = [0]*segnow
for k in range(h):
if g[k][j] == '1':
cnt[seg[k]] += 1
now[seg[k]] += 1
if cnt[seg[k]] > K:
div+=1
for l in range(segnow):
cnt[l] = now[l]
if max(now)>K:
continue
ans = min(ans,segnow-1+div)
print(ans) | from itertools import product
import copy
H,W,K = list(map(int, input().split()))
A = []
for i in range(H):
A.append(list(map(int, input())))
#SM = [np.cumsum(A[i]) for i in range(H)]
ANS = []
for pat in product(['0','1'], repeat = H-1):
res = []
cnt = 0
now = copy.copy(A[0])
for i in range(1,H):
p = pat[i-1]
if p == '1':
res.append(now)
now = copy.copy(A[i])
cnt += 1
else:
for j in range(W):
now[j] += A[i][j]
res.append(now)
"""
print("---")
print(pat)
print(res)
print(cnt)
"""
wk2 = [0] * len(res)
cnt2 = 0
flg = True
for x in range(W):
for j in range(len(res)):
if res[j][x] > K:
# 横に割った段階で、すでに最小単位がKを超えてたら実現不可能
flg = False
break
if wk2[j] + res[j][x] > K:
cnt2 += 1
wk2 = [0] * len(res)
break
for j in range(len(res)):
wk2[j] += res[j][x]
if not flg:
break
if flg:
ANS.append(cnt + cnt2)
#print(pat, cnt, cnt2)
print(min(ANS))
| 1 | 48,403,057,108,582 | null | 193 | 193 |
N,K = list(map(int, input().split()))
A = list(map(int, input().split()))
from itertools import accumulate
if K>=50:
print(*[N]*N)
exit()
for _ in range(K):
ans=[0]*(N+1)
for i,a in enumerate(A):
ans[max(0,i-a)]+=1
ans[min(i+a+1,N)]-=1
A = list(accumulate(ans))[:-1]
if all(i == N for i in A):
break
print(*A) | x = int(input())
if 30 <= x:
print("Yes")
else:
print("No") | 0 | null | 10,592,893,562,000 | 132 | 95 |
N=int(input())
ans=0
i=1
while i<=N:
if i%2!=0:
ans+=1
i+=1
print(ans/N)
| import itertools
input()
rods = list(map(int, input().split(" ")))
sorted_rods = sorted(rods)
count = 0
for combination in itertools.combinations(sorted_rods, 3):
a, b, c = combination
if a != b and b != c:
if a + b > c:
count += 1
print(count) | 0 | null | 91,465,495,442,052 | 297 | 91 |
import math
N, M = map(int, input().split())
A_list = list(map(int, input().split()))
cnt = 0
A_sum = sum(A_list)
for i in range(N):
if A_list[i] >= math.ceil(A_sum/4/M):
cnt += 1
if cnt >= M:
print("Yes")
else:
print("No")
| r = list(map(float, input().split()))
print('{0:f}'.format(((r[2] - r[0]) ** 2 + (r[3] - r[1]) ** 2) ** 0.5)) | 0 | null | 19,503,188,998,590 | 179 | 29 |
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]))
| x=int(input())
x=x+(x**2)+(x**3)
print(x) | 0 | null | 74,941,064,989,902 | 274 | 115 |
print(int((int(input())+1)/2)) | N=str(input())
NN=0
for i in range(len(N)):
NN=NN+int(N[i])
if NN%9==0:print('Yes')
else:print('No') | 0 | null | 31,921,039,074,628 | 206 | 87 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.