problem_id stringclasses 428 values | submission_id stringlengths 10 10 | status stringclasses 2 values | code stringlengths 5 816 |
|---|---|---|---|
p02553 | s150154110 | Accepted | a,b,c,d = map(int,input().split())
print(max([a*c,a*d,b*c,b*d])) |
p02690 | s965021652 | Wrong Answer | X = int(input())
found = False
for a in range(-100, 100):
if found: break;
for b in range(-100, 100):
if a ** 5 - b ** 5 == X:
print(a, b)
found = True
break
|
p02912 | s618096673 | Wrong Answer | import heapq
n, m = map(int, input().split())
a = list(map(int, input().split()))
ans = sum(a[min(n, m):])
a = [x*(-1) for x in a]
a = a[:min(n, m)]
heapq.heapify(a)
if len(a) == 1 and n == 1:
print(a[0]//2**m)
elif len(a) == 1:
print(a[0]//2**m+ans)
else:
for i in range(m):
c = (heapq.heappop(a)*(-1)//2)*(-1)
heapq.heappush(a, c)
print(ans-sum(a))
|
p02552 | s949705952 | Accepted | x = int(input())
if x == 0:
print(1)
elif x == 1:
print(0)
|
p02572 | s303740604 | Accepted | N=int(input())
A=list(map(int, input().split()))
MOD=7+10**9
SUM=sum(A)
ans=0
for i in range(N-1):
SUM-=A[i]
ans += A[i]*SUM %MOD
print(ans %MOD) |
p03360 | s128059488 | Wrong Answer | a = list(map(int, input().split()))
k = int(input())
a.sort()
print(a[0] + a[1] + a[2] * 2 * k) |
p04031 | s588200741 | Accepted | N=int(input())
a=input().split()
numbers=[]
for n in a:
b=int(n)
numbers.append(b)
a=round(sum(numbers)/N)
answers=[]
for z in numbers:
y=(z-a)*(z-a)
answers.append(y)
print(sum(answers))
|
p03611 | s062931638 | Accepted | from collections import defaultdict
N = input()
counts = defaultdict(int)
values = set()
for a in map(int, input().split()):
counts[a] += 1
values.add(a)
ans = 0
for x in values:
ans = max(ans, counts[x - 1] + counts[x] + counts[x + 1])
print(ans)
|
p02726 | s472959949 | Wrong Answer | N,X,Y = map(int,input().split())
cut = Y-X -1
from collections import Counter
D = Counter()
for i in range(1,N):
D[i] = N-i
for i in range(1,X+1):
D[N-i] -= 1
D[X-i + cut] +=1
for i in range(1,N):
print(D[i]) |
p02630 | s432435946 | Wrong Answer | N=int(input())
List=list(map(int,input().split()))
Q=int(input())
sum=0
Number=[]
Alphabet=[]
for i in range(Q):
n,a=input().split()
Number.append(int(n))
Alphabet.append(int(a))
for i in range(N):
sum+=List[i]
for i in range(Q):
sum+=(List.count(Number[i]))*(Alphabet[i]-Number[i])
print(sum) |
p03617 | s515232485 | Wrong Answer | Q, H, S, D = map(int, input().split())
N = int(input())
cQ = Q*4
cH = H*2
cS = S
cD = D / 2
m = min(cQ, cH, cS, cD)
if m == cQ:
print(cQ * N)
elif m == cH:
print(cH * N)
elif m == cS:
print(cS * N)
else:
if N % 2 == 0:
print(D * N // 2)
elif N == 1:
print(min(cQ, cH, cS))
else:
c = (N-1)*cD
print(int(c + min(cQ, cH, cS)))
|
p02577 | s491772395 | Wrong Answer | x=int(input())
if x%9==0:
print("YES")
else:
print("NO") |
p03062 | s456115495 | Wrong Answer | def main():
s = open(0).read()
b = s.count('-')
*c, = map(int, s[2:].replace('-', '').split())
d = min(c)
e = sum(c)
if b % 2 == 0:
print(e)
else:
print(e - 2 * d)
if __name__ == '__main__':
main()
|
p02582 | s676718945 | Accepted | S = input()
count = S.count("R")
if count == 2 and S[0] == "R" and S[2] == "R":
count = 1
print(count) |
p03437 | s079979168 | Accepted | x,y=map(int, input().split( ))
if x%y==0:
print(-1)
else:
print(x) |
p02606 | s656988546 | Wrong Answer | l, r, d = map(int, input().split())
for i in range(l, r):
print(i % d) |
p03309 | s345048048 | Accepted | n = int(input())
a = list(map(int,input().split()))
a = sorted([a[i]-i-1 for i in range(n)])
ans = 0
if n%2 == 0:
b = a[n//2 - 1]
else:
b = a[n//2]
for i in range(n):
ans += abs(a[i] - b)
print(ans) |
p02792 | s937544655 | Accepted | N = int(input())
start, end, both = dict(), dict(), dict()
for i in range(1, N+1):
i_s = str(i)
l, r = int(i_s[0]), int(i_s[-1])
both[l, r] = both.get((l, r), 0) + 1
ans = 0
for i in range(1, N + 1):
i_s = str(i)
l, r = int(i_s[0]), int(i_s[-1])
ans += both.get((r, l), 0)
print(ans)
|
p03854 | s616061677 | Accepted | s = list(input())
n = len(s)
temp = ['maerd', 'remaerd', 'esare', 'resare']
s.reverse()
i = 0
while i < n:
flag = False
for t in temp:
if s[i:i+len(t)] == list(t):
i += len(t)
flag = True
break
if not flag:
print("NO")
exit()
print("YES")
|
p03137 | s318299358 | Accepted | n, m = map(int, input().split())
x = list(map(int, input().split()))
if m < n:
print(0)
exit()
x.sort()
diff = []
for i in range(m-1):
diff.append(x[i+1] - x[i] - 1)
diff.sort(reverse=True)
print(x[-1] - x[0] + 1 - sum(diff[:n-1]) - n) |
p03220 | s853307017 | Accepted | N = int(input())
T, A = map(int, input().split())
Hs = list(map(int, input().split()))
diff = list(map(lambda x: abs(A - (T - x * 0.006)), Hs))
idx = diff.index(min(diff))
print(idx + 1)
|
p03836 | s747134988 | Accepted | sx,sy,tx,ty=map(int,input().split())
for i in range(sy,ty):
print('U',end='')
for i in range(sx,tx):
print('R',end='')
for i in range(sy,ty):
print('D',end='')
for i in range(sx,tx):
print('L',end='')
print('L',end='')
for i in range(sy,ty+1):
print('U',end='')
for i in range(sx,tx+1):
print('R',end='')
print('D',end='')
print('R',end='')
for i in range(sy,ty+1):
print('D',end='')
for i in range(sx,tx+1):
print('L',end='')
print('U',end='') |
p03324 | s770854612 | Accepted | def main():
D, N = (int(i) for i in input().split())
if N == 100:
N += 1
print(N*100**D)
if __name__ == '__main__':
main()
|
p04011 | s336838695 | Accepted | n = int(input())
k = int(input())
x = int(input())
y = int(input())
cost = 0
if n > k:
for i in range(k):
cost += x
for j in range(k, n):
cost += y
print(cost)
elif n <= k:
for i in range(n):
cost += x
print(cost)
|
p03699 | s079763450 | Accepted | N = int(input())
s = []
Sum = 0
for i in range(N):
s.append(int(input()))
Sum += s[i]
s.sort()
if Sum % 10 != 0:
print(Sum)
else:
for i in range(N):
if s[i] % 10 != 0:
print(Sum - s[i])
break
if i == N - 1:
print(0) |
p02665 | s085424815 | Accepted | n = int(input())
a = list(map(int, input().split()))
if n == 0 and a[0] != 1:
print(-1)
exit(0)
b = [0] * (n + 2)
for i in range(n, 0, -1):
b[i - 1] = b[i] + a[i]
t = 1 - a[0]
ans = 1
for i in range(n):
m = min(t * 2, b[i])
if m < a[i + 1]:
print(-1)
exit(0)
ans += m
t = m - a[i + 1]
print(ans)
|
p03282 | s726652113 | Wrong Answer | s = input()
k = int(input())
flag = True
if len(s)==1:
print(int(s))
exit()
new = ''
for i in s:
if i!='1':
flag = False
new += i
if flag:
print(1)
else:
print(new[0]) |
p04030 | s152258712 | Wrong Answer | s = str(input())
result = ""
for i in range(len(s)):
if s[i] == "0":
result += "0"
elif s[i] == "1":
result += "1"
else:
if len(result) > 1:
result = result[0:i-1]
elif len(result) == 1:
result = ""
print(result) |
p03071 | s724779457 | Accepted | a, b = map(int, input().split())
print(max(a + a - 1, a + b, b + b - 1)) |
p03760 | s779782614 | Accepted | s = input()
t = input()
ans = ""
while len(t) > 0:
ans += s[0] + t[0]
s = s[1:]
t = t[1:]
ans += s
print(ans) |
p03632 | s813000429 | Accepted | a, b, c, d = map(int, input().split())
if d <= a or b <= c:
print(0)
elif c <= a and b <= d:
print(b-a)
elif a <= c and b <= d:
print(b-c)
elif c <= a and d <= b:
print(d-a)
elif a <= c and d <= b:
print(d-c)
else:
print(0)
|
p04019 | s075891580 | Accepted | s=set(list(input()))
ns=0
ew=0
if 'N' in s and 'S' in s:
ns=1
elif 'N' not in s and 'S' not in s:
ns=1
if 'E' in s and 'W' in s:
ew=1
elif 'E' not in s and 'W' not in s:
ew=1
if ns&ew:
print('Yes')
else:
print('No') |
p03720 | s144083996 | Accepted | n,m = map(int,input().split())
ab_list = [list(map(int,input().split()))
for nesya in range(m)]
city_list = [0]*n
for hoge in ab_list:
a = hoge[0]
b = hoge[1]
city_list[a-1] += 1
city_list[b-1] += 1
for city in city_list:
print(city) |
p03210 | s760755819 | Accepted | N=int(input())
if N==3 or N==5 or N==7:
print("YES")
else:
print("NO") |
p03043 | s491507580 | Wrong Answer | n,K = map(int,input().split())
p = min(n,K-1)
ans = 0
chk = [1]*(K-1)
k = K
for i in range(15):
k /= 2
if k == int(k):
q = int(k*2-k-1)
else:
q = int(k*2-k)
for i in range(q):
chk[i] += 1
if k <= 1:
break
#print(chk)
for i in range(p):
ans += float(1/(2**chk[i]*n))
#print(ans)
ans += max(0,(n-K+1)/n)
print(ans) |
p02631 | s960786150 | Accepted | n = int(input())
a = list(map(int,input().split()))
k = 0
for num in a:
k = k^num
ans = []
for num2 in a:
ans.append(str(k^num2))
print(' '.join(ans)) |
p03481 | s945954746 | Accepted | x, y = map(int, input().split())
ans = 1
while x*2 <= y:
ans += 1
x *= 2
print(ans) |
p03107 | s567292673 | Accepted | s = input()
c0 = s.count("0")
c1 = s.count("1")
print(min([c0*2,c1*2])) |
p02646 | s240143154 | Accepted | import sys
sys.setrecursionlimit(10**7)
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split())) #空白あり
def LI2(): return list(map(int,sys.stdin.readline().rstrip())) #空白なし
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split()) #空白あり
def LS2(): return list(sys.stdin.readline().rstrip()) #空白なし
A,V = map(int,S().split())
B,W = map(int,S().split())
T = I()
if V > W and T*abs(V-W) >= abs(A-B):
print('YES')
else:
print('NO') |
p02583 | s343471479 | Accepted | n = int(input())
l = list(map(int,input().split(" ")))
ans = 0
for i in range(n):
for j in range(n):
for k in range(n):
if l[i] < l[j] & l[j] < l[k]:
if l[i] != l[j] != l[k]:
if l[i] + l[j] + l[k] > max(l[i],l[j],l[k])*2:
ans += 1
print(ans)
|
p02923 | s027854807 | Accepted | n = int(input())
h = list(map(int,input().split()))
ans = 0
now = 0
for i in range(n-1):
if h[i] >= h[i+1]:
now += 1
else:
ans = max(ans,now)
now = 0
print(max(ans,now)) |
p02699 | s336741989 | Wrong Answer | S, W = map(int, input().split())
if S < W:
print('unsafe')
else:
print('safe') |
p02646 | s226805474 | Accepted | oni = list(map(int, input().split()))
nige = list(map(int, input().split()))
time = int(input())
if nige[1]>=oni[1]:
print("NO")
else:
distance = abs(oni[0]-nige[0])
diff = oni[1]-nige[1]
need_time = distance / diff
if need_time > time:
print("NO")
else:
print("YES") |
p03474 | s731675185 | Accepted | import re
A,B=map(int,input().split())
S=input()
a,b,flg=S[0:A],S[-B:],True
if S[A]!="-" or re.match(".*[^0-9].*",a) or re.match(".*[^0-9].*",b):flg=False
print("Yes" if flg else "No") |
p03623 | s314093635 | Accepted | x, a, b = map(int, input().split())
print("A" if abs(x - a) < abs(x - b) else "B") |
p02628 | s587068214 | Wrong Answer | n,k=map(int,input().split())
p=list(map(int,input().split()))
ans=0
if n!=1:
for i in range(k):
min=p[i]
for j in range(i+1,n):
if min>p[j]:
min=p[j]
p[j]=p[i]
ans+=min
else:
ans=p[0]
print(ans)
|
p02760 | s007682280 | Wrong Answer | A=[]
for i in [0]*3:
A+=list(map(int,input().split()))
N=int(input())
B=[0]*9
for i in range(N):
i=int(input())
if i in A:
B[A.index(i)]=1
res=0
for i in range(3):
res+=B[i]*B[i+1]*B[i+2]
res+=B[i]*B[i+3]*B[i+6]
res+=B[0]*B[4]*B[8]+B[2]*B[4]*B[6]
print(['No','Yes'][res>0]) |
p03427 | s270439326 | Accepted | n = input()
a = 9*(len(n)-1)
b = 0
for i in n:
b += int(i)
c = 0
for i in range(len(n)):
if i == 0:
c += int(n[i])-1
else:
c += 9
print (max(a,b,c)) |
p02726 | s562427595 | Accepted | x = input().split()
N = int(x[0])
X = int(x[1])
Y = int(x[2])
L = [0 for _ in range(N+1)]
for i in range(1,N):
for j in range(i+1,N+1):
L[min(j-i,abs(X-i)+abs(Y-j)+1)] +=1
for k in range(1,N):
print(L[k]) |
p03773 | s611785032 | Wrong Answer | a,b=map(int,input().split())
if a+b >= 24:
print(24-a-b)
else:
print(a+b) |
p04033 | s098854992 | Wrong Answer | a, b = map(int, input().split())
if a <= 0 and b >= 0:
print(0)
elif a > 0 and b > 0:
print("Positive")
elif a < 0 and b < 0:
if (b-a+1) % 2 == 0:
print("Positive")
else:
print("Negative") |
p03681 | s154636268 | Wrong Answer | N, M = [int(i) for i in input().split()]
L = abs(N - M)
if L >= 2:
print(0)
else:
E = 2*N*M
print(E) |
p03319 | s889370266 | Wrong Answer | import math
N,K=map(int,input().split())
L=list(map(int,input().split()))
M=min(L)
tmp=0
ans=float("inf")
for i in range(N):
if L[i]==M:
tmp=math.ceil(i/(K-1))
tmp+=math.ceil((N-1-i)/(K-1))
ans=min(ans,tmp)
print(ans) |
p02779 | s395894389 | Wrong Answer | n=map(int,input())
lst=len(set(map(int,input().split())))
if n==lst:
print("YES")
else: print("NO") |
p03481 | s495802156 | Wrong Answer | x,y=map(int,input().split())
from math import log2
print(1+int(0.01+log2(y/x)))
|
p04005 | s652071779 | Wrong Answer | A, B, C = map(int, input().split())
if (A * B * C) % 2 == 0:
ans = 0
print(ans)
else:
V = A*B*C
AB = A*B
BC = B*C
CA = C*A
ans = min(V-(A//2)*BC, V-((A//2) + 1)*BC)
ans = min(V-(B//2)*CA, V-((B//2) + 1)*CA)
ans = min(V-(C//2)*AB, V-((C//2) + 1)*AB)
print(V - 2*ans) |
p02712 | s157964938 | Accepted |
def read_int():
return int(input().strip())
def read_ints():
return list(map(int, input().strip().split(' ')))
def sums(a, N):
ans = ((N//a)*((N//a)+1)//2)*a
return ans
def solve():
N = read_int()
return N*(N+1)//2-(sums(3, N)+sums(5, N)-sums(15, N))
if __name__ == '__main__':
print(solve())
|
p03852 | s973280942 | Accepted | c = input()
print("vowel" if c in "aiueo" else "consonant") |
p03998 | s519609108 | Accepted | s=[0,0,0]
s[0]=list(input())
s[1]=list(input())
s[2]=list(input())
n=0
for i in range(100000):
if len(s[n])==0:
break
tmp=s[n].pop(0)
if tmp=="a":
n=0
elif tmp=="b":
n=1
else:
n=2
if n==0:
print("A")
elif n==1:
print("B")
else:
print("C") |
p04029 | s950759498 | Accepted | child = int(input())
candy = 0
for i in range(child + 1):
candy = candy + i
print(candy) |
p03146 | s233858396 | Wrong Answer | s = int(input())
def fn(n):
if n % 2 == 0:
return n // 2
else:
return 3 * n + 1
for i in range(1, 10**8):
if i == 1:
a = s
else:
a = fn(a)
if a == 4:
print(i+3)
break |
p03261 | s315435427 | Accepted | n = int(input())
ws = [str(input()) for i in range(n)]
t = ws[0][0]
for w in ws:
if ws.count(w) > 1:
print('No')
break
if t[-1] != w[0]:
print('No')
break
else:
t = w
n-=1
if n == 0:
print('Yes') |
p02835 | s915054078 | Wrong Answer | a, b, c = map(int, input().split())
x = a + b + c
if x <= 21:
print("win")
else:
print("burst") |
p02813 | s352605535 | Accepted | import itertools
from sys import exit
ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))
def main():
n = ii()
a = list(range(1,n+1))
p = li()
q = li()
pc = 0
qc = 0
for e,i in enumerate(itertools.permutations(a)):
lli = list(i)
if lli == p:
pc = e
if lli == q:
qc = e
print(abs(pc-qc))
main()
|
p03479 | s190402006 | Wrong Answer | import math
x, y = map(int, input().split())
print(int(math.log2(y/x+0.00001) + 1)) |
p03289 | s252182894 | Wrong Answer | s = input()
if s[0]=="A" and "C" in s[2:-2] and str(s[0]).isupper()== True and str(s[1]).islower()==True and str(s[-2:]).islower() == True:
a=s.index('C')
if (s[2:a]+s[a+1:-2]).islower()== True:
print('AC')
else:
print('WA') |
p03241 | s569472562 | Accepted | n,m=map(int,input().split())
p=1
for i in range(1,int(m**0.5)+1):
if m%i==0:
if m//i>=n:
if i>=n:
p=max(i,m//i,p)
else:
p=max(p,i)
print(p) |
p02726 | s093123069 | Accepted | n,x,y = map(int,input().split())
anslist = [0]*n
for i in range(1,n+1):
for j in range(i+1,n+1):
ra = j-i
rb = abs(x-i) + abs(x-j)
rc = abs(x-i) + abs(y-j) + 1
rd = abs(y-i) + abs(y-j)
anslist[min(ra,rb,rc,rd)] += 1
for i in range(1,n):
print(anslist[i])
|
p03644 | s823676244 | Wrong Answer | n=int(input())
i=0
ans=0
while n>ans:
i+=1
ans=2**i
print(ans//2) |
p03251 | s130406693 | Accepted | n, m, X, Y = map(int, input().split())
x = list(map(int, input().split()))
y = list(map(int, input().split()))
x = sorted(x)
y = sorted(y)
if(y[0] - x[len(x)-1] >= 1):
if(x[len(x)-1]-X > 0 and y[0] <= Y):
print("No War")
else:
print("War")
else:
print("War") |
p02838 | s120933016 | Accepted | import numpy as np
n = int(input())
a = list(map(int, input().split()))
a = np.array(a)
mod = 10**9 + 7
ans = 0
for i in range(60):
# a要素のi番目のデータが1であるデータの数
b = np.count_nonzero(a >> i & 1)
# 2進数 -> 10進数 (b*(N-b)は(1の個数)*(0の個数))
ans += 2 ** i * (b*(n-b))
# 和算のたびにmodで割ってあげる
ans %= mod
print(ans) |
p03042 | s325198027 | Wrong Answer | S=input()
a=int(S[:2])
b=int(S[2:])
if(1<=a<=12 and 1<=b<=12):
print("AMBIGUOUS")
elif(1<=a<=12):
print("mmyy")
elif(1<=b<=12):
print("yymm")
else:
print("na")
|
p03241 | s255959740 | Wrong Answer | import math
N,M = map(int,input().split())
sq = math.sqrt(M)
sq = math.floor(sq)
for i in range(1,sq+2):
if M % i == 0:
if i * N <= M:
ans = i
print(int(ans))
|
p02842 | s984929054 | Wrong Answer | import math
N = int(input())
def solve(n):
for i in range(n):
if math.floor(i * 1.08) == n:
print(i)
return
print(':(')
solve(N)
|
p02548 | s461134000 | Accepted | n=int(input())
ans=0
for a in range(1,n):
ans+=(n-1)//a
print(ans) |
p04012 | s157510124 | Accepted | #美しい文字列 044_B
w=input()
count=0
ans='Yes'
t=''
for i in range(len(w)):
count=0
t=w[i]
for e in range(len(w)):
if t==w[e]:
count=count+1
if count%2==1:
ans='No'
break
else:
ans='Yes'
print(ans) |
p02790 | s440589448 | Accepted | a ,b = map(int,input().split())
if a < b:
print(str(a) * b)
else:
print(str(b) * a) |
p03623 | s602697045 | Accepted | x, a, b = map(int, input().split())
if abs(x - a) < abs(x - b):
print('A')
else:
print('B') |
p03721 | s638086189 | Wrong Answer | n,k=map(int,input().split())
for i in range(n):
a,b=map(int,input().split())
k-=b
if k<=0:
print(a)
break |
p03076 | s777988040 | Wrong Answer | arr = [0]*5
for i in range(5):
arr[i] = int(input())
time = 0
for ar in arr:
time += (-(-ar//10))*10
amari = []
for i in arr:
amari.append(i%10)
amari.sort()
for i in range(4):
if 0 in amari:
amari.remove(0)
print(time - (10-amari[0]))
|
p02971 | s452766148 | Wrong Answer | N = int(input())
A = []
for i in range(N):
A.append(int(input()))
max1 = max(A)
index = []
for i in range(N):
if(A[i] == max1):
index.append(i)
A2 = sorted(set(A))
if(len(index) > 1):
max2 = max1
else:
max2 = A2[1]
for i in range(N):
if(i in index):
print(max2)
else:
print(max1)
|
p03243 | s825404627 | Accepted | N=int(input())
for i in range(N,999+1):
check=str(N)
if check[0]==check[1]==check[2]:
print(N)
exit()
N+=1
|
p02647 | s425837941 | Wrong Answer | N, K = map(int,input().split())
A = list(map(int,input().split()))
K = max(K,50)
for k in range(K):
light = [0] * N
for i in range(N):
start = max(0,i-A[i])
end = min(N-1, i+A[i])
for j in range(start, end+1):
light[j] += 1
A = light
print(" ".join(map(str,light)))
|
p02854 | s645370729 | Wrong Answer | N = int(input())
A = list(map(int, input().split()))
tmp = [0 for i in range(N+1)]
length = 0
for i in range(N):
tmp[i+1] = tmp[i] + A[i]
length += A[i]
ans = 0
for i in range(1, N+1):
ans = min(ans, abs(length - tmp[i]))
print(ans) |
p03469 | s273154946 | Accepted | s = input()
print(s.replace('2017', '2018')) |
p03617 | s158144083 | Accepted | Q,H,S,D=map(int,input().split())
N=int(input())
Min1=min(4*Q,2*H,S)
Min2=min(2*Min1,D)
Even=N//2
Odd=N%2
ans=Even*Min2+Odd*Min1
print(ans) |
p03719 | s015719301 | Wrong Answer | A, B, C = map(int,input().split())
if C >= A and C <= B:
print("Yes")
else:
print('NO')
|
p02987 | s874682207 | Accepted | def resolve():
S = set(input())
print("Yes" if len(S) == 2 else "No")
resolve() |
p02576 | s075416514 | Accepted | n, x, t = map(int, input().split())
a = n // x
if n % x == 0:
print(a * t)
else:
print((a + 1) * t) |
p03861 | s700666287 | Accepted | a, b, x = map(int, input().split())
A = a // x - (a % x == 0)
B = b // x
print(B - A)
|
p03472 | s784996419 | Wrong Answer | n,h,*L=map(int,open(0).read().split());a=max(L[::2]);print(len(b:=[l for l in L[1::2] if l>a])-((sum(b)-h)//a)) |
p03607 | s691686388 | Accepted | def main():
from collections import Counter
import sys
input = sys.stdin.readline
N = int(input()) # <= 10**5
a = [int(input()) for _ in range(N)]
ctr = Counter(a)
ans = 0
for cnt in ctr.values():
ans += cnt % 2
print(ans)
if __name__ == '__main__':
main()
# import sys
#
# sys.setrecursionlimit(10 ** 7)
#
# input = sys.stdin.readline
# rstrip()
# int(input())
# map(int, input().split())
|
p03043 | s122017653 | Accepted | n, k = list(map(int, input().split()))
ans = 0
for i in range(1, n+1):
count = 0
p = i
while p<k:
p = p*2
count +=1
ans += (1/n)*((1/2)**count)
print(ans) |
p02775 | s049331058 | Accepted | N = list(input())
N = list(map(int, N))
N = [0] + N
n = len(N)
answer = 0
for i in range(n - 1, -1, -1):
j = N[i]
if j == 10:
N[i - 1] += 1
continue
if j == 5 and N[i - 1] >= 5:
N[i - 1] += 1
answer += 5
elif j <= 5:
answer += j
else:
N[i - 1] += 1
answer += 10 - j
print(answer)
|
p02702 | s415697491 | Accepted | mod = [0]
pw = 1
for c in input()[::-1]:
mod.append((int(c) * pw + mod[-1]) % 2019)
pw = pw * 10 % 2019
from collections import *
print(sum(v * (v - 1) // 2 for v in Counter(mod).values()))
|
p02924 | s957704521 | Accepted | N = int(input())
print((N-1)*N//2) |
p02661 | s225087866 | Accepted | N = int(input())
A = [0] * N
B = [0] * N
for i in range(N):
A[i], B[i] = map(int, input().split())
A.sort()
B.sort()
if N % 2 == 1:
mid = N // 2
print(B[mid] - A[mid] +1)
else:
mid1 = N // 2
mid2 = mid1 -1
smallest = A[mid1] + A[mid2]
largest = B[mid1] + B[mid2]
print(largest - smallest + 1)
|
p03219 | s639998332 | Accepted | x,y = map(int, input().split())
print(x+int(y/2)) |
p02785 | s460255889 | Wrong Answer | N, K = map(int, input().split())
H = list(map(int, input().split()))
H = H[:-K]
print(sum(H))
|
p02951 | s825533331 | Accepted | x,y,z = [int(a) for a in input().split()]
if ((z-(x-y))<0):
print(0)
else:
print(z-(x-y))
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.