code1
stringlengths 16
427k
| code2
stringlengths 16
427k
| similar
int64 0
1
| pair_id
int64 6.82M
181,637B
⌀ | question_pair_id
float64 101M
180,471B
⌀ | code1_group
int64 2
299
| code2_group
int64 2
299
|
|---|---|---|---|---|---|---|
num = map(int, raw_input().split(' '))
print num[0] * num[1], 2 * (num[0] + num[1]) | import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return map(int, input().split())
sys.setrecursionlimit(10**9)
N, K = mapint()
As = list(mapint())
mod = 10**9+7
pos = []
neg = []
for a in As:
if a>=0:
pos.append(a)
else:
neg.append(a)
pos.sort(reverse=True)
neg.sort()
ans = 1
lenp, lenn = len(pos), len(neg)
if (lenp+lenn)==K:
for a in As:
ans *= a
ans %= mod
print(ans)
elif lenn==0:
for i in range(K):
ans *= pos[i]
ans %= mod
print(ans)
elif lenp==0:
if K%2==0:
for i in range(K):
ans *= neg[i]
ans %= mod
print(ans)
else:
neg = neg[::-1]
for i in range(K):
ans *= neg[i]
ans %= mod
print(ans)
else:
p, n = 0, 0
while p+n+1<K:
if p+2<=lenp and n+2<=lenn:
if pos[p]*pos[p+1]>=neg[n]*neg[n+1]:
ans *= pos[p]
p += 1
else:
ans *= neg[n]*neg[n+1]
n += 2
elif n+2<=lenn:
ans *= neg[n]*neg[n+1]
n += 2
else:
ans *= pos[p]
p += 1
ans %= mod
if p+n<K:
ans *= pos[p]
ans %= mod
print(ans) | 0 | null | 4,810,990,336,088 | 36 | 112 |
def mod_pow(a, n):
res = 1
while n > 0:
if n & 1:
res = res * a % mod
a = a * a % mod
n >>= 1
return res
n = int(input())
a = list(map(int, input().split()))
mod = 10 ** 9 + 7
cnt = [0] * 60
for v in a:
for i in range(60):
if (v >> i) & 1:
cnt[i] += 1
pow_2 = [1]
for i in range(60):
pow_2.append(pow_2[-1] * 2 % mod)
res = 0
for v in a:
for i in range(60):
if (v >> i) & 1:
res = (res + (n - cnt[i]) * pow_2[i] % mod) % mod
else:
res = (res + cnt[i] * pow_2[i] % mod) % mod
print(res * mod_pow(2, mod - 2) % mod) | import numpy as np #numpyの練習がてら
n = int(input())
tmp = list(map(int,input().split()))
mod = 10**9 + 7
a = np.array(tmp,np.int64)
ans = 0
for i in range(60 + 1):
b = (a >> i) & 1 #すべてのaについて2**n乗目のビットが1か否か
iti = np.count_nonzero(b) #すべてのaのうち2**n乗目が1であるものの個数
zero = n - iti #同様に0であるものの個数
ans += (iti * zero) * pow(2,i,mod) % mod#片方1で片方0なら1なので1の個数×0の個数
ans %= mod
print(ans)
| 1 | 123,208,489,436,458 | null | 263 | 263 |
k,n=map(int,input().split())
a=[int(i) for i in input().split()]
saitanhiku=a[2]-a[1]
for i in range(n-1):
if a[i+1]-a[i]>=saitanhiku:
saitanhiku=a[i+1]-a[i]
if (k-a[n-1])+a[0]>=saitanhiku:
saitanhiku=k-a[n-1]+a[0]
print(k-saitanhiku) | #!/usr/bin/env python3
import sys
YES = "Yes" # type: str
NO = "No" # type: str
def solve(S: str):
if S[2] == S[3] and S[4] == S[5]:
print(YES)
else:
print(NO)
return
# Generated by 1.1.7.1 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()
S = next(tokens) # type: str
solve(S)
if __name__ == '__main__':
main()
| 0 | null | 42,569,903,716,508 | 186 | 184 |
import math
k = int(input())
ans = 0
for h in range(1, k+1):
for i in range(1, k+1):
g = math.gcd(h, i)
for j in range(1, k+1):
ans += math.gcd(g, j)
print(ans) | rooms = []
rooms.append([[0 for i in range(10)] for j in range(3)])
rooms.append([[0 for i in range(10)] for j in range(3)])
rooms.append([[0 for i in range(10)] for j in range(3)])
rooms.append([[0 for i in range(10)] for j in range(3)])
num = int(raw_input())
for i in range(num):
b,f,r,v = map(int, raw_input().split())
rooms[b-1][f-1][r-1] += v
for number, room in enumerate(rooms):
for row in room:
print " %d %d %d %d %d %d %d %d %d %d" % (row[0], row[1], row[2], row[3], row[4], row[5], row[6], row[7], row[8], row[9])
if len(rooms) - 1 > number:
print('####################') | 0 | null | 18,422,505,105,432 | 174 | 55 |
import sys, itertools
print(len(set(itertools.islice(sys.stdin.buffer, 1, None)))) | chars = [c for c in input()]
print('Yes' if chars[2] == chars[3] and chars[4] == chars[5] else 'No') | 0 | null | 36,353,324,458,568 | 165 | 184 |
S = input()
K = int(input())
if S[0] != S[-1]:
ans = 0
for i in range(len(S) - 1):
if S[i] == S[i + 1]:
S = S[:i + 1] + '*' + S[i + 2:]
ans += 1
print(ans * K)
else:
# S -> s_1 s_2 ... s_k + A + t_l t_l-1 ... t_1 (s_i = t_j)と分解
k, l = 0, len(S) - 1
while k < len(S) and S[k] == S[-1]:
k += 1
while l > -1 and S[l] == S[0]:
l -= 1
# 連結に関係ない部分のカウント
A = S[k:l + 1]
ans = 0
for i in range(len(A) - 1):
if A[i + 1] == A[i]:
A = A[:i + 1] + '*' + A[i + 2:]
ans += 1
ans *= K
# 連結に関係ある部分のカウント
if l == -1 and k == len(S):
# 全部同じ
print((len(S) * K) // 2)
else:
ans += (len(S) - l + k - 1) // 2 * (K - 1)
ans += (len(S) - l - 1) // 2 + k // 2
print(ans)
| S = list(input())
K = int(input())
S1 = list(S)
cnt1 = 0
for i in range(1, len(S1)):
if S1[i] == S1[i - 1]:
S1[i] = '*'
cnt1 += 1
S2 = list(S) * 2
cnt2 = 0
for i in range(1, len(S2)):
if S2[i] == S2[i - 1]:
S2[i] = '*'
cnt2 += 1
S3 = list(S) * 3
cnt3 = 0
for i in range(1, len(S3)):
if S3[i] == S3[i - 1]:
S3[i] = '*'
cnt3 += 1
# print("#", S1, S2, S3)
# print("#", cnt1, cnt2, cnt3)
ans = cnt1 + (cnt2 - cnt1) * (K // 2) + (cnt3 - cnt2) * ((K - 1) // 2)
print(ans)
| 1 | 175,252,980,718,182 | null | 296 | 296 |
cards = list()
pattern = ["S", "H", "C","D"]
n = int(input())
for i in range(n) :
s, r = input().split() #文字列として読み込み
r = int(r) #sは文字列、rは数値
if(s == "S") :
cards.append(0 + r)
elif(s == "H") :
cards.append(13 + r)
elif(s == "C") :
cards.append(26 + r)
else :
cards.append(39 + r)
for i in range(1, 53) :
if not(i in cards) :
print(pattern[(i - 1) // 13], (i - 1) % 13 + 1)
| 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)) | 1 | 1,036,362,727,168 | null | 54 | 54 |
N = int(input())
S = list(input())
R = []
G = []
for i in range(N):
if S[i] == "R":
R.append(i)
elif S[i] == "G":
G.append(i)
r = len(R)
g = len(G)
ans = r * g * (N - r - g)
for i in R:
for j in G:
a = 2 * i - j
b = 2 * j - i
c = i + j
if 0 <= a < N and S[a] == "B":
ans -= 1
if 0 <= b < N and S[b] == "B":
ans -= 1
if c % 2 == 0 and S[c//2] == "B":
ans -= 1
print(ans) | cnt = 0
s = input().lower()
while 1:
line = input()
if line == "END_OF_TEXT":
break
for w in line.lower().split():
if w == s:
cnt+=1
print(cnt) | 0 | null | 18,833,603,517,622 | 175 | 65 |
n, a, b = map(int,input().split())
M = 10**9+7
Answer = pow(2,n,M)-1
factorial=1
for i in range(1,a+1):
factorial = (factorial*(n+1-i)*pow(i,M-2,M))%M
Answer -= factorial%M
factorial =1
for j in range(1,b+1):
factorial = (factorial*(n+1-j)*pow(j,M-2,M))%M
Answer -= factorial%M
Answer = Answer%M
print(Answer) | def modinv(a, m):
b = m
u = 1
v = 0
while b:
t = a // b
a -= t * b
a, b = b, a
u -= t * v
u, v = v, u
u %= m
if u < 0:
u += m
return u
def nCk(N, k, mod):
ret_val = 1
for i in range(k):
ret_val *= (N - i)
ret_val %= mod
ret_val *= modinv(i + 1, mod)
ret_val %= mod
return ret_val
n, a, b = map(int, input().split())
MOD = 10 ** 9 + 7
all_cnt = pow(2, n, MOD) - 1
a_cnt = nCk(n, a, MOD)
b_cnt = nCk(n, b, MOD)
ans = all_cnt - a_cnt - b_cnt
print(ans % MOD) | 1 | 66,016,408,070,108 | null | 214 | 214 |
import os, sys, re, math
N = int(input())
D = [int(n) for n in input().split()]
value = 0
for i in range(len(D) - 1):
for j in range(i + 1, len(D)):
value += D[i] * D[j]
print(value)
| import itertools
n = int(input())
d = list(map(int,input().split()))
ans = 0
for v in itertools.combinations(d, 2):
ans += v[0]*v[1]
print(ans) | 1 | 168,464,304,734,680 | null | 292 | 292 |
def mergeSort(A,left,right,B):
if left + 1 < right:
mid = (left+right)//2
mergeSort(A,left,mid,B)
mergeSort(A,mid,right,B)
merge(A,left,mid,right,B)
def merge(A,left,mid,right,B):
L = A[left:mid]
R = A[mid:right]
L.append(1000000000)
R.append(1000000000)
i = 0
j = 0
for k in range(left,right):
B.append(1)
if L[i] < R[j]:
A[k] = L[i]
i += 1
else:
A[k] = R[j]
j += 1
n = int(input())
nums = list(map(int,input().split(" ")))
B = []
mergeSort(nums,0,n,B)
print(' '.join(map(str,nums)))
print(str(len(B)))
| def main():
n = input()
A = map(int,raw_input().split())
c = mergeSort(A,0,n)
for i in range(n-1):
print A[i],
print A[-1]
print c
def merge(A,left,mid,right):
n1 = mid - left
n2 = right - mid
L = [A[left+i] for i in range(n1)]
L += [float("inf")]
R = [A[mid+i] for i in range(n2)]
R += [float("inf")]
i = 0
j = 0
for k in range(left,right):
if L[i] <= R[j]:
A[k] = L[i]
i += 1
else:
A[k] = R[j]
j += 1
return i+j
def mergeSort(A,left,right):
if left+1 < right:
mid = (left+right)/2
k1 = mergeSort(A,left,mid)
k2 = mergeSort(A,mid,right)
k3 = merge(A,left,mid,right)
return k1+k2+k3
else:
return 0
if __name__ == "__main__":
main() | 1 | 112,462,943,268 | null | 26 | 26 |
n = int(input())
table = list(map(int, input().split()))
data_max = max(table)
data_min = min(table)
data_sum = sum(table)
print(data_min, data_max, data_sum)
| b = input()
a = input().split()
for i in range(len(a)):
a[i] = int(a[i])
max_a = max(a)
min_a = min(a)
Sum = sum(a)
print(min_a,max_a,Sum)
| 1 | 728,079,351,720 | null | 48 | 48 |
N, K = map(int, input().split())
A = list(map(int, input().split()))
A_neg = []
A_pos = []
for i in range(N):
if A[i] <= 0:
A_neg.append(-A[i])
else:
A_pos.append(A[i])
A_neg.sort(reverse=True)
A_pos.sort(reverse=True)
ans = 1
if K == N:
for i in range(N):
ans *= (A[i]%1000000007)
ans %= 1000000007
print(ans)
elif K%2==1 and len(A_pos)==0:
for i in range(1, K+1):
ans *= ((-A_neg[-i])%1000000007)
ans %= 1000000007
print(ans)
else:
if K%2==1:
ans *= A_pos.pop(0)
K -= 1
buf = []
if len(A_pos)>=2:
for i in range(len(A_pos)//2):
buf.append(A_pos[2*i]*A_pos[2*i+1])
if len(A_neg)>=2:
for i in range(len(A_neg)//2):
buf.append(A_neg[2*i]*A_neg[2*i+1])
buf.sort(reverse=True)
for i in range(K//2):
ans *= (buf[i]%1000000007)
ans %= 1000000007
print(ans)
| K=int(input())
l=list(input())
c=0
for i in range(K-2):
if l[i]=="A":
if l[i+1]=="B":
if l[i+2]=="C":
c+=1
print(c) | 0 | null | 54,431,870,278,872 | 112 | 245 |
import sys
sys.setrecursionlimit(10**7)
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return map(int,sys.stdin.readline().rstrip().split())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split())) #空白あり
def LI2(): return list(map(int,sys.stdin.readline().rstrip())) #空白なし
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split()) #空白あり
def LS2(): return list(sys.stdin.readline().rstrip()) #空白なし
N,K = MI()
p = LI()
p.sort()
print(sum(p[i] for i in range(K)))
| #create date: 2020-06-30 22:48
import sys
stdin = sys.stdin
from itertools import product
def ns(): return stdin.readline().rstrip()
def ni(): return int(ns())
def na(): return list(map(int, stdin.readline().split()))
def main():
n = ni()
t = [[-1] * n for _ in range(n)]
for j in range(n):
a = ni()
for i in range(a):
x, y = na()
t[j][x-1] = y
l = list(product([0, 1], repeat=n))
ans = 0
#print(t)
for li in l:
f = True
for i in range(n):
people = li[i]
if people:
for j in range(n):
if t[i][j] == 1 and li[j] == 0:
f = False
if t[i][j] == 0 and li[j] == 1:
f = False
if f:
#print(li, f)
ans = max(ans, sum(li))
print(ans)
if __name__ == "__main__":
main() | 0 | null | 66,679,701,297,230 | 120 | 262 |
import sys
import itertools
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
in_n = lambda: int(readline())
in_nn = lambda: map(int, readline().split())
in_nl = lambda: list(map(int, readline().split()))
in_na = lambda: map(int, read().split())
in_s = lambda: readline().rstrip().decode('utf-8')
def main():
N = in_n()
ans = []
def dfs(s):
if len(s) == N:
ans.append(s)
return
maxs = max(map(ord, s))
for i in range(ord('a'), maxs + 2):
dfs(s + chr(i))
dfs('a')
print('\n'.join(sorted(ans)))
if __name__ == '__main__':
main()
| from collections import defaultdict
m = defaultdict(int)
n = int(input())
for _ in range(n):
b, f, r, v = map(int, input().split())
m[(b, f, r)] += v
for b in range(1, 5):
for f in range(1, 4):
for r in range(1, 11):
print("", m[(b, f, r)], end="")
print("")
if b < 4:
print("####################")
| 0 | null | 26,885,998,665,922 | 198 | 55 |
import math
from decimal import Decimal, getcontext
a,b,c = map(int, input().split())
t = c-a-b
if t <= 0:
print('No')
exit()
if 4*a*b < t*t:
print('Yes')
else:
print('No') | def solve(XL, N):
XL.sort(key=lambda x:x[1])
count = N
for i in range(1, N):
if XL[i][0] < XL[i-1][1]:
XL[i][1] = XL[i-1][1]
count -= 1
return count
N = int(input())
XL = []
for i in range(N):
x, l = map(int, input().split(' '))
XL.append([x-l, x+l])
print(solve(XL, N)) | 0 | null | 70,788,433,978,472 | 197 | 237 |
n = int(input())
x = list(map(int, input().split()))
ans = x[0]
if 0 in x:
ans = 0
else:
for i in range(1,n):
ans = ans * x[i]
if ans > 10 ** 18:
ans = -1
break
print(ans) | # -*- coding: utf-8 -*-
import sys
lines = sys.stdin.readlines()
l = 0
while not ("-" in lines[l]):
s = lines[l].replace('\n','')
n = int(lines[l+1])
l += 2
t = sum(map(int, lines[l:l+n])) % len(s)
print s[t:]+s[:t]
l += n | 0 | null | 9,057,005,472,902 | 134 | 66 |
n=int(input())
s,t=input().split()
for i in range(n): print(s[i]+t[i],end="") | N = int(input())
S, T = input().split()
A = ""
for i in range(N):
A += S[i] + T[i]
print(A) | 1 | 112,117,599,572,992 | null | 255 | 255 |
#!/usr/bin/env python3
import statistics
import sys
def main():
while True:
n = int(sys.stdin.readline())
if n == 0:
sys.exit(0)
print(statistics.pstdev([int(num) for num
in sys.stdin.readline().split()]))
if __name__ == '__main__':
main() | import sys
input_methods=['clipboard','file','key']
using_method=0
input_method=input_methods[using_method]
tin=lambda : map(int, input().split())
lin=lambda : list(tin())
mod=1000000007
#+++++
def main():
k = int(input())
#b , c = tin()
#s = input()
l=['_']*50
l[0]=0
for _ in range(k):
for i, v in enumerate(l):
l[i]+=1
if l[i] == 10 and l[i+1]=='_':
l[i+1]=1
l[:i+1]=[0]*(i+1)
break
elif l[i] == 10:
l[i]=l[i+1]
elif l[i+1]=='_':
#l[:i]=[l[i]-1]*(i)
for j in range(1,i+1):
l[i-j]=max(0, l[i-j+1]-1)
break
elif l[i] <= l[i+1]+1:
#l[:i]=[l[i]-1]*i
for j in range(1,i+1):
l[i-j]=max(0, l[i-j+1]-1)
break
#print(*l)
print(''.join([str(c) for c in l[::-1] if c != '_']))
#+++++
isTest=False
def pa(v):
if isTest:
print(v)
def input_clipboard():
import clipboard
input_text=clipboard.get()
input_l=input_text.splitlines()
for l in input_l:
yield l
if __name__ == "__main__":
if sys.platform =='ios':
if input_method==input_methods[0]:
ic=input_clipboard()
input = lambda : ic.__next__()
elif input_method==input_methods[1]:
sys.stdin=open('inputFile.txt')
else:
pass
isTest=True
else:
pass
#input = sys.stdin.readline
ret = main()
if ret is not None:
print(ret) | 0 | null | 20,245,297,296,980 | 31 | 181 |
#akash mandal: jalpaiguri government engineering college
import sys,math
def ii(): return int(input())
def mii(): return map(int,input().split())
def lmii(): return list(mii())
def main():
A,B,C=mii()
print("Yes" if B*C>=A else "No")
if __name__=="__main__":
main() | D,T,S=map(int,input().split())
print("Yes" if D<=T*S else "No") | 1 | 3,514,739,937,630 | null | 81 | 81 |
s = int(input())
print(s**2)
| def main():
r = int(input())
print(r * r)
main() | 1 | 144,658,607,840,890 | null | 278 | 278 |
n = int(input())
st = input()
ans = 1
for i in range(n-1):
if st[i] != st[i+1]:
ans += 1
print(ans)
| N = int(input())
D = list(map(int, input().split(" ")))
mod = 998244353
count = [0 for i in range(N)]
for i in range(N):
count[D[i]] += 1
max_dist = max(D)
ans = count[0]
for i in range(1, max_dist + 1):
ans *= (count[i - 1] ** count[i]) % mod
ans %= mod
if count[0] > 1 or D[0] != 0:
ans = 0
print(ans % 998244353) | 0 | null | 162,288,475,912,420 | 293 | 284 |
import sys
input = sys.stdin.readline
INF = float('inf')
def main():
S, T = map(str, input().split())
print(T + S)
if __name__ == '__main__':
main()
| def main():
S, T = input().split()
print(T + S)
main() | 1 | 102,962,055,284,792 | null | 248 | 248 |
W,H,x,y,r = map(int, raw_input().split(" "))
result = ""
if x-r < 0 or y-r < 0:
result = "No"
elif x+r > W or y+r > H:
result = "No"
else:
result = "Yes"
print result | n=int(input())
list=list(map(int,input().split(" ")))
list.reverse()
for i in range(n-1):
print(str(list[i])+" ",end="")
print(str(list[n-1]))
| 0 | null | 702,799,638,492 | 41 | 53 |
l=list(map(int,input().split()))
l.sort()
if l[0]==l[1]==l[2] or l[0]!=l[1]!=l[2]:
print("No")
else:
print("Yes")
| a, b, c = map(int, raw_input().split(" "))
cnt = 0
for i in range(a, b + 1) :
if (c % i == 0) :
cnt += 1
print cnt | 0 | null | 34,292,377,694,470 | 216 | 44 |
a,b,c=sorted(map(int,input().split()))
print(a,b,c) | class Dice(object):
def __init__(self, s1, s2, s3, s4, s5, s6):
self.s1 = s1
self.s2 = s2
self.s3 = s3
self.s4 = s4
self.s5 = s5
self.s6 = s6
def east(self):
prev_s6 = self.s6
self.s6 = self.s3
self.s3 = self.s1
self.s1 = self.s4
self.s4 = prev_s6
def west(self):
prev_s6 = self.s6
self.s6 = self.s4
self.s4 = self.s1
self.s1 = self.s3
self.s3 = prev_s6
def north(self):
prev_s6 = self.s6
self.s6 = self.s5
self.s5 = self.s1
self.s1 = self.s2
self.s2 = prev_s6
def south(self):
prev_s6 = self.s6
self.s6 = self.s2
self.s2 = self.s1
self.s1 = self.s5
self.s5 = prev_s6
def rotate(self):
prev_s2 = self.s2
self.s2 = self.s4
self.s4 = self.s5
self.s5 = self.s3
self.s3 = prev_s2
def top(self):
return self.s1
def front(self):
return self.s2
def right(self):
return self.s3
s1, s2, s3, s4, s5, s6 = map(int, input().split())
dice = Dice(s1, s2, s3, s4, s5, s6)
q = int(input())
for i in range(q):
t, f = map(int, input().split())
flag = False
for j in range(6):
if j % 2 == 0:
dice.north()
else:
dice.west()
for k in range(4):
dice.rotate()
if dice.top() == t and dice.front() == f:
flag = True
break
if flag:
break
print(dice.right()) | 0 | null | 329,342,275,360 | 40 | 34 |
import sys
from collections import deque
def main():
N, p, q, *AB = map(int, sys.stdin.buffer.read().split())
p -= 1
q -= 1
G = [[] for _ in range(N)]
for a, b in zip(*[iter(AB)] * 2):
G[a - 1].append(b - 1)
G[b - 1].append(a - 1)
if len(G[p]) == 1 and G[p][0] == q:
print(0)
return
dist1 = [-1] * N
dist1[p] = 0
queue = deque([p])
while queue:
v = queue.popleft()
for nv in G[v]:
if dist1[nv] == -1:
dist1[nv] = dist1[v] + 1
queue.append(nv)
dist2 = [-1] * N
dist2[q] = 0
queue = deque([q])
while queue:
v = queue.popleft()
for nv in G[v]:
if dist2[nv] == -1:
dist2[nv] = dist2[v] + 1
queue.append(nv)
max_d = 0
for d1, d2 in zip(dist1, dist2):
if d1 < d2 and max_d < d2:
max_d = d2
print(max_d - 1)
return
if __name__ == '__main__':
main()
| oc, cap, time = map(int, input().split())
cnt = 0
while oc>0:
oc -= cap
cnt += time
print(cnt)
| 0 | null | 60,699,321,048,310 | 259 | 86 |
import bisect
import sys
input = sys.stdin.readline
def solve():
N = int(input())
S = list(input())
Q = int(input())
set_dic = {}
for i, s in enumerate(S):
if s not in set_dic:
set_dic[s] = [i+1]
else:
bisect.insort_left(set_dic[s], i+1)
anslist = []
for _ in range(Q):
query1, query2, query3 = input().split()
if query1 == "1":
i = int(query2)
c = query3
cap = S[i-1]
if cap == c:
continue
set_dic[cap].remove(i)
if c not in set_dic:
set_dic[c] = [i]
else:
bisect.insort_left(set_dic[c], i)
S[i-1] = c
else:
l = int(query2)
r = int(query3)
ansset = set()
ans = 0
for eachlist in set_dic.values():
li = bisect.bisect_left(eachlist, l)
ri = bisect.bisect_right(eachlist, r)
if li != ri:
ans += 1
anslist.append(ans)
for i in anslist:
print(i)
if __name__ == '__main__':
solve() | import sys
from collections import defaultdict
from math import gcd
def input(): return sys.stdin.readline().strip()
mod = 1000000007
def main():
N = int(input())
fish = defaultdict(int)
"""
b / aで値を管理するのは浮動小数点誤差が怖いので、
g = gcd(a, b) として(a//g, b//g)のタプルで管理するのが良い。
"""
zero = 0
for _ in range(N):
a, b = map(int, input().split())
if a == 0 and b == 0: zero += 1
elif a == 0: fish[(0, 1)] += 1
elif b == 0: fish[(1, 0)] += 1
else:
g = gcd(a, b)
if a < 0: a, b = -a, -b
fish[(a // g, b // g)] += 1
#print(fish)
"""
仲の悪い組を(S1, T1), (S2, T2),...とすれば(Si, Ti)からの魚の選び方と
(Sj, Tj)からの魚の選び方は独立じゃん。
なぜ気づかなかったのか。。。
"""
ans = 1
finished = set([])
for a, b in fish:
if (a, b) in finished: continue
finished.add((a, b))
s = fish[(a, b)]
if b > 0:
t = fish[(b, -a)] if (b, -a) in fish else 0
finished.add((b, -a))
else:
t = fish[(-b, a)] if (-b, a) in fish else 0
finished.add((-b, a))
ans *= pow(2, s, mod) + pow(2, t, mod) - 1
ans %= mod
#print("(a, b)=({}, {}) -> s={}, t={}, val={}".format(a, b, s, t, pow(2, s, mod) + pow(2, t, mod) - 1))
print((ans + zero - 1) % mod)
if __name__ == "__main__":
main()
| 0 | null | 41,648,844,208,608 | 210 | 146 |
N_str, q_str = raw_input().split()
N = int(N_str)
q = int(q_str)
A =[]
B =[]
total =0
for i in range(N):
t = raw_input().split()
A.append([t[0],int(t[1])])
while A:
name, time = A.pop(0)
if time <= q:
total += time
B.append(name+" "+ str(total))
else:
time -= q
total += q
A.append([name, time])
print '\n'.join(B) | N,X,T = map(int,input().split())
num = N//X
mode = N%X
if mode == 0:
print(num * T)
else:
print((num + 1)*T) | 0 | null | 2,132,105,200,068 | 19 | 86 |
billdings = [[[0 for _ in range(10)] for _ in range(3)] for _ in range(4)]
def printstate(billdings):
"""
for billnum, billding in enumerate(billdings):
for flooor in billding:
for room in flooor:
print(" {}".format(room), end="")
print()
print("#"*20 if billnum != len(billdings)-1 else "")
"""
for i in range(len(billdings)):
for j in range(len(billdings[0])):
for k in range(len(billdings[0][0])):
print(" "+str(billdings[i][j][k]), end="")
print()
if i != len(billdings)-1:
print("#"*20)
n = int(input())
for _ in range(n):
b, f, r, v = map(int, input().split())
b, f, r = b-1, f-1, r-1
billdings[b][f][r] += v
printstate(billdings)
| rooms = [0] * (4*3*10)
n = input();
for i in xrange(n):
b,f,r,v = map(int, raw_input().split())
rooms[(b-1)*30+(f-1)*10+(r-1)] += v
sep = "#" * 20
for b in xrange(4):
for f in xrange(3):
t = 30*b + 10*f
print ""," ".join(map(str, rooms[t:t+10]))
if b < 3: print sep | 1 | 1,125,892,763,578 | null | 55 | 55 |
n = int(input())
A = [*map(int, input().split())] + [0]
dp_yen = [0]*(n+1)
dp_yen[0] = 1000
for day in range(n):
dp_yen[day+1] = max(dp_yen[day], dp_yen[day] + (A[day+1] - A[day]) * (dp_yen[day] // A[day]))
print(dp_yen[n])
| H,N=map(int,input().split())
A=sorted(list(map(int,input().split())))
for i in range(1,N+1):
H-=A[-i]
if H<=0:
print('Yes')
exit()
print('No') | 0 | null | 42,559,141,252,640 | 103 | 226 |
n=int(input())
s=list(map(int,input().split()))
ans=0
j=1
for i in s:
if i!=j :
ans+=1
else:
j+=1
print(ans) if ans<n else print(-1)
| p = 10**9+7
def pow(x,m):
if m==0:
return 1
if m==1:
return x
if m%2==0:
return (pow(x,m//2)**2)%p
else:
return (x*(pow(x,(m-1)//2)**2)%p)%p
n,a,b = map(int,input().split())
A = [1 for _ in range(2*10**5+1)]
for i in range(2,2*10**5+1):
A[i] = (A[i-1]*i)%p
B = [1 for _ in range(2*10**5+1)]
B[2*10**5] = pow(A[2*10**5],p-2)
for i in range(2*10**5-1,1,-1):
B[i] = (B[i+1]*(i+1))%p
cnt = pow(2,n)-1
cnt1 = 1
for i in range(a):
cnt1 = (cnt1*(n-i))%p
cnt1 = (cnt1*B[a])%p
cnt2 = 1
for i in range(b):
cnt2 = (cnt2*(n-i))%p
cnt2 = (cnt2*B[b])%p
cnt = (cnt-cnt1-cnt2)%p
print(cnt) | 0 | null | 90,780,643,746,290 | 257 | 214 |
(a, b) = tuple([int(i) for i in input().split(' ')])
d = int(a / b)
r = a % b
f = a / b
print('{0} {1} {2:.8f}'.format(d, r, f)) | n=int(input())
a=[]
b=[]
for i in range(n):
x,y=map(int,input().split())
a.append(x+y)
b.append(x-y)
a=sorted(a)
b=sorted(b)
ans=max(a[-1]-a[0],b[-1]-b[0])
print(ans) | 0 | null | 1,984,353,498,868 | 45 | 80 |
from collections import deque
def main():
N,M,*AB=map(int,open(0).read().split())
g=[[] for _ in range(N+1)]
for a,b in zip(*[iter(AB)]*2):
g[a].append(b)
g[b].append(a)
q=deque([1])
s=[0]*(N+1)
s[1]=1
while q:
u=q.popleft()
for v in g[u]:
if not s[v]:
s[v] = u
q.append(v)
print("Yes")
print("\n".join(map(str, s[2:])))
if __name__ == "__main__":
main() | import math
r = float(raw_input())
print str("{:.10f}".format(r*r*math.pi)) + ' ' + str("{:.10f}".format(2*r*math.pi)) | 0 | null | 10,680,633,427,900 | 145 | 46 |
# -*- coding:utf-8 -*-
N,K = map(int,input().split())
ans = N % K
if abs(ans - K) < ans:
ans = abs(ans - K)
print(ans) | N,K=map(int,input().split())
if N==K:
print(0)
elif N<K:
lis1=[N,abs(N-K)]
print(min(lis1))
else:
lis2=[N%K,abs(N%K-K)]
print(min(lis2))
| 1 | 39,611,453,898,368 | null | 180 | 180 |
def main():
from sys import stdin
def input():
return stdin.readline().strip()
r, c, k = map(int, input().split())
v = [[0] * c for _ in range(r)]
for _ in range(k):
i, j, k = map(int, input().split())
v[i-1][j-1] = k
# dp[j][n] = j列にいて、n個itemを拾った時のアイテムの価値の合計の最大値
# 1行ずつdpを更新する
# 0行目
value = v[0][0]
if value == 0:
dp = [[0] * 4]
else:
dp = [[0, value, value, value]]
for j in range(1, c):
value = v[0][j]
if value == 0:
dp.append(dp[j-1])
continue
a = dp[j-1].copy()
b = [0, a[0]+value, a[1]+value, a[2]+value]
for k in range(1, 4):
if a[k] < b[k]:
a[k] = b[k]
dp.append(a)
# i行目
for i in range(1, r):
pre = dp[0][3]
value = v[i][0]
if value == 0:
new_dp = [[pre] * 4]
else:
new_dp = [[pre, pre+value, pre+value, pre+value]]
for j in range(1, c):
value = v[i][j]
if value == 0:
a = new_dp[j-1].copy()
b = [dp[j][3]] * 4
for k in range(4):
if a[k] < b[k]:
a[k] = b[k]
new_dp.append(a)
else:
a = new_dp[j-1].copy()
pre = dp[j][3]
b = [pre, pre+value, pre+value, pre+value]
d = [a[0], a[0]+value, a[1]+value, a[2]+value]
for k in range(4):
if a[k] < b[k]:
a[k] = b[k]
if a[k] < d[k]:
a[k] = d[k]
new_dp.append(a)
dp = new_dp
print(dp[c-1][3])
main() | import sys
input = sys.stdin.readline
R, C, K = map(int, input().split())
values = [[0]*C for _ in range(R)]
for _ in range(K):
r, c, v = map(int, input().split())
values[r-1][c-1] = v
dp = [[[0 for _ in range(C+1)] for _ in range(R+1)] for _ in range(4)]
for r in range(R-1, -1, -1):
# dp[0][r][C - 1] = dp[3][r + 1][C - 1]
# for i in range(1, 4):
# dp[i][r][C-1] = dp[3][r + 1][C-1][3]+values[r][C-1]
for c in range(C-1, -1, -1):
v = values[r][c]
for i in range(4):
if i == 0 or v == 0:
dp[i][r][c] = max(dp[3][r+1][c], dp[i][r][c+1])
else:
dp[i][r][c] = max(dp[3][r + 1][c]+v, dp[i][r][c + 1], dp[i-1][r][c + 1] + v)
print(dp[3][0][0])
| 1 | 5,545,365,360,298 | null | 94 | 94 |
n,m = map(int,input().split())
h = list(map(int,input().split()))
flg = [1]*n
for _ in range(m):
a,b = map(int,input().split())
if h[a-1] > h[b-1]:
flg[b-1] = 0
elif h[a-1] == h[b-1]:
flg[a-1],flg[b-1] = 0,0
else:
flg[a-1] = 0
print(flg.count(1)) | a = str(input().split())
b = list(a)
if b[4] == b[5] and b[7] == b[6]:
print("Yes")
else :
print("No") | 0 | null | 33,426,011,432,928 | 155 | 184 |
n = int(input())
table = list(map(int,input().split()))
table.sort()
print(table[0],table[-1],sum(table))
| n=int(input())
p=list(map(int,input().split()))
min_val=10**18
ans=0
for i in range(n):
if i==0:
min_val=p[i]
ans+=1
continue
if min_val>=p[i]:
min_val=p[i]
ans+=1
print(ans)
| 0 | null | 43,311,495,152,420 | 48 | 233 |
N = int(input())
BOX = {}
for i in range(N):
S = input()
if S in BOX:
BOX[S] = (BOX[S] + 1)
else:
BOX[S] = 0
MAX = max(BOX.values())
keys = [k for k, v in BOX.items() if v == MAX]
keys = sorted(keys)
for i in range(len(keys)):
print(keys[i])
| N=int(input())
S={}
for n in range(N):
s=input()
S[s]=S.get(s,0)+1
maxS=max(S.values())
S=[k for k,v in S.items() if v==maxS]
print('\n'.join(sorted(S)))
| 1 | 69,544,133,892,442 | null | 218 | 218 |
import sys
from collections import defaultdict
readline = sys.stdin.buffer.readline
#sys.setrecursionlimit(10**8)
def geta(fn=lambda s: s.decode()):
return map(fn, readline().split())
def gete(fn=lambda s: s.decode()):
return fn(readline().rstrip())
def main():
a, b = geta(int)
print(max(0, a - 2 * b))
if __name__ == "__main__":
main() | a,b = map(int,input().split())
if a > b * 2:
print(a - b * 2)
elif a <= b * 2:
print(0) | 1 | 167,027,280,151,568 | null | 291 | 291 |
k=int(input())
if k%2==0 or k%5==0:
print(-1)
exit()
ans=1
num=7
while num%k!=0:
num=10*num+7
num%=k
ans+=1
print(ans) | k = int(input())
if(k%2 == 0 or k%5 == 0):
print('-1')
else:
if(k%7 == 0):
k = k // 7
num = 1
ans = 1
while(True):
if(num%k == 0):
print(ans)
break
else:
num %= k
num *= 10
num += 1
ans += 1
| 1 | 6,085,469,794,160 | null | 97 | 97 |
import sys
def I(): return int(sys.stdin.readline().rstrip())
def LS2(): return list(sys.stdin.readline().rstrip()) #空白なし
N = I()
S = LS2()
ans = 0
for i in range(N-2):
if S[i] == 'A' and S[i+1] == 'B' and S[i+2] == 'C':
ans += 1
print(ans) | N = int(input())
Ss = input().rstrip()
ans = Ss.count('ABC')
print(ans)
| 1 | 99,428,556,018,260 | null | 245 | 245 |
#
# m_solutions2020 b
#
import sys
from io import StringIO
import unittest
class TestClass(unittest.TestCase):
def assertIO(self, input, output):
stdout, stdin = sys.stdout, sys.stdin
sys.stdout, sys.stdin = StringIO(), StringIO(input)
resolve()
sys.stdout.seek(0)
out = sys.stdout.read()[:-1]
sys.stdout, sys.stdin = stdout, stdin
self.assertEqual(out, output)
def test_入力例_1(self):
input = """7 2 5
3"""
output = """Yes"""
self.assertIO(input, output)
def test_入力例_2(self):
input = """7 4 2
3"""
output = """No"""
self.assertIO(input, output)
def resolve():
A, B, C = map(int, input().split())
K = int(input())
for i in range(K):
if A >= B:
B *= 2
elif B >= C:
C *= 2
if A < B < C:
print("Yes")
break
else:
print("No")
if __name__ == "__main__":
# unittest.main()
resolve()
| A,B,C=map(int,input().split())
K=int(input())
ans="No"
for _ in range(K+1):
if A>=B:
B*=2
elif B>=C:
C*=2
else:
ans="Yes"
print(ans)
| 1 | 6,903,033,465,900 | null | 101 | 101 |
s = list(input())
q = int(input())
rvs = []
i = 0
j = 0
p = []
order = []
for i in range(q):
order.append(input().split())
if order[i][0] == "replace":
p = []
p = list(order[i][3])
for j in range(int(order[i][1]), int(order[i][2]) + 1):
s[j] = p[j - int(order[i][1])]
elif order[i][0] == "reverse":
ss = "".join(s[int(order[i][1]):int(order[i][2]) + 1])
rvs = list(ss)
rvs.reverse()
for j in range(int(order[i][1]), int(order[i][2]) + 1):
s[j] = rvs[j - int(order[i][1])]
# temp = s[int(order[i][1])]
# s[int(order[i][1])] = s[int(order[i][2])]
# s[int(order[i][2])] = temp
elif order[i][0] == "print":
ss = "".join(s)
print("%s" % ss[int(order[i][1]):int(order[i][2]) + 1])
| def inp():
return input()
def iinp():
return int(input())
def inps():
return input().split()
def miinps():
return map(int,input().split())
def linps():
return list(input().split())
def lmiinps():
return list(map(int,input().split()))
def lmiinpsf(n):
return [list(map(int,input().split()))for _ in range(n)]
n,x,t = miinps()
ans = (n + (x - 1)) // x
ans *= t
print(ans) | 0 | null | 3,171,270,632,340 | 68 | 86 |
n = int(input())
s = input()
ans = ''
for c in s:
ans += chr((ord(c) - ord("A") + n) % 26 + ord("A"))
print(ans) | import math
point = map(float, raw_input().split())
x1 = point[0]
y1 = point[1]
x2 = point[2]
y2 = point[3]
distance = math.sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)
print distance | 0 | null | 67,132,977,694,620 | 271 | 29 |
while 1:
n,x=map(int,input().split())
if n+x==0:break
print(sum([1 for i in range(3,n+1)for j in range(2,x-i)if x-i-j<j<i])) | import itertools
n = int(input())
town = [list(map(int, input().split())) for _ in range(n)]
x = 1
for i in range(1, n+1):
x *= i
l = []
for j in range(n):
l.append(j)
ans = 0
for a in itertools.permutations(l, n):
newl = a
length = 0
for b in range(n-1):
length += ((town[newl[b]][0] - town[newl[b+1]][0])**2 + (town[newl[b]][1] - town[newl[b+1]][1])**2)**(1/2)
ans += length
print(ans/x) | 0 | null | 74,926,668,628,320 | 58 | 280 |
s = input()
p = input()
s = s + s
if p in s:
print('Yes')
else:
print('No')
| string = input()
string = string*2
if string.count(input()):
print("Yes")
else:
print("No") | 1 | 1,717,730,350,050 | null | 64 | 64 |
S = input()
S = str.swapcase(S)
print(S)
|
import numpy as np
class Combination :
def __init__ (self, N=10**6, mod=10**9+7) :
self.mod = mod
self.fact = [1, 1]
self.factinv = [1, 1]
self.inv = [0, 1]
for i in range(2, N+1) :
self.fact.append( (self.fact[-1] * i) % mod )
self.inv .append( (-self.inv[mod%i] * (mod//i) ) % mod )
self.factinv.append( (self.factinv[-1] * self.inv[-1]) % mod )
def nCr(self, n, r) :
if ( r < 0 ) or ( n < r ) : return 0
r = min(r, n-r)
return self.fact[n]*self.factinv[r]*self.factinv[n-r] % self.mod
def nPr(self, n, r) :
if ( r < 0 ) or ( n < r ) : return 0
return self.fact[n]*self.factinv[n-r] % self.mod
n, k = map(int, input().split())
mod = 10**9+7
comb = Combination(2*10**5+100)
ans = 0
for m in range(min(n+1,k+1)) :
ans = ans%mod + (comb.nCr(n,m) * comb.nCr(n-1, n-m-1))%mod
print(ans%mod)
| 0 | null | 34,362,691,850,212 | 61 | 215 |
N = int(input())
ans = N//2 + N%2
print(ans) | print(int((int(input())+1)/2)) | 1 | 59,211,017,095,858 | null | 206 | 206 |
from sys import stdin
for l in stdin:
l = l.rstrip()
if 0 == int(l):
break
print(sum([int(ch) for ch in l])) | while True:
sum = 0
input_str = input()
if input_str == '0':
break
for chr in input_str:
sum += int(chr)
print(sum)
| 1 | 1,595,001,382,070 | null | 62 | 62 |
S = list(map(str, input().split()))
count = len(S)
stack = []
for i in range(count):
if S[i] == "+":
b = stack.pop()
a = stack.pop()
stack.append(a + b)
elif S[i] == "-":
b = stack.pop()
a = stack.pop()
stack.append(a - b)
elif S[i] == "*":
b = stack.pop()
a = stack.pop()
stack.append(a * b)
else:
stack.append(int(S[i]))
print(stack[0])
| def add(x,y):
return x+y
def sub(x,y):
return x-y
def mul(x,y):
return x*y
def div(x,y):
return x/float(y)
a=input().split()
i=0
for j in range(len(a)):
if a[i]=="+":
a[i-2]=int(a[i-2])
a[i-1]=int(a[i-1])
a[i]=int(add(a[i-2],a[i-1]))
del a[i-2]
del a[i-2]
i=i-2
elif a[i]=="-":
a[i-2]=int(a[i-2])
a[i-1]=int(a[i-1])
a[i]=int(sub(a[i-2],a[i-1]))
del a[i-2]
del a[i-2]
i=i-2
elif a[i]=="*":
a[i-2]=int(a[i-2])
a[i-1]=int(a[i-1])
a[i]=int(mul(a[i-2],a[i-1]))
del a[i-2]
del a[i-2]
i=i-2
elif a[i]=="/":
a[i-2]=int(a[i-2])
a[i-1]=int(a[i-1])
a[i]=int(div(a[i-2],a[i-1]))
del a[i-2]
del a[i-2]
i=i-2
i=i+1
print(a[0])
| 1 | 36,321,057,070 | null | 18 | 18 |
import bisect
n = int(input())
l = list(map(int, input().split()))
l.sort()
ans = 0
for a in range(0, n-2):
for b in range(a+1, n-1):
c = l[a] + l[b]
ans += bisect.bisect_left(l, c) - b - 1
print(ans) | import sys
input = sys.stdin.readline
# D - Triangles
def binary_search(i, j):
global N
left = j
right = N
while right - left > 1:
mid = (left + right) // 2
if is_match(mid, i, j):
left = mid
else:
right = mid
return left
def is_match(mid, i, j):
global L
a = L[i]
b = L[j]
c = L[mid]
if b < c + a and c < a + b:
return True
else:
return False
N = int(input())
L = list(map(int, input().split()))
L.sort()
ans = 0
for i in range(N - 2):
for j in range(i + 1, N - 1):
k = binary_search(i, j)
if k > j and k < N:
ans += k - j
print(ans) | 1 | 171,573,815,701,274 | null | 294 | 294 |
bilding = [[[0 for x in range(10)] for x in range(3)]for x in range(4)]
n = int(input())
for k in range(n):
b, f, r, v = map(int, raw_input().split())
bilding[b-1][f-1][r-1] += v
for b in range(4):
for f in range(3):
print(" "+" ".join(map(str, bilding[b][f])))
if b < 3:
print("#"*20) | k,x=list(map(int,input().split()))
if 500*k>=x:
print('Yes')
else:
print('No') | 0 | null | 49,903,741,419,932 | 55 | 244 |
x,y,a,b,c = map(int,input().split())
p = list(map(int,input().split()))
q = list(map(int,input().split()))
r = list(map(int,input().split()))
p = sorted(p,reverse=True)
q = sorted(q,reverse=True)
r = sorted(r,reverse=True)
lis = p[:x]
lis.extend(q[:y])
lis = sorted(lis)
#print(lis)
ans = []
lr = len(r)
for i in range(len(lis)):
if i<lr:
ans.append(max(lis[i],r[i]))
else:
ans.append(lis[i])
print(sum(ans))
| S=input()
T=input()
N = len(S)
count = 0
for n in range(N):
if S[n]!=T[n]:
count+=1
print(count)
| 0 | null | 27,691,541,130,660 | 188 | 116 |
N = int(input())
A = list(map(int,input().split()))
M = int(input())
Q = list(map(int,input().split()))
SL = []
for bit in range(1<<N):
SUM = 0
for i in range(N):
if bit & (1<<i):
SUM += A[i]
SL.append(SUM)
for q in Q:
if q in SL:
print('yes')
else:
print('no')
| n,m = map(int,input().split())
a = [int(s) for s in input().split()]
daycount = 0
for i in range(m):
daycount += a[i]
if n - daycount >= 0:
print(n - daycount)
else:
print(-1) | 0 | null | 15,965,237,779,520 | 25 | 168 |
#!/usr/bin/env python3
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
n, k = LI()
a = LI()
check_num = [-1] * n
idx = 0
cnt = 1
while 1:
idx = a[idx] - 1
if check_num[idx] != -1:
s = check_num[idx] - 1
cnt -= 1
break
check_num[idx] = cnt
cnt += 1
if cnt >= k:
for i in range(n):
if check_num[i] == k:
print(i+1)
quit()
else:
roop_num = cnt - s
x = (k - (s + 1)) % roop_num
for i in range(n):
if check_num[i] - s - 1 == x:
print(i+1)
quit() | import sys
import re
import math
import collections
import decimal
import bisect
# import copy
# import heapq
# from collections import deque
# import decimal
# sys.setrecursionlimit(100001)
INF = sys.maxsize
# MOD = 10 ** 9 + 7
ni = lambda: int(sys.stdin.readline())
ns = lambda: map(int, sys.stdin.readline().split())
na = lambda: list(map(int, sys.stdin.readline().split()))
# ===CODE===
def main():
a, b, c = ns()
tmp = decimal.Decimal(a).sqrt() + decimal.Decimal(b).sqrt() - decimal.Decimal(c).sqrt()
print("Yes" if tmp < 0 else "No")
if __name__ == '__main__':
main()
| 0 | null | 37,275,630,800,618 | 150 | 197 |
if __name__ == '__main__':
while True:
key_in = input()
data = key_in.split(' ')
a = int(data[0])
op = data[1]
b = int(data[2])
if op == '+':
print('{0}'.format(a + b))
if op == '-':
print('{0}'.format(a - b))
if op == '*':
print('{0}'.format(a * b))
if op == '/':
print('{0}'.format(a // b))
if op == '?':
break | while 1:
data = input()
if "?" in data:
break
print(eval(data.replace("/","//"))) | 1 | 692,052,358,688 | null | 47 | 47 |
def main():
N = int(input())
L = []
for i in range(N):
xi, li = map(int, input().split())
s = xi - li
f = xi + li
L.append((f, s))
L.sort()
ans = 0
finish = -float("inf")
for i in L:
if finish <= i[1]:
ans += 1
finish = i[0]
print(ans)
if __name__ == "__main__":
main()
| N, X, Y = map(int, input().split())
def f(i, j):
v1 = j - i
v2 = abs(X - i) + 1 + abs(j - Y)
v3 = abs(Y - i) + 1 + abs(j - X)
return min(v1, v2, v3)
D = [0] * N
for i in range(1, N):
for j in range(i + 1, N + 1):
d = f(i, j)
D[d] += 1
for d in D[1:]:
print(d)
| 0 | null | 66,814,532,433,548 | 237 | 187 |
N = int(input())
l = [0] * 10 ** 5
for x in range(1,100):
for y in range(1,100):
for z in range(1,100):
n = (pow(x + y,2) + pow(y + z,2) + pow(z + x,2)) // 2
l[n] += 1
for n in range(1,N + 1):
print(l[n]) | N = int(input())
print(sum([i for i in range(1, N+1) if i%3 if i%5])) | 0 | null | 21,499,776,857,728 | 106 | 173 |
str=input()
maxcnt=0
cnt=0
for i in range(len(str)):
if(str[i]=="R"):
cnt+=1
maxcnt=max(cnt,maxcnt)
else:
cnt=0
print(maxcnt)
| s = input().split('S')
m = 0
for i in s:
if len(i) > m:
m = len(i)
print(m)
| 1 | 4,853,322,692,032 | null | 90 | 90 |
X,Y=map(int,input().split())
M=[0]*206
M[0],M[1],M[2]=300000,200000,100000
if X+Y==2:
print(1000000)
else:
print(M[X-1]+M[Y-1]) | x, y = map(int, input().split())
a = max(0, 100000 * (4 - x))
b = max(0, 100000 * (4 - y))
c = 400000 if x == 1 and y == 1 else 0
print(a + b + c)
| 1 | 140,358,696,709,888 | null | 275 | 275 |
def main2():
h,w,k = map(int,input().split())
G = []
for _ in range(h):
c = list(input())
G.append(c)
ans = 0
for ib in range(1<<h):
for jb in range(1<<w):
ct = 0
for i in range(h):
for j in range(w):
if (ib>>i)&1 and (jb>>j)&1 and G[i][j]=="#":
ct+=1
if ct == k:
ans+=1
print(ans)
main2() | H,W,K = map(int,input().split())
c = []
row = [0]*H
col = [0]*W
total = 0
for i in range(H):
c.append(list(input()))
for j in range(W):
if c[i][j] == '#':
row[i] += 1
col[j] += 1
total += 1
#print(total)
ans = 0
for i in range(2**(H+W)):
x = [0]*(H+W)
ii = i
for j in range(H+W):
x[j] = ii % 2
ii//=2
#print(x)
D = 0
for j in range(H):
D += row[j]*x[j]
for j in range(H,H+W):
D += col[j-H]*x[j]
for j in range(H):
for k in range(W):
if c[j][k] == '#':
D -= x[j]*x[H+k]
if total -D == K:
ans += 1
#print(x,ans)
print(ans) | 1 | 8,965,609,673,510 | null | 110 | 110 |
r = int(input())
print( 2 * 3.14159268 * r ) | R=int(input())
print(2*3.14159265*R)
| 1 | 31,376,104,416,378 | null | 167 | 167 |
def abc159c_maximum_volume():
l = int(input())
v = l/3
print(v*v*(l-2*v))
abc159c_maximum_volume() | L = int(input())
volume = (L / 3)**3
print(volume) | 1 | 47,252,660,873,542 | null | 191 | 191 |
import bisect,collections,copy,itertools,math,string
import sys
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())
def main():
a,b,c = LI()
ans = 4*a*b<(c-a-b)**2 and c-a-b>0
print("Yes" if ans else "No")
main()
| import math
import sys
from decimal import Decimal
a,b,c = map(int,input().split())
if c-a-b <= 0:
print('No')
sys.exit()
if Decimal((c-a-b)*(c-a-b) - 4*a*b) > 0:
print("Yes")
else:
print('No')
| 1 | 51,504,490,556,850 | null | 197 | 197 |
n = int(input())
s = input()
#print(n , s , ' ')
p = "ABC"
ans = 0
for i in range(n - 2):
if s[i : (i + 3)] == p :
ans += 1
print(ans)
| import sys
import numpy as np
input = sys.stdin.readline
def main():
H, W, K = map(int, input().split())
s = np.zeros(shape=(H, W), dtype=np.bool)
for i in range(H):
s[i] = tuple(map(lambda x: True if x == "#" else False, input().rstrip()))
ans = np.zeros(shape=(H, W), dtype=np.int64)
h_keep = 0
k = 1
for h in range(H):
if s[h].sum() > 0:
indices = np.where(s[h])[0]
ans[h_keep:h + 1] = k
k += 1
for idx in reversed(indices[:-1]):
ans[h_keep:h + 1, :idx + 1] = k
k += 1
h_keep = h + 1
else:
h_keep = min(h_keep, h)
if h_keep < H:
h_base = h_keep - 1
for h in range(h_keep, H):
ans[h] = ans[h_base]
for h in range(H):
print(" ".join(map(str, ans[h])))
if __name__ == "__main__":
main()
| 0 | null | 121,742,226,308,158 | 245 | 277 |
while True:
a, b = map(int, input().split(" "))
if a == b == 0:
break
if a > b:
a, b = b, a
print("%d %d" % (a,b))
| tmp = 0
while True:
i = raw_input().strip().split()
a = int(i[0])
b = int(i[1])
if a == 0 and b == 0:
break
if a > b:
tmp = a
a = b
b = tmp
print a,b | 1 | 506,434,730,722 | null | 43 | 43 |
a, b = map(int, input().split())
print("%d %d" % (int(a * b), int(a + a + b + b))) | import sys
readline=sys.stdin.readline
N=int(readline())
# 1～(N - 1)の約数を数える
ans = 0
for i in range(1, N):
for j in range(i, N, i):
ans += 1
print(ans)
| 0 | null | 1,442,856,339,628 | 36 | 73 |
n, k = map(int, input().split())
lst = [0] + list(map(int, input().split()))
dic = {1:0}
loc = 1
for i in range(1, k + 1):
loc = lst[loc]
if loc not in dic:
dic[loc] = i
else:
span = i - dic[loc]
initial = dic[loc]
z = (k - initial) % span
for j in range(z):
loc = lst[loc]
print(loc)
exit()
print(loc) | N, K = [int(_) for _ in input().split()]
A = [None] + [int(_) for _ in input().split()]
nowkaimin = [None] * (N + 1)
now = 1
kai = 0
nowkaimin[now] = kai
while True:
now = A[now]
kai += 1
if kai == K:
print(now)
exit()
if nowkaimin[now] is not None:
break
nowkaimin[now] = kai
#nowkaimin[now] to kai ga hitosii
#nowkaimin[now] + (kai - nowkaimin[now]) * Q + R
R = (K - nowkaimin[now]) % (kai - nowkaimin[now])
for i, v in enumerate(nowkaimin):
if v == nowkaimin[now] + R:
print(i)
exit()
| 1 | 22,739,130,478,528 | null | 150 | 150 |
n = int(input())
a_list = list(map(int, input().split()))
ans_list =[0]*n
for i in range(n):
ans_list[a_list[i]-1] = i+1
print(*ans_list) | n = int(input())
a = list(map(int,input().split()))
ans = [0]*(n+1)
a.insert(0,0)
for i in range(1,n+1):
ans[a[i]] += i
ans.pop(0)
ans = [str(ans[s]) for s in range(n)]
print(" ".join(ans)) | 1 | 180,639,889,877,198 | null | 299 | 299 |
num_lis = list(map(int,input().split()))
amount = sum(num_lis)
if amount >= 22:
print("bust")
else:
print("win") | x = int(input())
five_hand = 500
five = 5
glad = 0
if x >= five_hand:
glad = glad + (x // five_hand) * 1000
x = x % five_hand
if x >= five:
glad = glad + (x // five) * 5
x = x % five
print(glad) | 0 | null | 80,686,159,705,782 | 260 | 185 |
n,k=map(int,input().split())
s=n//k
m=min((n-s*k),((s+1)*k-n))
print(m) | def solve():
N,K = [int(i) for i in input().split()]
min_N = N
if min_N > K:
min_N = min_N - (min_N//K)*K
min_N = min(min_N, abs(min_N-K))
print(min_N)
if __name__ == "__main__":
solve() | 1 | 39,309,523,113,278 | null | 180 | 180 |
import math
n = int(input())
ans=0
k = [[0]*10 for i in range(10)]
for i in range(1,n+1):
j = str(i)
l = int(j[0])
r = int(j[-1])
k[l][r]+=1
for i in range(10):
for j in range(10):
if i==0 or j==0:
continue
if i==j:
ans += k[i][j]*k[i][j]
else:
ans += k[i][j]*k[j][i]
print(ans) | n = int(input())
lr_cnt = [[0 for _ in range(10)] for _ in range(10)]
for i in range(1, n + 1):
str_i = str(i)
start = int(str_i[0])
end = int(str_i[-1])
lr_cnt[start][end] += 1
ans = 0
for i in range(10):
for j in range(10):
ans += lr_cnt[i][j] * lr_cnt[j][i]
print(ans)
| 1 | 86,350,547,371,372 | null | 234 | 234 |
n = input()
R = []
for i in range(n):
R.append(int(raw_input()))
maxv = R[1] - R[0]
minv = R[0]
for v in range(1, n):
if minv > R[v]:
minv = R[v]
elif maxv < R[v] - minv:
maxv = R[v] - minv
print maxv | n, m, l = map(int, input().split())
matrix_a = [list(map(int, input().split())) for i in range(n)]
matrix_b = [list(map(int, input().split())) for i in range(m)]
mul_matrix_a_b = [[sum([matrix_a[i][k] * matrix_b[k][j] for k in range(m)]) for j in range(l)] for i in range(n)]
for result in mul_matrix_a_b:
print(*result) | 0 | null | 725,562,823,972 | 13 | 60 |
N = int(input())
S = list(input())
R = []
G = []
for i in range(N):
if S[i] == "R":
R.append(i)
elif S[i] == "G":
G.append(i)
r = len(R)
g = len(G)
ans = r * g * (N - r - g)
for i in R:
for j in G:
a = 2 * i - j
b = 2 * j - i
c = i + j
if 0 <= a < N and S[a] == "B":
ans -= 1
if 0 <= b < N and S[b] == "B":
ans -= 1
if c % 2 == 0 and S[c//2] == "B":
ans -= 1
print(ans) | n=int(input())
s=input()
ans=0
r,g,b=0,0,0
for i in range(n):
if s[i]=="R":
r+=1
elif s[i]=="G":
g+=1
else:
b+=1
for i in range(1,n):
for j in range(i+1,n):
if (j-i)+j<=n:
k=(j-i)+j-1
if s[i-1]!=s[j-1] and s[j-1]!=s[k] and s[k]!=s[i-1]:
ans-=1
ans+=r*g*b
print(ans) | 1 | 35,889,207,084,592 | null | 175 | 175 |
n,m = map(int,input().split())
h = [0]+list(map(int,input().split()))
route = [[0] for _ in range(n+1)]
for _ in range(m):
a,b = map(int,input().split())
route[a].append(h[b])
route[b].append(h[a])
cnt=0
for i in range(1,n+1):
if h[i]>max(route[i]):
cnt+=1
print(cnt)
| def main():
S = input()
N = len(S)
ret = [0] * (N + 1)
for i, c in enumerate(S, start=1):
if c == '<':
ret[i] = max(
ret[i],
ret[i - 1] + 1
)
for i, c in enumerate(reversed(S), start=1):
i = N - i
if c == '>':
ret[i] = max(
ret[i],
ret[i + 1] + 1
)
print(sum(ret))
if __name__ == '__main__':
main()
| 0 | null | 91,070,753,006,830 | 155 | 285 |
N = int(input())
A = [int(i) for i in input().split()]
ans = []
for i in range(N):
ans.append([A[i],i+1])
ans.sort()
for i in range(N-1):
print(ans[i][1],end=' ')
print(ans[-1][1])
| N = int(input())
A = list(map(int,input().split()))
B = [[A[i],i+1]for i in range(N)]
B.sort()
ans = [B[i][1]for i in range(N)]
print(" ".join(map(str,ans))) | 1 | 180,753,681,583,840 | null | 299 | 299 |
a = [list(map(int, input().split())) for i in range(3)]
n = int(input())
b = [int(input()) for i in range(n)]
for i in b:
for j in range(0,3):
for k in range(0,3):
if i == a[j][k]:
a[j][k] = 0
if a[0][0]==0 and a[0][1]==0 and a[0][2]==0:
print("Yes")
elif a[1][0]==0 and a[1][1]==0 and a[1][2]==0:
print("Yes")
elif a[2][0]==0 and a[2][1]==0 and a[2][2]==0:
print("Yes")
elif a[0][0]==0 and a[1][0]==0 and a[2][0]==0:
print("Yes")
elif a[0][1]==0 and a[1][1]==0 and a[2][1]==0:
print("Yes")
elif a[0][2]==0 and a[1][2]==0 and a[2][2]==0:
print("Yes")
elif a[0][0]==0 and a[1][1]==0 and a[2][2]==0:
print("Yes")
elif a[0][2]==0 and a[1][1]==0 and a[2][0]==0:
print("Yes")
else:
print("No") | import bisect, collections, copy, heapq, itertools, math, string
import sys
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return map(int, sys.stdin.readline().rstrip().split())
def LI(): return list(map(int, sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())
def main():
A = [[]for _ in range(3)]
for i in range(3):
A[i] = LI()
A_ = [[]for _ in range(3)]
for i in range(3):
for j in range(3):
A_[j].append(A[i][j])
A__ = [[]for _ in range(2)]
for i in range(3):
A__[0].append(A[i][i])
A__[1].append(A[i][2 - i])
N = I()
B = []
for i in range(N):
b = I()
B.append(b)
for i in range(3):
if b in A[i]:
ind = A[i].index(b)
A[i][ind] = 0
if b in A_[i]:
ind = A_[i].index(b)
A_[i][ind] = 0
for j in range(2):
if b in A__[j]:
ind = A__[j].index(b)
A__[j][ind] = 0
ans_list = []
for i in range(3):
ans_list.append(sum(A[i]))
ans_list.append(sum(A_[i]))
for j in range(2):
ans_list.append(sum(A__[j]))
if 0 in ans_list:
print('Yes')
else:
print('No')
if __name__ == "__main__":
main() | 1 | 59,657,043,276,962 | null | 207 | 207 |
num = int(input())
print(num*num) | def main():
import sys
readline = sys.stdin.buffer.readline
n = int(readline())
s = readline().rstrip().decode('utf-8')
print('Yes' if s[:n//2] == s[n//2:] else 'No')
if __name__ == '__main__':
main() | 0 | null | 146,375,141,455,650 | 278 | 279 |
h = [int(input())]
a = 1
while(True):
if h[0] < 1:
break
h = list(map(lambda x: x / 2, h))
a = a * 2
print(a - 1)
| a, b = map(str, input().split())
n1 = a*int(b)
n2 = b*int(a)
ans = n1 if int(n1) > int(n2) else n2
print(ans) | 0 | null | 82,493,701,320,892 | 228 | 232 |
S = list(input())
K = int(input())
L = len(S)
if len(set(S)) == 1:
print(L*K // 2)
exit()
def n_changes(s):
sc = s.copy()
count = 0
for i in range(1, len(sc)):
if sc[i] == sc[i-1]:
sc[i] = "X"
count += 1
return count
print(n_changes(S) + (K-1) * (n_changes(2*S) - n_changes(S)))
| S = input()
K = int(input())
if len(S) == 1:
print(K//2)
exit()
if len(set(S)) == 1:
ans = len(S)*K//2
print(ans)
exit()
if S[0] != S[-1]:
ans = 0
tmp = ""
for s in S:
if s == tmp:
ans += 1
tmp = ""
continue
else:
tmp = s
ans *= K
print(ans)
exit()
elif S[0] == S[-1]:
A = 0
B = 0
for s in S:
if s == S[0]:
A+=1
else:
break
for s in S[::-1]:
if s == S[0]:
B+=1
else:
break
ans = 0
tmp = ""
for s in S:
if s == tmp:
ans += 1
tmp = ""
continue
else:
tmp = s
ans *= K
ans = ans - (A//2 + B//2)*(K-1) + (A+B)//2*(K-1)
print(ans)
exit()
| 1 | 175,163,329,439,772 | null | 296 | 296 |
n = int(input())
ans = 0
ans += n // 500 * 1000
n %= 500
ans += n // 5 * 5
print(ans)
| x = int(input())
money1 = x // 500
x %= 500
money2 = x // 5
ans = money1 * 1000 + money2 * 5
print(ans) | 1 | 42,867,974,052,160 | null | 185 | 185 |
W, H, x, y, r = map(int, input().split())
if x - r >= 0 and x + r <= W and y - r >= 0 and y + r <= H:
print("Yes")
else:
print("No")
| def a():
a = "1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51"
list_a = a.split(sep=",")
k = int(input())
print(list_a[k-1])
if __name__ == '__main__':
a() | 0 | null | 25,127,625,989,752 | 41 | 195 |
S = list(input())
K = int(input())
if len(set(S)) == 1:
print(len(S)*K //2)
else:
cnt = [1]
for i in range(len(S)-1):
if S[i] == S[i+1]:
cnt[-1] += 1
else:
cnt.append(1)
res = 0
for c in cnt:
res += c//2*K
if S[0] == S[-1]:
if (cnt[0]+cnt[-1])%2 == 0:
res += K-1
print(res) | N = input()
for n in N:
if n == "7":
print("Yes")
break
else:
print("No")
| 0 | null | 104,935,579,554,718 | 296 | 172 |
import sys
import itertools
input = sys.stdin.readline
def SI(): return str(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def main():
H, W, K = MI()
grid = [SI().rstrip('\n') for _ in range(H)]
n = H + W
ans = 0
for i in itertools.product(range(2),repeat = H):
for j in itertools.product(range(2),repeat = W):
count = 0
for k in range(H):
if i[k] == 1:
continue
for l in range(W):
if j[l] == 1:
continue
if grid[k][l] == "#":
count += 1
if count == K:
ans +=1
print(ans)
main() | import sys
sys.setrecursionlimit(100000000)
input = lambda: sys.stdin.readline().rstrip()
r = int(input())
print(r ** 2)
| 0 | null | 76,939,938,991,438 | 110 | 278 |
# coding: UTF-8
import sys
import numpy as np
# f = open("input.txt", "r")
# sys.stdin = f
a = str(input())
if a.islower():
print("a")
else:
print("A") | data = [int(i) for i in input().split()]
out = ' '.join([str(i) for i in sorted(data)])
print(out)
| 0 | null | 5,924,671,623,092 | 119 | 40 |
a,v = map(int,input().split())
b,w = map(int,input().split())
t = int(input())
if v <= w:
print("NO")
else:
dis = abs(b-a)
sp = abs(v-w)
if 0 < dis/sp <= t:
print("YES")
else:
print("NO")
| A, B, C, K = map( int, input().split())
ret = min( A, K )
if A < K:
ret -= max( 0, K - A - B )
print( ret ) | 0 | null | 18,513,529,564,154 | 131 | 148 |
#65
import math
while True:
n=int(input())
if n==0:
break
s=list(map(int,input().split()))
m=sum(s)/n
a=0
for i in range(n):
a+=(s[i]-m)**2
b=math.sqrt(a/n)
print(b)
| n = int(input())
a = list(map(int, input().split()))
x = n//2
if sum(a)/2 == sum(a[:(n//2)]):
print(0)
elif sum(a)/2 >= sum(a[:(n//2)]):
while sum(a)/2 >= sum(a[:x]):
x += 1
print(min(abs(2*sum(a[:x])-sum(a)), abs(2*sum(a[:x-1])-sum(a))))
else:
while sum(a)/2 <= sum(a[:x]):
x -= 1
print(min(abs(2*sum(a[:x])-sum(a)), abs(2*sum(a[:x+1])-sum(a))))
| 0 | null | 71,014,661,678,000 | 31 | 276 |
W,H,x,y,r=map(int,input().split())
print('Yes') if x+r<=W and y+r<=H and r<=x and r<=y else print('No')
| W, H, x, y, r = map(int, raw_input().split())
print "Yes" if 0 <= x - r < x + r <= W and 0 <= y - r < y + r <= H else "No" | 1 | 459,682,291,522 | null | 41 | 41 |
while True:
H,W = [int(x) for x in input().split()]
if (H,W)==(0,0): break
for i in range(H):
if i==0 or i==H-1:
print("#"*W)
else:
print("#" + "."*(W-2) + "#")
print("")
| while True:
H, W = map(int, input().split())
if not(H or W):
break
print('#' * W)
for i in range(H-2):
print('#', end='')
for j in range(W-2):
print('.', end='')
print('#')
print('#' * W, end='\n\n') | 1 | 801,773,655,718 | null | 50 | 50 |
# -*- coding: utf-8
s = list(map(str,input().split()))
sum = 0
for i in range(len(s)):
sum += (int) (s[i])
if sum %9 == 0:
print("Yes")
else:
print("No") | from sys import stdin
def ip(): return [int(i) for i in stdin.readline().split()]
def sp(): return [str(i) for i in stdin.readline().split()]
s = str(input())
c = 0
for i in s:
c += int(i)
if (c % 9) == 0: print("Yes")
else: print("No")
| 1 | 4,413,296,150,606 | null | 87 | 87 |
n,k = map(int,input().split())
a = list(map(int,input().split()))
si = [0 for i in range(n+1)]
p = [1 for i in range(n)]
import copy
for q in range(min(k,50)):
v = 0
s = copy.deepcopy(si)
for i in range(n):
if a[i] != 0:
s[max(i-a[i],0)] += 1
s[min(i+a[i]+1,n)] -= 1
a[i] = 0
else:
a[i] = 1
for i in range(n):
v += s[i]
a[i] += v
for i in range(n):
print(a[i], end = ' ') | N, K = map(int, input().split())
A = list(map(int, input().split()))
imos = [0]*(N+1)
# 全体でO(NlogN) ≒ 10^6
for k in range(K): # 下のifによってO(logN)で抑えられる.
if min(A) == N:
break
imos = [0]*(N+1)
for i,a in enumerate(A): # O(N)
imos[max(0, i-a)] += 1
imos[min(N, i + a + 1)] -= 1
A = [imos[0]]
for i in range(1,len(imos)-1): # O(N)
A.append(A[i - 1] + imos[i])
print(*A, sep=" ") | 1 | 15,513,100,040,590 | null | 132 | 132 |
from math import sqrt
def koch(n, c1, c2):
if n == 0:
return
# 処理
v = [c2[0] - c1[0], c2[1] - c1[1]]
s = [c1[0] + v[0] / 3, c1[1] + v[1] / 3]
t = [c1[0] + 2 * v[0] / 3, c1[1] + 2 * v[1] / 3]
u = [c1[0] + v[0]/2 - v[1] * sqrt(3) / 6, c1[1] + v[1]/2 + v[0] * sqrt(3) / 6]
koch(n-1, c1, s)
print(" ".join(map(str, s)))
koch(n-1, s, u)
print(" ".join(map(str, u)))
koch(n-1, u, t)
print(" ".join(map(str, t)))
koch(n-1, t, c2)
def main():
fmt = "%.8f %.8f"
q3 = sqrt(3)
c1 = [0, 0]
c2 = [100, 0]
n = int(input())
print(fmt % tuple(c1))
koch(n, c1, c2)
print(fmt % tuple(c2))
main()
| import sys
def LI(): return list(map(int,sys.stdin.readline().rstrip().split())) #空白あり
N,K = LI()
A = LI()
for i in range(N):
A[i] -= 1
B = [0] # Aの累積和をKで割ったもの
for i in range(N):
B.append((B[-1]+A[i]) % K)
from collections import defaultdict
# 要素の個数がKを超えないことに注意
if N < K:
d = defaultdict(int)
for n in B:
d[n] += 1
ans = 0
for n in d.keys():
m = d[n]
ans += m*(m-1)//2
print(ans)
else:
d = defaultdict(int)
ans = 0
for i in range(N): # A[i]から始まる部分列を考える
if i == 0:
for j in range(K):
d[B[j]] += 1
ans += d[B[i]]-1
elif i <= N-K+1:
d[B[K+i-1]] += 1
d[B[i-1]] -= 1
ans += d[B[i]]-1
else:
d[B[i-1]] -= 1
ans += d[B[i]]-1
print(ans)
| 0 | null | 68,493,758,874,400 | 27 | 273 |
import sys
import collections
import bisect
def main():
n = int(input())
ac, bc = collections.Counter([str(i + 1)[0] + str(i + 1)[-1] for i in range(
n)]), collections.Counter([str(i + 1)[-1] + str(i + 1)[0] for i in range(n)])
print(sum(ac[i] * bc[i] for i in ac.keys()))
if __name__ == '__main__':
main()
| import sys
input = sys.stdin.readline
from collections import deque
n = int(input())
graph = {i: deque() for i in range(1, n+1)}
for _ in range(n):
u, k, *v = [int(x) for x in input().split()]
v.sort()
for i in v:
graph[u].append(i)
#graph[i].append(u)
seen = [0]*(n+1)
stack = []
time = 0
seentime = [0]*(n+1)
donetime = [0]*(n+1)
def dfs(j):
global time
seen[j] = 1
time += 1
seentime[j] = time
stack.append(j)
while stack:
s = stack[-1]
if not graph[s]:
stack.pop()
time += 1
donetime[s] = time
continue
g_NO = graph[s].popleft()
if seen[g_NO]:
continue
seen[g_NO] = 1
stack.append(g_NO)
time += 1
seentime[g_NO] = time
for j in range(1, n+1):
if seen[j]:
continue
dfs(j)
for k, a, b in zip(range(1, n+1), seentime[1:], donetime[1:]):
print(k, a, b)
| 0 | null | 43,415,173,797,940 | 234 | 8 |
n=int(input())
s=[]
t=[]
for i in range(n):
st,tt=input().split()
s.append(st)
t.append(int(tt))
x=str(input())
temp=0
ans=sum(t)
for i in range(n):
temp=temp+t[i]
if s[i]==x:
break
print(ans-temp) | n, m = map(int, input().split())
a = []
for i in range(n):
a.append(list(map(int, input().split())))
b = []
for i in range(m):
b.append(int(input()))
for i, ai in enumerate(a):
cnt = 0
for j, bj in enumerate(b):
cnt += ai[j] * bj
print(cnt)
| 0 | null | 49,175,017,172,500 | 243 | 56 |
def main():
n, d = map(int, input().split())
count = 0
for _ in range(n):
x, y = map(int, input().split())
if (x**2 + y**2) ** 0.5 <= d:
count += 1
print(count)
if __name__ == '__main__':
main()
|
n = int(input())
cnt = 0
for i in range(1,n):
cnt += int((n-1)/i)
print(cnt)
| 0 | null | 4,321,176,580,410 | 96 | 73 |
n = int(input())
a = list(map(int, input().split()))
M = max(a)
biggest_prime = [0] * (M+10)
for i in range(2, M+10):
if biggest_prime[i] == 0:
biggest_prime[i] = i
for j in range(i*i, M+1, i):
biggest_prime[j] = i
def fact(n):
arr=[]
while n>1:
now=n
cnt=0
p=biggest_prime[now]
while now % p == 0:
now//=p
cnt+=1
arr.append([p,cnt])
n=now
return arr
from collections import defaultdict
cntd=defaultdict(int)
for i in range(len(a)):
lis = fact(a[i])
for num,cnt in lis:
if num==1:
continue
cntd[num]+=1
flg=False
for c in cntd.values():
if c==n:
print("not coprime")
exit()
if c>1:
flg=True
if flg:
print("setwise coprime")
else:
print("pairwise coprime") | import sys
import bisect
import itertools
import collections
import fractions
import heapq
import math
from operator import mul
from functools import reduce
from functools import lru_cache
def solve():
readline = sys.stdin.buffer.readline
mod = 10 ** 9 + 7
N = int(input())
A = list(map(int, input().split()))
def get_primenumber(number): # エラトステネスの篩
prime_list = []
search_list = list(range(2, number + 1))
# search_listの先頭の値が√nの値を超えたら終了
while search_list[0] <= math.sqrt(number):
# search_listの先頭の値が√nの値を超えたら終了
# search_listの先頭をprime_listに入れて、先頭をリストに追加して削除
head_num = search_list.pop(0)
prime_list.append(head_num)
# head_numの倍数を除去
search_list = [num for num in search_list if num % head_num != 0]
# prime_listにsearch_listを結合
prime_list.extend(search_list)
return prime_list
def prime_factor_table(n):
table = [0] * (n + 1)
for i in range(2, n + 1):
if table[i] == 0:
for j in range(i + i, n + 1, i):
table[j] = i
return table
def prime_factor(n, prime_factor_table):
prime_count = collections.Counter()
while prime_factor_table[n] != 0:
prime_count[prime_factor_table[n]] += 1
n //= prime_factor_table[n]
prime_count[n] += 1
return prime_count
table = prime_factor_table(10**6+10)
numset = set()
for i in A:
thedic = prime_factor(i, table)
for l in thedic.keys():
flag = True
if l in numset and l != 1:
flag = False
break
if flag:
tmpset = set(thedic.keys())
numset |= tmpset
else:
break
if flag:
print('pairwise coprime')
sys.exit()
else:
flag = True
theset = set(prime_factor(A[0], table).keys())
for i in A[1:]:
thedic = prime_factor(i, table)
theset = theset & set(thedic.keys())
if len(theset) == 0:
print('setwise coprime')
flag = False
break
if flag:
print('not coprime')
if __name__ == '__main__':
solve() | 1 | 4,063,970,328,900 | null | 85 | 85 |
N, K, C = map(int, input().split())
S = input()
must = set()
i = len(S)+C
for j in range(K):
i = S.rindex("o", 0, i-C)
must.add(i)
if i<=C or "o" not in S[:i-C]:
i = -C-1
for j in range(K):
i = S.index("o", i+C+1)
if i in must:
print(i+1) | 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():
N,K,C=mi()
S=list(input())
ok,ng = "o","x"
OK = []
for i in range(N):
if S[i] == ok:
OK.append(i+1) # 1-index
greeds = [OK[0]]
for i in range(1,len(OK)):
x = OK[i]
if x - greeds[-1] > C:
greeds.append(x)
if len(greeds) > K:
break
inv_greeds = [OK[-1]]
inv_OK = OK[::-1]
for i in range(1,len(OK)):
x = inv_OK[i]
if -x + inv_greeds[-1] > C:
inv_greeds.append(x)
if len(inv_greeds) > K:
break
if len(greeds) < K or len(inv_greeds) < K:
exit()
greeds = greeds[:K]
inv_greeds = inv_greeds[:K][::-1]
# print(greeds,inv_greeds)
for i in range(len(greeds)):
if greeds[i] == inv_greeds[i]:
print(greeds[i])
if __name__ == "__main__":
main() | 1 | 40,599,550,331,172 | null | 182 | 182 |
n = int(input())
lis=[]
for _ in range(n):
x,l = map(int,input().split())
lis.append([x+l,x-l])
lis.sort()
m = -(10**9+7)
ans = 0
for i in range(n):
a ,b = lis[i]
if m <= b:
ans += 1
m = a
print(ans)
| import sys
def input(): return sys.stdin.readline().strip()
def I(): return int(input())
def LI(): return list(map(int, input().split()))
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 S(): return input()
def LS(): return input().split()
INF = float('inf')
n = I()
# 区間スケジューリング問題 : いくつかの区間の中から重ならないように最大で何個選べるか
# ソート + 貪欲法 で解ける
arm_pos = []
for _ in range(n):
x, l = LI()
arm_pos.append([x - l, x + l])
arm_pos = sorted(arm_pos, key=lambda x: x[1]) # アームの終点の位置でソート
ans = n
for i in range(n - 1):
if arm_pos[i][1] > arm_pos[i + 1][0]: # i のアームの終点が i + 1 のアームの始点 と重なっていた場合
arm_pos[i + 1] = arm_pos[i] # i + 1 のアームを取り除く
ans -= 1
print(ans)
| 1 | 89,898,369,755,800 | null | 237 | 237 |
s,t = map(str,input().split())
print(t ,end='')
print(s) | while int(input()) != 0:
m = list(map(int, input().split()))
mean = sum(m) / len(m)
std = (sum([(i - mean) ** 2 for i in m]) / len(m)) ** 0.5
print("{:4f}".format(std))
| 0 | null | 51,467,902,796,860 | 248 | 31 |