id stringlengths 24 27 | content stringlengths 37 384k | max_stars_repo_path stringlengths 51 51 |
|---|---|---|
condefects-python_data_2501 | s = input()
if s.islower():
print("No")
exit()
for i in range(1, len(s) - 1):
if s[i].isupper():
print("No")
exit()
print("Yes")
s = input()
if s.islower():
print("No")
exit()
for i in range(1, len(s)):
if s[i].isupper():
print("No")
exit()
print("Yes")
| ConDefects/ConDefects/Code/abc338_a/Python/54889106 |
condefects-python_data_2502 | S = input()
C = S[0]
D = S[1:]
ans = True
if C.isupper() and D.islower() or len(S) == 1:
print("Yes")
else:
print("No")
S = input()
C = S[0]
D = S[1:]
ans = True
if C.isupper() and (len(S) == 1 or D.islower()):
print("Yes")
else:
print("No") | ConDefects/ConDefects/Code/abc338_a/Python/54630438 |
condefects-python_data_2503 | S = input()
if S[0].isupper():
if (len(S)>= 2 and S[1:].islower()) or len(S) == 1:
print("Yes")
else:
print("No")
S = input()
if S[0].isupper():
if (len(S)>= 2 and S[1:].islower()) or len(S) == 1:
print("Yes")
else:
print("No")
else:
print("No") | ConDefects/ConDefects/Code/abc338_a/Python/55016820 |
condefects-python_data_2504 | def remove_str(input_str):
result = input_str.replace('a', '').replace('e', '').replace('o', '')
return result
s = input()
s_result = remove_str(s)
print(s_result)
def remove_str(input_str):
result = input_str.replace('a', '').replace('e', '').replace('i', '').replace('o', '').replace('u', '')
return ... | ConDefects/ConDefects/Code/abc315_a/Python/46129092 |
condefects-python_data_2505 | S = input()
List = list(S)
result = [i for i in List if i != 'a' and i != 'i' and i != 'u' and i != 'e' and i != 'o']
print(result)
S = input()
List = list(S)
result = [i for i in List if i != 'a' and i != 'i' and i != 'u' and i != 'e' and i != 'o']
print(''.join(result)) | ConDefects/ConDefects/Code/abc315_a/Python/46159521 |
condefects-python_data_2506 | import re
re.sub("a|e|i|o|u", "", input())
import re
print(re.sub("a|e|i|o|u", "", input())) | ConDefects/ConDefects/Code/abc315_a/Python/46219249 |
condefects-python_data_2507 | from collections import defaultdict
H, W = map(int, input().split())
C = [list(input()) for _ in range(H)]
G = defaultdict(list)
for i in range(H):
for j in range(W):
if C[i][j] == "." and i + 1 <= H - 1:
if C[i + 1][j] == ".":
G[(i, j)].append((i + 1, j))
if C[i][j] ==... | ConDefects/ConDefects/Code/abc232_d/Python/45343318 |
condefects-python_data_2508 | h, w = map(int, input().split())
c = [input() for i in range(h)]
s = [[0] * w for i in range(h)]
s[0][0] = 1
ans = 1
for i in range(h):
for j in range(w):
if c[i][j] == '#' or i == j == 0:
continue
if i == 0 and j > 0:
s[i][j] = s[i][j-1]+1
elif i > 0 and j == 0:... | ConDefects/ConDefects/Code/abc232_d/Python/44805380 |
condefects-python_data_2509 | # -*- coding: utf-8 -*-
def main():
import sys
from collections import deque
from typing import Any, List, Tuple
input = sys.stdin.readline
h, w = map(int, input().split())
c = [list(input().rstrip()) for _ in range(h)]
sy, sx = 0, 0
def bfs_for_grid(
grid: List[List[Any]], ... | ConDefects/ConDefects/Code/abc232_d/Python/45267327 |
condefects-python_data_2510 | from collections import deque
h,w = map(int, input().split())
mp = [list(input()) for i in range(h)]
Q = deque()
root = [[-1]* w for i in range(h)]
dist = [(0, 1), (0, -1), (1, 0), (-1, 0)]
cnt = 0
Q.append((0,0))
root[0][0] = 0
while Q:
y, x = Q.popleft()
for dy, dx in dist:
y2 = y + dy
x2 = x + dx
if ... | ConDefects/ConDefects/Code/abc232_d/Python/45068396 |
condefects-python_data_2511 | # import pypyjit;pypyjit.set_param("max_unroll_recursion=-1")
# from bisect import *
# from collections import *
# from heapq import *
# from itertools import *
# from math import *
# from datetime import *
# from decimal import * # PyPyだと遅い
# from string import ascii_lowercase,ascii_uppercase
# import numpy as np
imp... | ConDefects/ConDefects/Code/abc232_d/Python/45266728 |
condefects-python_data_2512 | H,W=map(int,input().split())
dp=[[-10**10]*W for i in range(H)]
S=[input() for i in range(H)]
dp[0][0]=1
for i in range(H):
for j in range(W):
if S[i][j]=='.':
dp[i][j]=max(dp[i][j],dp[i-1][j]+1,dp[i][j-1]+1)
result=0
for i in range(H):
w=max(dp[i])
result=max(result,w)
print(result)
H,W=map(int,input(... | ConDefects/ConDefects/Code/abc232_d/Python/45266729 |
condefects-python_data_2513 | from collections import deque
H,W = map(int,input().split())
C = [input() for _ in range(H)]
dxs = [0,1]
dys = [1,0]
que = deque()
que.append((0,0))
dis = [[-1]*W for _ in range(H)]
dis[0][0]=1
ans = 0
while que:
y,x = que.popleft()
for dy,dx in zip(dys,dxs):
ny = y+dy
nx = x+dx
if n... | ConDefects/ConDefects/Code/abc232_d/Python/45499422 |
condefects-python_data_2514 | N, M = map(int, input().split())
p = list(map(int, input().split())) if M > 0 else []
graph = ""
for i in range(1, N+1):
node = str(i)
graph += node + ("v" if i in p else ",")
result = []
for subgraph in graph.split(","):
result += sorted(subgraph.split("v"), reverse=True)
print(*result)
N, M = map(int... | ConDefects/ConDefects/Code/abc289_b/Python/44836694 |
condefects-python_data_2515 | # InlineImporter
import os as _os
import sys as _sys
from functools import lru_cache as _lru_cache
from importlib.abc import ExecutionLoader, MetaPathFinder
from importlib.machinery import ModuleSpec
class InlineImporter(ExecutionLoader, MetaPathFinder):
version = None
inlined_modules = {}
namespace_pack... | ConDefects/ConDefects/Code/abc308_g/Python/43737866 |
condefects-python_data_2516 | T = int(input())
INF = float("inf")
def check(a,b,c):
if abs(a-b) % 3 == 0:
d = abs(a-b) // 3
if d <= c:
return max(a,b)
return INF
for t in range(T):
R, G, B = map(int, input().split())
ans = []
if R==G or G==B or B==R:
rgb = sorted([R,G,B])
print(rgb[1])
else:
ans.append( check(... | ConDefects/ConDefects/Code/arc128_b/Python/38862798 |
condefects-python_data_2517 | # B - Balls of Three Colors
MAX = 10 ** 8
def solve(r, g, b):
def solve1(other1, other2):
diff = other1 - other2
if diff % 3 != 0:
return MAX
return other2 + diff
ans = MAX
ans = min(ans, solve1(max(g, b), min(g, b)))
ans = min(ans, solve1(max(r, b), min(r, b))... | ConDefects/ConDefects/Code/arc128_b/Python/42302488 |
condefects-python_data_2518 | from math import gcd
import sys
input = sys.stdin.readline
inf = float('inf')
def read(dtype=int):
return list(map(dtype, input().split()))
t = int(input())
def diff(a):
return [a[1]-a[0], a[2]-a[1], a[0]-a[2]]
n = 3
for _ in range(t):
a = read()
ans = inf
for i in range(3):
x = (i-1... | ConDefects/ConDefects/Code/arc128_b/Python/40706832 |
condefects-python_data_2519 | n = int(input())
for i in range(n):
l = list(map(int,input().split()))
if len(set(l)) <= 2:
if l.count(l[0]) != 1:
print(l[0])
elif l.count(l[1]) != 1:
print(l[1])
else:
lm = [min(l[0],l[1]),min(l[0],l[2]),min(l[2],l[1])]
ls = [abs(l[0]-l[1]),abs(l[0]-l[2]),abs(l[2]-l[1])]
lp = [i%... | ConDefects/ConDefects/Code/arc128_b/Python/40552495 |
condefects-python_data_2520 | T = int(input())
def calc(a,b,c):
a,b = max(a,b), min(a,b)
if a == b:
# 成功
return a
elif (a - b) % 3 == 0 and (a-b)//3 <= c:
return a
else:
return -1
for _ in range(T):
R, G, B = [int(x) for x in input().split()]
l = [
calc(R,G,B),
calc(R,B,G),
... | ConDefects/ConDefects/Code/arc128_b/Python/37620333 |
condefects-python_data_2521 | import bisect
from collections import deque
def solveLIS(lst):
if lst == []:
return 0
LIS = [lst[0]]
ex = []
for i in range(len(lst)):
if lst[i] > LIS[-1]:
ex.append(len(LIS))
LIS.append(lst[i])
else:
x = bisect.bisect_left(LIS,lst... | ConDefects/ConDefects/Code/abc360_g/Python/55104573 |
condefects-python_data_2522 | from bisect import*
B=bisect_left
N,*A=map(int,open(0).read().split())
o=[1]*N
F=1<<60
A=A+[-F]
for k in[-1,1]:
d=[F]*N
for i in range(N):o[i]+=B(d,A[i+k]-k);d[B(d,A[i])]=A[i]
o=o[::-1];A=[-e for e in A][~0:0:-1];A+=F,
print(max(o))
from bisect import*
B=bisect_left
N,*A=map(int,open(0).read().split())
o=[1]*N
F=1<... | ConDefects/ConDefects/Code/abc360_g/Python/55136355 |
condefects-python_data_2523 | from atcoder.segtree import SegTree
n = int(input())
alist = list(map(int, input().split()))
se = set([0])
uplim = pow(10,9)
se.add(uplim)
for a in alist:
se.add(a)
# if a < uplim:
se.add(a+1)
# if a > 1:
# se.add(a-1)
so = sorted(se)
dic = {v:i for i,v in enumerate(so)}
zatu = [dic[a] for... | ConDefects/ConDefects/Code/abc360_g/Python/55112153 |
condefects-python_data_2524 | import sys
readline = sys.stdin.readline
#n = int(readline())
#*a, = map(int,readline().split())
# b = [list(map(int,readline().split())) for _ in range()]
n = int(readline())
*a, = map(int,readline().split())
"""
dp[i] = a[i] の左隣に仕切りを入れたときの積の和
q に保持する情報：
(val, dp[prev])
"""
MOD = 998244353
qM = []
qm = []
m = M = 0... | ConDefects/ConDefects/Code/abc234_g/Python/43173883 |
condefects-python_data_2525 | t=int(input())
for i in range(t):
n=int(input())
s=list(map(str,input()))
cnt=0
adj=0
for i in range(n):
if(s[i]=='1'):
cnt+=1
if(s[i-1]=='1'):
adj=1
else:
adj=0
if(cnt%2==1):
print(-1)
else:
if(cnt==2 and adj==1):
if(n==2 or n==3):
print(-1)
... | ConDefects/ConDefects/Code/arc156_a/Python/45004259 |
condefects-python_data_2526 | import sys
# from collections import deque
input = sys.stdin.readline
# sys.setrecursionlimit(10**6)
############ ---- Input Functions ---- ############
def inp():
return int(input())
def inlt():
return list(map(int, input().split()))
def insr():
s = input()
return list(s[: len(s) - 1])
def invr(... | ConDefects/ConDefects/Code/arc156_a/Python/45086330 |
condefects-python_data_2527 | t=int(input())
for _ in range(t):
n=int(input())
s=input()
L=[]
p=[]
w2=0
no_w2=0
num_1=0
for i in range(n):
if s[i]=="1":
p.append(1)
num_1+=1
else:
if len(p)==2:
L.append(p)
p=[]
w2+=1
if len(p)!=0:
L.append(p)
p=[]
no_w2+... | ConDefects/ConDefects/Code/arc156_a/Python/43775294 |
condefects-python_data_2528 | #コーディングはこのセルで
from collections import deque,defaultdict
from fractions import Fraction
from itertools import permutations
from functools import cmp_to_key
import math,sys,heapq,random,bisect,copy
def LMI() : return list(map(int,input().split()))
def LMS() : return list(map(str,input().split()))
def MI() : return map(in... | ConDefects/ConDefects/Code/arc156_a/Python/44009597 |
condefects-python_data_2529 | n, k = map(int, input().split())
a = list(map(int, input().split()))
for i in range(n):
if a[i]%k==0:
print(a[i]/k, end=" ")
n, k = map(int, input().split())
a = list(map(int, input().split()))
for i in range(n):
if a[i]%k==0:
print(int(a[i]/k), end=" ") | ConDefects/ConDefects/Code/abc347_a/Python/54752692 |
condefects-python_data_2530 | N,K = map(int,input().split())
A = list(map(int,input().split()))
for i in range(N):
if A[i]%K == 0:
print(A[i]/K)
N,K = map(int,input().split())
A = list(map(int,input().split()))
for i in range(N):
if A[i]%K == 0:
print(A[i]//K,end=" ") | ConDefects/ConDefects/Code/abc347_a/Python/55038235 |
condefects-python_data_2531 | n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
b = []
for i in range(n):
if a[i] % k == 0:
c = a[i] / k
b.append(c)
sorted_b = sorted(b)
print(" ".join(map(str, sorted_b)))
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
b = []
for i in range(... | ConDefects/ConDefects/Code/abc347_a/Python/54976417 |
condefects-python_data_2532 | N,K = map(int,input().split())
A = list(map(int,input().split()))
B = list()
for i in A:
if i%K==0:
B.append(i//K)
B.sort()
for i in B:
print(i,end="")
N,K = map(int,input().split())
A = list(map(int,input().split()))
B = list()
for i in A:
if i%K==0:
B.append(i//K)
B.sort()
for i in B:
... | ConDefects/ConDefects/Code/abc347_a/Python/54997243 |
condefects-python_data_2533 | n, k = map(int, input().split())
a = list(map(int, input().split()))
ans = []
for i in range(n):
if a[i] % k == 0:
ans.append(a[i]//2)
print(*ans)
n, k = map(int, input().split())
a = list(map(int, input().split()))
ans = []
for i in range(n):
if a[i] % k == 0:
ans.append(a[i]//k)
print(*ans) | ConDefects/ConDefects/Code/abc347_a/Python/54768582 |
condefects-python_data_2534 | n, k = map(int, input().split())
a = list(map(int, input().split()))
b = []
for i in range(n):
if a[i] % k == 0:
b.append(a[i] / k)
b.sort()
print(*b)
n, k = map(int, input().split())
a = list(map(int, input().split()))
b = []
for i in range(n):
if a[i] % k == 0:
b.append(a[i]//k)
b.sort()
print(*b... | ConDefects/ConDefects/Code/abc347_a/Python/54735895 |
condefects-python_data_2535 | n,m=map(int,input().split())
A=list(map(int,input().split()))
li=list(sorted(A[2:]))
ans=10**18
for i in range(2,n-m+1):
ans=min(ans,max(0,A[0]-A[i])+max(0,A[i+m-1]-A[1]))
print(ans)
n,m=map(int,input().split())
A=list(map(int,input().split()))
li=list(sorted(A[2:]))
ans=10**18
for i in range(2,n-m+1):
ans=min(... | ConDefects/ConDefects/Code/arc163_b/Python/44451318 |
condefects-python_data_2536 | #from collections import defaultdict
#d = defaultdict(int)
#from collections import deque
#import math
#import heapq
#from queue import Queue
#import numpy as np
#Mo=998244353
#t=input()
#n=int(input())
#l,r = list(input().split())
n,m=list(map(int, input().split()))
A = list(map(int, input().split()))
#a= [int(input(... | ConDefects/ConDefects/Code/arc163_b/Python/43944210 |
condefects-python_data_2537 | import sys
def favorite_game(N, M, A):
lower_start, upper_start = min(A[0], A[1]), max(A[0], A[1])
B = sorted(A[2:])
min_move = float("inf")
for left in range(len(B) - M + 1):
right = left + M - 1
lower = B[left]
upper = B[right]
move = 0
if lower < lower_start:... | ConDefects/ConDefects/Code/arc163_b/Python/43716281 |
condefects-python_data_2538 | n, m = map(int, input().split())
a1, a2, *a = list(map(int, input().split()))
a.sort()
ans = 10**20
for i in range(n-2):
if i+m-1 > n-3:
break
pre = max((a1 - a[0]), 0) + max(a[i+m-1] - a2, 0)
ans = min(ans, pre)
print(ans)
n, m = map(int, input().split())
a1, a2, *a = list(map(int, input()... | ConDefects/ConDefects/Code/arc163_b/Python/45704677 |
condefects-python_data_2539 | ROOT = 3
MOD = 998244353
roots = [pow(ROOT,(MOD-1)>>i,MOD) for i in range(24)] # 1 の 2^i 乗根
iroots = [pow(x,MOD-2,MOD) for x in roots] # 1 の 2^i 乗根の逆元
def untt(a,n):
for i in range(n):
m = 1<<(n-i-1)
for s in range(1<<i):
w_N = 1
s *= m*2
for p in range(m):
... | ConDefects/ConDefects/Code/abc289_h/Python/43246591 |
condefects-python_data_2540 | from atcoder.scc import*
N,*A=map(int,open(0).read().split())
G=SCCGraph(N)
for i in range(N):
G.add_edge(i,A[i]-1)
d=[0]*N
for g in G.scc()[::-1]:
for v in g:d[v]=len(g)*-~d[A[g[0]]-1]
print(sum(d))
from atcoder.scc import*
N,*A=map(int,open(0).read().split())
G=SCCGraph(N)
for i in range(N):
G.add_edge(i,A[i]-1)
... | ConDefects/ConDefects/Code/abc357_e/Python/54953956 |
condefects-python_data_2541 | #!/usr/bin/env python
import os
import sys
from io import BytesIO, IOBase
def main():
n, m = map(int,input().split())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
orientation = [None] * m
graph = [[] for _ in range(n)]
for i in range(m):
graph[a[i] - 1].append... | ConDefects/ConDefects/Code/arc143_d/Python/32778317 |
condefects-python_data_2542 | import sys
readline = sys.stdin.readline
#n = int(readline())
n,m = map(int,readline().split())
*a, = map(lambda x:int(x)-1,readline().split())
*b, = map(lambda x:int(x)-1,readline().split())
g = [[] for _ in range(n)]
for i in range(m):
ai = a[i]
bi = b[i]
g[ai].append((bi,i))
g[bi].append((ai,i))
d... | ConDefects/ConDefects/Code/arc143_d/Python/32782351 |
condefects-python_data_2543 | 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/arc143_d/Python/32779304 |
condefects-python_data_2544 | n, m = map(int, input().split())
a = [u - 1 for u in map(int, input().split())]
b = [u - 1 for u in map(int, input().split())]
edges = [[] for _ in range(n)]
for i in range(m):
edges[a[i]].append((b[i], i))
edges[b[i]].append((a[i], i))
# DFS
ans = [-1] * m
visited = [0] * n
for root in range(n):
if visit... | ConDefects/ConDefects/Code/arc143_d/Python/34822438 |
condefects-python_data_2545 | import sys
input = sys.stdin.readline
from collections import defaultdict
n,m = map(int,input().split())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
ans = [-1 for i in range(m)]
graph = [[] for i in range(n+1)]
for i in range(m):
ax,bx = a[i],b[i]
graph[ax].append((bx,i,0))
graph[bx].app... | ConDefects/ConDefects/Code/arc143_d/Python/32833945 |
condefects-python_data_2546 | from collections import defaultdict
def find_bridge(n, s, links, double_links, aaa, bbb, ans):
pre_order = 0
q = [s]
while q:
u = q[-1]
if status[u] < len(links[u]):
if pre[u] == -1:
pre[u] = low[u] = pre_order
pre_order += 1
v = lin... | ConDefects/ConDefects/Code/arc143_d/Python/32782502 |
condefects-python_data_2547 | H, W, N = (int(i) for i in input().split())
A = [int(i) for i in input().split()]
D = [0] * 26
for i in range(N):
D[A[i]] += 1
s = 0
for i in range(25, -1, -1):
d = (H // 2 ** i) * (W // 2 ** i)
if d - 4 * s < D[i]:
print('No')
exit()
s = D[i]
print('Yes')
H, W, N = (int(i) for i in... | ConDefects/ConDefects/Code/arc172_a/Python/54670313 |
condefects-python_data_2548 | def check(i, total):
pos = H//pow(2,i) * W//pow(2,i) * pow(2,i*2)
if pos >= total:
return True
else:
return False
H, W, N = map(int,input().split())
A = list(map(int,input().split()))
cnt = [0] * 26
for a in A:
cnt[a] += 1
total = 0
for i in range(25, -1, -1):
total += cnt[i] * pow(... | ConDefects/ConDefects/Code/arc172_a/Python/51434027 |
condefects-python_data_2549 |
ans = "Yes"
h,w,n = map(int,input().split())
a = list(map(int,input().split()))
a.sort()
a.reverse()
l =[[h,w]]
for i in range(n):
x = 2**a[i]
y = 2**a[i]
m = len(l)
for j in range(m):
s = l[j][0]
t = l[j][1]
f = 0
if x <= s and y <= t:
l.pop(j)
... | ConDefects/ConDefects/Code/arc172_a/Python/52510372 |
condefects-python_data_2550 | from collections import defaultdict
H,W,E=map(int,input().split())
A=list(map(int,input().split()))
D=defaultdict(int)
for a in A:
D[a]+=1
D=sorted(D.items(),reverse=True, key=lambda x: x[0])
#print(D)
flag=True
area=0
for a,n in D:
N=(H//(2**a))*(W//(2**a))
area+=(2**a)**2*n
#print(a,n,N,area)
if... | ConDefects/ConDefects/Code/arc172_a/Python/51757032 |
condefects-python_data_2551 | h,w,n = map(int,input().split())
a = list(map(int,input().split()))
l = [0 for i in range(26)]
for i in a:
l[i] += 1
now = 0
for i in range(24,-1,-1):
ii = 2**i
now += l[i]*(ii**2)
if now > (h//ii)*(w//ii)*(ii**2):
print("No")
exit()
print("Yes")
h,w,n = map(int,input().split())
a = list(map(i... | ConDefects/ConDefects/Code/arc172_a/Python/51114493 |
condefects-python_data_2552 | N = int(input())
A = sorted(list(map(int, input().split())), reverse=True)
print('Alice' if A[0] > A[1] +
1 else ('Alice' if (A[N - 1] - N - 1) & 1 else 'Bob'))
N = int(input())
A = sorted(list(map(int, input().split())), reverse=True)
print('Alice' if A[0] > A[1] +
1 else ('Alice' if (A[0] - N - 1) & 1 e... | ConDefects/ConDefects/Code/arc137_c/Python/30750383 |
condefects-python_data_2553 | n = int(input())
a = list(map(int, input().split()))
a = sorted(a)
max_n = a[-1]
max2_n = a[-2]
if max_n - max2_n >= 2:
print("Alice")
exit()
empty = 1 + max_n - n
if empty & 2 == 0:
print("Bob")
else:
print("Alice")
n = int(input())
a = list(map(int, input().split()))
a = sorted(a)
max_n = a[-1... | ConDefects/ConDefects/Code/arc137_c/Python/33252696 |
condefects-python_data_2554 | if __name__ == '__main__':
n = int(input())
a = list(map(int, input().split()))
x, y = a[n - 2], a[n - 1]
if x + 1 < y or (y - x) % 2 == 0:
print("Alice")
else:
print("Bob")
if __name__ == '__main__':
n = int(input())
a = list(map(int, input().split()))
x, y = a[n - 2],... | ConDefects/ConDefects/Code/arc137_c/Python/44903394 |
condefects-python_data_2555 | import sys
sys.setrecursionlimit(500005)
input = sys.stdin.readline
read_str = lambda: input().strip()
read_num = lambda: int(input())
read_nums = lambda: map(int, input().split())
read_list = lambda: list(map(int, input().split()))
N = int(3e5) + 10
mod = 998244353
def solve():
n = read_num()
nums = read_lis... | ConDefects/ConDefects/Code/arc137_c/Python/32337261 |
condefects-python_data_2556 | N = int(input())
A = list(map(int,input().split()))
if A[N-1]-A[N-2] >=2:
print("Alice")
exit()
if N%2 == A[N-1]%2:
print("Bob")
else:
print("Alice")
N = int(input())
A = list(map(int,input().split()))
if A[N-1]-A[N-2] >=2:
print("Alice")
exit()
if (N-1)%2 == A[N-1]%2:
print("Bob")
else:
... | ConDefects/ConDefects/Code/arc137_c/Python/30259633 |
condefects-python_data_2557 | def find_winner(seq):
if (max(seq) - len(seq)) % 2 == 0:
return 'Alice'
else:
return 'Bob'
n = int(input())
seq = [int(num) for num in input().split()]
print(find_winner(seq))
def find_winner(seq):
if (seq[-1] - seq[-2]) >= 2:
return 'Alice'
if (max(seq) - len(seq)) % 2 == ... | ConDefects/ConDefects/Code/arc137_c/Python/30509885 |
condefects-python_data_2558 | n = int(input())
a = list(map(int, input().split()))
a.sort()
if a[-1] - a[-2] >= 2:
print("Alice")
else:
d = sum(t-s-1 for s,t in zip(a, a[1:]))
print("Bob" if d % 2 == 0 else "Alice")
n = int(input())
a = list(map(int, input().split()))
a.sort()
if a[-1] - a[-2] >= 2:
print("Alice")
else:
d = sum(t-s-1 fo... | ConDefects/ConDefects/Code/arc137_c/Python/33142482 |
condefects-python_data_2559 | n = int(input())
As = [int(x) for x in input().split()]
if As[-1]-As[-2] > 1:
print("Alice")
else:
if As[-1]-(n-1)%2==1:
print("Alice")
else:
print("Bob")
n = int(input())
As = [int(x) for x in input().split()]
if As[-1]-As[-2] > 1:
print("Alice")
else:
if (As[-1]-(n-1))%2==1:
... | ConDefects/ConDefects/Code/arc137_c/Python/30317706 |
condefects-python_data_2560 | S, T = map(str, input().split())
for w in range(1, len(S)):
S_cut = []
for i in range(w, len(S) + 1, w):
S_cut.append(S[i - w : i])
if i + w > len(S):
S_cut.append(S[i:])
# print(S_cut)
for c in range(w):
column = ""
for s in S_cut:
if c < len(... | ConDefects/ConDefects/Code/abc360_b/Python/55141723 |
condefects-python_data_2561 | import math
s, t = input().split()
s, t = s.strip(), t.strip()
for w in range(1,len(s)):
ss = [s[w*i:w*i+w] for i in range(math.ceil(len(s)/w))]
ss[-1] += " " * (len(s) % w)
x = [*zip(*ss)]
for n in x:
if t == "".join(n).strip():
print("Yes")
exit(0)
print("No")
import... | ConDefects/ConDefects/Code/abc360_b/Python/55142362 |
condefects-python_data_2562 | import io
import sys
import itertools
import functools
import collections
import bisect
import operator
import threading
import math
import pprint
import heapq
import time
import decimal
import string
import random
sys.setrecursionlimit(3 * 10 ** 5)
INF = 10 ** 18 + 7
decimal.getcontext().prec = 18
# def testcase():... | ConDefects/ConDefects/Code/abc317_a/Python/54270366 |
condefects-python_data_2563 | from bisect import bisect_left as bis
N, H, X = map(int, input().split())
P = tuple(map(int, input().split()))
print(P[bis(P, X-H)])
from bisect import bisect_left as bis
N, H, X = map(int, input().split())
P = tuple(map(int, input().split()))
print(bis(P, X-H) + 1) | ConDefects/ConDefects/Code/abc317_a/Python/54526177 |
condefects-python_data_2564 | #0502
N, H, X = map(int, input().split())
P = list(map(int, input().split()))
for i in range(N):
if H + P[i] > X:
print(i + 1)
exit()
#0502
N, H, X = map(int, input().split())
P = list(map(int, input().split()))
for i in range(N):
if H + P[i] >= X:
print(i + 1)
exit()
| ConDefects/ConDefects/Code/abc317_a/Python/54511982 |
condefects-python_data_2565 | n,h,x = input().split()
p = input()
# print(n)
# print(h)
# print(x)
# print(p)
split_p = p.split()
list_p = list(split_p)
# print(list_p)
for i in range(0, int(n)):
# print(list_p[i])
if int(list_p[i]) >= int(x) - int(h):
print(list_p[i])
break
else:
continue
n,h,x = input().spli... | ConDefects/ConDefects/Code/abc317_a/Python/54442354 |
condefects-python_data_2566 | N,H,X=map(int,input().split())
P=list(map(int,input().split()))
ans=1
for i in range(N):
if H+P[i]<=X:
ans+=1
print(ans)
N,H,X=map(int,input().split())
P=list(map(int,input().split()))
ans=1
for i in range(N):
if H+P[i]<X:
ans+=1
print(ans) | ConDefects/ConDefects/Code/abc317_a/Python/54312125 |
condefects-python_data_2567 | N, H, X = map(int,input().split())
P = list(map(int,input().split()))
for i in range(N):
if X < H + P[i]:
print(i+1)
break
N, H, X = map(int,input().split())
P = list(map(int,input().split()))
for i in range(N):
if X <= H + P[i]:
print(i+1)
break | ConDefects/ConDefects/Code/abc317_a/Python/54736802 |
condefects-python_data_2568 | n,h,x = map(int,input().split())
l = list(map(int,input().split()))
for i in range(n):
if x >= h + l[i]:
print(i+1)
exit()
n,h,x = map(int,input().split())
l = list(map(int,input().split()))
for i in range(n):
if h + l[i] >= x:
print(i+1)
exit()
| ConDefects/ConDefects/Code/abc317_a/Python/54045407 |
condefects-python_data_2569 | N,H,X = map(int,input().split())
P = input()
P = P.split()
for i in range(N) :
PP = int(P[i])
if (X - H) < PP :
print(i+1)
break
N,H,X = map(int,input().split())
P = input()
P = P.split()
for i in range(N) :
PP = int(P[i])
if (X - H) <= PP :
print(i+1)
break | ConDefects/ConDefects/Code/abc317_a/Python/54270630 |
condefects-python_data_2570 | N, H, X = map(int, list(input().split()))
P = list(map(int, input().split()))
min_num = 999999
result = 0
for i in range(N):
if H + P[i] > X:
if min_num > H + P[i]:
min_num = H + P[i]
result = i + 1
print(result)
N, H, X = map(int, list(input().split()))
P = list(map(int, input()... | ConDefects/ConDefects/Code/abc317_a/Python/54907933 |
condefects-python_data_2571 | n, h, x = map(int, input().split())
p = list(map(int, input().split()))
for i in range(n):
if x < p[i]+h:
print(i+1)
break
n, h, x = map(int, input().split())
p = list(map(int, input().split()))
for i in range(n):
if x <= p[i]+h:
print(i+1)
break | ConDefects/ConDefects/Code/abc317_a/Python/54045054 |
condefects-python_data_2572 | s = list(input())
ans = []
for i in range(len(s)):
ans.append(s[i:len(s)]+s[0:i])
print(min(ans))
print(max(ans))
s = input()
ans = []
for i in range(len(s)):
ans.append(s[i:len(s)]+s[0:i])
print(min(ans))
print(max(ans)) | ConDefects/ConDefects/Code/abc223_b/Python/52785305 |
condefects-python_data_2573 | S = input()
words = [S]
for i in range(len(S)-1):
words.append(S[i:] + S[:i])
words = sorted(words)
print(words[0])
print(words[-1])
S = input()
words = [S]
for i in range(len(S)):
words.append(S[i:] + S[:i])
words = sorted(words)
print(words[0])
print(words[-1]) | ConDefects/ConDefects/Code/abc223_b/Python/53513467 |
condefects-python_data_2574 | s = input()
min_,max_ = s,s
for i in range(1,len(s)):
if min_>s[i:]+s[:i]:
min_ = s[i:]+s[:i]
else:
max_ = s[i:]+s[:i]
print(min_)
print(max_)
s = input()
min_,max_ = s,s
for i in range(1,len(s)):
if min_>s[i:]+s[:i]:
min_ = s[i:]+s[:i]
if max_<s[i:]+s[:i]:
max_ = s[i:]+s[:i]
print(min_)
print(... | ConDefects/ConDefects/Code/abc223_b/Python/53267282 |
condefects-python_data_2575 | N = int(input())
Arr = list(map(int, input().split()))
print([n for n in Arr if n % 2 == 0])
N = int(input())
Arr = list(map(int, input().split()))
print(" ".join([str(n) for n in Arr if n % 2 == 0])) | ConDefects/ConDefects/Code/abc294_a/Python/45787578 |
condefects-python_data_2576 | n = int(input())
a = list(map(int,input().split()))
x = []
for i in range(n):
if a[i] % 2 ==0:
x.append(a[i])
print(x)
n = int(input())
a = list(map(int,input().split()))
x = []
for i in range(n):
if a[i] % 2 ==0:
x.append(a[i])
print(*x,sep = ' ') | ConDefects/ConDefects/Code/abc294_a/Python/45789682 |
condefects-python_data_2577 | n = int(input())
carp = [["#"]]
for k in range(1, n + 1):
tmp = []
for _ in range(3):
for c in carp[k - 1]:
tmp.append(c * 3)
tmp = list(map(list, tmp))
cen = 3**k // 2
diff = 3 ** (k - 1) // 2
for i in range(3**k):
for j in range(3**k):
if cen - diff <... | ConDefects/ConDefects/Code/abc357_c/Python/55043182 |
condefects-python_data_2578 | import numpy as np
def center(size, l, x, y):
for i in range(size):
for j in range(size):
l[i+size+x][j+size+y] = '.'
n = int(input())
size = 3**n
size_low = 3**(n-1)
l0 = np.array([
['#', '#', '#'],
['#', '.', '#'],
['#', '#', '#']
])
lk = [['#' for i in range(size)] for j in range(size)]
if n... | ConDefects/ConDefects/Code/abc357_c/Python/55000126 |
condefects-python_data_2579 | Datos = input()
Data = [int (num) for num in Datos.split()]
if Data[0]*2==Data[1] or (Data[1]*2)+1==Data[1]:
print("Yes")
else:
print("No")
Datos = input()
Data = [int (num) for num in Datos.split()]
if Data[0]*2==Data[1] or (Data[0]*2)+1==Data[1]:
print("Yes")
else:
print("No")
| ConDefects/ConDefects/Code/abc285_a/Python/46015071 |
condefects-python_data_2580 | a = input()
one = int(a.split()[0]);
two = int(a.split()[1]);
if two/2 == one:
print("Yes");
else:
print("No")
a = input()
one = int(a.split()[0]);
two = int(a.split()[1]);
if two//2 == one:
print("Yes");
else:
print("No") | ConDefects/ConDefects/Code/abc285_a/Python/45555418 |
condefects-python_data_2581 | # a = int(input())
# b = input()
a, b = map(int, input().split())
# l = list(map(int, input().split()))
# l = [input() for _ in range(a)]
# l = [list(map(int, input().split())) for _ in range(a)]
if b % 2 <= 1:
print("Yes")
else:
print("No")
# a = int(input())
# b = input()
a, b = map(int, input().split())
#... | ConDefects/ConDefects/Code/abc285_a/Python/45976942 |
condefects-python_data_2582 | import sys
import heapq
input = sys.stdin.readline
def miss():
return map(int,input().split())
def lmiss():
return list(map(int,input().split()))
def ii():
return int(input())
def li():
return list(input())
N, K = miss()
A = lmiss()
A.sort()
ans = set()
next = A.copy()
flag = set()
heapq.heapify(next)
w... | ConDefects/ConDefects/Code/abc297_e/Python/46054755 |
condefects-python_data_2583 | from heapq import heappush, heappop
n, k = map(int,input().split())
A = list(map(int,input().split()))
hq = []
ans = set()
for a in A:
heappush(hq, a)
ans.add(a)
for _ in range(k):
u = heappop(hq)
print(u)
for a in A:
if u + a not in ans:
heappush(hq, u+a)
ans.add(... | ConDefects/ConDefects/Code/abc297_e/Python/46197532 |
condefects-python_data_2584 | s = list(input())
big = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
small = "abcdefghijklmnopqrstuvwxyz"
isBig = False
isSmall = False
isDifferent = True
for i in range(len(s)):
if(s[i] in big):
isBig = True
if(s[i] in small):
isSmall = True
if(isBig and isSmall):
break
if(s.count(s[i]) > 1):
... | ConDefects/ConDefects/Code/abc249_b/Python/45657791 |
condefects-python_data_2585 | S=input()
if S.upper()!=S and S.lower()!=S and set(list(S))==len(S):
print("Yes")
else:
print("No")
S=input()
if S.upper()!=S and S.lower()!=S and len(set(list(S)))==len(S):
print("Yes")
else:
print("No") | ConDefects/ConDefects/Code/abc249_b/Python/45037515 |
condefects-python_data_2586 | n = int(input())
a = list(map(int,input().split()))
imos = [0]*(n+1)
for i in range(n):
imos[0] += a[i]
imos[i+1] -= a[i]
for i in range(n):
imos[i+1] += imos[i]
ans = [0]*n
if imos[0] != 0:
r = 0
for i in range(1,n):
r += imos[i]*abs(imos[0])
ans[i] = abs(imos[0])
ans[0] = -r//imos[0]
for i in ra... | ConDefects/ConDefects/Code/arc153_c/Python/41497158 |
condefects-python_data_2587 | import re
import functools
import random
import sys
import os
import math
from collections import Counter, defaultdict, deque
from functools import lru_cache, reduce, cmp_to_key
from itertools import accumulate, combinations, permutations
from heapq import nsmallest, nlargest, heappushpop, heapify, heappop, heappush
fr... | ConDefects/ConDefects/Code/arc153_c/Python/38644891 |
condefects-python_data_2588 | import sys
import itertools
def input():
return sys.stdin.readline().rstrip()
def main():
n = int(input())
a = list(map(int, input().split()))
b = list(range(n))
pre = list(itertools.accumulate(a, initial=0))
def success():
print("Yes")
print(*b)
total = sum(i*a[i] for... | ConDefects/ConDefects/Code/arc153_c/Python/38524622 |
condefects-python_data_2589 |
from collections import deque, defaultdict, Counter
Q = int(input())
num = 1
dq = deque([1])
MOD = 998244353
ans = []
pow10 = []
p = 1
for i in range(600001):
pow10.append(p)
p = (p*10)%MOD
for _ in range(Q):
q = input().split()
if q[0]=="1":
t = int(q[1])
num = (num*10 + t) % MOD
dq.append(t)
elif q[0]==... | ConDefects/ConDefects/Code/abc298_d/Python/45550904 |
condefects-python_data_2590 | from collections import deque
Q = int(input())
q = [list(map(int, input().split())) for _ in range(Q)]
MOD = 998244353
def mod_pow(x, n, mod):
result = 1
base = x
while n > 0:
if n % 2 == 1:
result = (result * base) % mod
base = (base * base) % mod
n = n // 2
return... | ConDefects/ConDefects/Code/abc298_d/Python/45710768 |
condefects-python_data_2591 | X = int(input())
if X == 0:
print("No")
elif X < 100:
print("No")
elif X%100 == 0:
print("Yes")
X = int(input())
if X == 0:
print("No")
elif X < 100:
print("No")
elif X%100 != 0:
print("No")
elif X%100 == 0:
print("Yes")
| ConDefects/ConDefects/Code/abc223_a/Python/45815037 |
condefects-python_data_2592 | n=int(input())
if n<100:
print("No")
else:
print("Yes")
n=int(input())
if n<100 or n%100!=0:
print("No")
else:
print("Yes") | ConDefects/ConDefects/Code/abc223_a/Python/45813374 |
condefects-python_data_2593 | x = int(input())
print('Yes' if x%100==0 else 'No')
x = int(input())
print('Yes' if x%100==0 and x!=0 else 'No') | ConDefects/ConDefects/Code/abc223_a/Python/45714918 |
condefects-python_data_2594 | import heapq
N = int(input())
Vs = list()
Es = list()
inf = 10 **10
for i in range(1, N):
Vs.append([i, inf])
Ai, Bi, Xi = map(int, input().split())
Es.append([i+i, Ai, Xi, Bi])
Vs.append([N, inf])
Vs[0][1] = 0
U = []
heapq.heappush(U, (Vs[0][1], Vs[0]))
now = heapq.heappop(U)[1]
while now[0] != N:
i ... | ConDefects/ConDefects/Code/abc340_d/Python/54249756 |
condefects-python_data_2595 | # import pypyjit
# pypyjit.set_param('max_unroll_recursion=-1')
# import sys
# sys.setrecursionlimit(10**7)
import re
# import more_itertools
import functools
import sys
import bisect
import math
import itertools
from collections import deque
from collections import defaultdict
from collections import Counter
from copy... | ConDefects/ConDefects/Code/abc340_d/Python/54442427 |
condefects-python_data_2596 | from collections import defaultdict
import heapq
N = int(input())
G = defaultdict(list)
for i in range(1,N):
a,b,x = map(int,input().split())
G[i].append((i+1,a))
G[i].append((x,b))
seen = [False] * (N+1)
dist = [10**10] * (N+1)
dist[1] = 0
q = [(0,1)]
heapq.heapify(q)
while(len(q)>0):
v = heapq.heap... | ConDefects/ConDefects/Code/abc340_d/Python/55038628 |
condefects-python_data_2597 | n=int(input())
p=[tuple(map(int,input().split())) for i in range(n)]
l=[p[i-1]+p[i] for i in range(n)]
s=tuple(map(int,input().split()))
g=tuple(map(int,input().split()))
p+=[s]
p+=[g]
p.sort()
def calc(a,c,b):
ax,ay=a
bx,by=b
cx,cy=c
return (ax-cx)*(by-cy)-(ay-cy)*(bx-cx)
c1=[]
for i in range(len(p)):
whil... | ConDefects/ConDefects/Code/abc286_h/Python/46785855 |
condefects-python_data_2598 | def resolve():
import sys
input = sys.stdin.readline
MOD = 998244353
INF = float("inf")
n = int(input())
points = [tuple(map(int, input().split())) for _ in range(n)]
s = tuple(map(int, input().split()))
t = tuple(map(int, input().split()))
edges = [[] for _ in range(n + 2)]
is_... | ConDefects/ConDefects/Code/abc286_h/Python/38346885 |
condefects-python_data_2599 | print("ABCDEFGHIJKLMNOPQRSTUVWZ"[:int(input())])
print("ABCDEFGHIJKLMNOPQRSTUVWXYZ"[:int(input())]) | ConDefects/ConDefects/Code/abc282_a/Python/45264195 |
condefects-python_data_2600 | k = input()
a = "ABCDEFG"
s = a[:int(k)]
print(s)
k = input()
a = "ABCDEFGHIJKLMNOPQRSTUVWXYZ"
s = a[:int(k)]
print(s) | ConDefects/ConDefects/Code/abc282_a/Python/45920464 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.