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
|
|---|---|---|---|---|---|---|
n,m=map(int,input().split())
l=[list(map(int,input().split())) for _ in range(m)]
for i in range(1001):
i=str(i)
if len(i)!=n:
continue
f=1
for s,c in l:
c=str(c)
if len(i)<s:
f=0
break
if not i[s-1]==c:
f=0
break
if f:
print(i)
exit()
print("-1") | n,m=map(int,input().split())
sc=[list(map(int,input().split())) for _ in range(m)]
for i in range(10**n):
ans=str(i)
if len(ans)==n and all(ans[s-1]==str(c) for s,c in sc):
print(ans)
exit()
print(-1) | 1 | 60,929,748,488,192 | null | 208 | 208 |
N = int(input())
A = []
for _ in range(N):
a = int(input())
b = []
for _ in range(a):
b.append(list(map(int, input().split())))
A.append(b)
# 証言リスト A[i人目][j個目の証言] -> [誰が, bit(1は正、0は誤)]
# bitが1であれば正しい証言、0であれば間違った証言とする
# 正しい証言だけ確認して、[i, 1]と証言した i も1かどうか、[j,0]と証言したjが0かどうか
def F(i):
cnt = 0
B = [-1]*N #B = [-1,-1,-1]
r = 0
for j in range(N): # i=1, j=0,1,2
if (i>>j)&1: # 001 -> 1,0,0 j=0
r += 1 # r = 1
if B[j] == 0: #B[0] == -1
return 0
B[j]=1 # B = [1,-1,-1]
for p,q in A[j]: # A[0] = [[2, 1], [3, 0]]
if q == 0:
if B[p-1]==1: # B[2] == -1
return 0
B[p-1] = 0 # B = [1,1,0]
else:
if B[p-1]==0: # B[1] == -1
return 0
B[p-1] = 1 # B = [1,1,-1]
else:
cnt += 1 # cnt = 1
else: # j=1
if B[j]==1: #B[1] ==1
return 0
B[j]=0
if cnt == r:
return cnt
ans = 0
for i in range(1<<N):
ans = max(ans,F(i))
print(ans) | import itertools
n = int(input())
lst = []
for _ in range(n):
m = int(input())
lst_s = []
for _ in range(m):
evi = list(map(int, input().split()))
lst_s.append(evi)
lst.append(lst_s)
#print(lst)
truth = [0, 1]
all_lists = list(itertools.product(truth, repeat=n))
#print(all_lists)
max_count = 0
for each in all_lists:
flag = True
count = 0
#print(each)
for i in range(n):
trust = each[i]
#print(trust)
evis = lst[i]
for evid in evis:
#print(evid)
person_ind = evid[0] - 1
person_trust = evid[1]
if trust == 1:
if person_trust != each[person_ind]:
flag = False
break
if not flag:
break
if trust == 1:
count += 1
if (count > max_count) and flag:
max_count = count
print(max_count) | 1 | 121,647,634,125,348 | null | 262 | 262 |
import sys
N = int(sys.stdin.readline().strip())
X = sys.stdin.readline().strip()
def popcount(n):
cnt = 0
while n > 0:
cnt += n & 1
n //= 2
return cnt
def f(n):
cnt = 0
while n != 0:
n = n % popcount(n)
cnt += 1
return cnt
#nX = int(X, 2)
pcnt = X.count('1')
MOD1 = pcnt + 1
MOD2 = pcnt - 1
nXp = 0
nXm = 0
pow1 = [1] * N
pow2 = [0] * N
for i in range(1, N):
pow1[i] = (pow1[i-1] * 2) % MOD1
if MOD2 != 0:
pow2[0] = 1
for i in range(1, N):
pow2[i] = (pow2[i-1] * 2) % MOD2
for i in range(N):
if X[i] == '1':
nXp += pow1[N-1-i]
nXp %= MOD1
if MOD2 != 0:
for i in range(N):
if X[i] == '1':
nXm += pow2[N-1-i]
nXm %= MOD2
for i in range(0, N):
if X[i] == '0':
k = (nXp + pow1[N-1-i]) % MOD1
print(f(k) + 1)
else:
if MOD2 == 0:
print(0)
else:
k = (nXm - pow2[N-1-i]) % MOD2
print(f(k) + 1) | import sys
def popcount(x):
'''xの立っているビット数をカウントする関数
(xは64bit整数)'''
# 2bitごとの組に分け、立っているビット数を2bitで表現する
x = x - ((x >> 1) & 0x5555555555555555)
# 4bit整数に 上位2bit + 下位2bit を計算した値を入れる
x = (x & 0x3333333333333333) + ((x >> 2) & 0x3333333333333333)
x = (x + (x >> 4)) & 0x0f0f0f0f0f0f0f0f # 8bitごと
x = x + (x >> 8) # 16bitごと
x = x + (x >> 16) # 32bitごと
x = x + (x >> 32) # 64bitごと = 全部の合計
return x & 0x0000007f
input = sys.stdin.readline
N = int(input())
X = input().strip()
n0 = 0
for x_i in X:
if x_i == "1":
n0 += 1
# print("n0", n0)
r_p = 0 # 0 -> 1のケース
r_n = 0 # 1 -> 0のケース
X = X[::-1]
for i in range(N):
x = int(X[i])
r_p += x * pow(2, i, n0+1)
r_p %= (n0+1)
if 1 < n0:
r_n += x * pow(2, i, n0-1)
r_n %= (n0-1)
# print("r_p", r_p, "r_n", r_n)
ans = []
# print(n)
for i in range(N):
count = 1
diff = (1 if X[i] == "0" else -1)
# print("x_i", X[i], "diff", diff)
n = n0 + diff
if n == 0:
ans.append(0)
continue
if diff == 1:
r = r_p + (diff * pow(2, i, n))
r %= n
else:
r = r_n + (diff * pow(2, i, n))
r %= n
# print("n", n, "r", r)
n = r
# print("n", n)
while 0 < n:
r = popcount(n)
count += 1
# print("n", n)
if r == 0:
break
n = n % r
ans.append(count)
for i in ans[::-1]:
print(i) | 1 | 8,239,826,175,494 | null | 107 | 107 |
import sys
N = input()
for i in range ( len ( N )):
if '7' == N[i] :
print("Yes")
sys.exit()
print("No") | str = input()
if '7' in str:
print("Yes")
else:
print("No") | 1 | 34,245,476,650,968 | null | 172 | 172 |
import sys
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
N, M = lr()
bl = N == M
print('Yes' if bl else 'No')
| print("Yes" if len(set(map(int,input().split())))==1 else "No") | 1 | 83,279,894,565,630 | null | 231 | 231 |
N = int(input())
a = N // 100
if 0 <= N - 100 * a <= 5 * a:
print(1)
else:
print(0) | dp = [True] # i円の買い物ができるか
x = int(input())
for i in range(99):
dp.append(False)
for i in range(100, x + 1):
if(i < 106):
dp.append(True)
else:
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.append(True)
else:
dp.append(False)
if(dp[x]):
print(1)
else:
print(0)
| 1 | 127,124,148,149,014 | null | 266 | 266 |
S = list(input())
K = int(input())
S.extend(S)
prev = ''
cnt = 0
for s in S:
if s == prev:
cnt += 1
prev = ''
else:
prev = s
b = 0
if K % 2 == 0:
b += 1
if K > 2 and S[0] == S[-1]:
mae = 1
while mae < len(S) and S[mae] == S[0]:
mae += 1
if mae % 2 == 1 and mae != len(S):
usiro = 1
i = len(S) - 2
while S[i] == S[-1]:
usiro += 1
i -= 1
if usiro % 2 == 1:
b = K // 2
if K % 2 == 0:
res = cnt * (K // 2) + (b - 1)
else:
res = cnt * (K // 2) + cnt // 2 + b
print(res)
| import math
def main():
t1, t2 = map(int, input().split())
a1, a2 = map(int, input().split())
b1, b2 = map(int, input().split())
sumA = t1 * a1 + t2 * a2
sumB = t1 * b1 + t2 * b2
if sumA == sumB:
return 'infinity'
if sumA < sumB:
sumA, sumB = sumB, sumA
a1, b1 = b1, a1
a2, b2 = b2, a2
# A の方が sum が大きいとする
halfA = t1 * a1
halfB = t1 * b1
if halfA > halfB:
return 0
div, mod = divmod(halfB - halfA, sumA - sumB)
if mod == 0:
return div * 2
return div * 2 + 1
print(main()) | 0 | null | 154,134,834,566,540 | 296 | 269 |
import math
from collections import defaultdict
n = int(input())
p = defaultdict(int)
mod = 10 ** 9 + 7
ori = 0
for _ in range(n):
a,b = map(int,input().split())
if a == b == 0:
ori += 1
continue
elif b < 0:
a *= -1
b *= -1
elif b == 0 and a < 0:
a *= -1
if a == 0:
p[(0,1)] += 1
elif b == 0:
p[(1,0)] += 1
else:
g = math.gcd(a,b)
p[(a//g, b//g)] += 1
k = n - ori
ans = ori-1
tmp = 1
l = k
for q,num in sorted(p.items(), reverse=True):
x,y = q
if x <= 0:
break
if p[(-y, x)] >= 1:
a,b = p[(x,y)], p[(-y, x)]
tmp *= pow(2,a,mod) + pow(2,b,mod) - 1
l -= a+b
tmp *= pow(2,l,mod)
print((ans+tmp) % mod) | import math
x = float(input())
print("%.6f %.6f"%(x*x*math.pi, x*2*math.pi))
| 0 | null | 10,834,980,560,544 | 146 | 46 |
R,C,K= map(int,input().split(" "))
original=[[0]*(C+1) for i in range(R+1)]
for _ in range(K):
r,c,v= map(int,input().split(" "))
original[r][c]=v
d1=[[0]*(C+1) for i in range(R+1)]
d2=[[0]*(C+1) for i in range(R+1)]
d3=[[0]*(C+1) for i in range(R+1)]
for i in range(1,R+1):
for j in range(1,C+1):
curr= original[i][j]
d1[i][j]=max(d1[i-1][j]+curr,d2[i-1][j]+curr,d3[i-1][j]+curr,d1[i][j-1],curr)
d2[i][j]=max(d2[i][j-1],d1[i][j-1]+curr)
d3[i][j]=max(d3[i][j-1],d2[i][j-1]+curr)
print(max(d1[-1][-1],d2[-1][-1],d3[-1][-1])) | n = int(input())
min_price = int(input())
max_diff = -1e9
for _ in range(n - 1):
p = int(input())
max_diff = max(p - min_price, max_diff)
min_price = min(p, min_price)
print(max_diff) | 0 | null | 2,819,735,033,060 | 94 | 13 |
a,b,k = map(int, input().split())
if k > a and k >= a+b:
print( 0 , 0 )
elif k < a :
print(a-k , b)
elif k == a:
print(0 , b)
elif k>a and k < a+b:
print(0 , b-(k-a))
| a, b, k = map(int, input().split())
ac, k = min(a, k), k - min(a, k)
bc = min(b, k)
print(a-ac, b-bc) | 1 | 104,141,352,609,568 | null | 249 | 249 |
from collections import Counter
N=int(input())
A=list(map(int, input().split()))
C=Counter(A)
for i in range(1,N+1):
print(C[i]) | def bSort(A):
flag = 1
i = 0
count = 0
while flag:
flag = 0
for j in range(len(A)-1, i, -1):
if int(A[j][1]) < int(A[j-1][1]):
tmp = A[j]
A[j] = A[j-1]
A[j-1] = tmp
flag = 1
count += 1
i += 1
return A, count
def sSort(A):
count = 0
for i in range(len(A)):
minj = i
for j in range(i, len(A)):
if int(A[j][1]) < int(A[minj][1]):
minj = j
if minj != i:
count += 1
tmp = A[i]
A[i] = A[minj]
A[minj] = tmp
return A, count
def isStable(input_a, output_a):
for v1, v2 in zip(input_a, output_a):
if v1 != v2:
return 'Not stable'
return 'Stable'
if __name__ == '__main__':
length = input()
data = input().split()
sort_s, _= sSort(list(data))
sort_b, _= bSort(list(data))
print (' '.join([str(x) for x in sort_b]))
print (isStable(sort_b, sort_b))
print (' '.join([str(x) for x in sort_s]))
print (isStable(sort_b, sort_s))
| 0 | null | 16,299,339,567,578 | 169 | 16 |
n,k = map(int, input().split())
h = [int(x) for x in input().split()]
if n<=k:
print(0)
exit()
h.sort()
print(sum(h[:n-k])) | n = int(input())
x = list(map(int,input().split()))
ans = 100**2 * n
for i in range(1,101):
energy = 0
for j in x:
energy += (i-j)**2
ans = min(ans, energy)
print(ans) | 0 | null | 71,806,011,424,382 | 227 | 213 |
a, b, c = [int(i) for i in raw_input().split()]
if a < b< c:
print "Yes"
else:
print "No" | MOD = 10 ** 9 + 7
class Factorial:
def __init__(self, n, mod):
self.f = [1]
self.mod = mod
for j in range(1, n + 1):
self.f.append(self.f[-1] * j % mod)
self.i = [pow(self.f[-1], mod - 2, mod)]
for j in range(n, 0, -1):
self.i.append(self.i[-1] * j % mod)
self.i.reverse()
def factorial(self, j):
return self.f[j]
def ifactorial(self, j):
return self.i[j]
def comb(self, n, k):
return self.f[n] * self.i[n - k] % self.mod * self.i[k] % self.mod if n >= k else 0
N, K = map(int, input().split())
K = min(K, N - 1)
F = Factorial(N + 1, MOD)
ans = 0
for k in range(K + 1):
tmp = F.comb(N, k) * F.factorial(N - 1) * F.ifactorial(N - 1 - k) * F.ifactorial(k)
ans += (tmp % MOD)
ans %= MOD
print (ans) | 0 | null | 33,761,905,740,668 | 39 | 215 |
from functools import reduce
n = input()
a = list(map(int, input().split()))
s = int(reduce(lambda i,j: i^j, a))
print(' '.join(list(map(lambda x: str(x^s), a)))) | def main():
cands = {'ABC', 'ARC'}
S = input()
cands.discard(S)
print(cands.pop())
if __name__ == '__main__':
main()
| 0 | null | 18,226,504,712,352 | 123 | 153 |
A,B,C,D=map(int,input().split())
x=(A-1)//D+1
y=(C-1)//B+1
if x<y:
print("No")
else:
print("Yes")
| n, x, m = map(int, input().split())
dic = {}
tmp = []
a = x
sum_a = x
for i in range(n - 1):
if a in dic:
tmp.append(sum_a)
idx0 = dic[a] - 1
idx1 = i - 1
period = idx1 - idx0
times = (n - 1 - idx0) // period
res = (n - 1 - idx0) % period
before = tmp[idx0]
if idx0 >= 0:
ans = tmp[idx0 + res] + (tmp[idx1] - tmp[idx0]) * times
print(ans)
elif idx0 < 0:
if res > 0:
ans = (tmp[idx1 + 1] - tmp[idx0 + 1]) * times + tmp[res - 1]
print(ans)
else:
ans = (tmp[idx1 + 1] - tmp[idx0 + 1]) * times
print(ans)
break
else:
tmp.append(sum_a)
dic[a] = i
a = a ** 2 % m
sum_a += a
else:
print(sum_a) | 0 | null | 16,245,164,081,230 | 164 | 75 |
N, M = map(int, input().split())
flgs = [0] * N
penas = [0] * N
ac = 0
pena = 0
for _ in range(M):
p, s = input().split()
p = int(p)
s = (s=='AC')
if flgs[p - 1]:
continue
elif s:
ac += 1
flgs[p - 1] = 1
pena += penas[p-1]
else:
penas[p - 1] += 1
print(ac, pena)
| #coding:utf-8
def seki(a, b):
c = []
gou = 0
d = []
for i in range(len(a)):
for j in range(len(b[0])):
for k in range(len(b)):
gou += a[i][k] * b[k][j]
d.append(gou)
gou = 0
c.append(d)
d=[]
return c
n, m, l = [int(i) for i in input().rstrip().split()]
a = [list(map(int , input().rstrip().split())) for i in range(n)]
b = [list(map(int , input().rstrip().split())) for i in range(m)]
c = seki(a,b)
for i in c:
print(" ".join(list(map(str,i)))) | 0 | null | 47,420,264,295,558 | 240 | 60 |
def make_array_for_comb(N, mod=10**9+7):
fact = [1,1]
fact_inv = [1,1]
inv = [0,1]
for i in range(2, N+1):
fact.append((fact[-1]*i) % mod)
# モジュラ逆数の性質
inv.append((-inv[mod%i] * (mod//i)) % mod)
fact_inv.append((fact_inv[-1]*inv[i]) % mod)
return fact, fact_inv
def comb(n, r, mod=10**9+7):
if (r < 0) or (n < r):
return 0
r = min(r, n - r)
return fact[n] * fact_inv[r] * fact_inv[n-r] % mod
import sys
input = sys.stdin.readline
mod = 10**9+7
n,k = [int(i) for i in input().split()]
fact, fact_inv = make_array_for_comb(n,mod)
a = [int(i) for i in input().split()]
a = sorted(a)
a = tuple(a)
ans = 0
for i in range(0,n-k+1):
p = a[i]*comb(n-1-i,k-1,mod)
ans -= (p%mod)
ans %= mod
for i in range(k-1,n):
q = a[i]*comb(i,k-1,mod)
ans += (q%mod)
ans %= mod
print(ans) | import sys
sys.setrecursionlimit(10**7)
input = sys.stdin.readline
s = input().rstrip()
if s[2] == s[3] and s[4] == s[5]:
print("Yes")
else:
print("No")
| 0 | null | 68,670,337,985,470 | 242 | 184 |
n = int(input())
s = []
for i in range(n):
s.append(input())
s.sort()
# print(s)
m = 1
cnt = [1]
ans = []
for i in range(1,n):
if s[i] == s[i-1]:
cnt[-1] += 1
else:
if cnt[-1] > m:
ans = [s[i-1]]
elif cnt[-1] == m:
ans.append(s[i-1])
m = max(m, cnt[-1])
cnt.append(1)
if i == n-1 and cnt[-1] > m:
ans = [s[i]]
elif i == n-1 and cnt[-1] == m:
ans.append(s[i])
print('\n'.join(ans)) | from sys import stdin
input = stdin.readline
def main():
N, K = list(map(int, input().split()))
surp = N % K
print(min(surp, abs(surp-K)))
if(__name__ == '__main__'):
main()
| 0 | null | 54,954,117,058,312 | 218 | 180 |
n = int(input())
a = list(map(int, input().split()))
l = sum(a)
accu = 0
for i in a:
accu += i
if accu>l/2:
if abs(l/2-accu)<abs(l/2-accu+i):
print(accu*2-l)
else:
print(l-(accu-i)*2)
break | n = int(input())
a = list(map(int, input().split()))
first_half = 0
latter_half = sum(a)
min_diff = latter_half
for i in range(n):
first_half += a[i]
latter_half -= a[i]
diff = abs(first_half - latter_half)
min_diff = min(min_diff, diff)
print(min_diff)
| 1 | 141,587,110,707,568 | null | 276 | 276 |
n, x, m = map(int, input().split())
ans = []
c = [0]*m
flag = False
for i in range(n):
if c[x] == 1:
flag = True
break
ans.append(x)
c[x] = 1
x = x**2 % m
if flag:
p = ans.index(x)
l = len(ans) - p
d, e = divmod(n-p, l)
print(sum(ans[:p]) + d*sum(ans[p:]) + sum(ans[p:p+e]))
else:
print(sum(ans))
| import math
from decimal import Decimal, ROUND_HALF_UP
def resolve():
a, b, C = map(int, input().split())
x = math.radians(C)
h = b * math.sin(x)
S = Decimal((a * h) / 2).quantize(Decimal('0.00000001'), rounding=ROUND_HALF_UP)
c = Decimal(math.sqrt(a ** 2 + b ** 2 - 2 * a * b * math.cos(x))).quantize(Decimal('0.00000001'),
rounding=ROUND_HALF_UP)
L = Decimal(a + b + c).quantize(Decimal('0.00000001'), rounding=ROUND_HALF_UP)
print(S, L, h, sep="\n")
resolve()
| 0 | null | 1,520,771,920,590 | 75 | 30 |
BIG_NUM = 2000000000
MOD = 1000000007
EPS = 0.000000001
while True:
N,X = map(int,input().split())
if N == 0 and X == 0:
break
ans = 0
for a in range(1,N+1):
for b in range(1,N+1):
if b <= a:
continue
c = X-(a+b)
if c > b and c <= N:
ans += 1
print("%d"%(ans))
| n, m, k = [int(i) for i in input().split()]
subsets = []
splits = [i for i in range(1, n)]
n -= 1
for i in range(2**n):
x = []
for j in range(n):
if i&(1<<j):
x.append(j)
subsets.append(x)
n+=1
A = []
for i in range(n):
A.append([int(j) for j in input()])
ans = n*m
for subset in subsets:
cur_ans = len(subset)
tmp = []
col = 0
subset.append(100000)
running_sum = [0 for i in range(len(subset))]
while col<m:
row_ptr = 0
for row in range(n):
if row > subset[row_ptr]:
row_ptr += 1
running_sum[row_ptr] += A[row][col]
if running_sum[row_ptr] > k:
col -= 1
running_sum = [0 for i in range(len(subset))]
cur_ans += 1
break
col += 1
if cur_ans >= ans:
break
ans = min(ans, cur_ans)
print(ans)
| 0 | null | 24,826,058,562,758 | 58 | 193 |
import math
n, d = [int(n) for n in input().split(' ')]
cnt = 0
for i in range(n):
x, y = [int(n) for n in input().split(' ')]
if math.sqrt(x*x + y*y) <= d:
cnt += 1
print(cnt)
| n , d = map(int, input().split())
x = []
y = []
for i in range(n):
a = list(map(int, (input().split())))
x.append(a[0])
y.append(a[1])
ans = 0
for i in range(n):
if (x[i] ** 2 + y[i] ** 2) ** (0.5) <= d:
ans += 1
print(ans) | 1 | 5,950,900,605,988 | null | 96 | 96 |
import sys
r, c = map(int, raw_input().split())
c_sum = 0
sum_vector = [0 for i in xrange(c+1)]
for i in xrange(r):
temp = map(int, raw_input().split())
temp.append(sum(temp))
for j in xrange(c):
sum_vector[j] += temp[j]
sys.stdout.write(str(temp[j])+" ")
else:
sum_vector[c] += temp[c]
print temp[c]
for i in xrange(c):
sys.stdout.write(str(sum_vector[i])+" ")
print sum_vector[c] | r,c = map(int,input().split())
num=[]
r_sum =[]
for i in range(r):
num.append([int(i) for i in input().split()])
for i in range(r):
line_sum = 0
for j in range(c):
line_sum += num[i][j]
num[i].append(line_sum)
for i in range(c+1):
row_sum = 0
for j in range(r):
row_sum += num[j][i]
r_sum.append(row_sum)
num.append(r_sum)
for i in range(len(num)):
print(' '.join(str(i) for i in num[i]))
| 1 | 1,367,688,944,660 | null | 59 | 59 |
def find(x):
if parent[x]<0:
return x
else:
parent[x]=find(parent[x])
return parent[x]
def same(x,y):
return find(x)==find(y)
def union(x,y):
root_x=find(x)
root_y=find(y)
if root_x==root_y:
return
if parent[root_x]>parent[root_y]:
root_x,root_y=root_y,root_x
parent[root_x]+=parent[root_y]
parent[root_y]=root_x
def members(n,x):
root=find(x)
return [i for i in range(n) if find(i)==root]
def get_size(x):
return -parent[find(x)]
def get_root():
return [i for i, root in enumerate(parent) if root<0]
N,M=map(int,input().split())
parent=[-1 for i in range(N)]
for i in range(M):
a,b=map(int,input().split())
a=a-1
b=b-1
union(a,b)
ans=0
for i in parent:
if i<0:
ans+=1
print(ans-1) | class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [-1] * n
def find(self, x):
if self.parents[x] < 0:
return x
else:
self.parents[x] = self.find(self.parents[x])
return self.parents[x]
def union(self, x, y):
x = self.find(x)
y = self.find(y)
if x == y:
return
if self.parents[x] > self.parents[y]:
x, y = y, x
self.parents[x] += self.parents[y]
self.parents[y] = x
def roots(self):
return [i for i, x in enumerate(self.parents) if x < 0]
def group_count(self):
return len(self.roots())
def __str__(self):
return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())
n,m=map(int,input().split())
uf=UnionFind(n)
for i in range(m):
a,b=map(int,input().split())
uf.union(a-1,b-1)
print(uf.group_count()-1) | 1 | 2,284,223,582,870 | null | 70 | 70 |
def main():
n, m, k = map(int, input().split())
mod = 998244353
comb = 1
c = 0
for i in range(k + 1):
if i > 0:
comb = comb * (n - i) * pow(i, mod - 2, mod) % mod
c = (c + m * comb * pow(m - 1, n - 1 - i, mod)) % mod
print(c)
if __name__ == '__main__':
main() | height,width=map(int,input().split())
A=[]
for i in range(height):
A.append([int(j) for j in input().split()])
for i in range(height):
print(' '.join(map(str,A[i])),str(sum(A[i])))
B=[]
C=[0 for _ in range(width)]
for i in range(width):
for j in range(height):
s=0
s+=A[j][i]
B.append(s)
C[i]=sum(B)
B=[]
print(' '.join(map(str,C)),str(sum(C))) | 0 | null | 12,165,743,439,850 | 151 | 59 |
import sys
input=sys.stdin.readline
import numpy as np
from numpy.fft import rfft,irfft
n,m=[int(j) for j in input().split()]
l=np.array([int(j) for j in input().split()])
a=np.bincount(l)
fft_len=1<<18
fft = np.fft.rfft
ifft = np.fft.irfft
Ff = fft(a,fft_len)
x=np.rint(ifft(Ff * Ff,fft_len)).astype(np.int64)
p=x.cumsum()
i=np.searchsorted(p,n*n-m)
q=n*n-m-p[i-1]
ans=(x[:i]*np.arange(i,dtype=np.int64)).sum()+i*q
print(int(l.sum()*2*n-ans))
| n,m=map(int,input().split())
a=list(map(int,input().split()))
for i in range(n):a[i]*=-1
a.sort()
from bisect import bisect_left,bisect_right
def check(mid):
mm=0
for i in range(n):
if -(a[i]+a[0])<mid:break
mm+=bisect_right(a,-(mid+a[i]))
return mm
ok=0
ng=10**10+7
while ng!=ok+1:
mid=(ok+ng)//2
if check(mid)>=m:ok=mid
else:ng=mid
b=[0]
for i in a:b.append(b[-1]+i)
ans=0
for i in range(n):
if -(a[i]+a[0])<ok:break
ind=bisect_right(a,-(ok+a[i]))
ans+=a[i]*ind
ans+=b[ind]
print(-(ans+(check(ok)-m)*ok)) | 1 | 108,277,799,547,840 | null | 252 | 252 |
from math import sqrt
x1, y1, x2, y2 = map(float, input().split())
r = sqrt((x1 - x2)**2 + (y1 - y2)**2 )
print('{0:.5f}'.format(r))
| import math
a,b,c,d=map(float,input().split())
x=math.sqrt((a-c)**2 + (b-d)**2)
print(round(x,8))
#round(f,6)でfを小数点以下6桁にまとめる。
| 1 | 152,635,586,062 | null | 29 | 29 |
from collections import deque
n,m = map(int,input().split())
h=list(map(int,input().split()))
g = [[] for _ in range(n)]
for _ in range(m):
a,b = map(int,input().split())
a-=1
b-=1
g[a].append(b)
g[b].append(a)
ans=0
for j in range(n):
for i in g[j]:
if h[j]<=h[i]:
break
else:
ans+=1
print(ans) | n,m=map(int,input().split())
h=list(map(int,input().split()))
a=[0 for i in range(m)]
b=[0 for i in range(m)]
for i in range(m):
a[i],b[i]=map(int,input().split())
count=0
c=[[] for i in range(n)]
for i in range(m):
c[a[i]-1].append(b[i]-1)
c[b[i]-1].append(a[i]-1)
for i in range(n):
max_h=0
for j in range(len(c[i])):
max_h=max(max_h, h[c[i][j]])
if max_h < h[i]:
count+=1
print(count) | 1 | 25,183,466,699,020 | null | 155 | 155 |
print(2*3.14159*int(input())) | import sys
import math
import itertools
import collections
sys.setrecursionlimit(1000000)
MOD = 10 ** 9 + 7
input = lambda: sys.stdin.readline().strip()
NI = lambda: int(input())
NMI = lambda: map(int, input().split())
NLI = lambda: list(NMI())
SI = lambda: input()
def main():
N = NI()
xy = [NLI() for _ in range(N)]
ls = [p for p in range(N)]
p_list = list(itertools.permutations(ls))
full_course = ["" for _ in range(len(p_list))]
for k in range(len(p_list)):
distance = 0
for l in range(N-1):
departure = p_list[k][l]
goal = p_list[k][l+1]
Xd = xy[departure][0]
Yd = xy[departure][1]
Xg = xy[goal][0]
Yg = xy[goal][1]
distance += ((Xd-Xg)**2 + (Yd-Yg)**2)**(1/2)
full_course[k] = distance
print(sum(full_course)/len(p_list))
if __name__ == '__main__':
main() | 0 | null | 90,159,053,129,728 | 167 | 280 |
# -*- coding: utf-8 -*-
import io
import sys
import math
def solve():
# implement process
pass
def main():
# input
s,t= input().split()
# process
ans = t+s
# output
print(ans)
return ans
### DEBUG I/O ###
_DEB = 0 # 1:ON / 0:OFF
_INPUT = """\
humu humu
"""
_EXPECTED = """\
humuhumu
"""
def logd(str):
"""usage:
if _DEB: logd(f"{str}")
"""
if _DEB: print(f"[deb] {str}")
### MAIN ###
if __name__ == "__main__":
if _DEB:
sys.stdin = io.StringIO(_INPUT)
print("!! Debug Mode !!")
ans = main()
if _DEB:
print()
if _EXPECTED.strip() == ans.strip(): print("!! Success !!")
else: print(f"!! Failed... !!\nANSWER: {ans}\nExpected: {_EXPECTED}") | s, t = map(str, input().split())
print(str(t)+str(s)) | 1 | 103,057,837,142,232 | null | 248 | 248 |
k=int(input())
k *= 9
amari = 63
for i in range(1, 10 ** 6 + 1):
amari %= k
if amari == 0:
print(i)
break
else:
amari = amari * 10 + 63
else:
print(-1) | r, c = map(int, input().split())
lis = [[] for a in range(r+1)]
for x in range(r):
lis[x] = list(map(int, input().split()))
lis[x].append(sum(lis[x]))
lis[r] = [0 for a in range(c+1)]
for y in range(c+1):
for z in range(r):
lis[r][y] += lis[z][y]
for x in lis:
for z,y in enumerate(x):
if z == c:
print(y)
else:
print(y, end = " ")
| 0 | null | 3,702,361,021,820 | 97 | 59 |
import sys
S = input()
if S == "ABC":
print("ARC")
sys.exit()
else:
print("ABC")
sys.exit()
| S = input()
if S[1] == 'B':
print('ARC')
else:
print('ABC') | 1 | 24,003,897,622,198 | null | 153 | 153 |
import numpy as np
from numpy.fft import rfft, irfft
import sys
input=sys.stdin.readline
N, M = map(int, input().split())
fft_len = 1<<18
MAX = 2*10**5
A = np.zeros(fft_len)
for a in [int(x) for x in input().split()]:
A[a] += 1
F = rfft(A, fft_len)
f = np.rint(irfft(F*F))
n, ans = 0, 0
for i, c in enumerate(f[:MAX+1][::-1]):
if M < n+c:
ans += (M-n)*(MAX-i)
break
ans += c*(MAX-i)
n += c
print(int(ans))
| def resolve():
A, B, C, K = map(int, input().split())
if K < A:
ans = K
elif (A + B) >= K:
ans = A
else:
ans = A - (K - A - B)
print(ans)
if __name__ == "__main__":
resolve() | 0 | null | 65,030,551,593,670 | 252 | 148 |
C = input()
tmp = ord(C)
print(chr(tmp + 1))
| al = "abcdefghijklmnopqrstuvwxyz"
C = input()
print(al[al.index(C)+1]) | 1 | 91,965,849,081,204 | null | 239 | 239 |
import math
r = float(input())
print('{0:.6f} {1:.6f}'.format(r * r * math.pi, (r + r) * math.pi)) | pi = 3.14159265359
r = float(input())
a,d = r*r*pi,2*r*pi
print(a,d,sep=' ') | 1 | 630,027,334,440 | null | 46 | 46 |
n, k, c = map(int, input().split())
s = input()
l = []
r = []
res = []
def fun(string, pos):
counter = 0
consec_counter = c + 1
res = []
while pos < n:
# print(pos)
if counter == k:
break
if consec_counter >= c and string[pos] == 'o':
counter += 1
consec_counter = 0
res.append(pos)
else:
consec_counter += 1
pos += 1;
# print(res)
return res
def invfun(string, pos):
counter = 0
consec_counter = c + 1
res = []
while pos >= 0:
if counter == k:
break
# print(pos)
if consec_counter >= c and string[pos] == 'o':
counter += 1
consec_counter = 0
res.append(pos)
else:
consec_counter += 1
pos -= 1;
# print(res)
return res
little_res = fun(s, 0)
lres = []
if len(little_res) == k:
lres = little_res
else:
exit()
little_res = invfun(s, n - 1)
rres = []
if len(little_res) == k:
rres = little_res
else:
exit()
# print(lres)
# print(rres)
for i in range(k):
if lres[i] == rres[k - 1 - i]:
print(lres[i] + 1)
| def main():
N, K, C = map(int, input().split())
S = input()
L, R = [-C], [N + C]
i, k = 0, 0
while i < N and k < K:
if S[i] == 'o':
L.append(i)
k += 1
i += C
i += 1
L.append(N)
i, k = N - 1, 0
while 0 <= i and k < K:
if S[i] == 'o':
R.append(i)
k += 1
i -= C
i -= 1
R.append(N)
l = 0
for i, s in enumerate(S):
if s == 'x':
continue
r = K - l
if R[r] <= i or R[r] - L[l] < C:
print(i + 1)
if L[l + 1] == i:
l += 1
main()
| 1 | 40,471,998,852,858 | null | 182 | 182 |
N, K = map(int, input().split())
portals = [0] + list(map(int, input().split()))
visitTowns = list()
visitTimes = [0 for _ in range(N + 1)]
curTown = 1
timeBackTo = 0
curTime = 0
while True:
if visitTimes[curTown] > 0:
timeBackTo = visitTimes[curTown]
break
visitTowns.append(curTown)
visitTimes[curTown] = curTime
# teleport
curTown = portals[curTown]
curTime += 1
nonLoopCount = timeBackTo
loopSpan = len(visitTowns) - nonLoopCount
if K <= nonLoopCount:
print(visitTowns[K])
exit()
rem = (K - nonLoopCount) % loopSpan
print(visitTowns[nonLoopCount + rem])
| def main():
x, y = map(int, input().split())
mul_xy = x * y
while True:
x, y = y, x % y
if not y:
break
print(int(mul_xy / x))
if __name__ == '__main__':
main()
| 0 | null | 67,721,600,689,480 | 150 | 256 |
'''
def main():
S = input()
cnt = 0
ans = 0
f = 1
for i in range(3):
if S[i] == 'R':
cnt += 1
else:
cnt = 0
ans = max(ans, cnt)
print(ans)
'''
def main():
S = input()
p = S[0] == 'R'
q = S[1] == 'R'
r = S[2] == 'R'
if p and q and r :
print(3)
elif (p and q) or (q and r):
print(2)
elif p or q or r:
print(1)
else:
print(0)
if __name__ == "__main__":
main() | s = input()
t = input()
ans = 0
for c, d in zip(s, t):
if c != d:
ans += 1
print(ans) | 0 | null | 7,674,881,153,108 | 90 | 116 |
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
from collections import deque, defaultdict
from itertools import combinations, permutations, combinations_with_replacement
from itertools import accumulate
from math import ceil, sqrt, pi
MOD = 10 ** 9 + 7
INF = 10 ** 18
N, K, C = map(int, input().split())
S = input()
left = [0] * N
right = [0] * N
i = 0
cnt = 0
while i < N:
if cnt == K:
break
if S[i] == "o":
cnt += 1
left[i] = 1
i += C + 1
else:
i += 1
#print(left)
S = S[::-1]
i = 0
cnt = 0
while i < N:
if cnt == K:
break
if S[i] == "o":
cnt += 1
right[i] = 1
i += C + 1
else:
i += 1
right = right[::-1]
#print(right)
left_ls, right_ls = [], []
for i in range(N):
if left[i]:
left_ls.append(i + 1)
if right[i]:
right_ls.append(i + 1)
for l, r in zip(left_ls, right_ls):
if l == r:
print(l) | n, k, c = map(int, input().split())
s = input()
left = []
i = 0
while len(left) < k:
if s[i] == 'o':
left.append(i)
i += c + 1
else:
i += 1
right = []
i = n - 1
while len(right) < k:
if s[i] == 'o':
right.append(i)
i -= c + 1
else:
i -= 1
right = right[::-1]
for i in range(k):
if left[i] == right[i]:
print(left[i] + 1) | 1 | 40,894,395,708,570 | null | 182 | 182 |
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("")
| def main():
H, N = map(int, input().split(' '))
A = input().split(' ')
total = 0
for i in A:
total += int(i)
if total >= H:
print('Yes')
else:
print('No')
main()
| 0 | null | 110,923,214,979,402 | 277 | 226 |
i = 1
while True:
n = input()
if n != 0:
print 'Case %s: %s' % (str(i), str(n))
i = i + 1
else:
break | import sys
for i, x in enumerate(iter(sys.stdin.readline, '0\n'), 1):
print(f'Case {i}: {x[:-1]}')
| 1 | 475,061,338,972 | null | 42 | 42 |
import math
while True:
n = input()
if(n == 0):
break
s = map(int, raw_input().split())
average = 0.0
for i in s:
average += i
average /= len(s)
alpha_pow = 0.0
for i in range(len(s)):
alpha_pow += (s[i] - average) * (s[i] - average)
alpha_pow /= n
print(math.sqrt(alpha_pow)) | while True:
n = int(input())
if n==0:
break
score = list(map(int, input().split()))
ave = sum(score) / n
print((sum([(i-ave)**2 for i in score])/n)**0.5)
| 1 | 187,401,766,332 | null | 31 | 31 |
import sys
import numpy as np
mod=10**9+7
n=int(sys.stdin.buffer.readline())
a=np.fromstring(sys.stdin.buffer.readline(),dtype=np.int64,sep=' ')
ans=0
b=1
for i in range(60):
s=int((a&1).sum())
ans=(ans+s*(n-s)*b)%mod
a>>=1
b=b*2%mod
print(ans) | def main():
N = int(input())
A = list(map(int, input().split()))
MOD = 10**9+7
# Aの中でd桁目が0,1であるものの個数を求める(p,qとする)
# 全部のd桁目についてループして、ans+=(2**d)*(p*q)
ans = 0
for d in range(60):
p,q = 0,0
for i in range(N):
if A[i]%2==0: p+=1
else: q+=1
A[i] //= 2
ans += ((2**d)*p*q)%MOD
ans %= MOD
print(ans)
main()
| 1 | 123,119,409,563,330 | null | 263 | 263 |
import sys
import numpy as np
import math
import collections
from collections import deque
from functools import reduce
# input = sys.stdin.readline
n = int(input())
a = list(map(int, input().split()))
axor = 0
for ai in a:
axor ^= ai
ans = []
for ni in range(n):
ans.append(str(axor ^ a[ni]))
print(" ".join(ans))
| 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])
| 0 | null | 32,400,099,152,750 | 123 | 198 |
#coding:utf-8
#1_4_A
def isFound(array, x):
""" linear search """
array.append(x)
i = 0
while array[i] != x:
i += 1
if i == len(array)-1:
return False
return True
n = int(input())
S = list(map(int, input().split()))
q = int(input())
T = list(map(int, input().split()))
count = 0
for i in range(q):
if isFound(S, T[i]):
count += 1
print(count) | from collections import deque
import sys
input = sys.stdin.readline
_ = int(input())
S = [int(i) for i in input().strip().split()]
_ = int(input())
T = [int(i) for i in input().strip().split()]
ans = 0
for t in T:
if t in S:
ans += 1
print(ans)
| 1 | 68,246,548,370 | null | 22 | 22 |
import copy
def bubble(N, A):
for i in range(N - 1):
for j in reversed(range(1, N)):
if A[j - 1][1] > A[j][1]:
tmp = A[j]
A[j] = A[j - 1]
A[j - 1] = tmp
def select(N, A):
for i in range(N):
min = i
for j in range(i, N):
if A[min][1] > A[j][1]:
min = j
tmp = A[i]
A[i] = A[min]
A[min] = tmp
def st(B, S):
for i in range(N):
if B[i] != S[i]:
return False
return True
N = int(input())
#カード入力
S = [i for i in input().split()]
B = copy.deepcopy(S)
bubble(N, B)
select(N, S)
print(" ".join(B))
print("Stable")
print(" ".join(S))
if st(B, S) == True:
print("Stable")
else:
print("Not stable")
| # -*- coding: utf-8 -*-
def input_int():
return int(input())
def answer():
n = input_int()
count = 0
for a in range(1, n):
b = (n - 1) // a
if b >= a:
count += (b - a) * 2
count += 1
else:
continue
print(count)
answer() | 0 | null | 1,325,942,305,540 | 16 | 73 |
def main():
n, k = map(int, input().split(" "))
h = list(map(int, input().split(" ")))
h.sort(reverse = True)
print(sum(h[k:]))
if __name__ == "__main__":
main() | n, k = map(int, input().split())
H = list(map(int, input().split()))
H.sort()
print(sum(H[:max(n-k, 0)])) | 1 | 79,380,464,681,980 | null | 227 | 227 |
inputa = input()
print(inputa.swapcase()) | n=int(input())
r=int(n**0.5+1)
ans=0
for i in range(2,r):
e=0
while n%i==0:
n//=i
e+=1
k=1
while e>=k:
e-=k
ans+=1
k+=1
if n!=1:
ans+=1
print(ans)
| 0 | null | 9,209,693,778,658 | 61 | 136 |
n = int(input())
a = list(map(int,input().split()))
ans = 0
m = a[0]
for i in range(1,n):
if a[i] <= m:
ans += -a[i]+m
else:
m = a[i]
print(ans)
| N = int(input())
A = list(map(int, list(input().split())))
total = 0
for i in range(1, N):
step = A[i-1] - A[i]
if step > 0 :
total = total + step
A[i] = A[i] + step
print(total) | 1 | 4,499,275,565,942 | null | 88 | 88 |
N = int(input())
ans = [0]*(1+N)
for x in range(1, 10**2+1):
for y in range(1, 10**2+1):
for z in range(1, 10**2+1):
v = x*x+y*y+z*z+x*y+y*z+z*x
if v<=N:
ans[v] += 1
for i in range(1, N+1):
print(ans[i]) | s=input()
a=[0]*(len(s)+1)
for i in range(len(s)):
if s[i]=="<":
a[i+1]=a[i]+1
for i in range(len(s)-1,-1,-1):
if s[i]==">":
a[i]=max(a[i],a[i+1]+1)
print(sum(a)) | 0 | null | 82,141,467,490,040 | 106 | 285 |
N, M, L = map(int, input().split())
dist = [[10**12] * N for _ in range(N)]
for i in range(N):
dist[i][i] = 0
for _ in range(M):
a, b, c = map(int, input().split())
if c <= L:
dist[a-1][b-1] = dist[b-1][a-1] = c
for k in range(N):
for i in range(N):
for j in range(N):
dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j])
old_dist = [row[:] for row in dist]
for i in range(N):
for j in range(N):
if old_dist[i][j] <= L:
dist[i][j] = 1
for k in range(N):
for i in range(N):
for j in range(N):
dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j])
Q = int(input())
for _ in range(Q):
start, end= map(int, input().split())
if dist[start-1][end-1] < 10**12:
print(dist[start-1][end-1] - 1)
else:
print(-1) | #!/usr/bin/env python3
import sys
from itertools import chain
# import numpy as np
# from itertools import combinations as comb
# from bisect import bisect_left, bisect_right, insort_left, insort_right
# from collections import Counter
def solve(N: int, P: "List[int]"):
min_p = P[0]
count = 0
for p in P:
if p <= min_p:
min_p = p
count += 1
return count
def main():
tokens = chain(*(line.split() for line in sys.stdin))
N = int(next(tokens)) # type: int
P = [int(next(tokens)) for _ in range(N)] # type: "List[int]"
answer = solve(N, P)
print(answer)
if __name__ == "__main__":
main()
| 0 | null | 129,609,746,055,828 | 295 | 233 |
def f(n):
res = 0
s = 0
for i in range(1,n+1):
s += i
if s <=n:
res = i
else:
break
return res
n = int(input())
p =2
ans = 0
while p*p <= n:
e = 0
while n%p == 0:
e += 1
n//=p
ans += f(e)
p +=1
if n >1:
ans += 1
print(ans) | H,W,K = map(int,input().split())
S = [[int(i) for i in input()] for l in range(H)]
posibility = set()
for i in range(1<<H-1):
SW = []
tmp = S[0]
counter = 0
for k in range(H-1):
if i>>k & 1:
SW.append(tmp)
tmp = S[k+1]
else:
tmp = [tmp[l]+S[k+1][l] for l in range(W)]
SW.append(tmp)
counter += len(SW)-1
max_counter = 0
for k in range(len(SW)):
max_counter = max(max(SW[k]),max_counter)
if max_counter >K:
continue
tmp_w = [SW[row][0] for row in range(len(SW))]
for w in range(W-1):
test = [tmp_w[row]+SW[row][w+1] for row in range(len(SW))]
if max(test)>K:
tmp_w = [SW[row][w+1] for row in range(len(SW))]
counter += 1
else:
tmp_w = test
posibility.add(counter)
print(min(posibility)) | 0 | null | 32,839,357,882,200 | 136 | 193 |
h = int(input())
num = 0
t = 0
while h != 1:
h = h//2
num += 2**t
t += 1
num += 2**t
print(num) | N=int(input())
A=list(map(int,input().split()))
mlt=0
for a in A:
mlt^=a
for i in range(N):
print(mlt^A[i],end=" ") | 0 | null | 46,498,615,748,330 | 228 | 123 |
import math
while True:
n=int(input())
if n==0:
break
else:
score=list(map(int,input().split()))
dev=math.sqrt(sum((x-sum(score)/len(score))**2 for x in score)/len(score))
print("{:.8f}".format(dev))
| import statistics
while True:
n = int(input())
if n == 0:
break
scores = list((int(x) for x in input().split()))
std = statistics.pstdev(scores)
print("{0:.8f}" . format(round(std,8)))
| 1 | 193,525,399,262 | null | 31 | 31 |
x = input()
if x == "1": print(0)
else: print(1)
| import math
import sys
# sys.setrecursionlimit(100000)
def input():
return sys.stdin.readline().strip()
def input_int():
return int(input())
def input_int_list():
return [int(i) for i in input().split()]
def main():
n = input_int()
_x = []
_y = []
for _ in range(n):
x, y = input_int_list()
# 座標系を45度回転させて考える
_x.append(x - y)
_y.append(x + y)
ans = max(max(_x) - min(_x), max(_y) - min(_y))
print(ans)
return
if __name__ == "__main__":
main()
| 0 | null | 3,128,739,328,458 | 76 | 80 |
a, b, c, d = map(int, input().split())
if -(-c//b) > -(-a//d):
print('No')
exit()
print('Yes')
| def main():
n = int(input())
a_list = list(map(int, input().split()))
all_xor = 0
for a in a_list:
all_xor ^= a
x_list = [a ^ all_xor for a in a_list]
print(*x_list, sep=" ")
if __name__ == "__main__":
main()
| 0 | null | 21,081,291,531,580 | 164 | 123 |
import math
a, b, n = list(map(int, input().split()))
x = min(n, b - 1)
ans = math.floor((a * x) / b) - a * math.floor(x / b)
print(ans)
| #!/usr/bin/env python3
# Generated by https://github.com/kyuridenamida/atcoder-tools
from typing import *
import itertools
import math
import sys
INF = float('inf')
def solve(A: int, B: int, C: int, K: int):
return min(K, A) - max(K-A-B, 0)
def main():
sys.setrecursionlimit(10 ** 6)
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
A = int(next(tokens)) # type: int
B = int(next(tokens)) # type: int
C = int(next(tokens)) # type: int
K = int(next(tokens)) # type: int
print(solve(A, B, C, K))
if __name__ == '__main__':
main()
| 0 | null | 24,753,946,177,702 | 161 | 148 |
a, b = input().split()
print(a * int(b) if a < b else b * int(a)) | import sys
import heapq
import math
import fractions
import bisect
import itertools
from collections import Counter
from collections import deque
from operator import itemgetter
def input(): return sys.stdin.readline().strip()
def mp(): return map(int,input().split())
def lmp(): return list(map(int,input().split()))
a,b=map(str,input().split())
print(int(a*int(b)) if int(a)<=int(b) else int(b*int(a))) | 1 | 84,335,793,081,440 | null | 232 | 232 |
import math
n = int(input())
a = list(map(int, input().split()))
f = [0]*10**7
def fctr_d(n):
c = 0
r = int(n**0.5)
for i in range(2, r+2):
while n % i == 0:
c += 1
n = n//i
if c != 0:
if f[i] != 0:
return False
else:
f[i] = True
c = 0
if n != 1:
if f[n] != 0:
return False
else:
f[n] = True
return True
pairwise_flag = True
for i in range(n):
m = a[i]
if not fctr_d(m):
pairwise_flag = False
break
setwise_flag = True
gcd = a[0]
for i in range(1, n):
gcd = math.gcd(gcd, a[i])
if gcd != 1:
setwise_flag = False
if pairwise_flag:
print("pairwise coprime")
else:
if setwise_flag:
print("setwise coprime")
else:
print("not coprime")
| import math
def GCD(a):
gcd = a[0]
N = len(a)
for i in range(1, N):
gcd = math.gcd(gcd, a[i])
return gcd
# 素因数分解
def fact(n):
arr = []
temp = n
for i in range(2, int(-(-n**0.5//1))+1):
if temp%i==0:
cnt=0
while temp%i==0:
cnt+=1
temp //= i
arr.append([i, cnt])
if temp!=1:
arr.append([temp, 1])
if arr==[]:
arr.append([n, 1])
return arr
n = int(input())
A = list(map(int, input().split()))
hst = [0] * (max(A) + 1)
for a in A:
F = fact(a)
for f in F:
hst[f[0]] += 1
if hst[f[0]] > 1 and f[0] != 1:
# ここでpairwise じゃないことが確定する
if GCD(A) == 1:
print("setwise coprime")
else:
print("not coprime")
exit()
print("pairwise coprime") | 1 | 4,115,876,294,050 | null | 85 | 85 |
import sys
n,k=map(int,input().split())
A=[]
mod=10**9+7
zero=0
a=list(map(int,input().split()))
for i in range(n):
if a[i]>0:
A.append([a[i],0])
elif a[i]<0:
A.append([-a[i],1])
else:
zero+=1
if k>n-zero:
print(0)
sys.exit()
A=list(reversed(sorted(A)))
cnt=0
for i in range(k):
cnt+=A[i][1]
chk=0
for i in range(n-zero):
chk+=A[i][1]
if cnt%2==0:
ans=1
for i in range(k):
ans=ans*A[i][0]%mod
print(ans)
elif chk==n-zero:
if zero>0:
print(0)
sys.exit()
ans=1
for i in range(k):
ans=ans*A[n-i-1][0]%mod
print((-ans)%mod)
elif k==n-zero:
ans=1
if zero>0:
print(0)
else:
for i in range(k):
ans=ans*A[i][0]%mod
print((-ans)%mod)
else:
if A[k][1]==0:
p=A[k][0]
m=0
for i in range(k+1,n-zero):
if A[i][1]==1:
m=A[i][0]
break
else:
m=A[k][0]
p=0
for i in range(k+1,n-zero):
if A[i][1]==0:
p=A[i][0]
break
#print(m,p)
if A[k-1][1]==0:
l=0
Xl=-1
for i in range(k-1):
if A[k-i-2][1]==1:
l=A[k-i-2][0]
Xl=k-i-2
break
#print(l,k)
if m*l>p*A[k-1][0] or Xl==-1:
ans=1
for i in range(k-1):
ans=ans*A[i][0]%mod
ans=ans*m%mod
print(ans)
else:
ans=1
for i in range(k):
if i==Xl:
continue
ans=ans*A[i][0]%mod
ans=ans*p%mod
print(ans)
else:
l=0
Xl=-1
for i in range(k-1):
if A[k-i-2][1]==0:
l=A[k-i-2][0]
Xl=k-i-2
break
#print(l,k)
if p*l>m*A[k-1][0] or Xl==-1:
ans=1
for i in range(k-1):
ans=ans*A[i][0]%mod
ans=ans*p%mod
print(ans)
else:
ans=1
for i in range(k):
if i==Xl:
continue
ans=ans*A[i][0]%mod
ans=ans*m%mod
print(ans) | n, k = map(int, input().split())
a = list(map(int, input().split()))
a_pos = sorted([i for i in a if i >= 0])
a_neg = sorted([i for i in a if i < 0], reverse=True)
mod = 10 ** 9 + 7
ans = 1
if len(a_pos) == 0 and k % 2:
for i in a_neg[:k]:
ans = ans * i % mod
print(ans)
exit()
while k > 0:
if k == 1 or len(a_neg) <= 1:
if len(a_pos) == 0:
ans *= a_neg.pop()
elif len(a_pos) > 0:
ans *= a_pos.pop()
k -= 1
elif len(a_pos) <= 1:
ans *= a_neg.pop() * a_neg.pop()
k -= 2
elif a_pos[-1] * a_pos[-2] > a_neg[-1] * a_neg[-2]:
ans *= a_pos.pop()
k -= 1
elif a_pos[0] * a_pos[1] <= a_neg[-1] * a_neg[-2]:
ans *= a_neg.pop() * a_neg.pop()
k -= 2
ans %= mod
print(ans) | 1 | 9,400,600,527,878 | null | 112 | 112 |
import sys
def I(): return int(sys.stdin.readline().rstrip())
N = I()
for i in range(int(N**.5),0,-1):
if N % i == 0:
print(i+(N//i)-2)
exit()
| # coding: utf-8
# Your code here!
import sys
import math
n=int(input())
ans=n
for i in range(1,int(math.sqrt(n))+1):
if n%i==0:
a=i
b=int(n/i)
if a+b-2<ans:
ans=a+b-2
print(ans)
| 1 | 161,815,129,356,270 | null | 288 | 288 |
s = []
while True:
hoge = input()
if hoge == '-':
break
num = int(input())
for i in range(num):
h = int(input())
hoge = hoge.replace(hoge,hoge[h:] + hoge[:h])
s += [hoge]
for i in s: print(i) | n = int(input())
playlists = []
for _ in range(n):
title, playtime = input().split()
playlists.append([title, int(playtime)])
titles, playtimes = list(zip(*playlists))
lastmusic = input()
lastmusic_timing = titles.index(lastmusic)
print(sum(playtimes[lastmusic_timing + 1:])) | 0 | null | 49,493,103,663,548 | 66 | 243 |
import sys
def gcd(a,b):
r= b % a
while r != 0:
a,b = r,a
r = b % a
return a
def lcm(a,b):
return int(a*b/gcd(a,b))
for line in sys.stdin:
a,b = sorted(map(int, line.rstrip().split(' ')))
print("{} {}".format(gcd(a,b),lcm(a,b))) | import sys
nums = []
for line in sys.stdin:
nums.append(line)
for i in range(len(nums)):
input_line = nums[i].split(" ")
a = int(input_line[0])
b = int(input_line[1])
if a > b:
num_bigger = a
num_smaller = b
else:
num_bigger = b
num_smaller = a
r = 1 #?????????
while r > 0:
r = num_bigger % num_smaller
num_bigger = num_smaller
num_smaller = r
max_common_div = num_bigger
min_common_mpl = int((a * b)/max_common_div)
print(str(max_common_div) + " " + str(min_common_mpl)) | 1 | 770,314,830 | null | 5 | 5 |
# coding: utf-8
# Here your code !
def func():
try:
word=input().rstrip().lower()
words=[]
while(True):
line=input().rstrip()
if(line == "END_OF_TEXT"):
break
else:
words.extend(line.lower().split(" "))
except:
return inputError()
print(words.count(word))
def inputError():
print("input Error")
return -1
func() | data = [
[[0 for k in range(10)] for j in range(3)] for i in range(4)
]
count = int(input())
for x in range(count):
(b,f,r,v) = [int(i) for i in input().split()]
data[b - 1][f - 1][r - 1] += v
for b in range(4):
for f in range(3):
print(' ',end='')
for r in range(10):
if r == 9:
print(data[b][f][r], end='')
else:
print(data[b][f][r], '', end='')
print()
if b == 3:
break
for x in range(20):
print('#',end='')
print() | 0 | null | 1,444,049,830,080 | 65 | 55 |
#!/usr/bin python3
# -*- coding: utf-8 -*-
r, c, k = map(int, input().split())
itm = [[0]*(c) for _ in range(r)]
for i in range(k):
ri, ci, vi = map(int, input().split())
itm[ri-1][ci-1] = vi
dp0 = [[0]*4 for c_ in range(3005)]
dp1 = [[0]*4 for c_ in range(3005)]
for i in range(r):
for j in range(c):
nowv = itm[i][j]
dp0[j][3] = max(dp0[j][3], dp0[j][2] + nowv)
dp0[j][2] = max(dp0[j][2], dp0[j][1] + nowv)
dp0[j][1] = max(dp0[j][1], dp0[j][0] + nowv)
dp0[j+1][0] = max(dp0[j+1][0], dp0[j][0])
dp0[j+1][1] = max(dp0[j+1][1], dp0[j][1])
dp0[j+1][2] = max(dp0[j+1][2], dp0[j][2])
dp0[j+1][3] = max(dp0[j+1][3], dp0[j][3])
dp1[j][0] = max(dp1[j][0], max(dp0[j]))
dp0 = dp1.copy()
print(max(dp1[c-1]))
| import sys
sys.setrecursionlimit(1 << 25)
read = sys.stdin.readline
ra = range
enu = enumerate
def exit(*argv, **kwarg):
print(*argv, **kwarg)
sys.exit()
def mina(*argv, sub=1): return list(map(lambda x: x - sub, argv))
# 受け渡されたすべての要素からsubだけ引く.リストを*をつけて展開しておくこと
def a_int(): return int(read())
def ints(): return list(map(int, read().split()))
def read_col(H):
'''H is number of rows
A列、B列が与えられるようなとき
ex1)A,B=read_col(H) ex2) A,=read_col(H) #一列の場合'''
ret = []
for _ in range(H):
ret.append(list(map(int, read().split())))
return tuple(map(list, zip(*ret)))
def read_tuple(H):
'''H is number of rows'''
ret = []
for _ in range(H):
ret.append(tuple(map(int, read().split())))
return ret
MOD = 10**9 + 7
INF = 2**31 # 2147483648 > 10**9
# default import
from collections import defaultdict, Counter, deque
'''
dp[i][j]...(0,0)からスタートして(i,j)に到達する経路のなかでの最大の価値
dp[i][j]=max(dp[i][j-1],dp[i-1][j]) + v[i][j]
dp[i][j][k] ... (0,0)からスタートして(i,j)に到達する経路のなかでi行目ですでにk(以下)個選んでいるときの最大の価値
遷移は、i,jのvを拾うときと拾わないときのmax
dp[i][j][k] = max(dp[i][j-1][k-1]+V[i,j], dp[i][j-1][k]
) #k個のままのほうが価値が高いかk-1から拾ったほうが価値が高いか
上からの遷移 # 拾うか拾わないかでこうかな
dp[i][j][0]=max(dp[i][j-1][0],max_k(dp[i-1][j]))
dp[i][j][1]=max(dp[i][j-1][0],max_k(dp[i-1][j][k])+V[i][j])
'''
R, C, K = ints()
RCV = read_tuple(K)
V = [[0] * C for _ in ra(R)]
for r, c, v in RCV:
V[r - 1][c - 1] = v
# dp = [[[0] * 4 for _ in ra(C)] for _ in ra(R)]
dp0 = [[0] * C for _ in ra(R)]
dp1 = [[0] * C for _ in ra(R)]
dp2 = [[0] * C for _ in ra(R)]
dp3 = [[0] * C for _ in ra(R)]
# dp[0][0][0] = 0
dp1[0][0] = V[0][0]
dp2[0][0] = V[0][0]
dp3[0][0] = V[0][0]
for j in ra(1, C):
dp1[0][j] = max(dp1[0][j - 1], dp0[0][j - 1] + V[0][j])
dp2[0][j] = max(dp2[0][j - 1], dp1[0][j - 1] + V[0][j])
dp3[0][j] = max(dp3[0][j - 1], dp2[0][j - 1] + V[0][j])
for i in ra(1, R):
dp0[i][0] = dp1[i - 1][0]
dp1[i][0] = dp0[i][0] + V[i][0]
# dp2[i][0] = dp0[i][0] + V[i][0]
# dp3[i][0] = dp0[i][0] + V[i][0]
for i in ra(1, R):
for j in ra(1, C):
ma = max(dp0[i - 1][j],
dp1[i - 1][j],
dp2[i - 1][j],
dp3[i - 1][j])
dp0[i][j] = max(dp0[i][j - 1], # 左
ma) # 上
dp1[i][j] = max(dp0[i][j - 1] + V[i][j], # 左から来て拾う
dp1[i][j - 1], # 拾わないほうが大きい場合もある
ma + V[i][j]) # 上から来て拾う
dp2[i][j] = max(dp1[i][j - 1] + V[i][j], dp2[i][j - 1])
dp3[i][j] = max(dp2[i][j - 1] + V[i][j], dp3[i][j - 1])
print(max(dp0[R - 1][C - 1],
dp1[R - 1][C - 1],
dp2[R - 1][C - 1],
dp3[R - 1][C - 1],
))
# print(*values, sep='\n')
# print(*dp, sep='\n')
# dp2 = [[-1] * C for _ in ra(R)]
# for i in ra(R):
# for j in ra(C):
# dp2[i][j] = max(dp[i][j])
# print(*dp2, sep='\n')
| 1 | 5,598,720,952,990 | null | 94 | 94 |
N = int(input())
S, T = map(str, input().split())
result = []
for i in range(N):
result.append(S[i])
result.append(T[i])
print(''.join(result)) | N=int(input())
S,T=input().split()
list=[]
i=0
while i<N:
list.append(S[i])
list.append(T[i])
i=i+1
print(*list, sep='') | 1 | 112,065,143,302,240 | null | 255 | 255 |
from collections import defaultdict
N,P=map(int,input().split())
S=input()
if P==2 or P==5:
ans=0
for i in range(N):
if int(S[i])%P==0:
ans+=i+1
print(ans)
else:
d=defaultdict(int)
a=0
for i in range(N):
a+=int(S[N-i-1])*pow(10,i,P)
a%=P
d[a]+=1
ans=d[0]
for v in d.values():
ans+=v*(v-1)//2
print(ans)
| from collections import defaultdict
N, P = map(int, input().split())
S = input().strip()[::-1]
if P in [2, 5]:
ans = 0
for r in range(N):
if int(S[r]) % P == 0:
ans += N - r
print(ans)
exit()
cum = [0] * (N + 1)
for i in range(N):
now = int(S[i]) * pow(10, i, P)
cum[i + 1] = (cum[i] + now) % P
cnt = defaultdict(int)
for _cum in cum:
cnt[_cum] += 1
ans = 0
for k, v in cnt.items():
ans += v * (v - 1) // 2
print(ans)
| 1 | 58,027,523,891,648 | null | 205 | 205 |
def main():
h,w,k=map(int,input().split())
s=[list(input()) for _ in range(h)]
ans=[[0]*w for _ in range(h)]
for idx in range(h):
if '#' in s[idx]:
i=idx
break
start,j,cnt,first=i,0,1,True
while i<h:
if j==w:
if first:
ans[i]=ans[i-1]
i+=1
j=0
continue
first=True
i+=1
j=0
cnt+=1
continue
if s[i][j]=='#':
if first:
first=False
ans[i][j]=cnt
j+=1
continue
cnt+=1
ans[i][j]=cnt
else:
ans[i][j]=cnt
j+=1
for i in range(start):
ans[i]=ans[start]
for i in range(h):
print(*ans[i])
if __name__=='__main__':
main() | H, W, K = map(int, input().split())
S = [input() for i in range(H)]
C = [[0 for i in range(W)] for j in range(H)]
L = []
u = 0
M = []
for i in range(H):
s = 0
for j in range(W):
if S[i][j] == '#':
s += 1
u += 1
C[i][j] = u
if s == 0:
L.append(i)
else:
M.append(i)
d = 0
for i in range(len(M)):
for j in range(W):
if C[M[i]][j] != 0:
for k in range(d, j):
C[M[i]][k] = C[M[i]][j]
d = j + 1
for k in range(d, W):
C[M[i]][k] = C[M[i]][d-1]
d = 0
ma, mi = max(M), min(M)
M.insert(0, -1)
for i in range(W):
for j in range(len(M)-1):
for k in range(M[j]+1, M[j+1]):
C[k][i] = C[M[j+1]][i]
for j in range(ma+1, H):
C[j][i] = C[ma][i]
for i in range(H):
for j in range(W):
if j != W-1:
print(C[i][j], end = ' ')
else:
print(C[i][j], end = '')
print() | 1 | 143,593,881,252,500 | null | 277 | 277 |
N = int(input())
A = list(map(int, input().split()))
A.sort()
Ans = "YES"
List = []
before_n = 0
for e in A:
if e == before_n:
Ans = "NO"
break
else:
before_n=e
print(Ans) | n,k=map(int,input().split());print(min(n%k,k-n%k)) | 0 | null | 56,670,110,576,168 | 222 | 180 |
n = int(input())
dic_A = set()
dic_C = set()
dic_G = set()
dic_T = set()
for i in range(n) :
p, string = input().split()
if p == 'insert' :
if string[0] == 'A' :
dic_A.add(string)
elif string[0] == 'C' :
dic_C.add(string)
elif string[0] == 'G' :
dic_G.add(string)
else :
dic_T.add(string)
else :
if string[0] == 'A' :
if string in dic_A :
print('yes')
else :
print('no')
elif string[0] == 'C' :
if string in dic_C :
print('yes')
else :
print('no')
elif string[0] == 'G' :
if string in dic_G :
print('yes')
else :
print('no')
else :
if string in dic_T :
print('yes')
else :
print('no')
| M = 1046527
POW = [pow(4, i) for i in range(13)]
def insert(dic, string):
# i = 0
# while dic[(hash1(string) + i*hash2(string)) % M]:
# i += 1
# dic[(hash1(string) + i*hash2(string)) % M] = string
dic[get_key(string)] = string
def find(dic, string):
# i = 0
# while dic[(hash1(string) + i*hash2(string)) % M] and dic[(hash1(string) + i*hash2(string)) % M] != string:
# i += 1
# return True if dic[(hash1(string) + i*hash2(string)) % M] == string else False
# print(dic[get_key(string)], string)
return True if dic[get_key(string)] == string else False
def get_num(char):
if char == "A":
return 1
elif char == "C":
return 2
elif char == "G":
return 3
else:
return 4
def get_key(string):
num = 0
for i in range(len(string)):
num += POW[i] * get_num(string[i])
return num
def main():
n = int(input())
dic = [None] * POW[12]
# print(dic)
for i in range(n):
order, string = input().split()
if order == "insert":
insert(dic, string)
else:
if find(dic, string):
print('yes')
else:
print('no')
if __name__ == "__main__":
main()
| 1 | 77,420,581,260 | null | 23 | 23 |
N = int(input())
dp = [[0]*10 for _ in range(10)]
for i in range(1, N+1):
if i%10==0: continue
strI = str(i)
f,l = strI[-1], strI[0]
dp[int(f)][int(l)] += 1
res = 0
for i in range(1,10):
for j in range(1,10):
res += dp[i][j] * dp[j][i]
print(res) | from _collections import deque
k = int(input())
l = [str(i) for i in range(1,10)]
que = deque(l)
while len(l) < k:
seq = que.popleft()
a = int(seq[-1])
if a != 0:
aa = seq + str(a-1)
que.append(aa)
l.append(aa)
aa = seq + str(a)
que.append(aa)
l.append(aa)
if a != 9:
aa = seq + str(a+1)
que.append(aa)
l.append(aa)
print(l[k-1])
| 0 | null | 63,243,485,882,808 | 234 | 181 |
N = int(input())
*A, = map(int, input().split())
ans = 0
for i, a in enumerate(A):
if (i + 1) & 1 and a & 1:
ans += 1
print(ans)
| N = input()
A = list(map(int,input().strip().split()))
ans = 0
for i in range(len(A)):
if i%2==0 and A[i]%2==1:
ans += 1
print(ans) | 1 | 7,768,962,279,262 | null | 105 | 105 |
t = input()
n = int(input())
for i in range(n):
orders = input().split()
order = orders[0]
a = int(orders[1])
b = int(orders[2])
if order == "replace":
word = orders[3]
t = t[:a] + word + t[b+1:]
if order == "print":
print(t[a:b+1])
if order == "reverse":
t = t[:a] + t[a:b+1][::-1]+ t[b+1:]
| import math
n,k=map(int,input().split())
a=list(map(int,input().split()))
left=1
right=10**9
while left<right:
cnt=0
mid=(left+right)//2
for i in range(n):
cnt+=math.ceil(a[i]/mid)-1
if cnt<=k:
right=mid
else:
left=mid+1
print(left) | 0 | null | 4,284,999,808,230 | 68 | 99 |
import bisect
n = int(input())
A = tuple(map(int,input().split()))
q = int(input())
Q = tuple(map(int, input().split()))
dp = [0]*(2**n)
for i in range(n):
for j in range(1<<i):
dp[j+(1<<i)] = dp[j] + A[i]
dp.sort()
for n in Q:
i = bisect.bisect(dp, n)
print("yes" if i>0 and n==dp[i-1] else "no") | N = int(input().rstrip())
A = [int(_) for _ in input().rstrip().split(" ")]
Q = int(input().rstrip())
M = [int(_) for _ in input().rstrip().split(" ")]
import itertools
from functools import lru_cache
@lru_cache(maxsize=2**12)
def solve(i, m):
if m == 0:
return True
elif i >= N:
return False
res = solve(i+1, m) or solve(i+1, m - A[i])
return res
for m in M:
if solve(0, m):
print("yes")
else:
print("no")
| 1 | 96,273,814,350 | null | 25 | 25 |
s = raw_input()
ans = ""
for i in range(len(s)):
if('A' <= s[i] and s[i] <= 'Z'):
ans += s[i].lower()
elif('a' <= s[i] and s[i] <= 'z'):
ans += s[i].upper()
else:
ans += s[i]
print(ans) | 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) | 1 | 1,496,357,823,072 | null | 61 | 61 |
N = int(input())
xy = [list(map(int,input().split())) for i in range(N)]
print(sum(((xi-xj)**2 + (yi-yj)**2) **0.5 for xi,yi in xy for xj,yj in xy) / N)
| def main():
N, M = map(int, input().split())
H = list(map(int, input().split()))
connected = dict()
for _ in range(M):
A, B = map(int, input().split())
if A not in connected:
connected[A] = H[B-1]
else:
connected[A] = max(connected[A], H[B-1])
if B not in connected:
connected[B] = H[A-1]
else:
connected[B] = max(connected[B], H[A-1])
ans = 0
for i in range(1, N+1):
if i not in connected:
ans += 1
elif H[i-1] > connected[i]:
ans += 1
return ans
if __name__ == '__main__':
print(main())
| 0 | null | 86,535,997,755,516 | 280 | 155 |
import sys
n, a, b = map(int, input().split())
mod = 10**9 + 7
sys.setrecursionlimit(10**9)
def f(x):
if x == 0:
return 1
elif x % 2 == 0:
return (f(x // 2) ** 2) % mod
else:
return (f(x - 1) * 2) % mod
def comb(n,k,p):
"""power_funcを用いて(nCk) mod p を求める"""
from math import factorial
if n<0 or k<0 or n<k: return 0
if n==0 or k==0: return 1
a=factorial(n) %p
b=factorial(k) %p
c=factorial(n-k) %p
return (a*power_func(b,p-2,p)*power_func(c,p-2,p))%p
def power_func(a,b,p):
"""a^b mod p を求める"""
if b==0: return 1
if b%2==0:
d=power_func(a,b//2,p)
return d*d %p
if b%2==1:
return (a*power_func(a,b-1,p ))%p
# 互いに素なa,bについて、a*x+b*y=1の一つの解
def extgcd(a, b):
r = [1, 0, a]
w = [0, 1, b]
while w[2] != 1:
q = r[2] // w[2]
r2 = w
w2 = [r[0] - q * w[0], r[1] - q * w[1], r[2] - q * w[2]]
r = r2
w = w2
# [x,y]
return [w[0], w[1]]
# aの逆元(mod m)を求める。(aとmは互いに素であることが前提)
def mod_inv(a, m):
x = extgcd(a, m)[0]
return (m + x % m) % m
def nCm(a):
ans = 1
for i in range(a):
ans *= n - i
ans %= mod
for i in range(1, a+1):
ans *= mod_inv(i, mod)
ans %= mod
return ans
base = f(n)
comb_a = nCm(a)
comb_b = nCm(b)
print((base - comb_a - comb_b - 1) % mod)
|
mod = (10 ** 9 + 7)
def comb(n, r):
p, q = 1, 1
for i in range(r):
p = p *(n-i)%mod
q = q *(i+1)%mod
return p * pow(q, mod-2, mod) % mod
n, a, b = list(map(int, input().split()))
s = pow(2, n, mod) - 1
print((s - comb(n, a) - comb(n, b)) % mod) | 1 | 66,449,547,455,328 | null | 214 | 214 |
import collections
import sys
input = sys.stdin.readline
def main():
N = int(input())
S = [input().rstrip() for _ in range(N)]
c = collections.Counter(S).most_common()
max_freq = None
max_S = []
for s, freq in c:
if max_freq is None:
max_freq = freq
max_S.append(s)
elif freq == max_freq:
max_S.append(s)
else:
break
print('\n'.join(sorted(max_S)))
if __name__ == "__main__":
main()
| import sys
input = sys.stdin.buffer.readline
import numpy as np
def main():
N,K = map(int,input().split())
a = list(map(int,input().split()))
f = list(map(int,input().split()))
a.sort()
f.sort(reverse=True)
if sum(a) <= K:
print(0)
else:
a = np.array(a)
f = np.array(f)
left,right = 0,max(a)*max(f)
while right-left > 1:
mid = (left+right)//2
pra = a-mid//f
pra[pra<0] = 0
if np.sum(pra) > K:
left = mid
else:
right = mid
print(right)
if __name__ == "__main__":
main()
| 0 | null | 117,744,735,196,854 | 218 | 290 |
from itertools import combinations as combi
N, M, Q = map(int, input().split())
ABCD = [list(map(int, input().split())) for _ in range(Q)]
#/##//####
# M-1+N C N
max_num = 0
for l in combi(range(M-1+N), N):
x = [t-s for t, s in zip(l, range(N))]
# print(x)
score = sum(d for a, b, c, d in ABCD if x[b-1]-x[a-1] == c)
max_num = max(max_num, score)
print(max_num)
| s = list(map(int, input().split()))
N = s[0]
A = s[1]
B = s[2]
if (B - A) % 2 == 0:
print((B - A) // 2)
else:
print(min(A - 1,N - B) + 1 + (B - A - 1) // 2) | 0 | null | 68,642,263,652,858 | 160 | 253 |
n = int(input())
ans = ""
while n:
n -= 1
ans += chr(ord('a') + (n % 26))
n //= 26
print(ans[::-1])
| N = int(input().strip())
ans = ''
while N > 0:
ans = chr(ord('a') + (N-1) % 26) + ans
N = (N -1) // 26
print(ans)
| 1 | 11,867,374,221,680 | null | 121 | 121 |
from collections import Counter
s=input()
n=len(s)
M=[0]
mod=2019
for i in range(n):
m=(M[-1]+int(s[n-1-i])%mod*pow(10,i,mod))%mod
M.append(m)
MC=Counter(M)
r=0
for v in MC.values():
if v>1:
r+=v*(v-1)//2
print(r) | def main():
def modpow(x, n, mod):
res = 1
while n:
if n % 2:
res *= x % mod
x *= x % mod
n >>= 1
return res
s = input()
s = s[::-1]
s_len = len(s)
mod = 2019
d = [0] * mod
d[0] = 1
rev_num = 0
# 2以上なら共通するmodがあったということになる
for i in range(s_len):
rev_num += int(s[i]) * int(modpow(10, i, mod))
rev_num %= mod
d[rev_num] += 1
# 2以上同じmodがあったらそこから2つ選ぶ選び方
# それを全てのmodで
print(sum(i*(i-1)//2 for i in d))
if __name__ == '__main__':
main() | 1 | 30,672,439,520,690 | null | 166 | 166 |
def main():
n = int(input())
As = list(map(int, input().split()))
ans = 1
if 0 in As:
print(0)
return
for a in As:
ans *= a
if ans > 10**18:
print(-1)
return
print(ans)
if __name__ == '__main__':
main()
| N = int(input())
A = list(map(int, input().split(' ')))
uniqu_a = list(set(A))
if N == len(uniqu_a):
print('YES')
else:
print('NO') | 0 | null | 45,245,418,707,468 | 134 | 222 |
A,B,m=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
tmp=min(a)+min(b)
for i in range(m):
x,y,c=map(int,input().split())
if a[x-1]+b[y-1]-c<tmp:
tmp=a[x-1]+b[y-1]-c
print(tmp) | n, m = map(int, input().split())
account, wacount = 0, 0
acdic = [0] * (n + 10)
for _ in range(m):
p, s = input().split()
p = int(p)
if s == "AC" and acdic[p] <= 0:
account += 1
wacount += abs(acdic[p])
acdic[p] = 1
elif s == "WA" and acdic[p] <= 0:
acdic[p] -= 1
print(account, wacount) | 0 | null | 73,343,567,178,378 | 200 | 240 |
N = int(input())
says = []
for _ in range(N):
A = int(input())
say = [list(map(int, input().split())) for _ in range(A)]
says.append(say)
# print(says)
max_upright_count = 0
for i in range(1 << N):
integrate = True
upright_count = 0
declares = [-1 for _ in range(N)]
for j in range(N):
if not integrate:
continue
# もし真偽不明の場合は正しいことを言う場合もあるから無視する
if (i >> j & 1) == 1:
upright_count += 1
for x, y in says[j]:
# print(i, j, x, y, declares)
if declares[x - 1] == -1:
declares[x - 1] = y
else:
if declares[x - 1] == y:
continue
else:
integrate = False
break
# print(bin(i), integrate, declares, upright_count)
for j in range(N):
# print((i >> j) & 1, declares[j])
if ((i >> j) & 1) != declares[j] and declares[j] != -1:
# print(False)
integrate = False
# print(integrate)
if integrate:
max_upright_count = max(max_upright_count, upright_count)
print(max_upright_count)
| n = input()
sum_of_digits = 0
for d in n:
sum_of_digits += int(d)
print('Yes' if sum_of_digits%9 == 0 else 'No') | 0 | null | 63,320,670,035,066 | 262 | 87 |
n,m,l = map(int, input().split())
wf=[[float("inf") for i in range(n)] for j in range(n)]
for i in range(m):
a,b,c = list(map(int,input().split()))
wf[a-1][b-1] = c
wf[b-1][a-1] = c
q = int(input())
st=[list(map(int,input().split())) for i in range(q)]
from scipy.sparse.csgraph import floyd_warshall
for i in range(n):
wf[i][i]=0
wf=floyd_warshall(wf)
for i in range(n):
for j in range(n):
if wf[i][j] <= l:
wf[i][j] = 1
else:
wf[i][j] = float("inf")
wf=floyd_warshall(wf)
for que in st:
s,t=que
if wf[s-1][t-1] == float("inf"):
print(-1)
else:
print(int(wf[s-1][t-1]-1)) | import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")
n,m,l = list(map(int, input().split()))
from collections import defaultdict
ns = defaultdict(set)
for i in range(m):
a,b,c = map(int, input().split())
a-=1
b-=1
if c<=l:
ns[a].add((c,b))
ns[b].add((c,a))
def wf(ns):
"""全頂点間距離
"""
d = [[float("inf")]*n for _ in range(n)]
for i in range(n):
for t,j in ns[i]:
d[i][j] = t
d[i][i] = 0
for k in range(n):
for i in range(n):
for j in range(n):
d[i][j] = min(d[i][j], d[i][k]+d[k][j])
return d
dist = wf(ns)
ns2 = defaultdict(set)
for i in range(n):
for j in range(i+1,n):
if dist[i][j]<=l:
ns2[i].add((1,j))
ns2[j].add((1,i))
ddist = wf(ns2)
q = int(input())
ans = [None]*q
for i in range(q):
s,t = map(int, input().split())
s-=1
t-=1
if dist[s][t]==float("inf"):
ans[i] = -1
else:
ans[i] = ddist[s][t] - 1
write("\n".join(map(str, ans))) | 1 | 173,771,273,435,708 | null | 295 | 295 |
#coding = utf-8
import math
a, b, c = map(float, raw_input().split())
h = b * math.sin(math.pi*c/180)
s = a * h / 2
x = math.sqrt(h**2 + (a-b*math.sin(math.pi*(90-c)/180))**2)
l = a + b + x
#print "%.8f, %.8f, %.8f" % (s, l, h)
print "\n".join([str(s), str(l), str(h)])
#print "%.1f, %.1f, %.1f" % (s, l, h) | A, B, K = map(int, input().split())
a = max(0, A - K)
b = B
if K - A > 0:
b = max(0, B - K + A)
print(a, b)
| 0 | null | 52,375,380,579,350 | 30 | 249 |
import sys
INF = 1 << 60
MOD = 10**9 + 7 # 998244353
sys.setrecursionlimit(2147483647)
input = lambda:sys.stdin.readline().rstrip()
class UnionFind(object):
def __init__(self, n, recursion = False):
self._par = list(range(n))
self._size = [1] * n
self._recursion = recursion
def root(self, k):
if self._recursion:
if k == self._par[k]:
return k
self._par[k] = self.root(self._par[k])
return self._par[k]
else:
root = k
while root != self._par[root]: root = self._par[root]
while k != root: k, self._par[k] = self._par[k], root
return root
def unite(self, i, j):
i, j = self.root(i), self.root(j)
if i == j: return False
if self._size[i] < self._size[j]: i, j = j, i
self._par[j] = i
self._size[i] += self._size[j]
return True
def is_connected(self, i, j):
return self.root(i) == self.root(j)
def size(self, k):
return self._size[self.root(k)]
def resolve():
n, m = map(int, input().split())
uf = UnionFind(n)
for _ in range(m):
u, v = map(int, input().split())
u -= 1; v -= 1
uf.unite(u, v)
ans = len(set(uf.root(v) for v in range(n))) - 1
print(ans)
resolve() | a,b,c=map(int, input().split())
#たこ焼きが余るかの場合分け
if a%b==0:
Q=a//b
#ちょうど焼ききる
else:
Q=a//b+1
#余る
print(Q*c)#回数×時間
#完了
| 0 | null | 3,278,049,555,810 | 70 | 86 |
terms = '1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51'.split(', ')
print(terms[int(input()) - 1]) | mlist = list([1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51])
b = int(input())
print(mlist[b-1]) | 1 | 49,973,919,472,860 | null | 195 | 195 |
A = list(map(int , input().split()))
B = list(map(int , input().split()))
print(sum(sorted(B)[:A[1]])) | a = input()
if a[2] != a[3]:
print("No")
elif a[4] != a[5]:
print("No")
else:
print("Yes") | 0 | null | 26,809,981,690,490 | 120 | 184 |
#!/usr/bin python3
# -*- coding: utf-8 -*-
h, n = map(int, input().split())
ab = [list(map(int, input().split())) for _ in range(n)]
#DP[i] = i までの魔法でモンスターの体力を減らすため消耗する魔力の最小値
dp = [0] * 20001
for i in range(h):
dp[i] = min(dp[i-a] + b for a, b in ab)
print(dp[h-1])
| def main():
a,b,c=map(int,input().split())
if a<b<c:
print('Yes')
else:
print('No')
if __name__=='__main__':
main()
| 0 | null | 40,538,748,440,672 | 229 | 39 |
from math import sqrt
N = int(input())
X = []
Y = []
for i in range(N):
x, y = map(int, input().split())
X.append(x)
Y.append(y)
ans = 0
for i in range(0, N-1):
for j in range(i+1, N):
ans += sqrt((X[i] - X[j]) ** 2 + (Y[i] - Y[j]) ** 2)
print(ans * 2.0 / N) | a, b = map(int, input().split())
aa = ""
for i in range(b):
aa += str(a)
bb = ""
for i in range(a):
bb += str(b)
if a <= b :
print(aa)
else :
print(bb) | 0 | null | 115,834,963,814,368 | 280 | 232 |
i = 1
while True:
x = int(raw_input())
if x == 0:
break
else:
print "Case %d: %d" % (i, x)
i += 1 | x = []
while True:
if 0 in x:
break
x.append(int(input()))
x.pop()
for i, v in enumerate(x):
print(('Case %d: %d') % (i+1, v)) | 1 | 500,689,608,340 | null | 42 | 42 |
from itertools import permutations
import math
n = int(input())
x,y = [],[]
for _ in range(n):
x_, y_ =map(int,input().split())
x.append(x_)
y.append(y_)
c = list(permutations([i for i in range(1,n+1)],n))
g = [[-1]*(n+1) for _ in range(n+1)]
sum = 0
for ci in (c):
tmp = 0
for i in range(len(ci)-1):
if g[ci[i]][ci[i+1]] == -1:
tmp += math.sqrt((x[ci[i]-1]-x[ci[i+1]-1])**2
+ (y[ci[i]-1]-y[ci[i+1]-1])**2)
else:
tmp += g[ci[i]][ci[i+1]]
sum += tmp
print(sum/len(c)) | import numpy as np
import math
n=int(input())
a=[]
for i in range(n):
a.append(list(map(int,input().split())))
a=np.array(a, dtype=object)
ans=0
for i in range(n):
for j in range(n):
if i==j:
continue
else:
x= (a[i]-a[j])**2
hei=math.sqrt(sum(x))
ans+= hei/n
print(ans)
| 1 | 148,790,729,286,868 | null | 280 | 280 |
n = int(input())
x = input()
a = x.count('1')
b = int(x,2)
# print (b)
ary = [None for i in range(200010)]
ary[0] = 0
def f(n):
if ary[n] is not None:
return ary[n]
b = bin(n).count('1')
r = 1 + f(n%b)
ary[n] = r
return ary[n]
a1 = a + 1
a0 = a - 1
for i in range(200010):
f(i)
one = [1] * 200010
zero = [1] * 200010
for i in range(1, 200010):
if a0 != 0:
one[i] = one[i-1] * 2 % a0
zero[i] = zero[i-1] * 2 % a1
ans = [0 for i in range(n)]
c1 = b%a1
if a0 != 0:
c0 = b%a0
for i in range(n-1, -1, -1):
if x[n-1-i] == '0':
y = c1 + zero[i]
# y = x %a1
y %= a1
print (ary[y]+1)
else:
if a0 != 0:
y = c0 - one[i]
y %= a0
print (ary[y]+1)
else:
print (0)
# ans.reverse()
# for i in ans:
# print (i) | def main():
print(input().swapcase())
if __name__ == '__main__':
main()
| 0 | null | 4,878,852,050,022 | 107 | 61 |
s=input()
a,b,c,d=0,0,0,0
for i in range(len(s)):
if s[i]==">":
c=0;b+=1
if b<=d:a+=b-1
else:a+=b
else:b=0;c+=1;a+=c;d=c
print(a) | from itertools import groupby
S=input()
T=groupby(S)
s=0
total=0
keys=[]
groups=[]
for key,group in T:
keys.append(key)
groups.append(len(list(group)))
if keys[0]==">":
total+=sum([i for i in range(groups[0]+1)])
if keys[-1]=="<":
total+=sum([i for i in range(groups[-1]+1)])
for i in range(len(keys)-1):
if keys[i]=="<":
if groups[i]<=groups[i+1]:
total+=sum([j for j in range(groups[i])])
total+=sum([j for j in range(groups[i+1]+1)])
else:
total+=sum([k for k in range(groups[i]+1)])
total+=sum([k for k in range(groups[i+1])])
print(total) | 1 | 156,305,946,359,772 | null | 285 | 285 |
num = list(map(int,input().split()))
print(num[2],num[0],num[1]) | import math
import itertools
def gcd(lst):
return math.gcd(math.gcd(lst[0],lst[1]), lst[2])
k = int(input())
lst = [i for i in range(1,k+1)]
itr = itertools.combinations_with_replacement(lst, 3)
ans = 0
for i in itr:
st = set(i)
num = len(st)
if num == 1:
ans += i[0]
elif num == 2:
a,b = st
ans += math.gcd(a,b) * 3
else:
ans += math.gcd(math.gcd(i[0],i[1]), i[2]) * 6
print(ans) | 0 | null | 36,988,110,791,062 | 178 | 174 |
a = int(input())
b = list(map(int, input().split()))
b = sorted(b)
c = b[0]
if c == 0:
print(c)
exit()
else:
for i in range(a-1):
c *= b[i+1]
if c > 1000000000000000000:
break
if c > 1000000000000000000:
print(-1)
else:
print(c) | class Dice:
__slots__ = ['n1', 'n2', 'n3', 'n4', 'n5', 'n6']
def __init__(self, n_tup):
self.n1 = n_tup[0]
self.n2 = n_tup[1]
self.n3 = n_tup[2]
self.n4 = n_tup[3]
self.n5 = n_tup[4]
self.n6 = n_tup[5]
def roll(self, direction):
if direction == "N":
self.n1, self.n2, self.n6, self.n5 \
= self.n2, self.n6, self.n5, self.n1
elif direction == "E":
self.n1, self.n3, self.n6, self.n4 \
= self.n4, self.n1, self.n3, self.n6
if direction == "S":
self.n1, self.n2, self.n6, self.n5 \
= self.n5, self.n1, self.n2, self.n6
if direction == "W":
self.n1, self.n3, self.n6, self.n4 \
= self.n3, self.n6, self.n4, self.n1
dice = Dice([int(x) for x in input().split()])
cmd = input()
for i in range(len(cmd)):
dice.roll(cmd[i])
print(dice.n1) | 0 | null | 8,190,488,325,140 | 134 | 33 |
n,x,mod = map(int,input().split())
num = []
ans = cnt = 0
ch = x
while True:
if ch not in num:
num.append(ch)
else:
st = ch
break
ch *= ch
ch %= mod
index = num.index(st)
if (len(num)-index) != 0:
rest = (n-index)%(len(num)-index)
qu = (n-index)//(len(num)-index)
else:
rest = n
qu = 0
if n <= index + 1:
ans = sum(num[:n])
else:
ans = sum(num[:index]) + sum(num[index:index+rest]) + sum(num[index:])*qu
print(ans) | N,X,M=map(int,input().split())
table=[X]
visited=[-1]*M
visited[X]=1
ans=X
for i in range(N-1):
nx=table[i]**2
nx%=M
if visited[nx]>0:
first=table.index(nx)
oneloop=i+1-first
rest=N-i-1
loops=rest//oneloop
totalofoneloop=sum(table[first:])
ans+=totalofoneloop*loops
remain=rest%oneloop
ans+=sum(table[first:first+remain])
print(ans)
exit()
else:
table.append(nx)
visited[nx]=1
ans+=nx
print(ans) | 1 | 2,769,415,790,164 | null | 75 | 75 |
X=sorted(map(int,input().split()));print(X[0],X[1],X[2]) | list = []
a, b, c = map(list.append, raw_input().split())
list = sorted(list)
for i in range(3):
print list[i], | 1 | 430,706,206,656 | null | 40 | 40 |
N = int(input())
A = list(map(int, input().split()))
if 0 in A:
print(0)
exit()
prod = 1
for a in A:
prod *= a
if prod > 1e18:
print(-1)
exit()
print(prod) | a,b,c=map(int,input().split(' '))
a,b,c=c,a,b
print(str(a)+" "+str(b)+" "+str(c))
| 0 | null | 27,098,412,024,512 | 134 | 178 |