id stringlengths 24 27 | content stringlengths 37 384k | max_stars_repo_path stringlengths 51 51 |
|---|---|---|
condefects-python_data_501 | def main():
from sys import stdin, setrecursionlimit
# setrecursionlimit(1000000)
input = stdin.readline
def iinput(): return int(input())
def sinput(): return input().rstrip()
def i0input(): return int(input()) - 1
def linput(): return list(input().split())
def liinput(): return list(ma... | ConDefects/ConDefects/Code/agc062_c/Python/41610915 |
condefects-python_data_502 | '''
tatyamさん作の、SortedSetです。
使わせていただき、ありがとうございます！
https://github.com/tatyam-prime/SortedSet/blob/main/SortedSet.py
・使い方(個人的まとめ)
s=SortedSet()
s.a: SortedSetの中身を返す。
len(s), x in s, x not in s: リストと同じ要領で使える。
s.add(x): xを追加してTrueを返す。ただしxがすでにs内にある場合、xは追加せずにFalseを返す。
s.discard(x): xを削除してTrueを返す。ただしxがs内にない場合、何もせずにFalseを返す。
s... | ConDefects/ConDefects/Code/agc062_c/Python/41651640 |
condefects-python_data_503 | import copy
def UP(M):
New=[[0]*4 for i in range(4)]
for i in range(3):
New[i]=M[i+1].copy()
return New
def DOWN(M):
New=[[0]*4 for i in range(4)]
for i in reversed(range(1,4)):
New[i]=M[i-1].copy()
return New
def LEFT(M):
New=[[0]*4 for i in range(4)]
for i in range(4... | ConDefects/ConDefects/Code/abc322_d/Python/53313253 |
condefects-python_data_504 | import itertools
import sys
P = []
for i in range(3):
p = []
for j in range(4):
p.append(list(map(lambda x: int(x == '#'), input())))
P.append(p)
cnt = 0
for p in P:
cnt += sum(itertools.chain.from_iterable(p))
if cnt != 16:
print('No')
sys.exit()
def rotate(piece: list, n):
if n... | ConDefects/ConDefects/Code/abc322_d/Python/46190250 |
condefects-python_data_505 | n = int(input())
if n%5 ==0:
print(0)
elif n % 5 >=3:
print(n+5-n%5)
else:
print(n-n%5)
n = int(input())
if n%5 ==0:
print(n)
elif n % 5 >=3:
print(n+5-n%5)
else:
print(n-n%5) | ConDefects/ConDefects/Code/abc305_a/Python/45785540 |
condefects-python_data_506 | N=int(input())
a=N%5
if a==0:
print(N)
else:
if a <3:
ans=N-a
else:
ans=N+a-1
print(ans)
N=int(input())
a=N%5
if a==0:
print(N)
else:
if a <3:
ans=N-a
else:
ans=N+(5-a)
print(ans) | ConDefects/ConDefects/Code/abc305_a/Python/45542217 |
condefects-python_data_507 | n=int(input())
print((n//5)*5+5 if n%5>=2 else (n//5)*5)
n=int(input())
print((n//5)*5+5 if n%5>2 else (n//5)*5) | ConDefects/ConDefects/Code/abc305_a/Python/46173794 |
condefects-python_data_508 | print(abs(5-int(input())%5))
print(int((int(input())+2)/5)*5) | ConDefects/ConDefects/Code/abc305_a/Python/45768286 |
condefects-python_data_509 | n=100
if n%5<3:
ans=n-(n%5)
else:
ans=n+5-(n%5)
print(ans)
n=int(input())
if n%5<3:
ans=n-(n%5)
else:
ans=n+5-(n%5)
print(ans) | ConDefects/ConDefects/Code/abc305_a/Python/45435091 |
condefects-python_data_510 | N=int(input())
list=[]
for i in range(20):
list.append(abs(N-i*5))
In=list.index(min(list))
print(In*5)
N=int(input())
list=[]
for i in range(21):
list.append(abs(N-i*5))
In=list.index(min(list))
print(In*5) | ConDefects/ConDefects/Code/abc305_a/Python/46193789 |
condefects-python_data_511 | a = list(input())
b = list(input())
n = len(a)
m = len(b)
if n < m:
print('No')
elif n == m:
print('Yes' if a == b else 'No')
else:
for i in range(n-m):
t = a[i:i+m]
if t == b:
print('Yes')
break
else:
print('No')
a = list(input())
b = list(input())
n... | ConDefects/ConDefects/Code/abc279_b/Python/45923979 |
condefects-python_data_512 | s = input()
t = input()
if len(s) > len(t) or (len(s) == len(t) and s != t):
print("No")
exit()
else:
for i in range(len(s) - len(t) + 1):
if s[i:i+len(t)] == t:
print("Yes")
exit()
print("No")
s = input()
t = input()
if len(t) > len(s) or (len(s) == len(t) and s != t):
... | ConDefects/ConDefects/Code/abc279_b/Python/44853654 |
condefects-python_data_513 | n, m, k = map(int, input().split())
z = [[] for _ in range(n)]
for i in range(k):
p, x, q, y = [int(a) - 1 for a in input().split()]
z[p].append([x + 1, q, y + 1])
z[p].append([x + 2, q, y + 2])
z[q].append([y + 1, p, x + 1])
z[q].append([y + 2, p, x + 2])
for i in z:
i.sort(key = lambda x: -x[0])
print(i)
f = [... | ConDefects/ConDefects/Code/arc146_d/Python/34275405 |
condefects-python_data_514 | n = int(input())
results = "0"
for i in range(1, n + 1):
if i % 3 == 0:
results += "x"
else:
results += "o"
print(results)
n = int(input())
results = ""
for i in range(1, n + 1):
if i % 3 == 0:
results += "x"
else:
results += "o"
print(results) | ConDefects/ConDefects/Code/abc348_a/Python/54770076 |
condefects-python_data_515 | N = int(input())
list=[]
for i in range(N):
if (i+1) % 3 == 0:
list.append("x")
else:
list.append("o")
print(" ".join(list))
N = int(input())
list=[]
for i in range(N):
if (i+1) % 3 == 0:
list.append("x")
else:
list.append("o")
print("".join(list)) | ConDefects/ConDefects/Code/abc348_a/Python/54898289 |
condefects-python_data_516 | n=int(input())
for i in range(1, n+1):
if i*3==0:
print("x", end="")
else:
print("o", end="")
n=int(input())
for i in range(1, n+1):
if i%3==0:
print("x", end="")
else:
print("o", end="") | ConDefects/ConDefects/Code/abc348_a/Python/54752579 |
condefects-python_data_517 | n = int(input())
ans = ""
for i in range(1, n+1):
ans += 'x' if i % 3 == 0 else '○'
print(ans)
n = int(input())
ans = ""
for i in range(1, n+1):
ans += 'x' if i % 3 == 0 else 'o'
print(ans) | ConDefects/ConDefects/Code/abc348_a/Python/54751581 |
condefects-python_data_518 | from collections import deque
import sys
sys.setrecursionlimit(1000000)
input = sys.stdin.readline
class Dinic:
def __init__(self,V):
self.V = V
self.E = [[] for i in range(V)]
self.P = [0 for i in range(V)]
def add_edge(self,u,v,cap):
self.E[u].append((v,cap,self.P[v]))
self.E[v].append((u,... | ConDefects/ConDefects/Code/abc263_g/Python/49799392 |
condefects-python_data_519 | import sys
readline = sys.stdin.readline
#エラトステネスの篩と素因数分解
from collections import Counter
M = 2*10**7 + 20
prime = [0]*M
for i in range(2, M):
if prime[i]:
continue
for j in range(i, M, i):
if not prime[j]:
prime[j] = i
import collections
class Dinic:
def __init__(self, vnum)... | ConDefects/ConDefects/Code/abc263_g/Python/34042464 |
condefects-python_data_520 | def Ternary_Search_Maximize_Integer(L, R, f, arg=False):
""" 三分探索によって, 整数を定義域とする関数 f の [L,R] における最大値を求める.
f: [L,R] 内で上に凸または単調増加
"""
while (R-L)>3:
a=(2*L+R)//3
b=(L+2*R)//3
p=f(a); q=f(b)
if p>=q:
R=b
else:
L=a
a=(2*L+R)//3
b=(L+... | ConDefects/ConDefects/Code/abc263_g/Python/34500524 |
condefects-python_data_521 | import sys
input = sys.stdin.readline
def isPrime(x):
p = 2
while p * p <= x:
if x % p == 0:
return False
p += 1
return True
n = int(input())
li = [list(map(int, input().split())) for _ in range(n)]
from collections import deque
from math import inf
class Dinic:
"""
... | ConDefects/ConDefects/Code/abc263_g/Python/43726575 |
condefects-python_data_522 | n,d,p=map(int,input().split())
f=list(map(int,input().split()))
f.sort(reverse=True)
i=0
ans=0
while d*i<n:
ans+=min(p,sum(f[d*i:d*(i+1)+1]))
i+=1
print(ans)
n,d,p=map(int,input().split())
f=list(map(int,input().split()))
f.sort(reverse=True)
i=0
ans=0
while d*i<n:
ans+=min(p,sum(f[d*i:d*(i+1)]))
i+=1
... | ConDefects/ConDefects/Code/abc318_c/Python/45939362 |
condefects-python_data_523 | n,d,p=map(int,input().split())
f=list(map(int,input().split()))
f.sort(reverse=True)
ans=0
i=0
while d*i<n:
ans+=min(ans,sum(f[d*i:d*(i+1)]))
i+=1
print(ans)
n,d,p=map(int,input().split())
f=list(map(int,input().split()))
f.sort(reverse=True)
ans=0
i=0
while d*i<n:
ans+=min(p,sum(f[d*i:d*(i+1)]))
i+=1
... | ConDefects/ConDefects/Code/abc318_c/Python/45929513 |
condefects-python_data_524 | N=int(input())
from collections import *
class SegTree: #右開区間による実装
def __init__(self,init_val,segfunc,ide_ele):
n=len(init_val)
self.segfunc=segfunc
self.ide_ele=ide_ele
self.num=1<<(n-1).bit_length()
self.tree=[ide_ele]*2*self.num
for i in range(n):
self.... | ConDefects/ConDefects/Code/arc159_d/Python/41124657 |
condefects-python_data_525 | import math
from bisect import bisect_left, bisect_right
from typing import Generic, Iterable, Iterator, TypeVar, Union, List
T = TypeVar('T')
# https://github.com/tatyam-prime/SortedSet/blob/main/SortedSet.py
class SortedSet(Generic[T]):
BUCKET_RATIO = 50
REBUILD_RATIO = 170
def _build(self, a=None) -> None:
... | ConDefects/ConDefects/Code/arc159_d/Python/40430885 |
condefects-python_data_526 | class segtree:
"""It is the data structure for monoids (S, op), i.e., the algebraic structure that satisfies the following properties.
> associativity: op(op(a, b), c) = op(a, op(b, c)) for all a, b, c in S
> existence of the identity element: op(a, e) = op(e, a) = a for all a in S
Given an array... | ConDefects/ConDefects/Code/arc159_d/Python/40431476 |
condefects-python_data_527 | class SegmentTree:
# n->要素数, l->リスト, e->単位元, comp->二項関数
def __init__(self, n, l, e, comp):
self.e = e
self.comp = comp
self.length = 1 << (n - 1).bit_length()
self.tree = [self.e] * self.length + l + [self.e] * (self.length - len(l))
for i in range(self.length - 1, 0, -1)... | ConDefects/ConDefects/Code/arc159_d/Python/45445288 |
condefects-python_data_528 | n, m, t = map(int, input().split())
a = list(map(int, input().split()))
pos = 0
for i in range(m):
x, y = map(int, input().split())
t -= sum(a[pos : x - 1])
if t <= 0:
print("No")
exit()
else:
t += y
pos = x - 1
t -= sum(a[pos:])
if t < 0:
print("No")
else:
print... | ConDefects/ConDefects/Code/abc265_b/Python/45698748 |
condefects-python_data_529 | n,m,t=map(int,input().split())
a=list(map(int,input().split()))
v=[0]*n
for i in range(m):
x,y=map(int,input().split())
v[x-1]=y
for i in range(n-1):
t+=v[i]
if t>i:
t-=a[i]
else:
print('No')
break
else:
print('Yes')
n,m,t=map(int,input().split())
a=list(map(int,input().split()))
v=[0... | ConDefects/ConDefects/Code/abc265_b/Python/45498956 |
condefects-python_data_530 | from collections import defaultdict
N, M, T = map(int, input().split())
A = list(map(int, input().split()))
XY = [list(map(int, input().split())) for _ in range(M)]
d = defaultdict(int)
for x, y in XY:
d[x] = y
now = 1
while now != N:
T -= A[now-1]
now += 1
if T < 0:
print('No')
exit... | ConDefects/ConDefects/Code/abc265_b/Python/45288123 |
condefects-python_data_531 | N, M, T = map(int, input().split())
A = list(map(int, input().split()))
B = []
for i in range(M):
B.append(tuple(map(int, input().split())))
from collections import deque
queA = deque(A)
B.sort(key=lambda x: x[0])
queB = deque(B)
ans = "Yes"
nowT = T
nowP = 1
S = set([row[0] for row in B])
# print(S)
for i in ran... | ConDefects/ConDefects/Code/abc265_b/Python/46016041 |
condefects-python_data_532 | N,M,T=list(map(int, input().split()))
A=list(map(int, input().split()))
d={}
for _ in range(M):
x,y=list(map(int, input().split()))
d[x]=y
for i in range(N-1):
if i+1 in d:
T+=d[i+1]
if A[i]>T:
print("No")
exit()
T-=A[i]
print("Yes")
N,M,T=list(map(int, input().spl... | ConDefects/ConDefects/Code/abc265_b/Python/46056659 |
condefects-python_data_533 | import sys
sys.setrecursionlimit(10 ** 5 + 10000)
# sys.setrecursionlimit(10**6)
input = sys.stdin.readline ####
def int1(x): return int(x) - 1
def II(): return int(input())
def MI(): return map(int, input().split())
def MI1(): return map(int1, input().split())
def LI(): return list(map(int, input().split()))
def LI... | ConDefects/ConDefects/Code/abc265_b/Python/45798886 |
condefects-python_data_534 | n,m,t=map(int,input().split())
s=list(map(int,input().split()))
dic=dict()
for i in range(m):
a,b=map(int,input().split())
dic[a]=b
for now in range(1,n):
if t-s[now-1]<0:
print("No")
exit()
else:
t-=s[now-1]
if now+1 in dic:
t+=dic[now+1]
print("Yes")
n,m... | ConDefects/ConDefects/Code/abc265_b/Python/45487693 |
condefects-python_data_535 | import copy
import itertools
n, m = map(int, input().split())
g1 = [[0 for _ in range(n)] for _ in range(n)]
for _ in range(m):
u, v = map(int, input().split())
g1[u - 1][v - 1] = 1
g2 = [[0 for _ in range(n)] for _ in range(n)]
for _ in range(m):
u, v = map(int, input().split())
g2[u - 1][v - 1] = 1... | ConDefects/ConDefects/Code/abc232_c/Python/44881913 |
condefects-python_data_536 |
def I(m):
M = [[0]*2 for _ in range(m)]
for i in range(m):
x, y = map(int, input().split())
M[i][0], M[i][1] = x-1, y-1
return M
import itertools
n,m = map(int,input().split())
if m==0:
print('Yes')
exit()
Takahashi, Aoki = I(m), I(m)
l = itertools.permutations(list(range(n))... | ConDefects/ConDefects/Code/abc232_c/Python/44874195 |
condefects-python_data_537 | def dfs(pos, seki, n, x, a):
global ans
if pos == n:
if seki == x:
ans += 1
return
for c in a[pos]:
if seki > x / c:
continue
dfs(pos+1, seki*c, n, x, a)
n, x = map(int, input().split())
L = []
a = []
for _ in range(n):
ball = list(map(int, inpu... | ConDefects/ConDefects/Code/abc233_c/Python/45317107 |
condefects-python_data_538 | l,n1,n2=map(int,input().split())
vl1=[list(map(int,input().split())) for _ in range(n1)]
vl2=[list(map(int,input().split())) for _ in range(n2)]
acc1,acc2=[0]*(n1+1),[0]*(n2+1)
for i in range(n1):
acc1[i+1]=acc1[i]+vl1[i][1]
for i in range(n2):
acc2[i+1]=acc2[i]+vl2[i][1]
print(vl1,vl2,sep='\n')
print(acc1,acc2,se... | ConDefects/ConDefects/Code/abc294_e/Python/51921412 |
condefects-python_data_539 | # import系 ---
from more_itertools import distinct_permutations
# 入力用 ---
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()))
LI_DEC = lambda: list(map(lambda x: int(x) - 1, input().split()))
LS = lamb... | ConDefects/ConDefects/Code/abc293_c/Python/45502821 |
condefects-python_data_540 | #!/usr/bin/env python3
def r(a):
a = a[::-1]
a = list(map(list, zip(*a)))
return a
n = int(input())
a = [list(input().split()) for _ in range(n)]
b = [list(input().split()) for _ in range(n)]
f = True
for _ in range(3):
a = r(a)
f = True
for al, bl in zip(a, b):
for av, bv in zip(a... | ConDefects/ConDefects/Code/abc298_b/Python/45491531 |
condefects-python_data_541 | import copy
n = int(input())
a = [input().split() for _ in range(n)]
b = [input().split() for _ in range(n)]
def is_same(m):
for i in range(n):
for j in range(n):
if m[i][j] != '1':
continue
if m[i][j] != b[i][j]:
return False
return True
d... | ConDefects/ConDefects/Code/abc298_b/Python/45279577 |
condefects-python_data_542 | # B
n = int(input())
a = []
for _ in range(n):
cur_a = list(map(int, input().split()))
a.append(cur_a)
b = []
for _ in range(n):
cur_b = list(map(int, input().split()))
b.append(cur_b)
'''
n = 3
a = [[0, 1, 1], [1, 0, 0], [0, 1, 0]]
b = [[1, 1, 0], [0, 0, 1], [1, 1, 1]]
'''
'''
n = 5
a = [[0, 0, 1, 1,... | ConDefects/ConDefects/Code/abc298_b/Python/45996525 |
condefects-python_data_543 | N = int(input())
A = [list(map(int, input().split())) for _ in range(N)]
B = [list(map(int, input().split())) for _ in range(N)]
A_t = A
l = 0
for i in range(3):
#print(A_t)
for j in range(N):
for k in range(N):
if (A_t[j][k] == 1) and (B[j][k] != 1):
#print(A_t[j][k],B[j][k] )
l += 1... | ConDefects/ConDefects/Code/abc298_b/Python/45483068 |
condefects-python_data_544 | n,a,b=map(int,input().split())
ans = [[] for _ in range(a*n)]
for i in range(a*n):
for j in range(b*n):
if ((i//a)%2==0 and (j//b)%2==0) or ((i//a)%2!=0 and (j//b)%2!=0):
ans[i].append('.')
else:
ans[i].append('#')
for i in range(a*n):
print(*ans[i])
n,a,b=map(int,input... | ConDefects/ConDefects/Code/abc250_b/Python/45692958 |
condefects-python_data_545 | N, M, v = map(int,input().split())
I = [[] for _ in range(2*N)]
R = [[] for _ in range(2*N)]
D = [0] * (2*N)
for _ in range(M):
a, b, c = map(int,input().split())
a -= 1
b -= 1
I[a].append((b + N, c))
I[a + N].append((b, c))
R[b].append((a + N, c))
R[b + N].append((a, c))
D[a] += 1
D[a+N] += 1
inf ... | ConDefects/ConDefects/Code/abc261_h/Python/33475139 |
condefects-python_data_546 | 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 : list(map(int, input().split()));... | ConDefects/ConDefects/Code/abc261_h/Python/37948163 |
condefects-python_data_547 | from heapq import heappop, heappush
n, m, s = map(int, input().split())
s -= 1
rev_g = [[] for _ in range(n)]
deg = [0] * n
for _ in range(m):
a, b, c = map(int, input().split())
a -= 1
b -= 1
rev_g[b].append((a, c))
deg[a] += 1
inf = 1 << 31
que_t = []
que_a = []
dp_t = [inf] * n
dp_a = [inf] * n... | ConDefects/ConDefects/Code/abc261_h/Python/48707102 |
condefects-python_data_548 | N, M = map(int, input().split())
P = [0] * N
for _ in range(M):
a, b = map(int, input().split())
a -= 1
b -= 1
P[b] += 1
ans = []
for i in range(N):
if P[i] == 0:
ans.append(i)
if len(ans) == 1:
print(ans[0])
else:
print(-1)
N, M = map(int, input().split())
P = [0] * N
for _ in... | ConDefects/ConDefects/Code/abc313_b/Python/45739272 |
condefects-python_data_549 | N,M = map(int, input().split())
A = []
B = []
for _ in range(M):
A_,B_ = map(int, input().split())
A.append(A_)
B.append(B_)
res = [0]*N
for i in range(M):
res[B[i]-1] = 1
if res.count(0) == 1:
print(A[res.index(0)])
else:
print(-1)
N,M = map(int, input().split())
A = []
B = []
for _ in range... | ConDefects/ConDefects/Code/abc313_b/Python/45757869 |
condefects-python_data_550 | N, M = map(int, input().split())
flag = [1] * N
for i in range(M):
a, b = map(int, input().split())
flag[b-1] = 0
if sum(flag) == 1:
print(flag.index(1))
else:
print(-1)
N, M = map(int, input().split())
flag = [1] * N
for i in range(M):
a, b = map(int, input().split())
flag[b-1] = 0
... | ConDefects/ConDefects/Code/abc313_b/Python/46182815 |
condefects-python_data_551 | #最強の人を求めればいいだけなので、誰かに負けたかどうかを調べる
#負けたことがない人が複数人いたら最強は絞れない
N,M=list(map(int,input().split()))
player=[i for i in range(1,N+1)]
for i in range(M):
a,b=list(map(int,input().split()))
if b in player:
player.remove(b)
if player.count==1:
print(player[0])
else:
print(-1)
#最強の人を求めればいいだけなので、誰かに負けたかどうか... | ConDefects/ConDefects/Code/abc313_b/Python/45889938 |
condefects-python_data_552 | n,m=map(int,input().split())
lst=[True]*(n+1);lst[0]=False
for i in range(m):
a,b=map(int,input().split())
lst[b]=False
print(-1 if sum(lst[1:])!=1 else lst.count(1))
# print(lst)
n,m=map(int,input().split())
lst=[True]*(n+1);lst[0]=False
for i in range(m):
a,b=map(int,input().split())
lst[b]=False
print(-1 if ... | ConDefects/ConDefects/Code/abc313_b/Python/45691967 |
condefects-python_data_553 | import sys
import numpy as np
readline = sys.stdin.readline
N = int(input())
xy = np.array([list(map(int, readline().split())) for _ in range(N)])
dxdy = np.diff(xy, axis=0, append=[xy[0]])
coef = np.array([dxdy[:, 1], -dxdy[:, 0]]).T
cons = np.sum(coef * xy, axis=1, keepdims=True)
M = int(input())
uv = np.array([l... | ConDefects/ConDefects/Code/abc251_g/Python/31757947 |
condefects-python_data_554 | INF=pow(2,61)-1
N=int(input())
dot=[tuple(map(int,input().split())) for i in range(N)]
dot.append(dot[-1])
M=int(input())
move=[tuple(map(int,input().split())) for i in range(M)]
line=[]
for i in range(N):
maxi=-INF
a=0
b=0
for u,v in move:
x1=dot[i][0]+u
y1=dot[i][1]+v
x2=dot[i+... | ConDefects/ConDefects/Code/abc251_g/Python/46368168 |
condefects-python_data_555 | INF = 10 ** 18
N = int(input())
P = [tuple(map(int, input().split())) for _ in range(N)]
M = int(input())
move = [tuple(map(int, input().split())) for _ in range(M)]
lines = []
def intercept(dx, dy, x, y):
if dx == 0: return x
return dx * y - x * dy
for i in range(N):
x1, y1 = P[i]
x2, y2 = P[(i + 1) ... | ConDefects/ConDefects/Code/abc251_g/Python/31752648 |
condefects-python_data_556 | def g_intersection_of_polygons(INF=float('inf')):
N = int(input())
Points = [[int(col) for col in input().split()] for row in range(N)]
Points.append(Points[0])
M = int(input())
Moves = [[int(col) for col in input().split()] for row in range(M)]
Q = int(input())
Queries = [complex(*[int(col)... | ConDefects/ConDefects/Code/abc251_g/Python/40927285 |
condefects-python_data_557 | from scipy.optimize import minimize
from math import sqrt
N = int(input())
segments = [tuple(map(int, input().split())) for i in range(N)]
def f(param):
x, y = param
ret = 0
for a, b, c, d in segments:
if (a - c) * (a - x) + (b - d) * (b - y) < 0:
ret = max(ret, sqrt((a - x) ** 2 + (b ... | ConDefects/ConDefects/Code/abc314_h/Python/44593278 |
condefects-python_data_558 | from collections import defaultdict
import math
import sys
sys.setrecursionlimit(790000)
class UnionFind:
def __init__(self, N):
self.par = list(range(N))
self.g = [[] for i in range(N)]
def root(self, x):
if self.par[x] == x:
return x
self.par[x] = self.root(self... | ConDefects/ConDefects/Code/abc350_d/Python/54866820 |
condefects-python_data_559 | N=int(input())
A=list(map(int,input().split()))
Ada=[]
for i in range(N):
Ada.append(A[i])
while True:
if len(Ada)==1:
break
if Ada[-1]!=Ada[-2]:
break
else:
d1=Ada.pop()
d2=Ada.pop()
Ada.append(d1+1)
print(Ada)
N=int(input())
... | ConDefects/ConDefects/Code/abc351_c/Python/54893576 |
condefects-python_data_560 | n = int(input())
A = list(map(int, input().split()))
ans = []
for i in range(n):
tmp = A[i]
ans.append(tmp)
while True:
if len(ans) == 1:
break
elif ans[-1] != ans[-2]:
break
bai = ans.pop() + 1
ans.pop()
ans.append(bai)
print(ans)
print(... | ConDefects/ConDefects/Code/abc351_c/Python/55122758 |
condefects-python_data_561 | from collections import deque
def solve_C():
n = int(input())
a = list(map(int, input().split()))
global dq
dq = deque()
def add(n):
global dq
if len(dq) == 0:
dq.append(n)
return
most_left = dq.pop()
if n == most_left:
a... | ConDefects/ConDefects/Code/abc351_c/Python/54968121 |
condefects-python_data_562 | from collections import deque
n = int(input())
input_list = [int(x) for x in input().split(' ')]
tfe = deque()
temp = None
for x in input_list:
temp = x
if tfe and tfe[-1] == temp:
while tfe and tfe[-1] == temp:
temp += 1
tfe.pop()
else:
tfe.append(temp)
... | ConDefects/ConDefects/Code/abc351_c/Python/54982997 |
condefects-python_data_563 | def main() -> None:
n: int = int(input())
d: dict[int, int] = dict.fromkeys(range(2 * n + 1), 0)
a: list[int] = list(map(int, input().split()))
for i, ai in enumerate(a):
d[(i + 1) * 2] = d[ai] + 1
d[(i + 1) * 2 + 1] = d[ai] + 1
for i in d.values():
print(i)
main()
def ma... | ConDefects/ConDefects/Code/abc274_c/Python/52979754 |
condefects-python_data_564 | MOD=10**9+7
n = int(input())
s = input()
ans=1
cnt=0
for i in range(n):
cnt+=1
if i==n-1 or s[i]==s[i+1]:
ans*=cnt//2
ans%=MOD
cnt=0
print(ans%MOD)
MOD=10**9+7
n = int(input())
s = input()
ans=1
cnt=0
for i in range(n):
cnt+=1
if i==n-1 or s[i]==s[i+1]:
ans*=-(-cnt//2)
... | ConDefects/ConDefects/Code/arc180_a/Python/55032207 |
condefects-python_data_565 | n = int(input())
s = list(input())
for i in range(n):
if i % 2 == 0:
if s[i] == 'A':
s[i] = 'B'
else:
s[i] = 'A'
print(s)
L = []
cur = s[0]
cnt = 0
for si in s:
if si == cur:
cnt += 1
else:
cur = si
L.append(cnt)
cnt = 1
L.append(cnt)
... | ConDefects/ConDefects/Code/arc180_a/Python/55032077 |
condefects-python_data_566 | from itertools import groupby
N = int(input())
S = list(input())
mod = 998244353
for i in range(0, N, 2):
if S[i] == "A":
S[i] = "B"
else:
S[i] = "A"
RLE = [(k, len(list(v))) for k, v in groupby(S)]
ans = 1
for s, cnt in RLE:
ans *= (cnt+1)//2
ans %= mod
print(ans)
from itertools impor... | ConDefects/ConDefects/Code/arc180_a/Python/55121294 |
condefects-python_data_567 | n,m,k=list(map(int,input().split()))
nums1=[]
nums2=[]
for i in range(n):
nums1.append(list(map(int,input().split())))
for i in range(m):
nums2.append(list(map(int,input().split())))
l=0
r=1
while True:
mid=(l+r)/2
temp1=[]
temp2=[]
for i in range(n):
temp1.append(nums1[i][0]-(num... | ConDefects/ConDefects/Code/abc294_f/Python/46857187 |
condefects-python_data_568 | N,M,K=map(int,input().split())
Tak=[list(map(int,input().split())) for i in range(N)]
Ao=[list(map(int,input().split())) for i in range(M)]
from bisect import *
def is_ok(x):
X=x/100
Ao2=[-Ao[i][0]+X*(Ao[i][0]+Ao[i][1]) for i in range(M)]
Ao2.sort()
count=0
for i in range(N):
now=Tak[i][0]-... | ConDefects/ConDefects/Code/abc294_f/Python/47413656 |
condefects-python_data_569 | def main():
from fractions import Fraction
from bisect import bisect_left, bisect_right, insort
N, M, K = map(int, input().split())
AB = [tuple(map(int, input().split())) for _ in range(N)]
CD = [tuple(map(int, input().split())) for _ in range(M)]
def is_ok(X: Fraction):
p, q = X.as_integer_r... | ConDefects/ConDefects/Code/abc294_f/Python/53961424 |
condefects-python_data_570 | from random import randint, shuffle
from math import gcd, log2, log, sqrt
from fractions import Fraction
from bisect import bisect_left, bisect_right
from itertools import accumulate, permutations, combinations, product, chain
from sortedcontainers import SortedList
from collections import Counter, deque, defaultdict a... | ConDefects/ConDefects/Code/abc294_f/Python/49343974 |
condefects-python_data_571 | N = int(input())
A = list(map(int, input().split()))
B = list(set(A))
A.sort()
B.sort()
for i in range(4*N-1):
if A[i] != B[i//4]:
print(A[i])
exit()
print(A[-1])
N = int(input())
A = list(map(int, input().split()))
B = list(set(A))
A.sort()
B.sort()
for i in range(4*N-1):
if A[i] != B[i//4]:
print(A[i]-1)
... | ConDefects/ConDefects/Code/abc236_b/Python/45474387 |
condefects-python_data_572 | from collections import Counter
n = int(input())
A = input().replace(' ', '')
c = Counter(A)
print(c.most_common()[-1][0])
from collections import Counter
n = int(input())
A = list(map(int, input().split()))
c = Counter(A)
print(c.most_common()[-1][0])
| ConDefects/ConDefects/Code/abc236_b/Python/46220986 |
condefects-python_data_573 | import bisect
n, m = map(int,input().split())
A = sorted(map(int,input().split()))
print(A)
ans = 0
for i in range(n):
ans = max(ans, bisect.bisect_left(A, A[i] + m) - i)
print(bisect.bisect_left(A, A[i] + m) - i)
print(ans)
import bisect
n, m = map(int,input().split())
A = sorted(map(int,input().split()))... | ConDefects/ConDefects/Code/abc326_c/Python/54400118 |
condefects-python_data_574 | N, M = map(int,input().split())
A = list(map(int,input().split()))
A.sort()
res = 0
r = 0
for l in range(0, N):
while True:
if r < N - 1 and A[r + 1] - A[l] < M : r += 1
else : break
res = max(res, r - l)
print(res)
N, M = map(int,input().split())
A = list(map(int,input().split()))
A.sort()
res = 0
r = 0... | ConDefects/ConDefects/Code/abc326_c/Python/54412817 |
condefects-python_data_575 | def main():
N,M=map(int,input().split())
A=list(map(int,input().split()))
A.sort()
B=[]
for n in range(N-1):
B.append(A[n+1]-A[n])
kyori=0
kazu=1
i=0
ans=0
for b in B:
kyori+=b
kazu+=1
if kyori>=M:
while kyori>=M:
... | ConDefects/ConDefects/Code/abc326_c/Python/54454360 |
condefects-python_data_576 | import bisect
n,m=map(int,input().split())
a=list(map(int,input().split()))
a.sort()
ans=0
for i in range(n):
ans=max(ans,bisect.bisect_left(a,a[i]+m)-1)
print(ans)
import bisect
n,m=map(int,input().split())
a=list(map(int,input().split()))
a.sort()
ans=0
for i in range(n):
ans=max(ans,bisect.bisect_left(a,a[i... | ConDefects/ConDefects/Code/abc326_c/Python/54306688 |
condefects-python_data_577 | n,m = map(int,input().split())
A = list(map(int,input().split()))
A.sort()
j = 0
ans = 0
for i in range(n-1):
x = A[i] + m
while j < n and A[j] < x:
ans = max(ans,j-i+1)
j += 1
print(ans)
n,m = map(int,input().split())
A = list(map(int,input().split()))
A.sort()
j = 0
ans = 0
for i in ... | ConDefects/ConDefects/Code/abc326_c/Python/54687593 |
condefects-python_data_578 | N = int(input())
# N = 8
# M = (N - 1).bitlength()
# i番目(0-indexed)の人はiビット目が立つ番号のジュースのみ飲む
# i番目の人がお腹を壊した = 腐ったワインの番号のiビット目は立っている
# 0: 1, 3, 5, 7
# 1: 2, 3, 6, 7
# 2: 4, 5, 6, 7
M = (N - 1).bit_length()
Q = [[] for _ in range(M)]
for bit in range(1, N + 1):
for i in range(M):
if (bit >> i) & 1:
... | ConDefects/ConDefects/Code/abc337_e/Python/53945275 |
condefects-python_data_579 | from collections import defaultdict, deque, Counter
from sortedcontainers import SortedSet, SortedList, SortedDict
from heapq import heappush, heappop
from atcoder.dsu import DSU
from atcoder.segtree import SegTree
# st = SegTree(lambda dt1,dt2: データ参照, 単位元, 元データ)
from atcoder.lazysegtree import LazySegTree
# lst = Lazy... | ConDefects/ConDefects/Code/abc337_e/Python/53462087 |
condefects-python_data_580 | N = int(input())
n = 1
while n**2<N:n+=1
out = [[i+1 for i in range(N) if (1<<b)&i] for b in range(n)]
print(len(out),flush=True)
for q in out:
print(len(q),*q,flush=True)
ret = [*map(int,input())]
ans = 1
for n in range(len(ret)):
if ret[n]==1 : ans += 1<<n
print(ans,flush=True)
N = int(input())
n = 1
while 2**n<... | ConDefects/ConDefects/Code/abc337_e/Python/54032860 |
condefects-python_data_581 | 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
hash_mod = 2147483647
dpos4 = ((1, 0), (0, 1), (-1, 0), (0, -1))
dpos8 = ((0, -1), (1, -1), (1, 0), (1, 1), (0, 1), (-1, 1), (-1, 0), (-1, -... | ConDefects/ConDefects/Code/abc337_e/Python/53016983 |
condefects-python_data_582 | import sys
from array import array
input = lambda: sys.stdin.buffer.readline().decode().rstrip()
inp = lambda dtype: [dtype(x) for x in input().split()]
debug = lambda *x: print(*x, file=sys.stderr)
sum_n = lambda n: (n * (n + 1)) // 2
get_bit = lambda x, i: (x >> i) & 1
get_col = lambda arr, i: [row[i] for row in arr... | ConDefects/ConDefects/Code/abc337_e/Python/55158609 |
condefects-python_data_583 | n = int(input())
print("Yes" if n > 2 else "No")
n = int(input())
print("No" if 2 <= n <= 4 else "Yes") | ConDefects/ConDefects/Code/abc238_a/Python/46161245 |
condefects-python_data_584 | import math
n=int(input())
if n>5:
print("Yes")
else:
print("No")
import math
n=int(input())
if n>4 or n==1:
print("Yes")
else:
print("No") | ConDefects/ConDefects/Code/abc238_a/Python/44611745 |
condefects-python_data_585 | n = int(input())
if n**2 > 2**n:
print("Yes")
else:
print("No")
n = int(input())
if 2**n > n**2:
print("Yes")
else:
print("No")
| ConDefects/ConDefects/Code/abc238_a/Python/45742753 |
condefects-python_data_586 | n = int(input())
if n == 2 or n == 3:
print("No")
else:
print("Yes")
n = int(input())
if n == 2 or n == 3 or n == 4:
print("No")
else:
print("Yes") | ConDefects/ConDefects/Code/abc238_a/Python/45663153 |
condefects-python_data_587 | N = int(input())
if 2**N>N:
print("Yes")
else:
print("No")
N = int(input())
if 2**N>N**2:
print("Yes")
else:
print("No") | ConDefects/ConDefects/Code/abc238_a/Python/45742740 |
condefects-python_data_588 | N = int(input())
if N > 4:
print("Yes")
else:
print("No")
N = int(input())
if N > 4 or N == 1:
print("Yes")
else:
print("No") | ConDefects/ConDefects/Code/abc238_a/Python/45807737 |
condefects-python_data_589 | n = int(input())
if n >= 5:
print("Yes")
else:
print("No")
n = int(input())
if n >= 5 or n == 1:
print("Yes")
else:
print("No") | ConDefects/ConDefects/Code/abc238_a/Python/45016565 |
condefects-python_data_590 | # 278a
n, k = map(int, input().split())
li = list(map(int, input().split()))
for i in range(k):
li.pop(0)
li.append(0)
print(li)
# 278a
n, k = map(int, input().split())
li = list(map(int, input().split()))
for i in range(k):
li.pop(0)
li.append(0)
print(*li) | ConDefects/ConDefects/Code/abc278_a/Python/45019575 |
condefects-python_data_591 | # coding: utf-8
from functools import partial
try:
dummy = src
rl = partial(src.pop, 0)
except NameError:
rl = input
def ints():
return list(map(int, rl().strip().split()))
def int1():
return int(rl().strip())
#@psecs
def main():
n, k = ints()
aa = ints()
print(locals())
if n ... | ConDefects/ConDefects/Code/abc278_a/Python/45577064 |
condefects-python_data_592 | def main():
N, K = map(int, input().split())
A = list(map(int, input().split()))
if N <= K:
print(*([0] * N))
else:
print(*(A[K:] + [0] * (N - K + 1)))
if __name__ == "__main__":
main()
def main():
N, K = map(int, input().split())
A = list(map(int, input().split()))
i... | ConDefects/ConDefects/Code/abc278_a/Python/46183354 |
condefects-python_data_593 | a, b = map(int, input().split())
while a > 0 and b > 0:
if (a % 10) + (b % 10) >= 10:
print("Hard")
break
a //= 10
b //= 10
print("Easy")
a, b = map(int, input().split())
while a > 0 and b > 0:
if (a % 10) + (b % 10) >= 10:
print("Hard")
exit()
a //= 10
b //= ... | ConDefects/ConDefects/Code/abc229_b/Python/45280624 |
condefects-python_data_594 | import sys
a, b = input().split()
n = min(len(a), len(b))
for i in range(1, n):
if int(a[-i])+int(b[-i]) > 9:
print("Hard")
sys.exit()
print("Easy")
import sys
a, b = input().split()
n = min(len(a), len(b))
for i in range(1, n+1):
if int(a[-i])+int(b[-i]) > 9:
print("Hard")
... | ConDefects/ConDefects/Code/abc229_b/Python/44815699 |
condefects-python_data_595 | import heapq
n,k = map(int, input().split())
P = list(map(int, input().split()))
q = P[:k]
heapq.heapify(q)
print(q)
a = heapq.heappop(q)
prev = a
print(a)
for i in range(k,n):
heapq.heappush(q, P[i])
a = heapq.heappop(q)
if prev < a:
prev = a
print(a)
else:
print(prev)
import heapq
n,k = map(int... | ConDefects/ConDefects/Code/abc234_d/Python/54691667 |
condefects-python_data_596 | num = 3*10**6 + 1
frac = [1] * num
inv_frac = [1] * num
MOD = 998244353
for i in range(2, num):
frac[i] = (frac[i-1] * i) % MOD
inv_frac[-1] = pow(frac[-1], MOD-2, MOD)
for i in range(num-1, 0, -1):
inv_frac[i-1] = (inv_frac[i] * i) % MOD
def comb(n, r):
if r < 0 or r > n:
return 0
return... | ConDefects/ConDefects/Code/abc266_g/Python/44683031 |
condefects-python_data_597 | n=int(input())
a=list(map(int,input().split()))
t=[]
for i in a:
if len(t)==0 or t[-1][0]!=i:
t.append([i,1])
else:
t[-1][1]+=1
mx0=0
mx1=0
c0=0
c1=1
ind0=0
ind1=0
for i in range(n):
c0=max(c0,0)
c1=max(c1,0)
if a[i]==0:
c0+=1
c1-=1
else:
c1+=1
c0-... | ConDefects/ConDefects/Code/arc137_b/Python/44650081 |
condefects-python_data_598 | import math
C = 12800000
h = int(input())
print(math.sqrt(h + (h + C)))
import math
C = 12800000
h = int(input())
print(math.sqrt(h * (h + C))) | ConDefects/ConDefects/Code/abc239_a/Python/46183850 |
condefects-python_data_599 | h=int(input())
a=(h*(12800000+h))**(1//2)
print(a)
h=int(input())
a=(h*(12800000+h))**(0.5)
print(a) | ConDefects/ConDefects/Code/abc239_a/Python/45076480 |
condefects-python_data_600 | H = int(input())
print((H*(12800000+H))*0.5)
H = int(input())
print((H*(12800000+H))**0.5) | ConDefects/ConDefects/Code/abc239_a/Python/45807134 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.