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
|
|---|---|---|---|---|---|---|
#! /usr/bin/env python3
noOfInputs = int(input())
for i in range(noOfInputs):
numsInStr = input().split()
nums = []
for n in numsInStr:
nums.append(int(n))
largest = max(nums)
nums.remove(max(nums))
#print(nums)
if (largest**2 == sum([i**2 for i in nums])):
print('YES')
else:
print('NO') | if len(set(input().split())) == 1:
print('Yes')
else:
print('No') | 0 | null | 41,699,022,387,920 | 4 | 231 |
from math import sqrt
while True:
input_data =[] # ????´??????????
alpha = 0 # ??????
num = int(input())
if num == 0:
break
input_data = [float(i) for i in input().split()]
m = sum(input_data) / float(num)
for i in range(num):
alpha += (input_data[i] - m)**2
print(sqrt(alpha/num)) | a = len(input())
print("x"*a) | 0 | null | 36,801,953,515,082 | 31 | 221 |
A, B, C, K = map(int, input().split())
k = K
a = min(A, k)
k -= a
b = min(B, k)
k -= b
c = min(C, k)
print(a-c) | n = input().split(" ")
for i,j in enumerate(n,1):
if 0 == int(j):
print(i) | 0 | null | 17,697,160,613,466 | 148 | 126 |
import math
N = int(input())
if N%2 == 1:
print(0)
exit()
ans = 0
i = 1
while 1:
a = 2*5**i
if N//a == 0:
break
ans += (N//a)
i += 1
print(ans) | #!/usr/bin/env python
n = int(input())
if n%2 == 1:
print(0)
exit()
mp = tmp = 0
while True:
if 5**tmp > n:
break
mp = tmp
tmp += 1
ans = 0
for i in range(1, mp+1):
ans += n//(2*(5**i))
print(ans)
| 1 | 115,759,883,790,432 | null | 258 | 258 |
l=list(map(int,input().split()))
k,x=l[0],l[1]
if (k*500)>=x:
print('Yes')
else:
print('No') | N,K=input().split()
N=int(N)
K=int(K)
count=0
while N>0:
count=count+1
N=N//K
print(count) | 0 | null | 81,635,170,972,992 | 244 | 212 |
import sys
def insertionSort(A, N):
for n in range(N-1):
print (A[n], end=" ")
print(A[N-1])
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 = j - 1
A[j + 1] = v
for n in range(N-1):
print (A[n], end=" ")
print(A[N-1])
return A
N = int(input())
A = input()
A = A.split(" ")
for i in range(N):
A[i] = int(A[i])
val = insertionSort(A, N) | from itertools import permutations
from math import sqrt, pow, factorial
N = int(input())
l = [list(map(int, input().split())) for _ in range(N)]
def calc(a, b):
[x1, y1] = a
[x2, y2] = b
return sqrt(pow(x1 - x2, 2) + pow(y1 -y2, 2))
ans = 0
for order in permutations(range(N)):
tmp = 0
for i in range(1, N):
tmp += calc(l[order[i]], l[order[i-1]])
ans += tmp
print(ans/factorial(N))
| 0 | null | 73,853,483,356,828 | 10 | 280 |
N = int(input())
X = input()
memo = {}
X_int = int(X, 2)
def popcount(n: int):
x = bin(n)[2:]
return x.count("1")
pcf = popcount(int(X, 2))
pcm = pcf - 1
pcp = pcf + 1
xm = X_int % pcm if pcm != 0 else 0
xp = X_int % pcp
def f(n: int, ops: int):
while n != 0:
n %= popcount(n)
ops += 1
return ops
def rev(x: str, i: int):
if x == "1":
if pcm == 0:
return -1
n = (xm - (pow(2, N-i-1, pcm))) % pcm
else:
n = (xp + (pow(2, N-i-1, pcp))) % pcp
return n
if __name__ == "__main__":
for i, x in enumerate(X):
n = rev(x, i)
if n == -1:
print(0)
else:
print(f(n, 1))
| #coding:UTF-8
def GCD(x,y):
d=0
if x < y:
d=y
y=x
x=d
if y==0:
print(x)
else:
GCD(y,x%y)
if __name__=="__main__":
a=input()
x=int(a.split(" ")[0])
y=int(a.split(" ")[1])
GCD(x,y) | 0 | null | 4,129,688,579,260 | 107 | 11 |
k = int(input())
str = ''
for _ in range(k):
str += 'ACL'
print(str) | def main():
K = int(input())
result = solve(K)
print(result)
def solve(K: int) -> str:
return 'ACL' * K
if __name__ == '__main__':
main()
| 1 | 2,161,671,325,600 | null | 69 | 69 |
n=int(input())
ans = 0
ans += n*(n+1)//2
ans += 15*(n//15)*(n//15+1)//2
ans -= 3*(n//3)*(n//3+1)//2
ans -= 5*(n//5)*(n//5+1)//2
print(ans)
| N = int(input())
amount = 0
for i in range(1, N + 1):
if (i % 15 == 0) or (i % 3 == 0) or (i % 5 == 0):
pass
else:
amount = amount + i
print(amount)
| 1 | 34,844,666,628,232 | null | 173 | 173 |
N = int(input())
anser = 'APPROVED'
A_list = list(map(int, input().split()))
for A in A_list:
if A % 2 == 1:
continue
if A % 3 == 0:
continue
if A % 5 == 0:
continue
anser = 'DENIED'
break
print(anser) | import sys
input()
numbers = map(int, input().split())
evens = [number for number in numbers if number % 2 == 0]
if len(evens) == 0:
print('APPROVED')
sys.exit()
for even in evens:
if even % 3 != 0 and even % 5 != 0:
print('DENIED')
sys.exit()
print('APPROVED')
| 1 | 68,999,422,147,300 | null | 217 | 217 |
# -*- coding: utf-8 -*-
n = int(input())
A = [int(n) for n in input().split()]
q = int(input())
M = [int(n) for n in input().split()]
numbers = [0]
for a in A:
numbers = numbers + [n+a for n in numbers]
for m in M:
if m in numbers:
print("yes")
else:
print("no") | N = int(input())
G = [[0] * N for _ in range(N)]
time = 0
times = [{'s': 0, 'f': 0} for _ in range(N)]
for _ in range(N):
u, n, *K = map(int, input().split())
for k in K:
G[u - 1][k - 1] = 1
def dfs(u):
global time
time += 1
times[u]['s'] = time
for i in range(N):
if G[u][i] == 1 and times[i]['s'] == 0:
dfs(i)
else:
time += 1
times[u]['f'] = time
for i in range(N):
if times[i]['s'] == 0:
dfs(i)
for i, time in enumerate(times):
print(i + 1, *time.values())
| 0 | null | 49,435,663,998 | 25 | 8 |
A = int(input())
B = int(input())
for x in range(1, 4):
if x not in [A, B]:
print(x)
break
| import sys
readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)
def main():
A = int(readline())
B = int(readline())
print(6 - A - B)
if __name__ == '__main__':
main()
| 1 | 110,909,083,093,420 | null | 254 | 254 |
import sys
from fractions import gcd
[print("{} {}".format(gcd(k[0], k[1]), (k[0] * k[1]) // gcd(k[0], k[1]))) for i in sys.stdin for k in [[int(j) for j in i.split()]]] | S, T = input().split()
A, B = input().split()
U = input()
if S==U:
print(int(A)-1,end=" ")
print(int(B))
else:
print(int(A),end=" ")
print(int(B)-1) | 0 | null | 35,767,617,333,852 | 5 | 220 |
#import sys
#import numpy as np
import math
#from fractions import Fraction
import itertools
from collections import deque
from collections import Counter
import heapq
from fractions import gcd
#input=sys.stdin.readline
#import bisect
n,k=map(int,input().split())
p=list(map(int,input().split()))
c=list(map(int,input().split()))
check=[-1]*n
finalans=-10**20
for i in range(n):
if check[i]!=-1:
continue
loop=[i]
now=i
while p[now]!=i+1:
check[now]=1
loop.append(p[now]-1)
now=p[now]-1
L=len(loop)
point=[0]*(L*2)
point[0]=c[loop[0]]
for j in range(1,L*2):
if j<L:
point[j]=point[j-1]+c[loop[j]]
else:
point[j]=point[j-1]+c[loop[j-L]]
m=-10**20
if point[L-1]>0:
r=k%L
if r==0:
r=L
for j in range(1,r+1):
for t in range(j-1,j+L-1):
cand=point[t]-point[t-j] if t-j>=0 else point[t]
m=max(m,cand)
ans=point[L-1]*(k//L)+m if r!=L else point[L-1]*((k//L)-1)+m
else:
for j in range(1,L+1):
for t in range(j-1,j+L-1):
cand=point[t]-point[t-j] if t-j>=0 else point[t]
m=max(m,cand)
ans=m
finalans=max(ans,finalans)
print(finalans) | r,c,k = map(int,input().split())
v = [[0]*(c+1) for i in range(r+1)]
for i in range(k):
x,y,z = map(int,input().split())
v[x][y] = z
dp = [[0]*4 for i in range(r+1)]
for i in range(1,c+1):
for j in range(1,r+1):
if v[j][i]>0:
dp[j][3] = max(dp[j][2]+v[j][i],dp[j][3])
dp[j][2] = max(dp[j][1]+v[j][i],dp[j][2])
dp[j][1] = max(dp[j][0]+v[j][i],dp[j][1],max(dp[j-1])+v[j][i])
dp[j][0] = max(dp[j][0],max(dp[j-1]))
print(max(dp[r])) | 0 | null | 5,442,384,631,388 | 93 | 94 |
while True:
x = [int(z) for z in input().split(" ")]
if x[0] == 0 and x[1] == 0: break
for h in range(0,x[0]):
for w in range(0,x[1]):
print("#", end="")
print("\n", end="")
print("") | mod = 10**9 + 7
n = int(input())
dp = [0]*(n+1)
dp[0] = 1
if n >= 3:
for i in range(3,n+1):
dp[i] = dp[i-1] + dp[i-3]
print(dp[n] % mod) | 0 | null | 2,057,454,508,800 | 49 | 79 |
import math
N = int(input())
x = []
y = []
for i in range(N):
tmp = input().split(" ")
x.append(int(tmp[0]))
y.append(int(tmp[1]))
d = 0
for i in range(N):
for j in range(N):
d += math.sqrt((x[j]-x[i]) ** 2 + (y[j]-y[i]) ** 2)
print(d/N) | import itertools as it
import math
def Dist (x1,y1,x2,y2):
dis = (x2 - x1)**2 + (y2 - y1)**2
return math.sqrt(dis)
N = int(input())
Pos = []
res = 0
for i in range(N):
pos = list(map(int,input().split()))
Pos.append(pos)
array = list(it.permutations(i for i in range(N)))
for i in range(math.factorial(N)):
for j in range(N-1):
res += Dist(Pos[array[i][j]][0],Pos[array[i][j]][1],Pos[array[i][j+1]][0],Pos[array[i][j+1]][1])
print(res / math.factorial(N)) | 1 | 148,562,691,317,546 | null | 280 | 280 |
n=int(input())
#L=[n//i*(i+n//i*i)//2 for i in range(1,n+1)]
#print(sum(L))
ans=0
#for i in range(1,n+1):
# for j in range(1,n+1):
# if i%j==0:
# ans+=i
#print(ans)
g=lambda x:(x*(n//x)*(n//x+1))//2
print(sum(g(i) for i in range(1,n+1)))
| from numba import njit
n = int(input())
@njit
def solve():
f = [1] * (n + 1)
for i in range(2, n + 1):
if f[i] != 1: continue
m = i
while m <= n:
tmp = m
cnt = 0
while tmp % i == 0:
tmp = tmp // i
cnt += 1
f[m] *= cnt + 1
m += i
ans = 0
for i in range(1, n + 1):
ans += i * f[i]
return ans
print(solve()) | 1 | 11,027,650,131,250 | null | 118 | 118 |
import sys
## io
IS = lambda: sys.stdin.readline().rstrip()
II = lambda: int(IS())
MII = lambda: list(map(int, IS().split()))
MIIZ = lambda: list(map(lambda x: x-1, MII()))
## dp
INIT_VAL = 0
MD2 = lambda d1,d2: [[INIT_VAL]*d2 for _ in range(d1)]
MD3 = lambda d1,d2,d3: [MD2(d2,d3) for _ in range(d1)]
## math
DIVC = lambda x,y: -(-x//y)
DIVF = lambda x,y: x//y
def main():
n, p = MII()
s = list(map(int, IS()))
if 10%p == 0: # pが2または5の場合
cnt = 0
for i, si in enumerate(s):
if si%p == 0:
cnt += i+1
print(cnt)
return None
d = [0]*p
d[0] = 1 # 0(mod p)はそれ単体で割り切れるため+1しておく
ss = 0
x = 1
for si in s[::-1]:
ss += x*si
ss %= p
d[ss] += 1
x = (10*x)%p # %p無しだとTLE
cnt = 0
for di in d:
cnt += di*(di-1)//2 # calc combination(n_C_2)
print(cnt)
if __name__ == "__main__":
main() | a = input().split()
v = 2
while int(v) >= 1:
if int(a[int(v)-1]) < int(a[int(v)]):
pass
else:
b = int(a[int(v)-1])
a[int(v)-1] = int(a[int(v)])
a[int(v)] = int(b)
v = int(v) - 1
if int(a[1]) < int(a[2]):
pass
else:
b = int(a[1])
a[1] = int(a[2])
a[2] = int(b)
print('%d %d %d' % (int(a[0]),int(a[1]),int(a[2])))
| 0 | null | 29,386,301,384,770 | 205 | 40 |
a,b = input().split()
x = int(a) * b
y = int(b) * a
l = []
l.append(x)
l.append(y)
l = sorted(l)
print(min(l)) | N = int(input())
if N % 2 == 0 :
print(0.5)
else : print( (N+1)//2 /N) | 0 | null | 130,358,518,524,610 | 232 | 297 |
n = int(input())
a = []
cnt = 0
for i in range(n):
a.append(int(input()))
def insertionSort(a, n, g):
global cnt
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 = cnt + 1
a[j+g] = v
g = []
g.append(1)
m = 0
while g[m] < n:
if n > 3 * g[m] + 1:
m = m + 1
g.append(3 * g[m-1] + 1)
else:
break
m = m + 1
g.reverse()
for i in range(m):
insertionSort(a,n,g[i])
print(m)
print(*g)
print(cnt)
for i in range(n):
print(a[i])
| def insertionSort(A, n, g, cnt):
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 += 1
A[j+g] = v
return cnt
def shellSort(A, n, m, G):
cnt = 0
for i in range(m):
cnt = insertionSort(A, n, G[i], cnt)
return cnt
n = int(input())
A = []
for i in range(n):
A.append(int(input()))
h = 1
p = 1
G = []
if n < 2:
G = [1]
p = 2
else:
while h < n:
G.append(h)
h = 3 ** p + h
p += 1
G.reverse()
cnt = shellSort(A, n, p - 1, G)
print(p - 1)
print(" ".join(map(str, G)))
print(cnt)
for i in range(n):
print(A[i])
| 1 | 30,143,472,882 | null | 17 | 17 |
print('No' if input().replace('hi', '') else 'Yes') | a = input()
hi_cnt = a.count('hi')
if hi_cnt > 0:
if hi_cnt * 2 == len(a):
print('Yes')
else:
print('No')
else:
print('No') | 1 | 53,341,246,313,120 | null | 199 | 199 |
def main():
N = int(input())
A,B = [],[]
for _ in range(N):
a,b = [int(x) for x in input().split()]
A.append(a)
B.append(b)
A.sort()
B.sort()
if N % 2 == 1:
minMed = A[N//2]
maxMed = B[N//2]
print(int(maxMed-minMed)+1)
else:
minMed = A[N//2-1] + A[N//2]
maxMed = B[N//2-1] + B[N//2]
print(int(maxMed-minMed)+1)
if __name__ == '__main__':
main() | import statistics
N = int(input())
AB = [map(int, input().split()) for _ in range(N)]
A, B = [list(i) for i in zip(*AB)]
A_median = statistics.median(A)
B_median = statistics.median(B)
if N%2==0:
print(int((B_median-A_median)*2)+1)
else:
print(B_median-A_median+1) | 1 | 17,441,659,260,200 | null | 137 | 137 |
A,B = map(int,input().split())
def gcd(a, b):
if b==0:
return a
return gcd(b, a%b)
print(A*B//gcd(A,B)) | def gcd(a,b):
if b ==0:
return a
else:
return gcd(b, a%b)
A,B = map(int, input().split())
A,B = (A,B) if A>B else (B,A)
print(int(A/gcd(A,B)*B)) | 1 | 113,312,579,060,610 | null | 256 | 256 |
rStr = input()
N = int(rStr.split(' ')[0])
M = int(rStr.split(' ')[1])
if N == M :
print("Yes")
else :
print("No")
| import sys
def II(): return int(input())
def MI(): return map(int,input().split())
def LI(): return list(map(int,input().split()))
def TI(): return tuple(map(int,input().split()))
def RN(N): return [input().strip() for i in range(N)]
def main():
N, M = MI()
if N == M:
print("Yes")
else:
print("No")
if __name__ == "__main__":
main() | 1 | 83,095,155,210,030 | null | 231 | 231 |
N=int(raw_input())
s=[int(raw_input()) for x in range(N)]
def is_prime(n):
i = 2
while i * i <=n:
if n % i == 0:
return False
i += 1
return True
a=filter(is_prime,s)
print len(a) | import math
n=int(input())
s=0
for i in range(n):
a=int(input())
b=math.ceil(a**0.5)
if a==2:
s+=1
elif a%2==0 or a < 2:
continue
else:
c=0
for j in range(3,b+1,2):
if a%j==0:
c+=1
break
if c==0:
s+=1
print(s) | 1 | 10,600,075,508 | null | 12 | 12 |
s = list(input())
q = int(input())
l1 = []
l2 = []
rev = False
for i in range(q):
inp = input()
if inp[0] == "1":
if rev:
rev = False
else:
rev = True
elif inp[2] == "1":
a = inp[4]
if rev:
l2.append(a)
else:
l1.append(a)
else:
a = inp[4]
if rev:
l1.append(a)
else:
l2.append(a)
l1.reverse()
ans = l1 + s + l2
if rev:
ans.reverse()
print("".join(ans)) | #10^18こえたら-1
n = int(input())
Arr = list(map(int, input().split( )))
Arr = sorted(Arr)
if Arr[0] == 0:
print(0)
exit()
s = 1
for i in range(n):
s *= Arr[i]
if s > 10**18:
print(-1)
exit()
print(s) | 0 | null | 36,706,096,576,512 | 204 | 134 |
def main():
n,m = map(int,input().split())
if n == m:
print('Yes')
else:
print('No')
main() | a,b,c = map(int,input().split())
k = int(input())
for i in range(k):
if b<=a:
b*=2
else:
c*=2
if b>a and c>b:
print('Yes')
else:
print('No') | 0 | null | 45,116,215,689,830 | 231 | 101 |
n = int(input())
for i in range(100000):
if i * 108 // 100 == n:
print(i)
break
else:
print(':(') | import sys
import time
import math
def inpl():
return list(map(int, input().split()))
st = time.perf_counter()
# ------------------------------
N = int(input())
ls = [0] * 50505
for i in range(len(ls)):
ls[i] = int(i * 1.08)
for i in range(N, 0, -1):
if ls[i] == N:
print(i)
sys.exit()
print(':(')
# ------------------------------
ed = time.perf_counter()
print('time:', ed-st, file=sys.stderr)
| 1 | 125,591,351,004,080 | null | 265 | 265 |
from collections import Counter
def solve():
ans = 0
N, K = map(int, input().split())
A = list(map(int, input().split()))
cum = [0]*(N+1)
for i in range(N):
cum[i+1] = (cum[i]+A[i])%K
for i in range(N):
cum[i+1] = (i+1-cum[i+1])%K
if N<K:
c = Counter(cum)
for v in c.values():
ans += v*(v-1)//2
else:
c = Counter(cum[:K-1])
for i in range(N):
c[cum[i]] -= 1
if i+K-1<=N:
c[cum[i+K-1]] += 1
ans += c[cum[i]]
return ans
print(solve()) | from collections import Counter, deque
N, K = map(int, input().split())
A = list(map(int, input().split()))
INF = 10**18
cnt = Counter()
cnt[0] = 1
que = deque([0])
sumR = 0
ans = 0
for right, a in enumerate(A, start=1):
if len(que) >= K:
cnt[que.popleft()] -= 1
sumR = (a + sumR) % K
D = (sumR - right) % K
ans += cnt[D]
cnt[D] += 1
que.append(D)
print(ans)
| 1 | 137,232,700,069,542 | null | 273 | 273 |
L, R, d = map(int, input().split())
print(R // d - L // d + (L % d == 0))
| input = input()
L, R, d = [int(n) for n in input.split()]
count = 0
for n in range(L, R+1):
if n % d == 0:
count += 1
print(count) | 1 | 7,597,243,685,892 | null | 104 | 104 |
def factorization(n):
arr = []
temp = n
for i in range(2, int(-(-n ** 0.5 // 1)) + 1):
if temp % i == 0:
cnt = 0
while temp % i == 0:
cnt += 1
temp //= i
arr.append([i, cnt])
if temp != 1:
arr.append([temp, 1])
if not arr:
arr.append([n, 1])
return arr
N = int(input())
p = factorization(N)
count = 0
for x in p:
if N == 1:
break
for j in range(1, x[1] + 1):
if N % (x[0] ** j) == 0:
N /= x[0] ** j
count += 1
else:
break
print(count)
| N,K = map(int,input().split())
A = list(map(int,input().split()))
left = 0
right = 10**9
while right - left > 1:
center = (right+left)//2
count = 0
for a in A:
if a%center == 0:
count += a//center-1
else:
count += a//center
if count > K:
left = center
else:
right = center
print(right) | 0 | null | 11,841,795,854,100 | 136 | 99 |
a,b,c,k=map(int,input().split())
ai=0
bi=0
ci=0
if a >= k:
ai=k
else:
ai=a
if b>= k-ai:
bi=k-ai
else:
bi=b
ci= k - ai - bi
print(ai-ci)
| import sys
n = [int(i) for i in sys.stdin.readline().rstrip()[::-1]]
ans = 0
i = 0
p = [n[i],10 - n[i]]
now = [0,0]
i += 1
ans = min(p[0], p[1] + 1)
for i in range(1,len(n)):
now[0] = min(p[0] + n[i]%10, p[1] + n[i]%10 + 1)
now[1] = min(p[0] + 10 - n[i]%10, p[1] + 9 - n[i]%10)
ans = min(now[0], now[1] + 1)
p[0],p[1] = now[0],now[1]
print(ans)
| 0 | null | 46,450,243,127,358 | 148 | 219 |
import sys
from collections import deque
input = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 7)
N, D, A = map(int, input().split())
XH = list(tuple(map(int, input().split())) for _ in range(N))
XH.sort()
ans = 0
memo = deque()
cnt = 0
for x, h in XH:
while memo and memo[0][0] < x:
_, i = memo.popleft()
cnt -= i
h -= cnt * A
h = max(h, 0)
bomb = (h + A - 1) // A
ans += bomb
cnt += bomb
memo.append((x + 2 * D, bomb))
print(ans) | K = int(input())
A, B = list(map(int, input().split()))
i = 1
flag = False
while K * i <= B:
if K * i >= A:
flag = True
i += 1
if flag:
print("OK")
else:
print("NG")
| 0 | null | 54,663,491,326,400 | 230 | 158 |
h,n = map(int,input().split())
a = [0 for _ in range(n)]
b = [0 for _ in range(n)]
for i in range(n):
a[i],b[i] = map(int,input().split())
cost = [int(1e+9) for _ in range(h+1)]
cost[0] = 0
for i in range(h):
for j in range(n):
if i+a[j] <= h:
cost[i+a[j]] = min(cost[i+a[j]],cost[i]+b[j])
else:
cost[-1] = min(cost[-1],cost[i]+b[j])
print(cost[-1]) | h,n=map(int,input().split())
a_=0
magic=[]
for i in range(n):
a,b=map(int,input().split())
a_=max(a,a_)
c=[a,b]
magic.append(c)
dp=[10**8+1]*(h+a_+1)
dp[0]=0
for i in range(n):
a,b=magic[i]
for j in range(len(dp)):
if j+a<=h+a_:
dp[j+a]=min(dp[j+a],dp[j]+b)
print(min(dp[h:]))
| 1 | 81,489,780,134,618 | null | 229 | 229 |
from numpy import*
n,m,*a=int_(open(0).read().split())
a=int_(fft.irfft(fft.rfft(bincount(a,[1]*n,2**18))**2)+.5)
c=0
for i in where(a>0)[0][::-1]:
t=min(m,a[i])
c+=i*t
m-=t
if m<1:break
print(c) | import sys,itertools,collections,bisect
from collections import deque,Counter,defaultdict
from heapq import heappush,heappop,heapify
read=sys.stdin.readline
sys.setrecursionlimit(10**6)
MOD=10**9+7
N=int(input())
A=list(map(int,input().split()))
cum=[0]*(N+1)
for i in range(N):
cum[i+1]=(cum[i]+A[i])%MOD
ans=0
for i in range(N):
res=(cum[N]-cum[i+1]+MOD)%MOD*A[i]%MOD
ans=(ans+res)%MOD
print(ans)
| 0 | null | 55,906,041,330,480 | 252 | 83 |
import math
n = input()
print(math.ceil((int(n)-2)/2)) | N = int(input())
P = list(map(int, input().split()))
temp = P[0]
res = 1
for i in range(1,N):
if P[i] <= temp:
temp = P[i]
res += 1
print(res) | 0 | null | 119,797,876,079,418 | 283 | 233 |
s = input()
# now = 0
left = 0
right = 0
ans = []
for i in range(len(s) + 1):
if left == 0:
# 左側
for j in range(i - 1, -1, -1):
if s[j] != '<':
break
else:
left += 1
else:
if s[i - 1] == '<':
left += 1
else:
left = 0
# 右側
if right == 0:
for j in range(i, len(s)):
if s[j] != '>':
break
else:
right += 1
else:
if i == len(s):
right = 0
elif s[i] == '>':
right -= 1
else:
right = 0
ans.append(max(left, right))
# print(ans)
print(sum(ans))
| S = input()
N=len(S)+1
SS = '>'+S+'<'
a = [-1]*(N+2)
for i in range(N+1):
if SS[i] == '>' and SS[i+1]=='<':
a[i+1]=0
b = a[1:-1]
c = a[1:-1]
for i in range(N-1):
if S[i] == '<' and b[i]>=0 :
b[i+1] = b[i] +1
for i in range(N-2,-1,-1):
if S[i] == '>' and c[i+1]>=0:
c[i] = c[i+1] +1
ans = 0
for bb,cc in zip(b,c):
ans += max(bb,cc)
print(ans)
| 1 | 156,932,004,943,050 | null | 285 | 285 |
n,x, m = map(int, input().split())
mod = [None for _ in range(m)]
count = x
loop = []
rem = [x]
for i in range(1, n):
value = (x * x) % m
rem.append(value)
x = (x * x) % m
if mod[value] != None:
# print(mod)
s_index = mod[value]
loop = rem[s_index : -1]
num = (n - s_index) // len(loop)
amari = (n - s_index) % len(loop)
if amari == 0:
print(sum(rem[:s_index]) + sum(loop) * num)
else:
print(sum(rem[:s_index]) + sum(loop) * num + sum(loop[:amari]))
exit()
else:
mod[value] = i
count += value
print(count)
| N,x,M=map(int,input().split())
k=x
L=list()
c=dict()
for i in range(M):
if i==N:
print(sum(L))
exit()
if x==0:
print(sum(L))
exit()
L.append(x)
x=(x*x)%M
if x in c:
q=x
break
c[x]=1
moto=sum(L)
N-=len(L)
for i in range(len(L)):
if L[i]==q:
roop=list(L[i:])
L=roop
a=len(L)
if N%a==0:
print(moto+(sum(L)*(N//a)))
else:
s=N//a
t=N%a
ans=sum(L)*s
ans+=sum(roop[:t])
print(moto+ans) | 1 | 2,834,171,188,992 | null | 75 | 75 |
N = int(input())
ans = 0
for i in range(1,N+1):
for j in range(i,N+1,i):
ans += j
print(ans) | 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 = I()
print(sum((i*(N//i)*(N//i+1)//2) for i in range(1,N+1)))
| 1 | 11,040,735,128,540 | null | 118 | 118 |
n,q = map(int,input().split())
queue = []
for i in range(n):
p,t = map(str,(input().split()))
t = int(t)
queue.append([p,t])
total_time = 0
while len(queue) > 0:
x = queue.pop(0)
if x[1] > q :
total_time += q
x[1] -= q
queue.append(x)
else:
total_time += x[1]
print(x[0],total_time) | T1,T2= map(int, input().split())
A1,A2= map(int, input().split())
B1,B2= map(int, input().split())
if A1>B1 and A2>B2:
print(0)
elif A1<B1 and A2<B2:
print(0)
elif T1*A1+T2*A2==T1*B1+T2*B2:
print('infinity')
elif A1>B1 and A2<B2:
if T1*A1+T2*A2>T1*B1+T2*B2:
print(0)
else:
se=abs(T1*A1+T2*A2-(T1*B1+T2*B2))
ad=T1*A1-T1*B1
d=-(-ad//se)
ans=2*d-1
if ad%se==0:
ans+=1
print(ans)
elif A1<B1 and A2>B2:
if T1*A1+T2*A2<T1*B1+T2*B2:
print(0)
else:
se=abs(T1*A1+T2*A2-(T1*B1+T2*B2))
ad=T1*B1-T1*A1
d=-(-ad//se)
ans=2*d-1
if ad%se==0:
ans+=1
print(ans)
| 0 | null | 66,131,360,180,050 | 19 | 269 |
from collections import Counter
N = int(input())
As = list(map(int,input().split()))
cnt = Counter(As)
for i in range(1,N+1):
print(cnt[i]) | x = int(input())
s = [0]*x
for i in range(x):
s[i-1] = input()
l = set (s)
length = len(l)
print(length) | 0 | null | 31,394,885,878,840 | 169 | 165 |
import math
n = int(input())
a = [float(x) for x in list(input().split())]
b = [float(x) for x in list(input().split())]
result = 0
for aa, bb in zip(a, b):
result += abs(aa - bb)
print(round(result, 6))
result = 0
for aa, bb in zip(a, b):
result += abs(aa - bb) ** 2
print(round(math.sqrt(result), 8))
result = 0
for aa, bb in zip(a, b):
result += abs(aa - bb) ** 3
print(round(math.pow(result, 1/3), 8))
result = []
for aa, bb in zip(a, b):
result.append(abs(aa - bb))
print(max(result))
| from sys import stdin,stdout
def INPUT():return list(int(i) for i in stdin.readline().split())
import math
def inp():return stdin.readline()
def out(x):return stdout.write(x)
import math as M
MOD=10**9+7
import sys
#####################################
n=int(input())
A=INPUT()
s=0
for i in range(n):
for j in range(i+1,n):
s+=A[i]*A[j]
print(s)
| 0 | null | 84,068,048,245,130 | 32 | 292 |
import sys
def input():
return sys.stdin.readline().strip()
sys.setrecursionlimit(20000000)
MOD = 10 ** 9 + 7
INF = float("inf")
def main():
L, R, d = map(int, input().split())
r = R // d
l = (L - 1) // d
print(r - l)
if __name__ == "__main__":
main()
| a,b=map(int,input().split())
if a<0 or a>9:
print(-1)
elif b<0 or b>9:
print(-1)
else:
print(a*b) | 0 | null | 83,021,895,245,478 | 104 | 286 |
h, w, n = (int(input()) for i in range(3))
print(-(-n // max(h, w))) | import sys
from collections import deque
read = sys.stdin.read
N, *ab = map(int, read().split())
graph = [[] for _ in range(N + 1)]
for a, b in zip(*[iter(ab)] * 2):
graph[a].append(b)
color = [0] * (N + 1)
queue = deque([1])
while queue:
V = queue.popleft()
number = 1
for v in graph[V]:
if number == color[V]:
number += 1
color[v] = number
queue.append(v)
number += 1
print(max(color))
for a, b in zip(*[iter(ab)] * 2):
print(color[b])
| 0 | null | 112,207,560,178,698 | 236 | 272 |
import math
while True:
n = int(input())
if n == 0:
break
dset = list(map(int, input().split()))
mean = sum(dset)/len(dset)
sigma = math.sqrt(sum([(x-mean)**2 for x in dset])/len(dset))
print('%.06f' % sigma) | import sys
MOD = 10**9 + 7
def sum_from_to(fr, to):
return (to - fr + 1) * (fr + to) // 2 % MOD
def main():
input = sys.stdin.buffer.readline
n, k = map(int, input().split())
ans = 0
for i in range(k, n + 2):
ans += sum_from_to(n - i + 1, n) - sum_from_to(0, i - 1) + 1
ans %= MOD
print(ans)
if __name__ == '__main__':
main()
| 0 | null | 16,779,114,098,628 | 31 | 170 |
import sys
sys.setrecursionlimit(1 << 25)
readline = sys.stdin.buffer.readline
read = sys.stdin.readline # 文字列読み込む時はこっち
import numpy as np
from functools import partial
array = partial(np.array, dtype=np.int64)
zeros = partial(np.zeros, dtype=np.int64)
full = partial(np.full, dtype=np.int64)
ra = range
enu = enumerate
def exit(*argv, **kwarg):
print(*argv, **kwarg)
sys.exit()
def mina(*argv, sub=1): return list(map(lambda x: x - sub, argv))
# 受け渡されたすべての要素からsubだけ引く.リストを*をつけて展開しておくこと
def a_int(): return int(readline())
def ints(): return np.fromstring(readline(), sep=' ', dtype=np.int64)
def read_matrix(H, W):
'''return np.ndarray shape=(H,W) matrix'''
lines = []
for _ in range(H):
lines.append(read())
lines = ' '.join(lines) # byte同士の結合ができないのでreadlineでなくreadで
return np.fromstring(lines, sep=' ', dtype=np.int64).reshape(H, W)
def read_col(H):
'''H is number of rows
A列、B列が与えられるようなとき
ex1)A,B=read_col(H) ex2) A,=read_col(H) #一列の場合'''
ret = []
for _ in range(H):
ret.append(list(map(int, readline().split())))
return tuple(map(list, zip(*ret)))
def read_tuple(H):
'''H is number of rows'''
ret = []
for _ in range(H):
ret.append(tuple(map(int, readline().split())))
return ret
MOD = 10**9 + 7
INF = 2**31 # 2147483648 > 10**9
# default import
from collections import defaultdict, Counter, deque
from operator import itemgetter, xor, add
from itertools import product, permutations, combinations
from bisect import bisect_left, bisect_right # , insort_left, insort_right
from functools import reduce
from math import gcd
def lcm(a, b):
# 最小公倍数
g = gcd(a, b)
return a // g * b
# from numba import njit
# @njit('(i8,i8,i8[:])',cache=True)
N = a_int()
XY = read_matrix(N, 2)
X = XY[:, 0]
Y = XY[:, 1]
f0 = X - Y
f1 = X + Y
print(max(f0.max() - f0.min(), f1.max() - f1.min()))
| n = int(input())
plus_max = 10**20 * -1
plus_min = 10**20
minus_max = 10**20 * -1
minus_min = 10**20
for _ in range(n):
x, y = map(int, input().split())
plus_max = max(plus_max, x + y)
plus_min = min(plus_min, x + y)
minus_max = max(minus_max, x - y)
minus_min = min(minus_min, x - y)
print(max(plus_max - plus_min, minus_max - minus_min))
| 1 | 3,393,316,730,342 | null | 80 | 80 |
while 1 :
a,b = map(int,raw_input().split())
if not a and not b:
break
if a < b:
print "%d %d" % (a , b)
else :
print "%d %d" % (b , a) | import math
n,k=map(int,input().split())
a=list(map(int,input().split()))
left=1
right=10**9
while left<right:
cnt=0
mid=(left+right)//2
for i in range(n):
cnt+=math.ceil(a[i]/mid)-1
if cnt<=k:
right=mid
else:
left=mid+1
print(left) | 0 | null | 3,507,391,735,980 | 43 | 99 |
import sys
import math
import heapq
from collections import defaultdict, deque
from decimal import *
def r():
return int(input())
def rm():
return map(int,input().split())
def rl():
return list(map(int,input().split()))
'''D Anything Goes to zero'''
twoPowM1=[0]*(300000)
twoPowM2=[0]*(300000)
stepsSmall=[0]*(300000)
n=r()
s=input()
bitcount=0
for i in range(n):
if s[i]=='1':
bitcount+=1
mod=bitcount-1
if mod>0:
twoPowM1[0]=1
for i in range(1,len(twoPowM1)):
twoPowM1[i]=(twoPowM1[i-1]+twoPowM1[i-1])%mod
mod=bitcount+1
twoPowM2[0]=1
for i in range(1,len(twoPowM2)):
twoPowM2[i]=(twoPowM2[i-1]+twoPowM2[i-1])%mod
for i in range(1,len(stepsSmall)):
stepsSmall[i]=1+stepsSmall[i%bin(i).count('1')]
valM1=0;valM2=0
for i in range(n):
mod=bitcount-1
if mod>0:
valM1=((valM1*2)%mod+int(s[i]))%mod
mod=bitcount+1
valM2=((valM2*2)%mod+int(s[i]))%mod
for i in range(n):
pow=n-1-i
if s[i]=='0':
mod=bitcount+1
newVal=(valM2+twoPowM2[pow])%mod
print(stepsSmall[newVal]+1)
else:
mod=bitcount-1
if mod==0:
print(0)
else:
newVal=(valM1-twoPowM1[pow])%mod
print(stepsSmall[newVal]+1) | s,t = input().split()
a,b = map(int,input().split())
u = input()
print(a if u == t else a-1, end = " ")
print(b-1 if u == t else b) | 0 | null | 39,828,719,610,108 | 107 | 220 |
x = list(map(int, input().split()))
x = list(map(int, input().split()))
if x[1] == 1:
print(1)
else:
print(0) | from operator import itemgetter
from itertools import chain
N = int(input())
L = []
R = []
for i in range(N):
S = input()
low = 0
var = 0
for s in S:
if s == '(':
var += 1
else:
var -= 1
low = min(low, var)
if var >= 0:
L.append((low, var))
else:
R.append((low, var))
L.sort(key=itemgetter(0), reverse=True)
R.sort(key=lambda x: x[0] - x[1])
pos = 0
for i, (low, var) in enumerate(chain(L, R)):
if pos + low < 0:
ans = 'No'
break
pos += var
else:
ans = 'Yes' if pos == 0 else 'No'
print(ans)
| 0 | null | 74,223,505,122,020 | 264 | 152 |
def main():
A = input().split()
l = []
operator = None
for character in A:
if character in ["+", "-", "*"]:
if character == "+":
l.append(l.pop()+l.pop())
elif character == "-":
l.append(-l.pop()+l.pop())
else:
l.append(l.pop()*l.pop())
else:
l.append(int(character))
print(l[0])
if __name__ == "__main__":
import os
import sys
if len(sys.argv) > 1:
if sys.argv[1] == "-d":
fd = os.open("input.txt", os.O_RDONLY)
os.dup2(fd, sys.stdin.fileno())
main()
else:
main() | a, b = input().split()
a = int(a)
if '.' in b:
i, f = b.split('.')
b = int(i) * 100 + int(f)
else:
b = int(b) * 100
ans = a * b // 100
print(ans)
| 0 | null | 8,347,222,673,184 | 18 | 135 |
deglist = raw_input().split(" ")
a = int(deglist[0])
b = int(deglist[1])
c = int(deglist[2])
cnt = 0
for x in range(a, b+1):
if c % x == 0:
cnt += 1
print cnt | K = int(input())
A, B = map(int, input().split())
cnt = 0
while 1:
cnt+=K
if A <= cnt <= B:
print("OK")
break
if B < cnt:
print("NG")
break | 0 | null | 13,554,989,423,840 | 44 | 158 |
nums = list(map(int,input().split()))
N = nums[0]
M = nums[1]
numss = list(map(int,input().split()))
cnt = M
summ = sum(numss)
for num in numss:
if num >= summ/(M*4):
cnt -= 1
if cnt > 0:
print("No")
else:
print("Yes") | n=int(input())
a=list(map(int,input().split()))
b=[]
s=0
for aa in a:
s^=aa
for aa in a:
b.append(s^aa)
print(*b) | 0 | null | 25,651,038,879,102 | 179 | 123 |
from bisect import bisect_left
from itertools import accumulate
n, m = map(int, input().split())
hands = [int(x) for x in input().split()]
increasing = sorted(hands)
hands = list(reversed(increasing))
xs = [0] + list(accumulate(hands))
max_x = 2 * 10**5 + 1
min_x = 0
def canGet(x):
count = 0
for hand in increasing:
idx = bisect_left(increasing, x-hand)
count += n - idx
return count >= m
while max_x - min_x > 1:
# left
mid = (max_x + min_x) // 2
if canGet(mid):
min_x = mid
else:
max_x = mid
ans = 0
count = 0
for Ai in hands:
idx = bisect_left(increasing, min_x-Ai)
ans += Ai*(n-idx) + xs[n-idx]
count += n-idx
print(ans-(count-m)*min_x)
| import numpy as np
n, k = map(int, input().split())
a = np.array(list(map(int, input().split())))
a.sort()
l, r = 0, 10000000000
while r - l > 1:
m = (l + r) // 2
res = n * n - a.searchsorted(m - a).sum()
if res >= k:
l = m
else:
r = m
b = np.array([0] * (n + 1))
for i in range(1, n + 1):
b[i] = b[i - 1] + a[n - i]
cnt = 0
ans = 0
for x in a:
t = n - a.searchsorted(l - x)
ans += b[t] + x * t
cnt += t
print(ans - (cnt - k) * l)
| 1 | 108,196,151,320,762 | null | 252 | 252 |
def some():
n, k = map(int, input().split(" "))
h = map(int, input().split(" "))
print(len([i for i in h if i >= k]))
some() | n, h = map(int, input().split())
hn = map(int, input().split())
cnt = 0
for i in hn:
if i >= h:
cnt += 1
print(cnt) | 1 | 179,247,528,678,662 | null | 298 | 298 |
def main():
a, b = map(int, input().split())
if a == b:
print("Yes")
else:
print("No")
if __name__ == "__main__":
main() | class Dice(object):
def __init__(self, num):
self.num = num
def rotate_S(self):
self.num = [self.num[4], self.num[0], self.num[2], self.num[3], self.num[5], self.num[1]]
def rotate_N(self):
self.num = [self.num[1], self.num[5], self.num[2], self.num[3], self.num[0], self.num[4]]
def rotate_W(self):
self.num = [self.num[2], self.num[1], self.num[5], self.num[0], self.num[4], self.num[3]]
def rotate_E(self):
self.num = [self.num[3], self.num[1], self.num[0], self.num[5], self.num[4], self.num[2]]
def get_right_num(self, a, b):
top_index = self.num.index(a) + 1
front_index = self.num.index(b) + 1
if [top_index, front_index] in [[2, 3], [3, 5], [5, 4], [4, 2]]:
return self.num[0]
elif [top_index, front_index] in [[1, 4], [4, 6], [6, 3], [3, 1]]:
return self.num[1]
elif [top_index, front_index] in [[1, 2], [2, 6], [6, 5], [5, 1]]:
return self.num[2]
elif [top_index, front_index] in [[1, 5], [5, 6], [6, 2], [2, 1]]:
return self.num[3]
elif [top_index, front_index] in [[1, 3], [3, 6], [6, 4], [4, 1]]:
return self.num[4]
elif [top_index, front_index] in [[2, 4], [4, 5], [5, 3], [3, 2]]:
return self.num[5]
dice = Dice(map(int, raw_input().split()))
Q = input()
for q in range(Q):
num_set = map(int, raw_input().split())
print dice.get_right_num(num_set[0], num_set[1]) | 0 | null | 41,586,705,420,964 | 231 | 34 |
H,W,*L = open(0).read().split()
H,W = map(int, (H,W))
dp = [[0]*W for i in range(H)]
for i in range(1,H):
if L[i][0]!=L[i-1][0]:
dp[i][0] = dp[i-1][0]+1
else:
dp[i][0] = dp[i-1][0]
for j in range(1,W):
if L[0][j]!=L[0][j-1]:
dp[0][j] = dp[0][j-1]+1
else:
dp[0][j] = dp[0][j-1]
for i in range(1,H):
for j in range(1,W):
if L[i][j]!=L[i-1][j] and L[i][j]!=L[i][j-1]:
dp[i][j] = min(dp[i-1][j],dp[i][j-1])+1
elif L[i][j]!=L[i-1][j]:
dp[i][j] = min(dp[i-1][j]+1,dp[i][j-1])
elif L[i][j]!=L[i][j-1]:
dp[i][j] = min(dp[i-1][j],dp[i][j-1]+1)
else:
dp[i][j] = min(dp[i-1][j],dp[i][j-1])
if L[0][0]=='.':
ans = (dp[H-1][W-1]+1)//2
else:
ans = (dp[H-1][W-1]+2)//2
print(ans) | import math
a,b,x = map(int,input().split())
if x <= a*a*b/2:
print(math.atan((a*b*b/2/x))*180/math.pi)
else:
print(math.atan((a*a*b-x)/(a**3)*2)*180/math.pi) | 0 | null | 105,812,897,019,580 | 194 | 289 |
import heapq
n = int(input())
a = [int(x) for x in input().split()]
a.sort()
bef = a[0]
for i in range(1,n):
if bef == a[i]:
print("NO")
break
bef = a[i]
if i == n-1:
print("YES") | from collections import Counter
n = int(input())
a = list(map(int, input().split()))
a = Counter(a).most_common()
if len(a) == n:
print('YES')
else:
print('NO') | 1 | 74,228,648,014,312 | null | 222 | 222 |
a,b=[int(i)for i in input().split()]
c=a-2*b
if c>0:
print(c)
else:
print('0') | 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 # (string,3) 3回
from collections import deque
from collections import defaultdict
import bisect
#
# d = m - k[i] - k[j]
# if kk[bisect.bisect_right(kk,d) - 1] == d:
#
#
#
# pythonで無理なときは、pypyでやると正解するかも！！
#
#
import sys
sys.setrecursionlimit(10000000)
mod = 10**9 + 7
def readInts():
return list(map(int,input().split()))
def main():
a,b = readInts()
print(a - b*2 if a - b*2 >= 0 else 0)
if __name__ == '__main__':
main()
| 1 | 165,883,501,999,678 | null | 291 | 291 |
a,b,c,d=map(int,input().split())
print("No" if (a-1)//d<(c-1)//b else"Yes") | import math
from math import gcd
INF = float("inf")
import sys
input=sys.stdin.readline
sys.setrecursionlimit(500*500)
import itertools
from collections import Counter,deque
def main():
a,b,c,d = map(int, input().split())
while True:
c -= b
if c<= 0:
print("Yes")
exit()
a -= d
if a <= 0:
print("No")
exit()
if __name__=="__main__":
main()
| 1 | 29,685,070,256,788 | null | 164 | 164 |
#http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ALDS1_3_A&lang=jp
#????????????
#????????????python???????????????????????????????????????push???pop?????????
#??????????????????????????°????????§??????????§£???????????\??£???
def rpn(formula):
stack = Stack()
for d in formula:
if d == "+":
stack.push(stack.pop() + stack.pop())
elif d == "-":
stack.push(-stack.pop() + stack.pop())
elif d == "*":
stack.push(stack.pop() * stack.pop())
else:
stack.push(int(d))
return stack.pop()
class Stack:
def __init__(self):
self.data = []
def push(self, d):
#print(self.data)
self.data.append(d)
def pop(self):
#print(self.data)
r = self.data[-1]
self.data = self.data[:-1]
return r
def main():
formula = input().split()
print(rpn(formula))
if __name__ == "__main__":
main() | from sys import stdin
N, M = [int(x) for x in stdin.readline().rstrip().split()]
if N == M:
print("Yes")
else:
print("No")
| 0 | null | 41,891,329,028,520 | 18 | 231 |
n = int(input())
s = input()
nr = s.count('R')
nw = len(s)-nr
a = ('R'*nr)+('W'*nw)
c = 0
for i in range(n):
if(s[i:i+1] != a[i:i+1]):
c += 1
print(c // 2) | n = int(input())
cl = input()
if cl[:cl.count('R')].count('W') != 0:
print(min(cl[:cl.count('R')].count('W'), cl.count('R')))
else:
print(0) | 1 | 6,297,840,807,452 | null | 98 | 98 |
#http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ALDS1_3_C&lang=jp
#???????????£????????????
NEXT = 2
DATA = 1
PREV = 0
from collections import deque
def dll_processor(operations):
front = None
end = None
dll = deque([])
for o in operations:
if o[0] == "insert":
dll.appendleft(o[1])
#front, end = insert(front, end, o[1])
elif o[0] == "delete":
if o[1] in dll:
dll.remove(o[1])
#front, end = delete(front, end, o[1])
elif o[0] == "deleteFirst":
dll.popleft()
#front, end = delete_first(front, end)
elif o[0] == "deleteLast":
dll.pop()
#front, end = delete_last(front, end)
#print(get_list(front))
return dll
def get_list(front):
if not front:
return []
l = []
target = front
while True:
l.append(target[DATA])
if not target[NEXT]:
break
target = target[NEXT]
return l
def insert(front, end, target):
node = [None, target, None]
if front:
front[PREV] = node
node[NEXT] = front
return node, end
else:
return node, node
def delete(front, end,target):
delete_node = front
while not delete_node[DATA] == target:
delete_node = delete_node[NEXT]
if delete_node == None:
return front, end
if delete_node[PREV] == None:
delete_node[NEXT][PREV] = None
return delete_node[NEXT], end
elif delete_node[NEXT] == None:
delete_node[PREV][NEXT] = None
return front, delete_node[PREV]
else:
delete_node[NEXT][PREV] = delete_node[PREV]
delete_node[PREV][NEXT] = delete_node[NEXT]
return front, end
def delete_last(front, end):
if not end[PREV]:
return None, None
else:
end[PREV][NEXT] = None
return front, end[PREV]
def delete_first(front, end):
if not front[NEXT]:
return None, None
else:
front[NEXT][PREV] = None
return front[NEXT], end
def main():
n_list = int(input())
target_list = [input().split() for i in range(n_list)]
print(*dll_processor(target_list))
if __name__ == "__main__":
main() | #設定
import sys
input = sys.stdin.buffer.readline
#ライブラリインポート
from collections import defaultdict
con = 10 ** 9 + 7
#入力受け取り
def getlist():
return list(map(int, input().split()))
class Combination(object):
def __init__(self, N, con):
self.fac = [0] * (N + 1)
self.inv = [0] * (N + 1)
self.finv = [0] * (N + 1)
self.fac[0], self.fac[1] = 1, 1
self.inv[1] = 1
self.finv[0], self.finv[1] = 1, 1
# 前計算
for i in range(2, N + 1):
self.fac[i] = self.fac[i - 1] * i % con
self.inv[i] = self.inv[con % i] * (con - (con // i)) % con
self.finv[i] = self.finv[i - 1] * self.inv[i] % con
def com(self, N, k):
return (self.fac[N] * self.finv[k] * self.finv[N - k]) % con
#処理内容
def main():
N, K = getlist()
if K >= N:
Com = Combination(2 * N - 1, con)
ans = Com.com(2 * N - 1, N)
print(ans)
else:
Com1 = Combination(N, con)
Com2 = Combination(N - 1, con)
ans = 0
for i in range(1, K + 1):
ans += Com1.com(N, i) * Com2.com(N - 1, i)
ans %= con
ans = (ans + 1) % con
print(ans)
if __name__ == '__main__':
main() | 0 | null | 33,385,532,690,942 | 20 | 215 |
import copy
D = int( input() )
c = list( map( int, input().split() ) )
s = []
for _ in range( D ):
s_i = list( map( int, input().split() ) )
s.append( s_i )
t = []
for _ in range( D ):
t_i = int( input() )
t.append( t_i - 1 )
last = []
last_i = [ -1 for _ in range( 26 ) ]
for i in range( D ):
last_i[ t[ i ] ] = i
last.append( copy.deepcopy( last_i ) )
# def satisfy( D, c, s, t, last, d ):
satisfy = [ 0 for _ in range( D ) ]
for d in range( D ):
satisfy[ d ] += s[ d ][ t[ d ] ]
for i in range( 26 ):
satisfy[ d ] -= c[ i ] * ( d - last[ d ][ i ] )
v = 0
for v_i in satisfy:
v += v_i
print( v )
| import numpy as np
D = int(input())
C = list(map(int, input().split()))
B = np.array([0] * 26)
S = [list(map(int, input().split())) for _ in range(D)]
satisfaction = 0
for d in range(1, D+1):
t = int(input())
B[t-1] = d
deduction = sum(C * (d - B))
satisfaction += S[d-1][t-1] - deduction
print(satisfaction) | 1 | 9,978,584,846,050 | null | 114 | 114 |
n=int(input())
for i in range(n):
p=list(map(int,input().split(" ")))
p.sort()
if pow(p[0],2) + pow(p[1],2) == pow(p[2],2):
print('YES')
else:
print('NO')
| from collections import Counter
S = input()
S = S + '0'
mod = 2019
p = [-1] * len(S)
r = 0
d = 1
for i,s in enumerate(S[::-1]):
t = int(s)%mod
r += t*d
r %= mod
d = d*10%mod
p[i] = r
ans = 0
c = Counter(p)
for k,n in c.most_common():
if n > 1:
ans += n*(n-1)//2
else:break
print(ans) | 0 | null | 15,456,975,167,172 | 4 | 166 |
a, b = map(int, raw_input().split())
d = a // b
r = a % b
f = round(float(a)/float(b), 6)
print d,r,f | r = float(input())
pi = 3.141592653589793
print(pi*r**2, 2*pi*r)
| 0 | null | 624,940,580,570 | 45 | 46 |
def main():
s=input()
ans=0
for i in range(0,int(len(s)/2)):
if s[i]!=s[-1*(i+1)]:
ans+=1
print(ans)
main() | l = int(raw_input())
print "",
for i in range(l+1):
if i//3 != 0:
if i%3 ==0:
print i,
elif "3" in str(i):
print i, | 0 | null | 60,195,202,494,460 | 261 | 52 |
import sys
import bisect
input = sys.stdin.readline
class Bisect(object):
def bisect_max(self, reva, func,M):
ok = 0 # exist
ng = 4*(10**5) # not exist
while abs(ok-ng) > 1:
cnt = (ok + ng) // 2
if func(cnt,reva,M):
ok = cnt
else:
ng = cnt
return ok
def solve1(tgt,reva,M):
res=0
n = len(reva)
for i in range(n):
tmp = bisect.bisect_left(reva,tgt-reva[i])
tmp = n - tmp
res += tmp
if M <= res:
return True
else:
return False
N,M = map(int,input().split())
a = list(map(int,input().split()))
a.sort(reverse=True)
reva = a[::-1]
bs = Bisect()
Kmax = (bs.bisect_max(reva,solve1,M))
r=[0]
for i in range(N):
r.append(r[i]+a[i])
res = 0
cnt = 0
t = 0
for i in range(N):
tmp = bisect.bisect_left(reva,Kmax-reva[N-i-1])
tmp2 = bisect.bisect_right(reva,Kmax-reva[N-i-1])
if tmp!=tmp2:
t = 1
tmp = N - tmp
cnt += tmp
res += tmp*a[i]+r[tmp]
if t==1:
res -= (cnt-M)*Kmax
print(res)
| n, m = map(int, input().split())
*A, = map(int, input().split())
A.sort()
# Aの累積和を求めておく
S = [0]
x = 0
for a in A:
x += a
S.append(x)
def lower(x):
# A[i]<xなるiの個数
left = -1
right = n
while right-left > 1:
mid = (left+right)//2
if A[mid] < x:
left = mid
else:
right = mid
return right
def lower_pair(x):
# A[i]+A[j]<xなる(i,j)の個数
cnt = 0
for a in A:
cnt += lower(x-a)
return cnt
# A[i]+A[j]のm番目に大きい値を求める
# lower_pair(x)<n**2-mなる最大のxを求めればよい
left = 2*min(A)
right = 2*max(A)
while right-left > 1:
mid = (left+right)//2
if lower_pair(mid) < n**2-m:
left = mid
else:
right = mid
x = left
# A[i]+A[j]>=xとなる(i,j)の個数とA[i]+A[j]の総和を求める
k = n**2-lower_pair(x)
s = 0
for a in A:
cnt = lower(x-a)
s += (n-cnt)*a+S[n]-S[cnt]
print(s-(k-m)*x)
| 1 | 108,449,755,876,100 | null | 252 | 252 |
base = input().split()
print(base[1],end="")
print(base[0]) | from collections import Counter
n,p = map(int,input().split())
S = input()
dp = [0]
mod = p
if p==2:
ans =0
for i in reversed(range(n)):
if int(S[i])%2==0:
ans += i+1
print(ans);exit()
elif p==5:
ans =0
for i in reversed(range(n)):
if int(S[i])%5==0:
ans += i+1
print(ans);exit()
for i in reversed(range(n)):
dp.append(dp[-1]%mod + pow(10,n-1-i,mod)*int(S[i]))
dp[-1]%=mod
count = Counter(dp)
ans = 0
for key,val in count.items():
if val>=2:
ans += val*(val-1)//2
print(ans) | 0 | null | 80,791,536,349,370 | 248 | 205 |
def isprime(n):
divider = 2
while divider ** 2 <= n:
if n % divider == 0:
return False
divider += 1
return True
result = 0
n = int(input())
for n in range(n):
result += isprime(int(input()))
print(result) | n=str(input())
print(n.swapcase())
| 0 | null | 752,580,879,382 | 12 | 61 |
date=[[],[],[]]
a,b,c=0,0,0
while True:
if a < 0 and b < 0 and c < 0:
break
else:
a,b,c =[int(i) for i in input().split()]
date[0].append(a)
date[1].append(b)
date[2].append(c)
for h in range(0,len(date[0])-1):
if date[0][h] == -1 or date[1][h] == -1:
print("F")
elif date[0][h] == date[1][h] == date[2][h]:
break
else:
if date[0][h] + date[1][h] >= 80:
print("A")
else:
if date[0][h] + date[1][h] >= 65:
print("B")
else:
if date[0][h] + date[1][h] >= 50:
print("C")
else:
if date[0][h] + date[1][h] >=30:
if date[2][h] >= 50:
print("C")
else:
print("D")
else:
print("F") | m = []
f = []
r = []
while(1):
a,b,c = map(int,raw_input().split())
if a == -1 and b == -1 and c == -1:
break
else:
m.append(a)
f.append(b)
r.append(c)
for i in range(len(m)):
if m[i] == -1 or f[i] == -1:
print "F"
elif m[i] + f[i] >= 80:
print "A"
elif m[i] + f[i] >= 65:
print "B"
elif m[i] + f[i] >= 50 or r[i] >= 50:
print "C"
elif m[i] + f[i] >= 30:
print "D"
else:
print "F"
| 1 | 1,221,772,018,180 | null | 57 | 57 |
import math
n, x, t = input().split()
answer = math.ceil(int(n) / int(x)) * int(t)
print(answer)
| n , x , t = map(int, input().split())
c = 0
for i in range(n):
n = n - x
c = c + t
if n <= 0:
print(c)
break | 1 | 4,227,856,980,192 | null | 86 | 86 |
# coding=utf-8
if __name__ == '__main__':
N, M = map(int, input().split())
li = list(map(int, input().split()))
lisum = sum(li)
cnt = 0
for i in range(N):
if lisum / (M * 4) <= li[i]:
cnt += 1
if M <= cnt:
print('Yes')
else:
print('No')
| import math
n=int(input())
a=list(map(int,input().split()))
soin = [0]*(10**6+1)
if a.count(1)==n:
print("pairwise coprime")
exit()
def factorization(n):
arr = []
temp = n
for i in range(2, int(-(-n ** 0.5 // 1)) + 1):
if temp % i == 0:
while temp % i == 0:
temp //= i
arr.append(i)
if temp != 1:
arr.append(temp)
if arr == []:
arr.append(n)
return arr
if len(a)>80000:
ans=a[0]
for i in a:
ans=math.gcd(ans,i)
if ans==1:
print("setwise coprime")
else:
print("not coprime")
else:
for i in a:
if i ==1:continue
for num in factorization(i):
soin[num]+=1
if max(soin)==1:
print("pairwise coprime")
elif max(soin)==n and 1 not in a:
print("not coprime")
else:print("setwise coprime")
| 0 | null | 21,463,816,530,280 | 179 | 85 |
import collections
n = int(input())
a = list(map(int, input().split()))
q = int(input())
bc = []
for i in range(q):
bci = list(map(int, input().split()))
bc.append(bci)
d = collections.Counter(a)
ans = sum(a)
for i in range(q):
b, c = bc[i]
num = (c-b)*d[b]
ans += num
print(ans)
d[c] += d[b]
d[b] = 0 | import math
import sys
import collections
import bisect
readline = sys.stdin.readline
def main():
[h, w, n] = [int(readline().rstrip()) for _ in range(3)]
print(math.ceil(n/max(h, w)))
if __name__ == '__main__':
main()
| 0 | null | 50,469,853,773,598 | 122 | 236 |
dice = [int(i) for i in input().split()]
directions = str(input())
for direction in directions:
if direction == "N":
dice = [dice[1], dice[5], dice[2], dice[3], dice[0], dice[4]]
elif direction == "S":
dice = [dice[4], dice[0], dice[2], dice[3], dice[5], dice[1]]
elif direction == "E":
dice = [dice[3], dice[1], dice[0], dice[5], dice[4], dice[2]]
else:
dice = [dice[2], dice[1], dice[5], dice[0], dice[4], dice[3]]
print(dice[0])
| d = input().split()
dicry = {'N':'152304', 'E':'310542', 'W':'215043','S':'402351'}
for i in input():
d = [d[int(c)] for c in dicry[i]]
print(d[0])
| 1 | 228,205,973,300 | null | 33 | 33 |
n = int(raw_input())
ai_list = map(int, raw_input().split())
max_ai = max(ai_list)
min_ai = min(ai_list)
sum_ai = sum(ai_list)
print '%d %d %d' % (min_ai, max_ai, sum_ai) | n = int(input())
a = list(map(int, input().split()))
p = sorted([(x, i) for i, x in enumerate(a)], reverse=True)
dp = [[0 for _ in range(n+1)] for _ in range(n+1)]
for s in range(1, n+1):
for x in range(s+1):
y = s-x
if x > 0:
dp[x][y] = max(dp[x][y], dp[x-1][y] + abs(p[s-1][1] - x + 1) * p[s-1][0])
if y > 0:
dp[x][y] = max(dp[x][y], dp[x][y-1] + abs(n-y - p[s-1][1]) * p[s-1][0])
print(max(dp[x][n-x] for x in range(n+1))) | 0 | null | 17,086,781,361,728 | 48 | 171 |
def main():
n = int(input())
if n%2==1:
print(0)
else:
ans = 0
waru = 10
while n>=waru:
ans += n//waru
waru = waru*5
print(ans)
if __name__ == "__main__":
main()
| def cin():
in_ = list(map(int,input().split()))
if len(in_) == 1: return in_[0]
else: return in_
def fact_prime(n, p):
ret = 0
temp = p
while(n >= p):
ret += n // p
p *= temp
return ret
n = cin()
if n % 2:
n = (n + 1) // 2
a2 = fact_prime(2 * n, 2)
a5 = fact_prime(2 * n, 5)
b2 = fact_prime(n, 2) + n
b5 = fact_prime(n, 5)
ans = min(a2 - b2, a5 - b5)
else:
n = n // 2
ans = fact_prime(n, 5)
print(ans) | 1 | 116,209,253,470,688 | null | 258 | 258 |
import sys
from functools import reduce
import copy
import math
from pprint import pprint
import collections
import bisect
import itertools
import heapq
sys.setrecursionlimit(4100000)
def inputs(num_of_input):
ins = [input() for i in range(num_of_input)]
return ins
def int_inputs(num_of_input):
ins = [int(input()) for i in range(num_of_input)]
return ins
def solve(input):
nums = string_to_int(input)
def euclid(large, small):
if small == 0:
return large
l = large % small
return euclid(small, l)
nums.sort(reverse=True)
eee = euclid(nums[0], nums[1])
return int((nums[0] * nums[1]) / eee)
def string_to_int(string):
return list(map(lambda x: int(x), string.split()))
if __name__ == "__main__":
ret = solve(input())
print(ret)
| INF = 10 ** 18
n, m = map(int, input().split())
c = list(map(int, input().split()))
dp = [INF] * (n + 1)
dp[0] = 0
for i in range(m):
for j in range(c[i], n + 1):
dp[j] = min(dp[j], dp[j - c[i]] + 1)
print(dp[n])
| 0 | null | 56,441,483,241,568 | 256 | 28 |
X,K,D=input().split(' ')
x,k,d=abs(int(X)),int(K),int(D)
x_par=x%d
x_num=int((x-x_par)/d)
s=0
if x_num<=k:
x_div=x-x_num*d
k-=x_num
if k%2==0:
s=abs(x_div)
else:
s=x_div-d
else:
s=x-d*k
print(abs(s)) | X, K, D = map(int, input().split())
X = abs(X)
r = X % D
t = X // D
if t >= K:
ans = abs(X - K * D)
elif (K - t) % 2 == 0:
ans = r
else:
ans = D - r
print(ans) | 1 | 5,218,291,494,460 | null | 92 | 92 |
word = input()
num = int(input())
for index in range(num):
code = input().split()
instruction = code[0]
start, end = int(code[1]), int(code[2])
if instruction == "replace":
word = word[:start] + code[3] + word[end+1:]
elif instruction == "reverse":
reversed_ch = "".join(reversed(word[start:end+1]))
word = word[:start] + reversed_ch + word[end+1:]
else:
print(word[start:end+1])
| text = list(input())
num = int(input())
for i in range(num):
cmd = input().split()
start, end = map(int, cmd[1:3])
if cmd[0] == 'replace':
text[start:end+1] = list(cmd[-1])
elif cmd[0] == 'reverse':
text[start:end+1] = (text[start:end+1])[::-1]
elif cmd[0] == 'print':
print(''.join(text[start:end+1]))
| 1 | 2,056,628,021,958 | null | 68 | 68 |
N = int(input())
print(N//2 if N%2 else N//2-1) | a = int(input())
if a < 2:
print(0)
elif a % 2 == 0:
print(int(a / 2 - 1) )
else:
print(int(a/2)) | 1 | 152,828,024,099,310 | null | 283 | 283 |
# ng, ok = 0, 10**9+1
n,k = map(int, input().split())
al = list(map(int, input().split()))
ng, ok = 0, 10**9+1
while abs(ok-ng) > 1:
mid = (ok+ng)//2
ok_flag = True
# ...
cnt = 0
for a in al:
cnt += (a-1)//mid
if cnt <= k:
ok = mid
else:
ng = mid
print(ok)
| import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
import math
import collections
import copy
INF = 10**9
def ok(l):
cnt = 0
for L in a:
cnt += L//l
if L%l != 0:
cnt+=1
cnt-=1
return cnt <= k
if __name__ == "__main__":
n,k = map(int,input().split())
a = list(map(int,input().split()))
left = 0
right = max(a)
#最大値の最小値は二分探索
while right - left > 1:
mid = (right+left)//2
if ok(mid):
right = mid
else:
left = mid
print(right) | 1 | 6,467,848,647,688 | null | 99 | 99 |
n = int(input())
furui = [i for i in range(10**6+2)]
ans = 9999999999999
yakusuu = []
for i in range(1,int(n**0.5)+1+1):
if n%i == 0:
yakusuu.append(i)
for i in yakusuu:
ans = min(i+n//i,ans)
# print(i,ans)
print(ans-2)
| def factorization(n):
arr = []
temp = n
for i in range(2, int(-(-n**0.5//1))+1):
if temp%i==0:
cnt=0
while temp%i==0:
cnt+=1
temp //= i
arr.append([i, cnt])
if temp!=1:
arr.append([temp, 1])
if arr==[]:
arr.append([n, 1])
return arr
N = int(input())
if N == 1:
print("0")
exit()
factors = factorization(N)
ans = 0
for factor in factors:
num = factor[1]
x = 1
for i in range(num+1):
if i**2 + i > 2*num:
x = i-1
break
# print(num,x)
ans += x
print(ans)
| 0 | null | 89,163,073,301,760 | 288 | 136 |
from __future__ import print_function
import sys
officalhouse = [0]*4*3*10
n = int( sys.stdin.readline() )
for i in range( n ):
b, f, r, v = [ int( val ) for val in sys.stdin.readline().split( " " ) ]
bfr = (b-1)*30+(f-1)*10+(r-1)
officalhouse[bfr] = officalhouse[bfr] + v;
output = []
for b in range( 4 ):
for f in range( 3 ):
for r in range( 10 ):
output.append( " {:d}".format( officalhouse[ b*30 + f*10 + r ] ) )
output.append( "\n" )
if b < 3:
output.append( "####################\n" )
print( "".join( output ), end="" ) | data = [None] * 4
for i in xrange(4):
data[i] = [None] * 3
for j in xrange(3):
data[i][j] = [0] * 10
n = input()
for i in xrange(n):
line = map(int, raw_input().split())
data[line[0] - 1][line[1] - 1][line[2] - 1] += line[3]
for i in xrange(4):
for j in xrange(3):
s = ""
for k in xrange(10):
s += ' '
s += str(data[i][j][k])
print s
if i < 3:
print '#' * 20 | 1 | 1,113,104,732,428 | null | 55 | 55 |
n=int(input())
p=1
while n > 0:
n-=26**p
p+=1
else:
p-=1
if n==0:
ans="z"*p
print(ans)
else:
n+=26**p
num=[]
for i in range(1,p+1):
if n%(26**(p-i))==0:
a=int(n/(26**(p-i)))-1
q=p-i
num.append(a)
break
else:
a=n//(26**(p-i))
num.append(a)
n-=a*(26**(p-i))
al=[]
if n==0:
for i in range(p-1):
m=chr(97+num[i])
al.append(m)
al.append(chr(96+num[p-1]))
ans=''.join(al)
else:
for i in num:
m=chr(97+i)
al.append(m)
al.append("z"*q)
ans=''.join(al)
print(ans) | chars = [chr(i) for i in range(ord('a'), ord('z') + 1)]
arr = []
x = int(input())
def get_len(n):
length = 1
t = 26
while True:
if n <= t:
return length
t += 26 ** (length + 1)
length += 1
if length > 1000000000000001:
raise
def get_ord(n):
st = 1
end = 26
ind = 1
while True:
if st <= n <= end:
return x - st
st = end + 1
end += 26 ** (ind + 1)
ind += 1
length = get_len(x)
order = get_ord(x)
# print(length)
for i in range(length):
s = order % 26
order = order // 26
arr.append(s)
# print(arr)
ans = ""
for ai in arr[::-1]:
ans += chars[ai]
print(ans) | 1 | 11,987,711,064,420 | null | 121 | 121 |
from collections import deque
n, q = [int(_) for _ in input().split()]
processes = deque([tuple(input().split()) for i in range(n)])
time = 0
while processes:
process = processes.popleft()
if int(process[1]) <= q:
time += int(process[1])
print(process[0], time)
else:
time += q
processes.append((process[0], int(process[1]) - q))
| N, K = map(int,input().split())
def abc(n,m):
a,b = divmod(n,m)
return a,b
count = 0
a = 1
while a !=0 :
a,b = abc(N,K)
N = a
count += 1
print(count) | 0 | null | 32,354,032,981,788 | 19 | 212 |
x=input().split()
K=int(x[0])
X=int(x[1])
if 500*K>=X:
print('Yes')
else:
print('No') | a = list(map(int, input().split()))
if a[0]*500 < a[1]:
print('No')
else:
print('Yes') | 1 | 97,698,580,086,578 | null | 244 | 244 |
S = input()
N = len(S)
mod = 2019
cnt = [0 for _ in range(2019)]
S = S[::-1]
wk = 0
cnt[0] = 1
for i in range(0,N):
wk = (wk + int(S[i]) * pow(10,i,mod)) % mod
#print(i,wk)
cnt[wk] += 1
ans = 0
for i in range(2019):
m = cnt[i]
ans += m * (m-1) // 2
print(ans) | # -*- coding: utf-8 -*-
import sys
import math
import os
import itertools
import string
import heapq
import _collections
from collections import Counter
from collections import defaultdict
from collections import deque
from functools import lru_cache
import bisect
import re
import queue
import decimal
class Scanner():
@staticmethod
def int():
return int(sys.stdin.readline().rstrip())
@staticmethod
def string():
return sys.stdin.readline().rstrip()
@staticmethod
def map_int():
return [int(x) for x in Scanner.string().split()]
@staticmethod
def string_list(n):
return [Scanner.string() for i in range(n)]
@staticmethod
def int_list_list(n):
return [Scanner.map_int() for i in range(n)]
@staticmethod
def int_cols_list(n):
return [Scanner.int() for i in range(n)]
MOD = 2019
# INF = int(1e15)
def solve():
S = Scanner.string()
S = S[::-1]
cnt = [0 for _ in range(MOD)]
tmp = 0
ans = 0
x = 1
for s in S:
cnt[tmp] += 1
tmp += int(s) * x
tmp %= MOD
x *= 10
x %= MOD
ans += cnt[tmp]
print(ans)
def main():
# sys.setrecursionlimit(1000000)
# sys.stdin = open("sample.txt")
# T = Scanner.int()
# for _ in range(T):
# solve()
# print('YNeos'[not solve()::2])
solve()
if __name__ == "__main__":
main()
| 1 | 30,831,884,215,728 | null | 166 | 166 |
a=input()
e=a[len(a)-1:len(a)]
if e == "s":
print(a+"es")
else:
print(a+"s") | x = int(input())
a = [0]*1000
for i in range(1000):
tmp = i**5
a[i] = tmp
for i in range(1000):
for j in range(1000):
if((a[i]-x) == (a[j])):
print(i,j)
exit()
elif(x-a[i]==a[j]):
print(i,-j)
exit()
| 0 | null | 14,058,728,742,900 | 71 | 156 |
# 高橋君と青木君がモンスターを闘わせます。
# 高橋君体力 A 攻撃力 B です。
# 青木君体力 C 攻撃力 D です。
# 高橋君→青木君→高橋君→青木君→... の順に攻撃を行います。
# このことをどちらかのモンスターの体力が 0 以下になるまで続けたとき、
# 先に自分のモンスターの体力が 0 以下になった方の負け、そうでない方の勝ちです。
# 高橋君が勝つなら Yes、負けるなら No を出力してくださ
a, b, c, d = list(map(int, input(). split()))#10 9 10 10
while True:
c -= b
if c <= 0:
print("Yes")
break
a -= d
if a <= 0:
print("No")
break
| # rainy season
def rainy(S):
if 'RRR' in S:
return 3
if 'RR' in S:
return 2
if 'R' in S:
return 1
return 0
if __name__ == "__main__":
input = list(input().split())
print(rainy(input[0]))
| 0 | null | 17,229,126,815,412 | 164 | 90 |
n = int(input())
minv = int(input())
maxv = -1000000000
for i in range(1,n):
r = int(input())
m = r-minv
if maxv < m < 0:
maxv = m
minv = r
elif maxv < m:
maxv = m
elif m < 0:
minv = r
print(maxv) | n=int(raw_input().strip())
lst=[]
minval=0x3f3f3f3f
ans=-0x3f3f3f3f
for i in xrange(n):
val=int(raw_input().strip())
if(i>=1):
#print val,minval
ans=max(ans,val-minval)
minval = min(minval, val)
print ans
| 1 | 12,398,346,532 | null | 13 | 13 |
x = list(map(int, input().split()))
for i in range(len(x)):
if x[i] == 0:
print(i+1)
break
else:
continue | def popcount(n):
ret = 0
while n > 0:
ret += n & 1
n >>= 1
return ret
def f(n):
ret = 0
while n > 0:
n %= popcount(n)
ret += 1
return ret
def mod(x, d):
'''
x % d where x: string, d: int
'''
rem = 0
for i in range(len(x)):
divd = (rem << 1) + int(x[i], 2)
rem = divd % d
return rem
N = int(input())
X = input()
popx = X.count('1')
qp = mod(X, popx + 1) # X mod (popcount(X) + 1)
if popx - 1 > 0:
qm = mod(X, popx - 1) # X mod (popcount(X) - 1)
ans = []
pow2p = pow2m = 1
for i in range(N):
if X[N - 1 - i] == '1':
if popx == 1: # X_iが0
ans.append(0)
else:
next = (qm - pow2m) % (popx - 1)
ans.append(1 + f(next))
else: # X[N - 1 - i] == '0'
next = (qp + pow2p) % (popx + 1)
ans.append(1 + f(next))
pow2p = pow2p * 2 % (popx + 1)
if popx > 1:
pow2m = pow2m * 2 % (popx - 1)
for i in range(N - 1, -1, -1):
print(ans[i]) | 0 | null | 10,840,850,243,850 | 126 | 107 |
N,S=map(int,input().split())
A=list(map(int,input().split()))
pr=998244353
def gya(n):
return pow(n,pr-2,pr)
p=pow(2,N-1,pr)
l=[0]*(S+1)
g=gya(2)
for i in A:
for j in range(S-i,-1,-1):
l[i+j]=(l[i+j]+(l[j]*g))%pr
if i<=S:
l[i]+=p
print(l[-1]) | import sys
from collections import OrderedDict
input = sys.stdin.readline
sys.setrecursionlimit(2 * 10**6)
def inpl():
return list(map(int, input().split()))
def main():
MOD = 998244353
N, S = inpl()
A = sorted(inpl())
dp = {}
dp[0] = 1
for i, a in enumerate(A):
# print(i, dp)
ks = sorted(dp.keys())
for k in ks[::-1]:
# print(k)
if k + a <= S:
if k + a in dp:
dp[k + a] = (dp[k] + dp[k + a]) % MOD
else:
dp[k + a] = dp[k]
dp[k] = (dp[k] * 2) % MOD
# print(dp)
print(0 if S not in dp else dp[S])
return
if __name__ == '__main__':
main()
| 1 | 17,611,392,519,700 | null | 138 | 138 |
N=int(input())
n500=N//500
n5=(N%500)//5
print(1000*n500+5*n5) | x=int(input())
n=x//500
m=x%500
k=m//5
print(1000*n+5*k) | 1 | 42,808,315,834,530 | null | 185 | 185 |
from itertools import combinations
N = int(input())
L = list(map(int, input().split()))
count = 0
for C in combinations(L, 3):
l_list = list(C)
l_list.sort()
if l_list[2] > l_list[1] and l_list[1] > l_list[0]:
if l_list[2] < l_list[1] + l_list[0]:
count += 1
print(count) | s = list(input())
t = list(input())
lt = len(t)
ans = lt
for i in range(len(s) - lt + 1):
s_ = s[i: i + lt]
diff = 0
for x, y in zip(s_, t):
if x != y:
diff += 1
ans = min(ans, diff)
print(ans) | 0 | null | 4,382,113,618,400 | 91 | 82 |
x,y=map(int,input().split());print(('No','Yes')[2*x<=~y%2*y<=4*x]) | X,Y = map(int,input().split())
flag = 0
for a in range(X+1):
b = X-a
if 2*a+4*b == Y:
print("Yes")
flag = 1
break
if flag == 0:
print("No") | 1 | 13,732,422,579,402 | null | 127 | 127 |
x,y = map(int,input().split())
if y % 2 != 0:
print('No')
elif x * 2 <= y <= x * 4:
print('Yes')
else:
print('No') | given = input()
data = given.strip().split()
X = int(data[0])
Y = int(data[1])
i = 0
ashi = 0
while (i <= X):
ashi = 2 * (X - i) + 4 * i
if ashi == Y:
print("Yes")
break
i = i + 1
if i == X + 1 and ashi != Y:
print("No") | 1 | 13,764,111,639,730 | null | 127 | 127 |
n = int(input())
s = input()
for i in range(1, n):
if s[0] == s[i] and s[:i] == s[i:]:
print("Yes")
break
else:
print("No") | N = int(input())
S = input()
if N % 2 == 1:
print("No")
exit()
T_len = int(N / 2)
T1 = S[:T_len]
T2 = S[T_len:]
if T1 == T2:
print("Yes")
else:
print("No") | 1 | 146,736,893,709,378 | null | 279 | 279 |
a = int(input())
c=0
for i in range(a + 1):
if bool(i%3!=0 and i % 5 != 0):
c += i
print(c) | N = int(input())
ans = 0
for i in range(N):
j = i + 1
if j % 3 != 0 and j % 5 != 0:
ans += j
print(ans) | 1 | 34,982,411,513,468 | null | 173 | 173 |
#!/usr/bin/env python3
n, k, s = map(int, input().split())
ans = [0] * n
for i in range(n):
a = s
if i >= k:
a = s + 1 if s + 1 < 10 ** 9 else s - 1
ans[i] = a
print(*ans, sep=" ")
| n,k,s=map(int,input().split())
if s!=10**9:ans=[s]*k+[10**9]*(n-k)
else:ans=[s]*k+[1]*(n-k)
print(*ans) | 1 | 91,144,408,759,780 | null | 238 | 238 |
A, B = input().split()
A = int(A)
B = int(B.replace('.',''))
print(f'{A*B//100}') | import sys
# input = sys.stdin.buffer.readline
def input(): return sys.stdin.readline().rstrip()
sys.setrecursionlimit(10 ** 7)
import bisect
from string import ascii_lowercase
d = dict()
for i, c in enumerate(ascii_lowercase):
d[c] = i
N = int(input())
S = list(input())
lst = [[] for _ in range(26)]
for i in range(N):
lst[d[S[i]]].append(i)
Q = int(input())
for q in range(Q):
a, b, c = input().split()
if a=='1':
i = int(b)-1
if c == S[i]: # 変更なし
continue
idx = bisect.bisect_left(lst[d[S[i]]],i)
del lst[d[S[i]]][idx]
bisect.insort_left(lst[d[c]],i)
S[i] = c
else:
l = int(b)-1
r = int(c)
ans = 0
for i in range(26):
cnt = bisect.bisect_left(lst[i],r) - bisect.bisect_left(lst[i],l)
if cnt:
ans += 1
print(ans)
| 0 | null | 39,476,354,924,640 | 135 | 210 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.