id stringlengths 24 27 | content stringlengths 37 384k | max_stars_repo_path stringlengths 51 51 |
|---|---|---|
condefects-python_data_2801 | N = input()
def is321():
a = int(N[0])
for n in N[1:]:
a = int(n)
if int(n) >= a:
return "No"
return "Yes"
print(is321())
N = input()
def is321():
a = int(N[0])
for n in N[1:]:
if int(n) >= a:
return "No"
a = int(n)
return "Yes"
p... | ConDefects/ConDefects/Code/abc321_a/Python/55156013 |
condefects-python_data_2802 | n = input()
for i in range(len(n)-1):
if int(n[i]) < int(n[i+1]):
print("No")
break
else:
print("Yes")
n = input()
for i in range(len(n)-1):
if int(n[i]) <= int(n[i+1]):
print("No")
break
else:
print("Yes") | ConDefects/ConDefects/Code/abc321_a/Python/54713012 |
condefects-python_data_2803 | import bisect,collections,itertools,math,functools,heapq
import sys
# sys.setrecursionlimit(10**6)
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LF(): return list(map(float,sys.stdin.readline().rstrip().split()))
def SI(): return sys.stdin.r... | ConDefects/ConDefects/Code/abc266_d/Python/44445026 |
condefects-python_data_2804 | import random
n = 5 ** 50
for i in range(185):
s = str(random.randint(1, 9999) * n)
if i != 0: s.zfill(54)
print(s, end = "")
import random
n = 5 ** 50
for i in range(185):
s = str(random.randint(1, 9999) * n)
if i != 0: s = s.zfill(54)
print(s, end = "") | ConDefects/ConDefects/Code/agc066_b/Python/54623268 |
condefects-python_data_2805 | print("".join(str(2**i)for i in range(1,99)))
print(*[5**i for i in range(80)],sep="") | ConDefects/ConDefects/Code/agc066_b/Python/52817133 |
condefects-python_data_2806 | for i in range(1,50):
print(i*(5**50),end='')
print()
for i in range(1,200):
print(i*(5**50),end='')
print() | ConDefects/ConDefects/Code/agc066_b/Python/53808375 |
condefects-python_data_2807 | print("3552713678800500929355621337890625000000000000000000000000000000000000000000000000000000000000000017408297026122454553842544555664062500000000000000000000000000000000000000000000000000000000000000041815439999481895938515663146972656250000000000000000000000000000000000000000000000000000000000000065792704617706476... | ConDefects/ConDefects/Code/agc066_b/Python/53429642 |
condefects-python_data_2808 | import sys
sys.set_int_max_str_digits(200000)
u = int("5"*2+"0"*59)
num = ""
for i in range(1,59):
num += (str(u//(2**i)))*(i//9+1 if i>30 else 1)
num = int(num)
# print(len(str(num)))
def dsum(num): return sum(map(int,str(num)))
s = dsum(num)
for _ in range(50):
num *= 2
t = dsum(num)
if s < t: pr... | ConDefects/ConDefects/Code/agc066_b/Python/52816712 |
condefects-python_data_2809 | from sys import setrecursionlimit, stdin
setrecursionlimit(10**6); readline = stdin.readline
M998 = 998244353; M007 = 10**9+7; INF = 10**18
mulint = lambda: map(int, readline().split()); anint = lambda: int(readline())
astr = lambda: readline().rstrip()
from bisect import bisect_right
N, K = mulint()
A = list(mulint()... | ConDefects/ConDefects/Code/arc138_a/Python/43171788 |
condefects-python_data_2810 | n,k=map(int,input().split())
a=list(map(int,input().split()))
st=set()
t=[]
if min(a[:k])>=max(a[k:]):
print(-1)
exit()
for i in range(k,n):
if a[i]in st:continue
st.add(a[i])
t.append((a[i],i))
import bisect
ans=10**20
# print(t)
for i in range(k):
p=bisect.bisect_right(t,(a[i],10**10))
# print(p)
try:... | ConDefects/ConDefects/Code/arc138_a/Python/43653769 |
condefects-python_data_2811 | N,K=map(int,input().split())
A=list(map(int,input().split()))
p=[]
for i in range(N):
p.append([A[i],-i])
Maxsuu=-1
p.sort()
ans=10**10
for a,i in p:
i*=-1
if i>K and Maxsuu !=-1:
ans=min(ans,i-Maxsuu)
elif K>i:
Maxsuu=max(Maxsuu,i)
print(ans if ans!=10**10 else -1)
N,K=map(int,i... | ConDefects/ConDefects/Code/arc138_a/Python/45103354 |
condefects-python_data_2812 | N, K = map(int, input().split())
A = list(map(int, input().split()))
B = []
for i, a in enumerate(A):
B.append((a, i))
B.sort()
INF = N + 10
ans = INF
now = -1
for a, i in B:
if i < K:
now = max(now, i)
else:
if now >= 0:
ans = min(ans, i - now)
if ans == INF:
print(-1)
else:... | ConDefects/ConDefects/Code/arc138_a/Python/45121816 |
condefects-python_data_2813 | import sys
sys.setrecursionlimit(10**9)
def main():
N, K = map(int, input().split())
A = list(map(int, input().split()))
AA = [(a, i) for i, a in enumerate(A)]
A1, A2 = AA[:K], AA[K:]
A1.sort()
A2.sort()
D = [N for _ in range(len(A2) + 1)]
for i, (a, j) in enumerate(reversed(A2)):
... | ConDefects/ConDefects/Code/arc138_a/Python/45260317 |
condefects-python_data_2814 | def solve(N, K, A):
ans = 10 ** 9
ls = [(A[i], -i) for i in range(N)]
ls.sort()
j = None
for ai, mi in ls:
i = -mi
if i >= K:
if j and A[j] < ai:
ans = min(i - j, ans)
else:
if j: j = max(i, j)
else: j = i
if ans > 10 ** 8:
return -1
else:
return ans
N, K = [... | ConDefects/ConDefects/Code/arc138_a/Python/41328369 |
condefects-python_data_2815 | def btw(lf,ri):
return ri*(ri-1)//2-lf*(lf-1)//2
N,H=map(int,input().split())
spell=[tuple(map(int,input().split())) for i in range(N)]
spell.sort(reverse=True,key=lambda x:x[::-1])
use=[spell[0]+(1,)]
for i in range(1,N):
if use[-1][0]*use[-1][1]>spell[i][0]*spell[i][1]:
continue
use.append(spell[i... | ConDefects/ConDefects/Code/abc303_f/Python/51957402 |
condefects-python_data_2816 | from collections import defaultdict
N,H = map(int,input().split())
T = set([0])
dic = defaultdict(int)
for i in range(N):
t,d = map(int,input().split())
T.add(t)
dic[t] = max(dic[t],d)
T = list(T)
M = []
for t in T:
M.append([t,dic[t]])
M.sort()
n = len(M)
T,D,S = [0]*n,[0]*n,[0]*n
for i in range(n):
T[i],D[i... | ConDefects/ConDefects/Code/abc303_f/Python/50087974 |
condefects-python_data_2817 | import math
import re
import functools
import random
import sys
import os
import typing
#from math import gcd,comb
from collections import Counter, defaultdict, deque
from functools import lru_cache, reduce
from itertools import accumulate, combinations, permutations
from heapq import nsmallest, nlargest, heappushpop, ... | ConDefects/ConDefects/Code/abc303_f/Python/52228360 |
condefects-python_data_2818 | from collections import defaultdict
from operator import itemgetter
import sys
def main():
input = sys.stdin.readline
N, H = map(int, input().split())
TD = [tuple(map(int, input().split())) for _ in range(N)]
TDD = defaultdict(int)
for t, d in TD:
TDD[t] = max(TDD[t], d)
TD = [(t, d) for... | ConDefects/ConDefects/Code/abc303_f/Python/48933165 |
condefects-python_data_2819 | from bisect import *
n, h = map(int, input().split())
td = [tuple(map(int, input().split())) for _ in range(n)]
td.sort() # t ใฎๅฐใใ้
prod_max = [t * d for t, d in td]
for i in range(1, n):
prod_max[i] = max(prod_max[i], prod_max[i - 1])
def check(x):
# [0, t1_), [t1_, t2_), [t2_, t3_)... ใใใฃใฆ t2_ <= x < t3_ ... | ConDefects/ConDefects/Code/abc303_f/Python/48442381 |
condefects-python_data_2820 | 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, groupby
from sortedcontainers import SortedList
from collections import Counter, deque, defa... | ConDefects/ConDefects/Code/abc303_f/Python/49402164 |
condefects-python_data_2821 | N = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
INF = 10**18
# dp[i][j][k]: ้ ็นi็ช็ฎใพใง่ฆใใจใใซใi็ช็ฎใ่ฒj(0or1)ใงใ้ ็น1ใ่ฒk(0or1)ใฎๆใฎ็ทๅใฎๆๅฐๅค
# ้ ็น0 ใฏ่ฒ0 ใงๅบๅฎใใ
dp = [[[INF] * 2 for _ in range(2)] for _ in range(N + 1)]
dp[0][0][0] = 0
dp[0][0][1] = 0
for i in range(N):
if i == 0:
# ้ ็น1... | ConDefects/ConDefects/Code/abc229_f/Python/46038453 |
condefects-python_data_2822 | N,M=map(int,input().split())
A=list(map(int,input().split()))
inf=1<<3
dp=[[[inf]*(M+1) for _ in range(2)] for _ in range(N+1)]
dp[0][1][0]=0
for i in range(N):
for k in range(2):
for j in range(M+1):
if k==0:
if dp[i][k][j]==inf:continue
if i!=0:
... | ConDefects/ConDefects/Code/abc275_f/Python/45458655 |
condefects-python_data_2823 | N,M=map(int, input().split())
A = list(map(int, input().split()))
l = [set([]) for i in range(M)]
for i,a in enumerate(A,1):
cnt = max(1,(-a+i-1)//i)
a += i * cnt
#print(cnt)
for j in range(cnt,M+1):
l[j-1].add(a)
a += i
if a>=200000:
break
#print(l)
for i in range(M... | ConDefects/ConDefects/Code/abc272_e/Python/45548566 |
condefects-python_data_2824 | # import็ณป ---
from collections import defaultdict
# ๅ
ฅๅ็จ ---
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 = lambda: list(inpu... | ConDefects/ConDefects/Code/abc272_e/Python/45511246 |
condefects-python_data_2825 | n, m = map(int, input().split())
a = list(map(int, input().split()))
d = [set() for _ in range(m)]
for i in range(n):
delta = -(i+1)//a[i] - 2
for j in range(max(0, delta), m):
tmp = (i+1)*(j+1)+a[i]
if tmp > n+1:
break
if 0 <= tmp:
d[j].add(tmp)
ans = [0]*m
for i in range(m):
for j in r... | ConDefects/ConDefects/Code/abc272_e/Python/45528883 |
condefects-python_data_2826 | N, M = map(int, input().split())
A = list(map(int, input().split()))
B: "list[set]" = [set() for _ in range(M+1)]
for i in range(N):
for k in range(max(1, -(A[i]//(i+1))), min(M+1, ((N-A[i])//(i+1)))):
B[k].add(A[i]+(i+1)*k)
for i in range(1, M+1):
C = sorted(B[i])
for j in range(len(C)):
... | ConDefects/ConDefects/Code/abc272_e/Python/45548360 |
condefects-python_data_2827 | import io
import sys
import pdb
from collections import defaultdict, deque, Counter
from itertools import permutations, combinations, accumulate
from heapq import heappush, heappop
sys.setrecursionlimit(10**6)
from bisect import bisect_right, bisect_left
from math import gcd
import math
_INPUT = """\
6
3
3 5 10
4 3 3
... | ConDefects/ConDefects/Code/abc325_f/Python/47205844 |
condefects-python_data_2828 | import math
import sys
sys.setrecursionlimit(500_000)
from collections import defaultdict
n = int(input())
d = list(map(int, input().split()))
l, c, k = [0] * 2, [0] * 2, [0] * 2
for i in range(2):
l[i], c[i], k[i] = map(int, input().split())
dp = [float('inf')] * (k[0] + 1)
dp[0] = 0
for di in d:
newdp = [flo... | ConDefects/ConDefects/Code/abc325_f/Python/47320684 |
condefects-python_data_2829 | N=int(input())
D=list(map(int, input().split()))
l1,c1,k1=list(map(int, input().split()))
l2,c2,k2=list(map(int, input().split()))
dp=[[10**5]*(k1+1) for _ in range(N+1)]
dp[0][0]=0
for i in range(1,N+1):
K=-((-D[i-1])//l1)
for j in range(k1+1):
for k in range(K+1):
if j+k>k1:
... | ConDefects/ConDefects/Code/abc325_f/Python/52623489 |
condefects-python_data_2830 | 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/abc325_f/Python/47165263 |
condefects-python_data_2831 | def solve():
n=int(input())
A=list(map(int,input().split()))
l1,c1,k1=map(int,input().split())
l2,c2,k2=map(int,input().split())
dp=[[0,0]]
for a in A:
cur=[]
d1=(a+l1-1)//l1
for x in range(d1+1):
y=(a-l1*x+l2-1)//l2
for nx,ny in dp:
... | ConDefects/ConDefects/Code/abc325_f/Python/49397229 |
condefects-python_data_2832 | import sys
from collections import deque
input = sys.stdin.readline
LN = 1111111
def cnt(d):
ret = []
s,k = 0,0
if d%s1[0] == 0: s = d//s1[0]
else: s = d//s1[0]+1
ssum = s1[0]*s
remain = d-ssum
ret.append([s,0])
while s >= 0:
s -= 1
remain += s1[0]
if remain %s2[... | ConDefects/ConDefects/Code/abc325_f/Python/47338119 |
condefects-python_data_2833 | N,P,Q,R,S = map(int, input().split())
A = list(map(int, input().split()))
ans = A[:P-1] + A[R-1:S] + A[P-1:Q] + A[S:]
print(*ans)
N,P,Q,R,S = map(int, input().split())
A = list(map(int, input().split()))
ans = A[:P-1] + A[R-1:S] + A[Q:R-1]+ A[P-1:Q] + A[S:]
print(*ans) | ConDefects/ConDefects/Code/abc286_a/Python/45028040 |
condefects-python_data_2834 | # ๅ
ฅๅใฎๅใๅใ
N,P,Q,R,S=map(int, input().split())
# ๆๅใซ[0]ใๅใใฆ็ชๅทใใใใ
A=[0]+list(map(int, input().split()))
# 1~P-1
A1=A[1:P]
# P~Q
A2=A[P:Q+1]
# Q+1~R-1
A3=A[Q+1:R]
# R~S
A4=A[R:S+1]
# S+1~N
A5=A[S+1:N+1]
# ใคใชใใ
B=A1+A4+A3+A2+A5
# ๅบๅ(ใ*ใใใคใใใจใใฃใใชใใงๅบๅใงใใ)
print(B)
# ๅ
ฅๅใฎๅใๅใ
N,P,Q,R,S=map(int, input().split())
# ๆๅใซ[0]ใๅใ... | ConDefects/ConDefects/Code/abc286_a/Python/45537297 |
condefects-python_data_2835 | s = input()
A = [int(x) for x in s]
for i in range(1, 10):
if i not in A:
print(i)
exit()
s = input()
A = [int(x) for x in s]
for i in range(10):
if i not in A:
print(i)
exit()
| ConDefects/ConDefects/Code/abc248_a/Python/45470045 |
condefects-python_data_2836 | S = input()
num = set([i for i in range(1, 10)])
for s in S:
num.discard(int(s))
print(*num)
S = input()
num = set([i for i in range(0, 10)])
for s in S:
num.discard(int(s))
print(*num)
| ConDefects/ConDefects/Code/abc248_a/Python/45497568 |
condefects-python_data_2837 | n = int(input())
xy = []
for i in range(n):
i, j = map(int, input().split())
xy.append((i, j))
s = input()
from collections import defaultdict
r_ok = defaultdict(bool)
l_ok = defaultdict(bool)
for i in range(n):
x, y = xy[i]
if s[i] == "R":
if not r_ok[y]:
r_ok[y] = x
else:... | ConDefects/ConDefects/Code/abc243_c/Python/45235100 |
condefects-python_data_2838 | N = int(input())
people = [list(map(int, input().split())) for _ in range(N)]
S = input()
r_hash = {}
l_hash = {}
flag = False
for i, (xy, moji)in enumerate(zip(people, S)):
# print(i, xy, moji)
x = xy[0]
y = xy[1]
if moji == 'R':
if l_hash... | ConDefects/ConDefects/Code/abc243_c/Python/44922035 |
condefects-python_data_2839 | n = int(input())
xy = [list(map(int, input().split())) for _ in range(n)]
s = input()
y = {}
for i in range(n):
xi, yi = xy[i]
y.setdefault(yi, [])
y[yi].append([xi, s[i]])
ans = 'No'
for i in y:
yi = y[i]
for j in range(len(yi)-1):
if yi[j][1] == 'R' and yi[j+1][1] == 'L':
ans... | ConDefects/ConDefects/Code/abc243_c/Python/45244721 |
condefects-python_data_2840 | import collections
N=int(input())
XY=[list(map(int,input().split())) for i in range(N)]
lx=collections.defaultdict(list)
rx=collections.defaultdict(list)
S=input()
for i in range(N):
x,y=XY[i]
if S[i]=="L":
lx[y].append(x)
else:
rx[y].append(x)
ans=False
for y in lx:
ans|=y in r... | ConDefects/ConDefects/Code/abc243_c/Python/45332491 |
condefects-python_data_2841 | N = int(input())
P = list(map(int, input().split()))
dp = [[-1<<60] * (N + 1) for _ in range(N + 1)]
dp[0][0] = 0
for i in range(1, N + 1):
p = P[i - 1]
for j in range(N + 1):
dp[i][j] = max(dp[i][j], dp[i - 1][j])
if j - 1 >= 0:
dp[i][j] = max(dp[i][j], dp[i - 1][j - 1] * 0.9 + p)
base = 1
ans = -... | ConDefects/ConDefects/Code/abc327_e/Python/51999062 |
condefects-python_data_2842 | import sys
import math
import os
import copy
import time
from fractions import Fraction
import copy
import sys
from collections import defaultdict
from math import sqrt
from decimal import Decimal, getcontext
if os.getenv('ENVIRONMENT') == 'local':
sys.stdin = open("input.txt", "r")
sys.stdout = open("output.t... | ConDefects/ConDefects/Code/abc327_e/Python/54954766 |
condefects-python_data_2843 | import codecs
import copy
import heapq as hq
import itertools
import math
import pprint as pp
import random
import statistics
import time
from bisect import bisect_left, bisect_right, insort
from collections import Counter
from collections import defaultdict as dd
from collections import deque
from functools import lru... | ConDefects/ConDefects/Code/abc327_e/Python/54952693 |
condefects-python_data_2844 | X,A,D,N=map(int,input().split())
if D==0:
if A==X:
print(0)
else:
print(abs(X-A))
exit()
X-=A
a0=0
an=D*(N-1)
if D>=1:
if not a0<=X<=an:
print(min(abs(a0-X),abs(an-X)))
else:
print(min(X%D,D-X%D))
else:
if not an<=X<=a0:
print(min(abs(a0-X),abs(an-X)))... | ConDefects/ConDefects/Code/abc255_c/Python/45066751 |
condefects-python_data_2845 | X,A,D,N = map(int,input().split())
min = min(A,A + D*(N-1))
max = max(A,A + D*(N-1))
if X >= max:
print(X-max)
exit()
if X <= min:
print(min-X)
exit()
ans = abs(X-A)%abs(D)
li = [ans,D-ans]
if li[0] < li[1]:
print(li[0])
else:
print(li[1])
X,A,D,N = map(int,input().split())
min = min(A,A ... | ConDefects/ConDefects/Code/abc255_c/Python/44917866 |
condefects-python_data_2846 | X, A, D, N = [int(x) for x in input().split()]
if D == 0:
print(abs(X - A))
else:
X -= A
if D < 0:
D = -D
X = -X
if 0 < X <= D*(N - 1):
print(min(X % D, D - X % D))
elif X < 0:
print(-X)
else:
print(X - D*(N - 1))
X, A, D, N = [int(x) for x in input().s... | ConDefects/ConDefects/Code/abc255_c/Python/45934299 |
condefects-python_data_2847 | x, a, d, n = map(int, input().split())
def func(i):
return d * (i - 1) + a
result = -1
left = 1
right = n
if d == 0:
result = min(abs(a - x), abs(x - a))
elif d > 0:
while left < right:
m = (left + right) // 2
if func(m) < x:
left = m + 1
else:
right = m - 1
""" ... | ConDefects/ConDefects/Code/abc255_c/Python/45282104 |
condefects-python_data_2848 | X,A,D,N = map(int,input().split())
X2 = X
X -= A
if D == 0:
print(abs(X))
else:
M = X // D
P = X % D
if 0 <= M < N-1:
print(min(abs(P),abs(D-P)))
elif N-1 <= M:
print(X2 - (A + D*(N-1)))
elif M < 0:
print(abs(A - X2))
X,A,D,N = map(int,input().split())
X2 = X
X -= A
if... | ConDefects/ConDefects/Code/abc255_c/Python/44681612 |
condefects-python_data_2849 | 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()))
X, A, D, N = MI()
def a(n):
return A + (n - 1) * D
if D == 0:
print(a... | ConDefects/ConDefects/Code/abc255_c/Python/45522180 |
condefects-python_data_2850 | X, A, D, N = map(int, input().split())
if D == 0:
print(abs(X-A))
exit()
if D > 0:
if X < A:
print(A-X)
elif A+D*(N-1) < X:
print(X-(A+D*(N-1)))
else:
print(min(abs((X-A)%D), D-abs((X-A)%D)))
else:
if X > A:
print(X-A)
elif A+D*(N-1) > X:
print((A+D*... | ConDefects/ConDefects/Code/abc255_c/Python/45907671 |
condefects-python_data_2851 | # import sys
# sys.setrecursionlimit(10**7)
import re
import copy
import bisect
import math
import itertools
import more_itertools
from collections import deque
from collections import defaultdict
from collections import Counter
from heapq import heapify, heappush, heappop, heappushpop, heapreplace
from functools impor... | ConDefects/ConDefects/Code/abc255_c/Python/45814894 |
condefects-python_data_2852 | x, a, d, n = map(int, input().split())
if d == 0:
print(abs(x - a))
exit(0)
m = (x - a) // d + 1
if m > n:
m = n - 5
if m <= 6:
m = 6
# +-5ๅ่ชฟในใ
ans = -1
for i in range(-5, 6):
an = a + d * (m + i - 1)
# INF่จญๅฎใใใใฉใใใ
if ans == -1:
ans = abs(x - an)
ans = min(ans, abs(x - an... | ConDefects/ConDefects/Code/abc255_c/Python/45259199 |
condefects-python_data_2853 | X, L, D, N = map(int, input().split())
R = L + D * (N-1)
if L > R:
L, R = R, L
D *= -1
if X < L:
print(L - X)
elif R < X:
print(X - R)
else:
if D == 0:
print(X-L)
else:
s = (X + R % D) % D
print(min(s, D-s))
X, L, D, N = map(int, input().split())
R = L + D * (N-1)
if... | ConDefects/ConDefects/Code/abc255_c/Python/45773903 |
condefects-python_data_2854 | x,a,d,n=map(int,input().split())
if d<0:
a=a+(n-1)*d
d=d*-1
m=a+(n-1)*d
print(a-x if a>x or d==0 else x-m if m<x else min((x-a)%d,d-(x-a)%d))
x,a,d,n=map(int,input().split())
if d<0:
a=a+(n-1)*d
d=d*-1
m=a+(n-1)*d
print(a-x if a>=x else x-m if m<=x else min((x-a)%d,d-(x-a)%d)) | ConDefects/ConDefects/Code/abc255_c/Python/45494254 |
condefects-python_data_2855 | # Python3/Pypy3ใใณใใฌใผใ้
#ใฉใคใใฉใช-------------------------------------------------------------------
from bisect import *
import heapq
import collections
from collections import deque
from queue import Queue
from itertools import groupby
import itertools
import math
import array
import string
import copy
from decimal impo... | ConDefects/ConDefects/Code/abc255_c/Python/45116616 |
condefects-python_data_2856 | print('oiunt'[[*open(0)][1].replace('.','')!='|*|'::2])
_,s=open(0);print('oiunt'[s.replace('.','')=='|*|\n'::2]) | ConDefects/ConDefects/Code/abc299_a/Python/46177642 |
condefects-python_data_2857 | from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
import string
from bisect import bisect_left, bisect_right
from math import factorial, ceil, floor,gcd... | ConDefects/ConDefects/Code/abc293_f/Python/45665153 |
condefects-python_data_2858 |
def solve():
from sys import stdin
def input():
return stdin.readline().rstrip()
n, t, l = map(int, input().split())
edges = []
for i in range(t):
x, y = map(int, input().split())
x, y = x - 1, y - 1
edges.append((x, y, i + 1))
def mat_prod(m1, m2):
r... | ConDefects/ConDefects/Code/abc236_g/Python/30741132 |
condefects-python_data_2859 | import sys
input = sys.stdin.readline
inf = 10 ** 18
def Matprod(A, B, N):
temp = [inf] * N*N
for i in range(N):
for j in range(N):
ij = i * N + j
for k in range(N):
temp[ij] = min(temp[ij], max(A[i*N+k], B[k*N+j]))
return temp
def Matpow_Linear(A, M, N):
... | ConDefects/ConDefects/Code/abc236_g/Python/55003330 |
condefects-python_data_2860 | n, t, l = map(int, input().split())
mat = [[t+1]*n for i in range(n)]
for i in range(1, t+1):
u, v = map(int, input().split())
mat[u-1][v-1] = i
def mul(A, B):
res = [[t+1]*n for i in range(n)]
for i in range(n):
for j in range(n):
for k in range(n):
res[i][k] = min(r... | ConDefects/ConDefects/Code/abc236_g/Python/28766467 |
condefects-python_data_2861 | j_list=['a','b','c','d','e','f','g','h']
str_list = [input() for _ in range(8)]
counter = 0
for i in str_list:
for j in range(8):
if(i[j]=='*'):
print(counter)
print(j)
print(j_list[j]+str(8-counter))
break
counter += 1
j_list=['a','b','c','d','e','f','g... | ConDefects/ConDefects/Code/abc296_b/Python/45538761 |
condefects-python_data_2862 | class Motion:
def __init__(self) -> None:
self.dx = 1
self.dy = 0
self.x = 0
self.y = 0
def rotate(self) -> None:
self.dx, self.dy = self.y, -self.dx
def move(self) -> None:
self.x += self.dx
self.y += self.dy
@property
def get_x(self) -> in... | ConDefects/ConDefects/Code/abc244_b/Python/45713633 |
condefects-python_data_2863 | N = int(input())
A = [list(input()) for _ in range(N)]
rotate_list = []
for i in range(N):
rotate_list.append(A[0][i])
for i in range(1, N):
rotate_list.append(A[i][N-1])
for i in reversed(range(0, N-1)):
rotate_list.append(A[N-1][i])
for i in reversed(range(1, N-1)):
rotate_list.append(A[i][0])
for... | ConDefects/ConDefects/Code/abc309_b/Python/45722179 |
condefects-python_data_2864 | import numpy as np
import sys
from functools import lru_cache
sys.setrecursionlimit(int(1e7))
from collections import *
import heapq
import bisect
import itertools
class UnionFind:
def __init__(self, n):
self.n = n
self.parents = [-1] * n
def find(self, x):
if self.parents[x] < 0:
... | ConDefects/ConDefects/Code/abc245_e/Python/45539466 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.