code1
stringlengths 17
427k
| code2
stringlengths 17
427k
| similar
int64 0
1
| pair_id
int64 2
181,637B
⌀ | question_pair_id
float64 3.7M
180,677B
⌀ | code1_group
int64 1
299
| code2_group
int64 1
299
|
|---|---|---|---|---|---|---|
N, K = map(int, input().split())
LR = [tuple(map(int, input().split())) for _ in range(K)]
MOD = 998244353
class Mint:
__slots__ = ('value')
def __init__(self, value=0):
self.value = value % MOD
if self.value < 0: self.value += MOD
@staticmethod
def get_value(x): return x.value if isinstance(x, Mint) else x
def inverse(self):
a, b = self.value, MOD
u, v = 1, 0
while b:
t = a // b
b, a = a - t * b, b
v, u = u - t * v, v
if u < 0: u += MOD
return u
def __repr__(self): return str(self.value)
def __eq__(self, other): return self.value == other.value
def __neg__(self): return Mint(-self.value)
def __hash__(self): return hash(self.value)
def __bool__(self): return self.value != 0
def __iadd__(self, other):
self.value = (self.value + Mint.get_value(other)) % MOD
return self
def __add__(self, other):
new_obj = Mint(self.value)
new_obj += other
return new_obj
__radd__ = __add__
def __isub__(self, other):
self.value = (self.value - Mint.get_value(other)) % MOD
if self.value < 0: self.value += MOD
return self
def __sub__(self, other):
new_obj = Mint(self.value)
new_obj -= other
return new_obj
def __rsub__(self, other):
new_obj = Mint(Mint.get_value(other))
new_obj -= self
return new_obj
def __imul__(self, other):
self.value = self.value * Mint.get_value(other) % MOD
return self
def __mul__(self, other):
new_obj = Mint(self.value)
new_obj *= other
return new_obj
__rmul__ = __mul__
def __ifloordiv__(self, other):
other = other if isinstance(other, Mint) else Mint(other)
self *= other.inverse()
return self
def __floordiv__(self, other):
new_obj = Mint(self.value)
new_obj //= other
return new_obj
def __rfloordiv__(self, other):
new_obj = Mint(Mint.get_value(other))
new_obj //= self
return new_obj
LR.sort(key=lambda x: x[1])
pl = pr = -1
LR2 = []
for l, r in LR:
if LR2:
pl, pr = LR2.pop()
if l <= pl:
LR2.append((l, r))
elif l <= pr:
LR2.append((pl, r))
else:
LR2.append((pl, pr))
LR2.append((l, r))
else:
LR2.append((l, r))
dp = [Mint() for _ in range(N + 5)]
dp[1] += 1
dp[2] -= 1
for i in range(1, N):
dp[i] += dp[i - 1]
for l, r in LR2:
nl = min(i + l, N + 1)
nr = min(i + r, N + 1)
dp[nl] += dp[i]
dp[nr + 1] -= dp[i]
dp[N] += dp[N - 1]
print(dp[N])
| import sys
import math
from collections import defaultdict
from collections import deque
sys.setrecursionlimit(1000000)
MOD = 10 ** 9 + 7
input = lambda: sys.stdin.readline().strip()
NI = lambda: int(input())
NMI = lambda: map(int, input().split())
NLI = lambda: list(NMI())
SI = lambda: input()
def main():
N = NI()
ans = 0
for a in range(1, N):
ans += N // a
if N % a == 0:
ans -= 1
print(ans)
if __name__ == "__main__":
main() | 0 | null | 2,598,275,644,134 | 74 | 73 |
from math import sin, cos, radians
a, b, ang = map(int, input().split())
ang = radians(ang)
area = a * b * sin(ang) / 2
c = (a ** 2 + b ** 2 - 2 * a * b * cos(ang)) ** 0.5
circ = a + b + c
height = area * 2 / a
print("%lf\n%lf\n%lf" % (area, circ, height))
| s = input().split(" ")
r = int(s[0])
c = int(s[1])
a = [[0 for i in range(c)] for j in range(r+1)]
for i in range(r):
s = input().split(" ")
for j in range(c):
a[i][j] = int(s[j])
for i in range(c):
sk = 0
for j in range(r):
sk += a[j][i]
a[r][i] = sk
for i in range(r+1):
sk = 0
for j in range(c):
print(a[i][j],end=" ")
sk += a[i][j]
print(sk) | 0 | null | 754,926,884,598 | 30 | 59 |
N=int(input())
def num_divisors_table(n):
table=[0]*(n+1)
for i in range(1,n+1):
for j in range(i,n+1,i):
table[j]+=1
return table
l=num_divisors_table(N-1)
print(sum(l)) | l=int(input())
import numpy as np
result = 0
for x in np.arange(l/3-0.1, l/3+0.1, 0.1):
for y in np.arange(x, l/3+0.1, 0.1):
z = l - (x+y)
if z <= 0:
break
v = x*y*z
result = max(v, result)
print(result) | 0 | null | 24,924,634,326,978 | 73 | 191 |
N = int(input())
a, b = 0, 0
for i in range(int(N**(1/2)), 0, -1):
if N % i == 0:
a = i
b = N / a
break
print(int(a+b-2)) | s = ''
while True:
try:
s += input().lower()
except EOFError:
break
for i in range(97, 123):
print(chr(i)+' : '+str(s.count(chr(i))))
| 0 | null | 81,321,289,540,060 | 288 | 63 |
n = input()
a = 's'
b = 'es'
if n[-1] == 's':
n = n + b
else:
n = n + a
print(n) | S = input().rstrip()
if S[-1] == 's':
print(S + 'es')
else:
print(S + 's') | 1 | 2,339,146,331,328 | null | 71 | 71 |
N = int(input())
A = [int(x) for x in input().split()]
S = [0] * (N+1) #累積和用のリスト
s = 0
CONST = 10**9+7
#前準備として累積和を計算
for i in range(N):
S[i+1] = S[i] + A[i]
#積の総和を計算
for i in range(N-1):
s += A[i] * ((S[N] - S[i+1]) % CONST)
s %= CONST
print(s) | def solve():
N = int(input())
A = list(map(int, input().split()))
square = []
for i in A:
square.append(i**2)
return (sum(A)**2 - sum(square))//2 % (10**9+7)
print(solve())
| 1 | 3,779,696,324,804 | null | 83 | 83 |
#!/usr/bin/python3
import sys
def input():
return sys.stdin.readline().rstrip('\n')
#S = input()
A1,A2,A3 = list(map(int,input().split()))
if A1+A2+A3 < 22:
print('win')
else:
print('bust')
| A,B,C = map(int,input().split())
ans = A+B+C
if ans <= 21:
print('win')
else:
print('bust') | 1 | 118,651,797,775,170 | null | 260 | 260 |
def main():
import sys
from collections import deque
from operator import itemgetter
M=10**10
b=sys.stdin.buffer
n,d,a=map(int,b.readline().split())
m=map(int,b.read().split())
q=deque()
popleft,append=q.popleft,q.append
s=b=0
for x,h in sorted(zip(m,m),key=itemgetter(0)):
while q and q[0]//M<x:b-=popleft()%M
if h>b:
t=(b-h)//a
s-=t
t*=a
b-=t
append((x+d+d)*M-t)
print(s)
main() | import sys
import math
from collections import defaultdict
sys.setrecursionlimit(10**7)
def input():
return sys.stdin.readline()[:-1]
mod = 10**9 + 7
def I(): return int(input())
def LI(): return list(map(int, input().split()))
def LIR(row,col):
if row <= 0:
return [[] for _ in range(col)]
elif col == 1:
return [I() for _ in range(row)]
else:
read_all = [LI() for _ in range(row)]
return map(list, zip(*read_all))
#################
T1,T2 = LI()
A1,A2 = LI()
B1,B2 = LI()
if A1 > B1 and A2 > B2:
print(0)
exit()
if A1 < B1 and A2 < B2:
print(0)
exit()
if A1 > B1:
t = (A1-B1)*T1 / (B2-A2)
delta = (A1-B1)*T1+(A2-B2)*T2
if t == T2:
print('infinity')
exit()
elif t > T2:
print(0)
exit()
else:
if delta > 0:
print(math.floor((T2-t)*(B2-A2)/delta) + 1)
exit()
else:
x = (A1-B1)*T1 / (-delta)
if int(x) == x:
print(2*int(x))
else:
print(2*math.floor(x)+1)
else:
t = (B1-A1)*T1 / (A2-B2)
delta = (B1-A1)*T1+(B2-A2)*T2
if t == T2:
print('infinity')
exit()
elif t > T2:
print(0)
exit()
else:
if delta > 0:
print(math.floor((T2-t)*(A2-B2)/delta) + 1)
exit()
else:
x = (B1-A1)*T1 / (-delta)
if int(x) == x:
print(2*int(x))
else:
print(2*math.floor(x)+1) | 0 | null | 106,547,897,090,222 | 230 | 269 |
def judge(lists):
lists.sort()
if lists[0] ** 2 + lists[1] ** 2 - lists[2] ** 2:
return False
else:
return True
def run():
N = int(input())
for _ in range(N):
if judge([int(x) for x in input().split()]):
print("YES")
else:
print("NO")
if __name__ == '__main__':
run()
| n = int(input())
s = ""
for i in range(n):
l = list(map(lambda x:x*x,map(int, input().split())))
l.sort()
if l[0] + l[1] == l[2]:
s += "YES\n"
else:
s += "NO\n"
print(s,end="") | 1 | 347,694,910 | null | 4 | 4 |
n = int(raw_input())
print "",
for i in xrange(3,n+1):
x = i
if x % 3 == 0:
print i,
continue
while x:
if x % 10 == 3:
print i,
break
elif x / 10 != 0:
x = x / 10
continue
else:
break | import sys
def I(): 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, m = MI()
ac = [False]*(n+1)
wa = [0]*(n+1)
for _ in range(m):
temp = input().split()
p, s = int(temp[0]), temp[1]
if not ac[p]:
if s == 'AC':
ac[p] = True
else:
wa[p] += 1
penalty = 0
for i in range(n+1):
if ac[i]:
penalty += wa[i]
print('{} {}'.format(sum(ac), penalty))
if __name__ == '__main__':
main() | 0 | null | 47,278,078,801,670 | 52 | 240 |
def selection_sort(A):
n = len(A)
num_swaps = 0
for i in range(n):
min_idx = i
for j in range(i, n):
if A[j] < A[min_idx]:
min_idx = j
if min_idx != i:
A[i], A[min_idx] = A[min_idx], A[i]
num_swaps += 1
return num_swaps
N = int(input())
A = [int(elem) for elem in input().split()]
num_swaps = selection_sort(A)
print(*A)
print(num_swaps)
| def selectionSort(A, N):
global cnt
for i in range(N):
minj = i
for j in range(i, N):
if A[j] < A[minj]:
minj = j
if i != minj:
tmp = A[i]
A[i] = A[minj]
A[minj] = tmp
cnt = cnt + 1 #
return A
if __name__ == '__main__':
n = int(input())
R = list(map(int, input().split()))
cnt = 0
R = selectionSort(R, n)
print(" ".join(map(str, R)))
print(cnt) | 1 | 19,178,252,408 | null | 15 | 15 |
n=int(input())
a=list(map(int,input().split()))
if n%2==0:
dp=[[0 for i in range(2)] for j in range(n)]
dp[0][0]=a[0]
dp[1][1]=a[1]
for i in range(2,n):
if i==2:
dp[i][0]=dp[i-2][0]+a[i]
dp[i][1]=dp[i-2][1]+a[i]
else:
dp[i][0]=dp[i-2][0]+a[i]
dp[i][1]=max(dp[i-2][1],dp[i-3][0])+a[i]
print(max(dp[n-1][1],dp[n-2][0]))
else:
dp=[[0 for i in range(3)] for j in range(n)]
dp[0][0]=a[0]
dp[1][1]=a[1]
dp[2][2]=a[2]
for i in range(2,n):
if i==2:
dp[i][0]=dp[i-2][0]+a[i]
dp[i][1]=dp[i-2][1]+a[i]
else:
dp[i][0]=dp[i-2][0]+a[i]
dp[i][1]=max(dp[i-2][1],dp[i-3][0])+a[i]
dp[i][2]=max(dp[i-2][2],dp[i-3][1],dp[i-4][0])+a[i]
print(max(dp[n-1][2],dp[n-2][1],dp[n-3][0])) | N = int(input())
ACcount = 0
WAcount = 0
TLEcount = 0
REcount = 0
for i in range(N):
S=input()
if S == "AC":
ACcount = ACcount + 1
elif S == "WA":
WAcount = WAcount + 1
elif S == "TLE":
TLEcount = TLEcount + 1
elif S == "RE":
REcount = REcount + 1
print("AC x", ACcount)
print("WA x", WAcount)
print("TLE x", TLEcount)
print("RE x", REcount)
| 0 | null | 23,243,086,746,528 | 177 | 109 |
def main():
n,m,x = map(int,input().split())
c = []
a = []
for _ in range(n):
ca = [int(v) for v in input().split()]
c.append(ca[0])
a.append(ca[1:])
INTHIGH = 1<<32
pricemin = INTHIGH
for i in range(1<<n):
sm = [0]*m
sc = 0
for j in range(n):
if i & 1<<j:
sc += c[j]
for k in range(m):
sm[k] += a[j][k]
if min(sm)>=x:
pricemin = min(pricemin, sc)
break
print(pricemin if pricemin<INTHIGH else -1)
main() | num = input()
num = int(num)
print(num**3) | 0 | null | 11,365,742,969,642 | 149 | 35 |
import math
n = input()
A = 0
def is_prime(m):
for i in range(2, int(math.sqrt(m)) + 1):
if (m % i == 0):
return False
return True
for i in range(n):
k = input()
if is_prime(k):
A += 1
print A | def main():
t = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
circle = a[0] * t[0] + a[1] * t[1] - b[0] * t[0] - b[1] * t[1]
if circle == 0:
print('infinity')
return
d = [0, 0]
cd = 0
ans = -1
for i in range(2):
d[i] = cd + a[i] * t[i] - b[i] * t[i]
if cd * d[i] <= 0:
ans += 1
cd = d[i]
if ans == 0:
print(0)
return
if circle < 0:
if d[0] > 0:
ans += d[0] // -circle * 2
if d[0] % (-circle) == 0:
ans -= 1
elif d[1] > 0:
ans += d[1] // -circle * 2
if d[1] % (-circle) == 0:
ans -= 1
else:
if d[0] < 0:
ans += -d[0] // circle * 2
if -d[0] % (circle) == 0:
ans -= 1
elif d[1] < 0:
ans += -d[1] // circle * 2
if -d[1] % (circle) == 0:
ans -= 1
print(ans)
main() | 0 | null | 65,705,060,617,172 | 12 | 269 |
import copy as cp
n = int(input())
A = list()
for i in range(n):
A.append(int(input()))
count = 0
#print(A)
def insertionsort(A,n,g):
global count
for i in range(g,n):
v = A[i]
j = i-g
while (j >= 0 and A[j] > v):
A[j+g] = A[j]
A[j] = v
j = j - g
v = A[j+g]
count += 1
#decision of m and g
G = list()
G.append(int(1))
i = 0
while (G[i] <= n):
G.append(3*G[i] + 1)
i += 1
del G[-1]
G.reverse()
m = len(G)
#print(G,m)
#shellsort
for i in range(m):
insertionsort(A,n,G[i])
#output
print(m)
for k in range(m-1):
print(str(G[k])+" ",end = "")
print(str(G[m-1]))
print(count)
for k in range(n):
print(str(A[k]))
| X = int(input())
def define_rate(X):
if X >= 1800:
return 1
elif X >= 1600:
return 2
elif X >= 1400:
return 3
elif X >= 1200:
return 4
elif X >= 1000:
return 5
elif X >= 800:
return 6
elif X >= 600:
return 7
elif X >= 400:
return 8
print(define_rate(X)) | 0 | null | 3,373,460,136,134 | 17 | 100 |
import sys
from itertools import accumulate
from collections import defaultdict
input = sys.stdin.readline
n,k = map(int,input().split())
a = list(map(int,input().split()))
a = [i-1 for i in a]
suma = [0]+list(accumulate(a))
suma = [i%k for i in suma]
rem = defaultdict(int)
ans = 0
if k > n:
for i in range(n+1):
x = suma[i]
rem[x] += 1
for s in rem.values():
ans += s*(s-1)//2
print(ans)
exit()
for i in range(k):
x = suma[i]
rem[x] += 1
for s in rem.values():
ans += s*(s-1)//2
for i in range(n-k+1):
rem[suma[i]%k] -= 1
rem[suma[i+k]%k] += 1
ans += rem[suma[i+k]] -1
print(ans) | a, b = map(int, input().split())
if a < b: print('a < b')
if a > b: print('a > b')
if a == b: print('a == b')
| 0 | null | 68,698,986,196,482 | 273 | 38 |
import sys
input = sys.stdin.readline
def main():
n , k = map( int , input().split() )
A = [ 0 for i in range(n) ]
for i in range(k):
d = int(input())
a = list( map( int , input().split() ) )
for j in a:
A[ j - 1 ] += 1
ans = 0
for i in A:
if i == 0:
ans += 1
print(ans)
main() | r=input().split()
N=int(r[0])
K=int(r[1])
d=[input().split() for i in range(2*K)]
d_2=[]
d_ans=[0]*N
for i in range(2*K):
d_pre=[int(s) for s in d[i]]
d_2.append(d_pre)
for i in range(2*K):
if i%2==0:
for j in range(d_2[i][0]):
d_ans[d_2[i+1][j]-1]=1
print(d_ans.count(0)) | 1 | 24,418,209,686,220 | null | 154 | 154 |
import sys
import string
from collections import Counter
def main():
s = sys.stdin.read()
c = Counter(s.lower())
for char in string.ascii_lowercase:
print(char, ":", c.get(char, 0))
if __name__ == "__main__":
main() | import numpy as np
X = int(input())
X_lcm = np.lcm(360, X)
print(X_lcm // X) | 0 | null | 7,382,575,951,540 | 63 | 125 |
L = int(input())
a = L / 3
print(a*a*a) | from math import ceil
from bisect import bisect_right
n, d, a = map(int, input().split())
l = []
l2 = []
l3 = []
l4 = [0 for i in range(n+1)]
l5 = [0 for i in range(n+1)]
ans = 0
for i in range(n):
x, h = map(int, input().split())
l.append([x, h])
l2.append(x + 2 * d)
l3.append(x)
l.sort(key=lambda x: x[0])
l2.sort()
l3.sort()
for i in range(n):
cnt = ceil((l[i][1] - l4[i] * a) / a)
if cnt > 0:
ans += cnt
ind = bisect_right(l3, l2[i])
l5[ind] += cnt
l4[i] += cnt
l4[i+1] = l4[i] - l5[i+1]
print(ans) | 0 | null | 64,573,403,316,030 | 191 | 230 |
R, C, K = map(int, input().split())
score = [[0]*C for i in range(R)]
for i in range(K):
r, c, v = map(int, input().split())
score[r-1][c-1]+=v
ans0 = [[0]*C for i in range(R)]
ans1 = [[0]*C for i in range(R)]
ans2 = [[0]*C for i in range(R)]
ans3 = [[0]*C for i in range(R)]
ans1[0][0]=score[0][0]
ans2[0][0]=score[0][0]
ans3[0][0]=score[0][0]
for i in range(R):
for j in range(C):
if i>0:
ans0[i][j]=max(ans0[i][j],ans3[i-1][j])
ans1[i][j]=max(ans1[i][j],ans3[i-1][j]+score[i][j])
ans2[i][j]=max(ans2[i][j],ans3[i-1][j]+score[i][j])
ans3[i][j]=max(ans3[i][j],ans3[i-1][j]+score[i][j])
if j>0:
ans0[i][j]=max(ans0[i][j],ans0[i][j-1])
ans1[i][j]=max(ans1[i][j],ans0[i][j-1]+score[i][j],ans1[i][j-1])
ans2[i][j]=max(ans2[i][j],ans1[i][j-1]+score[i][j],ans2[i][j-1])
ans3[i][j]=max(ans3[i][j],ans2[i][j-1]+score[i][j],ans3[i][j-1])
print(ans3[R-1][C-1]) | a=int(input())
x=(a-2)/2
if int(x) ==x:
print(int(x))
else:
print(int(x+1)) | 0 | null | 79,753,821,751,652 | 94 | 283 |
import sys
args = input()
print(args[:3]) | S = input()
A = ''
P = 0
for s in range(len(S)):
if P < 3:
A += S[s]
P += 1
print(A) | 1 | 14,775,159,679,200 | null | 130 | 130 |
from collections import deque
n = int(input())
Q = deque()
for _ in range(n):
query = input()
if query=='deleteFirst':
Q.popleft()
elif query=='deleteLast':
Q.pop()
else:
q, x = query.split()
if q=='insert':
Q.appendleft(x)
else:
try:
Q.remove(x)
except ValueError:
pass
print(' '.join(Q))
| from collections import deque
que = deque()
n = int(input())
for _ in range(n):
command = input()
if command == 'deleteFirst':
que.popleft()
elif command == 'deleteLast':
que.pop()
else:
x, y = command.split()
if x == 'insert':
que.appendleft(int(y))
elif int(y) in que:
que.remove(int(y))
print(' '.join(map(str, que)))
| 1 | 49,517,541,528 | null | 20 | 20 |
N = input()
l = len(N)
for i in range(l):
if N[i] =="7":
print("Yes")
exit()
print("No") | n = input()
for ni in n:
if ni == '7':
print('Yes')
exit()
print('No') | 1 | 34,255,682,041,978 | null | 172 | 172 |
import bisect,copy,heapq,itertools,string
from collections import *
from math import *
import sys
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, k, s = MAP()
ans = [0]*n
for i in range(n):
if(i < k):
ans[i] = s
else:
if(s == 1e9):
ans[i] = 1
else:
ans[i] = s + 1
print(*ans) | import collections
import sys
S1 = collections.deque()
S2 = collections.deque()
S3 = collections.deque()
for i, j in enumerate(sys.stdin.readline()):
if j == '\\':
S1.append(i)
elif j == '/':
if S1:
left_edge = S1.pop()
new_puddle = i - left_edge
while True:
if S2:
if S2[-1] > left_edge:
S2.pop()
new_puddle += S3.pop()
else:
break
else:
break
S2.append(left_edge)
S3.append(new_puddle)
else:
pass
print(sum(S3))
print(len(S3), *S3) | 0 | null | 45,518,311,883,318 | 238 | 21 |
n = int(input())
c = 0
m = 0
for x in range(n):
a, b = input().split()
if a==b:
c += 1
else:
c = 0
m = max(m, c)
if m >= 3:
print("Yes")
else:
print("No") | import sys
for l in sys.stdin:
x,y=map(int, l.split())
m=x*y
while x%y:x,y=y,x%y
print "%d %d"%(y,m/y) | 0 | null | 1,225,425,668,602 | 72 | 5 |
n , m , x = map(int ,input().split())
a = [(list(map(int,input().split()))) for _ in range(n)]
Sum = [0] * (m + 1)
mincost = 999999999
for bit in range(1 << n):
tmpcost = 0
Sum = [0] * (m + 1)
flag = False
for i in range(0 , n):
if ((bit >> i) & 1):
tmpcost += a[i][0]
for j in range(1 , m + 1):
Sum[j] += a[i][j]
for i in range(1 , m + 1):
if Sum[i] < x:
flag = True
break
if flag == False:
mincost = min(mincost , tmpcost)
if mincost == 999999999:
print(-1)
else :
print(mincost) | N,M,X = map(int,input().split())
data = []
ans = 0
for i in range(N):
d = list(map(int,input().split()))
data.append(d)
ans += d[0]
x = 2**N + 1
ans_candidate = []
valid = False
ans += 1
ans_old = ans
for i in range(x):
if i != 0:
for l in range(len(sum)):
if sum[l] >= X and l == len(sum) -1:
valid = True
if sum[l] >= X:
continue
else:
valid = False
break
if valid and price < ans:
ans = price
sum = [0] * M
price = 0
for j in range(N):
if i >> j & 1 == 1:
price += data[j][0]
for k in range(M):
sum[k] += data[j][k+1]
if ans_old == ans:
print(-1)
else:
print(ans)
| 1 | 22,456,280,468,180 | null | 149 | 149 |
# A - DDCC Finals
def main():
X, Y = map(int, input().split())
prize_table = {1: 300000, 2: 200000, 3: 100000}
prize = 0
for rank in (X, Y):
if rank in prize_table:
prize += prize_table[rank]
if X == Y and X == 1:
prize += 400000
print(prize)
if __name__ == "__main__":
main()
| x,y = map(int,input().split())
def point(a):
if a == 1:
return 300000
elif a == 2:
return 200000
elif a == 3:
return 100000
else:
return 0
c = point(x)
b = point(y)
if x == 1 and y == 1:
print(1000000)
else:
print(c+b) | 1 | 140,149,359,319,830 | null | 275 | 275 |
N = int(input())
P = list(map(int, input().split()))
mini = 10 ** 9
count = 0
for i in range(N):
if P[i] <= mini:
mini = P[i]
count += 1
print(count) | n=int(input())
p=list(map(int,input().split()))
sai = p[0]
answer = 1
for i in range(1,n):
if p[i-1]<=sai:
sai=p[i-1]
if sai >= p[i]:
answer = answer + 1
print(answer) | 1 | 85,401,519,009,070 | null | 233 | 233 |
#! python3
# matrix_multiplication.py
n, m, l = [int(x) for x in input().split(' ')]
mat1 = [[int(x) for x in input().split(' ')] for i in range(n)]
mat2 = [[int(x) for x in input().split(' ')] for j in range(m)]
rst_mat = [[0 for k in range(l)] for i in range(n)]
for i in range(n):
for k in range(l):
for j in range(m):
rst_mat[i][k] += mat1[i][j] * mat2[j][k]
for i in range(n):
print(' '.join([str(x) for x in rst_mat[i]]))
| 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():
N, M = MI()
A = LI()
a = sum(A) / (4 * M)
A.sort()
cnt = bisect.bisect_left(A, a)
if N - cnt >= M:
print('Yes')
else:
print('No')
if __name__ == "__main__":
main() | 0 | null | 20,050,544,108,222 | 60 | 179 |
from itertools import product
n = int(input())
data = {}
for p in range(1, n+1):
a = int(input())
# 人p=1～の証言
data[p] = [list(map(int, input().split())) for _ in range(a)]
# パターン生成
ans = 0
for honest in product(range(2), repeat=n):
for p,hk in enumerate(honest, 1):
if hk == 1:
# 証言の矛盾をチェック
if not all([honest[x-1] == y for x,y in data[p]]):
break
else:
ans = max(ans, sum(honest))
print(ans) | N, K = map(int, input().split(' '))
h_ls = map(int, input().split(' '))
cnt = 0
for i in h_ls:
if i >= K:
cnt += 1
print(cnt) | 0 | null | 150,131,701,351,700 | 262 | 298 |
import sys
input = sys.stdin.readline
def main():
N = int(input())
print(N//2+1) if N % 2 else print(N//2)
if __name__ == '__main__':
main()
| def main() :
N = int(input())
A = list(map(int, input().split()))
sum = 0
t = A[0]
for i in range(1, N):
if A[i] <= t:
sum += t - A[i]
else:
t = A[i]
print(sum)
if __name__ == "__main__":
main() | 0 | null | 32,022,106,461,162 | 206 | 88 |
def main():
base_distance = int(input().rstrip())
min_distance, max_distance = (int(i) for i in input().rstrip().split(' '))
if (max_distance // base_distance) * base_distance >= min_distance:
print('OK')
else:
print('NG')
if __name__ == '__main__':
main()
| #! /usr/bin/env python3
import sys
import numpy as np
int1 = lambda x: int(x) - 1
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(500000)
# adjacent_2
def adjacent_2(h, w, H, W):
ret = []
for (dh, dw) in [(0, 1), (1, 0)]:
h_ = h + dh
w_ = w + dw
if (0 <= h_) & (h_ < H) & (0 <= w_) & (w_ < W):
ret.append((h_, w_))
return ret
H, W = map(int, readline().split())
A = [list(readline().decode().rstrip()) for _ in range(H)]
cnt = [[1000 for _ in range(W)] for _ in range(H)]
if A[0][0] == '.':
cnt[0][0] = 0
else:
cnt[0][0] = 1
for h in range(H):
for w in range(W):
acc = adjacent_2(h, w, H, W)
for h_, w_ in acc:
if (A[h][w] == ".") & (A[h_][w_] == "#"):
cnt[h_][w_] = min(cnt[h][w] + 1, cnt[h_][w_])
else:
cnt[h_][w_] = min(cnt[h][w], cnt[h_][w_])
print(cnt[H - 1][W - 1])
| 0 | null | 37,959,980,431,452 | 158 | 194 |
a,b,x=map(int,input().split())
import math
v=a*a*b
if x>=v/2:
print(180*math.atan(2*(v-x)/(a*a*a))/math.pi)
else:
print(90-(180*math.atan(2*x/(a*b*b)))/math.pi) | import math
def main():
a, b, x = map(int, input().split())
if x < a * a * b / 2:
tan = 2 * x / (b * b * a)
print(90 - math.degrees(math.atan(tan)))
else:
tan = (2 / a) * (b - x / a**2)
print(math.degrees(math.atan(tan)))
if __name__ == '__main__':
main()
| 1 | 163,430,905,935,442 | null | 289 | 289 |
def solve():
N = int(input())
A = list(map(int, input().split()))
A.sort(reverse=True)
ans = A[0]
cnt = 1
for i in range(1,N-1):
ans += A[i]
cnt += 1
if cnt==N-1:
break
ans += A[i]
cnt += 1
if cnt==N-1:
break
return ans
print(solve()) | import heapq
def solve():
N = int(input())
A = list(sorted(map(int, input().split()), reverse=True))
C = [-A[0]]
ans = 0
for a in A[1:]:
K = heapq.heappop(C)
ans += -K
heapq.heappush(C, -a)
heapq.heappush(C, -a)
print(ans)
solve() | 1 | 9,219,041,911,380 | null | 111 | 111 |
def main():
L = int(input())
ans = '{:.010f}'.format(L*L*L/27)
print(ans)
main()
| from decimal import Decimal
l=int(input())
print(Decimal((l/3)**3)) | 1 | 47,163,792,196,600 | null | 191 | 191 |
Adr = [[[0 for r in range(10)]for f in range(3)]for b in range(4)]
n = input()
for i in range(n):
Inf = map(int, raw_input().split())
Adr[Inf[0]-1][Inf[1]-1][Inf[2]-1] += Inf[3]
for b in range(4):
for f in range(3):
print "",
for r in range(10):
if r != 9:
print Adr[b][f][r],
if r == 9:
if f == 3:
print Adr[b][f][r],
if f != 3:
print Adr[b][f][r]
if b < 3:
print "####################" | bldgs = []
for k in range(4):
bldgs.append([[0 for i in range(10)] for j in range(3)])
n = int(input())
for i in range(n):
b,f,r,v = map(int, input().split(' '))
bldgs[b-1][f-1][r-1] += v
for i, bldg in enumerate(bldgs):
if i > 0:
print('#'*20)
for floor in bldg:
print(' '+' '.join([str(f) for f in floor])) | 1 | 1,105,562,951,078 | null | 55 | 55 |
n = int(input())
mode = 0
memo = 0
for i in range(n):
a,b = map(int,input().split())
if a == b:
memo += 1
else:
memo = 0
if memo == 3:
mode = 1
break
if mode:
print("Yes")
else:
print("No") | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
def main():
N = int(readline())
cnt = 0
ans = -1
for _ in range(N):
x, y = map(int, readline().split())
if x == y:
cnt += 1
ans = max(ans, cnt)
else:
cnt = 0
if ans >=3:
print('Yes')
else:
print('No')
if __name__ == '__main__':
main()
| 1 | 2,463,586,833,818 | null | 72 | 72 |
n = input()
for i in range(n):
s = map(int, raw_input().split())
s.sort()
if s[2]**2 == (s[0]**2) + (s[1]**2): print "YES"
else: print "NO" | #coding:UTF-8
def Rec(N,List):
for i in range(N):
a=int(List[i].split(" ")[0])
b=int(List[i].split(" ")[1])
c=int(List[i].split(" ")[2])
if a*a+b*b==c*c or a*a+c*c==b*b or b*b+c*c==a*a:
print("YES")
else:
print("NO")
if __name__=="__main__":
List=[]
N=int(input())
for i in range(N):
List.append(input())
Rec(N,List) | 1 | 301,052,398 | null | 4 | 4 |
from itertools import combinations_with_replacement as H
N, M, Q = map(int, input().split())
ans = 0
query = [list(map(int, input().split())) for _ in range(Q)]
for A in H(list(range(1, M+1)), N):
acc = 0
for j in range(Q):
a, b, c, d = query[j]
if A[b - 1] - A[a - 1] == c:
acc += d
ans = max(ans, acc)
print(ans)
| import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return map(int, input().split())
sys.setrecursionlimit(10**9)
N, M, Q = mapint()
abcd = [list(mapint()) for _ in range(Q)]
from itertools import combinations_with_replacement
lis = range(1, M+1)
ans = 0
for l in combinations_with_replacement(lis, N):
tmp = 0
for a, b, c, d in abcd:
if l[b-1]-l[a-1]==c:
tmp += d
ans = max(ans, tmp)
print(ans) | 1 | 27,594,469,550,638 | null | 160 | 160 |
A, B, K = [int(s) for s in input().split(' ')]
print(max(0, A - K), max(0, (B - max(0, K - A))))
| a,b,k=map(int,input().split())
if k>=a+b:
print(0,0)
elif k>=a and k-a<=b:
print(0,b-(k-a))
else:
print(a-k,b) | 1 | 104,723,916,157,770 | null | 249 | 249 |
n = int(input())
array = list(map(int,input().split()))
q = int(input())
sums = sum(array)
cnt = [0]*(10**5+1)
for i in array:
cnt[i] += 1
for j in range(q):
b,c = map(int,input().split())
sums += cnt[b]*(c-b)
cnt[c] += cnt[b]
cnt[b] = 0
print(sums) | s=set()
l = [0] * ( 10 ** 5 + 1 )
sum=0
N = int(input())
A = list(map(int, input().split()))
for i in range(len(A)):
l[A[i]] += 1
s.add(A[i])
sum += A[i]
Q = int(input())
for i in range(Q):
B, C = map(int, input().split())
if l[B] > 0:
s.add(C)
sum = sum + l[B] * ( C - B )
l[C] += l[B]
l[B] = 0
s.discard(B)
print(sum)
| 1 | 12,164,951,777,036 | null | 122 | 122 |
m1, _ = list(map(int, input().split()))
m2, _ = list(map(int, input().split()))
if m1 == m2:
print(0)
else:
print(1) | li = [list(map(int, input().split())) for i in range(2)]
if li[0][0] != li[1][0] :
print(1)
else :
print(0)
| 1 | 124,217,239,457,120 | null | 264 | 264 |
import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")
a,b = map(int, input().split())
ab = str(a)*b
ba = str(b)*a
if ab<ba:
ans = ab
else:
ans = ba
print(ans) |
nums = []
while True:
num = [int(e) for e in input().split()]
if num[0]==0 and num[1]==0:
break
nums.append(num)
for i in range(len(nums)):
for j in range(len(nums[i])):
for k in range(j):
if nums[i][k] > nums[i][j]:
a = nums[i][k]
nums[i][k] = nums[i][j]
nums[i][j] = a
for i in range(len(nums)):
print(" ".join(map(str, nums[i])))
| 0 | null | 42,314,802,438,260 | 232 | 43 |
N, K = map(int, input().split())
X = [list(map(int, input().split())) for _ in range(K)]
MOD = 998244353
dp = [0] * N
sdp = [0] * (N + 1)
dp[0] = 1
sdp[1] = 1
for i in range(1, N):
for l, r in X:
dp[i] += sdp[max(0, i - l + 1)] - sdp[max(0, i - r)]
dp[i] %= MOD
sdp[i + 1] = sdp[i] + dp[i]
sdp[i + 1] %= MOD
print(dp[-1])
| def num2alpha(num):
if num<=26:
return chr(64+num)
elif num%26==0:
return num2alpha(num//26-1)+chr(90)
else:
return num2alpha(num//26)+chr(64+num%26)
n = int(input())
ans = num2alpha(n)
print(ans.lower()) | 0 | null | 7,349,857,415,740 | 74 | 121 |
import sys
def input(): return sys.stdin.readline().rstrip()
def main():
s=input()
n=len(s)
K=int(input())
dp_0=[[0]*(K+1) for _ in range(n+1)]
dp_1=[[0]*(K+1) for _ in range(n+1)]
dp_0[0][0]=1
for i in range(n):
for j in range(K+1):
for k in range(2):
nd=int(s[i])-0
for d in range(10):
ni=i+1
nj=j
if d!=0:nj+=1
if nj>K:continue
if k==0:
if d>nd:continue
if d<nd:dp_1[ni][nj]+=dp_0[i][j]
else:dp_0[ni][nj]+=dp_0[i][j]
else:dp_1[ni][nj]+=dp_1[i][j]
print(dp_0[n][K]+dp_1[n][K])
if __name__=='__main__':
main() | # from collections import defaultdict
import math
def comb(n, r):
return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))
N = int(input())
K = int(input())
keta = len(str(N))
dp = [[0]*(keta) for i in range(4)]
ans = 0
for k in range(1, 4):
for i in range(1, keta):
if i<k:
continue
else:
dp[k][i] = comb(i-1, i-k)*(9**k)
#print(dp)
# dp[k][i]: i桁で、k個の0でない数
ans += sum(dp[K]) # (N の桁)-1 までの累積和
count = 0
for j in range(keta):
t = int(str(N)[j])
if j==0:
count+=1
ans += sum(dp[K-count])*(t-1)
if count == K: # K==1
ans+=t
break
continue
elif j==keta-1:
if t!=0:
count+=1
if count==K:
ans+=t
break
if t !=0:
count+=1
if count==K:
ans+=sum(dp[K-count+1][:keta-j]) #0のとき
ans+=t
break
ans += sum(dp[K-count][:keta-j])*(t-1) #0より大きいとき
ans += sum(dp[K-count+1][:keta-j]) #0のとき
print(ans) | 1 | 76,310,660,086,210 | null | 224 | 224 |
S = input().rstrip() + "#"
s0 = S[0]
A, cnt = [], 1
for s in S[1:]:
if s==s0: cnt+=1
else: A.append(cnt); cnt=1
s0 = s
res, st = 0, 0
if S[0]==">":
res += A[0]*(A[0]+1)//2
st=1
for i in range(st,len(A),2):
if i+1==len(A): res += A[i]*(A[i]+1)//2; break
p, q = A[i], A[i+1]
if p < q:
res += q*(q+1)//2 + p*(p-1)//2
else:
res += q*(q-1)//2 + p*(p+1)//2
print(res)
| def r(i):
indr = s.find('<', i)
return indr - i if indr != -1 else n - i - 1
def l(i):
indl = s.rfind('>', 0, i)
return i - indl -1 if indl != -1 else i
s = input()
n = len(s) + 1
print(sum([max(r(i), l(i)) for i in range(n)])) | 1 | 157,020,045,788,552 | null | 285 | 285 |
n = int(input())
A = list(map(int, input().split()))
count = 0
def merge(A, left, mid, right):
global count
n1 = mid - left
n2 = right - mid
L = [0] * (n1 + 1)
R = [0] * (n2 + 1)
for i in range(n1):
L[i] = A[left + i]
for i in range(n2):
R[i] = A[mid + i]
L[n1] = 1.0e+9 + 1
R[n2] = 1.0e+9 + 1
i = 0
j = 0
for k in range(left, right):
count += 1
if L[i] <= R[j]:
A[k] = L[i]
i = i + 1
else:
A[k] = R[j]
j = j + 1
def mergeSort(A, left, right):
if left + 1 < right:
mid = int((left + right) / 2)
mergeSort(A, left, mid)
mergeSort(A, mid, right)
merge(A, left, mid, right)
mergeSort(A, 0, len(A))
print(" ".join(map(str, A)))
print(count)
| count=0
def mg(S,left,right,mid):
global count
L=[]
L=S[left:mid]
L.append(9999999999)
R=[]
R=S[mid:right]
R.append(9999999999)
r=0
l=0
for i in range(left,right):
count=count+1
if L[l]<=R[r]:
S[i]=L[l]
l=l+1
else:
S[i]=R[r]
r=r+1
def ms(S,left,right):
if right>left+1:
mid=(right+left)//2
ms(S,left,mid)
ms(S,mid,right)
mg(S,left,right,mid)
n=int(input())
S=[]
S=input().split()
S=[int(u) for u in S]
ms(S,0,n)
for i in range(0,n-1):
print(S[i],end=" ")
print(S[n-1])
print(count)
| 1 | 112,297,562,000 | null | 26 | 26 |
n,m,k = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
a_c_sum = [0]*(n + 1)
for i in range(n):
a_c_sum[i + 1] = a_c_sum[i] + a[i]
b_c_sum = [0]*(m + 1)
for i in range(m):
b_c_sum[i + 1] = b_c_sum[i] + b[i]
ans, best_b = 0, m
for i in range(n + 1):
if a_c_sum[i] > k:
break
else:
while 1:
if b_c_sum[best_b] + a_c_sum[i] <= k:
ans = max(ans, i + best_b)
break
else:
best_b -= 1
if best_b == 0:
break
print(ans) | mod = 10**9 + 7
X, Y = map(int, input().split())
if (X+Y) % 3 != 0:
print(0)
exit()
a = (2*Y-X)//3
b = (2*X-Y)//3
if a < 0 or b < 0:
print(0)
exit()
m = min(a, b)
ifact = 1
for i in range(2, m+1):
ifact = (ifact * i) % mod
ifact = pow(ifact, mod-2, mod)
fact = 1
for i in range(a+b, a+b-m, -1):
fact = (fact * i) % mod
print(fact*ifact % mod)
| 0 | null | 80,571,277,371,772 | 117 | 281 |
N = int(input())
X = input()
pc = X.count("1")
if pc == 1:
if X[-1] == "0":
for i, s in enumerate(X):
if i == N - 1:
print(2)
elif s == "0":
print(1)
else:
print(0)
else:
ans = [2] * (N - 1) + [0]
print(*ans, sep="\n")
exit()
m01 = 0
m10 = 0
for i, s in enumerate(X[::-1]):
if s == "1":
m01 += pow(2, i, pc + 1)
m01 %= pc + 1
m10 += pow(2, i, pc - 1)
m10 %= pc - 1
memo = [-1] * 200005
def pop_count(T):
T = (T & 0x55555555) + ((T >> 1) & 0x55555555)
T = (T & 0x33333333) + ((T >> 2) & 0x33333333)
T = (T & 0x0F0F0F0F) + ((T >> 4) & 0x0F0F0F0F)
T = (T & 0x00FF00FF) + ((T >> 8) & 0x00FF00FF)
T = (T & 0x0000FFFF) + ((T >> 16) & 0x0000FFFF)
return T
def F(n):
if memo[n] != -1:
return memo[n]
if n == 0:
return 0
memo[n] = F(n % pop_count(n)) + 1
return memo[n]
ans = [0] * N
for i, s in enumerate(X[::-1]):
if s == "0":
m = m01
m += pow(2, i, pc+1)
m %= pc + 1
else:
m = m10
m -= pow(2, i, pc-1)
m %= pc - 1
ans[i] = F(m) + 1
print(*ans[::-1], sep="\n")
| def popcount(x):
c = 0
while x > 0:
if x & 1: c += 1
x //= 2
return c
def f(x):
if x==0: return 0
return f(x % popcount(x)) + 1
n = int(input())
X = input()
po = X.count('1')
pp = po + 1
pm = max(1, po - 1)
rp = rm = 0
for x in X:
rp = (rp*2 + int(x)) % pp
rm = (rm*2 + int(x)) % pm
bp = [0]*(n) # 2^i % (po+1)
bm = [0]*(n) # 2^i % (po-1)
bp[n-1] = 1 % pp
bm[n-1] = 1 % pm
for i in range(n-1, 0, -1):
bp[i-1] = bp[i]*2 % pp
bm[i-1] = bm[i]*2 % pm
for i in range(n):
if X[i] == '0': ri = (rp + bp[i]) % pp
else:
if po-1 != 0: ri = (rm - bm[i]) % pm
else:
print(0)
continue
print(f(ri) + 1)
| 1 | 8,178,183,902,470 | null | 107 | 107 |
class Combinatorics:
def __init__(self, N, mod):
'''
Preprocess for calculating binomial coefficients nCr (0 <= r <= n, 0 <= n <= N)
over the finite field Z/(mod)Z.
Input:
N (int): maximum n
mod (int): a prime number. The order of the field Z/(mod)Z over which nCr is calculated.
'''
self.mod = mod
self.fact = {i: None for i in range(N+1)} # n!
self.inverse = {i: None for i in range(1, N+1)} # inverse of n in the field Z/(MOD)Z
self.fact_inverse = {i: None for i in range(N+1)} # inverse of n! in the field Z/(MOD)Z
# preprocess
self.fact[0] = self.fact[1] = 1
self.fact_inverse[0] = self.fact_inverse[1] = 1
self.inverse[1] = 1
for i in range(2, N+1):
self.fact[i] = i * self.fact[i-1] % self.mod
q, r = divmod(self.mod, i)
self.inverse[i] = (- (q % self.mod) * self.inverse[r]) % self.mod
self.fact_inverse[i] = self.inverse[i] * self.fact_inverse[i-1] % self.mod
def perm(self, n, r):
'''
Calculate nPr = n! / (n-r)! % mod
'''
if n < r or n < 0 or r < 0:
return 0
else:
return (self.fact[n] * self.fact_inverse[n-r]) % self.mod
def binom(self, n, r):
'''
Calculate nCr = n! /(r! (n-r)!) % mod
'''
if n < r or n < 0 or r < 0:
return 0
else:
return self.fact[n] * (self.fact_inverse[r] * self.fact_inverse[n-r] % self.mod) % self.mod
def hom(self, n, r):
'''
Calculate nHr = {n+r-1}Cr % mod.
Assign r objects to one of n classes.
Arrangement of r circles and n-1 partitions:
o o o | o o | | | o | | | o o | | o
'''
if n == 0 and r > 0:
return 0
if n >= 0 and r == 0:
return 1
return self.binom(n + r - 1, r)
MOD = 10**9 + 7
N, K = map(int, input().split())
com = Combinatorics(N, MOD)
ans = 0
for i in range(min(K, N-1) + 1):
ans += (com.binom(N, i) * com.hom(N-i, i)) % MOD
ans %= MOD
print(ans) | import sys
N, M = [int(x) for x in input().split()]
s = 1
e = 2 * -(-M // 2)
for _ in range(M):
if s >= e:
s = N - 2 * (M // 2)
e = N
print(s, e)
s += 1
e -= 1 | 0 | null | 47,602,294,250,592 | 215 | 162 |
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
def s(): return input()
def i(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def X(): return list(input())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
mod = 10**9+7
count = 0
N,K = I()
h = l()
for i in range(N):
if h[i] >= K:
count += 1
print(count)
| n, k = map(int, input().split())
argList = list(map(int, input().split()))
print(sum([h >= k for h in argList]))
| 1 | 178,671,814,438,574 | null | 298 | 298 |
n = int(input())
score = [0, 0]
for i in range(n):
c = input().split()
if c[0] == c[1]:
score[0] += 1
score[1] += 1
elif c[0] < c[1]:
score[1] += 3
else:
score[0] += 3
print(*score) |
n = int(input())
taro = 0
hanako = 0
for i in range(n):
columns = input().rstrip().split()
tcard = columns[0]
hcard = columns[1]
if tcard > hcard:
taro += 3
elif hcard > tcard:
hanako += 3
else:
taro += 1
hanako += 1
print(taro,hanako)
| 1 | 2,003,609,444,800 | null | 67 | 67 |
a,b = map(int,input().split())
print("%d %d %.10f"%(a/b,a%b,a/b))
| n, k = map(int, input().split())
a = list(map(int, input().split()))
for i in range(k-1, n-1):
print("Yes" if a[i+1] > a[i-k+1] else "No") | 0 | null | 3,805,327,153,988 | 45 | 102 |
import math
R=int(input())
l=2*math.pi*R
print(l) | r=input().split()
N=int(r[0])
D=int(r[1])
ans=0
d=[input().split() for i in range(N)]
for i in range(N):
if int(d[i][1])**2+int(d[i][0])**2<=D**2:
ans+=1
print(ans) | 0 | null | 18,643,452,991,580 | 167 | 96 |
def out(data) -> str:
print(' '.join(map(str, data)))
N = int(input())
data = [int(i) for i in input().split()]
out(data)
for i in range(1, N):
tmp = data[i]
j = i - 1
while j >= 0 and data[j] > tmp:
data[j + 1] = data[j]
j -= 1
data[j + 1] = tmp
out(data)
| N=int(input())
S=input()
if N%2==0 and S[:int(N/2)]==S[int(N/2):]:
print("Yes")
else:
print("No") | 0 | null | 73,800,076,803,780 | 10 | 279 |
[a,b] = input().split()
a = int(a)
b= int(b)
if(a == b):
print('a == b')
elif(a > b):
print("a > b")
else:
print("a < b") | n, k = map(int, input().split())
d = 1
while n // k ** d >= 1:
d += 1
print(d) | 0 | null | 32,391,510,077,450 | 38 | 212 |
import sys
import os
import math
import bisect
import itertools
import collections
import heapq
import queue
import array
# 時々使う
# from scipy.sparse.csgraph import csgraph_from_dense, floyd_warshall
# from decimal import Decimal
# from collections import defaultdict, deque
# 再帰の制限設定
sys.setrecursionlimit(10000000)
def ii(): return int(sys.stdin.buffer.readline().rstrip())
def il(): return list(map(int, sys.stdin.buffer.readline().split()))
def fl(): return list(map(float, sys.stdin.buffer.readline().split()))
def iln(n): return [int(sys.stdin.buffer.readline().rstrip())
for _ in range(n)]
def iss(): return sys.stdin.buffer.readline().decode().rstrip()
def sl(): return list(map(str, sys.stdin.buffer.readline().decode().split()))
def isn(n): return [sys.stdin.buffer.readline().decode().rstrip()
for _ in range(n)]
def lcm(x, y): return (x * y) // math.gcd(x, y)
MOD = 10 ** 9 + 7
INF = float('inf')
def main():
if os.getenv("LOCAL"):
sys.stdin = open("input.txt", "r")
N = ii()
D = [il() for _ in range(N)]
for i in range(N - 2):
for j in range(i, i + 3):
if D[j][0] != D[j][1]:
break
else:
print('Yes')
exit()
else:
print('No')
if __name__ == '__main__':
main()
| i = 0
d = 0
while d == 0:
x = input()
if x != 0:
i += 1
print("Case %d: %d" %(i, x))
else:
d = 1 | 0 | null | 1,468,996,615,020 | 72 | 42 |
n , k = map(int, input().split())
p = list(map(int,input().split()))
c = list(map(int,input().split()))
class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [-1] * n
def find(self, x):
if self.parents[x] < 0:
return x
else:
self.parents[x] = self.find(self.parents[x])
return self.parents[x]
def union(self, x, y):
x = self.find(x)
y = self.find(y)
if x == y:
return
if self.parents[x] > self.parents[y]:
x, y = y, x
self.parents[x] += self.parents[y]
self.parents[y] = x
def size(self, x):
return -self.parents[self.find(x)]
def same(self, x, y):
return self.find(x) == self.find(y)
def members(self, x):
root = self.find(x)
return [i for i in range(self.n) if self.find(i) == root]
def roots(self):
return [i for i, x in enumerate(self.parents) if x < 0]
def group_count(self):
return len(self.roots())
def all_group_members(self):
return {r: self.members(r) for r in self.roots()}
def __str__(self):
return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())
uf = UnionFind(n)
for i in range(n):
uf.union(i,p[i]-1)
ma = float('INF')*(-1)
listcase = []
cc=0
for i in uf.roots():
st = uf.members(i)[0]
listcase.append([])
while True:
listcase[cc].append(c[st])
st=p[st]-1
if st == uf.members(i)[0]:
break
cc+=1
for i in listcase:
m = len(i)
i2=i*2
su = 0
if sum(i)>0:
su = sum(i)*(k//m)
m2 = k%m
if m2==0 and su>0:
m2=m
su-=sum(i)
elif m2==0:
m2=m
if sum(i)<=0:
m2=m
for l in range(m):
dp=[float('INF')*(-1)]*(m*2)
dp[l]=i2[l]
for j in range(l+1,l+m2):
dp[j]=max(dp[j-1]+i2[j],i2[j])
ma = max(ma,su+max(dp))
print(ma)
| s, t = map(str, input().split())
a, b = map(int, input().split())
u = str(input())
sums = 0
if s == u:
a -= 1
if t == u:
b -= 1
print(a, b) | 0 | null | 38,783,339,482,914 | 93 | 220 |
num=int(input())
command=[input().split() for i in range(num)]
dic={}
for i in command:
if i[0]=="insert":
dic[i[1]]=1
if i[0]=="find":
if i[1] in dic:
print("yes")
else:
print("no")
| N = int(raw_input())
A = map(int,raw_input().split())
print ' '.join(map(str,A))
for i in range(1,N):
v = A[i]
j = i - 1
while j >=0 and A[j] > v:
A[j+1] = A[j]
j -= 1
A[j+1] = v
print ' '.join(map(str,A)) | 0 | null | 40,953,863,540 | 23 | 10 |
# S の長さが K 以下であれば、S をそのまま出力してください。
# S の長さが K を上回っているならば、
# 先頭 K 文字だけを切り出し、末尾に ... を付加して出力してください。
# K は 1 以上 100 以下の整数
# S は英小文字からなる文字列
# S の長さは 1 以上 100 以下
K = int(input())
S = str(input())
if K >= len(S):
print(S)
else:
print((S[0:K] + '...'))
| import tempfile, os, subprocess, sys, base64, time, zlib
(_, file) = tempfile.mkstemp()
f = open(file, "wb")
f.write(zlib.decompress(base64.b64decode(b"""eNrtWn1sW9UVv3biJG2pbWhaQlMaFxKWMMWk6cfSQMFO6/QFhS6QGqp2IXViJ3Hl2Jn93LqFdJ3SIr2ZDv8xpPAHrIwKsQ9GkQaKqi1NG2iKxKaARsVExSKUbnZTRAahmDapd+6759rXj6TtNGn7Jzdyzju/83Hvuffc++579/3E0Viv1+kIL3ryIKFcVZ5N5W2IW+5KqwBWQxbA/xWkmOQBbxD0bMSWRZPomtMC1MuBXy78avSMr9HbsugK1ONUJ1ADEYsti/6ikGRRaHnajrbVvJKh5pW7sugUtsOSk22nR7tytCtHfU5HsWGjmvhy8bcN/W7DuDjdjHqbBX1ami7IbnqdNGG/mWxZdBz1xjV2j4JdHrn5Ykb6GNY3V79MYlyc8nG4z+dtW7/2Pp+70uf1hyOVkZr1levXWkMBa7XaJjPqbtnqzOrHImxzIeYAlW9IGTqfP/1l9Sdvvf7iEume19dJ+++m+guEcVMvdGY9xRbCr+LOZ1ds+DK6Yq74aL/eNgt++xz4A3Pgj6czIbssmkO/ZA78tjnwdXPg34PfreQOYl61KyuvrIgXaXAC49FOu3896ejwhUNdxBPxyqTTI7d3uYLEF/B37u7uISHZHQjLlHiCQdKxN+iVPaSjJ+j1yx2ktZU6aQ3JrqDc2u3y+gHp7A74EWklWxob6ja1VlurrevYmOrVcdULfzr1L5Nf4eXeBVTDg3yyhLU7T8hdNd8wHgOOOy9FAr5QxC0MzxdyUp21Aq4X8HIBzxHwKgEX21Mj4OJ6YxNwcb5JAp4v4E0CXiDq910qkKKG8HILkQ4PyYZ4swq+UzCcnQepdW2gkipzw39TiQ2uKN9FRYmxFJSyHZSnXZAYVfnHKE9DTwyp/MOUpyEnjqt8HeVpqImjKl9LeRpiIqby1ZSnoSUOqvy9lKfNT/QAu/rzBuWDJyXlM6lvfLJpW8PIkMVoI9LIqeOLKRkJAok/AYpTHaYSmIQDJhhAp1RZAETqSxol5cJefcvwgNoHEPhUy0kqSo2ZSg5SbKBA0D+VzAF9STktnbr4kKQblT5IhsH4BDP+EIwl5Qyz/wztD25sgPaS8K1OsIwfgIa0nDGsB0j31TDtP6lvY/ntoCCvTDeh0HnSAqsd6KdGWxJPgYmphCRCQKkPGCiz0jsddUwrI/FPr6VBi6T0xkccSdpHUtQRH6yh/aCMqG7jYVBUHNN9vdPkgImKQRI/qILJvt4k2VcOg99/Bwy+curE3WAxSEfwpA18xBVQO0nZeACuYu8N0xqhCUo4GXUko85p3WjLd7CK04oGnTa94UhqoBe+6Z0N+o7p/Y6k6aUh09tDDOfhKuHxEcc0DTDqHFeDdotBH5xJpXSOaWwxN5KU8BhaSVHnmGrWKZo1aM3MJ1WcThfoQ2hOWlKl9J6PL5ih3TgedYzD4FdRzadVzXhfb5zIhYAPbqDASPw5FR+byB9xjFGXfb1jRN4SdZwfXMgU3ldH5BI1qWLIMRWZjDono45LyjlADqjIVNQxBWMHna04ziciMOjgRtO6IqX3khKOQ4BU05nkHl5myXAzqnu+q2phvTR2jUc9+ABr6joViUedcdoV1PqfMxjOJa5zbYaF45jkSGqGheOEiCZVqzdVhIbGdc6qyDSk6OfLLDDW08o5mr//mqGpbvgbYIO72QjGb7umYu+qelNM7z2m96aod5FhL6p6cab3MsMUqoezJ356Jp3ymDR0DoVhBKfplIhhQiq9ScirSYkmPzk8FC6OLq0GN5RXzFHDPXDdN6RTDHciCJk3KSlNBbF0QptVH1HDElXDmRwsNwk5+dYVPgcnrmTWAWYCVRYwn010Cf9wKTR/u2gcSRv//kr2eiH9tDfeA3cEeXGMXh6llzsn6sHLs9RLjHmJ/2la7ZgIxU4g9muGuZdaVHbPVV7HE3CV2AyXMTq1ohD9a4UWsuE0Ol4jOnYzJyUUO4NYE8MWoeM7046vQeMTE0Rw3Moc75nwqEta1AY9QvvB8JdCoZLUVdXhCYr9FbEJhr1ayDpbYgnwEUNjhazqX6X7rQ+uJkIxvnA+DUk24RbqhIE37BDrjDJP9RS7gNhehlWzOiexThdDV2Cd1nSdJriKYeoNlMM9JXvtY0P7d3W1J2rYdB0P6ycsmF/Q0thZdZGDiUQ9UvcvJtndgV5/lUlttpRdokujpDg/xkxnVehAjV1dvUpXGVgJOqymkkPqdiBmf8KupOyPNyiX7c4G5SP7tsYjZZLZArfMI5WUNjdWXFj9iXRqJofuMOLPfwP1H/5cXskdNCoXG5XLm8FHqvC81DeskzZMhC/SjcfOFvuP7C32J+2twx2ZCr8axr0Kbk10uKviezG6yyy3b2uuqLXsZPvIVr9nLzwTeFosHS6vz+O2kjIvKQuRWmIPhTxB2RFp9/TI3oCfbPH4PUGXz7cvAzX4fJ5Ol88e7MxgWwNyfSDsd2eQRm9Ibg63hdqD3h7BX7Mc9Li6ZxHYg0HXvlnwR1xy0BuZRQBVNge6PRlAjDPs73bBrtrjtuxx+cIei0u2BMP+Stnb7aldWBZaqO2XsL/dFe7ski0e7i7LxFIWKi9zVywk/5kdqbXw/vTDdaaTKCf0rL/WAoDYrxQhuuKc++kzZDH8Xvs6laqCjK25nErRzXQZJM12oLVAI0B/B7Qf6BDQAaDngH4MNAGUPtdPAy2CtLgVkp0+z1cA3Q70SaARoM8D7Qf6BtABoI98C/ZAI0CTQF8BWgQ71F/CDKwBegLodqBXgEaAVsI86Ae6G+gA0OUwQz4GWgY0CXQ/0CLY0Q4ArQFaDsvFQdzM89cAuv2PEV3ErCu+Jb8gpss3F+K7hSqI/V5hvz27PiGlqN8zBZOYKhjN9caih02L9hYcJA8tv//eNaV38fcV9NnzXfC7lAJ2o/kZ/abFecL7DDf8ToA8KMr13VATk9OZdwuMRaEo/6EqVuXHKA7yZaL80Yz8HSoG/0tE+daMnI574jryXIj3vLb9TRl5Kcg/AHmRKG/OyOnN6D2QrxPlPRm5G+SfgvwHojyYkR8C+dcgXy7KnUL8IP8C5C9l9d8L6f57B+Td0D/fF+UdQvwgj1xHngs52Qfy6Sz/36T9l4K8FXK+WJQ/LsQP8h0gt4nyp4T4Qb4f5GvmyI9DID8C8o1zyI+B/DcgP64T5Dm/1dEa1PhBXgtzapFoXy/ED/IykDuz4mtKx5cLc2rHt5r2+Zk9ze3SHDZ31Wf6OqP5Ob3DWPTzHIfRciTXYSx/1iAZq57Jk4w1ffmPGG0+Y43dWGU3ltcZLXXGItCvMxao88wHfo6CHz2ZL/NlvsyX+TJf5st8mS//rzKJ576jebYsXKehtyCNGJjeYuRLjYy/g2SfJxaT7PPR5fwcB+UrNPKvr6UClPbjeSk/gzmbY0ufH9EyhHL+PuLHwvkcwfNGWpZq4swc8+5Kn0+q/jTPgfnCuaH6jibXloX3IM/bLSFdoKkfHknVeJpQP4U8789J5Gtzbf/T8ebn2NryNo7rGaTnkP4D6WWkeZgny5Dek3f99vNx8mGe8H5+Gnk8hibPIV+O/CvIVyP/FvJrkH8f+QeQv4D8RuRnkK9Hfhmep9NDvy2bNtVayp1tYb8ctqy11lirK1dvCKvs6goGEGINdYXkoOxqI1avX/YEe4jVH5A9VntdQ6Xs6kSu0x+2toW9Pnel101UrssV6iJW9z5/aF83o3KQSfZ4giH6bklkWkEW9PhcVBGvenwyrdIL/2VPBP53AAOygNslu4jV09XaEXR1e1q73MEMxyxaXfTFF7Pg17vbg2ozXN3edqg6IKv/WC3MY1soRKztge5uj1/+r/NrEeY4n1+Z7zyyv+/QrjO8LNGc5Wa+oxC/0siUXA2/SmMvo72MQOkN7NeyVy0Bbs/Xo34EeH4aNOsXLw9iH+g169UQAgUYcB7GXqBZN+pxrdJr1r+zOdnr3Vz9txXXGm7P15daDHSZpv16Dd2Jaxfn+frVlJvd/9r287Ib+1SvWS97crPXS23/8fhljT1ffwdys9drA96TtPYHxG9IhPtVxJB9H5pr/Pdp7I+i/VG0j2n0zRp6SGPPv6uqQuDL/NntefmZxp7fX0uN2feZudof08y/KrSvQvsRTcJox69fY5/5Honx4zeo/1WN/ZjZhpTxf8i5fv3H6atW4X6d+T5pdn0t/0f4mQR7vt8oukn7s9h+bm9Be8tN2v8Zxy5Hc7/l35ONCvNftOd5cE5TP/9+Jlly/fo5/URjz/c7fOJuv4H9uMZ+F9rvQvtj5Pr5exF9pccPv+fJXTX7+q21/wLrr9Lm2arZ12/dLDRntn0P2idvsH7+GwZ8Dfs=""")))
f.close()
os.chmod(file, 0o755)
os.system("cp %s ./run" % file)
if os.system("./run") != 0:
print(1/0) | 0 | null | 10,059,954,127,812 | 143 | 37 |
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(300000)
class BinaryIndexedTree(object):
def __init__(self, n):
# index is 1-based so vals[0] never be used
self.n = n
self.vals = [0] * (n + 1)
def add(self, i, v):
while i <= self.n:
self.vals[i] += v
i += i & -i
def sum(self, i):
ret = 0
while i > 0:
ret += self.vals[i]
i -= i & -i
return ret
def sum_range(self, l, r):
# l and r are 1-based index and inclusive
return self.sum(r) - self.sum(l - 1)
def solve(N, S, Q, queries):
trees = []
for i in range(26):
trees.append(BinaryIndexedTree(N))
s = []
for i, c in enumerate(S):
c_idx = ord(c) - ord('a')
if 'a' <= c <= 'z':
trees[c_idx].add(i + 1, 1)
s.append(c)
for q in queries:
if q[0] == '1':
i, c = int(q[1]), q[2]
p = s[i - 1]
s[i - 1] = c
trees[ord(p) - ord('a')].add(i, -1)
trees[ord(c) - ord('a')].add(i, 1)
if q[0] == '2':
l, r = int(q[1]), int(q[2])
ret = 0
for tree in trees:
cnt = tree.sum_range(l, r)
if cnt:
ret += 1
print(ret)
#pprint(get_range_sum(1, 5, bit))
#print(s)
#print()
return
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
N = int(next(tokens))
S = str(next(tokens))
Q = int(next(tokens))
q = []
for i in range(Q):
q.append(list(map(str, input().split())))
solve(N, S, Q, q)
if __name__ == '__main__':
main()
| #https://tjkendev.github.io/procon-library/python/range_query/rmq_segment_tree.html
# N: 処理する区間の長さ
#bit管理
#演算はor
N = int(input())
s = input()
N0 = 1
while N0<=N:
N0*=2
INF = 0
data = [0]*(2*N0)
# a_k の値を x に更新
def update(k, x):
k += N0-1
data[k] = 1<<x
while k >= 0:
k = (k - 1) // 2
data[k] =data[2*k+1]|data[2*k+2]
# 区間[l, r)の最小値
def query(l, r):
L = l + N0; R = r + N0
s = INF
while L < R:
if R & 1:
R -= 1
s = s|data[R-1]
if L & 1:
s = s|data[L-1]
L += 1
L >>= 1; R >>= 1
return s
for i in range(N):
update(i,ord(s[i])-ord("a"))
q = int(input())
for j in range(q):
t,l,r = input().split( )
if t=="1":
update(int(l)-1,ord(r)-ord("a"))
else:
bit = bin(query(int(l)-1,int(r)))[2:]
ans = 0
for i in bit:
ans += int(i)
print(ans) | 1 | 62,401,762,299,490 | null | 210 | 210 |
input()
S=input()
l=S[0]
c=1
for i in S[1:]:
if l!=i:
c+=1
l=i
print(c) | n = int(input())
P = list(map(int,input().split()))
S={}
ans="YES"
for p in P:
if p in S:
ans = "NO"
break
else:
S[p]=1
print(ans)
| 0 | null | 121,564,852,070,468 | 293 | 222 |
#!/usr/bin/env python
import queue
def dfs(node, edge, vis):
vis[node] = True
count = 1
vq = []
vq.append(node)
vq = queue.LifoQueue()
vq.put(node)
while not vq.empty():
fnode = vq.get()
for b in edge[fnode]:
if not vis[b]:
count += 1
vq.put(b)
vis[b] = True
return count
n, m = [int(i) for i in input().split(' ')]
edge = [[] for i in range(n)]
for _ in range(m):
a, b = [int(i) for i in input().split(' ')]
edge[a-1].append(b-1)
edge[b-1].append(a-1)
vis = [False]*n
count = 0
for i in range(n):
if not vis[i]:
count = max(count, dfs(i, edge, vis))
print(count)
| from copy import deepcopy
N, M = map(int, input().split())
pairs = [0] * M
for i in range(M):
pairs[i] = list(map(int, input().split()))
# N = 5
# pairs = [[1,2], [3,4], [5,1]]
class UnionFind:
def __init__(self, N):
self.r = [-1] * N
def root(self, x):
if self.r[x] < 0:
return x
self.r[x] = self.root(self.r[x])
return self.r[x]
def unite(self, x, y):
x = self.root(x)
y = self.root(y)
if x == y:
return False
if self.r[x] > self.r[y]:
x, y = y, x
self.r[x] += self.r[y]
self.r[y] = x
return True
def size(self, x):
return -self.r[self.root(x)]
uf = UnionFind(N)
for pair in pairs:
a = pair[0] - 1
b = pair[1] - 1
uf.unite(a, b)
ans = 0
for i in range(N):
ans = max(ans, uf.size(i))
print(ans)
| 1 | 3,984,635,381,782 | null | 84 | 84 |
N=int(input())
def prime_factorize(n):
a = []
while n % 2 == 0:
a.append(2)
n //= 2
f = 3
while f * f <= n:
if n % f == 0:
a.append(f)
n //= f
else:
f += 2
if n != 1:
a.append(n)
return a
l=prime_factorize(N)
L=set(l)
z=0
for j in L:
i=1
while i*(i+1)//2<=l.count(j):
i+=1
z+=i-1
print(z) | N, = map(int, input().split())
print(10-N//200)
| 0 | null | 11,927,920,736,508 | 136 | 100 |
import sys
p=10**9+7
x,y=map(int,input().split())
if (x+y)%3!=0 or x>2*y or y>2*x:
print(0)
sys.exit()
a=(-x+2*y)//3
b=(2*x-y)//3
A=1
for i in range(1,a+1):
A=A*i
A=A%p
B=1
for i in range(1,b+1):
B=B*i
B=B%p
AB=1
for i in range(1,a+b+1):
AB=AB*i
AB=AB%p
C=(AB*pow(A,p-2,p)*pow(B,p-2,p))%p
print(C) | a,b=map(int,input().split())
if 0<a<10 and 0<b<10:print(a*b)
else: print('-1') | 0 | null | 153,857,684,305,930 | 281 | 286 |
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**9)
INF = float('inf')
N, u, v = map(int, input().split())
u, v = u-1, v-1
adjL = [[] for _ in range(N)]
for _ in range(N-1):
a, b = map(int, input().split())
a, b = a-1, b-1
adjL[a].append(b)
adjL[b].append(a)
def bfsMinCosts(adjList, vSt, INF):
numV = len(adjList)
costs = [INF] * numV
costs[vSt] = cost = 0
vs = [vSt]
while vs:
cost += 1
v2s = []
for v in vs:
for v2 in adjList[v]:
if costs[v2] == INF:
costs[v2] = cost
v2s.append(v2)
vs = v2s
return costs
costUs = bfsMinCosts(adjL, u, INF)
costVs = bfsMinCosts(adjL, v, INF)
ans = 0
for x in range(N):
if costUs[x] < costVs[x]:
if costVs[x] > ans:
ans = costVs[x]
print(ans-1)
| n, k = map(int, input().split())
p = list(map(int, input().split()))
c = list(map(int, input().split()))
ans = -float('inf')
for i in range(n):
s = []
j = p[i]-1
s.append(c[j])
while j != i:
j = p[j]-1
s.append(s[-1]+c[j])
l = len(s)
if k <= l:
a = max(s[:k])
elif s[-1] <= 0:
a = max(s)
else:
w, r = divmod(k, l)
a1 = s[-1]*(w-1) + max(s)
a2 = s[-1]*w
if r != 0:
a2 += max(0, max(s[:r]))
a = max(a1, a2)
ans = max(ans, a)
print(ans) | 0 | null | 61,378,657,913,340 | 259 | 93 |
while True:
try:
spam=map(int, input().split(' '))
spam = [i for i in spam]
spam.sort()
cola = spam[0] * spam[1]
while True:
if spam[0] == 0:
print('{} {}'.format(spam[1],int(cola/spam[1])))
break
pre = spam[0]
spam[0] = spam[1] % spam[0]
spam[1] = pre
except:
break | import sys
def gcd(a, b):
while b % a:
a, b = b % a, a
return a
def lcm(a, b):
return a * b // gcd(a, b)
for line in sys.stdin:
a, b = sorted(list(map(int, line.split())))
print(gcd(a, b), lcm(a, b)) | 1 | 606,259,842 | null | 5 | 5 |
N = int(input())
S = input()
if N % 2 != 0:
print('No')
else:
left = S[:N//2]
right = S[N//2:]
if left == right:
print('Yes')
else:
print('No')
| import sys
N = int(input())
S = input()
if N % 2 == 1:
print('No')
sys.exit()
if S[:N//2] == S[N//2:]:
print('Yes')
sys.exit()
print('No') | 1 | 147,141,512,239,372 | null | 279 | 279 |
n = int(input())
a = list(map(int,input().split()))
from collections import Counter
b = Counter(a)
for i in b.values():
if i>1:
print('NO')
break
else:
print('YES') | def main():
import sys
input = sys.stdin.readline
from bisect import bisect_left, insort_left
N = int(input())
S = list(input())
Q = int(input())
dic = {chr(i): [] for i in range(ord('a'), ord('z')+1)}
for i in range(N):
dic[S[i]].append(i)
for _ in range(Q):
query, a, c = input().split()
if query == "1":
i = int(a)-1
if S[i] == c:
continue
ind = bisect_left(dic[S[i]], i)
dic[S[i]].pop(ind)
insort_left(dic[c], i)
S[i] = c
else:
l, r = int(a)-1, int(c)-1
ans = 0
for inds in dic.values():
if inds and l <= inds[-1] and inds[bisect_left(inds, l)] <= r:
ans += 1
print(ans)
if __name__ == '__main__':
main() | 0 | null | 68,400,728,867,000 | 222 | 210 |
import math
N = int(input())
flag = True
for i in range(N+1):
if math.floor(i * 1.08) == N:
print(i)
flag = False
break
if flag:
print(':(') | n = int(input())
p2 = (n + 1) / 1.08
p1 = n / 1.08
if p2 > int(p2) >= p1:
print(int(p2))
else:
print(":(") | 1 | 125,804,916,092,420 | null | 265 | 265 |
def I(): return int(input())
def LI(): return list(map(int,input().split()))
def MI(): return map(int,input().split())
def LLI(n): return [list(map(int, input().split())) for _ in range(n)]
mod = 10**9+7
n = I()
if n == 1:
print(0)
else:
##（すべての順列）-（0をつかってないもの）-（9をつかってないもの）+（0も9もつかってないもの）
print((10**n-2*9**n+8**n)%mod) | X,Y = (int(i) for i in input().split())
def get_money(Z):
if Z == 3:
return(100000)
elif Z == 2:
return(200000)
elif Z == 1:
return(300000)
else:
return(0)
x = get_money(X)
y = get_money(Y)
if X == 1 and Y == 1:
z = 400000
else:
z = 0
ans = x + y + z
print(ans) | 0 | null | 72,278,399,534,030 | 78 | 275 |
X,Y=map(int,input().split())
count=0
if X==3:
count = count+100000
elif X==2:
count = count+200000
elif X==1:
count = count+300000
else:
count = count
if Y==3:
count = count+100000
elif Y==2:
count = count+200000
elif Y==1:
count = count+300000
else:
count = count
if X==1 and Y==1:
count = count+400000
print(count) | import sys
L = sys.stdin.readlines()
for line in L: ##line?????????????????????
N = line.split() ##N??????????????¨????????????
sums = int(N[0]) + int(N[1])
print(len(str(sums))) | 0 | null | 70,347,877,669,002 | 275 | 3 |
import math
r = input()
print "%.6f %.6f" % (math.pi * r * r, math.pi * 2 * r) | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
L,R,d= map(int, readline().split())
print(R//d-(L-1)//d) | 0 | null | 4,050,371,719,522 | 46 | 104 |
#153_B
h, n = map(int, input().split())
a = list(map(int, input().split()))
sum = 0
for i in range(n):
sum += a[i]
if sum >= h:
print('Yes')
else:
print('No') | data = list(map(int, input().split()))
n = int(input())
dice = ['12431', '03520', '01540', '04510', '02530', '13421']
for i in range(n):
up, front = map(int, input().split())
u = data.index(up)
f = data.index(front)
a = dice[u].find(str(f))
print(data[int(dice[u][a+1])]) | 0 | null | 39,263,974,780,472 | 226 | 34 |
import sys
import math
def main():
n = int(input().rstrip())
r = 1.05
digit = 3
a = 100000
for i in range(n):
a = math.ceil(a*r/10**digit)*10**digit
print(a)
if __name__ == '__main__':
main() | N,M = map(int,input().split())
A = list(map(int,input().split()))
for i in range(M):
N -= A[i]
if N<0:
print("-1")
exit()
elif N>=0 and i+1 == M:
print(N)
exit() | 0 | null | 15,893,336,976,260 | 6 | 168 |
import sys
for x in sys.stdin:
a, op, b = x.split()
a = int(a)
b = int(b)
if op == '?':
break
elif op == '+':
print(a + b)
elif op == '-':
print(a - b)
elif op == '*':
print(a * b)
elif op == '/':
print(a // b) | while 1:
a, op, b = raw_input().split(' ')
if op == '?':break
print eval("%s %s %s"%(a, op, b)) | 1 | 684,437,316,160 | null | 47 | 47 |
def insertionSort(A, n, g):
cnt_local = 0
for i in range(g, n):
v = A[i]
j = i - g
while (j >= 0 and A[j] > v):
A[j+g] = A[j]
j = j - g
cnt_local += 1
A[j+g] = v
return cnt_local
cnt_all = 0
n = int(input())
A = []
for _ in range(n):
A.append(int(input()))
G = [int((3**i-1)/2)for i in range(17,0,-1)]
G = [v for v in G if v <= n]
m = len(G)
for i in range(m):
cnt_all += insertionSort(A, n, G[i])
print(m)
print(*G)
print(cnt_all)
print(*A, sep='\n')
|
G = [120001,60001,30001,15001,3001,901,601,301,91,58,31,7,4,1]
def insertion_sort(array,g):
for i in range(g,len(array)-1):
v = array[i]
j = i-g
while j>=0 and array[j] > v:
array[j+g] = array[j]
j = j-g
array[-1] += 1
array[j+g] = v
def shell_sort(array,G):
for i in G:
insertion_sort(array,i)
n = int(input())
arr = [int(input()) for i in range(n)] + [0]
Gn = [i for i in G if i <= n]
shell_sort(arr,Gn)
print(len(Gn))
print(' '.join([str(i) for i in Gn]))
print(arr[-1])
[print(i) for i in arr[:-1]] | 1 | 28,929,022,562 | null | 17 | 17 |
import math;print(360//math.gcd(360,int(input()))) | import sys
x = int(input())
ans = 2
while(True):
if x*ans % 360 == 0:
print(ans)
sys.exit()
ans +=1 | 1 | 13,249,094,387,620 | null | 125 | 125 |
def kuku(a, b):
return a*b if max(a, b) < 10 else -1
def main():
a, b = map(int, input().split())
print(kuku(a, b))
if __name__ == '__main__':
main()
| #from statistics import median
#import collections
#aa = collections.Counter(a) # list to list || .most_common(2)で最大の2個とりだせるお a[0][0]
from fractions import gcd
from itertools import combinations,permutations,accumulate # (string,3) 3回
#from collections import deque
from collections import deque,defaultdict,Counter
import decimal
import re
#import bisect
#
# d = m - k[i] - k[j]
# if kk[bisect.bisect_right(kk,d) - 1] == d:
#
#
#
# pythonで無理なときは、pypyでやると正解するかも！！
#
#
# my_round_int = lambda x:np.round((x*2 + 1)//2)
# 四捨五入
import sys
sys.setrecursionlimit(10000000)
mod = 10**9 + 7
#mod = 9982443453
def readInts():
return list(map(int,input().split()))
def I():
return int(input())
n = input()
if n[-1] in ['2','4','5','7','9']:
print('hon')
elif n[-1] in ['0','1','6','8']:
print('pon')
else:
print('bon')
| 0 | null | 89,019,780,567,520 | 286 | 142 |
[n, m] = [int(x) for x in raw_input().split()]
A = []
counter = 0
while counter < n:
A.append([int(x) for x in raw_input().split()])
counter += 1
B = [int(raw_input()) for j in range(m)]
counter = 0
while counter < n:
result = 0
for j in range(m):
result += A[counter][j] * B[j]
print(result)
counter += 1 | #!/usr/bin/env python
import sys
input = sys.stdin.buffer.readline
sys.setrecursionlimit(10**6)
def main():
S = input().decode().rstrip()
print(S[0:3])
if __name__ == "__main__":
main() | 0 | null | 7,898,396,607,748 | 56 | 130 |
#from statistics import median
#import collections
#aa = collections.Counter(a) # list to list || .most_common(2)で最大の2個とりだせるお a[0][0]
from fractions import gcd
from itertools import combinations,permutations,accumulate, product # (string,3) 3回
#from collections import deque
from collections import deque,defaultdict,Counter
import decimal
import re
import math
import bisect
#
#
#
# pythonで無理なときは、pypyでやると正解するかも！！
#
#
# my_round_int = lambda x:np.round((x*2 + 1)//2)
# 四捨五入g
#
# インデックス系
# int min_y = max(0, i - 2), max_y = min(h - 1, i + 2);
# int min_x = max(0, j - 2), max_x = min(w - 1, j + 2);
#
#
import sys
sys.setrecursionlimit(10000000)
mod = 10**9 + 7
#mod = 9982443453
#mod = 998244353
from sys import stdin
readline = stdin.readline
def readInts():
return list(map(int,readline().split()))
def readTuples():
return tuple(map(int,readline().split()))
def I():
return int(readline())
l,r,d = readInts()
print(r//d - (l-1)//d)
| S , W = (int(a) for a in input().split())
if S <= W :
print("unsafe")
else : print("safe") | 0 | null | 18,233,508,475,160 | 104 | 163 |
N = int(input())
ans=0
for n in range(1, N+1):
ans=ans if n%3==0 or n%5==0 else ans+n
print(ans) | n = int(input())
S = list(map(int, input().split()))
cnt = 0
def merge(left, mid, right):
global cnt
n1 = mid - left
n2 = right - mid
L = S[left:left+n1]
R = S[mid:mid+n2]
L.append(10e10)
R.append(10e10)
for j in range(n2):
R[j] = S[mid+j]
x = 0
y = 0
for k in range(left, right):
cnt += 1
if L[x] < R[y]:
S[k] = L[x]
x += 1
else:
S[k] = R[y]
y += 1
def mergesort(left, right):
if left+1 < right:
mid = (left + right)//2
mergesort(left, mid)
mergesort(mid, right)
merge(left, mid, right)
mergesort(0, n)
print(*S)
print(cnt)
| 0 | null | 17,464,306,719,510 | 173 | 26 |
s = input()
n = int(input())
for i in range(n):
c = input().split()
a = int(c[1])
b = int(c[2])
if "replace" in c:
s = s[:a] + c[3] + s[b+1:]
if "reverse" in c:
u = s[a:b+1]
s = s[:a] + u[:: -1] +s[b + 1:]
if "print" in c:
print(s[a:b+1], sep = '')
| s = list(input().replace("\r", "").replace("\n", ""))
n = int(input())
for i in range(n):
li = list(input().split())
if li[0] == "print":
a = int(li[1])
b = int(li[2])
print("".join(s[a:b+1]))
elif li[0] == "replace":
a = int(li[1])
b = int(li[2])
p = list(li[3])
s[a:b+1] = p
elif li[0] == "reverse":
a = int(li[1])
b = int(li[2])
p = s[a:b+1]
p.reverse()
s[a:b+1] = p
| 1 | 2,129,916,268,128 | null | 68 | 68 |
D = int(input())
C = [int(T) for T in input().split()]
S = [[] for TD in range(0,D)]
for TD in range(0,D):
S[TD] = [int(T) for T in input().split()]
for TD in range(0,D):
print(S[TD].index(max(S[TD]))+1) | def main():
D = int(input())
c = list(map(int,input().split()))
s = []
for d in range(D):
s.append(list(map(int,input().split())))
t = []
for d in range(D):
t.append(int(input())-1)
last = [0 for i in range(26)]
v = 0
for d in range(D):
v += s[d][t[d]]
last[t[d]] = d+1
for i in range(26):
v -= c[i]*(d+1-last[i])
print(v)
if __name__ == '__main__':
main() | 0 | null | 9,765,754,111,620 | 113 | 114 |
def main():
N = int(input())
A = list(map(int,input().split()))
buka_num = [0]*(N+1)
for i in range(N-1):
buka_num[A[i]] += 1
for i in range(1,N+1,1):
print(buka_num[i])
main()
| #!/usr/bin/env python3
import sys
from itertools import chain
def solve(N: int, A: "List[int]"):
s = [0 for _ in range(N)]
for Ai in A:
s[Ai - 1] += 1
return "\n".join(map(str, s))
def main():
tokens = chain(*(line.split() for line in sys.stdin))
N = int(next(tokens)) # type: int
A = [
int(next(tokens)) for _ in range(N - 2 + 1)
] # type: "List[int]"
answer = solve(N, A)
print(answer)
if __name__ == "__main__":
main()
| 1 | 32,417,436,830,560 | null | 169 | 169 |
n=int(input())
x=[i for i in range(n+3)]
x[0]=0
x[1]=1
i=2
while i<=n+1:
j=2*i
if x[i]==i:
while j<=n+1:
if x[j]==j:x[j]=i
j+=i
i+=1
def f(k):
if k==1:
return 1
z=[]
p=x[k]
m=1
ans=1
while k>=2:
k=k//p
if p==x[k]:
m+=1
else:
z.append(m)
m=1
p=x[k]
for i in range(len(z)):
ans*=z[i]+1
return ans
s=0
for i in range(1,n+1):
s+=i*f(i)
print(s)
| n = int(input())
ans= 0
for i in range(1,n+1):
j = n//i
ans += j*(j+1)*i/2
print(int(ans)) | 1 | 11,073,855,140,238 | null | 118 | 118 |
s = input()
l = ['SUN','MON','TUE','WED','THU','FRI','SAT']
i = 7-l.index(s)
print(i) | print(["SAT","FRI","THU","WED","TUE","MON","SUN"].index(input())+1) | 1 | 133,141,679,281,578 | null | 270 | 270 |
n = int(input())
for i in range(0,10001,1000):
if i - n >= 0:
print(i - n)
exit()
else:
continue | n=int(input())
print(-n%1000)
| 1 | 8,530,657,214,560 | null | 108 | 108 |
import sys
from itertools import accumulate
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
N, *L = map(int, read().split())
L.sort()
max_L = max(L)
C = [0] * (max_L + 1)
for l in L:
C[l] += 1
C = list(accumulate(C))
ans = 0
for i, a in enumerate(L):
for j, b in enumerate(L[i + 1 :], i + 1):
if a + b > max_L:
ans += N - j - 1
else:
ans += C[a + b - 1] - j - 1
print(ans)
return
if __name__ == '__main__':
main()
| N,X,M = map(int,input().split())
ls = [X]
for i in range(M):
Ai = ls[-1]**2 % M
if Ai in ls:
loop = ls[ls.index(Ai):]
lenloop = len(loop)
sumloop = sum(loop)
startls = ls[:ls.index(Ai)]
break
ls.append(Ai)
if N <= len(startls):
ans = sum(startls[:N])
else:
ans = sum(startls) + ((N-len(startls))//lenloop)*sumloop + sum(loop[:(N-len(startls))%lenloop])
print(ans)
| 0 | null | 87,460,512,285,912 | 294 | 75 |
a=input()
b=input()
if (a=="1" and b=="2")or(a=="2" and b=="1"):
print("3")
if (a=="1" and b=="3")or(a=="3" and b=="1"):
print("2")
if (a=="3" and b=="2")or(a=="2" and b=="3"):
print("1") | n=int(input())
Ns=list(map(int, input().split() ) )
ans=0
for i in range(n):
for j in range(i,n):
for k in range(j,n):
a , b , c = sorted([Ns[i] , Ns[j] , Ns[k]])
if a+b>c and a!=b and b!=c:
ans+=1
print(ans)
| 0 | null | 58,092,559,864,070 | 254 | 91 |
def lcm(x, y):
import math
return (x * y) // math.gcd(x, y)
def abc148c_snack():
a, b = map(int, input().split())
print(lcm(a, b))
abc148c_snack()
| import fractions
a, b = map(int, input().split())
print(int(a*b / fractions.gcd(a,b)))
| 1 | 113,698,025,048,958 | null | 256 | 256 |
N = int(input())
N_str = str(N)
a = 0
for i in range(len(N_str)):
a += int(N_str[i])
if a % 9 == 0:
print("Yes")
else:
print("No")
| n = map(int,list(input()))
ans = "No"
if sum(n) % 9 == 0:
ans = "Yes"
print(ans) | 1 | 4,373,782,361,960 | null | 87 | 87 |
# -*- Coding: utf-8 -*-
def trace(A, N):
for i in range(int(N)-1):
print(A[i], end=' ')
print(A[int(N)-1])
def insertionSort(A, N):
for i in range(1, int(N)):
v = A[i]
j = i - 1
while j >= 0 and A[j] > v:
A[j+1] = A[j]
j -= 1
A[j+1] = v
trace(A, N)
if __name__ == '__main__':
N = input()
A = list(map(int, input().split()))
trace(A, N)
insertionSort(A, N)
| #!/usr/bin/env python3
def main():
if int(input()) >= 30:
print('Yes')
else:
print('No')
if __name__ == "__main__":
main()
| 0 | null | 2,900,585,313,262 | 10 | 95 |
def az15():
n = input()
xs = map(int,raw_input().split())
xs.reverse()
for i in range(0,len(xs)):
print xs[i],
az15() | _ = input()
l = reversed(input().split())
print(' '.join(l)) | 1 | 990,777,581,850 | null | 53 | 53 |
print(*[''.join(str(i)+'x'+str(j)+'='+str(i*j)) for i in range(1,10) for j in range(1,10)], sep='\n')
| #!/usr/bin/env python3
# -*- coding: utf-8 -*-
def main():
for lhs in range(1,9+1):
for rhs in range(1,9+1):
print("{}x{}={}".format(lhs, rhs, lhs*rhs))
if __name__ == "__main__": main() | 1 | 730,100 | null | 1 | 1 |
from collections import deque
N, X, Y = map(int, input().split())
adj = [[] for _ in range(N)]
for i in range(N-1):
adj[i].append(i+1)
adj[i+1].append(i)
adj[X-1].append(Y-1)
adj[Y-1].append(X-1)
dist = [[-1]*N for _ in range(N)]
for i in range(N):
queue = deque([i])
dist[i][i] = 0
while queue:
now = queue.popleft()
for u in adj[now]:
if dist[i][u] < 0:
queue.append(u)
dist[i][u] = dist[i][now] + 1
ans = [0] * (N-1)
for i in range(N):
for j in range(i+1,N):
ans[dist[i][j]-1] += 1
[print(a) for a in ans] | X = int(input())
ret = 0
cur = 0
while True:
ret += 1
cur += X
if cur % 360 == 0:
print(ret)
break
| 0 | null | 28,744,424,654,400 | 187 | 125 |
nums = [int(i) for i in input().split()]
nums.sort()
print("{} {} {}".format(nums[0], nums[1], nums[2])) | a,b,c = map(int,raw_input().split())
if a>b:
tmp = a
a = b
b = tmp
if b>c:
tmp = b
b = c
c = tmp
if a>b:
tmp = a
a = b
b = tmp
print "%d %d %d" %(a,b,c) | 1 | 407,539,991,940 | null | 40 | 40 |
# coding: utf-8
string = raw_input()
new_string = ""
for s in string:
if s.islower():
new_string += s.upper()
elif s.isupper():
new_string += s.lower()
else:
new_string += s
print new_string | L,S,R = map(int,input().split())
a = 0
for i in range(L,S+1):
if (i%R == 0):
a = a + 1
print(a) | 0 | null | 4,479,049,427,580 | 61 | 104 |
import sys
import time
t = time.time()
n = int(input())
a = list(map(int, input().split(' ')))
b = list(range(n))
b.sort(key=lambda x: -a[x])
# print("b after:", b)
# print(list(map(lambda x:a[x],b)))
# print(time.time()-t)
cache = [[-1 for x in range(n)] for y in range(n)]
# print(cache)
def dfs(left, right):
if left > right:
return 0
if cache[left][right] != -1:
return cache[left][right]
which = n-(right-left+1)
ans1 = dfs(left+1, right)+abs(left-b[which])*a[b[which]]
ans2 = dfs(left, right-1)+abs(right-b[which])*a[b[which]]
cache[left][right] = max(ans1, ans2)
return cache[left][right]
sys.setrecursionlimit(2010)
print(dfs(0, n-1))
| '''
着想：大きいaほど左右の端に移動したい、小さいaを先に端にやるより必ず大きくなるから
問題：単純に貪欲に大きいaから左端(x-1)と右端(N-x)の大きい方に移動すると、
残りのaの組み合わせ的に最適でない場合がある
アイテムの左右端の単純な割り振りはO(2^N)
解決策の着想：大きい順のk個を(k=L+R)となる
左L個右R個にどのように割り振っても(k+1)個目の最適な割り振り方は変わらない
解決策：アイテムk個左右に割り振る状態をdp[L][R]で保存O(N^2)
'''
def solve():
N = int(input())
A = [[a, i] for a,i in zip(map(int, input().split()), range(N))]
A.sort(key=lambda a: a[0], reverse=True)
dp = [[0]*(N+1) for _ in range(N+1)] # 左からxマス右からyマス埋める
for i in range(0,N):
a, l = A[i]
for x in range(0,i+1):
y = i - x # 合計x+y=iマス既に埋まっている、次にi+1マス目を考える
dp[x+1][y] = max(dp[x+1][y], dp[x][y] + a * abs(l - x))
dp[x][y+1] = max(dp[x][y+1], dp[x][y] + a * abs(l - (N-y-1)))
print(max(dp[N-i][i] for i in range(N+1)))
solve() | 1 | 33,517,142,941,958 | null | 171 | 171 |
from collections import defaultdict
N, X, M = map(int, input().split())
A = [X]
visited = set()
visited.add(X)
idx = defaultdict()
idx[X] = 0
iii = -1
for i in range(1, M):
tmp = (A[-1]**2) % M
if tmp not in visited:
A.append(tmp)
visited.add(tmp)
idx[tmp] = i
else:
iii = idx[tmp]
ans = 0
if iii == -1:
ans = sum(A[:N])
print(ans)
exit()
else:
# ループの頭の直前まで
ans += sum(A[:iii])
N -= iii
if N > 0:
# ループの長さ
l = len(A) - iii
ans += (N // l) * sum(A[iii:])
N -= N // l * l
if N > 0:
# ループに満たないN
ans += sum(A[iii:iii + N])
print(ans)
| n,x,m = map(int,input().split())
place = [0] * m
place[x] = 1
cur = [x]
ends = 0
for i in range(m):
x = (x**2) % m
if place[x] == 0:
place[x] = i+2
cur.append(x)
else:
ends = i+2
break
roopsum = sum(cur[place[x]-1:ends-1])
rooplen = ends - place[x]
curlen = cur[place[x]-1:]
mm = min(n,ends-1)
ans = 0
for i in range(mm):
ans += cur[i]
if n-mm == 0:
print(ans)
else:
roopamo = (n-mm) // rooplen
roopama = (n-mm) % rooplen
ans += roopamo * roopsum
for i in range(roopama):
ans += curlen[i]
print(ans) | 1 | 2,783,622,652,580 | null | 75 | 75 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.