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
|
|---|---|---|---|---|---|---|
#!/usr/bin/env python3
import sys
MOD = 1000000007 # type: int
def solve(N: int, K: int):
num_gcd = {}
for k in range(K, 0, -1):
num_select = K // k
num_gcd_k = pow(num_select, N, MOD)
for multiple in range(2, num_select+1):
num_gcd_k -= num_gcd[k * multiple]
num_gcd[k] = num_gcd_k
result = 0
for k in range(1, K+1):
result += (k * num_gcd[k]) % MOD
print(result % MOD)
return
# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools (tips: You use the default template now. You can remove this line by using your custom template)
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
N = int(next(tokens)) # type: int
K = int(next(tokens)) # type: int
solve(N, K)
if __name__ == '__main__':
main()
|
def main():
N, K = map(int, input().split())
mod = 10**9 + 7
r = 0
D = [0] * (K + 1)
for i in reversed(range(1, K + 1)):
D[i] = pow(K // i, N, mod) - sum(D[::i])
return sum(i * j for i, j in enumerate(D)) % mod
print(main())
| 1 | 36,674,276,646,240 | null | 176 | 176 |
import sys
ris=lambda:map(int,next(sys.stdin).split())
N,M,K=ris()
adj=[set() for _ in range(N)]
for _ in range(M):
A,B=ris()
A,B=A-1,B-1
adj[A].add(B)
adj[B].add(A)
colors=[-1]*N
ct={}
color=-1
for u in range(N):
if colors[u]!=-1:
continue
color+=1
colors[u]=color
stk=[u]
while stk:
u=stk.pop()
ct[color]=ct.get(color,0)+1
for v in adj[u]:
if colors[v]==-1:
colors[v]=color
stk.append(v)
blk=[{*()} for _ in range(N)]
for _ in range(K):
A,B=ris()
A,B=A-1,B-1
if colors[A]==colors[B]:
blk[A].add(B)
blk[B].add(A)
ans=[0]*N
for u in range(N):
c=colors[u]
g=len(adj[u])
b=len(blk[u])
k=ct[c]-1-g-b
ans[u]=k
print(*ans)
|
from collections import deque
n, m, k = map(int,input().split())
friend_sum = [[] for i in range(n)]
block = []
block_sum = [[] for i in range(n)]
for i in range(m):
a, b = map(int,input().split())
if a > b:
a, b = b, a
friend_sum[a-1].append(b-1)
friend_sum[b-1].append(a-1)
for i in range(k):
a, b = map(int,input().split())
block.append([a, b])
block_sum[a-1].append(b-1)
block_sum[b-1].append(a-1)
label = 0
g_label = [0 for i in range(n)]
g_list = [0 for i in range(n)]
for i in range(n):
if g_label[i] == 0:
label += 1
g_label[i] = label
g_list[label-1] += 1
q = deque([])
q.append(i)
while len(q) != 0:
num = q.popleft()
for j in range(len(friend_sum[num])):
if g_label[friend_sum[num][j]] == 0:
g_label[friend_sum[num][j]] = label
g_list[label-1] += 1
q.append(friend_sum[num][j])
ans = 0
for i in range(n):
ans = g_list[g_label[i]-1] - len(friend_sum[i]) - 1
for j in range(len(block_sum[i])):
if g_label[i] == g_label[block_sum[i][j]]:
ans -= 1
print(ans, end=' ')
print()
| 1 | 61,956,748,887,250 | null | 209 | 209 |
H, W, K = map(int, input().split())
ans = [[0 for _ in range(W)] for _ in range(H)]
not_ichigo_row = []
ichigo_row = []
cnt = 0 #イチゴのカウント、フラグが立っていない場合はカウントしない
for i in range(H):
s = list(input())
# print(s)
if "#" not in s:
not_ichigo_row.append(i)
continue
ichigo_row.append(i)
f = 0 #行内の1つめのイチゴか判定
cnt += 1
for j in range(W):
# print(s[j])
if s[j] == "#":
if not f:
f = 1
else:
cnt += 1
# print("cnt", cnt)
ans[i][j] = cnt
# print(not_ichigo_row)
for i in not_ichigo_row:
row = i
f = 0
while row in not_ichigo_row:
if row == H-1:
f = 1
if f:
row -= 1
else:
row += 1
# print(row)
ans[i] = ans[row].copy()
for r in ans:
print(*r)
|
H,W,K=map(int,input().split())
S=[input() for i in range(H)]
P=[[0 for i in range(W)] for m in range(H)]
for h in range(H):
if "#" in S[h]:
front=h
break
m=0
x=0
for w in range(W):
if S[front][w]=="#":
m+=1
for z in range(x,w+1):
P[front][z]=m
x=w+1
for z in range(x,W):
P[front][z]=m
for h in range(front-1,-1,-1):
for w in range(W):
P[h][w]=P[h+1][w]
for h in range(front+1,H):
if "#" in S[h]:
x=0
for w in range(W):
if S[h][w]=="#":
m+=1
for z in range(x,w+1):
P[h][z]=m
x=w+1
for z in range(x,W):
P[h][z]=m
else:
for w in range(W):
P[h][w]=P[h-1][w]
for h in range(H):
print(" ".join(list(map(str,P[h]))))
| 1 | 144,242,352,344,250 | null | 277 | 277 |
import sys
read = sys.stdin.buffer.read
def main():
N, K, *AF = map(int, read().split())
A = AF[:N]
F = AF[N:]
A.sort()
F.sort(reverse=True)
ok = pow(10, 12)
ng = -1
while ok - ng > 1:
mid = (ok + ng) // 2
k = 0
for i in range(N):
if A[i] * F[i] > mid:
k += A[i] - mid // F[i]
if k <= K:
ok = mid
else:
ng = mid
print(ok)
return
if __name__ == '__main__':
main()
|
pi = 3.14159265358979
r = float(raw_input())
print '%.6f %.6f'%(pi*r*r, 2*pi*r)
| 0 | null | 82,442,742,672,430 | 290 | 46 |
def solve(n):
return (n - 1) // 2
assert solve(4) == 1
assert solve(999999) == 499999
n = int(input())
print(solve(n))
|
while True:
n, x = map(int, input().split())
if n == x == 0:
break
count = 0
for i in range(1,n+1):
for j in range(1,n+1):
for k in range(1,n+1):
if (i < j < k):
if i+j+k == x:
count += 1
print(count)
| 0 | null | 77,437,845,159,630 | 283 | 58 |
import math
n,k=map(int,input().split())
a=list(map(int,input().split()))
def is_ok(arg):
cnt=0
for i in a:
cnt+=(i-1)//arg
return k>=cnt
def binsearch(ng,ok):
while abs(ok-ng)>1:
mid=(ok+ng)//2
if is_ok(mid):
ok=mid
else:
ng=mid
return ok
print(binsearch(0,10**9+1))
|
import math
def resolve():
N, K = map(int, input().split())
A = list(map(int, input().split()))
def _f(length: int) -> bool:
count = 0
for a in A:
count += int((a-1) / length)
return count <= K
l = 0
r = 10**9
while (r-l) > 1:
mid = (l+r) // 2
if _f(mid):
r = mid
else:
l = mid
print(r)
if __name__ == "__main__":
resolve()
| 1 | 6,501,132,195,218 | null | 99 | 99 |
import copy
import math
import time
import statistics
import math
import itertools
# a = get_int()
def get_int():
return int(input())
# a = get_string()
def get_string():
return input()
# a_list = get_int_list()
def get_int_list():
return [int(x) for x in input().split()]
# a_list = get_string_list():
def get_string_list():
return input().split()
# a, b = get_int_multi()
def get_int_multi():
return map(int, input().split())
# a_list = get_string_char_list()
def get_string_char_list():
return list(str(input()))
# print("{} {}".format(a, b))
# for num in range(0, a):
# a_list[idx]
# a_list = [0] * a
'''
while (idx < n) and ():
idx += 1
'''
def main():
start = time.time()
n = get_int()
p = get_int_list()
q = get_int_list()
a = []
for i in range(1, n+1):
a.append(i)
count = 0
count_p = 0
count_q = 0
for keiro in list(itertools.permutations(a)):
if list(keiro) == p:
count_p = count
if list(keiro) == q:
count_q = count
count += 1
print(abs(count_p - count_q))
if __name__ == '__main__':
main()
|
from itertools import permutations
n = int(input())
x = [i+1 for i in range(n)]
x = list(map(str, x))
pt = [''.join(p) for p in permutations(x)]
a = pt.index(''.join(input().split()))
b = pt.index(''.join(input().split()))
print(abs(a-b))
| 1 | 100,405,370,263,940 | null | 246 | 246 |
n = int(input())
count = 0
for i in range(0, n):
tmp = input()
if tmp.split()[0] == tmp.split()[1]:
count += 1
if count == 3:
break
else:
count = 0
if count == 3:
print('Yes')
else:
print('No')
|
n = int(input())
d1 = [0] * n
d2 = [0] * n
for i in range(n):
d1[i], d2[i] = map(int,input().split())
for i in range(n-2):
if d1[i] == d2[i] and d1[i+1] == d2[i+1] and d1[i+2] == d2[i+2]:
print('Yes')
break
else:
print('No')
| 1 | 2,478,709,399,320 | null | 72 | 72 |
from itertools import product
n = int(input())
n_num = [[0] * 10 for _ in range(10)]
for i in range(n + 1):
a, b = int(str(i)[0]), i % 10
n_num[a][b] += 1
answer = sum(n_num[a][b] * n_num[b][a] for a, b in product(range(1, 10), repeat=2))
print(answer)
|
x=input()
if x=='0':
print('1')
if x=='1':
print('0')
| 0 | null | 44,584,817,477,760 | 234 | 76 |
L=[]
N= 0
while True:
n= int(input())
if(n==0):
break
L.append(n)
N= N+1
for x in range(N):
print("Case",str(x+1)+":",L[x])
|
x = int(input())
i=1
while x!=0:
print('Case {0}: {1}'.format(i,x))
x = int(input())
i+=1
| 1 | 489,025,582,162 | null | 42 | 42 |
import sys
input = sys.stdin.readline
def main():
s, w = map(int, input().split())
print("unsafe" if w >= s else "safe")
if __name__ == "__main__":
main()
|
s,w = map(int,input().split())
print("safe") if s > w else print("unsafe")
| 1 | 29,182,848,852,808 | null | 163 | 163 |
import sys
sys.setrecursionlimit(10**9)
def mi(): return map(int,input().split())
def ii(): return int(input())
def isp(): return input().split()
def deb(text): print("-------\n{}\n-------".format(text))
INF=10**20
def main():
A,B=mi()
print(max(0,A-2*B))
if __name__ == "__main__":
main()
|
i = int(input())
a = 0
a += (i // 500) * 1000
i = i % 500
a += (i // 5) * 5
print(a)
| 0 | null | 104,266,117,704,490 | 291 | 185 |
N,K =map(int,input().split())
count=0
while 1:
if N//(K**count)==0:
break
count +=1
print(count)
|
from collections import Counter
def solve(n, ddd):
if ddd[0] != 0:
return 0
cnt = Counter(ddd)
if cnt[0] != 1:
return 0
max_c = max(cnt)
for i in range(max_c + 1):
if i not in cnt:
return 0
MOD = 998244353
ans = 1
for i in range(max_c):
prev = cnt[i]
curr = cnt[i + 1]
ans = ans * pow(prev, curr, MOD) % MOD
return ans
n = int(input())
ddd = list(map(int, input().split()))
print(solve(n, ddd))
| 0 | null | 109,423,396,648,800 | 212 | 284 |
m,f,r = 0,0,0
table = []
i = 0
while m != -1 or f != -1 or r != -1:
m,f,r = (int(x) for x in input().split())
table.append([m,f,r])
for p in table:
m,f,r = p[0],p[1],p[2]
if m == -1 and f == -1 and r == -1:
break
if m == -1 or f == -1:
print('F')
elif m + f >= 80:
print('A')
elif m + f >= 65:
print('B')
elif m + f >= 50:
print('C')
elif m + f >= 30:
if r >= 50:
print('C')
else:
print('D')
else:
print('F')
|
while True:
m,f,r = map(int, input().split())
if m == -1 and f == -1 and r == -1:
break
if m == -1 or f == -1:
print("F")
continue
s = m + f
if s >= 80:
print("A")
elif s >= 65:
print("B")
elif s >= 50:
print("C")
elif s >=30:
if r >= 50:
print("C")
else:
print("D")
else:
print("F")
| 1 | 1,231,946,429,714 | null | 57 | 57 |
import math
a,b,x=map(float, input().split())
h=b*math.sin(math.pi*x/180)
c=(a**2+b**2-2*a*b*math.cos(math.pi*x/180))**0.5
print(a*h*0.5)
print(a+b+c)
print(h)
|
x=float(input())
p=2*3.14*x
A="dlfnsdfjsdjfsdfjsdfnksdkjnfjksndfkjnskjfkjsdkjfnskjdfknsdkjfskdnfkjsdn"
print(p)
| 0 | null | 15,850,336,314,428 | 30 | 167 |
N = input()
tmp = 0
for s in N:
tmp += int(s)
if tmp%9 == 0:
print("Yes")
else:
print("No")
|
strN = input()
s = 0
for c in strN:
s += int(c)
if s % 9 == 0:
print("Yes")
else:
print("No")
| 1 | 4,416,881,278,030 | null | 87 | 87 |
N = int(input())
A = list(map(int, input().split()))
MOD = 1000000007
cnt = [0,0,0] # 現在割り当てられている人数
ans = 1 # 現時点での組み合わせ
for a in A:
idx = []
for i in range(3):
if cnt[i] == a: # 割り当て可能
idx.append(i)
if len(idx)==0: # 割り当て不能
print(0)
exit()
cnt[idx[0]]+=1 # 任意の色で良いので、一番番号が若い色とする
ans *= len(idx) # 割り当て可能な人数をかける
ans %= MOD
print (ans)
|
K = int(input())
a = [0]*1000001
ans = -1
a[1] = 7%K
for i in range(2,K+1):
a[i] = (10*a[i-1]+7)%K
for i in range(1,K+1):
if a[i] == 0:
ans = i
print(i)
break
if ans == -1:
print(-1)
| 0 | null | 67,927,243,851,750 | 268 | 97 |
a,b=map(int,input().split())
a-=2*b
if(a<0):a=0
print(a)
|
from sys import stdin, setrecursionlimit
def main():
input = stdin.buffer.readline
a, b = map(int, input().split())
ans = a - 2 * b
if ans >= 0:
print(ans)
else:
print(0)
if __name__ == "__main__":
setrecursionlimit(10000)
main()
| 1 | 166,386,137,988,312 | null | 291 | 291 |
n = int(input())
#nを素因数分解したリストを返す
def prime_decomposition(n):
i = 2
table = []
while i * i <= n:
while n % i == 0:
n /= i
table.append(i)
i += 1
if n > 1:
table.append(n)
return table
a = prime_decomposition(n)
list_num=[]
for i,n in enumerate(a):
if i ==0:
list_num.append(n)
if n in list_num:
continue
elif n not in list_num:
list_num.append(n)
count = 0
for i in list_num:
num = a.count(i)
handan = True
j = 1
counter = 0
while handan == True:
num -=j
if num<0:
handan =False
elif num>=0:
counter+=1
j+=1
count +=counter
print(count)
|
n = int(input())
m = n
primes = {}
for i in range(2, int(n**0.5+2)):
while m % i == 0:
m //= i
if i not in primes:
primes[i] = 1
else:
primes[i] += 1
if i > m:
break
if m != 1:
primes[m] = 1
cnt = 0
num = 0
flag = True
while flag == True:
num += 1
flag = False
for i in primes:
if 0 < primes[i] <= num*2:
cnt += 1
primes[i] = 0
elif primes[i] > num*2:
cnt += 1
flag = True
primes[i] -= num
print(cnt)
| 1 | 16,923,209,147,130 | null | 136 | 136 |
import sys
#import numpy as np
import copy
fline = input().rstrip().split(' ')
N, Q = int(fline[0]), int(fline[1])
list = []
for i in range(N):
tlist = []
line = input().split(' ')
tlist = [line[0], line[1]]
#print(tlist)
list.append(tlist)
#print(list)
current = 0
while len(list) != 0:
if int(list[0][1]) <= Q:
current += int(list[0][1])
print(list[0][0] + " " + str(current))
del list[0]
else:
list[0][1] = str((int)(list[0][1])-Q)
list.append(list[0])
del list[0]
current += Q
#print(list)
|
from collections import deque
n, q = map(int, input().split())
queue = deque([])
for i in range(n):
a = input().split()
queue.append([a[0], int(a[1])])
time = 0
while queue:
b = queue.popleft()
if b[1] <= q:
time += b[1]
print(b[0] + ' ' + str(time))
else:
b[1] -= q
time += q
queue.append(b)
| 1 | 43,178,442,514 | null | 19 | 19 |
i = int(input())
a = 0
a += (i // 500) * 1000
i = i % 500
a += (i // 5) * 5
print(a)
|
a, b = map(int, input().split(" "))
print(int(a*b))
| 0 | null | 29,159,790,634,530 | 185 | 133 |
n="0"+input()
k=int(input())
dp=[[[0]*5,[0]*5] for _ in range(len(n))]
dp[0][1][0]=1
for i in range(1,len(n)):
x=int(n[i])
for j in range(4):
if dp[i-1][1][j]:
dp[i][1][j+(x!=0)]=1
if x>1:
dp[i][0][j+1]+=(x-1)
dp[i][0][j]+=1
elif x==1:
dp[i][0][j]+=1
if dp[i-1][0][j]:
dp[i][0][j]+=dp[i-1][0][j]
dp[i][0][j+1]+=(dp[i-1][0][j]*9)
dp[i][0][0]=1
print(dp[-1][0][k]+dp[-1][1][k])
|
H, W = map(int, input().split())
S = [list(input()) for h in range(H)]
table = [[0 for w in range(W)] for h in range(H)]
table[0][0] = int(S[0][0]=='#')
for i in range(1, H):
table[i][0] = table[i-1][0] + int(S[i-1][0]=='.' and S[i][0]=='#')
for j in range(1, W):
table[0][j] = table[0][j-1] + int(S[0][j-1]=='.' and S[0][j]=='#')
for i in range(1, H):
for j in range(1, W):
table[i][j] = min(table[i-1][j] + int(S[i-1][j]=='.' and S[i][j]=='#'),
table[i][j-1] + int(S[i][j-1]=='.' and S[i][j]=='#'))
print(table[-1][-1])
| 0 | null | 62,423,972,429,760 | 224 | 194 |
N = int(input())
A = list(map(int, input().split()))
Q = int(input())
sum_res = sum(A)
counter = [0 for _ in range(10 ** 5 + 1)]
for a in A:
counter[a] += 1
for _ in range(Q):
B, C = map(int, input().split())
sum_res += (C - B) * counter[B]
counter[C] += counter[B]
counter[B] = 0
print(sum_res)
|
input()
xs = list(map(int, input().split()))
def insertion_sort(xs):
for i in range(1, len(xs)):
v = xs[i]
j = i - 1
while j >= 0 and xs[j] > v:
xs[j + 1] = xs[j]
j -= 1
xs[j + 1] = v
print(*xs)
print(*xs)
insertion_sort(xs)
| 0 | null | 6,142,082,750,450 | 122 | 10 |
N = int(input())
A = list(map(int, input().split()))
B = [i for i in A if i % 2 == 0]
o = 'APPROVED'
for i in B:
if i % 3 != 0 and i % 5 != 0:
o = 'DENIED'
break
print(o)
|
n = int(input())
a = list(map(int,input().split()))
ok = True
for i in range(n):
if a[i] % 2 == 0 and a[i] % 3 != 0 and a[i] % 5 != 0:
ok = False
if ok:
print("APPROVED")
else:
print("DENIED")
| 1 | 68,980,649,885,590 | null | 217 | 217 |
A,B,N=map(int,input().split())
if B==1:print(0);exit()
if N<=B:
print(max((A*(N-1))//B-A*((N-1)//B),(A*N)//B-A*(N//B)))
else:print(A-1)
|
A,B,N = map(int,input().split())
if B<=N:
print(int((A*(B-1))/B)-(A*int((B-1)/B)))
else:
print(int((A*N)/B)-(A*int(N/B)))
| 1 | 28,012,591,597,290 | null | 161 | 161 |
for i, a in enumerate(sorted(list(map(lambda a : int(a), input().split(" "))))):
if i == 0:
print("%d" % a, end ="")
else:
print(" %d"% a, end ="")
print()
|
n = int(input())
if n%2 == 0:
print(1/2)
else:
n2 = (n//2) + 1
print(n2/n)
| 0 | null | 89,226,779,472,856 | 40 | 297 |
MOD = 10 ** 9 + 7
# https://qiita.com/drken/items/3b4fdf0a78e7a138cd9a#3-1-mod-p-%E3%81%AE%E4%B8%96%E7%95%8C%E3%81%AB%E3%81%8A%E3%81%91%E3%82%8B%E5%89%B2%E3%82%8A%E7%AE%97%E3%81%A8%E3%81%AF
def modinv(a):
b = MOD
u = 1
v = 0
while b != 0:
t = a // b
a -= t * b
a, b = b, a
u -= t * v
u, v = v, u
u %= MOD
if u < 0:
u += MOD
return u
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
# a = [e for e in a if e != 0]
# if len(a) < k:
# print(0)
# exit()
a.sort(key=lambda x: abs(x), reverse=True)
b = a[:k]
c = a[k:]
n = 0
pro_abs_b = 1
for e in b:
if e < 0:
n += 1
pro_abs_b *= abs(e)
pro_abs_b %= MOD
pro_b = (-1)**n * pro_abs_b % MOD
n_ = 0
pro_abs_ = 1
for e in a[len(a) - k:]:
if e < 0:
n_ += 1
pro_abs_ *= abs(e)
pro_abs_ %= MOD
pro_ = (-1) ** n_ * pro_abs_ % MOD
if n % 2 == 0:
print(pro_b)
exit()
anses = []
last_posinb = None
last_neginb = None
for e in b:
if e > 0:
last_posinb = e
if e < 0:
last_neginb = e
first_posinc = None
first_neginc = None
for e in reversed(c):
if e > 0:
first_posinc = e
if e < 0:
first_neginc = e
# print(last_posinb, last_neginb)
# print(first_posinc, first_neginc)
if last_posinb is not None and first_neginc is not None:
anses.append((-first_neginc / last_posinb, pro_b *
modinv(last_posinb) * first_neginc % MOD))
if last_neginb is not None and first_posinc is not None:
anses.append((-first_posinc / last_neginb, pro_b *
modinv(last_neginb) * first_posinc % MOD))
if len(anses) != 0:
print(max(anses)[1])
else:
print(pro_)
|
import collections
H, W, *S = open(0).read().split()
H, W = [int(_) for _ in [H, W]]
dist = [[float('inf')] * W for _ in range(H)]
dist[0][0] = 0
Q = collections.deque([0])
while True:
if not Q:
break
i = Q.popleft()
x, y = divmod(i, W)
d = dist[x][y]
for dx, dy in ((1, 0), (0, 1)):
nx, ny = x + dx, y + dy
if 0 <= nx < H and 0 <= ny < W:
if S[nx][ny] == '#' and S[x][y] == '.':
if dist[nx][ny] > d + 1:
dist[nx][ny] = d + 1
Q += [nx * W + ny]
elif dist[nx][ny] > d:
dist[nx][ny] = d
Q += [nx * W + ny]
ans = dist[-1][-1]
if S[0][0] == '#':
ans += 1
print(ans)
| 0 | null | 29,522,461,605,418 | 112 | 194 |
s = input()
print('ARC' if s[1]=='B' else 'ABC')
|
n = int(input())
added_strings = set()
for i in range(n):
com, s = input().split()
if com == 'insert':
added_strings.add(s)
elif com == 'find':
print('yes' if (s in added_strings) else 'no')
| 0 | null | 12,201,657,842,640 | 153 | 23 |
s = input()
if s[len(s)-1] == 's':
s = s + 'es'
elif s[len(s)-1] != 's':
s = s + 's'
print(s)
|
name = input()
length = len(name)
if "s" == name[length-1]:
name = name + "es"
else:
name = name + "s"
print(name)
| 1 | 2,378,528,986,512 | null | 71 | 71 |
x,n= map(int,input().split())
p = list(map(int,input().split()))
ans=0
i=0
while True:
if x-i not in p:
ans=x-i
break
elif x+i not in p:
ans=x+i
break
else:
i+=1
continue
print(ans)
|
a = int(input())
i = 1
while a!=0:
print("Case "+str(i)+":",a)
a = int(input())
i = i+1
| 0 | null | 7,324,677,952,928 | 128 | 42 |
n = int(input())
li1 = list(map(int,input().split()))
m = int(input())
li2 = list(map(int,input().split()))
cnt = 0
for i in li2:
if i in li1:
cnt +=1
print(cnt)
|
n = int(input())
s = input()
if n % 2 != 0:
print('No')
elif s[:n//2] == s[n//2:]:
print("Yes")
else:
print("No")
| 0 | null | 73,132,935,210,610 | 22 | 279 |
A,B=map(int,input().split())
for i in range(1,B+1):
if((A*i)%B==0):
print(A*i)
exit()
|
a,b=map(int,input().split())
def factorization(n):
arr = []
tmp = n
for i in range(2, int(n**0.5//1)+1):
if tmp%i==0:
cnt = 0
while tmp%i==0:
cnt+=1
tmp//=i
arr.append([i,cnt])
if tmp!=1:
arr.append([tmp,1])
if arr==[]:
arr.append([n,1])
return arr
a_arr = factorization(a)
b_arr = factorization(b)
a_map = {str(arr[0]):arr[1] for arr in a_arr}
b_map = {str(arr[0]):arr[1] for arr in b_arr}
factor = set(list(a_map.keys())+list(b_map.keys()))
ans = 1
for i in factor:
if str(i) in a_map.keys():
a_num = a_map[str(i)]
else:
a_num = 0
if str(i) in b_map.keys():
b_num = b_map[str(i)]
else:
b_num = 0
ans *= int(i)**(max(a_num,b_num))
print(ans)
| 1 | 113,573,997,914,818 | null | 256 | 256 |
A, B = [x for x in input().split(" ")]
print(int(A) * int(float(B) * 100 + 0.5) // 100)
|
def abc169c_multiplication3():
a, b = input().split()
a = int(a)
b = int(b[0] + b[2] + b[3])
print(a * b // 100)
abc169c_multiplication3()
| 1 | 16,530,339,249,288 | null | 135 | 135 |
from collections import deque
input_list = list(input())
left_idx_stack = deque()
puddle_stack = deque()
for idx, s in enumerate(input_list):
if s == "\\":
left_idx_stack.append(idx)
elif s == '/':
if left_idx_stack:
latest_left_idx = left_idx_stack.pop()
area = idx - latest_left_idx
if not puddle_stack:
puddle_stack.append((latest_left_idx, area))
elif latest_left_idx > puddle_stack[-1][0]:
puddle_stack.append((latest_left_idx, area))
else:
while len(puddle_stack) != 0 and (latest_left_idx < puddle_stack[-1][0]):
latest_puddle = puddle_stack.pop()
area += latest_puddle[1]
puddle_stack.append((latest_left_idx, area))
else:
pass
areas = [p[1] for p in puddle_stack]
print(sum(areas))
print(len(areas), *areas)
|
N = int(input())
D = {i: [0] for i in range(100)}
for i in range(1, N+1):
if i % 10 != 0:
s = str(i)
D[int(s[0])*10+int(s[-1])][0] += 1
D[int(s[0])*10+int(s[-1])].append(i)
S = 0
for i in range(10):
for j in range(10):
S += D[i*10+j][0] * D[j*10+i][0]
print(S)
| 0 | null | 43,268,733,043,898 | 21 | 234 |
a,b=map(int,input().strip().split())
print(a*b)
|
from decimal import Decimal
a, b = map(float, input().split())
a = Decimal(str(a))
b = Decimal(str(b))
print(int(a * b))
| 1 | 15,799,314,404,120 | null | 133 | 133 |
n=input()
s=range(1,14)
h=range(1,14)
c=range(1,14)
d=range(1,14)
trump={'S':s,'C':c,'H':h,'D':d}
for i in range(n):
suit,num=raw_input().split()
num=int(num)
trump[suit].remove(num)
count=0
for suit in ['S','H','C','D']:
for num in trump[suit]:
print('%s %d'%(suit,num))
|
n,m = map(int,input().split())
if n % 2 == 1:ans = [[1+i,n-i] for i in range(n//2)]
else:ans = [[1+i,n-i] for i in range(n//4)]+[[n//2+1+i,n//2-1-i] for i in range(n//2-n//4-1)]
for i in range(m):print(ans[i][0],ans[i][1])
| 0 | null | 14,741,744,447,530 | 54 | 162 |
n,m=map(int,input().split())
k=0
if n%2==1:
for i in range(m):
print(i+1,end=" ")
print(n-i)
elif n%4==0:
for i in range((n+2)//4):
if k>=m:
break
print(i+1,end=" ")
print(n-i)
k+=1
for i in range((n+2)//4,n//2):
if k>=m:
break
print(i+1,end=" ")
print(n-i-1)
k+=1
else:
for i in range((n+2)//4-1):
if k>=m:
break
print(i+1,end=" ")
print(n-i)
k+=1
for i in range((n+2)//4-1,n//2):
if k>=m:
break
print(i+1,end=" ")
print(n-i-1)
k+=1
|
N, M = map(int, input().split())
def sol(N):
if N == 1:
return []
N += 1
ans = [[] for _ in range(N)]
K = 0
for i, n in enumerate(range(1, N // 2)):
ans[i].append(n)
K += 1
for i, n in enumerate(range(N // 2, N - 1)):
ans[K - 1 - i].append(n)
return ans
if N % 2 == 1:
ans = sol(N)
for a in ans[:M]:
print(*a)
else:
L = N // 2
ans = []
if L % 2 == 0:
for a in sol(L + 1):
if len(a) == 0:
continue
ans.append(a)
for a in sol(L - 1):
if len(a) == 0:
continue
a[0] += L + 1
a[1] += L + 2
ans.append(a)
for a in ans[:M]:
print(*a)
else:
for a in sol(L):
if len(a) == 0:
continue
ans.append(a)
for a in sol(L):
if len(a) == 0:
continue
a[0] += L
a[1] += L + 1
ans.append(a)
for a in ans[:M]:
print(*a)
| 1 | 28,605,873,179,872 | null | 162 | 162 |
while 1:
s=input()
if len(s)==1:break
for _ in range(int(input())):
a=int(input())
s=s[a:]+s[:a]
print(s)
|
N, K = map(int, input().split())
minCandidate1 = N % K
minCandidate2 = K - minCandidate1
if minCandidate1 <= minCandidate2:
print(minCandidate1)
else:
print(minCandidate2)
| 0 | null | 20,604,734,726,812 | 66 | 180 |
def main():
X, Y = map(int, input().split())
ans = 0;
if X == 1:
ans += 300000
elif X == 2:
ans += 200000
elif X == 3:
ans += 100000
if Y == 1:
ans += 300000
elif Y == 2:
ans += 200000
elif Y == 3:
ans += 100000
if X == 1 and Y == 1:
ans += 400000
print(ans)
if __name__ == '__main__':
main()
|
# coding: utf-8
# Your code here!
x1, y1, x2, y2 = map(float,input().split())
x = (x2 - x1)
y = (y2 - y1)
s = (x*x + y*y)**(1/2)
print(s)
| 0 | null | 70,325,558,594,548 | 275 | 29 |
class cmbs(object):
def __init__(self, mod):
self.mod = mod
self.g1 = [1, 1]
self.g2 = [1, 1]
inverse = [0, 1]
for i in range(2, 2 * (10 ** 6) + 1):
self.g1.append((self.g1[-1] * i) % mod)
inverse.append((-inverse[mod % i] * (mod // i)) % mod)
self.g2.append((self.g2[-1] * inverse[-1]) % mod)
def cmb(self, n, r):
if n > 2 * (10 ** 6):
return self.cmbl(n, r)
return self.cmbr(n, r)
def cmbr(self, n, r):
if r < 0 or r > n:
return 0
r = min(r, n - r)
return self.g1[n] * self.g2[r] * self.g2[n-r] % self.mod
def cmbl(self, n, r):
t = 1
r = min(r, n-r)
for i in range(n - r + 1, n + 1):
t = t * i % self.mod
return t * self.g2[r] % self.mod
def main():
K = int(input())
S = input()
l = len(S)
mod = 10**9 + 7
c = cmbs(mod)
r = 0
x25 = 1
x26 = pow(26, K, mod)
inv26 = pow(26, mod-2, mod)
for i in range(K+1):
r = (r + c.cmb(l+i-1, i) * x25 * x26) % mod
x25 = x25 * 25 % mod
x26 = x26 * inv26 % mod
return r % mod
print(main())
|
def main():
n = int(input())
dictionary = set()
for _ in range(n):
order, code = input().split()
if order == 'insert':
dictionary.add(code)
elif order == 'find':
if code in dictionary:
print('yes')
else:
print('no')
else:
raise Exception('InputError')
if __name__ == '__main__':
main()
| 0 | null | 6,508,540,264,980 | 124 | 23 |
import sys
a=[map(int,i.split())for i in sys.stdin]
for i,j in a:
c,d=i,j
while d:
if c > d:c,d = d,c
d%=c
print(c,i//c*j)
|
a = sum(map(int, input().split()))
if a > 21:
print("bust")
else:
print("win")
| 0 | null | 59,570,581,275,070 | 5 | 260 |
n = int(input())
a = list(map(int,input().split()))
tmp = [0] * (n+1)
ans = 0
for i in range(n):
tmp[a[i]] += 1
for i in range(1,len(tmp)):
if tmp[i] > 1:
ans += int(tmp[i] * (tmp[i] - 1) / 2)
for i in range(n):
if tmp[a[i]] > 1:
print(ans - int(tmp[a[i]] * (tmp[a[i]] - 1) / 2) + int((tmp[a[i]] - 1) * (tmp[a[i]] - 2) / 2))
else:
print(ans)
|
def sep():
return map(int,input().strip().split(" "))
def lis():
return list(sep())
n=int(input())
from collections import Counter
ar=lis()
c=Counter(ar)
s=0
for i in c.values():
s+=((i*(i-1))//2)
for i in ar:
print(s-c[i]+1)
| 1 | 47,669,019,934,510 | null | 192 | 192 |
for i in range(1, 10):
for ii in range(1, 10):
print('{}x{}={}'.format(i, ii, i*ii))
|
for i in range(1,10):
for j in range(1,10):
print str(i) + 'x' + str(j) + '=' + str(i*j)
| 1 | 2,295,838 | null | 1 | 1 |
a,b,c,d=map(int,input().split())
print("No" if (a-1)//d<(c-1)//b else"Yes")
|
import sys
read = sys.stdin.read
readlines = sys.stdin.readlines
def main():
a, b, c, d = map(int, input().split())
while a > 0 and c > 0:
c -= b
if c <= 0:
print('Yes')
sys.exit()
a -= d
if a <= 0:
print('No')
sys.exit()
if __name__ == '__main__':
main()
| 1 | 29,766,896,449,948 | null | 164 | 164 |
from sys import stdin
#入力
readline=stdin.readline
N,K=map(int,readline().split())
A=list(map(int,readline().split()))
A.sort()
mod=10**9+7
fact=[1]*(N+1)
finv=[1]*(N+1)
inv=[1]*(N+1)
inv[0]=0
for i in range(2,N+1):
fact[i]=(fact[i-1]*i%mod)
inv[i]=(-inv[mod%i]*(mod//i))%mod
finv[i]=(finv[i-1]*inv[i])%mod
def com(N,K,mod):
if (K<0) or (N<K):
return 0
return fact[N]*finv[K]*finv[N-K]%mod
s=0
for i in range(N-1,K-2,-1):
s+=A[i]*com(i,K-1,mod)
for i in range(N-K+1):
s-=A[i]*com(N-i-1,K-1,mod)
s%=mod
print(s)
|
n = int(input())
G = [[0]]+[list(map(int, input().split()))[2:] for _ in range(n)]
# print(G)
from collections import deque
d = deque([1])
dist = [10**10 for _ in range(n+1)]
dist[1] = 0
while len(d) != 0:
now = d.popleft()
# print(now)
for nexte in G[now]:
if dist[now] +1 < dist[nexte]:
dist[nexte] = dist[now] + 1
d.append(nexte)
for i,d in enumerate(dist[1:]):
if d != 10**10:
print(i+1,d)
else:
print(i+1,-1)
| 0 | null | 47,751,640,958,268 | 242 | 9 |
S = input()
if S[len(S) - 1] == 's':
print(S + 'es')
else:
print(S + 's')
|
N=int(input())
import math
X=math.ceil(N/1.08)
if int(X*1.08)==N:
print(X)
else:
print(':(')
| 0 | null | 64,297,312,087,168 | 71 | 265 |
from sys import stdin
a=int(stdin.readline())
A=stdin.readline().split()
sum=0
for k in range(0,a+1):
sum+=int(A[k])
sum-=int(A[a])
ver=1
lay=1
K=0
T=0
if a==0:
if A[0]!='1':
print(-1)
K=1
else:
print(1)
K=1
for l in range(0,a):
if lay-int(A[l])<=0:
print(-1)
K=1
break
if (lay-int(A[l]))*2<int(A[a]) and l==(a-1):
print(-1)
K=1
break
if (lay-int(A[l]))*2-sum+int(A[l])<=int(A[a]):
lay=(lay-int(A[l]))*2
ver+=lay
sum-=int(A[l])
T=l
else:
lay-=int(A[l])
sum-=int(A[l])
x=lay-sum-int(A[a])
if x==0:
ver+=lay
elif x>0:
print(-1)
K=1
else:
lay=sum+int(A[a])
ver+=lay
T=l
break
if K==0:
for u in range(T+1,a):
lay -= int(A[u])
sum -= int(A[u])
ver+=lay
if K==0:
print(ver)
|
import sys
heights = [int(i) for i in sys.stdin.read().split()]
heights.sort(reverse=True)
print("\n".join(map(str, heights[:3])))
| 0 | null | 9,444,791,127,580 | 141 | 2 |
n = int(input())
root = int(n**0.5)
a = 0
for i in range(root, 0, -1):
if n % i == 0:
a = i
break
b = n // a
print(a+b - 2)
|
n = int(input())
a = [int(i) for i in input().split()]
cnt = [0]*(n+1)
cnt[-1] = 3
mod = 1000000007
ans = 1
for i in range(n):
ans *= cnt[a[i]-1]
ans %= mod
cnt[a[i]-1] -= 1
cnt[a[i]] += 1
print(ans)
| 0 | null | 146,134,416,128,000 | 288 | 268 |
X,Y,Z = map(int,input().split())
G = X
X = Y
Y = G
G = X
X = Z
Z = G
print(f'{X} {Y} {Z}')
|
import sys
while True:
num = input()
if int(num) == 0:
break
sum = 0
for i in range(len(num)):
sum += int(num[i])
print(sum)
| 0 | null | 19,717,889,305,804 | 178 | 62 |
while True:
H, W = map(int, input().split())
if H == W == 0:
break
for _ in range(H):
print('#'*W)
print()
|
while True:
H,W = (int(x) for x in input().split())
if H == 0 and W == 0:
break
i = 0
while i < H:
j = 0
while j < W:
print ("#", end='')
j += 1
print ('')
i += 1
print ('')
| 1 | 796,889,640,520 | null | 49 | 49 |
import sys
input = sys.stdin.readline
def main():
N, M = map(int, input().split())
S = input()
ans = []
check = [False] * (N+1)
idx = N
while 0 < idx:
f = False
for i in range(M, 0, -1):
if idx-i < 0: continue
if S[idx-i] == '1':
if check[idx-i]: print(-1); sys.exit()
else: check[idx-i] = True
else:
ans.append(i)
idx -= i
f = True
break
if not f: print(-1); sys.exit()
for a in ans[::-1]: print(a)
if __name__ == '__main__':
main()
|
A = list(map(int,input().split()))
a=A[0]
b=A[1]
if a<b:
a,b=b,a
while b:
a,b=b,a%b
print(a)
| 0 | null | 69,821,273,776,452 | 274 | 11 |
def popcount(x):
x = (x & 0x5555555555555555) + (x >> 1 & 0x5555555555555555)
x = (x & 0x3333333333333333) + (x >> 2 & 0x3333333333333333)
x = (x & 0x0f0f0f0f0f0f0f0f) + (x >> 4 & 0x0f0f0f0f0f0f0f0f)
x = (x & 0x00ff00ff00ff00ff) + (x >> 8 & 0x00ff00ff00ff00ff)
x = (x & 0x0000ffff0000ffff) + (x >> 16 & 0x0000ffff0000ffff)
x = (x & 0x00000000ffffffff) + (x >> 32 & 0x00000000ffffffff)
return x
n = int(input())
testimonies = [[] * n for _ in range(n)]
for i in range(n):
a = int(input())
for _ in range(a):
x, y = map(int, input().split())
testimonies[i].append((x-1, y))
ans = 0
for bits in range(1, 1<<n):
possible = True
for i in range(n):
if not bits >> i & 1:
continue
for x, y in testimonies[i]:
if bits >> x & 1 != y:
possible = False
break
if not possible:
break
if possible:
ans = max(ans, popcount(bits))
print(ans)
|
a, b, m = map(int, input().strip().split())
as_ = list(map(int, input().strip().split()))
bs = list(map(int, input().strip().split()))
xyc = [list(map(int, input().strip().split())) for _ in range(m)]
min_no_discount = min(as_) + min(bs)
min_discount = 1e20
for x, y, c in xyc:
min_discount = min(min_discount, as_[x - 1] + bs[y - 1] - c)
print(min(min_discount, min_no_discount))
| 0 | null | 87,716,227,726,920 | 262 | 200 |
import sys
input = sys.stdin.readline
def main():
from collections import deque
from collections import defaultdict
n=int(input())
ab=[list(map(int,input().split())) for _ in range(n-1)]
g=[[] for _ in range(n)]
for i,abi in enumerate(ab):
a,b=abi
g[b-1].append(a-1)
g[a-1].append(b-1)
todo=deque([(0,-1)])
dc={}
while len(todo)>0:
a,pc=todo.popleft()
l=g[a]
c=0
for li in l:
d,e=min(a,li),max(a,li)
if (d,e) not in dc:
c+=1 if c+1!=pc else 2
dc[(d,e)]=c
todo.append([li,c])
print(max(dc.values()))
for a,b in ab:
print(dc[(a-1,b-1)])
if __name__=='__main__':
main()
|
# ABC145 D
X,Y=map(int,input().split())
a,b=-1,-1
if not (2*X-Y)%3:
b=(2*X-Y)//3
if not (2*Y-X)%3:
a=(2*Y-X)//3
N=10**6
p=10**9+7
f,finv,inv=[0]*N,[0]*N,[0]*N
def nCr_init(L,p):
for i in range(L+1):
if i<=1:
f[i],finv[i],inv[i]=1,1,1
else:
f[i]=(f[i-1]*i)%p
inv[i]=(p-inv[p%i]*(p//i))%p
finv[i]=(finv[i-1]*inv[i])%p
def nCr(n,r,p):
if 0<=r<=n and 0<=n:
return (f[n]*finv[n-r]*finv[r])%p
else:
return 0
nCr_init(a+b+1,p)
if a>=0 and b>=0:
print(nCr(a+b,b,p))
else:
print(0)
| 0 | null | 142,963,208,263,118 | 272 | 281 |
N, K = map(int, input().split(' '))
print(min(N % K, abs(N % K - K)))
|
INF = int(10e20)
def main():
N, K = tuple([int(_x) for _x in input().split()])
minval = N
sub = N // K - 5
if sub > 0:
N = N - K * sub
for i in range(20):
N = abs(N - K)
minval = min(N, minval)
print(minval)
main()
| 1 | 39,379,123,674,078 | null | 180 | 180 |
N, K = map(int, input().split())
A = [[0 for _ in range(N+1)] for _ in range(100)]
A[0] = [0] + list(map(int, input().split()))
for l in range(1,100):
#print(A[0])
for j in range(1, N+1):
#print(l,j)
#print(l-1,A[l-1][j])
A[l][j] = A[l-1][A[l-1][j]] #2^(l-1)1回テレポート後、さらに^(l-1)1回テレポート
if 2 ** l > K:
break
k = K
ans = 1
keta = 0
while k > 0:
if k & 1:
ans = A[keta][ans]
k = k >> 1
keta += 1
print(ans)
|
N, K = map(int, input().split())
A = list(map(int, input().split()))
visited = [-1 for _ in range(N)]
visited[0] = 0
k = 0
k = A[k] - 1
count = 0
while visited[k] == -1:
count += 1
visited[k] = count
k = A[k]-1
roop = count - visited[k] + 1
beforeroop = visited[k]
if K < beforeroop:
k = 0
for _ in range(K):
k = A[k] - 1
print(k+1)
else:
K = K - beforeroop
K = K % roop
for _ in range(K):
k = A[k]-1
print(k+1)
| 1 | 22,644,874,674,630 | null | 150 | 150 |
def main():
from random import sample
from operator import itemgetter
e=enumerate
n,a=open(0)
n=int(n)
d=[0]+[-2**64]*n
for j,(a,i)in e(sorted(sample([(a,i)for i,a in e(map(int,a.split()))],n),key=itemgetter(0),reverse=1)):
d=[max(t+a*(~i-j+k+n),d[k-1]+a*abs(~i+k))for k,t in e(d)]
print(max(d))
main()
|
n=int(input())
c=0
for a in range(1,n+1):
c+=(n-1)//a
print(c)
| 0 | null | 18,033,076,195,662 | 171 | 73 |
def resolve():
import sys
input = sys.stdin.readline
n = int(input().rstrip())
print(n + n*n + n*n*n)
if __name__ == "__main__":
resolve()
|
a = int(input())
result = a + pow(a, 2) + pow(a,3)
print(result)
| 1 | 10,254,307,814,398 | null | 115 | 115 |
p =input()
if p[len(p) - 1] == 's':
print(p+'es')
else:
print(p+'s')
|
N = input()
if N.endswith('s'):
print(N + 'es')
else:
print(N + 's')
| 1 | 2,412,849,798,438 | null | 71 | 71 |
n = int(input())
a = [0]*n
b = [0]*n
for i in range(n):
aa,bb = map(int, input().split())
a[i] = aa
b[i] = bb
a.sort()
b.sort()
if n%2 == 1:
print(b[n//2] - a[n//2] + 1)
else:
print(b[n//2] + b[(n//2)-1] - a[n//2] - a[(n//2)-1] + 1)
|
N = int(input())
A = [list(map(int, input().split())) for i in range(N)]
# N = 3
# A = [[1, 3], [2, 5], [1, 7]]
if N % 2 == 1:
minA = sorted([row[0] for row in A])
maxA = sorted([row[1] for row in A])
medA = minA[int(N/2)]
medB = maxA[int(N/2)]
print(medB-medA+1)
else:
minA = sorted([row[0] for row in A])
maxA = sorted([row[1] for row in A])
medA = (minA[int(N/2-1)]+minA[int(N/2)])/2
medB = (maxA[int(N/2-1)]+maxA[int(N/2)])/2
print(int((medB-medA)*2+1))
| 1 | 17,235,531,684,252 | null | 137 | 137 |
import bisect
import collections
N,K=map(int,input().split())
A=list(map(int,input().split()))
A.insert(0,0)
cuml=[0]*(N+1)
cuml[0]=A[0]
l=[]
cuml2=[]
l2=[]
buf=[]
ans=0
for i in range(N):
cuml[i+1]=cuml[i]+A[i+1]
#print(cuml)
for i in range(N+1):
cuml2.append([(cuml[i]-i)%K,i])
cuml[i]=(cuml[i]-i)%K
#print(cuml2,cuml)
cuml2.sort(key=lambda x:x[0])
piv=cuml2[0][0]
buf=[]
for i in range(N+1):
if piv!=cuml2[i][0]:
l2.append(buf)
piv=cuml2[i][0]
buf=[]
buf.append(cuml2[i][1])
l2.append(buf)
#print(l2)
cnt=0
for i in range(len(l2)):
for j in range(len(l2[i])):
num=l2[i][j]
id=bisect.bisect_left(l2[i], num + K)
#print(j,id)
cnt=cnt+(id-j-1)
print(cnt)
|
W, H ,x, y, r = map(int, input().split())
if ((x-r)<0) or ((y-r)<0) or ((x+r)>W) or ((y+r)>H):
print("No")
else:
print("Yes")
| 0 | null | 68,778,050,111,540 | 273 | 41 |
import itertools
a, b, c = map(int, input().split(" "))
k = int(input())
f = False
for conb in list(itertools.combinations_with_replacement([0, 1, 2], k)):
a_i = conb.count(0)
b_i = conb.count(1)
c_i = conb.count(2)
if (a * (2 ** a_i) < b * (2 **b_i)) and (b * (2 ** b_i) < c * (2 ** c_i)):
f = True
if f:
print("Yes")
else:
print("No")
|
import sys
heights = []
for i in range(10):
line = sys.stdin.readline()
height = int(line)
heights.append(height)
heights.sort()
heights.reverse()
for i in range(3):
print (heights[i])
| 0 | null | 3,406,828,620,030 | 101 | 2 |
r = float(input())
print("{0:.6f} {1:.6f}".format(r**2 * 3.141592653589, 2 * r * 3.141592653589))
|
N,M=map(int,input().split())
S,r,s=input(),[],N
for _ in range(2*N):
if S[s]=='1':
s += 1
else:
r.append(str(N-s))
N,s=s,max(0,s-M)
if N == 0:
break
print(*[-1] if s else r[1:][::-1])
| 0 | null | 70,012,118,683,042 | 46 | 274 |
from itertools import permutations
n = int(input())
xy = [list(map(int, input().split())) for _ in range(n)]
sum = 0
cnt = 0
for i in permutations(xy):
for j in range(n - 1):
sum += ((i[j][0] - i[j + 1][0]) ** 2 + (i[j][1] - i[j + 1][1]) ** 2) ** 0.5
cnt += 1
print(sum / cnt)
|
import itertools
N = int(input())
c = []
d = 0
for i in range(N):
x1, y1 = map(int, input().split())
c.append((x1,y1))
cp = list(itertools.permutations(c))
x = len(cp)
for i in range(x):
for j in range(N-1):
d += ((cp[i][j][0]-cp[i][j+1][0])**2 + (cp[i][j][1] - cp[i][j+1][1])**2)**0.5
print(d/x)
| 1 | 148,663,639,948,000 | null | 280 | 280 |
import math
n = int(input())
x = list(map(int, input().split()))
y = list(map(int, input().split()))
manhattan = 0
euclid = 0
euclid2 = 0
chebishef = 0
for i, j in zip(x, y):
tmp = abs(i - j)
manhattan += tmp
euclid += tmp * tmp
euclid2 += tmp * tmp * tmp
chebishef = max(chebishef, tmp)
print(manhattan)
print(math.sqrt(euclid))
print(math.pow(euclid2, 1 / 3))
print(chebishef)
|
def print_frame(h, w):
"""
h: int(3 <= h <= 300)
w: int(3 <= w <= 300)
outputs a rectangle frame h x w
>>> print_frame(3, 4)
####
#..#
####
>>> print_frame(5, 6)
######
#....#
#....#
#....#
######
>>> print_frame(3, 3)
###
#.#
###
"""
print('#' * w)
for i in range(h-2):
print('#' + '.'*(w-2) + '#')
print('#' * w)
if __name__ == '__main__':
while True:
(h, w) = [int(i) for i in input().split(' ')]
if h == 0 and w == 0:
break
print_frame(h, w)
print()
| 0 | null | 511,848,134,730 | 32 | 50 |
c= int(input())
ans =0
s = 0
while c >1:
c = c//2
ans += 1
for i in range(1,ans+1):
s += 2**i
print(s+1)
|
N = int(input())
print('ACL' * N)
| 0 | null | 41,276,503,893,440 | 228 | 69 |
l = input().split()
a = int(l[0])
b = int(l[1])
c = int(l[2])
d = []
for i in range(a,b+1):
if c % i == 0:
d.append(i)
print(len(d))
|
#! python3
a, b, c = [int(x) for x in input().strip().split(' ')]
r = 0
for i in range(a, b+1):
if c % i == 0:
r += 1
print(r)
| 1 | 566,413,377,222 | null | 44 | 44 |
n, x, m = map(int, input().split())
li = [x]
se = {x}
for i in range(n-1):
x = x*x%m
if x in se:
idx = li.index(x)
break
li.append(x)
se.add(x)
else:
print(sum(li))
exit(0)
ans = sum(li) + sum(li[idx:])*((n-len(li)) // (len(li)-idx)) + sum(li[idx:idx+(n-len(li)) % (len(li)-idx)])
print(ans)
|
startX, countK, distanceD = map(int, input().split())
n = int(abs(startX) / distanceD)
ans = abs(startX) % distanceD
if n > countK:
ans += distanceD * (n - countK)
else:
if (countK - n) % 2 == 1:
ans= abs(ans - distanceD)
print(ans)
| 0 | null | 4,020,815,308,664 | 75 | 92 |
n = int(input())
a = list(map(int,input().split()))
import sys
lim = [0]*(n+1)
aa = 0
for i in range(n+1):
aa += a[n-i]
lim[n-i] = aa
if n == 0:
if a[0] != 1:
print(-1)
sys.exit()
else:
print(1)
sys.exit()
if a[0] != 0:
print(-1)
sys.exit()
ha = [[0]*(n+1) for i in range(2)]
ha[0][0] = 1
ha[1][0] = 1
for i in range(n):
ha[1][i+1] = min(ha[0][i]*2 , lim[i+1])
ha[0][i+1] = ha[1][i+1] - a[i+1]
if ha[0][i+1] <= 0 and i != n-1:
print(-1)
sys.exit()
if ha[0][i+1] < 0 and i == n-1:
print(-1)
sys.exit()
print(sum(ha[1]))
|
class UnionFind:
from typing import List, Set
def __init__(self, n):
self.n = n
self.parent = [-1] * n
def union(self, x, y) -> int:
x = self.leader(x)
y = self.leader(y)
if x == y:
return 0
if self.parent[x] > self.parent[y]:
x, y = y, x
self.parent[x] += self.parent[y]
self.parent[y] = x
return self.parent[x]
def same(self, x, y) -> bool:
return self.leader(x) == self.leader(y)
def leader(self, x) -> int:
if self.parent[x] < 0:
return x
else:
self.parent[x] = self.leader(self.parent[x])
return self.parent[x]
def size(self, x) -> int:
return -self.parent[self.leader(x)]
def groups(self) -> List[Set[int]]:
groups = dict()
for i in range(self.n):
p = self.leader(i)
if not groups.get(p):
groups[p] = set()
groups[p].add(i)
return list(groups.values())
n, m = map(int, input().split())
uf = UnionFind(n)
for i in range(m):
a, b = map(int, input().split())
uf.union(a-1, b-1)
print(len(uf.groups()) - 1)
| 0 | null | 10,561,215,066,468 | 141 | 70 |
if __name__ == '__main__':
s = input()
t = input()
if s == t[:-1]:
print("Yes")
else:
print("No")
|
s = input()
t = input()
print(['No','Yes'][s == t[:-1]])
| 1 | 21,497,132,403,010 | null | 147 | 147 |
MOD = int(1e9+7)
N = int(input())
# all posible list
Na = pow(10, N, MOD)
# number of list without 0
N0 = pow(9, N, MOD)
# number of list without both 0 and 9
N09 = pow(8, N, MOD)
M = Na - 2*N0 + N09
print(M%MOD)
|
#ABC 171 E - Red Scarf
n = int(input())
A = list(map(int, input().split()))
S = 0
for i in A:
S ^= i
B = [S^i for i in A]
print(*B)
| 0 | null | 7,809,268,266,140 | 78 | 123 |
n=int(input())
x=int(100000)
for i in range(1,n+1) :
x = x*1.05
if x%1000 == 0 :
continue
else :
x = x//1000*1000+1000
print("{:.0f}".format(x))
|
def gcd(a, b):
while b:
a, b = b, a % b
return a
def lcm(a, b):
return a * b // gcd(a, b)
while True:
try:
x, y = map(int, input().split())
print(gcd(x, y), lcm(x, y))
except:
break
| 0 | null | 849,441,328 | 6 | 5 |
S = input()
ans = ''.join(['x' for ch in S])
print(ans)
|
s = input()
print('x'*len(s))
| 1 | 73,324,396,563,240 | null | 221 | 221 |
a,b=[int(i) for i in input().split()]
if(a<=9 and b<=9):
print(a*b)
else:
print(-1)
|
from math import gcd
from math import factorial as f
from math import ceil,floor,sqrt
import bisect
import re
import heapq
from copy import deepcopy
import itertools
from sys import exit
ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))
yes = "unsafe"
no = "safe"
def main():
s,w = mi()
if w>=s:
print(yes)
else:
print(no)
main()
| 0 | null | 93,604,978,643,420 | 286 | 163 |
import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")
n = int(input())
for i in range(1,10):
if n%i==0 and n//i<10:
ans = "Yes"
break
else:
ans = "No"
print(ans)
|
import unittest
def print_str(S,T):
return T+S
S, T = input().split(' ')
print(print_str(S,T))
class TestPrint_str(unittest.TestCase):
def test_print_str(selt):
self.assertEqual(T+S, print_str(T,S))
| 0 | null | 131,567,773,581,020 | 287 | 248 |
s = input()
l = len(s)
ans = 'x' * l
print(ans)
|
for i in range(1,10):
for z in range(1,10):
a = i * z
print(str(i) + "x" + str(z) + "=" + str(a))
| 0 | null | 36,462,258,534,090 | 221 | 1 |
#!/usr/bin/env python3
import sys
import collections as cl
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def main():
N = II()
graph = [[] for i in range(N)]
prev = [-1 for i in range(N)]
colors = {}
edges = []
for _ in range(N-1):
a, b = MI()
graph[a-1].append(b-1)
graph[b-1].append(a-1)
edges.append([a-1, b-1])
max_edge = 0
max_edge_idx = -1
for i in range(len(graph)):
length = len(graph[i])
if length >= max_edge:
max_edge = length
max_edge_idx = i
deque = cl.deque([max_edge_idx])
while len(deque) > 0:
target = deque.popleft()
pre = prev[target]
pre_key = (target, pre) if target < pre else (pre, target)
used_color = 0
if pre != -1:
used_color = colors[pre_key]
connecteds = graph[target]
color = 1
for connected in connecteds:
key = (target, connected) if target < connected else (
connected, target)
if key in colors:
continue
if color == used_color:
color += 1
colors[key] = color
prev[connected] = target
deque.append(connected)
color += 1
print(max_edge)
for edge in edges:
print(colors[(edge[0], edge[1])])
main()
|
import sys
sys.setrecursionlimit(10 ** 9)
# 昔同じ問題を atcoder で見た？
n = int(input())
edges = []
paths = {}
for i in range(n-1):
a, b = list(map(int, input().split(' ')))
edges.append((a, b))
paths[a] = paths.get(a, []) + [b]
paths[b] = paths.get(b, []) + [a]
# print(edges)
# print(paths)
colors = {} # (a->b) 1 とか
current = 1
biggest = 1
def f(current, prev, prev_color):
global biggest
color = 0
for vertex in paths[current]:
if vertex == prev:
continue
color += 1
if color == prev_color:
color += 1
biggest = max(biggest, color)
colors[(current, vertex)] = color
f(vertex, current, color)
f(1, None, None)
print(biggest)
for a, b in edges:
print(colors[(a, b)])
# pypy3
| 1 | 135,830,031,751,078 | null | 272 | 272 |
print('ACL'*int(input()))
|
#import collections
# c = collections.Counter()
#import itertools as it
#import math
#import numpy as np
#import sys
#sys.exit()
#a = int(input())
k = int(input())
#a, b = map(int, input().split())
'''
# = list(map(int, input().split()))
'''
'''
n = input()
a = [int(input()) for i in range(n)]
'''
'''
n,m = map(int, input().split())
a = [list(map(int, input().split())) for _ in range(m)]
'''
#-------------------------------#
#len(t)==len(s)+1
#print(t[0:-1])
#print(a+pow(a,2)+pow(a,3))
for i in range(k):
print("ACL", end='')
| 1 | 2,162,302,684,880 | null | 69 | 69 |
# coding: utf-8
import codecs
import sys
sys.stdout = codecs.getwriter("shift_jis")(sys.stdout) # ??????
sys.stdin = codecs.getreader("shift_jis")(sys.stdin) # ??\???
# ??\??¬?????????print??????????????´?????? print(u'?????????') ??¨??????
# ??\??¬?????????input??? input(u'?????????') ??§OK
# ??°?¢???????????????????????????´??????6,7???????????????????????¢??????
"""
DEBUG = 0
if DEBUG == 0:
a = []
for i in range(200):
deglist=[int(x) for x in input().split(" ")]
a.append(deglist)
else:
a = [[5,7],[1,99],[1000,999]]
for i in range(len(a)):
wa = a[i][0] + a[i][1]
print len(str(wa))
"""
while True:
try:
a,b = map(int, raw_input().split())
print len(str(a+b))
except EOFError:
break
|
import sys
input = sys.stdin.readline
n, res = int(input()), 0
for i in range(1, n + 1): res += 0 if i % 3 == 0 or i % 5 == 0 else i
print(res)
| 0 | null | 17,517,313,376,444 | 3 | 173 |
x, y = map(int, input().split())
for i in range(x + 1):
if 2 * (x - i) + 4 * i == y:
print("Yes")
break
else:
print("No")
|
x, y = map(int,input().split())
leg = 2*x
if y==leg:
print('Yes')
exit()
for i in range(1,x+1):
leg += 2
if y==leg:
print('Yes')
exit()
print('No')
| 1 | 13,744,017,697,312 | null | 127 | 127 |
X, Y, A, B, C = list(map(int,input().split()))
p = list(map(int,input().split()))
q = list(map(int,input().split()))
r = list(map(int,input().split()))
p.sort(reverse=True)
q.sort(reverse=True)
r.sort(reverse=True)
p.append(float("inf"))
q.append(float("inf"))
Z = 0
while Z < C:
if min(p[X - 1], q[Y - 1]) < r[Z]:
if p[X - 1] < q[Y - 1]:
X -= 1
Z += 1
else:
Y -= 1
Z += 1
continue
break
print(sum(p[:X]) + sum(q[:Y]) + sum(r[:Z]))
|
def aizu007():
xs = map(int,raw_input().split())
a,b,c = xs[0],xs[1],xs[2]
cnt = 0
for i in range(a,b+1):
if c%i == 0:
cnt = cnt + 1
print cnt
aizu007()
| 0 | null | 22,530,091,694,698 | 188 | 44 |
import math
r = input()
print "%0.6f %0.6f"%(r*r*math.pi,r*2*math.pi)
|
r=float(raw_input())
p=float(3.14159265358979323846264338327950288)
s=p*r**2.0
l=2.0*p*r
print"%.5f %.5f"%(float(s),float(l))
| 1 | 644,067,871,436 | null | 46 | 46 |
import sys
sys.setrecursionlimit(10**7)
readline = sys.stdin.buffer.readline
def readstr():return readline().rstrip().decode()
def readstrs():return list(readline().decode().split())
def readint():return int(readline())
def readints():return list(map(int,readline().split()))
def printrows(x):print('\n'.join(map(str,x)))
def printline(x):print(' '.join(map(str,x)))
n = readint()
mod = 10**9+7
print((pow(10,n,mod)-pow(9,n,mod)*2+pow(8,n,mod)+mod*2)%mod)
|
X = int(input())
c = 0
i = 100
while True:
c += 1
i = i + i//100
if X <= i:
break
print(c)
| 0 | null | 15,186,033,201,460 | 78 | 159 |
N=int(input())
A=list(map(int,input().split()))
p=round(sum(A)/N)
print(sum(map(lambda x: (x-p)**2, A)))
|
a,b,c = list(map(int,input().split(" ")))
div=0
for i in range(a,b+1):
if c % i == 0:
div += 1
print(div)
| 0 | null | 32,941,987,784,160 | 213 | 44 |
from functools import reduce
import sys
N, M = map(int, input().split())
A = list(map(int, input().split()))
def lcm(a,b):
return int(a * b / gcd(a, b))
def gcd(a, b):
import fractions
return fractions.gcd(a, b)
def temp(a):
return int(a * 0.5)
max_a = max(A)
i = 0
while True:
num = int((i+0.5) * max_a)
if num > M:
print(0)
sys.exit()
found = True
for a in A:
if int(num - 0.5 * a) % a != 0:
found = False
break
if found:
ans = 1
break
i += 1
aa = reduce(lcm, A)
ans += (M - num) // aa
print(int(ans))
|
# 最小公倍数(mathは3.5以降) fractions
from functools import reduce
import fractions #(2020-0405 fractions→math)
def lcm_base(x, y):
return (x * y) // fractions.gcd(x, y) # 「//」はフロートにせずにintにする
def lcm(*numbers):
return reduce(lcm_base, numbers, 1)
def lcm_list(numbers):
return reduce(lcm_base, numbers, 1)
N,M = (int(x) for x in input().split())
A = list(map(int, input().split()))
lcm =lcm_list(A)
han_lcm =lcm//2
han_lcm_num =M//han_lcm
han_lcm_num =(han_lcm_num +1)//2 #偶数を除く
#半公倍数がA自身の中にある時は✖
if han_lcm in A:
han_lcm_num =0
#半公倍数がaiで割り切れるときは✖
for a in A:
if han_lcm % a ==0:
han_lcm_num =0
print(han_lcm_num)
| 1 | 101,865,900,388,152 | null | 247 | 247 |
a = int(input())
ans = a >= 30 and 'Yes' or 'No'
print(ans)
|
n=int(input())
num=[1,1]
for i in range(43):
b=(num[-2])+(num[-1])
num.append(b)
print(num[(n)])
| 0 | null | 2,876,142,226,388 | 95 | 7 |
n = input()
a = list(map(int, input().split()))
print(' '.join(map(str, reversed(a))))
|
#coding:UTF-8
n = input()
a = map(int,raw_input().split())
a.reverse()
for i in range(n):
print a[i],
| 1 | 973,967,988,180 | null | 53 | 53 |
#!/usr/bin/env python3
from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]
dy8, dx8 = [0, -1, 0, 1, 1, -1, -1, 1], [1, 0, -1, 0, 1, 1, -1, -1]
def inside(y, x, H, W):
return 0 <= y < H and 0 <= x < W
def ceil(a, b):
return (a + b - 1) // b
def sum_of_arithmetic_progression(s, d, n):
return n * (2 * s + (n - 1) * d) // 2
def gcd(a, b):
if b == 0:
return a
return gcd(b, a % b)
def lcm(a, b):
g = gcd(a, b)
return a / g * b
def solve():
S = input()
N = len(S)
if S != S[::-1]:
return False
t = S[:(N - 1) // 2]
if t != t[::-1]:
return False
t = S[(N + 3) // 2 - 1:]
if t != t[::-1]:
return False
return True
def main():
if solve():
print("Yes")
else:
print("No")
if __name__ == '__main__':
main()
|
while True:
C=input()
if C=="-":
break
else:
m=int(input())
for i in range(m):
h=int(input())
c=C[0 : h]
C=C[h : len(C) + 1]
C+=c
print(C)
| 0 | null | 23,977,424,101,092 | 190 | 66 |
a,b,c,d=map(int, raw_input().split())
print max(a*c,a*d,b*c,b*d)
|
# coding: utf-8
# Here your code !
for i in range(9):
for j in range(9):
print('%sx%s=%s' % ((i+1), (j+1), (i+1)*(j+1)))
| 0 | null | 1,515,723,256,220 | 77 | 1 |
# 3
A,B,C=map(int,input().split())
K=int(input())
def f(a,b,c,k):
if k==0:
return a<b<c
return f(a*2,b,c,k-1) or f(a,b*2,c,k-1) or f(a,b,c*2,k-1)
print('Yes' if f(A,B,C,K) else 'No')
|
inputs = input().split(' ')
inputs = list(map(int,inputs))
W = inputs[0]
H = inputs[1]
x = inputs[2]
y = inputs[3]
r = inputs[4]
if r <= x and x <= W-r and r <= y and y <= H-r :
print('Yes')
else :
print('No')
| 0 | null | 3,632,768,573,668 | 101 | 41 |
s = input()
a = [-1] * (len(s) + 1)
if s[0] == "<":
a[0] = 0
if s[-1] == ">":
a[-1] = 0
for i in range(len(s) - 1):
if s[i] == ">" and s[i + 1] == "<":
a[i + 1] = 0
for i in range(len(a)):
if a[i] == 0:
l = i - 1
while 0 <= l - 1:
if s[l] == ">" and s[l - 1] == ">":
a[l] = a[l + 1] + 1
else:
break
l -= 1
r = i + 1
while r + 1< len(a):
if s[r - 1] == "<" and s[r] == "<":
a[r] = a[r - 1] + 1
else:
break
r += 1
for i in range(len(a)):
if a[i] == -1:
if i == 0:
a[i] = a[i + 1] + 1
elif i == len(a) - 1:
a[i] = a[i - 1] + 1
else:
a[i] = max(a[i - 1], a[i + 1]) + 1
ans = sum(a)
print(ans)
|
n = int(input())
numbers = list(map(int, input().split()))
print(' '.join(str(x) for x in numbers))
for i in range(1, n):
key = numbers[i]
j = i - 1
while 0 <= j and key < numbers[j]:
numbers[j+1] = numbers[j]
j -= 1
numbers[j+1] = key
print(' '.join(str(x) for x in numbers))
| 0 | null | 77,851,528,758,158 | 285 | 10 |
def main():
n = int(input())
a = list(map(int,input().split()))
dic = {}
for i in range(n):
if not a[i] in dic.keys():
dic[a[i]] = 1
else:
dic[a[i]] += 1
s = 0
for k in dic.keys():
s += dic[k] * k
q = int(input())
for i in range(q):
b,c = map(int,input().split())
if b in dic.keys():
cnt = dic[b]
else:
cnt = 0
dic[b] = 0
if c in dic.keys():
dic[c] += cnt
else:
dic[c] = cnt
s = s + cnt * (c-b)
print(s)
if __name__ == "__main__":
main()
|
from math import ceil,floor,factorial,gcd,sqrt,log2,cos,sin,tan,acos,asin,atan,degrees,radians,pi,inf,comb
from itertools import accumulate,groupby,permutations,combinations,product,combinations_with_replacement
from collections import deque,defaultdict,Counter
from bisect import bisect_left,bisect_right
from operator import itemgetter
from heapq import heapify,heappop,heappush
from queue import Queue,LifoQueue,PriorityQueue
from copy import deepcopy
from time import time
from functools import reduce
import string
import sys
sys.setrecursionlimit(10 ** 7)
def input() : return sys.stdin.readline().strip()
def INT() : return int(input())
def MAP() : return map(int,input().split())
def LIST() : return list(MAP())
n = INT()
a = LIST()
q = INT()
count = [0]*(10**5+1)
for x in a:
count[x] += 1
ans = 0
for i in range(10**5+1):
ans += i * count[i]
for i in range(q):
b, c = MAP()
ans += (c - b) * count[b]
count[c] += count[b]
count[b] = 0
print(ans)
| 1 | 12,178,778,416,740 | null | 122 | 122 |
N = int(input())
*A, = list(map(int, input().split()))
count = 0
def merge(a, left, mid, right):
global count
la = a[left:mid] + [float("inf")]
ra = a[mid:right] + [float("inf")]
i, j = 0, 0
for k in range(left, right):
count += 1
if la[i] <= ra[j]:
a[k] = la[i]
i += 1
else:
a[k] = ra[j]
j += 1
def merge_sort(a, left, right):
if left + 1 < right:
mid = int((left + right) / 2)
merge_sort(a, left, mid)
merge_sort(a, mid, right)
merge(a, left, mid, right)
merge_sort(A, 0, N)
print(*A)
print(count)
|
from heapq import heappush,heappop,heapify
from collections import deque,defaultdict,Counter
import itertools
from itertools import permutations,combinations
import sys
import bisect
import string
import math
import time
#import random
def I():
return int(input())
def MI():
return map(int,input().split())
def LI():
return [int(i) for i in input().split()]
def LI_():
return [int(i)-1 for i in input().split()]
def StoI():
return [ord(i)-97 for i in input()]
def ItoS(nn):
return chr(nn+97)
def show(*inp,end='\n'):
if show_flg:
print(*inp,end=end)
YN=['Yes','No']
mo=10**9+7
inf=float('inf')
l_alp=string.ascii_lowercase
u_alp=string.ascii_uppercase
ts=time.time()
#sys.setrecursionlimit(10**6)
input=lambda: sys.stdin.readline().rstrip()
show_flg=False
#show_flg=True
n,m=LI()
## Segment Tree ##
## Initializer Template ##
# Range Sum: sg=SegTree(n,0)
# Range Minimum: sg=SegTree(n,inf,min,inf)
class SegTree:
def __init__(self,n,init_val=0,function=lambda a,b:a+b,ide=0):
self.n=n
self.ide_ele=ide_ele=ide
self.num=num=2**(n-1).bit_length()
self.seg=seg=[self.ide_ele]*2*self.num
self.segfun=segfun=function
#set_val
for i in range(n):
self.seg[i+self.num-1]=init_val
#built
for i in range(self.num-2,-1,-1) :
self.seg[i]=self.segfun(self.seg[2*i+1],self.seg[2*i+2])
def update(self,k,x):
k += self.num-1
self.seg[k] = x
while k:
k = (k-1)//2
self.seg[k] = self.segfun(self.seg[k*2+1],self.seg[k*2+2])
def query(self,p,q):
if q<=p:
return self.ide_ele
p += self.num-1
q += self.num-2
res=self.ide_ele
while q-p>1:
if p&1 == 0:
res = self.segfun(res,self.seg[p])
if q&1 == 1:
res = self.segfun(res,self.seg[q])
q -= 1
p = p//2
q = (q-1)//2
if p == q:
res = self.segfun(res,self.seg[p])
else:
res = self.segfun(self.segfun(res,self.seg[p]),self.seg[q])
return res
def __str__(self):
# 生配列を表示
rt=self.seg[self.num-1:self.num-1+self.n]
return str(rt)
s=[int(i) for i in input()]
def dp(b,m): # N log (N)
N=len(b)-1
n=N+1
sg=SegTree(n,inf,min,inf)
sg.update(0,0)
dp=[0]+[inf]*(N)
for i in range(N):
if b[i+1]==1:
continue
dp[i+1]=sg.query(max(i-m+1,0),i+1)+1
sg.update(i+1,dp[i+1])
#show(seg)
show(sg)
return dp
dp1=dp(s,m)
step=dp1[n]
if step==inf:
print(-1)
exit()
dp2=dp(s[::-1],m)[::-1]
show(dp1,'dp1')
move=[0]
ans=[]
j=1
for i in range(step,0,-1): # N
while j<=n and dp2[j]!=i-1:
j+=1
move.append(j)
for i in range(len(move)-1):
ans.append(move[i+1]-move[i])
print(*ans)
| 0 | null | 69,224,233,053,768 | 26 | 274 |
S = input()
T = input()
count = 0
for (s,t) in zip(S,T):
if s != t:
count += 1
print(count)
|
n,m,k=map(int,input().split())
par=[i for i in range(n)]
size=[1 for i in range(n)]
def find(x):
if par[x]==x:
return x
else:
par[x]=find(par[x])
return par[x]
def union(a,b):
x=find(a)
y=find(b)
if x!=y:
if size[x]<size[y]:
par[x]=par[y]
size[y]+=size[x]
else:
par[y]=par[x]
size[x]+=size[y]
else:
return
graph=[[] for i in range(n)]
for i in range(m):
a,b=map(int,input().split())
union(a-1,b-1)
graph[a-1].append(b-1)
graph[b-1].append(a-1)
for i in range(k):
a,b=map(int,input().split())
if find(a-1)==find(b-1):
graph[a-1].append(b-1)
graph[b-1].append(a-1)
ans=[]
for i in range(n):
cnt=size[find(i)]
xxx=list(set(graph[i]))
cnt-=len(xxx)
cnt-=1
ans+=[str(cnt)]
print(' '.join(ans))
| 0 | null | 36,124,904,669,402 | 116 | 209 |
S = input()
L = len(S)
cnt = 0
for i in range(L//2):
if S[i] == S[-1-i]:
continue
else:
cnt += 1
print(cnt)
|
s = input()
mid = len(s)//2
q = s[:mid]
if len(s)%2 == 0:
t = list(s[mid:])
else:
t = list(s[mid+1:])
t.reverse()
cnt = 0
for i in range(mid):
cnt += s[i] != t[i]
print(cnt)
| 1 | 119,911,080,250,462 | null | 261 | 261 |
N,M,K=map(int,input().split())
adj=[set() for _ in range(N)]
for _ in range(M):
A,B=map(int,input().split())
A,B=A-1,B-1
adj[A].add(B)
adj[B].add(A)
blk=[{*()} for _ in range(N)]
for _ in range(K):
A,B=map(int,input().split())
A,B=A-1,B-1
blk[A].add(B)
blk[B].add(A)
#print(adj)
#print(blk)
colors=[-1]*N
ct={}
color=-1
for u in range(N):
if colors[u]!=-1:
continue
color+=1
colors[u]=color
stk=[u]
while stk:
u=stk.pop()
ct[color]=ct.get(color,0)+1
for v in adj[u]:
if colors[v]==-1:
colors[v]=color
stk.append(v)
ans=[0]*N
for u in range(N):
c=colors[u]
k=ct[c]-1-len(adj[u])
for v in blk[u]:
if colors[v]==c:
k-=1
ans[u]=k
print(*ans)
|
class UnionFind():
def __init__(self, n):
self.parents = [-1]*n
def root(self, x):
if self.parents[x] < 0:
return x
else:
return self.root(self.parents[x])
def unite(self, x, y):
x = self.root(x)
y = self.root(y)
if x == y:
return
else:
if x > y:
x, y = y, x
self.parents[x] += self.parents[y]
self.parents[y] = x
return
n, m, k = map(int, input().split())
ab = [list(map(int, input().split())) for _ in range(m)]
cd = [list(map(int, input().split())) for _ in range(k)]
u = UnionFind(n)
f = [set() for _ in range(n)]
l = [set() for _ in range(n)]
for a, b in ab:
a, b = a-1, b-1
f[a].add(b)
f[b].add(a)
u.unite(a, b)
for c, d in cd:
c, d = c-1, d-1
l[c].add(d)
l[d].add(c)
ans = [0] * n
for i in range(n):
r = u.root(i)
bl = 0
for j in l[i]:
if u.root(j) == r:
bl += 1
ans[i] = -u.parents[r] - len(f[i]) - bl - 1
print(*ans)
| 1 | 61,703,003,303,088 | null | 209 | 209 |
from itertools import accumulate
n,k = map(int, input().split())
As = list(map(int, input().split()))
for i in range(k):
imos = [0] * (n+1)
for i,a in enumerate(As):
l = max(0, i-a)
r = min(n, i+a+1)
imos[l] += 1
imos[r] -= 1
acc = list(accumulate(imos))
# 指数関数的に増える
if acc[:-1] == As:
print(*As)
exit()
As = acc[:-1]
print(*As)
|
import sys
x,y = map(int,input().split())
for i in range(x+1):
for j in range(x-i+1):
if i+j == x and (i*2)+(j*4) == y:
print("Yes")
sys.exit()
print("No")
| 0 | null | 14,498,461,365,860 | 132 | 127 |
from _collections import deque
n,m,k=map(int,input().split())
fre=[[] for _ in range(n+1)]
bro=[[] for _ in range(n+1)]
for i in range(m):
a,b=map(int,input().split())
fre[a].append(b)
fre[b].append(a)
for i in range(k):
a, b = map(int, input().split())
bro[a].append(b)
bro[b].append(a)
ans=[]
x=[-1]*(n+1)
for i in range(1,n+1):
if x[i]==-1:
x[i]=i
data=deque([i])
while len(data)>0:
p=data.popleft()
for j in fre[p]:
if x[j]==-1:
x[j]=i
data.append(j)
g=[0]*(n+1)
for i in range(1,n+1):
g[x[i]]+=1
for i in range(1,n+1):
g[i]=g[x[i]]
for i in range(1,n+1):
aa=g[i]-1
aa-=len(fre[i])
for j in bro[i]:
if x[i]==x[j]:
aa-=1
ans.append(str(aa))
print(" ".join(ans))
|
#!usr/bin/env pypy3
from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations, accumulate
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI1(): return [int(x) - 1 for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS(): return [list(x) for x in sys.stdin.readline().split()]
def S():
res = list(sys.stdin.readline())
if res[-1] == "\n":
return res[:-1]
return res
def IR(n):
return [I() for i in range(n)]
def LIR(n):
return [LI() for i in range(n)]
def SR(n):
return [S() for i in range(n)]
def LSR(n):
return [LS() for i in range(n)]
sys.setrecursionlimit(1000000)
class UnionFind:
def __init__(self, n):
self._parent = [i for i in range(n)]
self._rank = [0 for _ in range(n)]
self._group_size = [1 for _ in range(n)]
self.num_of_groups = n
def find(self, x):
if self._parent[x] == x:
return x
px = self._parent[x]
root = self.find(px)
self._parent[x] = root
return root
def union(self, x, y):
px = self.find(x)
py = self.find(y)
if px == py:
return
if self._rank[px] < self._rank[py]:
self._parent[px] = py
self._group_size[py] += self._group_size[px]
else:
self._parent[py] = px
self._group_size[px] += self._group_size[py]
if self._rank[px] == self._rank[py]:
self._rank[py] += 1
self.num_of_groups -= 1
def is_same(self, x, y):
return self.find(x) == self.find(y)
def group_size(self, x):
px = self.find(x)
return self._group_size[px]
def main():
N, M, K = LI()
AB = [LI1() for _ in range(M)]
CD = [LI1() for _ in range(K)]
uf = UnionFind(N)
friend = [[] for _ in range(N)]
block = [[] for _ in range(N)]
for (a, b) in AB:
friend[a].append(b)
friend[b].append(a)
uf.union(a, b)
for (c, d) in CD:
block[c].append(d)
block[d].append(c)
for i in range(N):
gs = uf.group_size(i)
bc = 0
for bi in block[i]:
bc += int(uf.is_same(i, bi))
# print(i, gs, fc, bc)
print(gs - len(friend[i]) - bc - 1, end=" ")
main()
| 1 | 61,924,246,402,554 | null | 209 | 209 |
n,m=map(int,input().split())
s=input()
ans=[]
cursor=n
actualfail=0
while cursor!=0:
if cursor<=m:
ans.append(cursor)
break
failflag=1
for i in range(m):
if s[cursor-m+i]=='0':
failflag=0
ans.append(m-i)
cursor-=m-i
break
if failflag==1:
actualfail=1
break
if actualfail==1:
print(-1)
else:
ans.reverse()
for i in ans:
print(i)
|
import sys,bisect
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
def main():
# 区間加算、上書き、一点取得
class SegmentTree:
def __init__(self, n, ele, segfun):
#####単位元######要設定0or1orinf
self.ide_ele = ele
self.segfun = segfun
####################
self.n = n
self.N0 = 1 << n.bit_length()
self.data = [self.ide_ele] * (self.N0 * 2)
def update_add(self, l, r, val):
l += self.N0
r += self.N0
while l < r:
if l & 1:
self.data[l] += val
l += 1
if r & 1:
self.data[r - 1] += val
r -= 1
l //= 2
r //= 2
def update(self, l, r, val):
l += self.N0
r += self.N0
while l < r:
if l & 1:
self.data[l] = self.segfun(self.data[l], val)
l += 1
if r & 1:
self.data[r - 1] = self.segfun(self.data[r - 1], val)
r -= 1
l //= 2
r //= 2
def query(self, i):
i += len(self.data) // 2
ret = self.data[i]
while i > 0:
i //= 2
ret = self.segfun(ret, self.data[i])
return ret
N, D, A = map(int,readline().split())
X = [list(map(int,readline().split())) for _ in range(N)]
X.sort()
L = [0]*N
for i in range(N):
L[i] = X[i][0]
S = SegmentTree(N,0,lambda a, b: a+b)
ans = 0
for i,[x,h] in enumerate(X):
H = h - S.query(i)
if H<=0:
continue
ind = bisect.bisect(L,x+2*D)
need = (H-1)//A + 1
S.update(i,ind,need*A)
ans += need
print(ans)
return
if __name__ == '__main__':
main()
| 0 | null | 110,361,919,155,348 | 274 | 230 |
def bubbleSort(list_, n):
count = 0
for i in xrange(n):
for j in xrange(n-1, i, -1):
if list_[j] < list_[j - 1]:
list_[j], list_[j - 1] = list_[j - 1], list_[j]
count += 1
return count
n = input()
nums = map(int, raw_input().split())
count = bubbleSort(nums, n)
print ' '.join(map(str, nums))
print count
|
def bubble_sort(A):
count = 0
for i in reversed(range(len(A))):
for j in range(i):
if A[j] > A[j+1]:
temp = A[j]
A[j] = A[j+1]
A[j+1] = temp
count += 1
return count
N = int(input())
A = list(map(int,input().split()))
count = bubble_sort(A)
print(" ".join(map(str,A)))
print(count)
| 1 | 17,349,151,288 | null | 14 | 14 |
import sys
sys.setrecursionlimit(10**6)
a,b = map(int, input().split())
if a < 10 and b < 10:
print(a*b)
else:
print(-1)
|
def draw(h,w):
s = "#" * w
k = "#" + "." * (w-2) + "#"
print s
for i in range(0,h-2):
print k
print s
print
if __name__ == "__main__":
while True:
h,w = map(int, raw_input().split())
if h==0 and w==0:
break
else:
draw(h,w)
| 0 | null | 79,320,428,484,490 | 286 | 50 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.