code1
stringlengths 16
24.5k
| code2
stringlengths 16
24.5k
| similar
int64 0
1
| pair_id
int64 2
181,637B
⌀ | question_pair_id
float64 3.71M
180,628B
⌀ | code1_group
int64 1
299
| code2_group
int64 1
299
|
|---|---|---|---|---|---|---|
d, t, s = map(int, input().split())
if s * t >= d:
print("Yes")
else:
print("No") | d,t,s = map(int,input().split())
print("Yes" if d <= t*s else "No") | 1 | 3,537,129,893,628 | null | 81 | 81 |
a,b = map(int,input().split())
ans = str(min(a,b))*max(a,b)
print(ans) |
string = list(raw_input())
q = input()
List = [0]*q
for i in range(q):
List[i] = raw_input().split()
List[i][1:3] = map(int,List[i][1:3])
if List[i][0] == 'print' :
print '%s' %"".join(string[List[i][1]:List[i][2]+1])
elif List[i][0] == 'reverse':
s = [0] * (List[i][2]-List[i][1])
s = reversed(string[List[i][1]:List[i][2]+1])
string[List[i][1]:List[i][2]+1] = s
else :
string[List[i][1]:List[i][2]+1] = list(List[i][3]) | 0 | null | 43,481,806,948,840 | 232 | 68 |
N = int(input())
A = list(map(int, input().split()))
cnt = [0] * (100001)
ans = sum(A)
for a in A:
cnt[a] += 1
Q = int(input())
for _ in range(Q):
B, C = map(int, input().split())
cnt[C] += cnt[B]
ans += cnt[B] * (C-B)
cnt[B] = 0
print(ans) | import sys, math
input = sys.stdin.readline
rs = lambda: input().strip()
ri = lambda: int(input())
rl = lambda: list(map(int, input().split()))
mod = 10**9 + 7
N = ri()
print(math.ceil(N / 2) / N)
| 0 | null | 94,224,062,834,820 | 122 | 297 |
a,*b=[],
for z in[*open(0)][1:]:x,y=map(int,z.split());a+=x+y,;b+=x-y,
print(max(max(a)-min(a),max(b)-min(b))) | def Bfun():
vals = [int(i) for i in input().split()]
a = vals[0]
b = vals[1]
c = vals[2]
d = vals[3]
res2 = a//d + (1 if(a % d > 0) else 0)
res1 = c//b + (1 if(c % b > 0) else 0)
res = "Yes" if(res1 <= res2) else "No"
print(res)
Bfun() | 0 | null | 16,507,309,754,520 | 80 | 164 |
a = input().split()
if int(a[0]) <= int(a[1]) * 2:
print("0")
else:
print(int(int(a[0]) - int(a[1]) * 2)) | A,B = map(int,input().split())
ans=int(A-B*2)
print(ans if ans >= 0 else 0) | 1 | 166,506,223,997,370 | null | 291 | 291 |
import math
a, b, x = map(int, input().split())
if a*a*b >= 2*x:
print(math.degrees(math.atan2(a*b*b,2*x)))
else:
print(math.degrees(math.atan2(2*(a*a*b-x),a**3))) | from decimal import Decimal
import math
a, b, x = list(map(Decimal, input().split()))
if a * a * b > 2 * x:
tri = x / a
c = tri * Decimal(2) / b
d = (c ** 2 + b ** 2) ** Decimal("0.5")
cos_a = (b ** 2 + d ** 2 - c ** 2) / (2*b*d)
print(90 - math.degrees(math.acos(cos_a)))
else:
tri = (a * a * b - x) / a
e = tri * Decimal(2) / a
f = (a ** 2 + e ** 2) ** Decimal("0.5")
cos_e = (f ** 2 + a ** 2 - e ** 2) / (2*f*a)
print(math.degrees(math.acos(cos_e)))
#print(cosin)
| 1 | 163,307,033,490,398 | null | 289 | 289 |
k=int(input())
a=7%k
for i in range(k+1):
if a==0:
print(i+1)
break
a=(a*10+7)%k
else:
print(-1) | #!/usr/bin/python
ar = []
while True:
tmp = [int(i) for i in input().split()]
if tmp == [0,0]:
break
else:
ar.append(tmp)
for i in range(len(ar)):
for j in range(ar[i][0]):
for k in range(ar[i][1]):
if j == 0 or j == ar[i][0] - 1 or k == 0 or k == ar[i][1] - 1:
print('#' , end='' if k !=ar[i][1]-1 else '\n' if j != ar[i][0]-1 else '\n\n')
else:
print('.' , end='' if k !=ar[i][1]-1 else '\n' if j != ar[i][0]-1 else '\n\n') | 0 | null | 3,443,002,649,880 | 97 | 50 |
s = input()
t = input()
if (s == t[0:len(s)]) and (len(s)+1 == len(t)):
print("Yes")
else:
print("No") | s = list(input())
t = list(input())
t.pop(-1)
for i in range(len(t)):
if s[i] != t[i]:
print('No')
exit()
print('Yes') | 1 | 21,271,425,366,186 | null | 147 | 147 |
import sys
import collections
ri = lambda: int(sys.stdin.readline())
rl = lambda: list(map(int, sys.stdin.readline().split()))
n = ri()
a = rl()
c = collections.Counter(a)
t = 0
for v in c.values():
t += v*(v-1)//2
for i in a:
print(t-c[i]+1)
| c=1
while 1:
n=input()
if n:print'Case %d: %d'%(c,n)
else:break
c+=1 | 0 | null | 24,078,004,744,420 | 192 | 42 |
def solve():
X = [int(i) for i in input().split()]
for i in range(len(X)):
if X[i] == 0:
print(i+1)
break
if __name__ == "__main__":
solve() | a = list(map(int, input().split()))
c = 0
for b in a:
c = c + 1
if b == 0:
print(c) | 1 | 13,545,462,349,760 | null | 126 | 126 |
import collections
N=int(input())
A=[x for x in input().split()]
c = collections.Counter(A)
for i in range(N):
print(c["{}".format(str(i+1))]) | nn = int(input())
aa = list(map(int,input().split()))
joushi = [0]*nn
for i in range(len(aa)):
joushi[aa[i]-1] += 1
for j in range(len(joushi)):
print(joushi[j])
| 1 | 32,571,994,971,680 | null | 169 | 169 |
X, Y, a, b, c = map(int, input().split())
A = list(map(int, input().split())) # 赤色
B = list(map(int, input().split())) # 緑色
C = list(map(int, input().split())) # 無色, 赤色にも緑色にもなれる
A.sort(reverse=True)
B.sort(reverse=True)
# C.sort(reverse=True)
top_x_of_A = A[:X]
top_Y_of_B = B[:Y]
top_x_of_A.extend(top_Y_of_B)
C.extend(top_x_of_A)
C.sort(reverse=True)
print(sum(C[:X+Y]))
| n,k=map(int,input().split())
a=list(map(int,input().split()))
f=list(map(int,input().split()))
a.sort()
f.sort(reverse=True)
ok=10**15
ng=-1
while ok-ng>1:
check=(ok+ng)//2
cnt=0
for i in range(n):
cnt+=(max(0,a[i]-check//f[i]))
if cnt > k:ng = (ok+ng)//2
else: ok = (ok+ng)//2
print(ok) | 0 | null | 104,832,154,481,372 | 188 | 290 |
def LI():
return list(map(int, input().split()))
X = int(input())
ans = X//500*1000
X = X % 500
ans += X//5*5
print(ans)
| X = int(input())
yen_500 = X // 500
yen_5 = (X % 500) // 5
print(yen_500 * 1000 + yen_5 * 5) | 1 | 42,560,985,720,152 | null | 185 | 185 |
s=list(input())
t=list(input())
ans=[]
for i in range(len(s)-len(t)+1):
u=s[i:len(t)+i]
a=0
for j in range(len(t)):
if not t[j-1]==u[j-1]:
a=a+1
ans.append(a)
print(min(ans)) | list_data = [input() for _ in range(2)]
s = list_data[0]
t = list_data[1]
len_t = len(t)
max_correct = 0
for i in range(len(s)-len(t)+1):
correct = 0
for j in range(len(t)):
if s[i+j] == t[j]:
correct += 1
if max_correct < correct:
max_correct = correct
print(len_t - max_correct) | 1 | 3,674,061,250,492 | null | 82 | 82 |
N = int(input())
A = list(map(int, input().split()))
B = [0]*60
mod = 10 ** 9 + 7
for x in A:
temp = bin(x)[2:]
for i in range(len(temp)):
if temp[-1-i] == "1":
B[i] += 1
ans = 0
for i in range(60):
ans += (N-B[i])*B[i]*pow(2, i, mod)
ans %= mod
print(ans)
| from sys import stdin
def I(): return int(stdin.readline().rstrip())
def LI(): return list(map(int,stdin.readline().rstrip().split()))
if __name__=='__main__':
mod = 10**9 + 7
n = I()
a = LI()
ans = 0
for i in range(60):
c1 = 0
for rep in a:
if (rep>>i)&1:
c1 += 1
ans += ((n-c1)*c1*(2**i)%mod)%mod
print(ans%mod) | 1 | 123,255,095,517,168 | null | 263 | 263 |
N=int(input())
A=list(map(int,input().split()))
B=sum(A)
b=0
ans=202020202020
for a in A:
b+=a
ans=min(ans,abs(B-b*2))
print(ans) | import math
n = int(input())
x = list(map(int, input().split()))
y = list(map(int, input().split()))
tmp = [[0 for i in range(6)] for j in range(n+1)]
absDiff = abs(x[0]-y[0])
tmp[0][3] = tmp[0][0] = absDiff
tmp[0][4] = tmp[0][1] = absDiff ** 2
tmp[0][5] = tmp[0][2] = absDiff ** 3
max = absDiff
for i in range(1, n, 1):
absDiff = abs(x[i]-y[i])
tmp[i][0] = absDiff
tmp[i][1] = absDiff ** 2
tmp[i][2] = absDiff ** 3
tmp[i][3] = tmp[i-1][3] + tmp[i][0]
tmp[i][4] = tmp[i-1][4] + tmp[i][1]
tmp[i][5] = tmp[i-1][5] + tmp[i][2]
if absDiff > max:
max = absDiff
print(tmp[n-1][3])
print(math.sqrt(tmp[n-1][4]))
print(tmp[n-1][5] ** (1/3))
print(max) | 0 | null | 71,301,211,913,260 | 276 | 32 |
N, K = map(int, input().split())
A = list(map(int, input().split()))
l = 0
r = l + K
while r < N:
ans = 'Yes' if A[l] < A[r] else 'No'
print(ans)
l += 1
r += 1
| if __name__ == '__main__':
data_num = int(input())
data = [x for x in input().split(' ')]
assert data_num == len(data), "invalid input"
data.reverse()
output = ' '.join(data)
print(output) | 0 | null | 4,065,961,048,128 | 102 | 53 |
s = input()
st1=[]
st2=[]
st3=[]
total=0
for i in range(len(s)):
c=s[i]
if c=='\\':
st1.append(i)
elif c=='/':
if len(st1) > 0:
j = st1.pop()
a = i - j
total+=a
tmp=0
while len(st2)>0 and st2[-1]>j:
st2.pop()
tmp+=st3.pop()
st3.append(a+tmp)
st2.append(j)
print(total)
n = len(st3)
print(n,end='')
for i in range(n):
print(' '+str(st3[i]),end='')
print()
| # -*- coding: utf-8 -*-
if __name__ == '__main__':
l = input()
S1, S2 = [], []
sum = 0
n = len(l)
for i in range(n):
if l[i] == "\\":
S1.append(i)
elif l[i] == "/" and S1:
j = S1.pop()
a = i - j
sum += a
while S2 and S2[-1][0] > j:
a += S2.pop()[1]
S2.append([j, a])
print(sum)
print(len(S2), *(a for j, a in S2)) | 1 | 60,394,452,508 | null | 21 | 21 |
s = input()
t = input()
n = len(s)
ans = 0
for i in range(n):
if (s[i] != t[i]):
ans = 1
if (ans == 0):
print("Yes")
else:
print("No") | S = input()
T = input()
if T.startswith(S):
print('Yes')
else:
print('No') | 1 | 21,330,925,299,232 | null | 147 | 147 |
date=[[],[],[]]
a,b,c=0,0,0
while True:
if a < 0 and b < 0 and c < 0:
break
else:
a,b,c =[int(i) for i in input().split()]
date[0].append(a)
date[1].append(b)
date[2].append(c)
for h in range(0,len(date[0])-1):
if date[0][h] == -1 or date[1][h] == -1:
print("F")
elif date[0][h] == date[1][h] == date[2][h]:
break
else:
if date[0][h] + date[1][h] >= 80:
print("A")
else:
if date[0][h] + date[1][h] >= 65:
print("B")
else:
if date[0][h] + date[1][h] >= 50:
print("C")
else:
if date[0][h] + date[1][h] >=30:
if date[2][h] >= 50:
print("C")
else:
print("D")
else:
print("F") | while 1:
m, f, r = map(int, input().split())
s = m + f
if m == -1 and f == -1 and r == -1:
break
elif m == -1 or f == -1 or s < 30:
print("F")
elif s >= 80:
print("A")
elif s >= 65 and s < 80:
print("B")
elif s >= 50 and s < 65:
print("C")
elif s >= 30 and s < 50:
if r < 50:
print("D")
else:
print("C")
| 1 | 1,216,583,469,988 | null | 57 | 57 |
def sol(s, p):
n = len(s)
cnt = 0
if p == 2 or p == 5:
for i in range(n):
if (s[i] % p == 0):
cnt += i + 1
else:
pre = [0] * (n+2)
pre[n+1] = 0
b = 1
for i in range(n, 0, -1):
pre[i] = (pre[i+1] + s[i-1] * b) % p
b = (b * 10) % p
rec = [0] * p
rec[0] = 1
for i in range(n, 0, -1):
cnt += rec[pre[i]]
rec[pre[i]] += 1
return cnt
if __name__ == "__main__":
n, p = map(int, input().split())
s = input()
print (sol([int(i) for i in s], p)) | N, P = map(int, input().split())
S = input()
now = 0
hyou = [0] * P
hyou[0] = 1
cnt = 1
ans = 0
if P == 2 or P == 5:
for i, t in enumerate(S[::-1]):
temp = int(t)
if temp % P == 0:
ans += N - i
print(ans)
exit()
for i, t in enumerate(S[::-1]):
now = (now + int(t) * pow(10, i, P)) % P
ans += hyou[now]
hyou[now] += 1
print(ans)
| 1 | 58,172,147,784,524 | null | 205 | 205 |
n = int(input())
A = list(map(int,input().split()))
ans = 0
for i,a in enumerate(A):
if (i+1)%2 != 0 and a%2 != 0:
ans +=1
print(ans) | N = int(input())
li = list(map(int,input().rstrip().split(' ')))
count = 0
for i in li[0::2]:
if i%2==1:count += 1
print(count) | 1 | 7,817,772,561,340 | null | 105 | 105 |
from functools import reduce
import sys
def _S(): return sys.stdin.readline().rstrip()
def I(): return int(_S())
def LS(): return list(_S().split())
def LI(): return list(map(int,LS()))
N = I()
a = LI()
xor_reduce = reduce(lambda x,y:x ^ y, a)
ans = [str(xor_reduce ^ x) for x in a]
print(*ans) | N = int(input())
a = list(map(int, input().split()))
for i in range(N):
if i == 0:
tmp = a[i]
else:
tmp = tmp ^ a[i]
ans = []
for i in range(N):
ans.append(tmp ^ a[i])
print(*ans) | 1 | 12,605,843,006,992 | null | 123 | 123 |
list = []
while True:
H, W = [int(i) for i in input().split()]
if H == 0 and W == 0:
break
list.append([H, W])
for i in range(len(list)):
for j in range(list[i][0]):
for k in range(list[i][1]):
if j % 2 == 1:
print('#',end='') if k % 2 == 1 else print('.',end='')
else:
print ('#',end='') if k % 2 == 0 else print('.',end='')
print()
print() | while True:
H, W = map(int, input().split())
if H == 0 and W == 0:
break
else:
if W % 2 == 0:
i = H//2
while i > 0:
print("#."*(W//2))
print(".#"*(W//2))
i -= 1
if H % 2 == 1:
print("#."*(W//2))
else:
i = H // 2
while i > 0:
print("#."*(W//2)+"#")
print(".#"*(W//2)+".")
i -= 1
if H % 2 == 1:
print("#."*(W//2)+"#")
print("") | 1 | 871,676,897,300 | null | 51 | 51 |
n, m = map(int, input().split())
*C, = map(int, input().split())
dp = [n]*(n+1)
dp[0] = 0
for c in C:
for i in range(n+1):
if i+c > n:
break
dp[i+c] = min(dp[i+c], dp[i] + 1)
print(dp[n])
| N = int(input())
a_list = list(map(int, input().split()))
c = 0
for i in range(N-1):
minj = i
for j in range(i+1, N):
if a_list[j] < a_list[minj]:
minj = j
if a_list[i] != a_list[minj]:
a_list[i], a_list[minj] = a_list[minj], a_list[i]
c += 1
print(' '.join(map(str, a_list)))
print(c)
| 0 | null | 78,621,745,020 | 28 | 15 |
S = list(input())
T = list(input())
count = 0
for i in range(0, len(S)):
if S[i] != T[i]:
count += 1
print(count) | n = int(input())
A = [input() for _ in range(n)]
print("AC x " + str(A.count("AC")))
print("WA x " + str(A.count("WA")))
print("TLE x " + str(A.count("TLE")))
print("RE x " + str(A.count("RE")))
| 0 | null | 9,582,422,260,390 | 116 | 109 |
N = int(input())
A = list(map(int, input().split()))
rng = [[A[N], A[N]]]
for i in range(N - 1, -1, -1):
merged = (rng[-1][0] + 1) // 2 + A[i]
nonmerged = rng[-1][1] + A[i]
rng.append([merged, nonmerged])
if rng[-1][0] > 1:
print(-1)
exit()
rng.reverse()
prev_non_leaf = 1
ans = 1
for i in range(1, N + 1):
_, u = rng[i]
ans += min(prev_non_leaf * 2, u)
prev_non_leaf = prev_non_leaf * 2 - A[i]
print(ans)
| #もらうDPで考える
N, K = map(int, input().split())
l = []
r = []
MOD = 998244353
for i in range(K):
a,b = map(int, input().split())
l.append(a)
r.append(b)
dp = [0] * (N+1)
#スタート地点が1なので、dp[1]を1とする
dp[1] = 1
dpsum = [0] * (N+1)
dpsum[1] = 1
for i in range(2, N+1):
for j in range(K):
#[l[i], r[i]]
li = i - r[j]
ri = i - l[j]
if ri < 0: continue
# l1が負になるケースをハンドリング
li = max(1, li)
dp[i] += (dpsum[ri] - dpsum[li-1])%MOD #dp[li] ~ dp[ri]の和を足す
dpsum[i] = (dpsum[i-1] + dp[i])%MOD
print(dp[N]%MOD) | 0 | null | 10,788,068,768,290 | 141 | 74 |
n,m,l=map(int,input().split())
e=[list(map(int,input().split()))for _ in[0]*(n+m)]
for c in e[:n]:print(*[sum(s*t for s,t in zip(c,l))for l in zip(*e[n:])])
| import sys
N, M, L = map(int, raw_input().split())
a = []
b = []
for n in range(N):
a.append(map(int, raw_input().split()))
for m in range(M):
b.append(map(int, raw_input().split()))
c = [[0 for l in xrange(L)] for n in xrange(N)]
for n in xrange(N):
for l in xrange(L):
for m in xrange(M):
c[n][l] += a[n][m] * b[m][l]
for n in xrange(N):
for l in xrange(L-1):
sys.stdout.write(str(c[n][l])+" ")
print c[n][L-1] | 1 | 1,447,622,840,818 | null | 60 | 60 |
N, M = map(int, input().split())
M_f = M * 2 + 1
if M % 2 != 0:
for i in range(0, M // 2):
print(i + 1, (M) - i)
for i in range(0, M // 2 + 1):
print(M + 1 + i, M_f - i)
else:
for i in range(0, M // 2):
print(i + 1, (M + 1) - i)
for i in range(0, M // 2):
print(M + 2 + i, M_f - i) | N,M=map(int,input().split())
x=list(range(1,N+1,1))
if N%2==1:
for i in range(M):
print(x.pop(0),x.pop(-1))
else:
x_f=x[1:int(N/2+1)]
x_l=x[int(N/2+1):]
count=0
for i in range(M):
if len(x_f)>1:
print(x_f.pop(0),x_f.pop(-1))
count+=1
if count==M:
break
if len(x_l)>1:
print(x_l.pop(0),x_l.pop(-1))
count+=1
if count==M:
break | 1 | 28,625,380,549,808 | null | 162 | 162 |
from collections import deque
def bfs(s):
color[s] = 'GRAY'
d[s] = 0
Q.append(0)
while len(Q) != 0:
u = Q.popleft()
for v in range(n):
if M[u][v] and color[v] == 'WHITE':
color[v] = 'GRAY'
d[v] = d[u] + 1
Q.append(v)
color[u] = 'BLACK'
n = int(input())
M = [[0] * n for _ in range(n)]
color = ['WHITE'] * n
d = [-1] * n
Q = deque()
for _ in range(n):
a = list(map(int, input().split()))
u = a[0]
v = a[2:]
for j in v:
M[u - 1][j - 1] = 1
bfs(0)
for i in range(n):
out = ''
out += '{} {}'.format(i + 1, d[i])
print(out) | import queue
N=int(input())
M=[input().split()[2:]for _ in[0]*N]
q=queue.Queue();q.put(0)
d=[-1]*N;d[0]=0
while q.qsize()>0:
u=q.get()
for v in M[u]:
v=int(v)-1
if d[v]<0:d[v]=d[u]+1;q.put(v)
for i in range(N):print(i+1,d[i])
| 1 | 4,253,843,660 | null | 9 | 9 |
import itertools
N, K = map(int, input().split())
p = list(map(int, input().split()))
pos = [(p[i]+1)/2 for i in range(N)]
pos_acum = list(itertools.accumulate(pos))
ans = pos_acum[K-1]
for i in range(N-K):
ans = max(ans, pos_acum[K+i]-pos_acum[i])
print(ans) | n = int(input())
print(sum([(n-1)//a for a in range(1, n)]))
| 0 | null | 38,696,975,828,830 | 223 | 73 |
A,B,N = map(int,input().split())
if N >= B:
N = B - 1
ans = int(A * N / B) - A * int(N / B)
print(ans) | import sys
import math
import fractions
from collections import defaultdict
stdin = sys.stdin
ns = lambda: stdin.readline().rstrip()
ni = lambda: int(stdin.readline().rstrip())
nm = lambda: map(int, stdin.readline().split())
nl = lambda: list(map(int, stdin.readline().split()))
A=int(input())
B=int(input())
A2=min(A,B)
B2=max(A,B)
if(A2==1 and B2==2):
print(3)
sys.exit(0)
if(A2==2 and B2==3):
print(1)
sys.exit(0)
if(A2==1 and B2==3):
print(2)
sys.exit(0)
| 0 | null | 69,150,127,691,456 | 161 | 254 |
S=input()
if (S[2]==S[3]) and (S[4]==S[5]):print('Yes')
else:print('No') | import sys
input=sys.stdin.readline #文字列入力はするな！！
n=int(input())
a=list(map(int,input().split()))
def f(x):
z=[0]*40
i=1
while x>0:
z[-i]=x%2
x=x//2
i+=1
return z
for i in range(n):
a[i]=f(a[i])
y=[0]*40
for i in range(40):
y[i]=sum(a[j][i] for j in range(n))%2
ans=[]
for i in range(n):
p=0
for j in range(40):
if y[-j-1]!=a[i][-j-1]:
p+=2**j
ans.append(p)
for i in range(n):
print(ans[i], end=" ")
| 0 | null | 27,401,364,928,532 | 184 | 123 |
inArray = input().split()
inArray.sort()
print(" ".join(inArray))
| a,b,c = map(int, input().split())
A = min(min(a, b),c)
C = max(max(a,b),c)
B = (a+b+c) - (A+C)
print(A, B, C)
| 1 | 418,246,170,858 | null | 40 | 40 |
S=input()
if S=="hi" or S=="hihi" or S=="hihihi" or S=="hihihihi" or S=="hihihihihi":
print("Yes")
else:
print("No") | from sys import stdin
import math
import re
import queue
input = stdin.readline
MOD = 1000000007
INF = 122337203685477580
def solve():
str = (input().rstrip())
str = str.replace("hi","")
if(len(str) == 0):
print("Yes")
else:
print("No")
if __name__ == '__main__':
solve()
| 1 | 53,434,986,728,790 | null | 199 | 199 |
from heapq import heappop, heappush
X, Y, A, B, C = map(int, input().split())
h = []
for p in map(int, input().split()):
heappush(h, (-p, 1))
for q in map(int, input().split()):
heappush(h, (-q, 2))
for r in map(int, input().split()):
heappush(h, (-r, 3))
ans = 0
cnt = 0
total = X + Y
while cnt < total:
point, color = heappop(h)
if color == 1:
if X > 0:
ans += -point
X -= 1
cnt += 1
elif color == 2:
if Y > 0:
ans += -point
Y -= 1
cnt += 1
elif color == 3:
ans += -point
cnt += 1
print(ans)
| x,y,a,b,c = map(int,input().split())
p = list(map(int,input().split()))
q = list(map(int,input().split()))
r = list(map(int,input().split()))
p = sorted(p,reverse=True)
q = sorted(q,reverse=True)
r = sorted(r,reverse=True)
lis = p[:x]
lis.extend(q[:y])
lis = sorted(lis)
#print(lis)
ans = []
lr = len(r)
for i in range(len(lis)):
if i<lr:
ans.append(max(lis[i],r[i]))
else:
ans.append(lis[i])
print(sum(ans))
| 1 | 44,763,512,072,530 | null | 188 | 188 |
import itertools
n = int(input())
a = [[[0 for _ in range(10)] for _ in range(3)] for _ in range(4)]
for _ in range(n):
b, f, r, v = map(int, input().split())
a[b-1][f-1][r-1] += v
for b in range(4):
for f in range(3):
for r in range(10):
print('', a[b][f][r], end="")
print()
if b < 3:
print("#"*20) | arr = [[[0 for i in range(10)] for j in range(3)] for k in range(4)]
for i in range(int(input())):
b,f,r,v = map(int, input().split())
arr[b-1][f-1][r-1] += v
for i in range(4):
for j in range(3):
for k in range(10):
if k == 0:
print ("", end=" ")
if k == 9:
print(arr[i][j][k])
else:
print(arr[i][j][k], end=" ")
if i != 3:
print("#"*20) | 1 | 1,109,904,592,040 | null | 55 | 55 |
from collections import deque
h,w=map(int,input().split())
maze=[list(input()) for i in range(h)]
ans=0
dx=[1,-1,0,0]
dy=[0,0,1,-1]
for i in range(h):
for j in range(w):
Q=deque()
Q.append((i,j,0))
if maze[i][j]=='#':
continue
dp=[[-1]*w for i in range(h)]
dp[i][j]=0
while Q:
p=Q.popleft()
ans=max(ans,p[2])
for k in range(4):
nx=p[0]+dx[k]
ny=p[1]+dy[k]
if 0<=nx<h and 0<=ny<w and maze[nx][ny]=='.' and dp[nx][ny]==-1:
Q.append((nx,ny,p[2]+1))
dp[nx][ny]=p[2]+1
print(ans)
| from collections import deque
import _pickle as cPickle
import cProfile
H, W =map(int,input().split())
grid = [input() for i in range(H)]
dist = [[-1]*W for _ in range(H)]
cells = deque()
for h in range(H):
for w in range(W):
if grid[h][w] == '.':
dist[h][w] = 0
cells.append((h,w))
distG = cPickle.loads(cPickle.dumps(dist, -1))
pcells = deque()
def bfs(h,w):
pcells.append((h,w))
d = 1
distG[h][w] = 1
while pcells:
oh,ow = pcells.popleft()
d = distG[oh][ow]
for dx, dy in ((0,1),(0,-1),(1,0),(-1,0)):
nw = ow + dx
nh = oh + dy
if nw < 0 or W <= nw or nh <0 or H <= nh:
continue
if distG[nh][nw] == 0:
distG[nh][nw] = d+1
pcells.append((nh,nw))
return d-1
a = 0
for i in range(len(cells)):
distG = cPickle.loads(cPickle.dumps(dist, -1))
h,w = cells.popleft()
a = max(a,bfs(h,w))
print(a) | 1 | 94,330,463,245,200 | null | 241 | 241 |
ans = 6
print(ans-int(input())-int(input())) | ans = [1,2,3]
for i in [0,1]:
y = int(input())
ans.remove(y)
print(ans[0])
| 1 | 110,303,786,799,152 | null | 254 | 254 |
if input().isupper():
print('A')
else:
print('a')
| if input().islower() == True:
print("a")
else:
print("A") | 1 | 11,437,067,893,120 | null | 119 | 119 |
import math
a, b, n = map(int, input().split())
x = b - 1
if x > n:
x = n
ans = math.floor(a * x / b) - a * math.floor(x / b)
print(ans)
| a,b,n=[int(x) for x in input().rstrip().split()]
if b<=n:
n=b-1
print(int((a*n)/b)-a*int(n/b))
| 1 | 28,080,512,322,408 | null | 161 | 161 |
N = int(input())
A = list(map(int, input().split()))
# ex. 24 11 8 3 16
A.sort()
# ex. 3 8 11 16 24
cnt = 0
# Aの最大値が24なら25個用意する感じ
# indexと考える値を一致させて分かりやすくしている
# Trueで初期化
# 最後のインデックスはA[-1]
dp = [True] * (A[-1] + 1)
# エラトステネスの篩っぽいやつ
for i in range(N):
if dp[A[i]] == True:
# dp[A[i]], dp[2*A[i]], dp[3*A[i]],...をFalseにする
for j in range(A[i], A[-1] + 1, A[i]):
dp[j] = False
if i < N - 1:
# 次も同じ数字が存在するなら数えない、なぜならお互いに割れてしまって題意を満たさないから
# 次以降に出てくる同じ数字は既にFalseになっているのでもう走査する事はない
if A[i] != A[i + 1]:
cnt += 1
# i=N-1の時は次がないので無条件でcntを増やす
# elseの方が良さそうだが明示的にするためにelifを使った
elif i == N - 1:
cnt += 1
print(cnt)
| def main():
n = int(input())
A = list(map(int,input().split()))
ans = n
A.sort()
table = [True]*(A[-1]+1)
for k,a in enumerate(A):
if table[a]:
if k+1<n and A[k+1]==a:
ans-=1
for i in range(a,A[-1]+1,a):
table[i] = False
else:
ans-=1
print(ans)
main() | 1 | 14,475,581,099,518 | null | 129 | 129 |
import collections
class UnionFind:
def __init__(self, N):
self.parent = [i for i in range(N)]
self.rank = [0]*N
self.count = 0
def root(self, a):
if self.parent[a]==a:
return a
else:
self.parent[a]=self.root(self.parent[a])
return self.parent[a]
def size(x):
return -par[root(x)]
def is_same(self, a, b):
return self.root(a)==self.root(b)
def unite(self, a, b):
ra = self.root(a)
rb = self.root(b)
if ra == rb: return
if self.rank[ra] < self.rank[rb]:
self.parent[ra] = rb
else:
self.parent[rb] = ra
if self.rank[ra] == self.rank[rb]: self.rank[ra] += 1
self.count += 1
def main():
n,m,k=map(int, input().split())
friend = [0]*n
fr = UnionFind(n)
blocklist = [0]*n
for i in range(m):
a,b = map(int, input().split())
fr.unite(a-1,b-1)
friend[a-1]+=1
friend[b-1]+=1
for i in range(k):
c,d=map(int, input().split())
if(fr.root(c-1)==fr.root(d-1)):
blocklist[c-1]+=1
blocklist[d-1]+=1
res = []
dd = collections.defaultdict(int)
for i in range(n):
dd[fr.root(i)]+=1
for i in range(n):
res.append(dd[fr.root(i)]- blocklist[i] - friend[i]-1)
print(*res)
if __name__ == '__main__':
main()
| from collections import deque
N, M, K = map(int, input().split())
F = [[] for _ in range(N)]
B = [[] for _ in range(N)]
# フレンドの隣接リスト
for _ in range(M):
a, b = map(int, input().split())
a, b = a - 1, b - 1
F[a].append(b)
F[b].append(a)
# ブロックの隣接リスト
for _ in range(K):
c, d = map(int, input().split())
c, d = c - 1, d - 1
B[c].append(d)
B[d].append(c)
# 交友関係グループ（辞書型）
D = {}
# グループの親
parent = [-1] * N
# 訪問管理
visited = [False] * N
for root in range(N):
cnt = 0
if visited[root]:
continue
# D[root] = set([root])
# 訪問先のスタック
stack = [root]
# 訪問先が無くなるまで
while stack:
# 訪問者をポップアップ
n = stack.pop()
# 訪問者を訪問済み
if visited[n]:
continue
visited[n] = True
cnt +=1
# 訪問者のグループの親を設定
parent[n] = root
# root のフレンドをグループと訪問先に追加
for to in F[n]:
if visited[to]:
continue
# D[root].add(to)
stack.append(to)
if cnt!=0:
D[root]=cnt
# print(D)
ans = [0]*N
for iam in range(N):
# group = gro[parent[iam]]
tmp_ans = D[parent[iam]]
tmp_ans -=1
tmp_ans -= len(F[iam])
for block in B[iam]:
if parent[block]==parent[iam] :
tmp_ans -=1
ans[iam]=tmp_ans
print(*ans, sep=' ') | 1 | 61,578,793,918,530 | null | 209 | 209 |
import sys
N, K = map(int, input().split())
if K == 10:
print(len(str(N)))
sys.exit()
p = 0
while True:
num = K ** p
if N < num:
break
p += 1
print(p)
| N,K=map(int, input().split())
list=[]
while N>=K:
x=N%K
N=N//K
list.append(x)
list.append(N)
print(len(list))
| 1 | 64,311,985,366,162 | null | 212 | 212 |
import numpy as np
a, b, x = map(int,input().split())
if x >= a**2*b/2:
ans = np.arctan(2*(b-x/a**2)/a)
else:
ans = np.arctan(a*b/2/x*b)
print(ans*180/np.pi) | a,b,x=list(map(int,input().split()))
import math
x=x/a
if a*b/2<x:
print(math.degrees(math.atan(2*(a*b-x)/a**2)))
else:
print(math.degrees(math.atan(b**2/(2*x)))) | 1 | 163,346,136,752,878 | null | 289 | 289 |
import math
def main():
s = str(input())
first = s[0]
cnt_l = []
tmp_cnt = 1
prev_s = first
for curr_s in s[1:]:
if prev_s != curr_s:
cnt_l.append(tmp_cnt)
tmp_cnt = 1
else:
tmp_cnt+=1
prev_s = curr_s
cnt_l.append(tmp_cnt)
ans_l = []
last_num = 0
if first == '>':
down_cnt = cnt_l[0]
for d in range(down_cnt):
ans_l.append(down_cnt-d)
cnt_l = cnt_l[1:]
# if first == '<':
# print(cnt_l)
ans_l.append(0)
last_num = 0
for i in range(math.ceil(len(cnt_l)/2)):
# print('i',i)
up_cnt = cnt_l[i*2]
if i*2+1 >= len(cnt_l):
down_cnt = 0
else:
down_cnt = cnt_l[i*2+1]
# print(up_cnt,down_cnt)
# print()
for u in range(up_cnt):
if u != up_cnt-1:
last_num+=1
ans_l.append(last_num)
else:
last_num = max(last_num+1, down_cnt)
ans_l.append(last_num)
for d in range(down_cnt):
if d==0:
if last_num > down_cnt:
last_num = down_cnt-1
else:
last_num-=1
ans_l.append(last_num)
else:
last_num-=1
ans_l.append(last_num)
# print(ans_l)
print(sum(ans_l))
if __name__ == "__main__":
main() | import numpy as np
S = input()
a = [0]*(len(S)+1)
for i in range(len(S)):
if S[i] == '<':
a[i+1] =max(a[i+1], a[i]+1)
else:
a[i] = max(a[i],a[i+1]+1)
for i in range(len(S)-1,-1,-1):
if S[i] == '<':
a[i+1] =max(a[i+1], a[i]+1)
else:
a[i] = max(a[i],a[i+1]+1)
print(sum(a)) | 1 | 156,959,449,791,520 | null | 285 | 285 |
N = int(input())
A = list(map(int, input().split()))
A = sorted(A)
count = 0
max = A[-1]
if max == 0:
print(0)
exit()
import math
V = [0]*(math.floor(math.log(max, 2))+1)
for i in range (0, N):
B = A[i]
vount = 0
while B > 0:
if B%2 == 0:
B = B//2
vount+=1
else:
B = (B-1)//2
V[vount]+=1
vount+=1
for i in range (0, len(V)):
count+=((V[i]*(N-V[i]))*(2**i))
print(count%(10**9+7)) | 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,184,877,037,192 | null | 263 | 263 |
for i in xrange(1, 10):
for j in xrange(1, 10):
print "%dx%d=%d" % (i, j, i * j) | s,t,a,b,x,y=map(int,open(0).read().split())
i=(x-a)*s
j=(b-y)*t-i
print(max(0,i//j*2+(i%j!=0))if j else'infinity') | 0 | null | 65,436,211,545,412 | 1 | 269 |
n = int(input())
arr = list(map(int,input().split()))
addarr = [i+1+arr[i] for i in range(n)]
diffarr = [i+1-arr[i] for i in range(n)]
from collections import Counter
cnt = Counter([addarr[0]])
ans = 0
for i in range(1,n):
tmp = diffarr[i]
ans += cnt[tmp]
cnt.update([addarr[i]])
print(ans) | from collections import deque
n = int(input())
C = [input() for i in range(n)]
A = deque([])
for c in C:
if c == 'deleteFirst':
A.popleft()
elif c == 'deleteLast':
A.pop()
elif 'delete' in c:
q = int(c[7:])
if q in A:
A.remove(q)
elif 'insert' in c:
q = int(c[7:])
A.appendleft(q)
print(' '.join(map(str, A)))
| 0 | null | 12,946,672,670,890 | 157 | 20 |
N = int(input())
import math
ans = []
for i in range(1,round((N-1)**0.5)+1):
if (N-1)%i == 0:
ans.append(i)
if (N-1)//i != i:
ans.append((N-1)//i)
ans.remove(1)
ans.append(N)
for i in range(2,round(N**0.5)+1):
if N%i == 0:
n = N
while n%i==0:
n//=i
if n%i==1:
ans.append(i)
print(len(ans))
| mod = int(10 ** 9) + 7
def modinv(x, m = mod):
b = m
u = 1
v = 0
while b:
t = x // b
x -= t * b
x, b = b, x
u -= t * v
u, v = v, u
u %= m
if u < 0:
u += m
return u
def main():
n, k = map(int, input().split())
if k > n-1:
k = n-1
factorial = [None for _ in range(200001)]
factorial[0] = 1
factorial[1] = 1
for i in range(2, 200001):
factorial[i] = (factorial[i-1] * i) % mod
posCount = [None for _ in range(n+1)]
for i in range(n+1):
posCount[i] = (factorial[n] * modinv((factorial[i] * factorial[n-i]) % mod)) % mod
placeCount = [None for _ in range(n+1)]
placeCount[0] = 0
for i in range(1, n+1):
placeCount[i] = (factorial[n-1] * modinv((factorial[i-1] * factorial[(n-1)-(i-1)]) % mod)) % mod
ans = 0
for i in range(-1, -k-2, -1):
ans = (ans + (posCount[i] * placeCount[i])) % mod
if k == 1:
ans -= 1
if ans < 0:
ans += mod
print(ans)
if __name__ == '__main__':
main()
| 0 | null | 54,207,258,905,452 | 183 | 215 |
S = input()
sum = 0
for i in range(3):
if S[i]=="R":
sum += 1
if sum == 2 and S[1] == "S":
sum = 1
print(sum)
| """
Hが少ないので、縦で割るパターンは全探索して見る。
dpとか使わずに、貪欲的に割っていけばよい。
"""
H,W,K = map(int,input().split())
choco = [list(input()) for _ in range(H)]
accum = [[0]*W for _ in range(H)]
for i in range(H):
for j in range(W):
accum[i][j] = accum[i][j-1] + int(choco[i][j])
ans = float("INF")
for i in range(2**H):
"""
i を2進数表記したときに1になっているインデックスに該当する行数で分割する。
例えば00100なら3行目と4行目の間で分割する。
"""
binI = format(i,"0"+str(H)+"b")
group = {}
groupNum = 0
for j in range(H):
group[j] = groupNum
if binI[j] == "1":
groupNum += 1
breakCnt = groupNum
tmp = [0]*(groupNum+1)
for j in range(W):
tmp2 = [0]*(groupNum+1)
for k in range(H):
groupNum = group[k]
if choco[k][j] == "1":
tmp2[groupNum] += 1
if max(tmp2) > K:
break
else:
for l in range(groupNum+1):
tmp[l] += tmp2[l]
if max(tmp) > K:
breakCnt += 1
tmp = tmp2
else:
ans = min(ans,breakCnt)
print(ans) | 0 | null | 26,519,702,932,100 | 90 | 193 |
# first line > /dev/null
input()
a = input().split(' ')
print(' '.join(reversed(a))) | if __name__ == '__main__':
data_num = int(input())
data = [x for x in input().split(' ')]
assert data_num == len(data), "invalid input"
data.reverse()
output = ' '.join(data)
print(output) | 1 | 980,290,481,768 | null | 53 | 53 |
def main():
k,n = map(int, input().split())
s = list(map(int, input().split()))
l = []
for i in range(n):
if i == 0:
l.append(k - (s[-1] - s[0]))
else:
a = s[i] - s[i-1]
l.append(a)
print(k - max(l))
if __name__ == '__main__':
main()
| from sys import stdin
import math
from functools import reduce
k,n = [int(x) for x in stdin.readline().rstrip().split()]
a = [int(x) for x in stdin.readline().rstrip().split()]
l = 0
for i in range(n-1):
l = max([l, a[i+1] - a[i]])
l = max([l, a[0]+k-a[n-1]])
print(k-l) | 1 | 43,109,176,116,380 | null | 186 | 186 |
N = int(input())
S = input()
uns = 0
for d in range(1, (N - 1) // 2 + 1):
for i in range(N - 2 * d):
s, t, u = S[i], S[i + d], S[i + 2 * d]
if s != t and t != u and u != s:
uns += 1
r = S.count('R')
g = S.count('G')
b = N - r - g # = S.count('B')
ans = r * g * b - uns
print(ans) | N = int(input())
As = list(map(int, input().split()))
sum = 0
for i in range(N):
sum += As[i]
sum %= 10**9+7
ans = 0
for i in range(N):
sum -= As[i]
ans += As[i]*sum
ans %= 10**9+7
print(ans)
| 0 | null | 19,981,989,991,712 | 175 | 83 |
h,w = map(int,input().split())
if h == 1 or w == 1:
print(1)
elif h * w % 2 == 0:
print(h * w // 2)
else:
print(h * w // 2 + 1) | from collections import defaultdict
"""
N 以下の全ての整数に対して, (先頭, 末尾) を数える.
(先頭, 末尾), (末尾, 先頭)の組は, 独立しているので掛け算で求められる.
"""
n = int(input())
ansl = defaultdict(lambda: 0)
for i in range(1,n+1):
sentou = int(str(i)[0])
ushiro = int(str(i)[-1])
ansl[(sentou, ushiro)] += 1
ans = 0
for i in range(1, 10):
for j in range(1, 10):
ans += ansl[(i, j)]*ansl[(j, i)]
print(ans) | 0 | null | 69,036,645,823,456 | 196 | 234 |
S=str(input())
W=['SUN','MON','TUE','WED','THU','FRI','SAT']
for i in range(len(W)):
if S==W[i]:
print(7-i) | N,A,B = list(map(int,input().split()))
ans = (N//(A+B))*A
ans += min((N%(A+B)),A)
print(ans) | 0 | null | 94,570,910,127,462 | 270 | 202 |
st = str(input())
q = int(input())
com = []
for i in range(q):
com.append(input().split())
for k in com:
if k[0] == "print":
print(st[int(k[1]):int(k[2])+1])
elif k[0] == "reverse":
s = list(st[int(k[1]):int(k[2])+1])
s.reverse()
ss = "".join(s)
st = st[:int(k[1])] + ss + st[int(k[2])+1:]
else:
st = st[:int(k[1])] + k[3] + st[int(k[2])+1:]
| import sys
S = input()
N = int(input())
for i in range(N):
a = sys.stdin.readline().split()
if a[0] == "replace":
S = S[:int(a[1])] + a[3] + S[int(a[2])+1:]
elif a[0] == "reverse":
X = S[int(a[1]):int(a[2])+1]
X = X[::-1]
S = S[:int(a[1])] + X +S[int(a[2])+1:]
elif a[0] == "print":
print(S[int(a[1]):int(a[2])+1])
| 1 | 2,075,049,672,684 | null | 68 | 68 |
def solve():
num_lines = int(raw_input())
s = set()
for i in xrange(num_lines):
command, target = raw_input().split(" ")
if command[0] == "i":# insert
s.add(target)
continue
if target in s:
print "yes"
else:
print "no"
if __name__ == "__main__":
solve() | def insert(cnt, data):
T[str(data)] = cnt
cnt = 0
T = {}
n = int(input())
for i in range(n):
Order, data_S = input().split()
if Order[0] =="i":
insert(cnt, data_S)
cnt +=1
else:
if str(data_S) in T:
print("yes")
else:
print("no")
| 1 | 76,611,207,520 | null | 23 | 23 |
def sel_sort(A, N):
''' 選択ソート '''
count = 0
for n in range(N):
minm = n
for m in range(n, N):
if A[m] < A[minm]:
minm = m
if minm != n:
A[n], A[minm] = A[minm], A[n]
count += 1
return (A, count)
if __name__ == '__main__':
N = int(input())
A = list(map(int, input().split(' ')))
ans = sel_sort(A, N)
print(' '.join([str(x) for x in ans[0]]))
print(ans[1])
| n = int(input())
k = [int(i) for i in input().split()]
m = 0
for i in range(n):
minj = i
for j in range(i,n):
if k[j] < k[minj]:
minj = j
x = k[i]
k[i] = k[minj]
k[minj]=x
if k[i] != k[minj]:
m += 1
print(' '.join(map(str, k)))
print(m) | 1 | 21,464,728,802 | null | 15 | 15 |
n = int(input())
ans = [0 for _ in range(n+1)]
for x in range(1,int(n**0.5)+1):
for y in range(1,x+1):
for z in range(1,y+1):
if x**2+y**2+z**2+x*y+y*z+z*x<=n:
if x==y==z:
ans[x**2+y**2+z**2+x*y+y*z+z*x] += 1
if (x==y and y != z) or (y==z and z !=x) or (z==x and x != y):
ans[x**2+y**2+z**2+x*y+y*z+z*x] += 3
if (x!=y) and (y!=z) and (z!=x):
ans[x**2+y**2+z**2+x*y+y*z+z*x] += 6
for a in ans[1:]:
print(a) | N = int(input())
n_list = []
count = 1
max_val = 1
res = 0
for x in range(1,100):
for y in range(x,100):
for z in range(y,100):
res = x**2 +y**2 + z**2 + x*y + y*z + z*x
for i in range(int(x!=y) + int(y!=z) + int(z!=x)-1):
count *= 3-i
if max_val < res:
for i in range(max_val, res+1):
if i != res: n_list.append(0)
else: n_list.append(count)
max_val = res+1
else:
n_list[res-1] += count
count = 1
for i in range(N):
print(n_list[i])
| 1 | 7,923,215,760,598 | null | 106 | 106 |
kazu = input().split()
print(int(kazu[0]) * int(kazu[1])) | a, b = map(int,input().split())
def main(x,y):
print(x*y)
main(a,b) | 1 | 15,741,128,579,250 | null | 133 | 133 |
n = int(input())
x = list(map(int,input().split()))
y = list(map(int,input().split()))
i = 0
p1 = 0
p2 = 0
p3 = 0
p4 = 0
for _ in range(n):
if x[i] > y[i]:
p1 = (x[i] - y[i]) + p1
else:
p1 = (y[i] - x[i]) + p1
i = i + 1
print('{:.8f}'.format(p1))
i = 0
for _ in range(n):
p2 = ((x[i] - y[i]))**2 + p2
i = i + 1
print('{:.8f}'.format(p2**(1/2)))
i = 0
for _ in range(n):
if x[i] > y[i]:
p3 = ((x[i] - y[i]))**3 + p3
else:
p3 = ((y[i] - x[i]))**3 + p3
i = i + 1
print('{:.8f}'.format(p3**(1/3)))
i = 0
M = 0
for _ in range(n):
if x[i] > y[i]:
p4 = x[i] - y[i]
if M < p4:
M = p4
else:
p4 = y[i] - x[i]
if M < p4:
M = p4
i = i + 1
print('{:.8f}'.format(M))
| m1 = 0;m2 = 0;m3 = 0
for i in range(1,11):
m = int(input())
if m>=m1:
m3 = m2;m2 = m1;m1 = m
elif m2<=m<m1:
m3 = m2;m2 = m
elif m3<=m<m2:
m3 = m
print(m1)
print(m2)
print(m3) | 0 | null | 103,967,453,690 | 32 | 2 |
for i in range(0,9):
for j in range(0,9):
print("{0}x{1}={2}".format(i+1,j+1,(i+1)*(j+1))) | print("\n".join(["%dx%d=%d"%(i,j,i*j)for i in range(1,10)for j in range(1,10)])) | 1 | 1,225,372 | null | 1 | 1 |
n,m,k = map(int,input().split())
MOD = 998244353
FAC = [1]
INV = [1]
for i in range(1,n+1):
FAC.append((FAC[i-1]*i) % MOD)
INV.append(pow(FAC[-1],MOD-2,MOD))
def nCr(n,r):
return FAC[n]*INV[n-r]*INV[r]
ans = 0
for i in range(k+1):
ans += nCr(n-1,i)*m*pow(m-1,n-i-1,MOD)
ans %= MOD
print(ans) | n, m, k = map(int, input().split())
def cmb(n, r, p):
if (r < 0) or (n < r):
return 0
r = min(r, n-r)
return fact[n] *factinv[r]* factinv[n-r] %p
p = 998244353
N = 2 * 10**5 + 2
fact = [1, 1] # fact[n] = (n! mod p)
factinv = [1, 1] # factinv[n] = ((n!)^(-1) mod p)
inv = [0, 1] # factinv 計算用
for i in range(2, N + 1):
fact.append((fact[-1] * i) % p)
inv.append((-inv[p % i] * (p // i)) % p)
factinv.append((factinv[-1] * inv[-1]) % p)
y = [0,m]
for i in range(n):
y.append((y[-1]*(m-1))%p)
r = 0
for i in range(k+1):
r = (r + y[n-i]*cmb(n-1, i, p))%p
print(r) | 1 | 23,360,173,927,452 | null | 151 | 151 |
def main():
A, B, C = map(int, input().split())
if A == B and A != C:
print("Yes")
elif B == C and B != A:
print("Yes")
elif C == A and C != B:
print("Yes")
else:
print("No")
if __name__ == "__main__":
main()
| ary = list(map(int, input().split()))
print('Yes' if len(set(ary)) == 2 else 'No') | 1 | 67,750,828,830,300 | null | 216 | 216 |
s = input()
if s=='AAA' or s=='BBB' : print('No')
else : print('Yes') | n = int(input())
ans = n // 2
ans += 1 if n % 2 != 0 else 0
print(ans) | 0 | null | 57,082,280,831,200 | 201 | 206 |
a, b = map(int, input().split())
def gcd(a, b):
if a == b:
return a
big = max(a, b)
small = min(a, b)
while not big % small == 0:
big, small = small, big%small
return small
print(gcd(a, b))
| n, k = map(int, input().split())
r, s, p = map(int, input().split())
t = input()
dict = {'s': r, 'p': s, 'r': p}
cnt, ans = set(), 0
for i, ti in enumerate(t):
if (i - k in cnt) and ti == t[i - k]:
continue
ans += dict[ti]
cnt.add(i)
print(ans)
| 0 | null | 53,616,760,862,940 | 11 | 251 |
N = int(input())
S = input()
count = 1
check = S[0]
for c in S:
if c != check:
count += 1
check = c
print(count) | n = int(input())
d = input()
x = d[0]
count = 1
for i in d:
if i != x:
count += 1
x = i
print(count) | 1 | 170,344,778,647,548 | null | 293 | 293 |
import math
import numpy as np
N,M=map(int,input().split())
A=list(map(int,input().split()))
c=1
test=A[0]
l=0
while test%2 == 0:
test=test//2
c*=2
for i in np.arange(N-1):
if A[i+1]%c!=0:
print(0)
l=1
break
elif A[i+1]%(c*2)==0:
print(0)
l=1
break
else:
k=A[i+1]//c
test=test*k//math.gcd(test,k)
if l==0:
k=test*c//2
print(M//k//2+M//k%2) | n, k = map(int, input().split())
tmp = n%k
print(min(tmp, abs(tmp-k))) | 0 | null | 70,478,272,785,632 | 247 | 180 |
import math
a, b, n = map(int, input().split())
if n < b:
c = math.floor(a * n / b)
print(c)
else:
c = math.floor(a * (b-1)/ b)
print(c) | import math
a, b, x = [int(i) for i in input().split()]
if a**2 * b / 2 <= x:
y = 2 * x / a**2 - b
tntheta = (b - y) / a
else:
y = a - 2 * x / (a * b)
tntheta = b / (a - y)
print(math.degrees(math.atan(tntheta))) | 0 | null | 95,964,380,775,098 | 161 | 289 |
N, M, K = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
answer = 0
b_ind = 0
for x in range(N-1):
A[x+1] += A[x]
if A[x+1] > K:
A = A[:x+1]
break
for y in range(M-1):
B[y+1] += B[y]
if B[y+1] > K:
B = B[:y+1]
break
A = [0] + A
B = [0] + B
na = len(A)
nb = len(B)
if A[-1] + B[-1] <= K:
answer = len(A) + len(B) - 2
print(answer)
else:
for i in range(na):
for j in range(nb-b_ind-1, -1, -1):
if A[i] + B[j] <= K:
if answer < i+j:
answer = i+j
b_ind = nb-j-1
break
print(answer) | import bisect
N, M, K = map(int, input().split())
A = tuple(map(int, input().split()))
B = tuple(map(int, input().split()))
Asums = [0] * (N + 1)
for i, a in enumerate(A):
Asums[i+1] = Asums[i] + a
Bsums = [0] * (M + 1)
for i, b in enumerate(B):
Bsums[i+1] = Bsums[i] + b
ans = 0
for anum in range(N + 1):
t = Asums[anum]
if K < t:
break
bnum = bisect.bisect_right(Bsums, K - t) - 1
ans = max(ans, anum + bnum)
print(ans) | 1 | 10,758,318,744,480 | null | 117 | 117 |
import math
a,b=map(int,input().split())
count=1
while True:
c=count*0.08
d=count*0.1
if math.floor(c)==a and math.floor(d)==b:
print(count)
break
count+=1
if count>1500:
print(-1)
break | # ABC158 C - Tax Increase
a,b = map(int,input().split())
import math
c=10000
for i in range(1200):
if math.floor(i*0.08)==a and math.floor(i*0.10)==b:
c = min(c,i)
if c==10000:
print(-1)
exit()
print(c) | 1 | 56,500,171,859,520 | null | 203 | 203 |
h, m, H, M, K = map(int, input().split())
print(H * 60 + M - h * 60 - m - K)
| import sys, os
if 'local' in os.environ :
sys.stdin = open('./input.txt', 'r')
f = lambda:list(map(int, input().split()))
def gcd(a,b):
return b if a == 0 else gcd(b%a, a)
def quick_pow(x,n, mod):
ans= 1
while n:
if n&1:
ans *= x
ans %= mod
x *= x
x %= mod
n >>= 1
return ans
def solve():
mod = 1000000007
n = f()[0]
dirs = {}
all0 = 0
x0 = 0
y0 = 0
for _ in range(n):
a,b = f()
if a ==0 and b == 0:
all0 += 1
continue
if a == 0:
x0 += 1
continue
if b == 0:
y0 += 1
continue
if a <0:
a = -a
b = -b
g = gcd(abs(a),abs(b))
a //= g
b //= g
if a*b >0:
if (a,b) not in dirs:
dirs[(a,b)] = {}
dirs[(a,b)][0] = 0
dirs[(a,b)][1] = 0
dirs[(a,b)][0] = dirs[(a,b)][0]+ 1
else:
if (-b,a) not in dirs:
dirs[(-b,a)] = {}
dirs[(-b,a)][0] = 0
dirs[(-b,a)][1] = 0
dirs[(-b,a)][1] = dirs[(-b,a)][1] + 1
ans = 1
ans *= (quick_pow(2, x0, mod) + quick_pow(2, y0, mod)-1 + mod) % mod
ans %= mod
for _, l in dirs.items():
ans *= (quick_pow(2, l[0], mod) + quick_pow(2, l[1], mod)-1 + mod)%mod
ans %= mod
ans -= 1
if all0:
ans+= all0
ans += mod
ans%= mod
print(ans)
solve()
| 0 | null | 19,390,165,581,498 | 139 | 146 |
import math
p_max = 1000000 * 1000000
n, k = map(int, input().split())
w = [int(input()) for i in range(n)]
def check(p):
i = 0
for j in range(k):
s = 0
while (s + w[i] <= p):
s += w[i]
i += 1
if i == n:
return n
return i
if __name__ == "__main__":
right = p_max
left = 0
mid = 0
while (right - left > 1):
mid = math.floor((right + left) / 2)
v = check(mid)
if v >= n:
right = mid
else:
left = mid
print (right)
| n,t=[int(x) for x in input().split()]
w=[]
for i in range(n):
w.append(int(input()))
totalw=sum(w)
pmax=totalw
pmin=int(totalw/t)-1
def check(ptest):
tk=1
p=0
global t
global w
global n
i=0
while i<n:
p+=w[i]
if p<=ptest:
i+=1
else:
tk+=1
p=0
if tk>t:
return 0
#break
return 1
while (pmax-pmin)>1:
pmid=(pmax+pmin)//2
if check(pmid)==1:
pmax=pmid
else:
pmin=pmid
print(pmax)
| 1 | 92,691,394,768 | null | 24 | 24 |
while(True):
try:
(a, b) = map(int, input().split(" "))
(x, y) = (a, b)
while (x != 0):
(x, y) = (y%x, x)
print("%s %s" %(y, a*b//y))
except:
break | N = int(input())
slist = []
tlist = []
from itertools import accumulate
for _ in range(N):
s, t = input().split()
slist.append(s)
tlist.append(int(t))
cum = list(accumulate(tlist))
print(cum[-1]-cum[slist.index(input())])
| 0 | null | 48,300,544,096,520 | 5 | 243 |
def main():
from collections import deque
N, M, K = map(int, input().split())
f = [set() for _ in range(N + 1)]
b = [set() for _ in range(N + 1)]
for _ in range(M):
i, j = map(int, input().split())
f[i].add(j)
f[j].add(i)
for _ in range(K):
i, j = map(int, input().split())
b[i].add(j)
b[j].add(i)
visited = [False] * (N + 1)
ans = [0] * (N + 1)
for i in range(1, N+1):
if visited[i]:
continue
visited[i] = True
link = {i}
todo = deque([i])
while len(todo) != 0:
c = todo.pop()
for p in f[c]:
if not(visited[p]):
link.add(p)
todo.append(p)
visited[p] = True
for j in link:
ans[j] = len(link) - len(link & f[j]) - len(link & b[j]) - 1
print(*ans[1:])
if __name__ == '__main__':
main() | import math
r = float(input())
print("{:.6f}".format(r*r*math.pi), "{:.6f}".format(2*r*math.pi))
| 0 | null | 31,262,403,097,750 | 209 | 46 |
n = int(input())
def dfs(s, i):
if i == n:
print(s)
else:
for j in range(ord("a"), max(map(ord, list(s))) + 2):
dfs(s + chr(j), i + 1)
dfs("a", 1) | W,H,x,y,r=map(int,raw_input().split())
print'Yes' if((0+r)<=x and (W-r)>=x) and ((0+r)<=y and (H-r)>=y) else'No' | 0 | null | 26,444,812,437,692 | 198 | 41 |
x = int(input())
xSum = 0
cnt = 1
while True:
xSum += x
if xSum%360 == 0:
break
cnt += 1
print(cnt) | import math
a = int(input())
print(a + a ** 2 + a ** 3) | 0 | null | 11,701,830,899,778 | 125 | 115 |
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()
| N = int(input())
S = list(input())
r = 0
g = 0
b = 0
for i in range(N):
if S[i] == 'R':
r += 1
elif S[i] == 'G':
g += 1
else:
b += 1
allcnt = r * g * b
sub = 0
for i in range(N):
for j in range(i+1,N):
if S[i] == S[j]:
None
else:
k = 2*j-i
if k >= N or S[i] == S[k] or S[j] == S[k]:
None
else:
sub += 1
print(allcnt - sub) | 1 | 36,227,695,532,600 | null | 175 | 175 |
def solve():
n = int(input())
if n % 2 == 0:
print(0.5)
else:
print(((n+1)//2) / n)
if __name__ == '__main__':
solve()
| # -*- coding: utf-8 -*-
# A
import sys
from collections import defaultdict, deque
from heapq import heappush, heappop
import math
import bisect
input = sys.stdin.readline
# 再起回数上限変更
# sys.setrecursionlimit(1000000)
N = int(input())
if N % 2 == 0:
print(0.5)
else:
a = N//2
b = N - a
print(b/N)
| 1 | 176,998,686,490,404 | null | 297 | 297 |
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) |
n = int(input())
R = []
for i in range(n):
R.append(int(input()))
minv = R[0]
maxv = R[1] - R[0]
for r in R[1:]:
maxv = max(maxv, r - minv)
minv = min(minv, r)
print(maxv) | 1 | 12,954,278,080 | null | 13 | 13 |
HW = input().split()
H = int(HW[0])
W = int(HW[1])
while H != 0 or W != 0:
for i in range(H):
for j in range(W):
print("#", end = "")
print("")
HW = input().split()
H = int(HW[0])
W = int(HW[1])
print("") | N, K = map(int, input().split())
MOD = 998244353
S = []
for _ in range(K):
S.append(tuple(map(int, input().split())))
dp = [0] * (N + 1)
dp[1] = 1
sum_list = [0] * (N + 1)
sum_list[1] = 1
for i in range(2, N+1):
for L, R in S:
RR = i - L
if RR <= 0:
continue
LL = max(1, i-R)
if LL <= RR:
t = sum_list[RR] - sum_list[LL-1]
dp[i] += t
dp[i] %= MOD
sum_list[i] = (sum_list[i-1] + dp[i]) % MOD
print(dp[N])
| 0 | null | 1,723,586,219,322 | 49 | 74 |
n = int(input())
my_dict = {}
for i in range(n):
order, key = input().split(' ')
if order == 'insert':
my_dict[key] = True
elif order== 'find':
if key in my_dict.keys():
print('yes')
else:
print('no')
| import sys
input = sys.stdin.readline
# sys.setrecursionlimit(100000)
def main():
N = int(input().strip())
return (N//2) + N % 2
if __name__ == "__main__":
print(main()) | 0 | null | 29,509,324,330,068 | 23 | 206 |
A, B, C = map(int,input().split())
if (A == B and B == C) or (A != B and B != C and C != A):
print('No')
else:
print('Yes') | arr = list(map(int, input().split()))
arr.sort()
if (arr[0] == arr[1]) and (arr[2] != arr[1]):
print("Yes")
elif (arr[1] == arr[2]) and (arr[0] != arr[1]):
print("Yes")
else:
print("No") | 1 | 68,358,939,811,010 | null | 216 | 216 |
def main():
input()
in_a = list(map(int, input().split()))
leaves = [0] * len(in_a)
leaves[-1] = in_a[-1]
if in_a[0] > 1:
print(-1)
return
#for i in range(len(in_a)-2, -1, -1):
# leaves[i] = leaves[i+1] + in_a[i]
for i in range(len(in_a) - 1, 1, -1):
leaves[i-1] = leaves[i] + in_a[i-1]
node = 1
total = 1
for i in range(1, len(in_a)):
n = (node - in_a[i-1]) * 2
if n < in_a[i]:
print(-1)
return
node = min(n, leaves[i])
total += node
print(total)
if __name__ == '__main__':
main()
| N = int(input())
A = list(map(int, input().split()))
B = [0] *(N+1)
B[0] = 1
ans = 0
for i in range(1, N+1):
B[i] = (B[i-1] - A[i-1])*2
if B[i] <= 0:
ans = -1
break
if B[N] < A[N]:
ans = -1
if ans == 0:
check = 0
for j in range(N, 0, -1):
check += A[j]
if check < B[j]:
ans += check
else:
last = j
for k in range(1, last+1):
ans += B[k]
break
ans += 1
if N == 0 and A[0] == 1:
ans = 1
print(ans)
| 1 | 18,819,935,522,752 | null | 141 | 141 |
# https://atcoder.jp/contests/abc150/tasks/abc150_d
import math,itertools,fractions,heapq,collections,bisect,sys,queue,copy
sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def LS(): return sys.stdin.readline().split()
def S(): return input()
# GCD -- START --
def gcd(x,y):
while y:
x,y=y,x%y
return x
# GCD --- END ---
# LCM -- START --
def lcm(x,y):
return x*y//gcd(x,y)
# LCM --- END ---
def f(x):
a=0
while x%2==0:
x//=2
a+=1
return a
def main():
n,m=LI()
_l=LI()
l=[x//2 for x in _l]
t=f(l[0])
for i in range(n):
b=l[i]
if t!=f(b):
return 0
l[i]>>=t
m>>=t
_lcm=1
for x in l:
_lcm=lcm(_lcm,x)
if _lcm>m:
return 0
# print(m,_lcm)
m//=_lcm
return (m+1)//2
# main()
print(main())
| class findroop:
def __init__(self, n, nex):
self.n = n
self.next = nex
#遷移start回でループに入る、end回でループする
#A->B->C->D->B: return=(1, 4)
#C->D->B->C : return=(0, 3)
#O(n)
def findroop(self, start):
roopstart = -1
roopend = -1
visited = [False for i in range(self.n)]
visitlist = []
now = start
for i in range(self.n):
if visited[now]:
roopend = i
break
else:
visited[now] = True
visitlist.append(now)
now = self.next(now)
for i in range(len(visitlist)):
if visitlist[i] == now:
roopstart = i
return (roopstart, roopend)
N,X,M = list(map(int, input().split()))
fr = findroop(M, lambda x: x**2 % M)
roopstart, roopend = fr.findroop(X)
ans = 0
if N <= roopstart:
for i in range(N):
ans += X
X = (X**2)%M
else:
for i in range(roopstart):
ans += X
X = (X**2)%M
N -= roopstart
roopsum = 0
for i in range(roopend-roopstart):
roopsum += X
X = (X**2) % M
ans += (N // (roopend-roopstart)) * roopsum
N = N % (roopend-roopstart)
for i in range(N):
ans += X
X = (X**2) % M
print(ans) | 0 | null | 52,313,354,138,612 | 247 | 75 |
x=input()
y=x.split(" ")
n=int(y[0])
g=input()
h=g.split(" ")
su=0
for b in h:
su+=int(b)
if(su>n):
print(-1)
else:
print(n-su)
| n,m = map(int,input().split())
a = map(int,input().split())
s = 0
for i in a:
s += i
if n-s >=0:
print(n-s)
else:
print(-1) | 1 | 31,930,345,501,240 | null | 168 | 168 |
from collections import deque
n = int(input())
G = [[] for _ in range(n)]
for i in range(n):
u, k, *vs = map(int, input().split())
u -= 1
vs = list(map(lambda x: x - 1, vs))
for v in vs:
G[u].append(v)
dist = [-1] * n
dist[0] = 0
que = deque([0])
while len(que) > 0:
now_v = que.popleft()
now_dist = dist[now_v]
next_vs = G[now_v]
for next_v in next_vs:
if dist[next_v] == -1:
dist[next_v] = now_dist + 1
que.append(next_v)
for i, x in enumerate(dist):
print(i + 1, x)
| cc = input().rstrip()
r = 'a' if ord('a') <= ord(cc) and ord(cc) <= ord('z') else 'A'
print(r)
| 0 | null | 5,656,168,526,480 | 9 | 119 |
import math
x1,y1,x2,y2 = (float(x) for x in input().split())
print(round(math.sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2), 8))
| import math
val = str(input()).split()
numList = list(map(float, list(val)))
print(math.sqrt(((numList[2]-numList[0]) ** 2) + ((numList[3]-numList[1]) ** 2)))
| 1 | 157,606,720,700 | null | 29 | 29 |
s = raw_input()
p = raw_input()
s3 = s + s + s
if p in s3:
print 'Yes'
else:
print 'No' | n = input()
n += n
if input() in n:
print("Yes")
else:
print("No") | 1 | 1,730,820,366,672 | null | 64 | 64 |
import sys
from itertools import accumulate
from collections import defaultdict
input = sys.stdin.readline
N,K=map(int,input().split());A=list(map(int,input().split()))
S_=list(map(lambda t: (t[1]-t[0])%K,enumerate(accumulate([0]+A))))
count=0
C=defaultdict(int)
for t in range(1,N+1):
C[S_[t-1]]+=1
if t-K>=0:
C[S_[t-K]]-=1
count+=C[S_[t]]
print(count)
| from collections import defaultdict
N, K, *A = map(int, open(0).read().split())
x = [0] * (N + 1)
for i in range(N):
x[i + 1] = x[i] + A[i]
y = [(x[i] - i) % K for i in range(N + 1)]
ctr = defaultdict(int)
ans = 0
for j in range(N + 1):
ans += ctr[y[j]]
ctr[y[j]] += 1
if j - K + 1 >= 0:
ctr[y[j - K + 1]] -= 1
print(ans)
| 1 | 137,237,725,495,520 | null | 273 | 273 |
print('Yes' if input() in ['hi'*i for i in range(1,6)] else 'No') | N = int(input())
a,b = [], []
for i in range(N):
x,y = map(int, input().split())
a.append(x-y)
b.append(x+y)
a.sort()
b.sort()
ans = max(a[-1] - a[0], b[-1] - b[0])
print(ans) | 0 | null | 28,198,883,067,388 | 199 | 80 |
# -*- coding: utf-8 -*-
str = raw_input()
for _ in xrange(input()):
ops = raw_input().split()
na = int(ops[1])
nb = int(ops[2]) + 1
op = ops[0]
if op[0]=="p": print str[na:nb]
elif op[2]=="v":
t = str[na:nb]
str = str[:na] + t[::-1] + str[nb:]
else: str = str[:na] + ops[3] + str[nb:] | from collections import defaultdict
from itertools import groupby, accumulate, product, permutations, combinations
from math import gcd
def reduction(x,y):
g = gcd(x,y)
return abs(x)//g,abs(y)//g
def solve():
mod = 10**9+7
dplus = defaultdict(lambda: 0)
dminus = defaultdict(lambda: 0)
N = int(input())
x0,y0,xy0 = 0,0,0
for i in range(N):
x,y = map(int, input().split())
if x==0 and y==0:
xy0 += 1
elif x==0 and y!=0:
x0 += 1
elif y==0:
y0 += 1
elif x*y>0:
dplus[reduction(x,y)] += 1
else:
dminus[reduction(-y,x)] += 1
ans = pow(2,x0,mod)+pow(2,y0,mod)-1
other = N-x0-y0-xy0
for k,v in dplus.items():
ans *= pow(2,dminus[k],mod)+pow(2,v,mod)-1
other -= dminus[k]+v
ans *= pow(2,other,mod)
ans += xy0-1
ans %= mod
return ans
print(solve())
| 0 | null | 11,577,257,511,888 | 68 | 146 |
import sys
def input():
return sys.stdin.readline()[:-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 size(self, x):
return -self.parents[self.find(x)]
def same(self, x, y):
return self.find(x) == self.find(y)
def members(self, x):
root = self.find(x)
return [i for i in range(self.n) if self.find(i) == root]
def roots(self):
return [i for i, x in enumerate(self.parents) if x < 0]
def group_count(self):
return len(self.roots())
def all_group_members(self):
return {r: self.members(r) for r in 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 _ in range(M):
a, b = map(int, input().split())
a -= 1
b -= 1
uf.union(a, b)
ans = 0
for i in range(N):
ans = max(ans, uf.size(i))
print(ans)
| import sys
if sys.argv[-1] == 'ONLINE_JUDGE':
import os, zlib, base64
open('tourist.pyx', 'wb').write(zlib.decompress(base64.b85decode("c${TY%Wi`(5WFMt58Fc(Xq*VD9x7D&BPj>l7_bTkIj*Ai>${5yulNExGoBr<UD>{aRttH)I;%|$Qg=gd9dxR@Di;P73FNP9dUGDQ<!!6lSu|K~YBh-_ms0mLUn?gYZW#)-aa9<|QdNMzm)C?=0Ye!0PSL>Nlrr!HyueleslJL(9LLK>v^G%;rmuCIg#qB2DZxNO4vB|vjcygBlZci;a!M4%3#=<-KH%*=17Q{aUKnzd7$r^Mh?)~>JZY8tu?FNSSF3obEX4)B&4>QOg%{W&$?iM3r$#)#@1-i<G$3Tv!!YO=a7HK93>>2bH|?5DKSQZ$O1|v2Wz}2I=r-M5)Wxd_@vZhgv>n8k$Q*}~?$i?{b`*|*!&44o)o(qXPyC2tN78cW$sb`#As%5$;I{B+f6Pb!JtGS5K99vu#l*|yora61crqIw#8`%bf6>w5x%@H*ya+t$KlVq{`2")))
os.system('cythonize -i -3 -b tourist.pyx')
import tourist | 1 | 3,977,100,003,350 | null | 84 | 84 |
s = input()
print(s + "es") if s[-1] == "s" else print(s + "s") | s = input()
if s[-1] == 's':
s += 'es'
else:
s += 's'
print(s)
| 1 | 2,430,218,768,790 | null | 71 | 71 |
import math
john=[]
while True:
try:
john.append(input())
except EOFError:
break
for i in john:
k=list(map(int,i.split()))
print(int(math.gcd(k[0],k[1])),int(k[0]*k[1]/math.gcd(k[0],k[1])))
| import sys
def gcd(a, b):
if b == 0:
return a
else:
return gcd(b, a % b)
def lcm(a, b):
return a * b // gcd(a, b)
def main():
for i in sys.stdin.readlines():
a, b = [int(x) for x in i.split()]
print(gcd(a, b), lcm(a, b))
if __name__ == '__main__':
main() | 1 | 712,909,426 | null | 5 | 5 |
N, X, Y = map(int, input().split())
X -= 1
Y -= 1
ans = [0]*(N-1)
for i in range(N):
for j in range(i+1, N):
if i == j:
continue
cnt = min(abs(i-j), abs(X-i)+abs(j-Y)+1, abs(j-X)+abs(Y-i)+1)
ans[cnt-1] += 1
for i in range(N-1):
print(ans[i])
| def main():
N = int(input())
G = [[] for _ in range(N)]
edge = {}
edge_order = [0]*(N-1)
for i in range(N-1):
a, b = (int(i)-1 for i in input().split())
G[a].append(b)
G[b].append(a)
edge[a*N + b] = -1 # 辺(a,b)の色
edge_order[i] = a*N + b
# 辺彩色
# 最大次数だけ色があればよさそう？
# BFSで塗っていく
# ある辺を塗るときに必要なのは，親の辺の色と，同じ親の頂点を持つ
# 辺のうち彩色済みの色（陽に持たなくてよい）
max_deg = max(len(G[i]) for i in range(N))
from collections import deque
def bfs(s):
que = deque([])
par = [-1]*N
par_color = [-1]*N
c = 0
que.append(s)
while que:
pos = que.popleft()
for v in G[pos]:
if par[pos] == v:
continue
if par_color[pos] == c:
c += 1
if c == max_deg:
c = 0
if pos < v:
edge[pos * N + v] = c
else:
edge[v * N + pos] = c
par[v] = pos
par_color[v] = c
que.append(v)
c += 1
if c == max_deg:
c = 0
bfs(0)
print(max_deg)
for i in range(N-1):
print(edge[edge_order[i]] + 1)
if __name__ == '__main__':
main()
| 0 | null | 90,039,362,610,938 | 187 | 272 |
def cmb(n,r,mod):
if r<0 or r>n:
return 0
r=min(r,n-r)
return g1[n]*g2[r]*g2[n-r]%mod
k=int(input())
s=list(input())
n=len(s)
mod=10**9+7
g1=[1,1]
g2=[1,1]
inverse=[0,1]
for i in range(2,2*10**6+1):
g1.append((g1[-1]*i)%mod)
inverse.append((-inverse[mod%i]*(mod//i))%mod)
g2.append((g2[-1]*inverse[-1])%mod)
pow25=[1]
for i in range(n+k+1):
pow25.append((pow25[-1]*25)%mod)
pow26=[1]
for i in range(n+k+1):
pow26.append((pow26[-1]*26)%mod)
ans=0
for i in range(n,n+k+1):
ans+=cmb(i-1,n-1,mod)*pow25[i-n]*pow26[n+k-i]
ans%=mod
print(ans) | N, M, K = map(int,input().split())
A = list(map(int,input().split()))
B = list(map(int,input().split()))
Asum = [0]
Bsum = [0]
a = 0
b = 0
for i in range(N):
a += A[i]
Asum.append(a)
for i in range(M):
b += B[i]
Bsum.append(b)
Asum.append(0)
Bsum.append(0)
res, j = 0, M
for i in range(N+1):
if Asum[i] > K:
break
while Asum[i] + Bsum[j] > K:
j -= 1
res = max(res,i+j)
print(res) | 0 | null | 11,814,775,818,880 | 124 | 117 |
name = input()
str_name = str(name)
print(str_name[:3]) | N=int(input())
move=10**12
for n in range(1,int(N**.5)+1):
if N%n==0:
move=min(move,N//n+n-2)
print(move) | 0 | null | 87,916,626,635,018 | 130 | 288 |
R = int(input())
double = 2 * R
print(double * 3.14) | import math
radius=int(input())
print(2*math.pi*radius) | 1 | 31,483,084,495,008 | null | 167 | 167 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.