code1
stringlengths 17
427k
| code2
stringlengths 17
427k
| similar
int64 0
1
| pair_id
int64 2
181,637B
⌀ | question_pair_id
float64 3.7M
180,677B
⌀ | code1_group
int64 1
299
| code2_group
int64 1
299
|
|---|---|---|---|---|---|---|
n, k = map(int, input().split())
nums = list(map(int, input().split()))
# (sums[j] - sums[i]) % K = j - i
# (sums[j] - j) % K = (sums[i] - i) % K
# 1, 4, 2, 3, 5
# 0, 1, 5, 7, 10, 15
# 0, 0, 3, 0, 2, 2
sums = [0]
for x in nums:
sums.append(sums[-1] + x)
a = [(sums[i] - i) % k for i in range(len(sums))]
res = 0
memo = {}
i = 0
for j in range(len(a)):
memo[a[j]] = memo.get(a[j], 0) + 1
if j - i + 1 > k:
memo[a[i]] -= 1
i += 1
res += memo[a[j]] - 1
print(res) | n, k = map(int, input().split())
a = list(map(int, input().split()))
a2 = [0]
for i in range(n):
a2.append(a2[-1] + a[i] - 1)
a2 = [a2[i] % k for i in range(n + 1)]
count = {}
temp = a2[:min(k, len(a2))]
for i in temp:
count.setdefault(i, 0)
count[i] += 1
ans = 0
for i in count.values():
ans += (i * (i - 1) // 2)
for i in range(1, len(a2) - len(temp) + 1):
temp = a2[i: i + len(temp)]
temp2 = temp[:-1]
ans += temp2.count(temp[-1])
print(ans) | 1 | 137,842,012,136,000 | null | 273 | 273 |
def f(d, D):
i = 0
while i < 6:
if d == D[i]:
return i
else:
i += 1
Q0 = [1,2,4,3,1]
Q1 = [0,3,5,2,0]
Q2 = [0,1,5,4,0]
ans = ''
D = list(map(int, input().split(' ')))
n = int(input())
i = 0
while i < n:
d0, d1 = map(int, input().split(' '))
L0 = f(d0, D)
L1 = f(d1, D)
if L0 == 0:
q = 0
while q < 4:
if L1 == Q0[q]:
ans += str(D[Q0[q + 1]]) + '\n'
break
q += 1
elif L0 == 1:
q = 0
while q < 4:
if L1 == Q1[q]:
ans += str(D[Q1[q + 1]]) + '\n'
break
q += 1
elif L0 == 2:
q = 0
while q < 4:
if L1 == Q2[q]:
ans += str(D[Q2[q + 1]]) + '\n'
break
q += 1
elif L0 == 3:
q = 0
while q < 4:
if L1 == Q2[4-q]:
ans += str(D[Q2[4-q-1]]) + '\n'
break
q += 1
elif L0 == 4:
q = 0
while q < 4:
if L1 == Q1[4-q]:
ans += str(D[Q1[4-q-1]]) + '\n'
break
q += 1
elif L0 == 5:
q = 0
while q < 4:
if L1 == Q0[4-q]:
ans += str(D[Q0[4-q-1]]) + '\n'
break
q += 1
i += 1
if ans != '':
print(ans[:-1])
| 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])
| 0 | null | 142,621,471,650 | 34 | 15 |
x=int(input())
gohyaku=0
goen=0
while x>5:
x-=500
gohyaku+=1
if x==5:
goen+=1
elif 0<=x<5:
pass
elif x<0:
x+=500
gohyaku-=1
while x>=5:
goen+=1
x-=5
print(gohyaku*1000+goen*5) | #ABC147 C やってる途中
n=int(input())
l=[]
for i in range(n):
a=int(input())
l_=[]
for j in range(a):
xy=list(map(int,input().split()))
l_.append(xy)
l.append(l_)
ans=0
for i in range(2**n):
table=[0]*n
flag=False
for j in range(n):
if (i>>j)&1:
table[j]=1
for j in range(n):
for k in l[j]:
if k[1]!=table[k[0]-1] and table[j]==1:
flag=True
break
if flag:
break
if flag==True:
continue
ans = max(ans, table.count(1))
print(ans) | 0 | null | 82,104,763,663,462 | 185 | 262 |
import sys
def solve():
input = sys.stdin.readline
N = int(input())
if N == 2: print(1)
else:
K = {N, N-1}
for i in range(2, N + 1):
if i ** 2 > N: break
if N % i == 0:
k = N
while k % i == 0:
k //= i
if k % i == 1: K |= {i}
if (N - 1) % i == 0:
K |= {i}
if i ** 2 != N - 1: K |= {(N - 1) // i}
print(len(K))
#print(K)
return 0
if __name__ == "__main__":
solve() | import sys
input = sys.stdin.readline
N = int(input())
def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
# divisors.sort()
return divisors
a = make_divisors(N)
b = make_divisors(N - 1)
s = set(a + b)
res = 0
for x in s:
if x == 1: continue
t = N + 0
while t % x == 0: t //= x
res += (t % x == 1)
print(res) | 1 | 41,191,219,590,078 | null | 183 | 183 |
n,m=map(int,input().split());a=sorted(map(int,input().split()),reverse=True)
print('NYoe s'[all([1 if i>=sum(a)/(4*m) else 0 for i in a[:m]])::2]) | n, m = input().split()
a = list(map(int, input().split()))
b = []
s = 0
for i in a:
s += i
for i in a:
if float(i) >= float(int(s)/(4*int(m))):
b.append(i)
if len(b) == int(m):
break
if len(b) == int(m):
print("Yes")
else:
print("No") | 1 | 38,739,642,336,144 | null | 179 | 179 |
import math
N, D= list(map(int,input().split()))
cnt = 0
for i in range(N):
x, y = list(map(int, input().split()))
#print(math.sqrt((x^2)+(y^2)))
if math.sqrt((x*x)+(y*y)) <= D:
cnt+=1
print(cnt) | def main():
N, D = map(int, input().split())
A = [list(map(int, input().split())) for _ in range(N)]
cnt = 0
for a in A:
if (a[0]**2 + a[1]**2)**0.5 <= D:
cnt += 1
print(cnt)
if __name__ == '__main__':
main() | 1 | 5,928,838,466,980 | null | 96 | 96 |
def resolve():
S = list(input())
ans = [0 for _ in range(len(S) + 1)]
cnt = 0
for i in range(len(S)):
if S[i] == "<":
cnt += 1
ans[i + 1] = max(cnt, ans[i + 1])
else:
cnt = 0
cnt = 0
for i in range(len(S), 0, -1):
if S[i - 1] == ">":
cnt += 1
ans[i - 1] = max(cnt, ans[i - 1])
else:
cnt = 0
print(sum(ans))
resolve()
| def calc(X):
A = 1
B = 1
if X == 0:
return A,B
else:
l_bound = 1
h_bound = 200
for i in range(l_bound,h_bound):
for j in range(0,i+1):
if i ** 5 - j ** 5 == X:
A = i
B = j
return A,B
if i ** 5 + j ** 5 == X:
A = i
B = -j
return A,B
def resolve():
X = int(input())
A,B = calc(X)
print(str(A) + " " + str(B))
resolve() | 0 | null | 90,574,825,268,020 | 285 | 156 |
from collections import Counter
N, K = map(int, input().split())
R, S, P = map(int, input().split())
T = input()
result = []
for i in range(K):
result.append(T[i])
for j in range(K, N):
if result[j-K] == T[j]:
result.append("d")
else:
result.append(T[j])
result = Counter(result)
print(result["r"]*P+result["s"]*R+result["p"]*S)
| n = int(input())
a = list(map(int, input().split()))
max_node = [0 for _ in range(n+1)]
for i in range(n-1, -1, -1):
max_node[i] = max_node[i+1] + a[i+1]
ans = 1
node = 1
for i in range(n+1):
node -= a[i]
if (i < n and node <= 0) or node < 0:
print(-1)
exit(0)
node = min(node * 2, max_node[i])
ans += node
print(ans) | 0 | null | 62,578,933,125,300 | 251 | 141 |
n = int(input())
x = list(map(float, input().split()))
y = list(map(float, input().split()))
p_1 = sum([abs(x[i]-y[i]) for i in range(n)])
p_2 = (sum([(x[i]-y[i])**2 for i in range(n)]))**0.5
p_3 = (sum([(abs(x[i]-y[i]))**3 for i in range(n)]))**(1/3)
p_inf = max([abs(x[i]-y[i]) for i in range(n)])
print("{:.5f}".format(p_1))
print("{:.5f}".format(p_2))
print("{:.5f}".format(p_3))
print("{:.5f}".format(p_inf)) | import sys
#f = open("test.txt", "r")
f = sys.stdin
num_rank = 14
s_list = [False] * num_rank
h_list = [False] * num_rank
c_list = [False] * num_rank
d_list = [False] * num_rank
n = f.readline()
n = int(n)
for i in range(n):
[suit, num] = f.readline().split()
num = int(num)
if suit == "S":
s_list[num] = True
elif suit == "H":
h_list[num] = True
elif suit == "C":
c_list[num] = True
else:
d_list[num] = True
for i in range(1, num_rank):
if not s_list[i]:
print("S " + str(i))
for i in range(1, num_rank):
if not h_list[i]:
print("H " + str(i))
for i in range(1, num_rank):
if not c_list[i]:
print("C " + str(i))
for i in range(1, num_rank):
if not d_list[i]:
print("D " + str(i)) | 0 | null | 629,669,336,170 | 32 | 54 |
while 1:
m,f,r=map(int, raw_input().split())
if m==f==r==-1: break
s=m+f
if m==-1 or f==-1 or s<30: R="F"
elif s>=80: R="A"
elif s>=65: R="B"
elif s>=50: R="C"
elif r>=50: R="C"
else: R="D"
print R | string = input()
if string[len(string)-1] == "s":
print(string+'es')
else:
print(string+'s')
| 0 | null | 1,840,306,214,880 | 57 | 71 |
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
# F - Select Half
n = int(input())
a = list(map(int, input().split()))
assert len(a) == n
# memo[i][m] a[0:i+1]からm個選ぶときの最大値
memo = [{} for i in range(n)]
memo[0] = {0: 0, 1: a[0]}
memo[1] = {1: max(a[:2])}
for i in range(2, n):
m = (i + 1) // 2
memo[i][m] = max(memo[i - 1][m], memo[i - 2][m - 1] + a[i])
if i % 2 == 0:
memo[i][m + 1] = memo[i - 2][m] + a[i]
print(memo[-1][n // 2])
| n=int(input())
l=list(map(int,input().split()))
m=n//2
t=n%2+2
dp=[0]*t
for i in range(m):
for j in range(t):
dp[j]+=l[2*i+j]
for j in range(1,t):
dp[j]=max(dp[j],dp[j-1])
print(dp[-1]) | 1 | 37,642,219,025,600 | null | 177 | 177 |
input()
a = [int(x) for x in input().split(" ")]
print(*a[::-1]) | num = int(input())
line = input().split(" ")
line.reverse()
print(*line)
| 1 | 978,322,650,262 | null | 53 | 53 |
import sys
a = []
n, m = map(int, input().split())
for i in range(n):
ai = list(map(int, input().split()))
ai.append(sum(ai))
a.append(ai)
for i in range(n):
print(" ".join(list(map(str, a[i]))))
ai = []
for j in range(m + 1):
s = 0
for i in range(n):
s += a[i][j]
ai.append(s)
print(" ".join(list(map(str, ai)))) | INF = 10000000000
def merge(A, left, mid, right):
global num
leftA = A[left:mid]
rightA = A[mid:right]
leftA.append(INF)
rightA.append(INF)
l = 0
r = 0
for i in range(left, right):
num += 1
if leftA[l] <= rightA[r]:
A[i] = leftA[l]
l += 1
else:
A[i] = rightA[r]
r += 1
def mergeSort(A, left, right):
if right - left < 2:
return
mid = left + (right - left) // 2
mergeSort(A, left, mid)
mergeSort(A, mid, right)
merge(A, left, mid, right)
if __name__ == "__main__":
n = int(input())
S = list(map(int, input().split()))
num = 0
mergeSort(S, 0, len(S))
print(" ".join(map(str, S)))
print(num) | 0 | null | 738,934,141,780 | 59 | 26 |
h = -1
w = -1
while (h != 0) and (w != 0):
input = map(int, raw_input().split(" "))
h = input[0]
w = input[1]
if (h == 0 and w == 0):
break
i = 0
j = 0
line = ""
while j < w:
line += "#"
j += 1
while i < h:
print line
i += 1
print "" | while True:
H, W = map(int, input().split())
if H == 0:
break
for i in range(H):
print("#"*W)
print()
| 1 | 771,576,625,860 | null | 49 | 49 |
h, n = map(int,input().split())
a = [0 for i in range(n)]
b = [0 for i in range(n)]
for i in range(n):
ai ,bi = map(int,input().split())
a[i] = ai
b[i] = bi
mh = [0 for i in range(10003)]
for i in range(1,h+1):
mb = 10**9
for j in range(n):
if mb > mh[i-a[j]] + b[j]:
mb = mh[i-a[j]] + b[j]
mh[i] = mb
print(mh[h])
| N = int(input())
S = input()
r = S.count("R")
g = S.count("G")
b = S.count("B")
ans = r * g * b
for i in range(N):
for j in range(i + 1, N):
k = 2 * j - i
if k < N:
if sorted(S[i] + S[j] + S[k]) == ['B', 'G', 'R']:
ans -= 1
print(ans) | 0 | null | 58,804,216,166,338 | 229 | 175 |
w,h,x,y,r=map(int,input().split())
print(['No','Yes'][r<=x<=w-r and r<=y<=h-r]) | W, H, x, y, r = map(int, input().split())
if (2*r <= (x+r) <= W) & (2*r <= (y+r) <= H):
print('Yes')
else:
print('No')
| 1 | 454,667,311,558 | null | 41 | 41 |
MOD = int(1e+9 + 7)
N, K = map(int, input().split())
cnt = [0] * (K + 1) # 要素が全てXの倍数となるような数列の個数をXごとに求める
for x in range(1, K + 1):
cnt[x] = pow(K // x, N, MOD)
for x in range(K, 0, -1): # 2X, 3Xの個数を求めてひく
for i in range(2, K // x + 1):
cnt[x] -= cnt[x * i]
ans = 0
for k in range(K+1):
ans += cnt[k] * k
ans = ans % MOD
print(ans) | #%%
N, K = map(int,input().split())
MOD = 10**9 + 7
#%%
ans = 0
gcds = [0]*(K+1)
for i in reversed(range(1, K+1)):
gcds[i] = pow(K//i, N, MOD)
idx = i*2
while idx<K+1:
gcds[i] -= gcds[idx] + MOD
gcds[i] %= MOD
idx += i
ans += (i * gcds[i])
ans %= MOD
print(ans)
| 1 | 36,655,410,571,542 | null | 176 | 176 |
N, M = map(int, input().split())
ac = 0
pena = 0
count = [0 for _ in range(N+1)]
for _ in range(M):
p, S = input().split()
p = int(p)
if S == 'AC':
if count[p] > -1:
pena += count[p]
ac += 1
count[p] = -10**5-1
else:
count[p] += 1
print(ac, pena)
| 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')
| 0 | null | 88,096,888,908,172 | 240 | 231 |
n=int(input())
ans=':('
for i in range(1,n+1):
if int((i*1.08)//1)==n:
ans=i
break
print(ans)
| def resolve():
N = int(input())
import math
print(math.ceil(N/2))
if '__main__' == __name__:
resolve() | 0 | null | 92,638,578,388,288 | 265 | 206 |
from math import floor
A= input().split()
p = int(A[0])
q = round(float(A[1])*100)
t = p*q
t //= 100
print(t) | from decimal import Decimal
def main():
a, b = input().split(" ")
a = int(a)
b = Decimal(b)
print(int(a*b))
if __name__ == "__main__":
main() | 1 | 16,576,808,970,550 | null | 135 | 135 |
def judge(a, b, c):
return 'Yes' if a < b < c else 'No'
if __name__ == '__main__':
a, b, c = map(int, input().split(' '))
print(judge(a, b, c))
| K = int(input())
ans = ""
for _ in range(K):
ans += "ACL"
print(ans) | 0 | null | 1,268,426,726,920 | 39 | 69 |
from collections import deque
N,M = map(int,input().split())
G = {i:[] for i in range(1,N+1)}
for _ in range(M):
a,b = map(int,input().split())
G[a].append(b)
G[b].append(a)
col = [-1 for _ in range(N+1)]
cnt = 0
for i in range(1,N+1):
if col[i]<0:
col[i]=cnt
que = deque([i])
while que:
x = que.popleft()
for y in G[x]:
if col[y]<0:
col[y] = cnt
que.append(y)
cnt += 1
C = {}
for i in range(1,N+1):
a = col[i]
if a not in C:
C[a] = 0
C[a] += 1
cmax = 0
for a in C:
cmax = max(cmax,C[a])
print(cmax) | import math
N = int(input())
X = N/1.08
Y = math.ceil(X)
Z = math.floor(Y*1.08)
if N == Z:
print(Y)
else:
print(':(') | 0 | null | 64,796,195,747,140 | 84 | 265 |
def insertionSort(A,n,g,cnt):
for i in range(g,n):
v = A[i]
j = i-g
while (j>=0)*(A[j]>v):
A[j+g]=A[j]
j = j-g
cnt[0] += 1
A[j+g] = v
A =[]
N = int(input())
for i in range(N):
A.append(int(input()))
cnt = [0]
import math
m = math.floor(math.log(N,2))+1
G = [math.ceil(N/2)]
for i in range(1,m-1):
G.append(math.ceil(G[i-1]/2))
G.append(N-sum(G))
if G[len(G)-1] != 1:
G[len(G)-1] = 1
for k in range(m):
insertionSort(A,N,G[k],cnt)
print(m)
for i in range(m):
print(f"{G[i]}",end=" ")
print(f"\n{cnt[0]}")
for i in range(N):
print(f"{A[i]}")
| import sys
def print_arr(arr):
for i in range(len(arr)):
sys.stdout.write(str(arr[i]))
if i != len(arr) - 1:
sys.stdout.write(' ')
print()
def insertion_sort(arr, g):
n = len(arr)
cnt = 0
for i in range(n):
key = arr[i]
j = i - g
while j >= 0 and arr[j] > key:
arr[j + g] = arr[j]
j -= g
cnt += 1
arr[j + g] = key
return cnt
def shell_sort(arr, G):
cnt = 0
for i in range(len(G)):
cnt += insertion_sort(arr, G[i])
return cnt
def get_gaps(n):
lst = []
v = 1
cnt = 1
while v <= n:
lst.append(v)
v += 3**cnt
cnt += 1
if len(lst) == 0: lst.append(1)
return list(reversed(lst))
n = int(input())
arr = [None] * n
for i in range(n):
arr[i] = int(input())
G = get_gaps(n)
cnt = shell_sort(arr, G)
print(len(G))
print_arr(G)
print(cnt)
for i in range(n):
print(arr[i])
| 1 | 31,592,149,340 | null | 17 | 17 |
N = int(input())
A = list(map(int, input().split()))
if 0 in A:
print(0)
else:
ans = 1
for a in A:
ans *= a
if ans > 10**18:
print(-1)
exit(0)
print(ans)
| n = int(input())
a = [int(x) for x in input().split()]
res = 0
for i in range(n):
for j in range(i+1,n):
res += a[i] * a[j]
print(res) | 0 | null | 92,587,294,834,016 | 134 | 292 |
x = int(input())
print('Yes') if x >= 30 else print('No')
| print("Yes" if int(input()) >= 30 else "No")
| 1 | 5,766,774,305,308 | null | 95 | 95 |
r = int(input())
a = r**2
print(a) | r=int(input())
print(pow(r,2)) | 1 | 144,960,844,056,060 | null | 278 | 278 |
MOD = 998244353
N, S = map(int, input().split())
A = list(map(int, input().split()))
dp = [[0] * (S + 1) for i in range(N)]
dp[0][0] = 2
if A[0] < S + 1:
dp[0][A[0]] = 1
for i in range(1, N):
for j in range(S + 1):
dp[i][j] = (2 * dp[i - 1][j]) % MOD
if 0 <= j - A[i] <= S:
dp[i][j] = (dp[i][j] + dp[i - 1][j - A[i]]) % MOD
print(dp[-1][-1]) | from collections import defaultdict
MOD = 998244353
N,S = map(int,input().split())
A = map(int,input().split())
dp = [0]*(S+1)
dp[0] = 1
for a in A:
ndp = [0]*(S+1)
for total,cnt in enumerate(dp):
ndp[total] += dp[total]*2
ndp[total] %= MOD
if total+a <= S:
ndp[total+a] += dp[total]
ndp[total+a] %= MOD
dp = ndp
print(dp[-1]%MOD) | 1 | 17,586,955,906,118 | null | 138 | 138 |
from collections import deque
from math import ceil
# n个怪物，d杀伤半径，a杀伤值
n, d, a = map(int, input().split())
ms = [map(int, input().split()) for i in range(n)]
ms = sorted([(pos, ceil(hp / a)) for pos, hp in ms])
bombs = deque()
ans = 0
valid_bomb = 0
for pos, hp in ms:
# 查看队列里的bomb是否对当前怪物有效
while bombs and bombs[0][0] < pos:
bomb_border, bomb_cnt = bombs.popleft()
valid_bomb -= bomb_cnt
# 还需新加多少bomb才能灭掉当前怪物
bomb_cnt = max(0, hp - valid_bomb)
valid_bomb += bomb_cnt
ans += bomb_cnt
# 新加的bomb放入队列
if bomb_cnt > 0:
bombs.append([pos + d * 2, bomb_cnt])
print(ans) | def main():
import sys
input=sys.stdin.readline
l=lambda: list(map(int,input().split()))
n,d,a=l()
xh=[]
for i in range(n):
xi,hi=l()
xh.append([xi,hi])
xh.sort()
right_index=[]
#尺取り法
tmp=0
for i in range(n):
j=tmp
while xh[j][0]<=xh[i][0]+2*d:
j+=1
if j==n: break
j-=1
right_index.append(j)
tmp=j
ans=0
cnt=0
damage=[0]*(n+1)
for i in range(n):
xh[i][1]-=(ans-cnt)*a
damage_cnt=max(0,(xh[i][1]-1)//a + 1)
ans+=damage_cnt
damage[right_index[i]]+=damage_cnt
cnt+=damage[i]
print(ans)
if __name__=='__main__':
main() | 1 | 82,073,961,276,930 | null | 230 | 230 |
N = int(input())
g = 0
for n in range(1, N + 1):
if n % 2 == 0:
g += 1
ANS = (N - g) / N
print(ANS) | n = int(input())
nn = []
odd = 0
for i in range(1, n+1):
if i % 2 == 1:
odd += 1
nn.append(i)
s = len(nn)
print(odd/s)
| 1 | 177,570,507,342,570 | null | 297 | 297 |
import sys
N = int(input())
strN = str(N)
if not ( 100 <= N <= 999 ): sys.exit()
print('Yes') if '7' in strN else print('No') | import sys
n=input()
for x in n:
if x == "7":
print("Yes")
sys.exit()
print("No") | 1 | 34,305,106,144,122 | null | 172 | 172 |
n, k, s = map(int, input().split())
for i in range(n):
if k == 0:
if s-1 > 0:
print(s-1, end=' ')
else:
print(s+1, end=' ')
else:
print(s, end=' ')
k -= 1
print()
| from sys import exit
import math
import collections
ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))
x,k,d = mi()
x = abs(x)
count = min(k,x//d)
k -= count
x -= d*count
if k % 2 == 0:
print(x)
else:
print(d-x) | 0 | null | 48,083,323,370,082 | 238 | 92 |
# -*- coding: utf-8 -*-
def main():
N = int(input())
d = list(map(int, input().split()))
ans = 0
for i in range(N - 1):
for j in range(i + 1, N):
ans += d[i] * d[j]
print(ans)
if __name__ == "__main__":
main() | ans=0
n=int(input())
li=list(map(int,input().split()))
for i in range(len(li)):
for j in range(len(li)):
if i==j:
break
ans+=li[i]*li[j]
print(ans)
| 1 | 167,526,412,900,352 | null | 292 | 292 |
N = int(input())
A = [int(i) for i in input().split()]
def bubbleSort(A, N):
count = 0
flag = 1
while flag:
flag = 0
for i in range(N-1, 0, -1):
if A[i] < A[i-1]:
tmp = A[i]
A[i] = A[i-1]
A[i-1] = tmp
flag = 1
count += 1
return A, count
A, count = bubbleSort(A, N)
print(' '.join([str(i) for i in A]))
print(count) | n,u,v = map(int,input().split())
import queue
dist_t = [0] * n
dist_a = [0] * n
elb_t = [0] * n
elb_a = [0] * n
ab = [[] for j in range(n)]
for i in range(n-1):
a,b = map(int,input().split())
ab[a-1].append(b-1)
ab[b-1].append(a-1)
u -= 1
v -= 1
q = queue.Queue()
q.put(u)
elb_t[u] = 1
dist_t[u] = 0
while not q.empty():
tmp = q.get()
for i in range(len(ab[tmp])):
idx = ab[tmp][i]
if elb_t[idx] != 1:
if dist_t[idx] != 0:
dist_t[idx] = min(dist_t[idx], dist_t[tmp] + 1)
else:
dist_t[idx] = dist_t[tmp] + 1
elb_t[idx] = 1
q.put(idx)
q = queue.Queue()
q.put(v)
elb_a[v] = 1
dist_a[v] = 0
while not q.empty():
tmp = q.get()
for i in range(len(ab[tmp])):
idx = ab[tmp][i]
if elb_a[idx] != 1:
dist_a[idx] = dist_a[tmp] + 1
elb_a[idx] = 1
q.put(idx)
ans = 0
for i in range(n):
if dist_a[i] > dist_t[i]:
ans = max(ans,dist_a[i]-1)
print(ans) | 0 | null | 58,442,034,346,752 | 14 | 259 |
s = int(input())
a = [None, 0, 0] + [1] * (s - 2)
for i in range(3, s - 2):
a[i + 3] += a[i]
a[i + 1] += a[i]
print(a[s] % (10**9 + 7))
| a = list(map(int, input().split()))
print('bust' if sum(a) >= 22 else 'win') | 0 | null | 61,098,192,079,420 | 79 | 260 |
import sys
import itertools
# import numpy as np
import time
import math
from heapq import heappop, heappush
from collections import defaultdict
from collections import Counter
from collections import deque
sys.setrecursionlimit(10 ** 7)
INF = 10 ** 18
MOD = 10 ** 9 + 7
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
# map(int, input().split())
N, M, L = map(int, input().split())
dist = [[INF] * N for _ in range(N)]
for i in range(M):
a, b, c = map(int, input().split())
if c > L:
continue
a -= 1
b -= 1
dist[a][b] = c
dist[b][a] = c
Q = int(input())
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])
fuel = [[INF] * N for _ in range(N)]
for i in range(N):
for j in range(N):
fuel[i][j] = 1 if dist[i][j] <= L else INF
for k in range(N):
for i in range(N):
for j in range(N):
fuel[i][j] = min(fuel[i][j], fuel[i][k] + fuel[k][j])
for i in range(Q):
s,t = map(int, input().split())
if fuel[s - 1][t - 1] != INF:
print(fuel[s - 1][t - 1] - 1)
else:
print(-1) | h,w=map(int, input().split())
cnt=(w//2)*h
if w%2==1:
cnt+=h//2+h%2
if h==1 or w==1:
cnt=1
print(cnt) | 0 | null | 111,943,294,644,608 | 295 | 196 |
num = int(input())
print("{0}".format(num**3))
| from math import gcd
n = int(input())
s = list(map(int, input().split()))
s.sort()
dp = [0] * ((10 ** 6) + 100)
res = s[0]
for ss in s:
dp[ss] += 1
res = gcd(res, ss)
A = max(s)
pairwise = True
setwise = (res == 1)
primes = set(range(2, A+1))
for i in range(2, int(A**0.5+1)):
if i not in primes:
i += 1
else:
ran = range(i*2, A+1,i)
primes.difference_update(ran)
primes = list(primes)
for i in primes:
cnt = 0
for j in range(i, A + 1, i):
cnt += dp[j]
if cnt > 1:
pairwise = False
break
if pairwise:
print("pairwise coprime")
elif setwise:
print("setwise coprime")
else:
print("not coprime")
| 0 | null | 2,230,063,834,108 | 35 | 85 |
x = int(input())
c_500 = 0
c_5 = 0
while True:
temp = x - 500
if temp < 0:
break
else:
c_500 += 1
x = temp
while True:
temp = x - 5
if temp < 0:
break
else:
c_5 += 1
x = temp
print(c_500 * 2 * 500 + c_5 * 5)
| X = int(input())
eikaku = X if X < 180 else X - 180
cnt = 0
ans = 0
while True:
ans += 1
cnt += eikaku
if cnt % 360 == 0:
print(ans)
break | 0 | null | 27,935,984,650,924 | 185 | 125 |
import math
import itertools
# 与えられた数値の桁数と桁値の総和を計算する.
def calc_digit_sum(num):
digits = sums = 0
while num > 0:
digits += 1
sums += num % 10
num //= 10
return digits, sums
s = input()
t = input()
answer = len(t)
for index in range(len(s) - (len(t) - 1)):
d = s[index:index+len(t)]
match = 0
for idx in range(len(t)):
if t[idx] == d[idx]:
match += 1
answer = min(answer, len(t) - match)
print(answer) |
S = input()
T = input()
count = 0
max_count = 0
for i in range(len(S) - len(T) +1):
for j in range(len(T)):
if S[i+j] == T[j]:
count += 1
if max_count <= count:
max_count = count
if j == (len(T) -1):
count = 0
print(len(T) - max_count)
| 1 | 3,651,038,932,930 | null | 82 | 82 |
s=list(input())
a=int(input())
w = ""
c = 0
cnt = 0
for i in s:
if w != i:
#print(w)
cnt += c//2
c = 1
w = i
else:
c +=1
cnt += c//2
#print(cnt)
start = 0
start_w = s[0]
for i in s:
if start_w != i:
break
else:
start +=1
s.reverse()
end = 0
end_w = s[0]
for i in s:
if end_w != i:
break
else:
end +=1
same = len(list(set(s)))
#print(same)
if s[0] != s[-1]:
print(cnt*a)
elif same ==1:
print(len(s)*a//2)
else:
print(cnt*a-(a-1)*(start//2+end//2-(start+end)//2)) | count = 0
INFTY = 10 ** 10
def merge(A, left, mid, right):
global count
n1 = mid - left;
n2 = right - mid;
L = []
R = []
for i in range(n1):
L.append(A[left + i])
for i in range(n2):
R.append(A[mid + i])
L.append(INFTY)
R.append(INFTY)
i = 0
j = 0
for k in range(left, right):
count = count + 1
if L[i] <= R[j]:
A[k] = L[i]
i = i + 1
else:
A[k] = R[j]
j = j + 1
def mergeSort(A, left, right):
if left+1 < right:
mid = (left + right)/2;
mergeSort(A, left, mid)
mergeSort(A, mid, right)
merge(A, left, mid, right)
import sys
n = raw_input()
for line in sys.stdin:
items = line.strip().split()
items = map(int, items)
mergeSort(items, 0, len(items))
print " ".join(map(str, items))
print count | 0 | null | 88,047,116,255,670 | 296 | 26 |
N=int(input())
ans=0
if ~N%2:
for i in range(1,30):
ans+=N//(2*5**i)
print(ans) | def resolve():
N = int(input())
if N%2 == 1:
print(0)
else:
ans = 0
for i in range(0, 50):
ans += N//(10*(5**i))
print(ans)
if __name__ == "__main__":
resolve()
| 1 | 116,186,520,302,878 | null | 258 | 258 |
S = input()
h = S/3600
m = S%3600 / 60
s = S%60
print'%d:%d:%d' % (h,m,s) | s = input()
h = s/3600
m = s%3600/60
s = s%3600%60
print '{0}:{1}:{2}'.format(h, m, s) | 1 | 330,619,434,208 | null | 37 | 37 |
A = int(input())
if A >= 30:
print('Yes')
else:
print('No') | X = int(input())
print('Yes') if X >= 30 else print('No') | 1 | 5,732,840,433,660 | null | 95 | 95 |
arguments = input().split()
array = []
for word in arguments:
if word == '-':
s1 = array.pop()
s2 = array.pop()
array.append(s2-s1)
elif word == '*':
s1 =array.pop()
s2 = array.pop()
array.append(s1*s2)
elif word == '+':
s1 = array.pop()
s2 = array.pop()
array.append(s1+s2)
else:
array.append(int(word))
print(array.pop()) | n = int(input())
a = list(map(int,input().split()))
a.sort()
a.insert(0,0)
ans = 0
z = a[-1]
for i in range(1,n):
ans += a[n - (i // 2)]
print(ans) | 0 | null | 4,622,984,668,282 | 18 | 111 |
n=int(input())
A=[int(x) for x in input().split()]
u=10**6+1
C=[0]*u
D=[0]*2+[1]*(u-2)
def gcd(a,b):
while a%b:
a,b=b,a%b
return b
n=4
while n<u:
D[n]=0
n+=2
i=3
while i*i<u:
if D[i]:
n=i*2
while n<u:
D[n]=0
n+=i
i+=2
for a in A:
C[a]+=1
for i in [x for x in range(2,u) if D[x]==1]:
if sum(C[i::i])>1:
break
else:
print('pairwise coprime')
exit()
c=A[0]
for a in A:
c=gcd(c,a)
if c==1:
break
else:
print('not coprime')
exit()
print('setwise coprime')
| import sys
read = sys.stdin.buffer.read
input = sys.stdin.readline
input = sys.stdin.buffer.readline
#sys.setrecursionlimit(10**9)
#from functools import lru_cache
def RD(): return sys.stdin.read()
def II(): return int(input())
def MI(): return map(int,input().split())
def MF(): return map(float,input().split())
def LI(): return list(map(int,input().split()))
def LF(): return list(map(float,input().split()))
def TI(): return tuple(map(int,input().split()))
# rstrip().decode('utf-8')
#import numpy as np
def main():
x,y,z=MI()
print(z,x,y)
if __name__ == "__main__":
main() | 0 | null | 21,070,955,091,152 | 85 | 178 |
n=int(input())
a=input()
if n%2!=0:
print('No')
exit()
t1=a[0:int(n/2)]
t2=a[int(n/2):n]
if t1==t2:
print('Yes')
else:
print('No') | class Dice(object):
def __init__(self, line):
self.top = 1
self.bottom = 6
self.south = 2
self.east = 3
self.west = 4
self.north = 5
self.convert = [int(s) for s in line.split()]
def move(self, direction):
if 'N' == direction:
self.top, self.north, self.bottom, self.south = self.south, self.top, self.north, self.bottom
elif 'S' == direction:
self.top, self.north, self.bottom, self.south = self.north, self.bottom, self.south, self.top
elif 'W' == direction:
self.top, self.east, self.bottom, self.west = self.east, self.bottom, self.west, self.top
elif 'E' == direction:
self.top, self.east, self.bottom, self.west = self.west, self.top, self.east, self.bottom
def search(self, line):
top, south = [int(s) for s in line.split()]
for direction in 'NNNNWNNNN':
self.move(direction)
if self.convert[self.south - 1] == south:
break
for direction in 'WWWW':
self.move(direction)
if self.convert[self.top - 1] == top:
break
return self.result()
def result(self):
return self.convert[self.east - 1]
dice = Dice(input())
for i in range(int(input())):
print(dice.search(input())) | 0 | null | 73,387,977,887,090 | 279 | 34 |
S = input()
print(S[:3]) | r = input()
print(r[0:3]) | 1 | 14,755,794,913,730 | null | 130 | 130 |
n, k = map(int, input().split())
A = [*map(int, input().split())]
for i in range(n-k): print('Yes' if A[i] < A[i+k] else 'No')
| import numpy as np
# 解説みた
N, K = map(int, input().split())
A = list(map(int, input().split()))
for i in range(K, N):
if A[i] / A[i - K] > 1:
print("Yes")
else:
print("No")
"""
・書き始める前に式変形等考える
・判定分を吟味する。（実際の数、今回でいうと積、で比較しない）
"""
| 1 | 7,108,556,860,290 | null | 102 | 102 |
s = input()
t = len(s)
x = []
y = 0
while 10 ** y % 2019 not in x:
x.append(10 ** y % 2019)
y += 1
z = len(x)
m = [0 for i in range(2019)]
m[0] = 1
a = 0
for i in reversed(range(0, t)):
a += x[(t-i-1) % z] * (int(s[i]) % 2019)
a = a % 2019
m[a] += 1
def triangle(n):
if n > 1:
return n * (n-1) // 2
else:
return 0
p = list(map(triangle, m))
# print(p)
print(sum(p))
| while True:
m,f,r=map(int,input().split())
if m==f==r==-1 : break
if m==-1 or f==-1 :
print('F')
elif (m+f)>=80 :
print('A')
elif 65<= (m+f) and (m+f)<80 :
print('B')
elif 50<= (m+f) and (m+f)<65 :
print('C')
elif 30<=(m+f) and (m+f)<50 :
if 50<=r :
print('C')
else:
print('D')
elif (m+f)<30 :
print('F') | 0 | null | 15,903,852,449,720 | 166 | 57 |
def main():
n = int(input())
inlis = list(map(int, input().split()))
ans = 0
for i in range(n):
for j in range(n):
if i < j:
ans += inlis[i] * inlis[j]
print(ans)
if __name__ == "__main__":
main()
| r=int(input())
size=r**2
print(size) | 0 | null | 156,523,942,563,352 | 292 | 278 |
A,B,M=[int(i) for i in input().split() ]
a = [int(i) for i in input().split() ]
b = [int(i) for i in input().split() ]
mlist = []
for i in range(M):
mlist.append( [ int(i) for i in input().split() ] )
print( min(min(a) + min(b), min( [a[i[0]-1] + b[i[1]-1] - i[2] for i in mlist ])))
| num = [int(x) for x in input().split() if x.isdigit()]
count = 0
for i in range(num[0], num[1]+1):
if num[2] % i == 0:
count += 1
print(count) | 0 | null | 27,472,399,213,220 | 200 | 44 |
import sys
x = int( sys.stdin.readline() )
h = x//3600
m = ( x%3600 )//60
s = ( x%3600 )%60
print( "{}:{}:{}".format( h, m, s) ) | import sys
i=1
while True:
x=sys.stdin.readline().strip()
if x=="0":
break;
print("Case %d: %s"%(i,x))
i+=1 | 0 | null | 398,563,564,180 | 37 | 42 |
a, b, c = map(int, input().split())
k = int(input())
cnt = 0
while a >= b:
cnt += 1
b *= 2
while b >= c:
cnt += 1
c *= 2
if cnt <= k: print("Yes")
else: print("No") | def dfs(v, cnt):
D[v] = cnt
cnt += 1
for c in edge[v]:
if D[c] == -1:
cnt = dfs(c, cnt)
F[v] = cnt
cnt += 1
return cnt
V = int(input())
edge = [[] for _ in range(V)]
for _ in range(V):
u, _, *v = map(lambda x: int(x)-1, input().split())
edge[u] = sorted(v)
D, F = [-1] * V, [-1] * V
c = 1
for i in range(V):
if D[i] == -1:
c = dfs(i, c)
for i, (d, f) in enumerate(zip(D, F)):
print(i+1, d, f) | 0 | null | 3,483,444,663,200 | 101 | 8 |
s = input()
n = int(input())
def f(s):
prev = ''
ct = 0
for i in s:
if i == prev:
ct += 1
prev = ''
else:
prev = i
return ct
if len(set(s)) == 1:
print(len(s) *n//2)
elif s[0]!=s[-1]:
print(f(s) * n)
else:
ans = f(s) + (f(s*2) - f(s)) * (n-1)
print(ans)
| import numpy as np
s=input()
k=int(input())
cnt=1
a=[]
ss=s+"."
for i in range(len(s)):
if ss[i]==ss[i+1]:
cnt+=1
else:
a.append(cnt)
cnt=1
pp=0
if s[0]==s[len(s)-1]:
pp=a[0]+a[-1]
b=[]
if len(a)>1:
b.append(pp)
b+=a[1:len(a)-1]
else:
a=[len(s)*k]
b=[]
else:
b=a
arr=np.array(a)
arr2=np.array(b)
a=arr//2
b=arr2//2
if len(s)>=2:
print(np.sum(a)+int((k-1)*np.sum(b)))
else:
print(k//2) | 1 | 175,394,938,039,830 | null | 296 | 296 |
n,k=map(int,input().split())
mod=pow(10,9)+7
ans=[0]*(k+1)
# gcdがkiとなる数列。すべてがkiの倍数でかつ少なくとも一つkiを含む
for ki in range(k,0,-1):
a=k//ki
ans[ki]=pow(a,n,mod)
i=2
while i*ki<=k:
ans[ki]-=ans[i*ki]
i+=1
b=0
for ki in range(1,k+1):
b+=(ans[ki]*ki)%mod
b%=mod
print(b)
| MOD = 10**9+7
N, K = list(map(int, input().split()))
t = {}
ans = 0
for i in range(K, 0, -1):
n = pow(K//i, N, MOD)
for j in range(2*i, K+1, i):
n -= t[j]
t[i] = n
ans = (ans + i * n) % MOD
print(ans) | 1 | 36,830,869,076,190 | null | 176 | 176 |
l = []
a,b,c = map(int,input().split())
for i in range(a,b+1):
if c % i == 0:
l.append(i)
ll = len(l)
print(str(ll))
| import sys
input = sys.stdin.readline
############ ---- Input Functions ---- ############
def inp():
return(int(input()))
def inlt():
return(list(map(int,input().split())))
def insr():
s = input()
return(list(s[:len(s) - 1]))#might need to remove the -1
def invr():
return(map(int,input().split()))
d, t, s = invr()
if d/s<=t:
print('Yes')
else:
print('No') | 0 | null | 2,051,509,539,144 | 44 | 81 |
t = input()
n = len(t)
res = ''
for i in range(n):
if t[i] == '?':
res += 'D'
else:
res += t[i]
print(res) | T = input()
count = 0
for c in T:
count += 1
if c == '?' and T[count-1] == 'D':
c = 'P'
print(c, end="")
elif c == '?':
c = 'D'
print(c, end="")
else:
print(c, end="") | 1 | 18,400,553,606,336 | null | 140 | 140 |
# import sys
# import math
# import itertools
# from collections import deque
# from collections import defaultdict
# import heapq
# import copy
# import bisect
# import numpy as np
# from scipy.special import comb
# def my_input(): return sys.stdin.readline().rstrip()
# sys.setrecursionlimit(100000)
# INF = 1001001001001
# MOD = 1000000007
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())
def main():
N, M, K = map(int, input().split())
uf = UnionFind(N)
friends = [set() for _ in range(N)]
for _ in range(M):
a, b = map(int, input().split())
a, b = a - 1, b - 1
uf.union(a, b)
friends[a] |= set([b])
friends[b] |= set([a])
blocks = [set() for _ in range(N)]
for _ in range(K):
c, d = map(int, input().split())
c, d = c - 1, d - 1
if uf.same(c, d):
blocks[c] |= set([d])
blocks[d] |= set([c])
# print(uf)
# print(friends)
# print(blocks)
for i in range(N - 1):
ans = uf.size(i) - 1 - len(friends[i]) - len(blocks[i])
print(str(ans) + " ", end="")
ans = uf.size(N - 1) - 1 - len(friends[N - 1]) - len(blocks[N - 1])
print(ans)
if __name__ == '__main__':
main()
| import sys
def input(): return sys.stdin.readline().rstrip()
class UnionFind():
def __init__(self, n):
self.n=n
self.parents=[-1]*n # 親(uf.find()で経路圧縮して根)の番号。根の場合は-(そのグループの要素数)
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 unite(self,x,y):
#要素x,yのグループを併合
x,y=self.find(x),self.find(y)
if x==y:return
if self.parents[x]>self.parents[y]:#要素数の大きい方をxに
x,y=y,x
self.parents[x]+=self.parents[y]
self.parents[y]=x #要素数が大きい方に併合
def size(self,x):
#xが属するグループの要素数
return -self.parents[self.find(x)]
def same(self,x,y):
#xとyが同じグループ？
return self.find(x)==self.find(y)
def members(self,x):
#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 all_group_members_list(self):
#各ルート要素のグループに含まれる要素のリストのリスト
#[[0, 2], [1, 3, 4, 5]]
return list(self.all_group_members().values())
def __str__(self):
#各ルート要素のグループに含まれる要素のリストをprint()
return '\n'.join('{}: {}'.format(r,self.members(r)) for r in self.roots())
def main():
n,m,k=map(int,input().split())
AB=[tuple(map(int,input().split())) for i in range(m)]
CD=[tuple(map(int,input().split())) for i in range(k)]
un=UnionFind(n)
friend=[[] for _ in range(n)]
for a,b in AB:
un.unite(a-1,b-1)
friend[a-1].append(b-1)
friend[b-1].append(a-1)
blockc=[0]*n
for c,d in CD:
if un.same(c-1,d-1):
blockc[c-1]+=1
blockc[d-1]+=1
for i in range(n):
print(un.size(i)-1-blockc[i]-len(friend[i]))
if __name__=='__main__':
main() | 1 | 61,788,247,756,768 | null | 209 | 209 |
def GCD(a,b):
while (a % b) != 0:
a,b = b, a%b
return b
def LCM(a,b):
return a * b / GCD(a,b)
while True:
try:
a,b =map(int,raw_input().split())
print GCD(a,b),LCM(a,b)
except:
break | n=int(input())
for i in range(n+1):
if int(i*1.08)==n:
print(i)
exit()
print(':(') | 0 | null | 63,163,982,727,968 | 5 | 265 |
S,W=map(int,input().split())
if S>W:
print("safe")
elif S<W:
print("unsafe")
elif S==W:
print("unsafe") | n,m,l = map(int,input().split())
a = [list(map(int,input().split(" "))) for i in range(n)]
b = [list(map(int,input().split(" "))) for j in range(m)]
for i in range(n):
for j in range(l):
c = 0
for k in range(m):
c += a[i][k]*b[k][j]
print(c,end="")
if j != l-1:
print("",end=" ")
print() | 0 | null | 15,340,955,879,810 | 163 | 60 |
#ALDS1_3-A Elementary data structures - Stack
A=input().split()
while(len(A)>1):
for i in range(len(A)):
if(A[i]=="+"):
A[i]=int(A[i-2])+int(A[i-1])
A=A[:i-2]+A[i:]
break
elif(A[i]=="-"):
A[i]=int(A[i-2])-int(A[i-1])
A=A[:i-2]+A[i:]
break
elif(A[i]=="*"):
A[i]=int(A[i-2])*int(A[i-1])
A=A[:i-2]+A[i:]
break
print(A[0]) | x,y,xx,yy=map(float, input().split())
print('%5f'%((x-xx)**2+(y-yy)**2)**0.5) | 0 | null | 100,019,324,918 | 18 | 29 |
#!/usr/bin/env python3
# encoding:utf-8
import copy
import random
import bisect #bisect_left これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
import math
import sys
import collections
mod = 10**9+7
sys.setrecursionlimit(mod) # 再帰回数上限はでdefault1000
d = collections.deque()
def LI(): return list(map(int, sys.stdin.readline().split()))
A, B = LI()
print(A * B) | A, B = [int(_) for _ in input().split()]
print(A * B)
| 1 | 15,769,581,662,790 | null | 133 | 133 |
import sys
input = sys.stdin.readline
N=int(input())
list=[0 for i in range(N)]
for i in range(N):
x,l=map(int,input().split())
list[i]=[x-l,x+l]
list.sort(key=lambda x: x[1])
ans=0
haji=-(10**10)
for i in range(N):
if list[i][0]>=haji:
ans+=1
haji=list[i][1]
print(ans)
| n,k = map(int,input().split())
count = 0
p = map(int,input().split())
P = sorted(p)
for k in range(k):
count = count + int(P[k])
print(count)
| 0 | null | 51,020,799,737,584 | 237 | 120 |
N = int(input())
S = input()
ret = ''
for s in S:
o = ord(s) - ord('A') + N
ret += chr(ord('A') + o % 26)
print(ret) | A, B = map(int, input().split())
print(A * B) if len(str(A)) == 1 and len(str(B)) == 1 else print(-1) | 0 | null | 146,453,427,402,998 | 271 | 286 |
import math
I = lambda: list(map(int, input().split()))
n, d, a = I()
l = []
for _ in range(n):
x, y = I()
l.append([x,y])
l.sort()
j = 0
limit = []
for i in range(n):
while l[j][0] - l[i][0] <= 2*d:
j+=1
if j == n: break
j-=1
limit.append(j)
ans = 0
num=[0]*(n+1)
cnt=0
for i in range(n):
l[i][1]-=(ans-cnt)*a
damage_cnt=max(0,(l[i][1]-1)//a + 1)
ans+=damage_cnt
num[limit[i]]+=damage_cnt
cnt+=num[i]
print(ans) | import sys
from collections import deque
sys.setrecursionlimit(10 ** 6)
INF = float("inf")
MOD = 10 ** 9 + 7
def input():
return sys.stdin.readline().strip()
def main():
N, D, A = map(int, input().split())
monster = {}
X = []
for _ in range(N):
x, h = map(int, input().split())
monster[x] = h
X.append(x)
X.sort()
# x, damage
q = deque([])
acc_damage = 0
ans = 0
for i in range(N):
x = X[i]
h = monster[x]
while q and q[0][0] < x:
p, damage = q.popleft()
acc_damage -= damage
if h - acc_damage <= 0:
continue
cnt = (h - acc_damage + A - 1) // A
ans += cnt
acc_damage += cnt * A
q.append((x + 2 * D, cnt * A))
print(ans)
if __name__ == "__main__":
main()
| 1 | 82,434,904,003,300 | null | 230 | 230 |
n, m = map(int, raw_input().split())
A = {}
for i in range(n):
temp = map(int, raw_input().split())
for j in range(m):
A[(i,j)] = temp[j]
b = {}
for j in range(m):
b[(j)] = input()
c = {}
for i in range(n):
c[(i)] = 0
for j in range(m):
c[(i)] += A[(i,j)] * b[(j)]
for i in range(n):
print c[(i)] | a=list(map(int,input().split()))
print(*[a[2],a[0],a[1]],sep=' ') | 0 | null | 19,617,133,171,902 | 56 | 178 |
#coding:utf-8
import sys,os
sys.setrecursionlimit(10**6)
write = sys.stdout.write
dbg = (lambda *something: print(*something)) if 'TERM_PROGRAM' in os.environ else lambda *x: 0
from math import gcd
def main(given=sys.stdin.readline):
input = lambda: given().rstrip()
LMIIS = lambda: list(map(int,input().split()))
II = lambda: int(input())
XLMIIS = lambda x: [LMIIS() for _ in range(x)]
YN = lambda c : print('Yes') if c else print('No')
MOD = 10**9+7
A,B = LMIIS()
print(A*B//gcd(A,B))
if __name__ == '__main__':
main() | # 1
# a,b=map(int,input().split())
# if a+b==15:
# ans='+'
# elif a*b==15:
# ans='*'
# else:
# ans='x'
# print(ans)
# 2
X=int(input())
print(8-(X-400)//200) | 0 | null | 59,922,943,885,152 | 256 | 100 |
W = list(input())
ans = []
a = 0
for i in W:
if i == 'R':
a += 1
else:
ans.append(a)
a = 0
ans.append(a)
print(max(ans))
| S=input()
ans=0
if 'R' in S:
ans+=1
if S[0]=='R' and S[1]=='R':
ans+=1
if S[1]=='R' and S[2]=='R':
ans+=1
print(ans)
| 1 | 4,849,492,090,928 | null | 90 | 90 |
def insertionSort(R, n):
for i in range(1, n):
Now = R[i]
j = i - 1
while j >= 0 and R[j] > Now:
R[j + 1] = R[j]
j = j - 1
R[j + 1] = Now
trace(R, n)
def trace(R, n):
for i in range(n):
print R[i],
print
n = input()
R = map(int, raw_input().split())
trace(R, n)
insertionSort(R, n) | import sys
from collections import deque
input = sys.stdin.readline
n, m, k = list(map(int, input().split()))
ab = [list(map(int, input().split())) for _ in range(m)]
cd = [list(map(int, input().split())) for _ in range(k)]
ff = [[] for _ in range(n+1)]
for a, b in ab:
ff[a].append(b)
ff[b].append(a)
visited = [False] * (n+1)
visited[0] = True
com = [-1] * (n+1)
def dfs(v, ff, visited, com, g):
q = deque([v])
visited[v] = True
com[v] = g
k = 1
while len(q) > 0:
w = q.pop()
for x in ff[w]:
if not visited[x]:
q.append(x)
visited[x] = True
com[x] = g
k += 1
return k
g = 0
group_num = []
for i in range(1, n+1):
if visited[i]:
pass
else:
k = dfs(i, ff, visited, com, g)
group_num.append(k)
g += 1
#print(com)
friends = [0] * (n+1)
for i in range(1, n+1):
friends[i] += group_num[com[i]] - 1
for a, b in ab:
if com[a] == com[b]:
friends[a] -= 1
friends[b] -= 1
for c, d in cd:
if com[c] == com[d]:
friends[c] -= 1
friends[d] -= 1
print(" ".join(map(str, friends[1:]))) | 0 | null | 30,726,457,363,190 | 10 | 209 |
import bisect
n = int(input())
L = list(map(int,input().split()))
L.sort()
ans = 0
for a in range(0,n):
for b in range(a+1,n):
p = bisect.bisect_left(L, L[a]+L[b])
ans += max(p-(b+1),0)
print(ans) | while 1:
x, y = [int(i) for i in input().split()]
if x < y:
print((x), (y))
elif y < x:
print((y), (x))
elif x == 0 and y == 0:
break
else:
print((x),(y)) | 0 | null | 86,420,855,683,734 | 294 | 43 |
import sys
def gcd(m, n):
if n > m:
m, n = n, m
if n == 0:
return m
else:
return gcd(n, m % n)
for line in sys.stdin:
try:
a, b = [int(i) for i in line.split()]
g = gcd(a, b)
l = a * b / g
print("%d %d" % (g, l))
except:
break | def pd(n):
i = 2
ans = []
while i ** 2 <= n:
while n % i == 0:
n /= i
ans.append(i)
i += 1
if n > 1:
ans.append(n)
return ans
def gcd(a, b):
gcd = 1
pd_a = pd(a)
pd_b = pd(b)
for i in pd_a:
if i in pd_b:
pd_b.remove(i)
gcd *= i
return int(gcd)
def lcm(a, b):
lcm = a
pd_a = pd(a)
pd_b = pd(b)
for i in pd_a:
if i in pd_b:
pd_b.remove(i)
for j in pd_b:
lcm *= j
return int(lcm)
while True:
try:
s = input()
a,b = [int(i) for i in s.split(' ')]
except:
break
print(gcd(a, b), lcm(a, b))
| 1 | 778,893,940 | null | 5 | 5 |
N, M = map(int, input().split())
A = list(map(int, input().split()))
days = N - sum(A)
print(days) if days >= 0 else print('-1') | x = int(input())
for i in range(1000):
for j in range(i):
if i ** 5 - j ** 5 == x:
print(i, j)
exit()
if i ** 5 + j ** 5 == x:
print(i, -j)
exit()
| 0 | null | 28,826,560,368,738 | 168 | 156 |
s=input()
cnt=s.count("hi")
if cnt*2==len(s):
print("Yes")
else:
print("No") | N = int(input())
num_even = N//2
num_odd = N - num_even
print(num_odd/N) | 0 | null | 115,228,053,959,050 | 199 | 297 |
import sys
import math
def gcd(x, y):
if y == 0:
return x
return gcd(y, x%y)
x, y = map(int, raw_input().split())
print gcd(min(x, y), max(x, y)) | N = int(input())
n = str(N)
a = list(n)
count = 0
for i in range(len(a)):
count = count + int(a[i])
if count % 9 == 0:
print("Yes")
else:
print("No") | 0 | null | 2,233,906,963,210 | 11 | 87 |
x = int(input())
if x <= 599:
print(8,"\n")
elif x <= 799:
print(7,"\n")
elif x <= 999:
print(6,"\n")
elif x <= 1199:
print(5,"\n")
elif x <= 1399:
print(4,"\n")
elif x <= 1599:
print(3,"\n")
elif x <= 1799:
print(2,"\n")
elif x <= 1999:
print(1,"\n") | N=int(input())
L=list(map(int,input().split()))
M=[0 for i in range(N+1)]
M[0]=1
if N==0:
if L[0]==1:
print(1)
exit()
else:
print(-1)
exit()
if L[0]==1:
print(-1)
exit()
for i in range(1,N+1):
M[i]=M[i-1]*2-L[i]
if M[i]<0:
print(-1)
exit()
#print(L)
#print(M)
M[-1]=0
for i in range(1,N+1):
if M[-1-i]<(M[-i]+L[-i]+1)//2:
print(-1)
exit()
elif (M[-i]+L[-i])>=M[-1-i] and M[-1-i]>=(M[-i]+L[-i]+1)//2:
continue
else:
M[-1-i]=(M[-i]+L[-i])
#print(L)
#print(M)
print(sum(L)+sum(M)) | 0 | null | 12,677,225,630,848 | 100 | 141 |
import sys
input = sys.stdin.readline
(n, k), (r, s, p), t = map(int, input().split()), map(int, input().split()), input()[:-1]
d, res = {'r': p, 's': r, 'p': s}, 0
for i in range(k):
b = False
for j in range(i, n, k):
if i == j: res += d[t[j]]; b = False; continue
if (t[j] != t[j-k]) | b: res += d[t[j]]; b = False
else: b = True
print(res) | S = input()
A = S.count("R")
B = S.count("RR")
if A==2:
if B==1:
print(2)
if B==0:
print(1)
elif A==1:
print(1)
elif A==3:
print(3)
else :
print(0) | 0 | null | 56,027,479,050,470 | 251 | 90 |
H,N = map(int,input().split())
A = list(map(int,input().split()))
def battle(a,n):
ans = 0
for i in range(n):
ans += a[i]
return ans
if H <= battle(A,N):
print("Yes")
else:
print("No") | a,b = map(int, input().split())
S = 0
for i in range(max(a,b)):
S +=min(a,b)*(10**i)
print(S) | 0 | null | 81,068,625,779,710 | 226 | 232 |
from collections import defaultdict
S = input()
kTarget = 2019
mod2cnt = defaultdict(int)
mod2cnt[0] += 1
ord_z = ord('0')
res = 0
for i in range(len(S)-1, -1, -1):
d = ord(S[i]) - ord_z
res = (res+d*pow(10, len(S)-1-i, kTarget))%kTarget
mod2cnt[res] += 1
ans = 0
for cnt in mod2cnt.values():
ans += cnt*(cnt-1)
print(ans//2) | s = (input()[::-1]) # 入力文字列を逆順でsに格納
n = len(s)
counts = [0]*2019
counts[0]=1
b = 1
num = 0
for i in s:
num += int(i)*b
num %=2019
b *=10
b %=2019
counts[num]+=1
# print(counts)
ans = 0
for j in counts:
ans +=j*(j-1)/2
print(int(ans)) | 1 | 30,767,085,046,088 | null | 166 | 166 |
l, r, d = map(int, input().split())
c = 0
x = (l // d) + 1
if(l % d == 0):
c = 1
while(True):
m = d * x
x += 1
if(m <= r):
c += 1
else: break
print(c) |
n = int(input())
number = list(map(int,input().split()))
count = 0
for i in range(1,n + 1):
for j in range(1,i):
if number[i - j] < number[i - j - 1]:
number[i - j],number[i - j - 1] = number[i - j - 1],number[i - j]
count += 1
number = list(map(str,number))
print(" ".join(number))
print(count) | 0 | null | 3,801,929,933,120 | 104 | 14 |
# https://atcoder.jp/contests/abc168/tasks/abc168_a
N = int(input())
last_num = int(str(N)[-1])
if last_num in {2, 4, 5, 7, 9}:
print('hon')
elif last_num in {0, 1, 6, 8}:
print('pon')
else:
print('bon') | n = str(input())
if n[len(n)-1] in '24579':
print('hon')
elif n[len(n)-1] in '0168':
print('pon')
else:
print('bon') | 1 | 19,164,371,296,320 | null | 142 | 142 |
#9_C
class player:
def __init__(self):
self.my_cards=[]
self.point=0
def draw(self,letter):
self.my_cards.append(letter)
def open(self,num):
return self.my_cards[num]
def buttle(self,letter,num):
if(self.my_cards[num]>letter):
self.point+=3
elif(self.my_cards[num]==letter):
self.point+=1
def show(self):
return self.point
def check(self):
return self.my_cards
##main##
n=int(input())
taro=player()
hanako=player()
for i in range(n):
val=input().split()
taro.draw(val[0])
hanako.draw(val[1])
for i in range(n):
taro.buttle(hanako.open(i),i)
hanako.buttle(taro.open(i),i)
print(taro.show(),hanako.show())
| taro_score = 0
hanako_socore = 0
game_times = int(input())
for _ in range(game_times):
cards = input().split()
if cards[0] > cards[1]:
taro_score += 3
elif cards[0] == cards[1]:
taro_score += 1
hanako_socore += 1
else:
hanako_socore += 3
print(taro_score, hanako_socore)
| 1 | 2,039,863,465,024 | null | 67 | 67 |
import sys
import bisect
input = sys.stdin.readline
n, d, a = map(int, input().split())
xh = sorted([tuple(map(int, input().split()))for _ in range(n)])
x_list = [x for x, h in xh]
damage = [0]*(n+1)
ans = 0
for i in range(n):
x, h = xh[i]
h -= damage[i]
if h <= 0:
damage[i+1] += damage[i]
continue
cnt = -(-h//a)
ans += cnt
damage[i] += cnt*a
end_idx = bisect.bisect_right(x_list, x+2*d)
damage[end_idx] -= cnt*a
damage[i+1] += damage[i]
print(ans) | n,k = map(int, input().split())
num = []
for i in range(k):
d = int(input())
num += list(map(int, input().split()))
Q = list(set(num))
print(n-len(Q)) | 0 | null | 53,070,889,391,842 | 230 | 154 |
N = int(input())
K, X = input().split()
print(*[K[i] + X[i] for i in range(N)], sep="")
| n = int(input())
s,t = list(map(str,input().split()))
string = []
for i in range(len(s)):
string.append(s[i])
string.append(t[i])
print(''.join(string)) | 1 | 112,280,223,954,978 | null | 255 | 255 |
join,rate=map(int,input().split())
if join>=10:
print(rate)
else:
print(rate+100*(10-join)) | def funcs(a, b, c):
x = int(a)
y = int(b)
z = int(c)
if x < y < z:
print("Yes")
else:
print("No")
tmp = input()
a, b, c = tmp.split(" ")
funcs(a, b, c)
| 0 | null | 31,706,005,394,850 | 211 | 39 |
def resolve():
S, T = input().split()
A, B = list(map(int, input().split()))
U = input()
if S == U:
A -= 1
else:
B -= 1
print(A, B)
if '__main__' == __name__:
resolve() | n, k = map(int, input().split())
l = list(map(int, input().split()))
cnt = 0;
for i in l:
if i >= k:
cnt += 1;
print(cnt) | 0 | null | 125,648,351,870,900 | 220 | 298 |
N = int(input())
S = [input() for i in range(N)]
ac = 0
wa = 0
tle = 0
re = 0
for s in S:
if s == 'AC': ac += 1
elif s == 'WA': wa += 1
elif s == 'TLE': tle += 1
elif s == 'RE': re += 1
print('AC x ' + str(ac))
print('WA x ' + str(wa))
print('TLE x ' + str(tle))
print('RE x ' + str(re)) | n=int(input())
l = [input() for i in range(n)]
ac = 0
wa = 0
tle = 0
re = 0
for i in l:
if i == 'AC':
ac += 1
if i == 'WA':
wa += 1
if i == 'TLE':
tle += 1
if i == 'RE':
re += 1
print('AC x '+str(ac))
print('WA x '+str(wa))
print('TLE x '+str(tle))
print('RE x '+str(re)) | 1 | 8,688,063,854,692 | null | 109 | 109 |
N=int(input())
import math
print(360//math.gcd(360,N))
| a,b,c=raw_input().split()
if a<b<c:
print 'Yes'
else :
print 'No' | 0 | null | 6,736,153,717,820 | 125 | 39 |
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def main():
mod=10**9+7
from collections import defaultdict
dd = defaultdict(int)
N=I()
M=0
for i in range(N):
s=input()
dd[s]+=1
M=max(M,dd[s])
ans=[]
for k,v in dd.items():
if v==M:
ans.append(k)
ans.sort()
for k in ans:
print(k)
main()
| #from collections import deque,defaultdict
printn = lambda x: print(x,end='')
inn = lambda : int(input())
inl = lambda: list(map(int, input().split()))
inm = lambda: map(int, input().split())
ins = lambda : input().strip()
DBG = True # and False
BIG = 10**18
R = 10**9 + 7
#R = 998244353
def ddprint(x):
if DBG:
print(x)
a,b,c = inm()
k = inn()
x = 0
while b<=a:
b *= 2
x += 1
while c<=b:
c *= 2
x += 1
print('Yes' if x<=k else 'No')
| 0 | null | 38,479,989,644,668 | 218 | 101 |
N, M = map(int, input().split())
if M%2 != 0:
center = M + 1
else:
center = M
c = center//2
d = (center + 1 + 2*M + 1) // 2
i = 0
while i < c:
print(c-i, c+1+i)
i += 1
j = 0
while i < M:
print(d-(j+1), d+(j+1))
i += 1
j += 1 | n,m=map(int,input().split())
oddflag=True
for i in range(1,m+1):
mid=(1+n)//2
if oddflag:
oddflag = False
print(i//2 + 1 , n - i//2)
else:
oddflag = True
print(mid + i//2, mid - i//2)
| 1 | 28,760,149,088,980 | null | 162 | 162 |
n,k=map(int,input().split())
k=min(k,n-1)
mod=10000*100000+7
def mpow(a,b,m=100000*10000+7):#returns a**b%m
ret=1
while b>0:
if b&1:
ret=(ret*a)%m
a=(a*a)%m
b>>=1
return ret
fact=[1]*(n+1)
ifact=[1]*(n+1)
for i in range(2,n+1):
fact[i]=(fact[i-1] *i)%mod
ifact[n]=mpow(fact[n],mod-2)
for i in range(n-1,1,-1):
ifact[i]=((i+1)*ifact[i+1])%mod
def nCr(n,r):
if r==0 or r==n:
return 1
val=(fact[n]*ifact[r])%mod
return (val*ifact[n-r])%mod
ans=0
for h in range(k+1):
ans=(ans+(nCr(n,h)*nCr(n-1,n-h-1))%mod)%mod
print(ans)
| n, k = map(int, input().split())
def modinv(a, mod=10**9+7):
return pow(a, mod-2, mod)
def combination(n, r, mod=10**9+7):
r = min(r, n-r)
res = 1
for i in range(r):
res = res * (n - i) * modinv(i+1, mod) % mod
return res
def com(n, r, mod):
r = min(r, n - r)
if r == 0:
return 1
res = ilist[n] * iinvlist[n-r] * iinvlist[r] % mod
return res
mod = 10**9+7
ilist = [0]
iinvlist = [1]
tmp = 1
for i in range(1, n+1):
tmp *= i
tmp %= mod
ilist.append(tmp)
iinvlist.append(modinv(tmp, mod))
ans = 0
k = min(n-1, k)
for i in range(k+1):
tmp = com(n, i, mod)
tmp *= com(n-1, i, mod)
ans += tmp
ans %= mod
print(ans) | 1 | 67,399,832,640,112 | null | 215 | 215 |
x = int(input())
print('Yes') if x >= 30 else print('No')
| n = int(input())
if 30 <= n:
print("Yes")
else:
print("No") | 1 | 5,719,324,228,192 | null | 95 | 95 |
"""
方針：
幸福度が一定以上のつなぎ方の数→NlogNで二分探索可能
採用するうち最小の幸福度を NlogNlogNで探索
累積和を用いて合計を算出
2 3
5 2
10 + 7 + 7 = 24
"""
import bisect
def wantover(n): #n以上の幸福度のつなぎ方の数がM以上ならTrueを返す
ret = 0
for i in range(N):
serchnum = n - A[i]
ret += (N - bisect.bisect_left(A,serchnum))
#print ("over",n,"is",ret)
if ret >= M:
return True
else:
return False
N,M = map(int,input().split())
A = list(map(int,input().split()))
A.sort()
#print (wantover(7))
hpl = 0
hpr = A[-1] * 2 + 1
while hpr - hpl != 1:
mid = (hpr + hpl) // 2
if wantover(mid):
hpl = mid
else:
hpr = mid
#ここで最小の幸福度はhpl
#print (hpl,hpr)
B = [0] #累積和行列
for i in range(N):
B.append(B[-1] + A[-1 - i])
#print (A)
#print (B)
ans = 0
plnum = 0 #つないだ手の回数
for i in range(N):
i = N-i-1
ind = bisect.bisect_left(A,hpl - A[i])
#print (hpl,A[i],N-ind)
plnum += N - ind
ans += B[N - ind] + A[i] * (N-ind)
#print (ans,plnum)
print (ans - hpl * (plnum - M))
| import numpy as np
n,m = [int(i) for i in input().split()]
a = [int(i) for i in input().split()]
d = 2**18
f = np.array([0]*d)
for i in a:
f[i]+=1
tf = np.fft.fft(f)
f = np.fft.ifft(tf*tf)
f = [int(i+0.5) for i in f]
ans=0
for i in range(len(f)-1,0,-1):
if f[i]<=m:
ans+=i*f[i]
m-=f[i]
elif f[i]>m:
ans+=i*m
break
print(ans) | 1 | 107,875,086,994,390 | null | 252 | 252 |
def main():
N = int(input())
shougen = []
for _ in range(N):
A = int(input())
shougen.append([list(map(int, input().split())) for _ in range(A)])
ans = 0
for i in range(2**N):
state = [1]*N
for j in range(N):
if (i >> j) & 1:
state[j] = 0
flag = True
for k in range(N):
if not flag:
break
if state[k] == 1:
for ele in shougen[k]:
if state[ele[0]-1] != ele[1]:
flag = False
break
if flag:
ans = max(ans, sum(state))
print(ans)
if __name__ == '__main__':
main() | N = int(input())
testimony = [[-1]*N for i in range(N)]
count = 0
for i in range(N):
A = int(input())
for j in range(A):
x,y = map(int,input().split())
testimony[i][x-1]=y
for i in range(2**N):
honest = [0]*N
for j in range(N):
if(i>>j)&1:
honest[j]=1
flag=True
for j in range(N):
if honest[j]==1:
for k in range(N):
if testimony[j][k]==-1:
continue
if testimony[j][k]!=honest[k]:
flag=False
if flag==True:
count=max(count,honest.count(1))
print(count) | 1 | 121,907,328,532,990 | null | 262 | 262 |
a,b = list(map(int, input().split()))
if a > b:
sep = '>'
elif a < b:
sep = '<'
else:
sep = '=='
print('a', sep, 'b') | N = int(input())
A = list(map(int, input().split()))
MAX = max(A)
# remap
AR = [0] * (MAX+1)
V = [False] * (MAX+1)
for i in range(N): AR[A[i]] += 1
pairwise, setwise = True, True
# sieve
for i in range(2, MAX+1):
if V[i]: continue
cnt, j = 0, i
while j < MAX+1:
cnt += AR[j]
V[j] = True
j += i
if cnt > 1: pairwise = False
if cnt == len(A): setwise = False
if pairwise:
print('pairwise coprime')
elif setwise:
print('setwise coprime')
else:
print('not coprime') | 0 | null | 2,240,976,892,672 | 38 | 85 |
while 1:
h, w = map(int, input().split())
if h == w == 0: break
for y in range(h):
for x in range(w):
print("#", end="")
print("")
print("") | while(True):
H, W = map(int, input().split())
if(H == W == 0):
break
first = False
for i in range(H):
print("#" * W)
print() | 1 | 768,322,905,350 | null | 49 | 49 |
import math
r = float(raw_input())
print "%.5f %.5f" %(r**2*math.pi, 2*r*math.pi) | A,B,C,K = map(int,input().split())
if A>=K: print(K)
else:
K-=A
if B>=K: print(A)
else:
K-=B
print(A-K) | 0 | null | 11,220,410,056,800 | 46 | 148 |
n=int(input())
x=[]
y=[]
for i in range(n):
a,b=map(int,input().split())
x.append(a)
y.append(b)
p=1
for i in range(n):
p*=i+1
def D(a,b):
a=a-1
b=b-1
return ((x[a]-x[b])**2+(y[a]-y[b])**2)**(0.5)
def f(x):
ans=0
while x>0:
ans+=x%2
x=x//2
return ans
def r(x):
ans=1
for i in range(x):
ans*=(i+1)
return ans
dp=[[0]*(n+1) for _ in range(2**n)]
for i in range(1,2**n):
for j in range(1,n+1):
for k in range(1,n+1):
if (i>>(j-1))&1 and not (i>>(k-1)&1):
dp[i+2**(k-1)][k]+=dp[i][j]+r((f(i)-1))*D(j,k)
print(sum(dp[2**n-1])/p)
| import math
N = int(input())
town = []
for i in range(N):
x, y = map(int, input().split())
town.append((x, y))
def dfs(current, dist, already):
if len(already) == N:
return dist
d = 0
for i in range(N):
if i in already:
continue
d += dfs(i, dist + math.sqrt((town[current][0] - town[i][0]) ** 2 + (town[current][1] - town[i][1]) ** 2), already | set([i]))
return d
answer = 0
for i in range(N):
answer += dfs(i, 0, set([i]))
print(answer / math.factorial(N)) | 1 | 148,552,201,147,402 | null | 280 | 280 |
t = input()
for _ in range(int(input())):
order = input().split()
cmd = order[0]
a, b = map(int, order[1:3])
if cmd == 'print':
print(t[a:b+1])
elif cmd == 'reverse':
t = t[:a] + t[a:b+1][b::-1] + t[b+1:]
else:
c = order[3]
t = t[:a] + c + t[b+1:] | while True:
a,op,b=input().split()
a,b=int(a),int(b)
if op=="+":
print(a+b)
elif op=="-":
print(a-b)
elif op=="*":
print(a*b)
elif op=="/":
print(a//b)
else:
break
| 0 | null | 1,411,827,872,228 | 68 | 47 |
h=int(input())
num=1
cnt=0
while h!=1:
h=h//2
cnt+=num
num*=2
cnt+=num
print(cnt) | import sys
from collections import defaultdict, Counter
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
N, *A = map(int, read().split())
N_MAX = 10 ** 6
min_factor = list(range(1, N_MAX + 1, 2))
for i in range(1, int((N_MAX ** 0.5 - 1) / 2) + 1):
f = 2 * i + 1
if min_factor[i] != f:
continue
for j in range(2 * i * (i + 1), len(min_factor), f):
if min_factor[j] > f:
min_factor[j] = f
def prime_factorize_fast(n):
a = Counter()
while not n & 1:
a[2] += 1
n //= 2
while n != 1:
a[min_factor[(n - 1) // 2]] += 1
n //= min_factor[(n - 1) // 2]
return a
lcm_prime = Counter()
for a in A:
for p, n in prime_factorize_fast(a).items():
if lcm_prime[p] < n:
lcm_prime[p] = n
l = 1
for p, n in lcm_prime.items():
l = l * pow(p, n, MOD) % MOD
ans = 0
for a in A:
ans = (ans + pow(a, MOD - 2, MOD)) % MOD
ans = ans * l % MOD
print(ans)
return
if __name__ == '__main__':
main()
| 0 | null | 83,875,738,999,762 | 228 | 235 |
def examE():
N, K = LI()
A = LI()
sumA = [0]*(N+1)
for i in range(1,N+1):
sumA[i] = sumA[i-1]+A[i-1]
d = defaultdict(int)
ans = 0
#連想配列 先頭からの番号 余分な量
que = deque()
for i,a in enumerate(sumA):
#K番目以降は一番左のやつ消していく
if que and que[0][0] <= (i-K):
d[que.popleft()[1]] -= 1
cur = (a-i)%K
ans +=d[cur]
d[cur] +=1
que.append((i,cur))
# print(ans,que,d,a-i)
print(ans)
return
def examF():
return
import sys,copy,bisect,itertools,math
from heapq import heappop,heappush,heapify
from collections import Counter,defaultdict,deque
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def SI(): return sys.stdin.readline().strip()
mod = 10**9 + 7
inf = float('inf')
examE()
| from itertools import accumulate
from collections import defaultdict
n, k = map(int, input().split())
a = list(map(int, input().split()))
acc = [0] + list(accumulate(a))
sm = [(e - i) % k for i, e in enumerate(acc)]
d = defaultdict(int)
ans = 0
for r in range(1, n + 1):
if r - k >= 0:
e = sm[r - k]
d[e] -= 1
e = sm[r - 1]
d[e] += 1
e = sm[r]
ans += d[e]
print(ans)
| 1 | 137,670,927,849,948 | null | 273 | 273 |
n = sum(map(int, list(input())))
if n%9==0:
print('Yes')
else:
print('No') | from collections import deque
if __name__ == '__main__':
n = int(input())
dll = deque()
for _ in range(n):
command = input().split()
if command[0] == 'insert':
dll.appendleft(command[1])
elif command[0] == 'delete':
try:
dll.remove(command[1])
except ValueError:
pass
elif command[0] == 'deleteFirst':
dll.popleft()
elif command[0] == 'deleteLast':
dll.pop()
print(*dll)
| 0 | null | 2,242,516,545,348 | 87 | 20 |
Subsets and Splits
No saved queries yet
Save your SQL queries to embed, download, and access them later. Queries will appear here once saved.