id stringlengths 24 27 | content stringlengths 37 384k | max_stars_repo_path stringlengths 51 51 |
|---|---|---|
condefects-python_data_2701 | n,s,k=map(int, input().split())
sum=0
for i in range(n):
p,q=map(int, input().split())
sum+=p*q
if s<sum:
print(sum)
else:
print(sum+k)
n,s,k=map(int, input().split())
sum=0
for i in range(n):
p,q=map(int, input().split())
sum+=p*q
if s<=sum:
print(sum)
else:
print(sum+k) | ConDefects/ConDefects/Code/abc332_a/Python/54647006 |
condefects-python_data_2702 | n,s,k = map(int,input().split())
p,q=[],[]
for _ in range(n):
a,b = map(int,input().split())
p.append(a)
q.append(b)
pq = [x*y for x,y in zip(p,q)]
amount = int(sum(pq))
print(amount if amount > s else amount + k)
n,s,k = map(int,input().split())
p,q=[],[]
for _ in range(n):
a,b = map(int,input().split())... | ConDefects/ConDefects/Code/abc332_a/Python/54744452 |
condefects-python_data_2703 | N = int(input())
S = input()
mod = 998244353
DP = [[[0]*26 for _ in range(26)] for __ in range(N)]
DP2 = [[0]*26 for __ in range(N)]
def f(s):
return ord(s) - ord("a")
if S[0]=="?" and S[1]=="?":
DP[1] = [[1]*26 for _ in range(26)]
for i in range(26):
DP[1][i][i] = 0
elif S[0]=="?" and S[1]!="?"... | ConDefects/ConDefects/Code/agc060_a/Python/37682454 |
condefects-python_data_2704 | from math import gcd
N = int(input())
A = list(map(int, input().split()))
m = A[0]
d = A[-1] - m
g = m
for a in A[1:]:
g = gcd(g, 2*(a-m))
ans = m%g + d
print(ans)
from math import gcd
N = int(input())
A = list(map(int, input().split()))
m = A[0]
d = A[-1] - m
g = d
for a in A[1:]:
g = gcd(g, 2*(a-m))
a... | ConDefects/ConDefects/Code/arc152_c/Python/41152980 |
condefects-python_data_2705 | from functools import reduce; from math import gcd
N=int(input());A=list(map(int,input().split()))
B = [2*A[i+1]-2*A[i] for i in range(N-1)];g=reduce(gcd,B)
mi = A[-1]-A[0]+A[0]%g
#print(mi)
for a in A:
mi = min(mi,A[-1]-A[0]+(-A[-1]+2*a)%g)
#print(mi)
print(mi,g)
from functools import reduce; from math import... | ConDefects/ConDefects/Code/arc152_c/Python/37735671 |
condefects-python_data_2706 | n = int(input())
a = list(map(int,input().split()))
g = 0
from math import gcd
for i in range(n - 1):
g = gcd(g, a[i] - a[i + 1])
if g % 2 != 0 and (a[0] - a[-1]) % 2 == 0:
g *= 2
print(a[-1] - a[0] + a[0] % g)
n = int(input())
a = list(map(int,input().split()))
g = 0
from math import gcd
for i in range(n - 1):
... | ConDefects/ConDefects/Code/arc152_c/Python/36943297 |
condefects-python_data_2707 | 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/arc152_c/Python/44122587 |
condefects-python_data_2708 | import sys
input = sys.stdin.readline
inf = float('inf')
def getInt():
return int(input())
def getStr():
return input().strip()
def getList(dtype=int, split=True):
s = getStr()
if split:
s = s.split()
return list(map(dtype, s))
t = 1
def solve():
n = getInt()
from math impo... | ConDefects/ConDefects/Code/arc152_c/Python/38915061 |
condefects-python_data_2709 |
import sys
input = sys.stdin.readline
inf = float('inf')
def getInt():
return int(input())
def getStr():
return input().strip()
def getList(dtype=int, split=True):
s = getStr()
if split:
s = s.split()
return list(map(dtype, s))
t = 1
def solve():
n = getInt()
from math imp... | ConDefects/ConDefects/Code/arc152_c/Python/38915312 |
condefects-python_data_2710 |
import sys
input = sys.stdin.readline
inf = float('inf')
def getInt():
return int(input())
def getStr():
return input().strip()
def getList(dtype=int, split=True):
s = getStr()
if split:
s = s.split()
return list(map(dtype, s))
t = 1
def solve():
n = getInt()
from math imp... | ConDefects/ConDefects/Code/arc152_c/Python/38915283 |
condefects-python_data_2711 | import math
n=int(input())
a=list(map(int,input().split()))
g=0
for i in a:
g=math.gcd(g,i)
ans=(a[-1]-a[0])+min(a[0]%(2*g),a[-1]%(2*g))
print(ans)
import math
n=int(input())
a=list(map(int,input().split()))
g=0
for i in a:
g=math.gcd(g,i-a[0])
ans=(a[-1]-a[0])+min(a[0]%(2*g),a[-1]%(2*g))
print(ans) | ConDefects/ConDefects/Code/arc152_c/Python/41680516 |
condefects-python_data_2712 | import sys
import os
import inspect
input = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 7)
if os.getenv("TKTKLOCAL", False):
def debug(*arg, sep=" ", end="\n"):
print(*arg, sep=sep, end=end, file=sys.stderr)
def debug_indent(*arg, sep=" ", end="\n", indent=" "):
frame = inspect.cu... | ConDefects/ConDefects/Code/arc155_c/Python/38465931 |
condefects-python_data_2713 | N = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
def sort_data(data):
odd_pos = []
for i, a in enumerate(data):
if a % 2:
odd_pos.append(i)
flag = 0
for i1, i2 in zip(odd_pos, odd_pos[1:]):
if i2-i1 <= 2:
flag = 1
... | ConDefects/ConDefects/Code/arc155_c/Python/40890958 |
condefects-python_data_2714 | import math
import sys
sys.setrecursionlimit(500_000)
from collections import defaultdict
from collections import Counter
n = int(input())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
def oddin3(xs):
m = len(xs)
for i in range(m - 2):
oc = (xs[i] % 2) + (xs[i + 1] % 2) + (xs... | ConDefects/ConDefects/Code/arc155_c/Python/38471956 |
condefects-python_data_2715 | import sys
input = sys.stdin.readline
inf = float('inf')
def getInt():
return int(input())
def getStr():
return input().strip()
def getList(dtype=int, split=True):
s = getStr()
if split:
s = s.split()
return list(map(dtype, s))
t = 1
def solve():
n = getInt()
a = getList()
... | ConDefects/ConDefects/Code/arc155_c/Python/38489822 |
condefects-python_data_2716 | n=int(input())
A=[*map(int,input().split())]
B=[*map(int,input().split())]
st=sorted
def check(a,b):
ev=0
for i in a:
if i%2==0:ev+=1
if ev==0 and a!=b:
return 0
od=0
for i in range(n-2):
if a[i]%2 + a[i+1]%2 + a[i+2]%2 > 1:
od=1
if od and st(a)... | ConDefects/ConDefects/Code/arc155_c/Python/38467027 |
condefects-python_data_2717 | n,a,b=map(int,input().split())
if a>b:
a,b=b,a
ax,bx=a,b
while ax>0:
ax,bx=bx%ax,ax
g=bx
ans=0
const=a*b//g
rui=n//const
za=n%const
ans+=(rui*const*2+za+1)*za//2-(rui*const*2+za//a*a+a)*(za//a)//2-(rui*const*2+za//b*b+b)*(za//b)//2
ans+=rui*const*(const+1)//2*(const-const//a-const//b+1)
ans+=rui*(const*(const+1)//2... | ConDefects/ConDefects/Code/abc253_d/Python/46046758 |
condefects-python_data_2718 | import math
n,a,b = map(int,input().split())
total = (n*(n+1))//2
rma = n//a
rmb = n//b
plab= n//((a*b)//math.gcd(a,b))
total-=a*(rma*(rma+1))//2
total-=b*(rmb*(rmb+1))//2
total+=(a*b)*(plab*(plab+1))//2
print(total)
import math
n,a,b = map(int,input().split())
total = (n*(n+1))//2
rma = n//a
rmb = n//b
plab= n//((a*b... | ConDefects/ConDefects/Code/abc253_d/Python/45937943 |
condefects-python_data_2719 | n, m = map(int, input().split())
a = list(map(int, input().split()))
b = list(range(n + 1))
for i in a:
b[i], b[i + 1] = b[i + 1], b[i]
p = [0] * (n + 1)
for i in range(n):
p[b[i]] = i
b = list(range(n + 1))
for i in a:
if b[i] == 1:
print(p[b[i + 1]])
elif b[i + 1] == 1:
print(p[b[i]])
else:
print(p[1])
b[... | ConDefects/ConDefects/Code/abc279_e/Python/44892540 |
condefects-python_data_2720 | ## https://atcoder.jp/contests/abc324/tasks/abc324_g
class Node:
def __init__(self, value):
self.value = value
self.next = None
self.prev = None
def __repr__(self) -> str:
return str(self.value)
class LinkedList:
def __init__(self, maintain_middle=False):
se... | ConDefects/ConDefects/Code/abc324_g/Python/52629689 |
condefects-python_data_2721 | S = input()
print(len(S) + S.count('00'))
S = input()
print(len(S) - S.count('00')) | ConDefects/ConDefects/Code/abc283_c/Python/45014818 |
condefects-python_data_2722 | s=list(map(int,input()))
n=len(s)
ans=0
ze=0
for i in range(n):
if s[i]!=0:
ans+=1
else:
ze+=1
print(ans+(ze+1)//2)
s=list(map(int,input()))
n=len(s)
ans=0
ze=0
for i in range(n):
if s[i]!=0:
ans+=1
ans+=(ze+1)//2
ze=0
else:
ze+=1
print(ans+(ze+1)//2) | ConDefects/ConDefects/Code/abc283_c/Python/45014634 |
condefects-python_data_2723 | # ansmod = 10 ** 9 + 7
# ansmod = 998244353
import sys
def main(f):
s = list(map(int, f.readline()[:-1]))
if len(s) == 1:
if s[0] == 0:
return 0
else:
return 1
ans = 0
f = False
for c in s:
if c == 0:
if f:
ans += 1
... | ConDefects/ConDefects/Code/abc283_c/Python/45277024 |
condefects-python_data_2724 | n = int(input())
cs = {}
for i in range(n):
a, c = map(int, input().split())
if c in cs:
cs[c].append(a)
else:
cs[c] = [a]
keys = cs.keys()
c = -1
a = 0
for k in keys:
m = min(cs[k])
if m > a:
c = k
a = m
print(c)
n = int(input())
cs = {}
for i in range(n):
a, c = map(int, input().split())... | ConDefects/ConDefects/Code/abc348_c/Python/54707785 |
condefects-python_data_2725 | N = int(input())
AC = sorted(sorted([list(map(int, input().split())) for _ in range(N)]), key=lambda x:x[1])
num, _min = AC[0]
for i in AC[1:]:
if num != i[1]:
num = i[1]
if _min < i[0]:
_min = i[0]
print(_min)
N = int(input())
AC = sorted(sorted([list(map(int, input().split())) for _ i... | ConDefects/ConDefects/Code/abc348_c/Python/54773547 |
condefects-python_data_2726 | n = int(input())
dic = {}
for _ in range(n):
a, c = map(int, input().split())
dic[c] = min(dic.get(c, 10**10), a)
print(max(dic))
n = int(input())
dic = {}
for _ in range(n):
a, c = map(int, input().split())
dic[c] = min(dic.get(c, 10**10), a)
print(max(dic.values())) | ConDefects/ConDefects/Code/abc348_c/Python/55014351 |
condefects-python_data_2727 | import collections
N = int(input())
AC = [list(map(int, input().split())) for _ in range(N)]
AC = sorted(AC)
AC = sorted(AC, key=lambda x:x[1])
print(AC)
num = AC[0][1]
_min = AC[0][0]
for i in AC[1:]:
if num != i[1]:
num = i[1]
if _min < i[0]:
_min = i[0]
import collections
N = int(inp... | ConDefects/ConDefects/Code/abc348_c/Python/54773465 |
condefects-python_data_2728 | dir={
"tourist":"3858",
"ksun48":"3679",
"Benq":"3658",
"Um_nik":"3648",
"apiad":"3638",
"Stonefeang":"3630",
"ecnerwala":"3613",
"mnbvmar":"3555",
"newbiedmy":"3516",
"semiexp":"3481"
}
print=(dir[input()])
dir={
"tourist":"3858",
"ksun48":"3679",
"Benq":"3658",
"Um_nik":"3648",
"apiad":"3638",
"Stonefeang":"3630",
... | ConDefects/ConDefects/Code/abc319_a/Python/45786376 |
condefects-python_data_2729 | arr={'tourist' :3859,'ksun48':3679,'Benq':3658,'Um_nik':3648,'apiad':3638,
'Stonefeang': 3630,
'ecnerwala': 3613,
'mnbvmar': 3555,
'newbiedmy': 3516,
'semiexp':3481}
name=input()
print(arr[name])
arr={'tourist' :3858,'ksun48':3679,'Benq':3658,'Um_nik':3648,'apiad':3638,
'Stonefeang': 3630,
'ecnerwala': 3613,
'mnbvmar'... | ConDefects/ConDefects/Code/abc319_a/Python/46004667 |
condefects-python_data_2730 | def main():
map = {
"tourist": 3858,
"ksun48": 3679,
"Benq":3658,
"Um_nik": 3648,
"apiad": 3638,
"Stonefeang": 3630,
"ecnerwala": 3613,
"mnbvmar": 3555,
"newbiedmy": 3516,
"semiexp": 3481
}
print(map[input()])
def main():
map = {
"tourist": 3858,
"ksun48": 3679,
"Benq":3658,
"U... | ConDefects/ConDefects/Code/abc319_a/Python/45924086 |
condefects-python_data_2731 | s=str(input())
if s=="tourist":
print(3858)
if s=="ksun48":
print(3679)
if s=="Beng":
print(3658)
if s=="Um_nik":
print(3648)
if s=="apiad":
print(3638)
if s=="Stonefeang":
print(3630)
if s=="ecnerwala":
print(3613)
if s=="mnbvmar":
print(3555)
if s=="newbiedmy":
print(3516)
if s=="s... | ConDefects/ConDefects/Code/abc319_a/Python/45796003 |
condefects-python_data_2732 | S = input()
if S =="tourist":
print(3858)
if S == "ksun48":
print(679)
if S == "Benq":
print(3658)
if S == "Um_nik":
print(3648)
if S == "apiad":
print(3638)
if S == "Stonefeang":
print(3630)
if S == "ecnerwala":
print(3613)
if S == "mnbvmar":
print(3555)
if S == "newbiedmy":
print(... | ConDefects/ConDefects/Code/abc319_a/Python/46183360 |
condefects-python_data_2733 | s=str(input())
if s=="tourist":
print(3858)
if s=="ksun48":
print(3679)
if s=="Benq":
print(3658)
if s=="Um_nik":
print(3648)
if s=="apiad":
print(3638)
if s=="Stonefeang":
print(3630)
if s=="ecnerwala":
print(3613)
if s=="marinara":
print(3555)
if s=="newbiedmy":
print(3516)
if s=="... | ConDefects/ConDefects/Code/abc319_a/Python/45795437 |
condefects-python_data_2734 | S=input()
l=[["tourist",3858],["ksun48", 3679],["Benq", 3658],["Um_nik", 3648],["apiad", 3638],["Stonefeang", 3630],
["ecnerwala", 3613],["mnbvmar", 3555],["ewbiedmy", 3516],["semiexp", 3481]]
for i in l:
if i[0]==S:
print(i[1])
S=input()
l=[["tourist",3858],["ksun48", 3679],["Benq", 3658],["Um_nik", 3648],["api... | ConDefects/ConDefects/Code/abc319_a/Python/45995183 |
condefects-python_data_2735 | N = int(input())
num_set = set(range(1, 2*N+2))
while True:
print(num_set.pop, flush=True)
a = int(input()) #aは青木君が宣言した数
if a==0:
break
num_set.discard(a)
N = int(input())
num_set = set(range(1, 2*N+2))
while True:
print(num_set.pop())
a = int(input()) #aは青木君が宣言した数
if a==0... | ConDefects/ConDefects/Code/abc244_c/Python/45666072 |
condefects-python_data_2736 | N=int(input())
bad=set()
for _ in range(N+1):
for i in range(1,N+1):
if i not in bad:
bad.add(i)
print(i)
bad.add(int(input()))
break
N=int(input())
bad=set()
for _ in range(N+1):
for i in range(1,2*N+2):
if i not in bad:
bad... | ConDefects/ConDefects/Code/abc244_c/Python/45762748 |
condefects-python_data_2737 | n=int(input())
ans=[i for i in range(1,n+2)]
while True:
print(ans.pop(0), flush=True)
tmp=int(input())
if tmp==0:
exit()
else:
ans.remove(tmp)
n=int(input())
ans=[i for i in range(1,2*n+2)]
while True:
print(ans.pop(0), flush=True)
tmp=int(input())
if tmp==0:
exit()
else:
ans.remove(tm... | ConDefects/ConDefects/Code/abc244_c/Python/45056793 |
condefects-python_data_2738 | import sys
sys.setrecursionlimit(10**9)
def main():
N, K = map(int, input().split())
S = input()
for i in range(1, N + 1):
D = [[0 for _ in range(26)] for _ in range(i)]
T = [0 for _ in range(i)]
for j, s in enumerate(S):
D[j % i][ord(s) - ord("a")] += 1
... | ConDefects/ConDefects/Code/arc140_a/Python/45466035 |
condefects-python_data_2739 | N,K = map(int,input().split())
S = input()
X, M = 0, 0
l = -1
r = N
for m in range(1,N+1):
d = [[0 for i in range(26)] for j in range(m)]
c = [0 for i in range(m)]
for i in range(N):
s = S[i]
n = ord(s) - 97
d[i%m][n] += 1
c[i%m] += 1
k = 0
for i in range(m):
k += (c[i] - max(d[i]))
if k... | ConDefects/ConDefects/Code/arc140_a/Python/43702088 |
condefects-python_data_2740 | from collections import deque
n1, n2, m = map(int,input().split())
g1, g2 = [[] for _ in range(n1)],[[] for _ in range(n2)]
g = [[] for _ in range(n1+n2)]
for _ in range(m):
a,b = [int(e) -1 for e in input().split()]
g[a].append(b)
g[b].append(a)
def dfs(s):
dd = [-1] * (n1+n2)
dd[s] = 0
q = ... | ConDefects/ConDefects/Code/abc309_d/Python/46051654 |
condefects-python_data_2741 | import numpy as np
from numba import i8, njit
from math import sqrt, atan2
@njit((i8, i8, i8, i8[:]), cache = True)
def add(p, x, size, data):
p += 1
while p <= size:
data[p] += x
p += p & -p
@njit(i8(i8, i8[:]), cache = True)
def _sum(r, data):
s = 0
while r > 0:
s += data[r]
... | ConDefects/ConDefects/Code/abc263_h/Python/49039255 |
condefects-python_data_2742 | class FenwickTree:
def __init__(self, n: int):
self.n = n
self.arr = [0] * (n + 1)
# n以下の最大の2冪
self.powlog_n = 2 ** (n.bit_length() - 1)
def add(self, i: int, x: int):
"""`a[i] += x`
Args:
i (int): 0-indexed
x (int): to add
Note:... | ConDefects/ConDefects/Code/abc263_h/Python/33881482 |
condefects-python_data_2743 | n = int(input())
S = input()
def f(T):
U = [c for c in reversed(T)]
for i in range(len(U)):
U[i] = 'd' if U[i] == 'p' else 'p'
return ''.join(U)
l = 0
while l < n and S[l] != 'd':
l += 1
ans = S
for r in range(l+1, n+1):
ans = min(ans, S[:l] + f(S[l:r]) + S[r:])
print(ans)
n = int(input(... | ConDefects/ConDefects/Code/arc148_b/Python/43029081 |
condefects-python_data_2744 | # 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*
# from string import ascii_lowercase,ascii_uppercase
# import numpy as np
import sys
impor... | ConDefects/ConDefects/Code/arc148_b/Python/43234248 |
condefects-python_data_2745 | N=int(input())
S=input()
psta=[]
keep=N
cnt=0
for i in range(N-1,-1,-1):
if S[i]=="p":
if cnt==0:
keep=i
cnt=1
else:
cnt+=1
else:
if cnt!=0:
psta.append((cnt,keep))
cnt=0
if cnt!=0:
psta.append((cnt,keep))
psta=sorted(psta)
if len(psta)==0:
print(S)
else:
cnt,back=pst... | ConDefects/ConDefects/Code/arc148_b/Python/43079503 |
condefects-python_data_2746 | N = int(input())
S = input()
from itertools import groupby
gb = [[key, len(list(g))] for key, g in groupby(S)]
def swap(s):
res = []
for c in s[::-1]:
if c=='d':
res.append('p')
else:
res.append('d')
return ''.join(res)
ans = [S]
for i,c in enumerate(S):
if c==... | ConDefects/ConDefects/Code/arc148_b/Python/40105806 |
condefects-python_data_2747 | import math
import heapq
import itertools
import bisect
import random
import time
from collections import deque
import sys
from cmath import exp,pi
input=sys.stdin.readline
def f(left):
if b*x<z:
return left*x
k=(left//b)*z
left-=(left//b)*b
return k+left*x
t=int(input())
for _ in range(t):
... | ConDefects/ConDefects/Code/arc139_b/Python/39342455 |
condefects-python_data_2748 | # +-----------+--------------------------------------------------------------+
# | main | |
# +-----------+--------------------------------------------------------------+
def main():
T = int(input())
for _ in range(T):
print(solve(*map(in... | ConDefects/ConDefects/Code/arc139_b/Python/38643909 |
condefects-python_data_2749 | import math
def solve(N, A, B, X, Y, Z):
if N <= A * A:
pts = [(y, (N - A * y) // B) for y in range(0, N // A + 1)]
pts += [(y, 0) for y in range(0, N // A + 1)]
elif N <= B * B:
pts = [((N - B * z) // A, z) for z in range(0, N // B + 1)]
pts += [(0, z) for z in range(0, N // B ... | ConDefects/ConDefects/Code/arc139_b/Python/44587414 |
condefects-python_data_2750 | T=int(input())
for i in range(T):
N,A,B,X,Y,Z=map(int, input().split())
Y,Z=min(Y,A*X),min(Z,B*X)
if Y/A>X/B:
Y,Z,A,B=Z,Y,B,A
ans=10**20
if N//A<2*A:
for a in range(N//A+1):
c=Y*a+Z*((N-A*a)//B)+X*((N-A*a)%B)
ans=min(c,ans)
print(ans)
else:
for b in range(A):
c=Z*b+Y*((N-B*... | ConDefects/ConDefects/Code/arc139_b/Python/35647235 |
condefects-python_data_2751 | import sys
sys.setrecursionlimit(500*500)
# if 'pypyjit' in sys.builtin_module_names:
# import pypyjit
# pypyjit.set_param('max_unroll_recursion=-1')
input = sys.stdin.readline
from math import gcd
from functools import reduce
# product('ABCD', repeat=2) => AA AB AC AD BA BB BC BD CA CB CC CD DA DB DC DD
from ... | ConDefects/ConDefects/Code/abc247_d/Python/46165455 |
condefects-python_data_2752 | N, Q = map(int, input().split())
# 答えの候補
last_ans = 0
# 列の先頭
top = 0
# 受付に呼ばれたが、行ってない
ready = [False] * N
for i in range(Q):
t = input()
if t == "1":
ready[top] = True
top += 1
elif t == "3":
for j in range(last_ans, N):
if ready[j] == True:
print(j + 1)
last_ans = j + 1
... | ConDefects/ConDefects/Code/abc294_d/Python/45910052 |
condefects-python_data_2753 | S = input()
if 'oxo' in S:
print('No')
elif 'oo' in S:
print('No')
else:
print('Yes')
S = input()
if 'oxo' in S:
print('No')
elif 'oo' in S:
print('No')
elif 'xxx' in S:
print('No')
else:
print('Yes')
| ConDefects/ConDefects/Code/abc230_b/Python/46192846 |
condefects-python_data_2754 | s = input()
if (len(s) == 2 and s == 'oo'):
print('No')
exit()
else:
print('Yes')
exit()
if (len(s) == 1):
print('Yes')
exit()
if (s[0] == 'x'):
s = s[1:]
if (s[0] == 'x'):
s = s[1:]
if (s[0] == 'x'):
print('No')
exit()
m = ['o','x','x']
for i in range(len(s)):
if (s[i] != m[... | ConDefects/ConDefects/Code/abc230_b/Python/45318112 |
condefects-python_data_2755 | S=input()
if len(S)<3:
if S in "oxxox":
print("Yes")
else:
print("No")
else:
cnt=0
ans=True
for i in range(len(S)):
if S[i]=="x":
cnt+=1
elif S[i]=="o":
if cnt==2:
cnt=0
elif cnt==i:
cnt=0
... | ConDefects/ConDefects/Code/abc230_b/Python/46215584 |
condefects-python_data_2756 | s = input()
now = -1
ans = "Yes"
for i in range(len(s)):
if s[i] == 'o':
if (now == -1 and i >= 3) or (now != -1 and i != now+3):
ans = "No"
now = i
print(ans)
s = input()
now = -1
ans = "Yes"
for i in range(len(s)):
if s[i] == 'o':
if (now == -1 and i >= 3) or (now != -1 and i != now+3):
... | ConDefects/ConDefects/Code/abc230_b/Python/45098077 |
condefects-python_data_2757 | import sys,random,bisect
from collections import deque,defaultdict
from heapq import heapify,heappop,heappush
from functools import lru_cache
from itertools import permutations
from math import gcd,log,sqrt
from atcoder.modint import ModContext, Modint
from atcoder.dsu import DSU
ModContext(1).context.append(998244353... | ConDefects/ConDefects/Code/abc230_b/Python/46045748 |
condefects-python_data_2758 | S = input()
T = "oox" * 10**5
if T.find(S) != -1:
print('Yes')
else:
print('No')
S = input()
T = "oxx" * 10**5
if T.find(S) != -1:
print('Yes')
else:
print('No')
| ConDefects/ConDefects/Code/abc230_b/Python/44392053 |
condefects-python_data_2759 | # import系 ---
# 入力用 ---
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()))
LS = lambda: input().split()
# コード ---
N, M = MI()
A_list = sorted(LI())
ans_cand = []
cnt = A_list[0]
for i in range(1,... | ConDefects/ConDefects/Code/abc277_d/Python/45302782 |
condefects-python_data_2760 | n, m = map(int,input().split())
A = list(map(int,input().split()))
sm = sum(A)
A.sort()
A = A + A
i = 0
ans = 1 << 61
while i < len(A) - 1:
now = A[i]
while A[i+1] == A[i] or A[i+1] == A[i] + 1:
i += 1
if i >= len(A) - 1:
break
now += A[i]
ans = min(ans, sm - now)
i... | ConDefects/ConDefects/Code/abc277_d/Python/45976330 |
condefects-python_data_2761 | # 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, m = ints()
aa = sorted(ints())
# print(locals())
... | ConDefects/ConDefects/Code/abc277_d/Python/45573210 |
condefects-python_data_2762 | N, M = map(int, input().split())
A = list(map(int, input().split()))
A.sort()
sum_a = sum(A)
ans = sum_a
cnt = A[0]
flag = False
zero = 0
if A[0] == 0:
flag = True
for i in range(N-1):
if A[i] == A[i+1] or A[i] + 1 == A[i+1]:
cnt += A[i+1]
if flag:
zero = cnt
else:
cnt =... | ConDefects/ConDefects/Code/abc277_d/Python/46193940 |
condefects-python_data_2763 | n, a, b = map(int, input().split())
if a <= b:
print(n)
else:
if n < a:
print(0)
else:
print((n // a - 1) * b + min(b - 1, n % a) + 1)
n, a, b = map(int, input().split())
if a <= b:
print(max(n - a + 1, 0))
else:
if n < a:
print(0)
else:
print((n // a - 1) * b +... | ConDefects/ConDefects/Code/arc145_b/Python/41925394 |
condefects-python_data_2764 | n, a, b = map(int, input().split())
def f(N):
cnt = N // a * min(a, b) + min(N % a, b - 1)
return cnt
print(f(n) - f(a - 1))
n, a, b = map(int, input().split())
def f(N):
cnt = N // a * min(a, b) + min(N % a, b - 1)
return cnt
print(max(0, f(n) - f(a - 1)))
| ConDefects/ConDefects/Code/arc145_b/Python/44404835 |
condefects-python_data_2765 | n,a,b = map(int,input().split())
ans = 0
if a <= b:
ans = n - a + 1
else:
ans += b * max(0, n // a - 1)
if n // a > 0:
ans += min(b, n % a + 1)
print(ans)
n,a,b = map(int,input().split())
ans = 0
if a <= b:
ans = max(0, n - a + 1)
else:
ans += b * max(0, n // a - 1)
if n // a > 0:
... | ConDefects/ConDefects/Code/arc145_b/Python/44999492 |
condefects-python_data_2766 | import sys, re
#------pypyで再帰などを提出する場合は下記２行を使用-----
#import pypyjit
#pypyjit.set_param('max_unroll_recursion=-1')
#import numpy as np
from math import ceil, floor, sqrt, pi, factorial, gcd,isfinite
from copy import deepcopy
from collections import Counter, deque,defaultdict
from heapq import heapify, heappop, heappush
... | ConDefects/ConDefects/Code/arc145_b/Python/41639432 |
condefects-python_data_2767 | n, a, b = map(int, input().split())
def f(x):
return x // a * min(a, b) + min(n % a, b - 1)
print(max(f(n) - f(a - 1), 0))
n, a, b = map(int, input().split())
def f(x):
return x // a * min(a, b) + min(x % a, b - 1)
print(max(f(n) - f(a - 1), 0))
| ConDefects/ConDefects/Code/arc145_b/Python/44115404 |
condefects-python_data_2768 | 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()
N, A, B = mulint()
def f(X):
p, q = divmod(X,A)
return p... | ConDefects/ConDefects/Code/arc145_b/Python/43068920 |
condefects-python_data_2769 | N,A,B=map(int,input().split())
if A<=B:
print(max(N-A+1,0))
exit()
answer=B*(N//A-1)
answer+=min(N%A+1,B)
print(answer)
N,A,B=map(int,input().split())
if A<=B:
print(max(N-A+1,0))
exit()
answer=B*(N//A-1)
answer+=min(N%A+1,B)
print(max(answer,0)) | ConDefects/ConDefects/Code/arc145_b/Python/41219575 |
condefects-python_data_2770 | import sys
def input():
input = sys.stdin.read
data = input().split()
N = int(data[0])
M = int(data[1])
A = list(map(int, data[2:M+2]))
X = []
index = M + 2
for i in range(N):
row = list(map(int, data[index:index + M]))
X.append(row)
index += M
... | ConDefects/ConDefects/Code/abc356_b/Python/54957150 |
condefects-python_data_2771 | '''
Hala Madrid!
https://www.zhihu.com/people/li-dong-hao-78-74
'''
import sys
import os
from io import BytesIO, IOBase
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" no... | ConDefects/ConDefects/Code/abc356_b/Python/54965405 |
condefects-python_data_2772 | N,M = map(int,input().split())
A = list(map(int,input().split()))
X =[]
for i in range(N):
X.append(list(map(int,input().split())))
Y = []
for i in range(M):
Y.append(0)
for i in range(M):
for j in range(N):
Y[i] += X[j][i]
Flag =True
for i in range(M):
if Flag == False:
break
if Y[i] < A[i]:
... | ConDefects/ConDefects/Code/abc356_b/Python/55010067 |
condefects-python_data_2773 | N,M=map(int, input().split())
A = list(map(int, input().split()))
X = [list(map(int, input().split())) for _ in range(N)]
for m in range(M):
a=0
for n in range(N):
a+=X[n][m]
if a<=A[m]:
print ("No")
exit(0)
print ('Yes')
N,M=map(int, input().split())
A = list(map(int, input().split()))
X = [list(map... | ConDefects/ConDefects/Code/abc356_b/Python/55103344 |
condefects-python_data_2774 | N, M=map(int, input().split())
goal=input().split()
nutrition=[]
check=[]
for i in range(N):
nutrition.append(input().split())
def sum_nut(N,nut_num,goal,check):
sum_n=[]
for i in range(N):
sum_n.append(int(nutrition[i][nut_num]))
if int(goal[nut_num])<sum(sum_n):
check.append(1)
else:
check.appen... | ConDefects/ConDefects/Code/abc356_b/Python/54954884 |
condefects-python_data_2775 | import pandas as pd
n, m = map(int, input().split())
aim_am_lis = list(map(int, input().split()))
am_lis = []
for i in range(n):
am_lis.append(list(map(int, input().split())))
df = pd.DataFrame(data=am_lis).sum()
cnt=0
for i in range(m):
if df[i] > aim_am_lis[i]:
cnt+=1
if cnt==m:
print("Yes")
else... | ConDefects/ConDefects/Code/abc356_b/Python/55030637 |
condefects-python_data_2776 | mod = 998244353
#nCk
def com(n,mod):
fact = [1,1]
factinv = [1,1]
inv = [0,1]
for i in range(2,n+1):
fact.append((fact[-1]*i)%mod)
inv.append((-inv[mod%i]*(mod//i))%mod)
factinv.append((factinv[-1]*inv[-1])%mod)
return fact, factinv
f,fi = com(10000, mod)
def ncr(n,r):
return f[n] * fi[n-r]... | ConDefects/ConDefects/Code/abc243_f/Python/40101065 |
condefects-python_data_2777 | n,x = map(int,input().split())
a = list(map(int,input().split()))
c = [[] for _ in range(n)]
m = max(a)
for i in range(n):
p = 1
while True:
l,r = p*a[i],p*a[i]+(p-1)*x
if l<=m<=r:
c[i] = [0,0]
break
elif r<m:
p *= 2
else:
y,z = p//2*a[i]+(p//2-1)*x,p*a[i]
c[i] = [y-m,z-m]
break
c.sort()
d =... | ConDefects/ConDefects/Code/agc057_b/Python/31505448 |
condefects-python_data_2778 | N,X=map(int,input().split())
A=list(map(int,input().split()))
L=[]
u=max(A)
x=u
y=x
for i in range(N):
l=A[i]
r=A[i]
if l==u:
L.append([l,r])
continue
while True:
l2=2*l
r2=2*r+X
if l2<=u<=r:
L.append([u,u])
break
if l2>=u:
L.append([r,l2])
break
l=l2
r=r2... | ConDefects/ConDefects/Code/agc057_b/Python/41271287 |
condefects-python_data_2779 | from sre_constants import IN_IGNORE
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
class segtree():
n=1
size=1
log=2
d=[0]
op=None
e=10**15
def __init__(self,V... | ConDefects/ConDefects/Code/agc057_b/Python/31499069 |
condefects-python_data_2780 | import math
A,B = map(int,input().split())
if A > B:
A,B = B,A
def isOK(key):
if math.cos(key)*A/math.cos(math.pi/6-key) <= B:
return True
else:
return False
def search():
l,r = 0,math.pi/12
while r-l < 10**(-9):
mid = (r+l)/2
if isOK(mid):
r = mid
... | ConDefects/ConDefects/Code/abc292_f/Python/45523633 |
condefects-python_data_2781 | N,M,K=map(int,input().split())
mod=998244353
dp=[[0 for _ in range(M)] for _ in range(N)]
def one_d_prefix_sums(array):
N=len(array)
prefix_sums=[0 for _ in range(N)]
for i,number in enumerate(array):
if i==0:
prefix_sums[i]=number
else:
prefix_sums[i]=number+prefix... | ConDefects/ConDefects/Code/abc253_e/Python/45559213 |
condefects-python_data_2782 | N, M, K = map(int, input().split())
mod = 998244353
dp = [[0]*M for _ in range(N)]
for i in range(M):
dp[0][i] = 1
for i in range(N-1):
s = [0]
for j in range(M):
s.append(s[-1]+dp[i][j])
for j in range(M):
dp[i+1][j] += s[max(j-K+1, 0)] - s[0]
dp[i+1][j] += s[M] - s[min(j+K, M... | ConDefects/ConDefects/Code/abc253_e/Python/45470734 |
condefects-python_data_2783 | from itertools import accumulate
mod = 998244353
N, M, K = map(int, input().split())
dp = [[0]*(M+1) for _ in range(N)]
for a in range(1, M+1):
dp[0][a] = 1
for i in range(1, N):
ac0 = list(accumulate(dp[i-1]))
ac1 = list(accumulate(reversed(dp[i-1])))
ac1.reverse()
for a in range(1, M-K+1):
... | ConDefects/ConDefects/Code/abc253_e/Python/45941559 |
condefects-python_data_2784 | def ip():return int(input())
def mp():return map(int, input().split())
def lmp():return list(map(int, input().split()))
# ABC253 1073 E - Distance Sequence PyPyで提出
# 長さ N の整数からなる数列 A = (A1,…,AN) であって、以下の条件を全て満たすものは何通りありますか？
# ・1 ≤ Ai ≤ M (1 ≤ i ≤ N)
# ・|Ai - A_{i+1}| ≥ K (1 ≤ i ≤ N-1)
# ただし、答えは非常に大きくなることがあるので、答えを 99824... | ConDefects/ConDefects/Code/abc253_e/Python/46006044 |
condefects-python_data_2785 | N, M, K = map(int, input().split())
MOD = 998244353
if K == 0:
print(pow(N, M, MOD))
exit()
dp = [1] * M
for _ in range(N - 1):
nxt = [0] * M
cum_sum = [0] * (M + 1)
for i in range(M):
cum_sum[i + 1] = cum_sum[i] + dp[i]
cum_sum[i] %= MOD
for i in range(M):
if 0 <= i - ... | ConDefects/ConDefects/Code/abc253_e/Python/45032521 |
condefects-python_data_2786 | from sys import stdin
readline = stdin.readline
t = int(readline())
mod = 998244353
for _ in range(t):
n = int(readline())
m = int(n**0.5 + 0.001)
ans = pow(m, 3, mod)
j = m
for i in range(m, 0, -1):
x = n // i
ans += 3 * (x - j) * i**2
ans %= mod
j = x
print(ans... | ConDefects/ConDefects/Code/arc160_b/Python/44408882 |
condefects-python_data_2787 | import math
T = int(input())
for _ in range(T):
N = int(input())
num = int(math.sqrt(N)+1e-9)
ans = num ** 3
for y in range(1, num):
num_x = y
num_z = N // y - num
ans += (num_x-1) * num_z * 6 + num_z*3
ans %= 998244353
print(ans)
import math
T = int(input())... | ConDefects/ConDefects/Code/arc160_b/Python/41448583 |
condefects-python_data_2788 | import math
MOD=998244353
t=int(input())
mul = lambda a,b: (a*b)%MOD
add = lambda a,b : (a+b)%MOD
for _ in range(t):
n=int(input())
s=int(math.sqrt(n))
ans = mul(s, mul(s,s))
for x in range (1, s+1):
v = n//x
ans= add(ans, mul(x, max(0, v-s-1)))
print(ans)
import math
MOD=998244353
t=int(input())
mul... | ConDefects/ConDefects/Code/arc160_b/Python/45326748 |
condefects-python_data_2789 | a=list(input())
a[3]=a[2]
a[2]=a[1]
a[1]=a[0]
a[0]="0"
print(a)
a=list(input())
a[3]=a[2]
a[2]=a[1]
a[1]=a[0]
a[0]="0"
print("".join(a))
| ConDefects/ConDefects/Code/abc247_a/Python/45954130 |
condefects-python_data_2790 | class SegmentTree:
def __init__(
self,
n, # 列の長さ
identity_e, # 単位元
combine_f, # 2 つのデータから値を合成するための関数
):
self._n = n
self._size = 1
while self._size < self._n:
self._size <<= 1
self._identity_e = identity_e
self._... | ConDefects/ConDefects/Code/abc339_e/Python/52923119 |
condefects-python_data_2791 | # import sys
# sys.setrecursionlimit(10**6)
# sys.set_int_max_str_digits(10**6)
# from scipy.optimize import bisect
# from collections import defaultdict, Counter
# import bisect
# import heapq
from atcoder.segtree import SegTree
from sortedcontainers import SortedList
# mod = 998244353
# ds = [(-1,0),(0,1),(1,0),(0,-... | ConDefects/ConDefects/Code/abc339_e/Python/54055907 |
condefects-python_data_2792 | N = int(input())
S = input()
cnt = 0
for i in S:
if i == "T":
cnt += 1
if cnt > N - cnt:
print("T")
else:
print("A")
N = int(input())
S = input()
cnt = 0
for i in S:
if i == "T":
cnt += 1
if cnt > N - cnt or (cnt == N - cnt and S[-1] == "A"):
print("T")
else:
print("A") | ConDefects/ConDefects/Code/abc301_a/Python/45927126 |
condefects-python_data_2793 | N = int(input())
S = list(input())
T=0
A=0
for i in range(N):
if(i == N-1):
if(N % 2 == 0):
if(T>A):print('T')
else:print('A')
else:
print(S[i])
if(S[i] == 'T'):T+=1
elif(S[i] == 'A'):A+=1
print(f'A:{A},T:{T}')
if(A>=(N/2+1)):
print('A')
bre... | ConDefects/ConDefects/Code/abc301_a/Python/45433034 |
condefects-python_data_2794 | N = int(input())
S = input()
t, a, t_win, a_win = 0, 0, False, False
for i in range(N):
if S[i] == "T":
t += 1
else:
a += 1
if N % 2 == 0 and N / 2 == t:
t_win = True
elif N % 2 == 0 and N / 2 == a:
a_win = True
if t > a:
t_win = True
elif a > t:
a_win = True
if t_win == True:
print("T")
i... | ConDefects/ConDefects/Code/abc301_a/Python/45347926 |
condefects-python_data_2795 | N = int(input())
S = input().split()
T_W = S.count('T')
A_W = S.count('A')
print("T" if T_W > A_W or T_W == A_W and S[-1] == "A" else "A")
N = int(input())
S = input()
T_W = S.count('T')
A_W = S.count('A')
print("T" if T_W > A_W or T_W == A_W and S[-1] == "A" else "A") | ConDefects/ConDefects/Code/abc301_a/Python/45503092 |
condefects-python_data_2796 | N = int(input())
S = list(map(int, input().split()))
ans = [S[0]]
for i in range(1,N):
ans.append(S[i]-S[i-1])
print(ans)
N = int(input())
S = list(map(int, input().split()))
ans = [S[0]]
for i in range(1,N):
ans.append(S[i]-S[i-1])
print(*ans) | ConDefects/ConDefects/Code/abc280_b/Python/45270301 |
condefects-python_data_2797 | N = int(input())
S = list(map(int,input().split()))
A = [S[0]]
for i in range(1,N):
a = S[i] - A[-1]
A.append(a)
print(*A)
N = int(input())
S = list(map(int,input().split()))
A = [S[0]]
for i in range(1,N):
a = S[i] - S[i-1]
A.append(a)
print(*A) | ConDefects/ConDefects/Code/abc280_b/Python/45441628 |
condefects-python_data_2798 | n = input()
last = 10
for c in n:
if 1 <= int(c) < last:
last = int(c)
else:
print("No")
exit()
print("Yes")
n = input()
last = 10
for c in n:
if int(c) < last:
last = int(c)
else:
print("No")
exit()
print("Yes") | ConDefects/ConDefects/Code/abc321_a/Python/54748224 |
condefects-python_data_2799 | S=str(input());
o=10;
p=len(S);
b=0
for i in range(p):
N=int(S[i]);
if o<N:
o=N
b=b+1
if b==p:
print("Yes");
else:
print("No")
S=str(input());
o=10;
p=len(S);
b=0
for i in range(p):
N=int(S[i]);
if o>N:
o=N
b=b+1
if b==p:
print("Yes");
else:
print("No") | ConDefects/ConDefects/Code/abc321_a/Python/54518297 |
condefects-python_data_2800 | N = list(str(input()))
likeNum = True
for i in range(len(N)-1):
if len(N) == 1:
break
elif int(N[i]) < int(N[i+1]):
likeNum = False
print("No")
break
if likeNum:
print("Yes")
N = list(str(input()))
likeNum = True
for i in range(len(N)-1):
if len(N) == 1:
brea... | ConDefects/ConDefects/Code/abc321_a/Python/54737873 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.