id stringlengths 24 27 | content stringlengths 37 384k | max_stars_repo_path stringlengths 51 51 |
|---|---|---|
condefects-python_data_401 | import collections,sys,math,functools,operator,itertools,bisect,heapq,decimal,string,time,random
#sys.setrecursionlimit(10**9)
#sys.set_int_max_str_digits(0
class UnionFind():
def __init__(self, n):
self.n = n
self.parents = [-1] * n
def find(self, x):
if self.parents[x] < 0:
... | ConDefects/ConDefects/Code/abc345_f/Python/52944760 |
condefects-python_data_402 | import sys
sys.setrecursionlimit(10**7)
N, M, K = map(int, input().split())
G = [[] for _ in range(N)]
for i in range(M):
u, v = map(int, input().split())
u -= 1
v -= 1
G[u].append((v, i+1))
G[v].append((u, i+1))
vis = [0]*N
lig = [0]*N
cnt = 0
ans = []
flg = False
def dfs(now, pre=-1, edge=-1):
... | ConDefects/ConDefects/Code/abc345_f/Python/51504279 |
condefects-python_data_403 | N = int(input())
D = list(map(int, input().split()))
ans = 0
for i in range(1, N+1):
m = list(str(i))
for j in range(1, D[i-1]):
d = list(str(j))
if len(set(m + d)) == 1:
ans += 1
print(ans)
N = int(input())
D = list(map(int, input().split()))
ans = 0
for i in range(1, N+1):
m =... | ConDefects/ConDefects/Code/abc328_b/Python/54943660 |
condefects-python_data_404 | N = int(input())
D = list(map(int,input().split()))
ans = 0
for x in range(1,N+1):
for y in range(1,D[x-1]+1):
x = str(x)
a = list(x)
a = list(map(int,a))
y = str(y)
b = list(y)
b = list(map(int,b))
a = set(a)
b = set(b)
a = list(a)
b = list(b)
print(a,b)
a = list(a)
... | ConDefects/ConDefects/Code/abc328_b/Python/54688793 |
condefects-python_data_405 | N=int(input())
D=input().split()
ans=0
for Mon in range(1,N+1):
Mlist=list(str(Mon))
for Day in range(1,int(D[Mon-1])):
Dlist=list(str(Day))
if len(Mlist)==1 and len(Dlist)==1 and Mlist[0]==Dlist[0]:
ans+=1
# print(Mon,Day)
if len(Mlist)==1 and len(Dlist)==2 and Mlist[0]==Dlist[0]==Dlis... | ConDefects/ConDefects/Code/abc328_b/Python/54743139 |
condefects-python_data_406 | INT =lambda: int(input())
MI = lambda: map(int,input().split())
MI_DEC = lambda: map(lambda x: int(x) -1, input().split())
LI = lambda: list(map(int, input().split()))
def main() -> None:
n = INT()
s = LI()
count = 0
for m in range(n):
for d in range(1, s[m]):
if len(set(str(m+1)+st... | ConDefects/ConDefects/Code/abc328_b/Python/54041860 |
condefects-python_data_407 | INT =lambda: int(input())
MI = lambda: map(int,input().split())
MI_DEC = lambda: map(lambda x: int(x) -1, input().split())
LI = lambda: list(map(int, input().split()))
def main() -> None:
n = INT()
s = LI()
count = 0
for m, di in enumerate(s, start=1):
for d in range(1, di):
ss = set... | ConDefects/ConDefects/Code/abc328_b/Python/54041719 |
condefects-python_data_408 | N=int(input())
D=list(map(int,input().split()))
count=0
for i in range(1,N+1):
j=i%10
if i==j or i==j*10+j:
for k in range(D[i-1]):
if k==j or k==j*10+j:
count=count+1
print(count)
N=int(input())
D=list(map(int,input().split()))
count=0
for i in range(1,N+1):
j=i%10
if i==j or i==j*10+j:
... | ConDefects/ConDefects/Code/abc328_b/Python/54961220 |
condefects-python_data_409 | from heapq import heappush, heappop, heapify
import sys
from collections import defaultdict, deque,Counter
from math import ceil, floor, sqrt, factorial,gcd
from itertools import permutations, combinations,product #順列,組み合わせ,重複順列
from bisect import bisect_left, bisect_right
from copy import deepcopy
from functools impor... | ConDefects/ConDefects/Code/abc322_e/Python/53004931 |
condefects-python_data_410 | from itertools import product
N,K,P=map(int,input().split())
dp=[10**18]*(P+1)**K
dp[0]=0
for i in range(N):
I=list(map(int,input().split()))
for p in product(reversed(range(P+1)),repeat=K):
pn=[0]*K
for j in range(K):
pn[j]=min(P,p[j]+I[j+1])
pi=0
for pp in p:
... | ConDefects/ConDefects/Code/abc322_e/Python/53314219 |
condefects-python_data_411 | # 5進数で考える
N = int(input()) - 1
rems = []
while N > 0:
quotient = N // 5
remainder = N % 5
rems.append(remainder)
N = quotient
converted = rems[::-1]
converted = ''.join([str(c * 2) for c in converted])
print(converted)
# 5進数で考える
N = int(input()) - 1
if N == 0:
print(0)
rems = []
while N > 0:
quotient =... | ConDefects/ConDefects/Code/abc336_c/Python/54629693 |
condefects-python_data_412 | N = int(input())
import numpy as np
print(np.base_repr(N-1,5)*2)
N = int(input())
import numpy as np
print(int(np.base_repr(N-1,5))*2) | ConDefects/ConDefects/Code/abc336_c/Python/54442370 |
condefects-python_data_413 | def base10int(value, base):
if int(value / base): return base10int(int(value / base), base) + str(value % base)
return str(value % base)
def dbl(x): return str(2*int(x))
print("".join(list(map(dbl, base10int(int(input()), 5)))))
def base10int(value, base):
if int(value / base): return base10int(int(value / base)... | ConDefects/ConDefects/Code/abc336_c/Python/54444134 |
condefects-python_data_414 | n = int(input()) - 1
goodint = []
while n != 0:
goodint.append(n % 5)
n //= 5
goodint = goodint[::-1]
new_list = []
for i in goodint:
print(2*i, end = "")
n = int(input()) - 1
goodint = []
if n == 0:
print(0)
while n != 0:
goodint.append(n % 5)
n //= 5
goodint = goodint[::-1]
new_list = []... | ConDefects/ConDefects/Code/abc336_c/Python/54915792 |
condefects-python_data_415 | n,m = map(int,input().split())
a = [input() for _ in range(n)]
for i in range(n-9):
for j in range(m-9+1):
if (all(row[j:j+4] == "###." for row in a[i:i+3]) and
a[i+3][j:j+4] == "...." and a[i+5][j+5:j+9] =="...." and
all(row[j+5:j+9] == ".###" for row in a[i+6:i+9])):
... | ConDefects/ConDefects/Code/abc312_b/Python/45967113 |
condefects-python_data_416 | """
y 軸の小さい方から大きい方に遷移
とりあえずy軸でソート
i -> j に遷移できるか
T_j - T_i >= Y_j - Y_i + |X_j - X_i|
であればＯＫ
T_j - Y_j >= T_i - Y_i + |X_j - X_i|
Z_i = T_i - Y_i
Z_j >= Z_i + |X_j - X_i|
dp[i] := 時刻 T_i に(X_i, Y_i) にいるときの合計の最大値
(Z, X) を持って range tree ?
区間が三角形なんだよな
45度回転でできるか？
"""
import os
import sys
from io import Bytes... | ConDefects/ConDefects/Code/abc266_h/Python/34423081 |
condefects-python_data_417 | n=int(input())
A=list(map(int,input().split()))
ans = [0]
for i in range(n):
for j in range(len(ans)):
ans[j] += A[i]
ans[j] %= 360
ans.append(0)
ans = sorted(ans)
ans.append(360)
Ma = 0
for i in range(n):
Ma = max(Ma, ans[i+1]-ans[i])
print(Ma)
n=int(input())
A=list(map(int,input().split(... | ConDefects/ConDefects/Code/abc238_b/Python/45497591 |
condefects-python_data_418 | #素因数分解を行う関数
#fc=[[prime,cnt], [prime, cnt]...]の二次元配列を返す
def factorization(n):
now_num = n
prime_cnt_list = []
for i in range(2, n + 1):
if i * i > now_num:
break
if now_num % i:
continue
cnt = 0
while not now_num % i:
now_num //= i
... | ConDefects/ConDefects/Code/abc254_d/Python/53475713 |
condefects-python_data_419 | n=int(input())
def pf(n):
a,f={},2
while f*f<=n:
if n%f:f+=1
else:a[f]=a.get(f,0)+1;n//=f
if n>1:a[n]=a.get(n,0)+1
return a
s=[i*i for i in range(1,n)if i*i<=n]
ans=0
for i in range(1,n+1):
a=1
for k,v in pf(i).items():
if v%2:
a*=k
for j in s:
if a*j<=n:
ans+=1
else:
break
p... | ConDefects/ConDefects/Code/abc254_d/Python/51493507 |
condefects-python_data_420 | N = int(input())
#素因数分解を行う関数
#fc=[[prime,cnt], [prime, cnt]...]の二次元配列を返す
def factorization(n):
now_num = n
prime_cnt_list = []
for i in range(2, n + 1):
if i * i > now_num:
break
if now_num % i:
continue
cnt = 0
while not now_num % i:
now_n... | ConDefects/ConDefects/Code/abc254_d/Python/52216169 |
condefects-python_data_421 | N,M=map(int,input().split())
G=[[] for _ in range(N)]
for _ in range(M):
u,v=map(int,input().split())
G[u-1].append(v-1)
G[v-1].append(u-1)
seen=set()
cnt=0
for i in range(N):
if(i not in seen):
stack=[i]
cnt+=1
while stack:
x=stack.pop()
if(x in seen):
... | ConDefects/ConDefects/Code/abc284_c/Python/54471713 |
condefects-python_data_422 | from collections import Counter
n = int(input())
p = list(map(int, input().split()))
ans = 0
candidate = [0]*(n)
new = [0]*(n)
for i in range(n):
for j in range(3):
candidate[(p[i]+j-1+i)%n] += 1
for i in range(n):
ans = max(ans, candidate[i])
print(ans)
from collections import Counter
n = int(input... | ConDefects/ConDefects/Code/abc268_c/Python/45122098 |
condefects-python_data_423 | a = int(input())
# a, b = map(int, input().split())
if a % 4 == 2:
print(a)
elif a % 4 == 1:
print(a + 1)
elif a % 4 == 3:
print(a + 3)
a = int(input())
# a, b = map(int, input().split())
if a % 4 == 2:
print(a)
elif a % 4 == 1:
print(a + 1)
elif a % 4 == 3:
print(a + 3)
elif a % 4 == 0:
... | ConDefects/ConDefects/Code/abc262_a/Python/45968075 |
condefects-python_data_424 | class Factorial():
def __init__(self, MOD):
self.mod = MOD
self._factorial = [1]
self._size = 1
self._factorial_inv = [1]
self._size_inv = 1
def __call__(self, n):
'''n! % mod '''
return self.fact(n)
def fact(self, n):
'''n! % mod '''
... | ConDefects/ConDefects/Code/abc297_f/Python/47953762 |
condefects-python_data_425 | # https://atcoder.jp/contests/abc297/tasks/abc297_f
height, width, num_blocks = map(int, input().split())
MOD = 998244353
n = 10**6
def g(h, w):
return cmb(h*w, num_blocks, MOD)
def f(h, w):
expected = g(h, w) - 2*g(h-1, w) - 2*g(h, w-1) + g(h-2, w) + g(h, w-2) + 4*g(h-1, w-1) - 2*g(h-2, w-1) - 2*g(h-1, w-2)... | ConDefects/ConDefects/Code/abc297_f/Python/49316217 |
condefects-python_data_426 | from itertools import accumulate
T=int(input())
for _ in range(T):
D,K,X=map(int,input().split())
tmp=[1]
for i in range(D):
tmp.append(pow(K,i+1))
tmp=list(accumulate(tmp))
for i in range(D+1):
if tmp[i]>=X: id=i; break
ans=10**20
for i in range(id,D+1):
if i<D: tmp2=1
else: tmp2=0
am... | ConDefects/ConDefects/Code/abc290_g/Python/39049178 |
condefects-python_data_427 | import math
import sys
sys.setrecursionlimit(500_000)
from collections import defaultdict
def solve1(x, k, tmp, d):
m = len(tmp)
ans = 0 if len(tmp) == d + 2 else 1
#print(f'ans={ans}, tmp={tmp}, d={d}')
rest = tmp[m - 1] - x
if rest < 0:
return float('inf')
j = m - 2
while rest > 0... | ConDefects/ConDefects/Code/abc290_g/Python/39047205 |
condefects-python_data_428 | from collections import deque
N, M = map(int, input().split())
relations = [[] for _ in range(N)]
queue = deque([])
cnt = [0 for _ in range(N)]
U = [None] * M
V = [None] * M
for i in range(M):
U[i], V[i] = map(int, input().split())
relations[V[i]-1].append(U[i]-1)
cnt[V[i]-1] += 1
for i in range(N):
... | ConDefects/ConDefects/Code/abc245_f/Python/45811431 |
condefects-python_data_429 | # D - Unicyclic Components
from collections import defaultdict
def main():
N, M = map(int, input().split())
lib = UnionFind(N)
vertexes = set()
cnt = defaultdict(int)
for _ in range(M):
u, v = map(int, input().split())
lib.unite(u, v)
vertexes.add(u)
vertexes.add(v)
cnt[u] += 1
cnt[v... | ConDefects/ConDefects/Code/abc292_d/Python/44987159 |
condefects-python_data_430 | import math
# import heapq
import sys
sys.setrecursionlimit(10**6)
# n,m,k = map(int, input().split())
# n = int(input())
n,q = map(int, input().split())
if q==2:
print(int(math.log(n,2)))
exit()
P = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97]
r = 0
while q!=... | ConDefects/ConDefects/Code/abc300_g/Python/45084922 |
condefects-python_data_431 | from collections import *
import sys
import heapq
import bisect
import itertools
from functools import lru_cache
from types import GeneratorType
from fractions import Fraction
import math
import copy
sys.setrecursionlimit(int(1e7))
# @lru_cache(maxsize=None) # CPython特化
# @bootstrap # PyPy特化(こっちのほうが速い) yield dfs(), yi... | ConDefects/ConDefects/Code/abc254_f/Python/48945628 |
condefects-python_data_432 |
class SegTree:
def __init__(self,lis,segfunc,ide_ele):
self.lis=lis
self.segfunc=segfunc
self.ide_ele=ide_ele
self.n=len(lis)
nb=bin(self.n)[2:]
if self.n==1<<len(nb)-1:
self.leaves=1<<len(nb)-1
else:
self.leaves=1<<(len(nb))
s... | ConDefects/ConDefects/Code/abc254_f/Python/49680019 |
condefects-python_data_433 | INF = 1 << 62
def gcd(a, b):
if b == 0: return a
else: return gcd(b, a%b)
from atcoder.segtree import SegTree
def op(data1, data2):
return gcd(data1, data2)
# opの単位元 op(data1, e) = data1
e = 0
import bisect, heapq, sys, math, copy, itertools, decimal
from collections import defaultdict, deque
sys.setr... | ConDefects/ConDefects/Code/abc254_f/Python/51937981 |
condefects-python_data_434 | a = list(map(int, input().split()))
a.sort()
if a[2] > sum(a) * 2:
print(-1)
elif a[0] == 0 and a[1] < a[2]:
print(-1)
else:
print(a[2])
a = list(map(int, input().split()))
a.sort()
if a[2] * 2 > sum(a):
print(-1)
elif a[0] == 0 and a[1] < a[2]:
print(-1)
else:
print(a[2]) | ConDefects/ConDefects/Code/arc143_a/Python/43789022 |
condefects-python_data_435 | l = list(map(int, input().split()))
l.sort()
if(l[0] > l[1] + l[2]): print("-1")
else: print(l[2])
l = list(map(int, input().split()))
l.sort()
if(l[2] > l[1] + l[0]): print("-1")
else: print(l[2]) | ConDefects/ConDefects/Code/arc143_a/Python/43960988 |
condefects-python_data_436 | A,B,C=map(int,input().split())
max_A=max(A,B,C)
sum_B=A+B+C
if sum_B-max_A>=max_A:
print(sum_B//2)
else:
print(-1)
A,B,C=map(int,input().split())
max_A=max(A,B,C)
sum_B=A+B+C
if sum_B-max_A>=max_A:
print(max_A)
else:
print(-1) | ConDefects/ConDefects/Code/arc143_a/Python/45280588 |
condefects-python_data_437 | arr = input().split(' ')
arr = sorted(arr)
if int(arr[0]) + int(arr[1]) >= int(arr[2]):
print(arr[2])
else:
print("-1")
arr = map(int, input().split(' '))
arr = sorted(arr)
if int(arr[0]) + int(arr[1]) >= int(arr[2]):
print(arr[2])
else:
print("-1")
| ConDefects/ConDefects/Code/arc143_a/Python/45042880 |
condefects-python_data_438 | A, B, C = map(int, input().split())
L = [A, B, C]
L.sort()
if L[0] + L[1] < L[2]:
print(-1)
else:
# A = B
d = L[1] - L[0]
L[1] -= d
L[2] -= d
cnt = d
cnt += (L[2] - L[0]) * 2
cnt += L[2] - L[0]
print(cnt)
A, B, C = map(int, input().split())
L = [A, B, C]
L.sort()
if L[0] + L[1] < L... | ConDefects/ConDefects/Code/arc143_a/Python/43296021 |
condefects-python_data_439 | x,y,z = map(int, input().split())
print(-1 if x == y == 0 and z == 1 or x == z == 0 and y == 1 or y == z == 0 and x == 1 else max(x, y, z))
x,y,z = map(int, input().split())
print(-1 if x > y + z or y > x + z or z > x + y else max(x, y, z)) | ConDefects/ConDefects/Code/arc143_a/Python/45053784 |
condefects-python_data_440 | num = sorted(list(map(int, input().split())))
n = num[1] - (num[2]-num[0])
if n < 0:
print(-1)
else:
print(num[2]-num[1]+num[0])
num = sorted(list(map(int, input().split())))
n = num[1] - (num[2]-num[0])
if n < 0:
print(-1)
else:
print(num[2])
| ConDefects/ConDefects/Code/arc143_a/Python/44847102 |
condefects-python_data_441 | a, b, c = map(int, input().split())
al = [a, b, c]
al.sort()
diff = al[2] - al[1]
if a < diff:
print(-1)
else:
ans = 0
# 大きいのと真ん中を合わせる
al[0] -= diff
al[2] -= diff
ans += diff
# 小さいのに合わせる
diff = al[1] - al[0]
ans += diff
ans += al[0]
print(ans)
a, b, c = map(int, input().sp... | ConDefects/ConDefects/Code/arc143_a/Python/44409934 |
condefects-python_data_442 | from collections import *
import heapq
import bisect
INF = float("inf")
MOD = 998244353
mod = 998244353
X = list(input())
num = [0]
for x in X:
num.append(num[-1] + int(x))
num.reverse()
L = len(num)
ans = []
for i in range(L - 1):
k = num[i]
p, r = divmod(k, 10)
ans.append(str(r))
num[i + 1] += ... | ConDefects/ConDefects/Code/abc233_e/Python/45254335 |
condefects-python_data_443 | n, x, y, z = map(int, input().split())
a = [(ai, -i - 1) for i, ai in enumerate(map(int, input().split()))]
b = [(bi, -i - 1) for i, bi in enumerate(map(int, input().split()))]
total = sorted([(ai[0] + bi[0], ai[1]) for ai, bi in zip(a, b)], reverse=True)
a.sort(reverse=True)
b.sort(reverse=True)
ans = set()
for i i... | ConDefects/ConDefects/Code/abc260_b/Python/53041244 |
condefects-python_data_444 | N, X, Y, Z = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
Li1 = []
for i in range(X):
AM = A.index(max(A))
Li1.append(AM+1)
A[AM], B[AM] = -10, -10
for i in range(Y):
BM = B.index(max(B))
Li1.append(BM+1)
A[BM], B[BM] = -10, -10
C = []... | ConDefects/ConDefects/Code/abc260_b/Python/53719611 |
condefects-python_data_445 | abc="abcdefghijklnmopqrstuvwxyz"
print(abc[int(input())-97])
abc="abcdefghijklmnopqrstuvwxyz"
print(abc[int(input())-97]) | ConDefects/ConDefects/Code/abc252_a/Python/45686937 |
condefects-python_data_446 | N = int(input())
G = []
G1 = [0 for i in range(N+1)]
for u in range(3,N+1):
print('?',1,u)
d = int(input())
G1[u] = d
G2 = [0 for i in range(N+1)]
for u in range(3,N+1):
print('?',2,u)
d = int(input())
G2[u] = d
d = 10**9
for u in range(3,N+1):
dd = G1[u] + G2[u]
d = min(d,dd)
if d == 3:
X = [... | ConDefects/ConDefects/Code/arc142_c/Python/43034425 |
condefects-python_data_447 | from sys import stdout
mi = 10 ** 15
a = []
n = int(input())
for i in range(3,n+1):
print("?",1,i)
stdout.flush()
d1 = int(input())
print("?",2,i)
stdout.flush()
d2 = int(input())
mi = min(mi,d1+d2)
if d1+d2 == 3:
a.append(i)
if mi == 3 and len(a) == 2:
print("?",a[0],a[1])
stdout.flush()
dd =... | ConDefects/ConDefects/Code/arc142_c/Python/40122562 |
condefects-python_data_448 | import collections,sys,math,functools,operator,itertools,bisect,heapq,decimal,string,time,random
#sys.setrecursionlimit(10**9)
n = int(input())
#alist = list(map(int,input().split()))
#alist = []
#s = input()
#n,m = map(int,input().split())
#for i in range(n):
# alist.append(list(map(int,input().split())))
dist = [1... | ConDefects/ConDefects/Code/arc142_c/Python/43030313 |
condefects-python_data_449 |
N=int(input())
d=[]
for i in range(N-2):
print("?", 1, i+3)
d.append(int(input()))
for i in range(N-2):
print("?",2,i+3)
d.append(int(input()))
ans=[]
for i in range(N-2):
ans.append([d[i]+d[i+N-2],i+1])
ans.sort()
if ans[0][0]!=3:
print("!",ans[0][0])
elif ans[1][0]==3:
print("?",ans[0]... | ConDefects/ConDefects/Code/arc142_c/Python/44895895 |
condefects-python_data_450 | N = int(input())
def question(u, v):
print('?', u, v)
d = int(input())
return d
INF = 1<<62
G = [[] for _ in range(N)]
dist0 = [INF] * N
dist0[0] = 0
dist1 = [INF] * N
dist1[1] = 0
for i in range(2, N):
dist0[i] = question(1, i+1)
dist1[i] = question(2, i+1)
cnt = 0
x = []
mn_dist = INF
for i i... | ConDefects/ConDefects/Code/arc142_c/Python/40185010 |
condefects-python_data_451 | n = 10
s = [input()for i in range(n)]
a,b,c,d = 100, 0, 100, 0
for i in range(n):
for j in range(n):
if s[i][j]=='#':
if a>i : a=i
if b<i : B=i
if c>j : c=j
if d<j : d=j
print(a+1,b+1)
print(c+1,d+1)
n = 10
s = [input()for i in range(n)]
a,b,c,d = 100, 0, 100, 0
for i in... | ConDefects/ConDefects/Code/abc269_b/Python/45961458 |
condefects-python_data_452 | s=input()
if s=="Monday":
print(5)
if s=="Tuesday":
print(4)
if s=="Wednesday":
print(3)
if s=="Thursday":
print(2)
if s=="Friay":
print(1)
s=input()
if s=="Monday":
print(5)
if s=="Tuesday":
print(4)
if s=="Wednesday":
print(3)
if s=="Thursday":
print(2)
if s=="Friday":
print(... | ConDefects/ConDefects/Code/abc267_a/Python/45943869 |
condefects-python_data_453 | n,a,b,*D = map(int,open(0).read().split())
s = sum(D)
p,q = abs(a),abs(b)
if p+q>s or (s+p+q)%2:
print("No")
exit()
x,y = (s+p+q)//2,(s+p-q)//2
dp = [0]*(n+1)
dp[0] = 1
for i in range(n):
dp[i+1] = dp[i]|dp[i]<<D[i]
if not dp[n]>>x&dp[n]>>y&1:
print("No")
exit()
L = []
for i in range(n)[::-1]:
s,t = (dp[i]>... | ConDefects/ConDefects/Code/abc221_g/Python/26339941 |
condefects-python_data_454 | n, a, b, *d = map(int, open(0).read().split())
s = sum(d)
x = a+b+s
y = b-a+s
res = ""
if x >= 0 <= y and x & 1 == 0:
x >>= 1
y >>= 1
dp = [1]
for j in d:
dp += dp[-1] << j | dp[-1],
if dp[n] >> x & 1 and dp[n] >> y & 1:
while n:
n -= 1
i = ~dp[n] >> x & 1
... | ConDefects/ConDefects/Code/abc221_g/Python/40740321 |
condefects-python_data_455 | # Python3/Pypy3テンプレート集
#ライブラリ-------------------------------------------------------------------
from bisect import *
import heapq
import collections
from collections import deque
from queue import Queue
from itertools import groupby
import itertools
import math
import array
import string
import copy
from decimal impo... | ConDefects/ConDefects/Code/abc290_b/Python/45736394 |
condefects-python_data_456 | n, k = map(int, input().split())
s = input()
ans_list = []
cnt = 0
for i in range(n):
if s[i] == 'o':
cnt += 1
if cnt >= k:
ans_list.append('x')
else:
ans_list.append('o')
else:
ans_list.append(s[i])
print(*ans_list, sep = '')
n, k = map(int, input().spl... | ConDefects/ConDefects/Code/abc290_b/Python/46158106 |
condefects-python_data_457 | # B
N, K = map(int, input().split())
S = input()
#N, K = 10, 3
#S = "oxxoxooxox"
#print(S)
cnt = 0
s = ""
for i in S:
#print(i)
if i == "o" and cnt < 3:
cnt += 1
s = s + i
elif i == "o":
s = s + "x"
if i == "x":
s = s + "x"
print(s)
# B
N, K = map(int, input().split())
S... | ConDefects/ConDefects/Code/abc290_b/Python/46211702 |
condefects-python_data_458 | import bisect
import collections
import functools
import heapq
import itertools
import math
import operator
import string
import sys
import typing
readline = sys.stdin.readline
LS = lambda: readline()
LI = lambda: int(readline())
LLS = lambda: readline().split()
LL = lambda: list(map(int, readline().split()))
a, b, c... | ConDefects/ConDefects/Code/abc354_d/Python/54708447 |
condefects-python_data_459 | A, B, C, D = map(int, input().split())
p = [1, 2, 1, 0, 1, 2, 1, 0]
P = p[A%4+(B+1)%2:A%4+(B+1)%2+4]
S = ((C - A) // 4) * 4 + sum(P[:(C-A)%4])
Q = p[A%4+B%2:A%4+B%2+4]
T = ((C - A) // 4) * 4 + sum(Q[:(C-A)%4])
ans = (S+T) * ((D-B) // 2) + ((D - B) % 2) * ((D%2)*S + ((D+1)%2)*T)
print(ans)
A, B, C, D = map(int, in... | ConDefects/ConDefects/Code/abc354_d/Python/55158845 |
condefects-python_data_460 | import sys
import time
import math
import bisect
import heapq
import itertools
from collections import defaultdict
from collections import deque
cur_time = time.perf_counter()
sys.setrecursionlimit( 10 ** 8 )
INF = sys.maxsize
NUL = -1
MOD = 998244353
dy=[0,1,0,-1]
dx=[1,0,-1,0]
def searchL( ls, x ):return bisect.bi... | ConDefects/ConDefects/Code/abc354_d/Python/54915651 |
condefects-python_data_461 | S=input()
for s in S:
if s=='R':
print('Yes')
elif s=='M':
print('No')
S=input()
for s in S:
if s=='R':
print('Yes')
break
elif s=='M':
print('No')
break | ConDefects/ConDefects/Code/abc360_a/Python/55163956 |
condefects-python_data_462 | S = input()
if S == 'RSM' or 'RMS' or 'SRM':
print('Yes')
else:
print('No')
S = input()
if S == 'RSM' or S == 'RMS' or S == 'SRM':
print('Yes')
else:
print('No') | ConDefects/ConDefects/Code/abc360_a/Python/55164870 |
condefects-python_data_463 | def resolve():
S = str(input())
if (S[2] == "M") or (S[:1] == "RM"):
print ("Yes")
else:
print("No")
resolve()
def resolve():
S = str(input())
if S.index("R") < S.index("M"):
print ("Yes")
else:
print("No")
resolve() | ConDefects/ConDefects/Code/abc360_a/Python/55156972 |
condefects-python_data_464 | s = input()
d = {}
n = 1
for i in s:
d[i] = n
n += 1
if d['R'] > d['M']:
print('NO')
else:
print('Yes')
s = input()
d = {}
n = 1
for i in s:
d[i] = n
n += 1
if d['R'] > d['M']:
print('No')
else:
print('Yes') | ConDefects/ConDefects/Code/abc360_a/Python/55149517 |
condefects-python_data_465 | S = input()
for i in range(len(S)):
if S[i] == 'R':
R_index = i
elif S[i] == 'S':
S_index = i
if R_index < S_index:
print("Yes")
else:
print("No")
S = input()
for i in range(len(S)):
if S[i] == 'R':
R_index = i
elif S[i] == 'M':
S_index = i
if R_index < S_index:
print("Yes")
else:
print... | ConDefects/ConDefects/Code/abc360_a/Python/55149797 |
condefects-python_data_466 | import io
import sys
import bisect
import math
from itertools import permutations, combinations
from heapq import heappush, heappop
from collections import deque
from collections import defaultdict as dd
sys.setrecursionlimit(10**7+10)
mod = 998244353
_INPUT = """\
31415926535897932384626433832795
"""
def main():... | ConDefects/ConDefects/Code/abc224_f/Python/51168884 |
condefects-python_data_467 | n,m=map(int,input().split())
s=[input() for i in range(n)]
a=0
for i in range(1,(1<<n)-1):
c=[0]*26
for j in range(n):
if (i>>j)&1:
for k in range(26):
c[k]+=chr(k+ord("a")) in s[j]
a=max(a,c.count(m))
print(a)
n,m=map(int,input().split())
s=[input() for i in range(n)]
a=0
for i in range(1,1<<n... | ConDefects/ConDefects/Code/abc249_c/Python/45110623 |
condefects-python_data_468 | from collections import defaultdict
from itertools import product
N,K=map(int,input().split())
S=[list(input()) for _ in range(N)]
ans=0
for pro in product((1,0),repeat=N):
d=defaultdict(int)
for i in range(N):
if pro[i]==1:
for j in range(len(S[i])):
d[S[i][j]]+=1
chec... | ConDefects/ConDefects/Code/abc249_c/Python/44911089 |
condefects-python_data_469 | l,r = map(int, input().split())
s = input()
print(s[:l] + s[l:r+1][::-1] + s[r+1:])
l,r = map(int, input().split())
s = input()
print(s[:l-1] + s[l-1:r][::-1] + s[r:]) | ConDefects/ConDefects/Code/abc233_b/Python/46206186 |
condefects-python_data_470 | import math
from decimal import Decimal
a, b = map(int, input().split())
def f(x):
return Decimal((a / math.sqrt(1 + x)) + (b * x))
# 3分探索する
l = 0
r = 10**40
while r - l > 1:
m1 = (2 * l + r) // 3
m2 = (l + 2 * r) // 3
# print(m1, m2, l, r, f(m1), f(m2))
if f(m1) < f(m2):
r = m2
else... | ConDefects/ConDefects/Code/abc279_d/Python/44854241 |
condefects-python_data_471 | N = int(input())
a = [list(map(int, input().split())) for _ in range(N)]
a.sort(key=lambda x: abs(x[0]-x[1]))
cnt = 0
for i in range(N):
if a[i][0] > a[i][1]:
cnt += 1
ans = max(a[0]) if cnt & 2 == 0 else min(a[0])
for i in range(1, N):
ans += max(a[i])
print(ans)
N = int(input())
a = [list(map(int,... | ConDefects/ConDefects/Code/arc164_c/Python/45053848 |
condefects-python_data_472 | import sys, time, random
from collections import deque, Counter, defaultdict
input = lambda: sys.stdin.readline().rstrip()
ii = lambda: int(input())
mi = lambda: map(int, input().split())
li = lambda: list(mi())
inf = 2 ** 61 - 1
mod = 998244353
def solve():
s = input()
n = len(s)
dp = [inf] * (n + 1)
... | ConDefects/ConDefects/Code/agc066_c/Python/52162543 |
condefects-python_data_473 | m,n=map(int,input().split())
x=list(map(int,input().split()))
xi=[0for i in range(m)]
for i in range(m):
xi[x[i]-1]|=(1<<i)
mod=998244353
s=pow(2,m)
t=[[0for i in range(s)]for j in range(n+1)]
pr=[[-1 for i in range(m)]for j in range(s)]
for i in range(s):
for j in range(m):
if i&(1<<j)==0 or(s&(1<<j)!=0 and x[... | ConDefects/ConDefects/Code/arc179_b/Python/54728093 |
condefects-python_data_474 | # import sys
# sys.setrecursionlimit(10**6)
# sys.set_int_max_str_digits(10**6)
# from scipy.optimize import bisect
# from collections import defaultdict, Counter
# import bisect
# import heapq
mod = 998244353
# ds = [(-1,0),(0,1),(1,0),(0,-1)]
# S = input()
# N = int(input())
M, N = map(int, input().split())
X = lis... | ConDefects/ConDefects/Code/arc179_b/Python/54190165 |
condefects-python_data_475 | MOD = 998244353
M,N=map(int,input().split())
X=list(map(int,input().split()))
canadd=[[] for _ in range(M)]
for i in range(M):
canadd[X[i]-1].append(i)
dp=[[0]*2**M for _ in range(N+1)]
dp[0][2**M-1]=1
for i in range(N):
for j in range(2**M):
for k in range(M):
if j&(1<<k):
... | ConDefects/ConDefects/Code/arc179_b/Python/54198315 |
condefects-python_data_476 | import sys
import numba
import numpy as np
def main() -> None:
readline = sys.stdin.readline
M, N = map(int, readline().split())
xs = np.array(list(n - 1 for n in map(int, readline().split())))
print(numba_main(M, N, xs))
@numba.jit(nopython=True, cache=True)
def numba_main(M: int, N: int, xs: np.... | ConDefects/ConDefects/Code/arc179_b/Python/54187921 |
condefects-python_data_477 | MOD = 998244353
n = int(input())
RT_N = int(n ** 0.5) + 1
a = list(map(int, input().split()))
dp_black, dp_white = [0] * n, [0] * n
dp_black[0] = 1
lump = [[0] * n for _ in range(RT_N)]
for i in range(n - 1):
if a[i] < RT_N:
lump[a[i]][i] = (lump[a[i]][i] + dp_black[i]) % MOD
else:
for j in range(i... | ConDefects/ConDefects/Code/abc335_f/Python/53563069 |
condefects-python_data_478 | n=int(input())
a=list(map(int,input().split()))
mod=998244353
b=500
dp1=[[0]*(b) for _ in range(n)]
dp2=[0]*n
dp2[0]=1
if a[0]<b:
if a[0]<n:
dp1[a[0]][a[0]]=1
else:
for i in range(1,n//a[0]):
dp2[i*a[0]]=1
for i in range(1,n):
dp2[i]+=sum(dp1[i])
dp2[i]%=mod
for j in range(b):
if i+j<n:
... | ConDefects/ConDefects/Code/abc335_f/Python/54448133 |
condefects-python_data_479 | a,b,c,d=map(int,input().split())
print("Takahashi" if a*24+b<=c*24+d else "Aoki")
a,b,c,d=map(int,input().split())
print("Takahashi" if a*60+b<=c*60+d else "Aoki") | ConDefects/ConDefects/Code/abc245_a/Python/45264085 |
condefects-python_data_480 | a,b,c,d=map(int,input().split())
if a<c:
print("Takahashi")
if a==c:
if b<=d:
print("Takahashi")
else:
print("Aoki")
else:
print("Aoki")
a,b,c,d=map(int,input().split())
if a<c:
print("Takahashi")
elif a==c:
if b<=d:
print("Takahashi")
else:
print("Aoki")
els... | ConDefects/ConDefects/Code/abc245_a/Python/45115746 |
condefects-python_data_481 | #list型で取得
l = list(map(int, input().split()))
m=0
for i in l:
m += i
print(m)
N = int(input())
l = list(map(int, input().split()))
m=0
for i in l:
m += i
print(m) | ConDefects/ConDefects/Code/abc272_a/Python/54282225 |
condefects-python_data_482 | def enum_sum(a: list[int]) -> dict[int, int]:
n = len(a)
s = [0] * (1 << n)
for i in range(n):
for u in range(1 << i):
s[u | 1 << i] = s[u] + a[i]
return {s[u]: u for u in range(1 << n)}
def solve(a: list[int], X: int) -> list[int] | None:
sa = sum(a)
sr = sa + X
if sr ... | ConDefects/ConDefects/Code/abc326_f/Python/54719711 |
condefects-python_data_483 | import sys
readline=sys.stdin.readline
def Tonelli_Shanks(N,p):
if pow(N,p>>1,p)==p-1:
retu=None
elif p%4==3:
retu=pow(N,(p+1)//4,p)
else:
for nonresidue in range(1,p):
if pow(nonresidue,p>>1,p)==p-1:
break
pp=p-1
cnt=0
while pp%2=... | ConDefects/ConDefects/Code/abc281_h/Python/41260093 |
condefects-python_data_484 | from collections import deque
class Dinic:
def __init__(self, n):
self.n = n
self.links = [[] for _ in range(n)]
self.depth = None
self.progress = None
def add_link(self, _from, to, cap):
self.links[_from].append([cap, to, len(self.links[to])])
self.links[to... | ConDefects/ConDefects/Code/abc241_g/Python/46189922 |
condefects-python_data_485 | s = '??????????????(????????(??????)?????????(?(??)'
n = len(s)
mod = 998244353
dp = [[0 for i in range(3001)] for i in range(3000)]
if s[0] == ')':
print(0)
else:
dp[0][1] = 1
for i in range(1,n):
for j in range(i+2):
if s[i] == '(':
if j-1 >= 0:
dp[i... | ConDefects/ConDefects/Code/abc312_d/Python/54754384 |
condefects-python_data_486 | # D - Count Bracket Sequences
import math
def main():
S = input()
n = len(S)
dp = [[0] * (n+1) for _ in range(n+1)]
dp[0][0] = 1
mod = 998244353
for i in range(n):
for j in range(i+1):
half = math.ceil((i+1)/2)
if S[i] == '(' or S[i] == '?':
if j+1 >= half:
dp[i+1][j... | ConDefects/ConDefects/Code/abc312_d/Python/52032093 |
condefects-python_data_487 | #!/usr/bin/env python
import os
import sys
from io import BytesIO, IOBase
def solve(a):
a1 = []
n1 = len(a)
for i in range(1, n1):
a1.append(a[0] ^ a[i])
basis = []
for elem in a1:
elemcpy = elem
for elem2 in basis:
if elemcpy ^ elem2 < elemcpy:
... | ConDefects/ConDefects/Code/arc173_e/Python/51134374 |
condefects-python_data_488 | import bisect
import copy
import decimal
import fractions
import heapq
import itertools
import math
import random
import sys
import time
from collections import Counter,deque,defaultdict
from functools import lru_cache,reduce
from heapq import heappush,heappop,heapify,heappushpop,_heappop_max,_heapify_max
def _heappush... | ConDefects/ConDefects/Code/arc173_e/Python/51138423 |
condefects-python_data_489 | N,T,M=map(int,input().split())
#たかだか10人しかいません
hate=set()
for _ in range(M):
a,b=map(int,input().split())
hate.add((a,b))
hate.add((b,a))
def f(now):
if now==N:
#nowをNから波及させていくが、そのとき、ちゃんとteamsがTになっていれば1を返すようにする。
return 1 if len(teams)==T else 0
ans=0
for i in range(le... | ConDefects/ConDefects/Code/abc310_d/Python/53176077 |
condefects-python_data_490 | # import
import sys
import itertools
import bisect
import math
from collections import *
from pprint import pprint
from functools import cache
import heapq
# alias
DD = defaultdict
BSL = bisect.bisect_left
BSR = bisect.bisect_right
# config
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
# input template
... | ConDefects/ConDefects/Code/abc310_d/Python/50903679 |
condefects-python_data_491 | from sys import stdin
input=lambda :stdin.readline()[:-1]
h,w=map(int,input().split())
a=[]
for i in range(h):
b=list(map(int,input().split()))
b=[b[j]*(-1)**(i+j) for j in range(w)]
a.append(b)
p=[0]*h
q=[0]*w
for i in range(h):
for j in range(w):
p[i]+=a[i][j]
q[j]+=a[i][j]
ans=[[0]*w for i in rang... | ConDefects/ConDefects/Code/arc135_d/Python/29324173 |
condefects-python_data_492 | import sys
input = sys.stdin.readline
H, W = map(int, input().split())
A = [list(map(int, input().split())) for _ in range(H)]
rowsum = [0]*H
colsum = [0]*W
for i in range(H):
for j in range(W):
if (i+j) % 2:
A[i][j] *= -1
rowsum[i] += A[i][j]
colsum[j] += A[i][j]
rowidx = list... | ConDefects/ConDefects/Code/arc135_d/Python/41408142 |
condefects-python_data_493 | H, W = map(int, input().split())
As = [list(map(int, input().split())) for _ in range(H)]
for i in range(H - 1):
for j in range(W - 1):
tmp = As[i][j]
for di in range(2):
for dj in range(2):
As[i + di][j + dj] -= tmp
def sgn(x):
if x > 0:
return 1
elif ... | ConDefects/ConDefects/Code/arc135_d/Python/29313863 |
condefects-python_data_494 | h, w = map(int, input().split())
field = [list(map(int, input().split())) for _ in range(h)]
for i in range(h - 1):
for j in range(w - 2):
d = field[i][j]
field[i][j] -= d
field[i + 1][j] -= d
field[i][j + 2] += d
field[i + 1][j + 2] += d
for j in range(w - 1):
for i in r... | ConDefects/ConDefects/Code/arc135_d/Python/29316406 |
condefects-python_data_495 | import sys,random,bisect
from collections import deque,defaultdict
from heapq import heapify,heappop,heappush
from itertools import permutations
from math import gcd,log,sqrt
from atcoder.modint import ModContext, Modint
ModContext(1).context.append(998244353)
sys.setrecursionlimit(1000000)
input = lambda :sys.stdin.... | ConDefects/ConDefects/Code/abc235_d/Python/45465231 |
condefects-python_data_496 | from sys import stdin, setrecursionlimit
a, n = list(map(int, input().split()))
setrecursionlimit(10 ** 9)
numSet = [10**5] * (10 ** 7)
ans = 10 ** 10
def numSrch(c, moves):
global numSet
# print(c, numSet[c], moves)
if c == 1:
global ans
ans = min(ans, moves)
return
elif numSe... | ConDefects/ConDefects/Code/abc235_d/Python/44415594 |
condefects-python_data_497 | from queue import Queue
a,N=map(int,input().split())
def rot(N):
M=str(N)
return int(M[1:]+M[0])
d=[10**3]*10**len(str(N))
d[N]=0
q=Queue()
q.put(N)
while not q.empty():
M=q.get()
if M==1:
break
if M%a==0 and d[M//a]>d[M]+1:
d[M//a]=d[M]+1
q.put(M//a)
if d[rot(M)]>d[M]+1:... | ConDefects/ConDefects/Code/abc235_d/Python/44598432 |
condefects-python_data_498 | a,n = map(int,input().split())
nums =[-1]*(10**6)
from collections import deque
q = deque()
q.append(a)
nums[a] = 1
while q:
x = q.popleft()
y = x*a
if y<10**6 and nums[y] ==-1:
nums[y] = nums[x]+1
q.append(y)
if x>9:
X = str(x)
Z = X[-1]+X[:-1]
z = int(Z)
... | ConDefects/ConDefects/Code/abc235_d/Python/46231153 |
condefects-python_data_499 | N, C = map(int, input().split())
A = list(map(int, input().split()))
ruiseki_sei = [0]*(N+1)
ruiseki_hu = [0]*(N+1)
sum = 0
for i in range(N):
sum += A[i]
for i in range(1,N+1):
ruiseki_sei[i] = ruiseki_sei[i-1] + A[i-1]
if ruiseki_sei[i] <= 0:
ruiseki_sei[i] = 0
tmp = max(ruiseki_sei)
for i in rang... | ConDefects/ConDefects/Code/arc174_a/Python/54196806 |
condefects-python_data_500 | N, C = map(int, input().split())
A = list(map(int, input().split()))
S = [0]*(N + 1)
for i in range(N):
S[i + 1] = S[i] + A[i]
INF = 10**18
if C > 1:
m = INF
ans = -INF
for i in range(N):
m = min(m, S[i + 1])
ans = max(ans, S[i + 1] - m)
print(S[N] + ans*(C - 1))
elif C <= 1:
m... | ConDefects/ConDefects/Code/arc174_a/Python/53524573 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.