id stringlengths 24 27 | content stringlengths 37 384k | max_stars_repo_path stringlengths 51 51 |
|---|---|---|
condefects-python_data_901 | n,*s=open(0).read().split()
n=int(n)
for i in range(n):
for j in range(n):
if i!=j and s[i]+s[j]==[s[i]+s[j]][::-1]:
print("Yes")
exit()
print("No")
n,*s=open(0).read().split()
n=int(n)
for i in range(n):
for j in range(n):
if i!=j and s[i]+s[j]==(s[i]+s[j])[::-1]:
print("Yes")
exit... | ConDefects/ConDefects/Code/abc307_b/Python/45786032 |
condefects-python_data_902 | X=int(input())
numbers=[]
for k in range(1,18):
for d in range(1,10):
for l in range(-8,10):
number=d
digits=[str(d)]
for _ in range(k):
number+=l
digits.append(str(number))
if 0<=int(digits[-1])<10:
numbers.app... | ConDefects/ConDefects/Code/abc234_e/Python/45285849 |
condefects-python_data_903 | 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
from atcoder.dsu import DSU
ModContext(1).context.append(998244353)
sys.setrecursionlimit(1000000)... | ConDefects/ConDefects/Code/abc234_e/Python/45484479 |
condefects-python_data_904 | X = str(input())
if len(X) <= 2:
print(X)
else:
d = -9
a0 = int(X[0])
for i in range(d, 10):
num = ""
for j in range(len(X)):
if 0 <= a0 + i * j <= 9:
num += str(a0 + i * j)
if num >= X:
print(num)
exit()
a0 += 1
d = -9
for i in range(d, 10):
num = ""
for ... | ConDefects/ConDefects/Code/abc234_e/Python/45477719 |
condefects-python_data_905 | # cf. https://atcoder.jp/contests/abc345/editorial/9580
INF = 10**10
def solve(n, k, c, v):
C1 = [-1]*(k+1) # 最大の価値になる色
V1 = [-INF]*(k+1) # 最大の価値
C2 = [-1]*(k+1) # 次善の価値になる色
V2 = [-INF]*(k+1) # 次善の価値
C1[0] = 0
V1[0] = 0
for ci, vi in zip(c, v):
for j in range(k, 0, -1):
... | ConDefects/ConDefects/Code/abc345_e/Python/52899692 |
condefects-python_data_906 | import sys
input = sys.stdin.readline ###
n, k = map(int, input().split())
cv = [ list(map(int, input().split())) for _ in range(n) ]
INF = 1<<62
dp = [[-1,-1,-1,-1] for _ in range(k+1)]
dp[0] = [0, 0, -1,-1]
for c, v in cv:
np = [[-1,-1,-1,-1] for _ in range(k+1)]
for i in range(k):
np[i+1] = dp[i]
for i i... | ConDefects/ConDefects/Code/abc345_e/Python/51995381 |
condefects-python_data_907 | import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
def main():
N, L, *A = map(int, read().split())
no_more_two = False
for a in A:
if a == 1:
L -= 2
else:
L -= 3
if L <= 0:
no_more... | ConDefects/ConDefects/Code/arc152_a/Python/42092015 |
condefects-python_data_908 | import sys
input = lambda: sys.stdin.readline().rstrip()
mod = 9982444353
# ----------------------- #
Q, K = map(int, input().split())
dp = [0] * (K+1)
dp[0] = 1
for i in range(Q):
com, x = input().split()
x = int(x)
if com == '+':
for j in range(K, x-1, -1):
dp[j] += dp[j-x]
dp[j] %= mod
e... | ConDefects/ConDefects/Code/abc321_f/Python/52979507 |
condefects-python_data_909 | import sys
from collections import Counter, defaultdict, deque
from itertools import accumulate, combinations, permutations
from heapq import heappop, heappush
from math import inf
sys.setrecursionlimit(10**6)
MOD = 998244353
stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()... | ConDefects/ConDefects/Code/abc321_f/Python/50314783 |
condefects-python_data_910 | q, k = map(int, input().split())
mod = 998244353
dp = [0] * (k + 1)
dp[0] = 1
for i in range(q):
t, x = map(str, input().split())
x = int(x)
if t == "+":
for j in reversed(range(k+1-x)):
dp[j+x] += dp[j]
else:
for j in range(k+1-x):
dp[j+x] -= dp[j]
print(dp[k])
# print(dp)
q, k = map(i... | ConDefects/ConDefects/Code/abc321_f/Python/50281141 |
condefects-python_data_911 | class BIT:
n=1
data=[0 for i in range(n)]
def __init__(self,N):
self.n=N
self.data=[0 for i in range(N)]
def add(self,p,x):
assert 0<=p<self.n,"0<=p<n,p={0},n={1}".format(p,self.n)
p+=1
while(p<=self.n):
self.data[p-1]+=x
p+=p& -p
def s... | ConDefects/ConDefects/Code/abc233_h/Python/29975845 |
condefects-python_data_912 | import os
import sys
import numpy as np
def solve(inp):
n = inp[0]
points = []
offset = 100_001
for i in range(n):
x = inp[i * 2 + 1]
y = inp[i * 2 + 2]
X = x + y
Y = x - y + offset
points.append((X, 1, Y))
inp_offset = n * 2 + 1
q = inp[inp_offset]
... | ConDefects/ConDefects/Code/abc233_h/Python/53067892 |
condefects-python_data_913 | import sys
readline=sys.stdin.readline
from collections import defaultdict
class Segment_Tree:
def __init__(self,N,f,e,lst=None,dynamic=False):
self.f=f
self.e=e
self.N=N
if dynamic:
self.segment_tree=defaultdict(lambda:self.e)
else:
if lst==None:
... | ConDefects/ConDefects/Code/abc233_h/Python/44313828 |
condefects-python_data_914 | n=int(input())
X=10**5
p=[]
for i in range(n):
x,y=map(int,input().split())
p+=[(x-y+X,x+y)]
q=int(input())
b=[]
k=[0]*q
for i in range(q):
x,y,k[i]=map(int,input().split())
b+=[(x-y+X,x+y)]
ok=[2*X+1]*q
ng=[0]*q
from atcoder import fenwicktree
while any(ok[i]-ng[i]>1 for i in range(q)):
m=[(ok[i]+ng[i])//2 f... | ConDefects/ConDefects/Code/abc233_h/Python/46688976 |
condefects-python_data_915 | s=input()
n=len(s)
mod=998244353
dp=[[0]*27 for _ in range(n+1)]
dp2=[0]*(n+1)
dp[0][0]=1
check=[0]*26
cnt=0
x=ord('A')
for i in range(n):
if s[i]=='?':
for j in range(27):
dp[i+1][j]+=dp[i][j]*26
dp2[i+1]+=dp[i][j]*j
dp[i+1][j]%=mod
dp2[i+1]%=mod
for j in range(26):
dp[i+1]... | ConDefects/ConDefects/Code/abc301_f/Python/51429838 |
condefects-python_data_916 | p=998244353
S=input()
N=len(S)
UC=[0 for _ in range(26)]
#S[i]までに現れる大文字の種類数
UK=[0 for _ in range(N)]
#S[i]が2回目以上の大文字かどうか
DB=[0 for _ in range(N)]
for n in range(N):
i=ord(S[n])
if 65<=i<=90:
if UC[i-65]>=1:
DB[n]=1
UK[n]=UK[n-1]
else:
if n==0:
UK[n]=1
else:
UK[n]=UK[n... | ConDefects/ConDefects/Code/abc301_f/Python/53511062 |
condefects-python_data_917 | import sys
input = sys.stdin.readline
n,m = map(int,input().split())
e = [[0]*n for i in range(n)]
for _ in range(m):
a,b = [int(x)-1 for x in input().split()]
e[a][b] = 1
for i in range(n):
e[i][i] = 1
q = int(input())
ST = [[int(x)-1 for x in input().split()] for i in range(q)]
ans = [-1]*q
le = (n+61)/... | ConDefects/ConDefects/Code/abc287_h/Python/38508416 |
condefects-python_data_918 | import sys, bisect, math, itertools, string, queue, copy
from collections import *
from itertools import *
from heapq import *
# input = sys.stdin.readline
sys.setrecursionlimit(10**8)
mod = 998244353
def inp(): return int(input())
def inpm(): return map(int,input().split())
def inpl(): return list(map(int, input().spl... | ConDefects/ConDefects/Code/abc304_f/Python/45077270 |
condefects-python_data_919 | n=int(input())
if n==3:
s=[3,2,3,1,3,2]
elif n%2==1:
t=[3,2,3,1,2,3]
s=[]
for i in range((n-5)//2,-1,-1):
for j in range(3+i*2):
if i==(n-5)//2:
s.append(4+i*2)
s.append(5+i*2)
else:
s.append(5+i*2)
s.append(... | ConDefects/ConDefects/Code/agc064_a/Python/44640326 |
condefects-python_data_920 | def main():
n = int(input())
memo = {i: i for i in range(2, n + 1)}
ans = [1]
for i in range(2, n - 1):
ans.append(i)
memo[i] -= 2
p = n
d = -1
while memo[p]:
ans.append(p)
memo[p] -= 1
p += d
if not memo.get(p, 0):
d = -d
... | ConDefects/ConDefects/Code/agc064_a/Python/46045029 |
condefects-python_data_921 |
S = input()
N = len(S)
ans = 0
for i in range(N):
for j in range(i + 1, N + 1):
T = S[i:j]
if T == T[::-1]:
ans = max(ans, len(T))
print(T)
S = input()
N = len(S)
ans = 0
for i in range(N):
for j in range(i + 1, N + 1):
T = S[i:j]
if T == T[::-1]:
... | ConDefects/ConDefects/Code/abc320_b/Python/54935207 |
condefects-python_data_922 | s=list(input())
ans=0
for i in range(len(s)):
for j in range(i+1,len(s)):
if s[i:j]==list(reversed(s[i:j])):
ans=max(j-i,ans)
print(ans)
s=list(input())
ans=0
for i in range(len(s)):
for j in range(i+1,len(s)+1):
if s[i:j]==list(reversed(s[i:j])):
ans=max(j-i,ans)
print(... | ConDefects/ConDefects/Code/abc320_b/Python/54242807 |
condefects-python_data_923 | s=input()
ans=0
for i in range(len(s)):
for j in range(len(s)-i):
t=s[i:j+1]
tr=t[::-1]
if t==tr:
ans=max(ans,len(t))
print(ans)
s=input()
ans=0
for i in range(len(s)):
for j in range(i,len(s)):
t=s[i:j+1]
tr=t[::-1]
if t==tr:
ans=max(ans,... | ConDefects/ConDefects/Code/abc320_b/Python/54975112 |
condefects-python_data_924 | s = list(input())
max = 0
for i in range(len(s)):
for j in range(i+1,len(s)):
x = s[i:j]
x.reverse()
if s[i:j]==x and max<j-i:
max = j-i
print("{}".format(max))
s = list(input())
max = 0
for i in range(len(s)):
for j in range(i+1,len(s)+1):
x = s[i:j]
x.reve... | ConDefects/ConDefects/Code/abc320_b/Python/54243171 |
condefects-python_data_925 | s = '3.1415926535897932384626433832795028841971693993751058209749445923078164062862089986280348253421170679'
n = int(input())
print(float(s[:n+2]))
s = '3.1415926535897932384626433832795028841971693993751058209749445923078164062862089986280348253421170679'
n = int(input())
print(s[:n+2]) | ConDefects/ConDefects/Code/abc314_a/Python/45968783 |
condefects-python_data_926 | pi = "3.1415926535897932384626433832795028841971693993751058209749445923078164062862089986280348253421170679"
n = int(input())
print(pi[:n+1])
pi = "3.1415926535897932384626433832795028841971693993751058209749445923078164062862089986280348253421170679"
n = int(input())
print(pi[:n+2]) | ConDefects/ConDefects/Code/abc314_a/Python/46017209 |
condefects-python_data_927 | S = "3.1415926535897932384626433832795028841971693993751058209749445923078164062862089986280348253421170679"
N = int(input())
print(S[:N+3])
S = "3.1415926535897932384626433832795028841971693993751058209749445923078164062862089986280348253421170679"
N = int(input())
print(S[:N+2]) | ConDefects/ConDefects/Code/abc314_a/Python/45895663 |
condefects-python_data_928 | pie = "3.1415926535897932384626433832795028841971693993751058209749445923078164062862089986280348253421170679"
e = ""
for i in range(int(input())):
e += pie[i]
print(e)
pie = "3.1415926535897932384626433832795028841971693993751058209749445923078164062862089986280348253421170679"
e = ""
for i in range(int(input())+2)... | ConDefects/ConDefects/Code/abc314_a/Python/46027498 |
condefects-python_data_929 | S="3.1415926535897932384626433832795028841971693993751058209749445923078164062862089986280348253421170679"
N=int(input())
print(S[N+1])
S="3.1415926535897932384626433832795028841971693993751058209749445923078164062862089986280348253421170679"
N=int(input())
print(S[0:N+2]) | ConDefects/ConDefects/Code/abc314_a/Python/46014506 |
condefects-python_data_930 | #ABC298G Strawberry War
'''
高々6行6列なのに、なんでこんなに難しそうなんだ。
区間DPに持ち込みたいところだが、切断方法からして難しすぎるんだよな。
より簡単な区間DPの問題はこうだよね。
「数直線上にケーキがある。適切に分割し、差を最小化せよ」
これだとしても難しいんだけど。残り切断回数を保持したDPにするかもね。
実際にシミュレートすると場合の数どうなるんだろ。
わからんね。解説ACを目指そう。
典型: 最小値を固定して最大値を最小化せよ
とのことだった。いうほど典型か？
ケーキの苺数候補の全列挙は？
これは簡単で、頂点のひとつを固定すればできる。O(H^2 * W^2)くらい。
DP... | ConDefects/ConDefects/Code/abc298_g/Python/41059627 |
condefects-python_data_931 | s = list(input())
S = sorted(list(set(s)))
str = ""
for i in range(len(S)-1):
if i == 0:
str = S[0]
elif s.count(S[i]) > s.count(str):
str = S[i]
print(str)
s = list(input())
S = sorted(list(set(s)))
str = ""
for i in range(len(S)):
if i == 0:
str = S[0]
elif s.count(S[i]... | ConDefects/ConDefects/Code/abc338_b/Python/54399591 |
condefects-python_data_932 | mod = 998244353
N = int(input())
def S(A,B):
return (B-A+1)*(A+B)//2
ans = 0
for x in range(1,18):
if 10**x <= N:
ans += S(1,9*10**(x-1))
ans %= mod
else:
ans += S(1,N-10**(x-1)+1)
ans %= mod
break
print(ans)
mod = 998244353
N = int(input())
def S(A,B):
... | ConDefects/ConDefects/Code/abc238_c/Python/44668354 |
condefects-python_data_933 | N = int(input())
ans = 0
mod = 998244353
for i in range(1,19):
if i==1:
if N<9:
print(N)
exit()
ans += (9*10)//2
else:
MAX = int('9'*i)
if N <= MAX:
a = (N-(10**(i-1))+1)
ans += (a%mod)*((a+1)%mod)//2
ans %= mod
break
else:
a = (MAX-(10**(i-1))+1)
... | ConDefects/ConDefects/Code/abc238_c/Python/45122649 |
condefects-python_data_934 | def sum_of_f(n):
ans = 0
n1 = 1
while 10*n1 < n:
ans += (10*n1-1-n1+1)*(10*n1-1-n1+1+1)//2
ans = ans % 998244353
n1 *= 10
ans += (n-n1+1)*(n-n1+1+1)//2
ans = ans % 998244353
return ans
n = int(input())
print(sum_of_f(n))
def sum_of_f(n):
ans = 0
n1 = 1
while... | ConDefects/ConDefects/Code/abc238_c/Python/44681618 |
condefects-python_data_935 | n = int(input())
a = [0] + list(map(int, input().split()))
ans = 0
b = [0 for i in range(25)]
f = [[0 for i in range(25)] for i in range(25)]
mx=0;
for i in range(1, n + 1):
for j in range(10):
mx=max(mx,f[j][a[i]-j+9])
ans+=mx
for j in range(10):
if(b[j]):f[a[i]][a[i]-j+9]=max(b[j],f[a[i]][a[i]-j+9])
b[a[i]]=i... | ConDefects/ConDefects/Code/arc170_b/Python/52957349 |
condefects-python_data_936 | from collections import defaultdict
N = int(input())
A = list(map(int, input().split()))
single_last = [-1]*11
pair_last = [[-1]*11 for _ in range(11)]
triplet_dict = defaultdict(list)
for start in range(1,11):
for delta in range(-4,5):
if 1 <= start + 2*delta <= 10:
triplet_dict[start+2*delta... | ConDefects/ConDefects/Code/arc170_b/Python/50713909 |
condefects-python_data_937 | n = int(input())
A = list(map(int, input().split()))
que = [[0 for i in range(n * 2 + 100)] for i in range(11)]
ql = [n + 2 for i in range(11)]
qr = [n + 2 for i in range(11)]
l = 0; r = -1
ans = 0
while l <= n - 1:
fl = 0
while fl == 0 and r <= n - 1:
for i in range(11):
if qr[i] > ql[i] an... | ConDefects/ConDefects/Code/arc170_b/Python/49807049 |
condefects-python_data_938 | n = int(input())
A = list(map(lambda x: int(x)-1, input().split()))
d = 10
seen = [-1] * d
pair = [[-1] * d for _ in range(d)]
ret = 0
for r, rv in enumerate(A):
cnt = -1
for mv in range(d):
lv = 2*mv - rv
if lv < 0 or lv >= d: continue
# print(lv, mv, pair[lv][mv])
cnt = max(cn... | ConDefects/ConDefects/Code/arc170_b/Python/50027323 |
condefects-python_data_939 | N = int(input())
A = list(map(int,input().split()))
def hantei(lst):
seen = set()
out = set()
for i in range(len(lst)):
if lst[i] in out:
return 0
for s in seen:
out.add(s+(s-lst[i]))
out.add(lst[i]+(lst[i]-s))
seen.add(lst[i])
return 1
bad =... | ConDefects/ConDefects/Code/arc170_b/Python/50477019 |
condefects-python_data_940 | import sys
input = lambda: sys.stdin.readline().rstrip()
ii = lambda: int(input())
mi = lambda: map(int, input().split())
li = lambda: list(mi())
INF = 2 ** 63 - 1
mod = 998244353
n, m, d = mi()
r = li()
s = li()
L = []
R = []
S = []
for i in range(m - 1, 0, -1):
L.append(-r[i + 1])
R.append(-r[i])
S.ap... | ConDefects/ConDefects/Code/arc131_d/Python/33558182 |
condefects-python_data_941 | n, m, d = map(int, input().split())
arr = list(map(int, input().split()))
scores = list(map(int, input().split()))+[0]
if n == 1:
print(scores[0])
exit()
pos = list(range(-d*(n//2), d*((n+1)//2), d))
ans = 0
i = 1
for sc in range(0, d*((n+1)//2), d):
while i <= m and arr[i] < sc:
i += 1
ans += s... | ConDefects/ConDefects/Code/arc131_d/Python/27742025 |
condefects-python_data_942 | N, M, D = map(int, input().split())
R = list(map(int, input().split()))
S = list(map(int, input().split())) + [0]
imos = [0]*D
p = (N+1)//2 * D
m = N//2 * D
imos[0] = S[0]
ind = 1
for i in range(1,N//2+1):
if i*D > R[-1]: break
while i*D > R[ind]: ind += 1
imos[0] += S[ind-1]
if i<N//2 or N%2: imos[0] +... | ConDefects/ConDefects/Code/arc131_d/Python/27741393 |
condefects-python_data_943 | import sys
if sys.argv[-1] == 'ONLINE_JUDGE':
import os
import re
with open(__file__) as f:
source = f.read().split('###''nbacl')
for s in source[1:]:
s = re.sub("'''.*", '', s)
sp = s.split(maxsplit=1)
if os.path.dirname(sp[0]):
os.makedirs(os.path.dirname(sp... | ConDefects/ConDefects/Code/arc131_d/Python/27771010 |
condefects-python_data_944 | N=int(input())
C=list(map(int,input().split()))
mn=min(C)
cnt=N//mn
ans=[]
print(cnt,mn)
for i in range(cnt):
for j in range(8,-1,-1):
if C[j]+(cnt-(i+1))*mn<=N:
ans.append(j+1)
N-=C[j]
break
print(''.join(map(str, ans)))
N=int(input())
C=list(map(int,input().split()))
... | ConDefects/ConDefects/Code/abc257_e/Python/46192635 |
condefects-python_data_945 | import sys
from functools import lru_cache
from collections import defaultdict
sys.setrecursionlimit(10**9)
def I(): return input()
def IS(): return input().split()
def II(): return int(input())
def LI(): return list(input())
def MI(): return map(int,input().split())
def LMI(): return list(map(int,input().split()))
d... | ConDefects/ConDefects/Code/abc257_e/Python/45047426 |
condefects-python_data_946 | n, m = map(int, input().split())
A, B, C = map(lambda x : int(x) - 1, input().split())
G = [[] for _ in range(n)]
for _ in range(m) :
u, v = map(lambda x : int(x) - 1, input().split())
G[u].append(v); G[v].append(u)
dfn, low = [-1] * n, [-1] * n
tot = 0
bcc = []
stk_DFS = [(-1, A, 0)]
stk_v = []
while len(stk_DFS) ... | ConDefects/ConDefects/Code/abc318_g/Python/53538516 |
condefects-python_data_947 | numbers = []
nine = set(list(i for i in range(1,10)))
def check_row(data):
for i in data:
if nine != set(i):
return False
return True
def check_col(data):
for i in zip(*data):
if nine != set(i):
return False
return True
def check_block(data):
for i in range... | ConDefects/ConDefects/Code/abc327_c/Python/55003503 |
condefects-python_data_948 | n, n2 = 3, 9
grid = [list(map(int, input().split())) for _ in range(n2)]
rows = [[False] * n2 for _ in range(n2)]
cols = [[False] * n2 for _ in range(n2)]
blocks = [[[False] * n2 for _ in range(n)] for _ in range(n)]
# print(blocks)
valid = True
for i, line in enumerate(grid):
for j, num in enumerate(line):
... | ConDefects/ConDefects/Code/abc327_c/Python/54292566 |
condefects-python_data_949 | n, m = 9, 3
a = [list(map(int, input().split())) for _ in range(n)]
row = [set() for _ in range(n)]
col = [set() for _ in range(n)]
block = [[set() for j in range(m)] for i in range(m)]
for i in range(n):
for j in range(n):
row[i].add(a[i][j])
col[j].add(a[i][j])
block[i//m][j//m].add(a[i][... | ConDefects/ConDefects/Code/abc327_c/Python/53953010 |
condefects-python_data_950 | N = [0]*9
print()
for i in range(9):
l = list(map(int,input().split()))
if len(set(l))<9:
print("No")
exit()
N[i] = l
RN = list(zip(*reversed(N)))
for l in RN:
if len(set(l))<9:
print("No")
exit()
a = set()
b = set()
c = set()
for i in range(3):
for j in range(3):
a|=set(N[3*i+j][:3])... | ConDefects/ConDefects/Code/abc327_c/Python/53791551 |
condefects-python_data_951 | def dfs(s):
time = [-1] * n
st = [s]
time[s] = 0
parent = [-1] * n
while st:
i = st.pop()
ti = time[i]
for j in edges[i]:
if time[j] > -1:
continue
parent[j] = i
time[j] = ti + 1
st.append(j)
return time, pa... | ConDefects/ConDefects/Code/abc267_f/Python/45545460 |
condefects-python_data_952 | import numpy as np
import bisect
w, h = map(int,input().split())
n = int(input())
ichigo = [ list(map(int,input().split())) for _ in range(n)]
A = int(input())
a = list(map(int,input().split()))
B = int(input())
b = list(map(int,input().split()))
ans = {}
for i in range(n):
s = bisect.bisect(a,ichigo[i][0])
t = bi... | ConDefects/ConDefects/Code/abc304_d/Python/45574429 |
condefects-python_data_953 | def judge1():
def judge2(u, idx):
for i in range(N):
if i == idx:
continue
if u in ST[i]:
return False
return True
N = int(input())
ST = [input().split() for _ in range(N)]
for i in range(N):
si, ti = ST[i]
if judge2... | ConDefects/ConDefects/Code/abc247_b/Python/46174870 |
condefects-python_data_954 | # import pypyjit;pypyjit.set_param("max_unroll_recursion=-1")
# from bisect import *
from collections import *
# from heapq import *
# from itertools import *
# from sortedcontainers import *
# from math import gcd, lcm
# from datetime import *
# from decimal import * # PyPyだと遅い
# from string import ascii_lowercase,a... | ConDefects/ConDefects/Code/abc247_b/Python/46187946 |
condefects-python_data_955 | from collections import defaultdict
N = int(input())
name = []
d = defaultdict(int)
for i in range(N):
s, t = input().split()
name.append((s, t))
d[s] += 1
d[t] += 1
dp = [[set()]*(2) for _ in range(N+1)]
for i in range(N):
for j in range(2):
if d[name[i][j]] != 1:
continue
... | ConDefects/ConDefects/Code/abc247_b/Python/46225194 |
condefects-python_data_956 | N = int(input())
names = []
for _ in range(N):
first, last = input().split()
names.append((first, last))
for i in range(N):
i_first, i_last = names[i]
is_first_ok, is_last_ok = True, True
for j in range(N):
if i_first in names[j]:
is_first_ok = False
... | ConDefects/ConDefects/Code/abc247_b/Python/45068335 |
condefects-python_data_957 | from collections import defaultdict
n = int(input())
s = [""] * n
t = [""] * n
d = defaultdict(int)
for i in range(n):
s[i], t[i] = input().split()
d[s[i]] += 1
d[t[i]] += 1
for i in range(n):
if d[s[i]] >= 2 and d[t[i]] >= 2:
exit(print("No"))
print("Yes")
from collections import defaultdict
n = int(input... | ConDefects/ConDefects/Code/abc247_b/Python/46048925 |
condefects-python_data_958 | import math
a, b = list(map(int, input().split(' ')))
if a < b:
tmp = b
b = a
a = tmp
ans = 0
while b > 0:
ans += int(a / b)
a = a % b
tmp = a
a = b
b = tmp
print(ans-1)
import math
a, b = list(map(int, input().split(' ')))
if a < b:
tmp = b
b = a
a = tmp
ans = 0
while b > 0:
ans += a // ... | ConDefects/ConDefects/Code/abc297_d/Python/45529790 |
condefects-python_data_959 | n = int(input())
A = list(map(int, input().split()))
p = int(input())
X = list(map(int, input().split()))
q = int(input())
Y = list(map(int, input().split()))
MOD1 = 10 ** 9 + 7
MOD2 = 10 ** 9 + 7
base = 123451000
hX = [0]
hX2 = [0]
for v in X:
nex = (hX[-1] * base) + v
hX.append(nex % MOD1)
nex = (hX2... | ConDefects/ConDefects/Code/arc151_e/Python/35732545 |
condefects-python_data_960 |
n, x, y = map(int, input().split())
a = list(map(int, input().split()))
X = []
Y = []
for i in range(n):
if i %2 == 0:
X.append(a[i])
else:
Y.append(a[i])
dp_x = [[False for _ in range(4 * (sum(X) + 1))] for _ in range(len(X) + 1)]
dp_y = [[False for _ in range(4 * (sum(Y) + 1))] for _ in range(len(Y) + ... | ConDefects/ConDefects/Code/abc274_d/Python/46033282 |
condefects-python_data_961 | ir = lambda: int(input()) # 数字の読み込み
lr = lambda: list(map(int, input().split())) # 数字の配列の読み込み
N, x, y = lr()
A = lr()
xA = A[2::2]
sxA = sum(xA)
xN = abs(abs(x - A[0]) - sxA)
xdp = [0] * (xN + 1)
xdp[0] = 1
for dx in xA:
for i in range(xN-dx*2, -1, -1):
xdp[dx*2+i] |= xdp[i]
yA = A[1::2]
syA = sum(yA)
yN ... | ConDefects/ConDefects/Code/abc274_d/Python/46002634 |
condefects-python_data_962 | from collections import defaultdict,deque
N=int(input())
XY=[]
P=[]
for i in range(N):
x,y,p=list(map(int,input().split()))
XY.append((x,y))
P.append(p)
ok=10**9
ng=0
while abs(ok-ng)>1:
m=(ok+ng)//2
path=defaultdict(list)
for i in range(N):
p=P[i]
for j in range(N):
if i==j:
conti... | ConDefects/ConDefects/Code/abc257_d/Python/45255202 |
condefects-python_data_963 | n=int(input())
pp=[]
for i in range(n):
x,y,p=map(int,input().split())
pp.append((x,y,p))
from collections import deque
def bfs(node,s):
used=[False]*n
d=deque()
d.append(node)
used[node]=True
while d:
tmp=d.popleft()
p=s*pp[tmp][2]
for i in range(n):
if ... | ConDefects/ConDefects/Code/abc257_d/Python/46215877 |
condefects-python_data_964 | MOD = 10**9 + 7
N = int(input())
A = list(map(int, input().split()))
dp = [1] + [0]*2000
res = [0]*21
for a in A:
ndp = dp.copy()
for s in range(-1000, 1001):
if s == 0: continue
ns = s + a
if -1000 <= ns <= 1000:
ndp[ns] += dp[s]
ndp[ns] %= MOD
for s in range(-10, 10):
if s == 0: co... | ConDefects/ConDefects/Code/arc180_c/Python/55021276 |
condefects-python_data_965 | N = int(input())
A = input()
count = 0
for i in range(2*N-2):
if A[i] == A[i+2]:
count += 1
print(count)
N = int(input())
A = list(map(int,input().split()))
count = 0
for i in range(2*N-2):
if A[i] == A[i+2]:
count += 1
print(count) | ConDefects/ConDefects/Code/abc359_b/Python/55032387 |
condefects-python_data_966 | n = int(input())
A = list(map(int, input().split()))
count = 0
for i in range(1, n*2-1):
if A[i-1] == A[i+1]:
count =+ 1
print(count)
n = int(input())
A = list(map(int, input().split()))
count = 0
for i in range(1, n*2-1):
if A[i-1] == A[i+1]:
count += 1
print(count) | ConDefects/ConDefects/Code/abc359_b/Python/55042277 |
condefects-python_data_967 | import sys
input = sys.stdin.readline
n = int(input().rstrip())
arr = list(map(int, input().rstrip().split()))
res = 0
for i in range(n-2):
if arr[i+2] == arr[i]: res += 1
print(res)
import sys
input = sys.stdin.readline
n = int(input().rstrip())
arr = list(map(int, input().rstrip().split()))
res = 0
for i in r... | ConDefects/ConDefects/Code/abc359_b/Python/55035410 |
condefects-python_data_968 | from itertools import accumulate
class RepeatingSequence:
def __init__(self, head, cycle, tail, repeat):
self.head = head
self.cycle = cycle
self.tail = tail
self.repeat = repeat
self.head_cumsums = None
self.cycle_cumsums = None
self.tail_cumsums = None
... | ConDefects/ConDefects/Code/abc300_f/Python/45343856 |
condefects-python_data_969 | N,M,K=list(map(int, input().split()))
S=input()
Sa=[0]
for i in range(N):
a=0
if S[i]=="x":
a=1
Sa.append(Sa[-1]+a)
t=Sa[-1]
ans=0
for i in range(N):
ok=-1
ng=M*N
while abs(ok-ng)>1:
c=(ok+ng)//2
total=0
total+=(c//N)*t
total+=Sa[(c%N)]
total-=Sa[... | ConDefects/ConDefects/Code/abc300_f/Python/45923968 |
condefects-python_data_970 | import sys
# import math
# from bisect import *
# from collections import *
# from functools import *
# from heapq import *
# from itertools import *
# from random import *
# from string import *
# from types import GeneratorType
# region fastio
input = lambda: sys.stdin.readline().rstrip()
sint = lambda: int(input()... | ConDefects/ConDefects/Code/abc300_f/Python/45080334 |
condefects-python_data_971 |
n,m,k = map(int, input().split())
s = input()
li = [0 for i in range(n+1)]
for i in range(1, n+1):
c = s[i-1]
li[i] += li[i-1]
if c == "x":
li[i] += 1
xcnt = li[-1]
ans = -1
for l in range(n):
ok = 1
ng = n*m - l
while abs(ok-ng) > 1:
mid = (ok+ng)//2
# ... | ConDefects/ConDefects/Code/abc300_f/Python/45435689 |
condefects-python_data_972 | def II() : return int(input())
def MI() : return map(int,input().split())
def MS() : return map(str,input().split())
def LMI() : return list(MI())
def LMS() : return list(MS())
def LLI(N) : return [LMI() for _ in range(N)]
def LLS(N): return [LMS() for _ in range(N)]
def LS(N) : return [input() for _ in range(N)]
def L... | ConDefects/ConDefects/Code/abc300_f/Python/45948997 |
condefects-python_data_973 | import sys
sys.setrecursionlimit(10**9)
def dfs(u):
tmp = 1
for v in G[u]:
if not used[v]:
used[v] = 1
tmp += dfs(v)
used[v] = 0
return tmp
n, m = map(int, input().split())
G = [[] for _ in range(n)]
for _ in range(m):
u, v = map(int, input().split())
... | ConDefects/ConDefects/Code/abc284_e/Python/45459162 |
condefects-python_data_974 | import sys
input=sys.stdin.readline
sys.setrecursionlimit(10**7)
n,m=map(int,input().split())
L=[[] for _ in range(n)]
for _ in range(m):
u,v=map(int,input().split())
L[u-1]+=[v-1]
L[v-1]+=[u-1]
ans=0
def dfs(i,a):
global ans
ans+=1
a.add(i)
for j in L[i]:
if j not in a:
... | ConDefects/ConDefects/Code/abc284_e/Python/46171224 |
condefects-python_data_975 | from collections import defaultdict
class UnionFind():
def __init__(self, n):
self.n = n
self.root = [-1]*n
self.rank = [0]*n
def find(self, x):
if(self.root[x] < 0):
return x
else:
self.root[x] = self.find(self.root[x])
return self.r... | ConDefects/ConDefects/Code/abc269_d/Python/52213061 |
condefects-python_data_976 | import sys, random
input = lambda : sys.stdin.readline().rstrip()
write = lambda x: sys.stdout.write(x+"\n"); writef = lambda x: print("{:.12f}".format(x))
debug = lambda x: sys.stderr.write(x+"\n")
YES="Yes"; NO="No"; pans = lambda v: print(YES if v else NO); INF=10**18
LI = lambda v=0: list(map(lambda i: int(i)-v, ... | ConDefects/ConDefects/Code/arc170_d/Python/49588055 |
condefects-python_data_977 | import sys
if len(sys.argv) >= 2 and sys.argv[1] == "ONLINE_JUDGE":
import os
from cffi import FFI
ffibuilder = FFI()
current_directory = os.getcwd()
ffibuilder.cdef("""
typedef long long TYPE;
void *multiset_new();
void multiset_insert(void *obj, TYPE val);
voi... | ConDefects/ConDefects/Code/arc170_d/Python/49565151 |
condefects-python_data_978 | import sys
sys.setrecursionlimit(10**8)
from sys import stdin
#import numba as nb
#from numba import b1, i4, i8, f8
from collections import defaultdict
from collections import Counter
from collections import deque
import heapq
#import networkx as nx
from itertools import combinations,permutations
from functools import ... | ConDefects/ConDefects/Code/arc170_d/Python/49562273 |
condefects-python_data_979 | H, W, N, h, w = map(int, input().split())
A = [list(map(int, input().split())) for _ in range(H)]
ans = [[0] * (W - w + 1) for _ in range(H - h + 1)]
dic = {}
for i in range(H):
for j in range(W):
if i >= h or j >= w:
a = A[i][j]
if a in dic:
dic[a] += 1
e... | ConDefects/ConDefects/Code/abc278_e/Python/46190302 |
condefects-python_data_980 | from itertools import combinations
def solve():
N = int(input())
xs = map(int, input().split())
a = sorted(v for v in xs if v > 0)
b = sorted(v for v in xs if v < 0)
c = a[:3] + a[3:][-3:] + b[:3] + b[3:][-3:]
mx, mi = -float('inf'), float('inf')
for x, y, z in combinations(c, 3):
... | ConDefects/ConDefects/Code/arc158_b/Python/45744284 |
condefects-python_data_981 | import os
import sys
from io import BytesIO, IOBase
import bisect
BUFSIZE = 4096
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" not in file.mode
self.write = self.buffer.write... | ConDefects/ConDefects/Code/arc158_b/Python/45756800 |
condefects-python_data_982 | import bisect
N=int(input())
x=list(map(int,input().split()))
x.sort()
b=bisect.bisect(x,0)
M=x[:b]
P=x[b:]
C=[]
for i in range(len(M)):
if i<3 or len(M)-3<=i:
C.append(M[i])
for i in range(len(P)):
if i<3 or len(P)-3<=i:
C.append(P[i])
D=[]
for i in range(len(C)-2):
for j in range(i+1,le... | ConDefects/ConDefects/Code/arc158_b/Python/42045718 |
condefects-python_data_983 | n = int(input())
x = list(map(int, input().split()))
x.sort()
cand = []
def calc(i, j, k):
a, b, c = x[i], x[j], x[k]
return (a + b + c) / (a * b * c)
cand.append(calc(0, 1, 2))
cand.append(calc(0, 1, -1))
cand.append(calc(0, -1, -2))
cand.append(calc(-1, -2, -3))
print(min(cand))
print(max(cand))
n = int... | ConDefects/ConDefects/Code/arc158_b/Python/45509155 |
condefects-python_data_984 | from itertools import combinations
N = int(input())
x = list(map(int, input().split()))
x.sort()
inf = float('inf')
mx, mn = -inf, inf
if N >=6:
x = x[:3] + x[-3:]
for xi, xj, xk in combinations(x, 3):
mx = max(mx, (xi+xj+xk)/(xi*xj*xk))
mn = min(mn, (xi+xj+xk)/(xi*xj*xk))
print(mn, mx)
from itertool... | ConDefects/ConDefects/Code/arc158_b/Python/43273469 |
condefects-python_data_985 | import os,sys,math,random,threading
from copy import deepcopy
from io import BytesIO, IOBase
from types import GeneratorType
from functools import lru_cache, reduce
from bisect import bisect_left, bisect_right
from collections import Counter, defaultdict, deque
from itertools import accumulate, combinations, permutatio... | ConDefects/ConDefects/Code/abc272_f/Python/46719819 |
condefects-python_data_986 | from atcoder.string import*
I=input
n=int(I())
Y=c=0
from atcoder.string import*
I=input
n=int(I())
Y=c=0
for i in suffix_array(I()*2+'`'+I()*2+'{'):c+=i<n;Y+=c*(2*n<i<=3*n)
print(Y) | ConDefects/ConDefects/Code/abc272_f/Python/53512226 |
condefects-python_data_987 | # -*- coding: utf-8 -*-
"""
Created on Thu Jan 11 23:28:42 2024
@author: don
"""
class string:
def sa_is(s,upper):
n=len(s)
if n==0:
return []
if n==1:
return [0]
if n==2:
if (s[0]<s[1]):
return [0,1]
else:
... | ConDefects/ConDefects/Code/abc272_f/Python/49227972 |
condefects-python_data_988 | from sys import stdin
class FastIO:
def __init__(self):
self.random_seed = 0
self.flush = False
self.inf = 1 << 32
return
@staticmethod
def read_int():
return int(stdin.readline().rstrip())
@staticmethod
def read_float():
return float(stdin.readlin... | ConDefects/ConDefects/Code/abc272_f/Python/52005290 |
condefects-python_data_989 | def main():
# write code here.
N = II()
S = IS()
T = IS()
sa = sais(T*2+"z"*N+S*2)
ans=cnt=0
for elm in sa[::-1]:
if 0<=elm<N: cnt+=1
if 4*N-1<=elm<5*N-1: ans+=cnt
print(ans)
from collections import Counter
# SA-IS (O(nlogn))
# s: 文字列
def sais(s):
uniq = list... | ConDefects/ConDefects/Code/abc272_f/Python/52456403 |
condefects-python_data_990 | N,Q=map(int,input().split())
sosuu=[]
v=[0]*(10**6+1)
for i in range(2,10**6):
if v[i]==1:
continue
for j in range(2,10**6):
if i*j>10**6:
break
v[i*j]=1
for x in range(2,10**6+1):
if v[x]==0:
sosuu.append(x)
G=[[] for i in range(10**6+1)]
for x in sosuu:
for j in range(1,10**6):
if x*... | ConDefects/ConDefects/Code/abc238_g/Python/44443541 |
condefects-python_data_991 | n=int(input())
for i in range(n):
print(n-1)
print(0)
n=int(input())
for i in range(n):
print(n-i)
print(0) | ConDefects/ConDefects/Code/abc281_a/Python/45998040 |
condefects-python_data_992 | n = input()
n = int(n)
for i in range(10,-1,-1):
print(i)
n = input()
n = int(n)
for i in range(n,-1,-1):
print(i) | ConDefects/ConDefects/Code/abc281_a/Python/45244769 |
condefects-python_data_993 | from collections import Counter
N,M=map(int,input().split())
S=list(map(int,input().split()))
X=list(map(int,input().split()))
C=Counter()
A=[-10**10]
for i in range(M):
C[abs(A[0]-X[i])]+=1
for i in range(N-1):
A.append(S[i]-A[i])
for j in range(M):
C[abs(A[i+1]-X[j])]+=1
ans=0
for key,value in ... | ConDefects/ConDefects/Code/abc255_e/Python/45097288 |
condefects-python_data_994 | from collections import defaultdict
n, m = map(int, input().split())
s = list(map(int, input().split()))
scc = [s[0]]
for i in range(1, n-1):
scc.append(scc[-1]+ (-1)**(i)*s[i])
x = list(map(int, input().split()))
x = set(x)
d = defaultdict(int)
for i in range(1, n):
for j in x:
tmp = scc[i-1] + (-1)**(i)*j
... | ConDefects/ConDefects/Code/abc255_e/Python/45923403 |
condefects-python_data_995 | N = int(input())
time = [0] * (N+1)
need = [[] for _ in range(N+1)]
for i in range(1, N+1):
t, k, *A = list(map(int, input().split()))
time[i] = t
need[i] = A
ans = 0
got = set()
stack = [N]
while stack:
node = stack.pop()
got.add(node)
ans += time[node]
for n in need[node]:
if n in... | ConDefects/ConDefects/Code/abc226_c/Python/45490771 |
condefects-python_data_996 | import sys
sys.setrecursionlimit(10**8)
inf = float("INF")
from collections import deque, defaultdict, Counter
from itertools import product, combinations, permutations
from heapq import heapify, heappop, heappush
def I(): return input()
def II(): return int(input())
def IS(): return input().split()
def MII(): retu... | ConDefects/ConDefects/Code/abc226_c/Python/45711710 |
condefects-python_data_997 | N = int(input())
skill = []
for _ in range(N):
skill.append(list(map(int, input().split())))
need = [False] * N
need[N-1] = True
for i in range(N-1, -1, -1):
if need[i]:
for j in skill[i][2:]:
need[j] = True
ans = 0
for i in range(N):
if need[i]:
ans += skill[i][0]
print(ans)
... | ConDefects/ConDefects/Code/abc226_c/Python/45527659 |
condefects-python_data_998 | from sys import stdin
def input():
return stdin.readline().rstrip("\n")
def solve():
s = int(input())
if s in [1, 2, 3, 5, 7]:
print("No")
return
print("Yes")
a = (s + 1) // 2
if s % 2 == 0:
print(0, 0, a, a, a - 2, a)
else:
print(0, 0, a, a - 1, a - 1, a - 4... | ConDefects/ConDefects/Code/arc167_e/Python/46643252 |
condefects-python_data_999 | def One_Square_in_a_Triangle():
S = int(input())
if S in [1, 2, 3, 5, 7]:
return "NO"
if S == 4:
return "YES" + "\n" + "1 " + "1 " + "1 " + "3 " + "3 " + "3"
else:
a = S // 2
if S % 2 == 0:
return "YES" + "\n" + "0 " + "0 " + str(a) + " " + str(a) + "... | ConDefects/ConDefects/Code/arc167_e/Python/46646029 |
condefects-python_data_1000 | s=input()
a,b=map(int,input().split())
print(s[:a-1]+s[b-1]+s[a:b-2]+s[a-1]+s[b:])
s=input()
a,b=map(int,input().split())
print(s[:a-1]+s[b-1]+s[a:b-1]+s[a-1]+s[b:]) | ConDefects/ConDefects/Code/abc236_a/Python/45439657 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.