code1
stringlengths 16
24.5k
| code2
stringlengths 16
24.5k
| similar
int64 0
1
| pair_id
int64 2
181,637B
⌀ | question_pair_id
float64 3.71M
180,628B
⌀ | code1_group
int64 1
299
| code2_group
int64 1
299
|
|---|---|---|---|---|---|---|
def readinput():
n=int(input())
return n
def main(n):
x7=int(n/1.07)
x8=int(n/1.08)
x9=int(n/1.09)
n100=n*100
for x in range(max(1,x9-1),x7+1+1):
xx=x*108//100
#print(x,xx)
if xx==n:
print(x)
break
else:
print(':(')
if __name__=='__main__':
n=readinput()
main(n)
|
# N=int(input())
A,B=[int(x) for x in input().rstrip().split()]
if A<=B*2:
print(0)
else:
print(A-B*2)
| 0 | null | 146,226,567,757,828 | 265 | 291 |
N = int(input())
count = [[0] * 10 for _ in range(10)]
for i in range(1, N + 1):
s = str(i)
count[int(s[0])][int(s[-1])] += 1
ans = sum(count[i][j] * count[j][i] for i in range(1, 10) for j in range(1, 10))
print(ans)
|
from collections import defaultdict
n = int(input())
d = defaultdict(int)
for i in range(1, n+1):
s = str(i)
f = int(s[0])
b = int(s[-1])
d[(f, b)] += 1
ans = 0
for a in range(1, 10):
for b in range(1, 10):
ans += d[(a, b)] * d[(b, a)]
print(ans)
| 1 | 86,624,648,376,470 | null | 234 | 234 |
a, b = map(int, input().split())
print((a * b) if 0 < a < 10 and 0 < b < 10 else -1)
|
from collections import Counter
n,*a = map(int,open(0).read().split())
s = set(a)
c = Counter(a)
m = max(s)
l = [True]*(m+1)
ans = 0
for i in range(1,m+1):
if i in s and l[i]:
if c[i] == 1:
ans += 1
for j in range(1,m//i+1):
l[i*j] = False
print(ans)
| 0 | null | 86,432,509,186,628 | 286 | 129 |
def main():
class MyClass:
def __init__(self):
self.strings = ""
def rpl(self, int1, int2, str1):
self.strings = self.strings[:int1] + str1 + self.strings[int2+1:]
def rvr(self, int1, int2):
if int1 >= 1:
revstr = self.strings[int2:int1-1:-1]
else:
revstr = self.strings[int2::-1]
self.strings = self.strings[:int1] + revstr + self.strings[int2+1:]
def pri(self, int1, int2):
print(self.strings[int1:int2+1])
cls = MyClass()
cls.strings = input()
n = int(input())
for _ in range(n):
li = input().split()
if li[0] == "replace":
cls.rpl(int(li[1]), int(li[2]), li[3])
elif li[0] == "reverse":
cls.rvr(int(li[1]), int(li[2]))
elif li[0] == "print":
cls.pri(int(li[1]), int(li[2]))
if __name__ == "__main__":
main()
|
S = input()
if S == 'RRR':
print(3)
elif 'RR' in S:
print(2)
elif 'R' in S:
print(1)
else:
print(0)
| 0 | null | 3,530,114,282,456 | 68 | 90 |
import itertools
N = int(input())
P = tuple(map(int, input().split()))
Q = tuple(map(int, input().split()))
tmp = [n+1 for n in range(N)]
parms = list(itertools.permutations(tmp, N))
for i in range(len(parms)):
if parms[i] == P:
a = i
if parms[i] == Q:
b = i
print(abs(a-b))
|
while True:
h,w = map(int,raw_input().split())
if h == 0 and w == 0:
break
for i in range(h):
print '#'*w
print ''
| 0 | null | 50,540,076,193,962 | 246 | 49 |
N, M = (int(x) for x in input().split())
print(int(N*(N-1)/2 + M*(M-1)/2))
|
def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
return divisors
def l_b(x):
ok = 0
ng = 40
while ng - ok > 1:
mid = (ok+ng) // 2
if n % (k ** mid) == 0:
ok = mid
else:
ng = mid
return x ** ok
n = int(input())
L = make_divisors(n)
ans = 0
for k in L:
if k == 1:
continue
k_m = l_b(k)
if (n // k_m) % k == 1:
ans += 1
ans += len(make_divisors(n-1))
ans -= 1
print(ans)
| 0 | null | 43,454,456,084,508 | 189 | 183 |
n = int(input())
cards = [[0 for i in range(13)] for j in range(4)]
for i in range(n):
Input = input().split()
if Input[0] == "S":
cards[0][int(Input[1])-1]= 1
if Input[0] == "H":
cards[1][int(Input[1]) - 1] = 1
if Input[0] == "C":
cards[2][int(Input[1]) - 1] = 1
if Input[0] == "D":
cards[3][int(Input[1]) - 1] = 1
for i in range(4):
for j in range(13):
if cards[i][j] == 0:
if i == 0:
print("S",j+1)
if i == 1:
print("H",j+1)
if i == 2:
print("C", j + 1)
if i == 3:
print("D", j + 1)
|
import sys
def gcd(a, b):
return gcd(b, a % b) if a % b else b
def lcm(a, b):
return a * b / gcd(a, b)
for line in sys.stdin:
data = map(int, line.split())
a, b = data
print "%d %d" % (gcd(a, b), lcm(a, b))
| 0 | null | 516,607,330,348 | 54 | 5 |
from sys import stdin
a, b = map(int, stdin.readline().rstrip().split())
ans = max(0, a - 2 * b)
print(ans)
|
import sys
if __name__ == "__main__":
n, m = map(lambda x: int(x), input().split())
coins = list(map(lambda x: int(x), input().split()))
table = [sys.maxsize] * (n + 2)
table[0] = 0
for i in range(n + 1):
for coin in coins:
if (i + coin <= n):
table[i + coin] = min(table[i + coin], table[i] + 1)
print(table[n])
| 0 | null | 83,723,304,595,840 | 291 | 28 |
n,*a = map(int,open(0).read().split())
all = 0
for i in a:
all^=i
print(*[all^i for i in a])
|
N = int(input())
As = list(map(int,input().split()))
array = []
B = 0
for i in range(N):
B ^= As[i]
ans_array = []
for i in range(N):
ans_array.append(B^As[i])
print(*ans_array)
| 1 | 12,580,265,249,498 | null | 123 | 123 |
next_ord = ord(input()) + 1
print(chr(next_ord))
|
C = input()
C = ord(C)
C = C+1
print(chr(C))
| 1 | 92,305,060,713,920 | null | 239 | 239 |
n, p = (int(i) for i in input().split());
s = input();
if p == 2 or p == 5:
res = 0;
for i in range(len(s)):
if int(s[i]) % p == 0:
res += i + 1;
print(res);
exit(0);
h = [0 for i in range(len(s) + 1)];
st = 1;
for i in range(len(s) - 1,-1,-1):
#print(i);
h[i] = (st * int(s[i]) + h[i + 1]) % p;
st = (st * 10) % p;
#print(h);
h.sort();
#print(h);
i = 0;
res = 0;
while i <= n:
j = i;
while j + 1 <= n and h[i] == h[j + 1]:
j += 1;
l = j - i + 1;
res += (l * (l - 1)) // 2;
i = j + 1;
print(res);
|
def resolve():
l, P = map(int, input().split())
S = input()
ans = 0
# 10^r: 2^r * 5^r の為、10と同じ素数
if P == 2 or P == 5:
for i, s in enumerate(S):
if int(s) % P == 0:
ans += i + 1
return print(ans)
cnts = [0] * P
cnts[0] = 1
num, d = 0, 1
for s in S[::-1]:
s = int(s)
num = (num + (s * d)) % P
d = (10 * d) % P
cnts[num] += 1
for cnt in cnts:
ans += cnt * (cnt - 1) // 2
print(ans)
if __name__ == "__main__":
resolve()
| 1 | 58,370,987,460,454 | null | 205 | 205 |
import sys
n=int(input())
A=list(map(int,input().split()))
p=10**9+7
status=[1,0,0]
ans=3
if A[0]!=0:
print(0)
sys.exit()
for i in range(1,n):
count=status.count(A[i])
if count==0:
print(0)
sys.exit()
ans=(ans*count)%p
status[status.index(A[i])]+=1
print(ans)
|
X,Y,Z = map(int,input().split())
temp = Y
Y = X
X = temp
temp = Z
Z = X
X = temp
print ("{} {} {}".format(X,Y,Z))
| 0 | null | 84,242,861,559,578 | 268 | 178 |
s = input()
if s[-1] != "s":
s = s + "s"
else:
s = s + "es"
print(s)
|
a=input()
e=a[len(a)-1:len(a)]
if e == "s":
print(a+"es")
else:
print(a+"s")
| 1 | 2,402,691,407,652 | null | 71 | 71 |
while True:
try:
m,f,r = map(int,input().split(" "))
if m == -1:
if f == -1:
if r == -1:
break
if m == -1 or f == -1:
print("F")
continue
if m+f >= 80:
print("A")
if m+f >= 65 and m+f < 80:
print("B")
if m+f >= 50 and m+f < 65:
print("C")
if m+f >= 30 and m+f < 50:
if r >= 50:
print("C")
else:
print("D")
if m+f < 30:
print("F")
except EOFError:
break
|
n = int(input())
A = list(map(int, input().split()))
x = 1000
for i in range(n-1):
if A[i] < A[i+1]:
q, x = divmod(x, A[i])
x += q*A[i+1]
print(x)
| 0 | null | 4,275,723,502,108 | 57 | 103 |
N = int(input())
S, T = input().split()
s_list = list(S)
t_list = list(T)
ans = ''
for i in range(N):
ans += s_list[i]
ans += t_list[i]
print(ans)
|
a, b, c, d = map(int, input().split())
e = a*c
f = a*d
g = b*c
h = b*d
print(max(e,f,g,h))
| 0 | null | 57,221,302,821,202 | 255 | 77 |
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())
H, W, M = MI()
h = [0] * H
w = [0] * W
item_list = [[0, 0] for _ in range(M)]
for i in range(M):
item_h, item_w = MI()
item_h -= 1
item_w -= 1
h[item_h] += 1
w[item_w] += 1
item_list[i][0] = item_h
item_list[i][1] = item_w
h_max = max(h)
w_max = max(w)
h_cnt = h.count(h_max)
w_cnt = w.count(w_max)
ans = h_max + w_max
cnt = 0
for item in item_list:
if h[item[0]] == h_max and w[item[1]] == w_max:
cnt += 1
x = h_cnt * w_cnt
if cnt == x:
ans -= 1
print(ans)
|
def main():
h,w,m = map(int,input().split())
X = [0]*w
Y = [0]*h
g = set([])
for _ in range(m):
a,b = map(int,input().split())
a-=1
b-=1
X[b]+=1
Y[a]+=1
g.add((a,b))
xmax = max(X)
ymax = max(Y)
xlist = []
for i,x in enumerate(X):
if x==xmax:
xlist.append(i)
ylist = []
for i,y in enumerate(Y):
if y==ymax:
ylist.append(i)
ans = xmax+ymax
flag = True
for x in xlist:
for y in ylist:
if (y,x) not in g:
flag = False
break
if not flag:
break
if flag:
ans-=1
print(ans)
main()
| 1 | 4,716,690,943,930 | null | 89 | 89 |
s, t = input().split()
a, b = map(int, input().split())
u = input()
if s == u:
print(str(a-1)+" "+str(b))
else:
print(str(a)+" "+str(b-1))
|
import numpy as np
from functools import *
import sys
sys.setrecursionlimit(100000)
input = sys.stdin.readline
def array(size, init=0):
return [[init for j in range(size[1])] for i in range(size[0])]
def acinput():
return list(map(int, input().split(" ")))
def II():
return int(input())
def nitti(x, y):
count = 0
for i in range(len(x)):
if x[i] == y[i]:
count += 1
return count
x = acinput()
res = 10**20*(-1)
for i in range(2):
for j in range(2, 4):
res = max(res, x[i]*x[j])
print(res)
| 0 | null | 37,432,767,226,888 | 220 | 77 |
N = int(input())
As = list(map(int,input().split()))
As.sort()
M = 1000001
array = [0]*M
for a in As:
if array[a] != 0:
array[a] = 2
continue
for i in range(a,M,a):
array[i] += 1
ans = 0
for a in As:
if array[a] == 1:
ans += 1
print(ans)
|
n=int(input())
A=list(map(int,input().split()))
m=max(A)
X=[0]*(m+1)
A.sort()
for i in range(n):
for j in range(A[i]*2,m+1,A[i]):
X[j]=2
X[A[i]]+=1
print(X.count(1))
| 1 | 14,413,153,396,458 | null | 129 | 129 |
H,W = map(int,input().split())
if(H == 1 or W == 1):
print("1")
elif((H*W)%2 == 0):
print(str((H*W)//2))
else:
print(str((H*W)//2+1))
|
matrix = []
while True:
values = input()
if '0 0' == values:
break
matrix.append([int(x) for x in values.split()])
for height, width in matrix:
for i in range(height):
print('#' * width)
print()
| 0 | null | 25,985,167,414,272 | 196 | 49 |
X=int(input())
a=int(X/500)
s=1000*a
X-=500*a
b=int(X/5)
s+=5*b
print(s)
|
a = list(map(int, input().split()))
if a[0] == a[1] and a[0] != a[2]:
print("Yes")
elif a[0] != a[1] and a[1] == a[2]:
print("Yes")
elif a[0] == a[2] and a[0] != a[1]:
print("Yes")
else:
print("No")
| 0 | null | 55,591,552,913,178 | 185 | 216 |
print(0 if int(input()) else 1)
|
x = not(int(input()))
print(int(x))
| 1 | 2,970,907,868,320 | null | 76 | 76 |
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
N = int(input())
testimony = [[] for _ in range(N)]
for i in range(N):
num = int(input())
for j in range(num):
person, state = map(int, input().split())
testimony[i].append([person-1, state])
honest = 0
for i in range(1, 2**N):
flag = 0
for j in range(N):
if (i>>j)&1 == 1: # j番目は正直と仮定
for x,y in testimony[j]:
if (i>>x)&1 != y: # j番目は正直だが矛盾を発見
flag = 1
break
if flag == 0: # 矛盾がある場合はflag == 1になる
honest = max(honest, bin(i)[2:].count('1')) # 1の数をカウントし最大となるものを選択
print(honest)
|
n = int(input())
g = [[] for _ in range(n)]
for i in range(n):
a = int(input())
for j in range(a):
x, y = map(int, input().split())
x -= 1
g[i].append((x, y))
ans = 0
for i in range(2**n):
temp = [-1]*n
for j in range(n):
if (i >> j) & 1:
temp[j] = 1
else:
temp[j] = 0
flag = True
for j in range(n):
if temp[j] == 1:
for x, y in g[j]:
if temp[x] != y:
flag = False
if flag:
ans = max(ans, sum(temp))
print(ans)
| 1 | 121,026,653,440,160 | null | 262 | 262 |
A, B, C, K = (int(x) for x in input().split())
AB = A + B
if K < A:
print(K)
elif AB < K:
print(A - (K-AB))
else:
print(A)
|
N,X,Y=map(int,input().split())
d=[0]*N
for i in range(N):
for j in range(N):
if not i<j:
continue
dist=min([j-i,abs((X-1)-i)+1+abs(j-(Y-1))])
d[dist]+=1
print(*d[1:],sep='\n')
| 0 | null | 33,176,472,894,110 | 148 | 187 |
import sys
for line in sys.stdin:
a, b = map(int, line.split())
A, B = min(a, b), max(a, b)
while True:
mod = B % A
if mod == 0:
gcd = A
break
else:
A, B = mod, A
lcm = gcd * (a / gcd) * (b / gcd)
print '%d %d' % (gcd, lcm)
|
def pd(n):
i = 2
ans = []
while i ** 2 <= n:
while n % i == 0:
n /= i
ans.append(i)
i += 1
if n > 1:
ans.append(n)
return ans
def gcd(a, b):
gcd = 1
pd_a = pd(a)
pd_b = pd(b)
for i in pd_a:
if i in pd_b:
pd_b.remove(i)
gcd *= i
return int(gcd)
def lcm(a, b):
lcm = a
pd_a = pd(a)
pd_b = pd(b)
for i in pd_a:
if i in pd_b:
pd_b.remove(i)
for j in pd_b:
lcm *= j
return int(lcm)
while True:
try:
s = input()
a,b = [int(i) for i in s.split(' ')]
except:
break
print(gcd(a, b), lcm(a, b))
| 1 | 667,880,038 | null | 5 | 5 |
*abc, k = map(int, input().split())
n = [0] * 3
for i, v in enumerate(abc):
if k >= v:
n[i] = v
k -= v
else:
n[i] = k
break
print(n[0] + n[2] * -1)
|
def resolve():
S = input()
T = input()
cnt = 0
for i in range(len(S)):
s = S[i]
t = T[i]
if s != t:
cnt += 1
print(cnt)
resolve()
| 0 | null | 16,258,581,744,572 | 148 | 116 |
def main():
N = int(input())
A = [int(a) for a in input().split()]
xor_all = A[0]
for i in range(1, N):
xor_all ^= A[i]
for i in range(N):
if i != N - 1:
print(A[i]^xor_all, end=" ")
else:
print(A[i]^xor_all)
if __name__ == "__main__":
main()
|
N = int(input())
a = list(map(int,input().split()))
S = 0
for i in range(N):
S ^= a[i]
Ans = ""
for i in range(N):
print(S^a[i])
| 1 | 12,476,660,565,380 | null | 123 | 123 |
from itertools import combinations
n = int(input())
def dfs(s):
if len(s) == n:
print(s)
return 0
for i in range(ord('a'), ord(max(s))+2):
t = s
t += chr(i)
dfs(t)
dfs('a')
|
n=int(input())
lis=[[[1,"a"]]]
for i in range(n-1):
lisi=[]
for j in lis[i]:
for k in range(j[0]):
lisi.append([j[0],j[1]+chr(ord("a")+k)])
lisi.append([j[0]+1,j[1]+chr(ord("a")+j[0])])
lis.append(lisi)
for i in lis[n-1]:
print(i[1])
| 1 | 52,473,454,919,038 | null | 198 | 198 |
N, X, Y = map(int, input().split())
ans = [0]*N
for i in range(1,N+1):
for j in range(i+1,N+1):
d = min(j-i,abs(i-X)+abs(j-Y)+1)
#print(i,j,d)
ans[d]+=1
print(*ans[1:], sep='\n')
|
n,x,y = map(int, input().split())
lis = [0] * n
x -= 1
y -= 1
for i in range(n):
for j in range(i+1, n):
t = min(abs(i-j), abs(i-x)+abs(j-y)+1,abs(i-y)+abs(j-x)+1)
lis[t] += 1
for i in range(1,n):
print(lis[i])
| 1 | 44,057,613,669,440 | null | 187 | 187 |
N=int(input())
*A,=map(int,input().split())
T=[0]*N
for i in range(N):
T[~-A[i]]=i+1
print(*T)
|
import math
H, W = map(int, input().split())
ans = int(H / 2) * W
if (H % 2) == 1:
ans += math.ceil(W / 2)
if H == 1 or W == 1:
ans = 1
print(ans)
| 0 | null | 115,853,502,166,660 | 299 | 196 |
S = input()
T = input()
t = T[:len(S)]
if t == S:
print('Yes')
else:
print('No')
|
def ii():return int(input())
def iim():return map(int,input().split())
def iil():return list(map(int,input().split()))
def ism():return map(str,input().split())
def isl():return list(map(str,input().split()))
#from fractions import Fraction
from math import gcd
mod = int(1e9+7)
n = ii()
cnd = {}
azero = 0
bzero = 0
allzero = 0
for _ in range(n):
a,b = iim()
if a == 0:
if b != 0:
azero += 1
else:
allzero += 1
elif b == 0:
bzero += 1
else:
'''
ratio = Fraction(a,b)
before = cnd.get(ratio,False)
if before:
cnd[ratio] = [before[0]+1,before[1]]
else:
invratio = Fraction(-b,a)
check = cnd.get(invratio,False)
if check:
cnd[invratio] = [check[0],check[1]+1]
else:
cnd[ratio] = [1,0]
'''
g = gcd(a,b)
a //= g
b //= g
if a < 0:
a *= -1
b *= -1
cnd[(a,b)] = cnd.get((a,b),0)+1
noreg = 0
if azero == 0 or bzero == 0:
noreg += max(azero,bzero)
ans = 1
else:
ans = (2**azero%mod + 2**bzero%mod - 1)%mod
#print('ans block')
#print(ans,noreg)
#print(cnd)
for k,item in cnd.items():
a,b = k
if b>0:
m = cnd.get((b,-a),False)
if m:
ans *= (2**item%mod+2**m%mod-1)%mod
else:
noreg += item
else:
m = cnd.get((-b,a),False)
if not m:
noreg += item
#print('hoge')
print(int((ans*((2**noreg)%mod)-1+allzero)%mod))
| 0 | null | 21,246,902,850,212 | 147 | 146 |
# import itertools
# import math
# import sys
# sys.setrecursionlimit(500*500)
# import numpy as np
# import heapq
# from collections import deque
# N = int(input())
S = input()
T = input()
# n, *a = map(int, open(0))
# N, M = map(int, input().split())
# A = list(map(int, input().split()))
# B = list(map(int, input().split()))
# tree = [[] for _ in range(N + 1)]
# B_C = [list(map(int,input().split())) for _ in range(M)]
# S = input()
# B_C = sorted(B_C, reverse=True, key=lambda x:x[1])
# all_cases = list(itertools.permutations(P))
# a = list(itertools.combinations_with_replacement(range(1, M + 1), N))
# itertools.product((0,1), repeat=n)
# A = np.array(A)
# cum_A = np.cumsum(A)
# cum_A = np.insert(cum_A, 0, 0)
# def dfs(tree, s):
# for l in tree[s]:
# if depth[l[0]] == -1:
# depth[l[0]] = depth[s] + l[1]
# dfs(tree, l[0])
# dfs(tree, 1)
# 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
ma = 0
s = len(S)
t = len(T)
for i in range(s - t + 1):
cnt = 0
for j in range(t):
if S[i + j] == T[j]:
cnt += 1
if cnt > ma:
ma = cnt
print(t - ma)
|
a,b,c=map(int,input().split())
k=int(input())
while k>0:
if a<b:
break
b*=2
k-=1
while k>0:
if b<c:
break
c*=2
k-=1
if a<b<c:
print('Yes')
else:
print('No')
| 0 | null | 5,334,120,205,430 | 82 | 101 |
s = input()
st1=[]
st2=[]
st3=[]
total=0
for i in range(len(s)):
c=s[i]
if c=='\\':
st1.append(i)
elif c=='/':
if len(st1) > 0:
j = st1.pop()
a = i - j
total+=a
tmp=0
while len(st2)>0 and st2[-1]>j:
st2.pop()
tmp+=st3.pop()
st3.append(a+tmp)
st2.append(j)
print(total)
n = len(st3)
print(n,end='')
for i in range(n):
print(' '+str(st3[i]),end='')
print()
|
down_positions = []
ponds = []
for index, value in enumerate(raw_input()):
if value == '\\':
down_positions.append(index)
elif value == '/' and down_positions:
right = index
left = down_positions.pop()
area = right - left
candidate_area = 0
while ponds and left < ponds[-1][0]:
candidate_area += ponds.pop(-1)[1]
ponds.append((left, area + candidate_area))
print sum(x[1] for x in ponds)
print len(ponds),
for pond in ponds:
print pond[1],
| 1 | 59,361,490,368 | null | 21 | 21 |
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 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
N = i()
A = l()
L = []
L2 = [0]*(10**6)
for i in range(N):
if i+A[i]+1 < 10**6:
L.append(i+A[i]+1)
if i-A[i]+1 >= 0 and i-A[i]+1 < 10**6:
L2[i-A[i]+1] += 1
ans = 0
for l in L:
ans += L2[l]
print(ans)
|
# 雰囲気で書いたら通ってしまったがなんで通ったかわからん
# i<jという前提を無視しているのではと感じる
N = int(input())
A = list(map(int, input().split()))
# i<jとして、条件は j-i = A_i + A_j
# i + A_i = j - A_j
dict1 = {}
for i in range(1, N + 1):
tmp = i + A[i - 1]
if tmp not in dict1:
dict1[tmp] = 1
else:
dict1[tmp] += 1
dict2 = {}
for i in range(1, N + 1):
tmp = i - A[i - 1]
if tmp not in dict2:
dict2[tmp] = 1
else:
dict2[tmp] += 1
# print(dict1, dict2)
ans = 0
for k, v in dict1.items():
if k in dict2:
ans += v * dict2[k]
print(ans)
| 1 | 25,904,446,681,490 | null | 157 | 157 |
import sys
def calc_cell(x, y):
return '.' if (x + y) % 2 else '#'
def print_chessboard(height, width):
for y in range(height):
l = []
for x in range(width):
l.append(calc_cell(x, y))
print ''.join(l)
if __name__ == '__main__':
while True:
h, w = map(int, sys.stdin.readline().split())
print_chessboard(h, w)
if not h or not w:
break
print
|
import sys
from collections import deque
def main():
N, p, q, *AB = map(int, sys.stdin.buffer.read().split())
p -= 1
q -= 1
G = [[] for _ in range(N)]
for a, b in zip(*[iter(AB)] * 2):
G[a - 1].append(b - 1)
G[b - 1].append(a - 1)
if len(G[p]) == 1 and G[p][0] == q:
print(0)
return
dist1 = [-1] * N
dist1[p] = 0
queue = deque([p])
while queue:
v = queue.popleft()
for nv in G[v]:
if dist1[nv] == -1:
dist1[nv] = dist1[v] + 1
queue.append(nv)
dist2 = [-1] * N
dist2[q] = 0
queue = deque([q])
while queue:
v = queue.popleft()
for nv in G[v]:
if dist2[nv] == -1:
dist2[nv] = dist2[v] + 1
queue.append(nv)
max_d = 0
for d1, d2 in zip(dist1, dist2):
if d1 < d2 and max_d < d2:
max_d = d2
print(max_d - 1)
return
if __name__ == '__main__':
main()
| 0 | null | 58,975,211,504,660 | 51 | 259 |
from collections import deque
n,m=map(int,input().split())
s=deque(input())
a=0
for i in range(n+1):
if s[i]=="1":
a=a+1
if a==m:
print(-1)
break
else:
a=0
if a==0:
b=deque([])
d=n
while d>0:
if d<=m:
b.appendleft(d)
d=0
else:
i=m
while i>0:
if s[d-i]=="1":
i=i-1
else:
b.appendleft(i)
d=d-i
for j in range(i):
s.pop()
break
for i in range(len(b)):
print(b[i],end=" ")
|
N = int(input())
A = list(map(int, input().split()))
B = sorted(A, reverse=True)
C = [0] * N
i = 0
while(1):
if i >= N:
break
for j in range(N):
if A[j] == B[i]:
C[i] = j
if i != N-1 and B[i] == B[i+1]:
i += 1
i += 1
dp = [[0] * (N+1) for i in range(N+1)]
for i in range(N+1):
for j in range(i+1):
if j > 0 and i-j > 0:
dp[j][i-j] = max([dp[j-1][i-j] + B[i-1] * abs(C[i-1] - (j-1)), dp[j][i-j-1] + B[i-1] * abs(C[i-1] - (N-1-(i-j-1)))])
elif j == 0 and i-j > 0:
dp[j][i-j] = dp[j][i-j-1] + B[i-1] * abs(C[i-1] - (N-1-(i-j-1)))
elif i-j == 0 and j > 0:
dp[j][i-j] = dp[j-1][i-j] + B[i-1] * abs(C[i-1] - (j-1))
ans = 0
for i in range(N+1):
ans = max([ans, dp[i][N-i]])
print(ans)
| 0 | null | 86,101,465,534,242 | 274 | 171 |
#coding: UTF-8
N = int(input())
a = [int(input()) for i in range(N)]
ans = set()
maxv = -9999999999
minv = a[0]
for i in range(1,N):
if (a[i] - minv) > maxv:
maxv = a[i] - minv
if a[i] < minv:
minv = a[i]
print(maxv)
|
n = input()
minSeq = input()
maxv = -float("inf")
while True:
try:
R = input()
if R - minSeq > maxv:
maxv = R - minSeq
if R < minSeq:
minSeq = R
except EOFError:
break
print(maxv)
| 1 | 12,922,151,650 | null | 13 | 13 |
n = int(input())
ans = ""
for i in range(1,99):
if n <= 26**i :
n -= 1
for j in range(i):
ans += chr(ord("a") + n%26)
n //= 26
break
else :
n -= 26**i
print(ans[::-1])
|
import string
n = int(input())
alphabet = list(string.ascii_lowercase)
ans = ''
while n > 0:
ans = alphabet[(n-1) % 26] + ans
n = (n-1) // 26
print(ans)
| 1 | 11,867,357,276,336 | null | 121 | 121 |
# coding: utf-8
# Your code here!
S = input()
T = input()
ans = 10000000
for i in range(len(T), len(S)+1):
sub_S = S[i-len(T):i]
count = 0
for j in range(len(sub_S)):
if T[j] != sub_S[j]:
count += 1
ans = min(ans, count)
print(ans)
|
S = input()
T = input()
lens = len(S)
lent = len(T)
ans = []
for i in range(lens - lent + 1):
ss = S[i:i+lent]
count = 0
for j in range(len(ss)):
if(ss[j] != T[j]):
count += 1
ans.append(count)
print(min(ans))
| 1 | 3,688,894,892,530 | null | 82 | 82 |
# C - Slimes
def main():
n = int(input())
s = input()
p = ''
ans = ''
for v in s:
if v != p:
ans += v
p = v
else:
continue
print(len(ans))
if __name__ == "__main__":
main()
|
N = int(input())
S = input()
res = ""
pre = ""
for s in S:
if pre != s:
res += s
pre = s
print(len(res))
| 1 | 170,403,192,631,388 | null | 293 | 293 |
def bigcmb(N, R, MOD):
if (R < 0) or (N < R):
return 0
R = min(R, N - R)
fact, inv = 1, 1
for i in range(1, R + 1):
fact = (fact * (N - i + 1)) % MOD
inv = (inv * i) % MOD
return fact * pow(inv, MOD - 2, MOD) % MOD
X, Y = map(int, input().split())
if (X + Y) % 3 != 0:
print(0)
exit()
mod = 10**9 + 7
count = (X + Y) // 3
ans = bigcmb(count, X - count, mod)
print(ans)
|
s = str(input())
array = list(s)
if array.count("R")==3:print(3)
elif s[1]==("R") and array.count("R")==2:print(2)
elif array.count("R")==0:print(0)
else:print(1)
| 0 | null | 77,769,916,303,364 | 281 | 90 |
str = input()
if str=="ABC":
print("ARC")
else:
print("ABC")
|
print('ABC' if 'R' in input() else 'ARC')
| 1 | 24,207,280,555,360 | null | 153 | 153 |
if __name__ == "__main__":
n = int(raw_input())
print n * n * n
|
class ModComb:
def __init__(self, MAX, mod=10 ** 9 + 7):
fac = [1, 1]
finv = [1, 1]
inv = [0, 1]
for i in range(2, MAX):
fac.append(fac[i - 1] * i % mod)
inv.append(mod - inv[mod % i] * (mod // i) % mod)
finv.append(finv[i - 1] * inv[i] % mod)
self.fac, self.finv, self.mod = fac, finv, mod
def nCk(self, n, k):
if n < k or n < 0 or k < 0:
return 0
fac, finv, mod = self.fac, self.finv, self.mod
return fac[n] * (finv[k] * finv[n - k] % mod) % mod
mod = 998244353
N, M, K = map(int, input().split())
mc = ModComb(N, mod)
ans = 0
for k in range(K + 1):
ans += M * pow(M - 1, N - 1 - k, mod) * mc.nCk(N - 1, k)
ans %= mod
print(ans)
| 0 | null | 11,626,165,937,892 | 35 | 151 |
C = input()
letters = 'abcdefghijklmnopqrstuxyz'
print(letters[(letters.index(C)+1)])
|
t1,t2=map(int,input().split())
a1,a2=map(int,input().split())
b1,b2=map(int,input().split())
if (a1*t1-b1*t1)*(a1*t1+a2*t2-b1*t1-b2*t2)>0:print(0)
elif (a1*t1-b1*t1)*(a1*t1+a2*t2-b1*t1-b2*t2)==0:print('infinity')
else:print(-(a1*t1-b1*t1)//(a1*t1+a2*t2-b1*t1-b2*t2)*2+((a1*t1-b1*t1)%(a1*t1+a2*t2-b1*t1-b2*t2)!=0))
| 0 | null | 111,941,077,199,832 | 239 | 269 |
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())
|
n=int(input())
a=[0]+list(map(int,input().split()))
b=[0 for i in range(n+1)]
for i in range(n):
b[a[i]]+=1
[print(i) for i in b[1:]]
| 0 | null | 84,854,555,006,492 | 273 | 169 |
import math
#import numpy as np
import queue
from collections import deque,defaultdict
import heapq as hpq
from sys import stdin,setrecursionlimit
#from scipy.sparse.csgraph import dijkstra
#from scipy.sparse import csr_matrix
ipt = stdin.readline
setrecursionlimit(10**7)
def main():
n,u,v = map(int,ipt().split())
way = [[] for _ in range(n+1)]
for _ in range(n-1):
a,b = map(int,ipt().split())
way[a].append(b)
way[b].append(a)
ta = [-1]*(n+1)
tt = [-1]*(n+1)
ta[v] = 0 #AOKI
tt[u] = 0
qa = queue.Queue()
qt = queue.Queue()
qt.put((0,u,-1))
qa.put((0,v,-1))
while not qa.empty():
ti,pi,pp = qa.get()
for i in way[pi]:
if i == pp:
continue
if ta[i] == -1:
ta[i] = ti+1
qa.put((ti+1,i,pi))
while not qt.empty():
ti,pi,pp = qt.get()
if ta[pi] <= ti:
continue
for i in way[pi]:
if i == pp:
continue
if ta[i] > ti:
tt[i] = ti+1
qt.put((ti+1,i,pi))
ma = 0
for i in range(1,n+1):
if tt[i] == -1:
continue
if ma < tt[i]+max(0,ta[i]-tt[i]-1):
ma = tt[i]+max(0,ta[i]-tt[i]-1)
print(ma)
return
if __name__ == '__main__':
main()
|
N, u, v = map(int, input().split())
AB = [list(map(int, input().split())) for _ in range(N - 1)]
graph = [[] for _ in range(N)]
for i, (Ai, Bi) in enumerate(AB):
graph[Ai - 1].append(Bi - 1)
graph[Bi - 1].append(Ai - 1)
import heapq
MY_INF = 10 ** 18
q = [(0, u - 1)]
d_u = [MY_INF] * N
d_u[u - 1] = 0
while len(q) > 0:
dist, src = heapq.heappop(q)
for dst in graph[src]:
dist_tmp = dist + 1
if d_u[dst] > dist_tmp:
d_u[dst] = dist_tmp
heapq.heappush(q, (dist_tmp, dst))
q = [(0, v - 1)]
d_v = [MY_INF] * N
d_v[v - 1] = 0
while len(q) > 0:
dist, src = heapq.heappop(q)
for dst in graph[src]:
dist_tmp = dist + 1
if d_v[dst] > dist_tmp:
d_v[dst] = dist_tmp
heapq.heappush(q, (dist_tmp, dst))
# print("#", d_u)
# print("#", d_v)
ans = 0
for i in range(N):
if d_u[i] < d_v[i] and ans < d_v[i] - 1:
ans = d_v[i] - 1
print(ans)
| 1 | 116,840,238,459,072 | null | 259 | 259 |
import copy
import sys
# 再帰上限を引き上げる
sys.setrecursionlimit(10**6)
def dfs(graph, v, d):
seen[v] = True # 訪問済みかどうか
dist[v] = d # 距離を記録
# 頂点vから行ける頂点を全探索
for i in graph[v]:
if seen[i]:
continue
dfs(graph, i, d+1)
# ここから本文
N, u, v = map(int, input().split())
u -= 1
v -= 1
# グラフ構造を作る
graph = [[] for i in range(N)]
for i in range(N - 1):
A, B = map(int, input().split())
A -= 1
B -= 1
graph[A].append(B)
graph[B].append(A)
# 青木くんからの各頂点の距離
seen = [False for i in range(N)]
dist = [0 for i in range(N)]
dfs(graph, v, 0)
aoki_dist = copy.deepcopy(dist)
# 高橋くんからの各頂点の距離
seen = [False for i in range(N)]
dist = [0 for i in range(N)]
dfs(graph, u, 0)
takahashi_dist = copy.deepcopy(dist)
ans = 0
for i in range(N):
if aoki_dist[i] > takahashi_dist[i]:
if aoki_dist[i] - 1 > ans:
ans = aoki_dist[i] - 1
print(ans)
|
import sys
input = sys.stdin.readline
# 再帰上限を引き上げる
sys.setrecursionlimit(10**6)
n, u, v = map(int, input().split())
u, v = u-1, v-1
l = [[] for i in range(n)]
for i in range(n-1):
a, b = map(int, input().split())
a, b = a-1, b-1
l[a].append(b)
l[b].append(a)
def dfs(G, cr, seen, dist):
seen[cr] = 1
for i in G[cr]:
if seen[i] == 0:
dist[i] = dist[cr] + 1
dfs(G, i, seen, dist)
return dist
seen_u = [0]*n
seen_v = [0]*n
dist_u = [0]*n
dist_v = [0]*n
T1 = dfs(l, u, seen_u, dist_u)
T2 = dfs(l, v, seen_v, dist_v)
for i in range(n):
if dist_u[i] >= dist_v[i]:
dist_v[i] = -1
print(max(dist_v)-1)
| 1 | 117,465,475,391,964 | null | 259 | 259 |
N = int(input())
array = [0]*N
for i in range(N):
if (i+1) % 3 == 0 or (i+1) % 5 == 0:
continue
else:
array[i] = i+1
print( sum(array) )
|
beforex_plus_y=[]
beforex_minus_y=[]
for i in range(int(input())):
xy=list(map(int,input().split()))
beforex_plus_y.append(xy[0]+xy[1])
beforex_minus_y.append(xy[0]-xy[1])
print(max(max(beforex_plus_y)-min(beforex_plus_y),max(beforex_minus_y)-min(beforex_minus_y)))
| 0 | null | 19,043,561,071,260 | 173 | 80 |
t=int(input())
if t==0:
print("1")
elif t==1:
print("0")
|
def ri():
return int(input())
def rii():
return [int(v) for v in input().split()]
def solve(x):
return 0 if x else 1
if __name__ == "__main__":
print(solve(ri()))
| 1 | 2,917,445,689,378 | null | 76 | 76 |
import sys
read = sys.stdin.read
readlines = sys.stdin.readlines
def main():
n, m = map(int, input().split())
h = tuple(map(int, input().split()))
edges = {e:[] for e in range(n)}
for _ in range(m):
a, b = map(int, input().split())
a -= 1
b -= 1
edges[a].append(h[b])
edges[b].append(h[a])
r = 0
for i, he in enumerate(h):
if not edges[i]:
r += 1
else:
r += he > max(edges[i])
print(r)
if __name__ == '__main__':
main()
|
### ----------------
### ここから
### ----------------
import sys
from io import StringIO
import unittest
def yn(b):
print("Yes" if b==1 else "No")
return
def resolve():
readline=sys.stdin.readline
n,x,y=map(int, readline().rstrip().split())
ans = [0] * (n-1)
for i in range(1,n+1):
for j in range(i+1,n+1):
d1 = abs(i-x) + abs(j-x)
d2 = abs(i-y) + abs(j-y)
d3 = abs(i-x) + abs(j-y) + 1
d4 = abs(i-y) + abs(j-x) + 1
d5 = abs(i-j)
d=min(d1,d2,d3,d4,d5)
ans[d-1]+=1
for a in ans:
print(a)
#arr=list(map(int, readline().rstrip().split()))
#n=int(readline())
#ss=readline().rstrip()
#yn(1)
return
if 'doTest' not in globals():
resolve()
sys.exit()
### ----------------
### ここまで
### ----------------
| 0 | null | 34,535,015,277,660 | 155 | 187 |
def main():
k, n = map(int, input().split())
a_lst = list(map(int, input().split()))
d_lst = [0 for _ in range(n)]
for i in range(n - 1):
d_lst[i] = a_lst[i + 1] - a_lst[i]
d_lst.append(a_lst[0] + k - a_lst[n - 1])
ans = k - max(d_lst)
print(ans)
if __name__ == "__main__":
main()
|
import sys
K, N = map(int,input().split())
A = list(map(int,input().split()))
L = [0]*(2*N)
MIN = 1e18
for i in range(0,N):
L[i] = A[i]
for i in range(N,2*N):
L[i] = A[i-N]+K
for i in range(N-1,2*N):
MIN = min(MIN,L[i]-L[i-(N-1)])
print(MIN)
| 1 | 43,500,819,407,552 | null | 186 | 186 |
import collections
class UnionFind:
def __init__(self, N):
self.parent = [i for i in range(N)]
self.rank = [0]*N
self.count = 0
def root(self, a):
if self.parent[a]==a:
return a
else:
self.parent[a]=self.root(self.parent[a])
return self.parent[a]
def size(x):
return -par[root(x)]
def is_same(self, a, b):
return self.root(a)==self.root(b)
def unite(self, a, b):
ra = self.root(a)
rb = self.root(b)
if ra == rb: return
if self.rank[ra] < self.rank[rb]:
self.parent[ra] = rb
else:
self.parent[rb] = ra
if self.rank[ra] == self.rank[rb]: self.rank[ra] += 1
self.count += 1
def main():
n,m,k=map(int, input().split())
friend = [0]*n
fr = UnionFind(n)
blocklist = [0]*n
for i in range(m):
a,b = map(int, input().split())
fr.unite(a-1,b-1)
friend[a-1]+=1
friend[b-1]+=1
for i in range(k):
c,d=map(int, input().split())
if(fr.root(c-1)==fr.root(d-1)):
blocklist[c-1]+=1
blocklist[d-1]+=1
res = []
dd = collections.defaultdict(int)
for i in range(n):
dd[fr.root(i)]+=1
for i in range(n):
res.append(dd[fr.root(i)]- blocklist[i] - friend[i]-1)
print(*res)
if __name__ == '__main__':
main()
|
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())
n,m,k=map(int,input().split())
uf=UnionFind(n)
edge=[[] for _ in range(n)]
brock=[[] for _ in range(n)]
ans=[]
for _ in range(m):
a,b=map(int,input().split())
edge[a-1].append(b-1)
edge[b-1].append(a-1)
uf.union(a-1,b-1)
for _ in range(k):
c,d=map(int,input().split())
brock[c-1].append(d-1)
brock[d-1].append(c-1)
for i in range(n):
ans.append(uf.size(i)-len(edge[i])-sum([uf.same(i,j) for j in brock[i]])-1)
print(*ans)
| 1 | 61,508,053,265,250 | null | 209 | 209 |
# -*- coding: utf-8 -*-
import sys
# sys.setrecursionlimit(10**6)
# buff_readline = sys.stdin.buffer.readline
buff_readline = sys.stdin.readline
readline = sys.stdin.readline
INF = 2**62-1
def read_int():
return int(buff_readline())
def read_int_n():
return list(map(int, buff_readline().split()))
def read_float():
return float(buff_readline())
def read_float_n():
return list(map(float, buff_readline().split()))
def read_str():
return readline().strip()
def read_str_n():
return readline().strip().split()
def error_print(*args):
print(*args, file=sys.stderr)
def mt(f):
import time
def wrap(*args, **kwargs):
s = time.time()
ret = f(*args, **kwargs)
e = time.time()
error_print(e - s, 'sec')
return ret
return wrap
class Mod:
def __init__(self, m):
self.m = m
def add(self, a, b):
return (a + b) % self.m
def sub(self, a, b):
return (a - b) % self.m
def mul(self, a, b):
return ((a % self.m) * (b % self.m)) % self.m
def div(self, a, b):
return self.mul(a, pow(b, self.m-2, self.m))
def pow(self, a, b):
return pow(a, b, self.m)
class Combination:
def __init__(self, n, mod):
g1 = [1, 1]
g2 = [1, 1]
inverse = [0, 1]
for i in range(2, n + 1):
g1.append((g1[-1] * i) % mod)
inverse.append((-inverse[mod % i] * (mod//i)) % mod)
g2.append((g2[-1] * inverse[-1]) % mod)
self.MOD = mod
self.N = n
self.g1 = g1
self.g2 = g2
self.inverse = inverse
def __call__(self, n, r):
if (r < 0 or r > n):
return 0
r = min(r, n-r)
return self.g1[n] * self.g2[r] * self.g2[n-r] % self.MOD
@mt
def slv(K, S):
M = 10**9+7
C = Combination(2*(10**6), M)
MOD = Mod(M)
ans = 0
S = len(S)
N = S + K
for k in range(K+1):
r = K -k
a = MOD.pow(26, r)
b = MOD.mul(MOD.pow(25, k), C(k+S-1, k))
ans = MOD.add(ans, MOD.mul(a, b))
return ans
def main():
K = read_int()
S = read_str()
print(slv(K, S))
if __name__ == '__main__':
main()
|
MOD = 10 ** 9 + 7
def solveBrute(K, S):
# On the i-th iteration, dp[j] counts all strings of length i which contains S[:j] as a subsequence
N = len(S)
dp = [0] * (N + 1)
dp[0] = 1
for i in range(N + K):
nextDp = [0] * (N + 1)
for j in range(N):
nextDp[j] += dp[j] * 25
nextDp[j + 1] += dp[j]
nextDp[N] += dp[N] * 26
dp = nextDp
for j in range(N + 1):
dp[j] %= MOD
# print(dp)
return dp[N]
def solveBrute2(K, S):
import numpy as np
def matrixPower(mat, k):
assert k >= 0
if k == 0:
return np.eye(mat.shape[0], dtype=np.int64)
if k == 1:
return mat
temp = matrixPower(mat, k // 2)
ret = (temp @ temp) % MOD
if k % 2:
return (ret @ mat) % MOD
return ret
# For intution, can interpret the bruteforce as a matrix multiplication:
# {{0, 0, 0, 1}} . MatrixPower[{{25, 0, 0, 0}, {1, 25, 0, 0}, {0, 1, 25, 0}, {0, 0, 1, 26}}, 8] . {{1}, {0}, {0}, {0}}
# https://www.wolframalpha.com/input/?i=%7B%7B0%2C+0%2C+0%2C+1%7D%7D+.+MatrixPower%5B%7B%7B25%2C+0%2C+0%2C+0%7D%2C+%7B1%2C+25%2C+0%2C+0%7D%2C+%7B0%2C+1%2C+25%2C+0%7D%2C+%7B0%2C+0%2C+1%2C+26%7D%7D%2C+8%5D+.+%7B%7B1%7D%2C+%7B0%7D%2C+%7B0%7D%2C+%7B0%7D%7D
N = len(S)
mat = 25 * np.eye(N + 1, dtype=np.int64,)
mat[N][N] += 1
for i in range(N):
mat[i + 1][i] = 1
vec = np.zeros((N + 1, 1), dtype=np.int64)
vec[0] = 1
res = matrixPower(mat, N + K) @ vec
return int(res[N]) % MOD
def solve(K, S):
def modInverse(a, p):
# Fermat's little theorem, a**(p-1) = 1 mod p
return pow(a, p - 2, p)
# Precompute all factorials
fact = [1]
for i in range(1, 2 * (10 ** 6) + 1):
fact.append((fact[-1] * i) % MOD)
def nCr(n, r, p=MOD):
# Modulo binomial coefficients
return (fact[n] * modInverse(fact[r], p) * modInverse(fact[n - r], p)) % p
total = 0
N = len(S)
for i in range(N, N + K + 1):
total += nCr(N + K, i) * pow(25, N + K - i, MOD)
total %= MOD
return total
(K,) = [int(x) for x in input().split()]
S = input()
ans = solve(K, S)
# assert ans == solveBrute(K, S) == solveBrute2(K, S)
print(ans)
| 1 | 12,804,459,693,888 | null | 124 | 124 |
a, b = map(int, input().split())
print(-1 if a not in range(1, 10) or b not in range(1, 10) else a*b)
|
a, b = map(int, input().split())
if a >= 10 or b >= 10:
print(-1)
else:
print(a*b)
| 1 | 157,785,825,544,732 | null | 286 | 286 |
r = float(input())
print("{0:.6f} {1:.6f}".format(r**2 * 3.141592653589, 2 * r * 3.141592653589))
|
import math
r = float(input())
print("%f %f"%(math.pi*math.pow(r,2),2*math.pi*r))
| 1 | 638,216,673,214 | null | 46 | 46 |
n = int(input())
a = [0] + list(map(int,input().split()))
l = [0]*n
for i in a:
l[i-1] += i
for j in range(n):
l[j] = int(l[j]/(j+1))
for k in l:
print(k,end="\n")
|
from collections import defaultdict
S = input()
n = len(S)
mod = 2019
d = defaultdict(int)
d[0] = 1
num = 0
for i in reversed(range(n)):
num += int(S[i]) * pow(10, n - i - 1, mod)
num %= mod
d[num] += 1
ans = 0
for v in d.values():
ans += v * (v - 1) // 2
print(ans)
| 0 | null | 31,509,476,550,642 | 169 | 166 |
H = int(input())
def attack(h):
if h == 1:
return 0
r = 2
h //= 2
ans = 2
while h > 1:
h //= 2
r *= 2
ans += r
return ans
print(1 + attack(H))
|
h = int(input())
cnt = 1
if h == 1:
print(1)
exit()
while(True):
cnt += 1
h = int(h / 2)
if h == 1:
break
print(2 ** cnt - 1)
| 1 | 79,852,753,911,100 | null | 228 | 228 |
n = int(input())
a = list(map(int,input().split()))
count = 0
for i in range(n):
if ((i + 1 )%2 )==1 and ((a[i]%2) == 1):
count += 1
print(count)
|
def Yes():
print('Yes')
exit()
def No():
print('No')
exit()
def parse(s):
ret = [0, 0]
for c in s:
if c == ')':
if ret[0]:
ret[0] -= 1
else:
ret[1] -= 1
else:
ret[0] += 1
return ret
N = int(input())
S = [parse(input()) for _ in range(N)]
S.sort(key=lambda a: -a[0] - a[1])
S1 = []
S2 = []
for s in S:
if s[0] + s[1] >= 0:
S1 += [s]
else:
S2 += [s]
S1.sort(key=lambda a: -a[1])
S2.sort(key=lambda a: -a[0])
cnt = 0
for s in S1:
cnt += s[1]
if cnt < 0:
No()
cnt += s[0]
for s in S2:
cnt += s[1]
if cnt < 0:
No()
cnt += s[0]
if cnt:
No()
Yes()
| 0 | null | 15,669,964,419,520 | 105 | 152 |
seed = [i for i in range(1,14)]
deck = {}
for s in ['S','H','C','D']:
deck[s] = seed[:]
n = int(input())
for i in range(n):
s,v = input().split()
deck[s][int(v)-1] = 0
for s in ['S','H','C','D']:
for i in deck[s]:
if i != 0:
print(s,i)
|
import math
a, b, deg = map(float, raw_input().split(" "))
c = math.sqrt(a**2 + b**2 - 2*a*b*math.cos(math.radians(deg)))
L = a + b + c
s = (a + b + c) / 2.0
S = math.sqrt(s*(s-a)*(s-b)*(s-c))
h = 2 * S / a
print(str(S) + " " + str(L) + " " + str(h))
| 0 | null | 602,498,050,400 | 54 | 30 |
N = int(input())
ary = [int(_) for _ in input().split()]
def selection_sort(ary, verbose=True):
count = 0
for i in range(0, N):
minj = i
for j in range(i, N):
if ary[j] < ary[minj]:
minj = j
if i != minj:
ary[i], ary[minj] = ary[minj], ary[i]
count += 1
print(' '.join([str(_) for _ in ary]))
if verbose:
print(count)
selection_sort(ary)
|
import bisect,collections,copy,itertools,math,string
import sys
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())
def main():
n = I()
dic = collections.defaultdict(int)
while n != 1:
prime = 0
limit = int(n**(1/2))
for i in range(2,limit+1):
if n%i == 0:
prime = i
break
else:
prime = n
while n%prime == 0:
n //= prime
dic[prime] += 1
ans = 0
for key,value in dic.items():
cnt = 0
while value>=cnt+1:
cnt += 1
value -= cnt
ans += cnt
# print(dic)
print(ans)
main()
| 0 | null | 8,430,928,077,562 | 15 | 136 |
n = int(input())
s = [ i for i in input().split()]
flag = True
cnt = 0
while flag:
flag = False
for i in range(n-1):
if int(s[i]) > int(s[i+1]):
s[i],s[i+1] = s[i+1],s[i]
flag = True
cnt += 1
print(' '.join(s))
print(cnt)
|
import math
n = int(input())
a = pow(10, n, 10**9+7)
b = pow(9, n, 10**9+7)
c = pow(9, n, 10**9+7)
d = pow(8, n, 10**9+7)
print((a-b-c+d) % (10**9+7))
| 0 | null | 1,578,760,415,968 | 14 | 78 |
from itertools import accumulate
N, K = list(map(int, input().split()))
P = list(map(lambda x: int(x) + 1, input().split()))
P_cumsum = [0] + list(accumulate(P))
print(max([P_cumsum[i+K]-P_cumsum[i] for i in range(N-K+1)])/2)
|
n,m = list(map(int,input().split()))
A = [[0 for w in range(m)] for h in range(n)]
B = [0 for h in range(m)]
for i in range(n) :
A[i] = list(map(int, input().split()))
for i in range(m) :
B[i] = int(input())
for i in range(n):
c = 0
for j in range(m):
c += A[i][j] * B[j]
print(c)
| 0 | null | 37,804,277,300,320 | 223 | 56 |
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()
|
a, b, c = map(int, raw_input().split())
count = 0
for i in range(a, b + 1):
if c % i == 0:
count = count + 1
print '%s' % str(count)
| 0 | null | 16,455,296,343,772 | 169 | 44 |
from sys import stdin
s = int(stdin.readline().rstrip())
h = s//3600
m = (s%3600)//60
sec = (s%3600)%60
print("{}:{}:{}".format(h, m, sec))
|
from collections import Counter
N = int(input())
A = list(map(int, input().split()))
L = [-1 for _ in range(N)]
R = [-1 for _ in range(N)]
for i in range(N):
L[i] = A[i] - i-1
R[i] = A[i] + i+1
# L = -R となる物のうち、i>jになりゃいいんだけど、最後にいくつかで破れば良い気がす
# i > 0 なので、自分自身を２回選んでL＝Rみたいにはならない・・・？
LC = Counter(L)
RC = Counter(R)
ans = 0
for k,v in LC.items():
if (-1) * k in RC:
ans += v * RC[(-1)*k]
#print(k,v,(-1)*k,RC[(-1)*k], ans)
print(ans)
| 0 | null | 13,278,821,796,460 | 37 | 157 |
N = int(input())
a = []
for i in range(N):
a.append(int(input()))
mins = [a[0]]
for i in range(1, N):
mins.append(min(a[i], mins[i-1]))
mx = -10**12
for j in range(1, N):
mx = max(mx, a[j] - mins[j-1])
print(mx)
|
#coding: utf-8
#ALDS1_1D
import sys
n=int(raw_input())
minv=float("inf")
maxv=float("-inf")
for i in xrange(1,n+1):
r=int(raw_input())
maxv=max(maxv,r-minv)
minv=min(minv,r)
print maxv
| 1 | 13,475,180,238 | null | 13 | 13 |
x, k, d = map(int, input().split())
if x < 0:
target = abs(x) // d
x = x + d * min(target, k)
k -= min(target, k)
else:
target = x // d
x = x - d * min(target, k)
k -= min(target, k)
if k % 2 != 0:
if x < 0:
x += d
else:
x -= d
print(abs(x))
|
import sys
read = sys.stdin.read
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 8)
INF = float('inf')
MOD = 10 ** 9 + 7
def main():
N, M = map(int, readline().split())
C = list(map(int, readline().split()))
# dp[i] := i円払うのに必要な枚数
dp = [INF] * (N+1)
dp[0] = 0
for c in C:
if c<=N:
for i in range(N-c+1):
dp[i+c] = min(dp[i]+1, dp[i+c])
print(dp[N])
if __name__ == '__main__':
main()
| 0 | null | 2,701,518,374,460 | 92 | 28 |
n = int(input())
l = list(map(int,input().split()))
mod = 10**9+7
ones = [0]*60
ans = 0
for i in range(n):
x = l[i]
for j in range(60):
ones[j] += (x>>j)&1
ans = (ans + (n-1)*x)%mod
# print(ans)
for i in range(60):
ans = (ans - ones[i]*(ones[i]-1)*2**i)%mod
print(ans)
|
n = int(input())
a = list(map(int, input().split()))
mod = 10**9 + 7
ans = 0
for keta in range(61):
now = 0
for x in a:
if x & (1 << keta):
now += 1
ans += (now*(n-now))*2**keta
ans %= mod
print(ans)
| 1 | 122,451,802,047,778 | null | 263 | 263 |
X, Y = map(int, input().split())
ans = ''
for i in range(X+1):
if (i*2 + (X-i)*4) == Y:
ans = 'Yes'
break
else:
ans = 'No'
print(ans)
|
N = int(input())
ans = [0] * N
for i in range(1, 101):
for j in range(1, 101):
for k in range(1, 101):
tmp = i**2+j**2+k**2+i*j+j*k+k*i
if tmp <= N:
ans[tmp-1] += 1
print(*ans, sep='\n')
| 0 | null | 10,948,416,748,382 | 127 | 106 |
n = int(input())
data = list(map(int, input().split()))
for i in range(n):
v = data[i]
j = i - 1
while j >= 0 and data[j] > v:
data[j+1] = data[j]
j -= 1
data[j+1] = v
print(" ".join(map(str, data)))
|
n = int(input())
MOD = 1000000007
def mod(n):
return n % MOD
def modpow(a, n): #mod(a**n)を高速で求める
res = 1
digit = len(str(bin(n))) - 2
for i in range(digit):
if (n >> i) & 1:
res *= mod(a)
res = mod(res)
a = mod(a**2)
return mod(res)
ans = modpow(10, n)
ans -= 2*modpow(9, n)
ans += modpow(8, n)
print(mod(ans))
| 0 | null | 1,562,958,133,672 | 10 | 78 |
def factorization(n):
arr = []
temp = n
if n<2:
return []
for i in range(2, int(n**0.5)+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)
if arr==[]:
arr.append(n)
return arr
N = int(input())
arry = factorization(N)
ans = 0
for a in sorted(arry):
if N%a==0:
N //= a
ans += 1
if N<=1:
break
print(ans)
|
n = int(input())
for i in range(1,10):
if (n%i==0) and ((n//i) in range(1,10)):
print("Yes")
break
else:
print("No")
| 0 | null | 88,537,021,544,672 | 136 | 287 |
def main():
N = int(input())
L = sorted(list(map(int, input().split())))
ans = 0
for ia in range(N-2):
a = L[ia]
ic = ia + 2
for ib in range(ia+1, N-1):
b = L[ib]
while ic < N and L[ic] < a+b:
ic += 1
ans += ic - (ib + 1)
print(ans)
main()
|
n=int(input())
if n>=400 and n<=599:
print("8")
elif n>=600 and n<=799:
print("7")
elif n>=800 and n<=999:
print("6")
elif n>=1000 and n<=1199:
print("5")
elif n>=1200 and n<=1399:
print("4")
elif n>=1400 and n<=1599:
print("3")
elif n>=1600 and n<=1799:
print("2")
elif n>=1800 and n<=1999:
print("1")
| 0 | null | 89,106,119,241,678 | 294 | 100 |
N = int(input())
A = list(map(int, input().split()))
A_all = A[0]
for i in range(1,N):
A_all ^= A[i]
B = [0] * N
for j in range(N):
B[j] = A[j] ^ A_all
print(' '.join(map(str, B)))
|
x = int(input())
ans = x*x*x
print(ans)
| 0 | null | 6,461,501,180,628 | 123 | 35 |
n, x, y = map(int, input().split())
x -= 1
y -= 1
def shortest_path(i, j):
res = min(abs(i-x)+abs(j-y)+1, j-i)
return res
ans = [0]*(n-1)
for i in range(n-1):
for j in range(i+1, n):
d = shortest_path(i, j)
ans[d-1] += 1
print(*ans, sep='\n')
|
#!/usr/bin/env python3
import sys
from itertools import chain
# from itertools import combinations as comb
# form bisect import bisect_left, bisect_right, insort_left, insort_right
# from collections import Counter
# import numpy as np
YES = "Yes" # type: str
def solve(N: int, M: int, A: "List[int]", B: "List[int]"):
routes = [set() for _ in range(N)]
marks = [None for _ in range(N)]
for a, b in zip(A, B):
a = a - 1
b = b - 1
routes[a].add(b)
routes[b].add(a)
marks[0] = -1
cur_rooms = [0]
count = 1
while count < N:
new_cur_rooms = []
for cur_room in cur_rooms:
next_rooms = list(routes[cur_room])
for next_room in next_rooms:
if marks[next_room] is None:
marks[next_room] = cur_room
new_cur_rooms.append(next_room)
count += 1
cur_rooms = new_cur_rooms
answer = "Yes\n" + "\n".join((str(n + 1) for n in marks[1:]))
return answer
def main():
tokens = chain(*(line.split() for line in sys.stdin))
# N, M, A, B = map(int, line.split())
N = int(next(tokens)) # type: int
M = int(next(tokens)) # type: int
A = [int()] * (M) # type: "List[int]"
B = [int()] * (M) # type: "List[int]"
for i in range(M):
A[i] = int(next(tokens))
B[i] = int(next(tokens))
answer = solve(N, M, A, B)
print(answer)
if __name__ == "__main__":
main()
| 0 | null | 32,378,269,203,852 | 187 | 145 |
n=int(input())
if n%2:
print(0)
else:
c=0
n//=2
while n:
n//=5
c+=n
print(c)
|
import sys
sys.setrecursionlimit(2000)
def check_2(num):
if num % 2 != 0:
return 0
return check_2(num // 2) + 1
def check_5(num):
if num % 5 != 0:
return 0
return check_5(num // 5) + 1
def f_2(num):
if num < 2:
return 0
return f_2(num - 2) + check_2(num)
def f_5(num):
if num < 5:
return 0
return f_5(num - 2) + check_5(num)
N = int(input())
if N < 10:
print(0)
exit()
if N % 2 != 0:
print(0)
exit()
i = 1
ans = 0
while N // ((5 ** i) * 2) > 0:
ans += N // ((5 ** i) * 2)
i += 1
print(ans)
| 1 | 116,290,112,196,530 | null | 258 | 258 |
a,b=input().split()
A=int(a)
bb=b.replace(".","")
B=int(bb)
C=A*B
c=C//100
print(int(c))
|
from decimal import Decimal
A,B=input().split()
A=int(A)
B=Decimal(B)
Bint=int(B)
B1=int((B-Bint)*100)
result=A*Bint+A*B1//100
print(result)
| 1 | 16,560,994,190,678 | null | 135 | 135 |
n = int(input())
a,b = input().split()
print(''.join(a[i]+b[i] for i in range(n)))
|
A,B,C,K = map(int,input().split())
if K<=A:print(K)
elif K<=A+B:print(A)
else:print(A-(K-A-B))
| 0 | null | 67,012,040,675,408 | 255 | 148 |
while True:
a ,b = map(int, input().split())
if a > b :
print('{} {}'.format(b,a))
elif a == 0 and b == 0 :
break
else:
print('{} {}'.format(a,b))
|
# ABC 165 D - Floor Function
a,b,n = map(int, input().split())
def func(i):
return int(i*a/b) - a*int(i/b)
print(func(min(b-1, n)))
| 0 | null | 14,262,130,318,520 | 43 | 161 |
import numpy as np
N = int(input())
X = np.zeros([N,4], dtype=int)
for i in range(N):
X[i,0], X[i,1] = map(int, input().split())
X[i,2], X[i,3] = X[i,0] - X[i,1], X[i,0] + X[i,1]
col_num = 3
X = X[np.argsort(X[:, col_num])]
cnt = 1
r_min = X[0,3]
for i in range(1,N):
if X[i,2] >= r_min:
cnt += 1
r_min = X[i,3]
print(cnt)
|
def solve(N, data):
ret = N
data.sort(key=lambda x: x[0] - x[1])
most_right = float("-inf")
for idx, d in enumerate(data):
l, r = d[0] - d[1], d[0] + d[1]
if not idx:
most_right = r
continue
if most_right <= l:
most_right = r
continue
ret -= 1
most_right = min(r, most_right)
return ret
if __name__ == "__main__":
N = int(input())
data = []
for _ in range(N):
data.append(list(map(int, input().split())))
print(solve(N, data))
| 1 | 89,909,453,312,050 | null | 237 | 237 |
n = input()
ans = 0
for i,j in enumerate(map(int,input().split())):
ans += (~i&1 and j&1)
print(ans)
|
input()
li = list(map(int, input().split()))
result = 0
for i in range(len(li)):
if (i + 1) % 2 == 1:
if li[i] % 2 == 1:
result += 1
print(result)
| 1 | 7,745,158,536,468 | null | 105 | 105 |
x, n = map(int,input().split())
L = list(map(int,input().split()))
l, r = x-1, x+1
if n == 0 or x not in L:
print(x)
exit()
while True:
if l not in L:
print(l)
break
elif r not in L:
print(r)
break
l -= 1
r += 1
|
N=int(input())
s=list()
t=list()
st=[]
for i in range(N):
st.append(input().split())
X=input()
ans=0
count=False
for j in range(N):
if count:
ans+=int(st[j][1])
if st[j][0]==X:
count=True
print(ans)
| 0 | null | 55,755,560,235,732 | 128 | 243 |
def main():
day = ['SUN', 'MON', 'TUE', 'WED', 'THU', 'FRI', 'SAT']
s = input()
ans = 7 - day.index(s)
print(ans)
if __name__ == '__main__':
main()
|
s = input()
days_of_the_week = ['SUN', 'MON', 'TUE', 'WED', 'THU', 'FRI', 'SAT']
n = days_of_the_week.index(s)
print(7 - days_of_the_week.index(s))
| 1 | 132,850,759,707,332 | null | 270 | 270 |
s = input()
if s[0] == '>':
a = [0]
else:
a = []
flg = 1
for i in range(1,len(s)):
if s[i] != s[i-1]:
a.append(flg)
flg = 1
else:
flg += 1
a.append(flg)
if s[-1] == '<':
a.append(0)
ans = 0
for i in range(len(a)//2):
if a[2*i] > a[2*i+1]:
a[2*i+1] -= 1
ans += a[2*i]*(a[2*i]+1)//2 + a[2*i+1]*(a[2*i+1]+1)//2
else:
a[2*i] -= 1
ans += a[2*i]*(a[2*i]+1)//2 + a[2*i+1]*(a[2*i+1]+1)//2
print(ans)
|
S = input()
n = len(S) + 1
a = [0] * n
S = ('<' if S[0] == '>' else '>') + S \
+ ('<' if S[-1] == '>' else '>') # 最初と最後にダミー追加、長さn+1
for i in range(n):
if S[i : i + 2] == '><': # 極小値
for j in range(i, 0, -1): # 左に辿る
if S[j] == '<': break
a[j - 1] = max(a[j - 1], a[j] + 1)
for j in range(i + 1, n): # 右に辿る
if S[j] == '>': break
a[j] = max(a[j], a[j - 1] + 1)
print(sum(a))
| 1 | 156,597,488,047,618 | null | 285 | 285 |
N, M, K = map(int, input().split())
table = [-1]*N
def union(x, y):
global table
x, y = find(x), find(y)
if x==y:
return False
else:
if table[x]>table[y]:
x, y = y, x
table[x] += table[y]
table[y] = x
return True
def find(x):
if table[x]<0:
return x
else:
table[x] = find(table[x])
return table[x]
def rank(x):
return table[find(x)]
friend = [[] for _ in range(N)]
block = [[] for _ in range(N)]
for _ in range(M):
a, b = map(int, input().split())
friend[a-1].append(b-1)
friend[b-1].append(a-1)
union(a-1, b-1)
for _ in range(K):
c, d = map(int, input().split())
block[c-1].append(d-1)
block[d-1].append(c-1)
ans = [""]*N
for i in range(N):
tmp = abs(rank(i)) - len(friend[i]) - 1
cnt = 0
for b in block[i]:
if find(i)==find(b):
cnt += 1
ans[i] = str(tmp - cnt)
print(" ".join(ans))
|
import sys
input = sys.stdin.readline
def main():
S = input().rstrip()
ans = S[:3]
print(ans)
if __name__ == "__main__":
main()
| 0 | null | 38,030,539,916,488 | 209 | 130 |
import math
import collections
import fractions
import itertools
import functools
import operator
import bisect
def solve():
n, m, k = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
ruia, ruib = [0], [0]
for i in range(n): ruia.append(a[i]+ruia[i])
for i in range(m): ruib.append(b[i]+ruib[i])
ans = 0
j = m
for i in range(n+1):
if ruia[i] > k:
break
while(ruib[j]>k-ruia[i]):
j -= 1
ans = max(ans, i+j)
print(ans)
return 0
if __name__ == "__main__":
solve()
|
n,m,k = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
if sum(A)+sum(B)<=k:
print(n+m)
exit()
for i in range(1,n):
A[i] += A[i-1]
for i in range(1,m):
B[i] += B[i-1]
from bisect import bisect_right
ans = bisect_right(B,k)
for i in range(n):
if A[i]>k:
break
ans = max(ans, i+1+bisect_right(B,k-A[i]))
print(ans)
| 1 | 10,679,317,496,588 | null | 117 | 117 |
from math import ceil,floor,factorial,gcd,sqrt,log2,cos,sin,tan,acos,asin,atan,degrees,radians,pi,inf,comb
from itertools import accumulate,groupby,permutations,combinations,product,combinations_with_replacement
from collections import deque,defaultdict,Counter
from bisect import bisect_left,bisect_right
from operator import itemgetter
from heapq import heapify,heappop,heappush
from queue import Queue,LifoQueue,PriorityQueue
from copy import deepcopy
from time import time
import string
import sys
sys.setrecursionlimit(10 ** 7)
def input() : return sys.stdin.readline().strip()
def INT() : return int(input())
def MAP() : return map(int,input().split())
def LIST() : return list(MAP())
n = INT()
x = [[0]*2 for i in range(n)]
for i in range(n):
x[i][0], x[i][1] = MAP()
x.sort()
tmp = -inf
ans = n
for i in range(n):
if tmp > x[i][0] - x[i][1]:
ans -= 1
tmp = min(tmp, x[i][0] + x[i][1])
else:
tmp = x[i][0] + x[i][1]
print(ans)
|
import math , sys
N = int( input() )
X = []
for i in range(N):
A , B = list(map(int, input().split()))
X.append([i , A-B , A , A+B])
X.sort(key=lambda x: x[3])
Y = X[0]
Ri = Y[-1]
ans = 1
j=0
for i in range(1,N):
Y = X[i]
if Y[1] >= Ri:
ans+=1
Ri = Y[-1]
print(ans)
| 1 | 90,057,591,047,512 | null | 237 | 237 |
import decimal
a,b = map(decimal.Decimal,input().split())
ans = a*b//1
print(ans)
|
#!/usr/bin/env python3
import decimal
#import
#import math
#import numpy as np
#= int(input())
#= input()
A, B = map(decimal.Decimal, input().split())
print(int(A * B))
| 1 | 16,454,257,440,500 | null | 135 | 135 |
class Dice1():
def move(self,direction,n):
if direction == "S":
top = n[0]
n[0] = n[4]
n[4] = n[5]
n[5] = n[1]
n[1] = top
elif direction == "N":
top = n[0]
n[0] = n[1]
n[1] = n[5]
n[5] = n[4]
n[4] = top
elif direction == "E":
top = n[0]
n[0] = n[3]
n[3] = n[5]
n[5] = n[2]
n[2] = top
elif direction == "W":
top = n[0]
n[0] = n[2]
n[2] = n[5]
n[5] = n[3]
n[3] = top
return n
n = [int(i) for i in input().split()]
di = list(input())
dc = Dice1()
for i in di:
n = dc.move(i,n)
print(n[0])
|
a, b, c, d, e, f = map(int, input().split())
S = list(input())
i = 0
number1 = a
number2 = b
number3 = c
number4 = d
number5 = e
number6 = f
while i < len(S) :
if S[i] == "N" :
number1 = b
number2 = f
number3 = c
number4 = d
number5 = a
number6 = e
elif S[i] == "S" :
number1 = e
number2 = a
number3 = c
number4 = d
number5 = f
number6 = b
elif S[i] == "E" :
number1 = d
number2 = b
number3 = a
number4 = f
number5 = e
number6 = c
elif S[i] == "W" :
number1 = c
number2 = b
number3 = f
number4 = a
number5 = e
number6 = d
a = number1
b = number2
c = number3
d = number4
e = number5
f = number6
i = i + 1
print(number1)
| 1 | 237,561,966,318 | null | 33 | 33 |
def main():
W,H,x,y,r=map(int,input().split())
if x<=0 or y<=0:
print('No')
elif W>=2*r and H>=2*r and W>=x+r and H>=y+r:
print('Yes')
else:
print('No')
if __name__=='__main__':
main()
|
W, H, x, y, r = map(int, input().split(' '))
# 高さ
if (r <= y <= (H - r)) and (r <= x <= (W - r)):
print('Yes')
else:
print('No')
| 1 | 457,926,539,180 | null | 41 | 41 |
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
from collections import deque
class Edge:
def __init__(self, to, id):
self.to = to
self.id = id
def main():
n = int(readline())
g = [[] for _ in range(n)]
for i in range(n-1):
a, b = map(int, readline().split())
g[a-1].append(Edge(b-1, i))
g[b-1].append(Edge(a-1, i))
dq = deque()
done = [0 for _ in range(n)]
dq.append(0)
done[0] = 1
edgecolor = [0 for _ in range(n-1)]
while len(dq) > 0:
v = dq.pop()
c = -1
for i in range(len(g[v])):
nx = g[v][i].to
edge_id = g[v][i].id
if done[nx]:
c = edgecolor[edge_id]
k = 1
for i in range(len(g[v])):
nx = g[v][i].to
edge_id = g[v][i].id
if done[nx]:
continue
if k == c:
k += 1
edgecolor[edge_id] = k
k += 1
done[nx] = 1
dq.append(nx)
mx = max(edgecolor)
print(mx)
for ec in edgecolor:
print(ec)
if __name__ == '__main__':
main()
|
import bisect
def main():
N,D,A=map(int,input().split())
XH=[list(map(int,input().split())) for _ in range(N)]
XH.sort()
for i in range(N):
XH[i][1]=-(-XH[i][1]//A)
X=[x for x,a in XH]
far=[0]*N
for i in range(N):
far[i]=bisect.bisect_right(X,X[i]+2*D)-1
ans=0
carry=0
outrange=[0]*(N+1)
for i in range(N):
x=XH[i][0]
hp=XH[i][1]
carry-=outrange[i]
if carry>=hp:
continue
outrange[bisect.bisect_right(X,X[i]+2*D)]+=hp-carry
ans+=hp-carry
carry+=hp-carry
print(ans)
if __name__ == '__main__':
main()
| 0 | null | 108,834,884,534,300 | 272 | 230 |
n=int(input())
itv=[]
for i in range(n):
x,l=map(int,input().split())
itv+=[(x+l,x-l)]
itv=sorted(itv)
l=-10**18
cnt=0
for t,s in itv:
if l<=s:
l=t
cnt+=1
print(cnt)
|
N = int(input())
X = [int(x) for x in input().split()]
G = int(sum(X)/N + 0.5)
ans = sum((x-G)**2 for x in X)
print(ans)
| 0 | null | 77,822,280,707,732 | 237 | 213 |
if __name__ == "__main__":
n = int(input())
S = list(map(int, input().split()))
q = int(input())
T = list(map(int, input().split()))
ans = 0
for i in T:
if i in S:
ans += 1
print(ans)
|
n = input()
S = map(int,raw_input().split())
q = input()
T = map(int,raw_input().split())
ans = 0
for t in T:
if t in S:
ans+=1
print ans
| 1 | 66,970,446,268 | null | 22 | 22 |
N = int(input())
ans = ""
letter = "abcdefghijklmnopqrstuvwxyz"
while N != 0:
N -= 1
ans = letter[N % 26] + ans
N = N // 26
print(ans)
|
s = input()
a = [str(c) for c in s]
t = input()
b = [str(c) for c in t]
c = 0
n = len(a)
for i in range(n):
if a[i] == b[i]:
c +=1
print(n-c)
| 0 | null | 11,257,277,284,450 | 121 | 116 |
str=input()
l=len(str)
n=0
while l>0:
n=n+int(str[l-1])
l=l-1
if n%9 == 0:
print("Yes")
else :
print("No")
|
a = 0
for c in map(int, input()):
a += c
print("Yes" if a % 9 == 0 else "No")
| 1 | 4,406,690,516,100 | null | 87 | 87 |
the_string = input()
L1,R1,d1 = the_string.split()
L=int(L1)
R=int(R1)
d=int(d1)
count=0
for i in range(L,R+1):
if(i%d)==0:
count+=1
print(count)
|
l,r,d=map(int,input().split());print(r//d-~-l//d)
| 1 | 7,446,311,971,780 | null | 104 | 104 |
def Qc():
x, n = map(int, input().split())
if 0 < n:
p = list(map(int, input().split()))
for i in range(101):
if x - i not in p:
print(x - i)
exit()
if x + i not in p:
res = x + 1
print(x + i)
exit()
else:
# 整数列がなにもない場合は自分自身が含まれていない最近値になる
print(x)
exit()
if __name__ == "__main__":
Qc()
|
X,N=map(int,input().split())
if N==0:
print(X)
else:
w=input()
w=w.split()
t=list(w)
b=list(range(-150,151))
tt=[int(a) for a in t]
ttt=set(tt)
bb=set(b)
c=bb^ttt
cc=list(c)
u=1000
for s in cc:
if abs(s-X)<u:
u=abs(s-X)
if (X-u) in cc:
print(X-u)
else :
print(X+u)
| 1 | 14,149,174,842,738 | null | 128 | 128 |
import math
r = float(input())
S = r*r*math.pi
l = 2*r*math.pi
print("{:.5f} {:.5f}".format(S,l))
|
import math
r = float(input())
area = math.pi*r**2
circuit = 2*math.pi*r
print"%f %f" % (area, circuit)
| 1 | 636,957,410,812 | null | 46 | 46 |
W,H,x,y,r = (int(i) for i in input().split())
if W-(x+r) >=0 and H-(y+r) >= 0:
if x-r >= 0 and y-r >= 0:
print("Yes")
else:
print("No")
else:
print("No")
|
ins = input().split()
w = int(ins[0])
h = int(ins[1])
x = int(ins[2])
y = int(ins[3])
r = int(ins[4])
if x - r >= 0 and y - r >= 0 and x + r <= w and y + r <= h:
print("Yes")
else:
print("No")
| 1 | 457,722,063,136 | null | 41 | 41 |
n = int(input())
m = (n + 1) // 2
print(m)
|
str_num = input()
num_list = str_num.split()
answer = int(num_list[0]) * int(num_list[1])
print(answer)
| 0 | null | 37,357,246,343,800 | 206 | 133 |
n,m=map(int,input().split())
for i in range(m):
print(i+1,n-i-((i>=m/2)&~n))
|
import sys
sys.setrecursionlimit(10 ** 8)
input = sys.stdin.readline
def main():
N, M = [int(x) for x in input().split()]
ans = [[] for j in range(M)]
if N % 2:
for i in range(M):
ans[i].append(i + 1)
ans[i].append(N - i - 1)
else:
memo = 0
f = False
for i in range(M):
memo = i
if (i + 1) * 4 >= N:
f = True
break
ans[i].append(i + 1)
ans[i].append(N - i - 1)
if f:
for j in range(memo, M):
ans[j].append(j + 1)
ans[j].append(N - j - 2)
for a in ans:
print(*a)
if __name__ == '__main__':
main()
| 1 | 28,554,613,810,992 | null | 162 | 162 |
import sys
import math
H, W = map(int, raw_input().split())
while H > 0 or W > 0 :
for y in xrange(H) :
for x in xrange(W) :
if (x + y) % 2 == 0 :
sys.stdout.write("#")
else :
sys.stdout.write(".")
print
print
H, W = map(int, raw_input().split())
|
N, K = map(int,input().split())
A = list(map(int,input().split()))
check = [0] * (N+1) #対象の町を訪問するのが初めてか
li = [] #町の移動順
i, j = 1, 1 #現在の町の番号と移動回数
while True:
k = A[i-1] #移動先の町の番号
if check[k] == 1:
#前に訪問したことがある場合
n = li.index(k)+1 #ループに入った時点での移動回数
break
check[k] = 1
li.append(k)
i = k
j += 1
if K < n: print(li[K-1])
else: print(li[(K-n) % (j-n) + n - 1])
| 0 | null | 11,721,400,359,172 | 51 | 150 |
from _collections import deque
from _ast import Num
def parser():
while 1:
data = list(input().split(' '))
for number in data:
if len(number) > 0:
yield (number)
input_parser = parser()
def gw():
global input_parser
return next(input_parser)
def gi():
data = gw()
return int(data)
MOD = int(1e9 + 7)
import numpy
from collections import deque
from math import sqrt
from math import floor
# https://atcoder.jp/contests/abc145/tasks/abc145_e
#E - All-you-can-eat
"""
"""
N = gi()
M = gi()
S = gw()
lis = [0] * (N + 5)
li = 0
all_good = 1
for i in range(1, N + 1):
while (i - li > M or (li < i and S[li] == "1")):
li += 1
if li == i:
all_good = 0
break
lis[i] = li
if all_good:
ans = []
ci = N
while ci > 0:
step = ci - lis[ci]
ans.append(step)
ci -= step
ans.reverse()
for a in ans:
print(a, end=" ")
else:
print(-1)
|
N,M=map(int, input().split())
S=list(input())
T=S[::-1]
D=[0]*N
if N<=M:
print(N)
exit()
renzoku,ma=0,0
for i in range(1,N+1):
if S[i]=='1':
renzoku+=1
else:
ma=max(ma,renzoku)
renzoku=0
if ma>=M:
print(-1)
exit()
r=0
for i in range(1,M+1):
if T[i]!='1':
r=i
ans=[r]
while r+M<N:
for i in range(M,0,-1):
if T[r+i]=='0':
ans.append(i)
r+=i
break
ans.append(N-r)
print(*ans[::-1])
| 1 | 139,446,894,748,314 | null | 274 | 274 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.