problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p03331 | s261590459 | Accepted | N = int(input())
t = sum([int(i) for i in list(str(N))])
# print(t)
if t == 1:
ans = 10
else:
ans = t
print(ans) |
p02756 | s596330916 | Wrong Answer | S = input()
char_S = list(S)
Q = int(input())
for i in range(Q):
query = input().split()
if query[0] == "1":
char_S.reverse()
else:
if query[1] == "1":
char_S.insert(0,query[2])
else:
char_S.insert(len(char_S),query[2])
print(char_S) |
p02948 | s523028955 | Accepted | import heapq as hp
def o():return map(int,input().split())
n,m=o()
c=[[0] for i in range(m)]
for i in range(n):
a,b=o()
if a<=m:
c[m-a]+=[-b]
d=[]
ans=0
for i in range(m-1,-1,-1):
for j in c[i]:
hp.heappush(d,j)
ans-=hp.heappop(d)
print(ans) |
p03323 | s189511793 | Accepted | a,b=map(int,input().split())
if max(a,b)<= 8:
print("Yay!")
else:
print(":(") |
p03328 | s952675015 | Accepted | a, b = map(int, input().split())
h = 0
for i in range(1, b - a):
h += i
print(h - a) |
p02848 | s239868389 | Accepted | n = int(input())
s = str(input())
alp = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'
teb = alp[n:26]+alp[0:n]
ans = ''
for w in s:
ans += teb[alp.index(w)]
print(ans) |
p02696 | s250236788 | Accepted | import math
a, b, n = map(int, input().split())
if n <= b - 1:
m = math.floor(a*n/b)
else:
m = math.floor(a-a/b)
print(m) |
p02727 | s085173041 | Wrong Answer | import sys
stdin = sys.stdin
ns = lambda: stdin.readline().rstrip()
ni = lambda: int(stdin.readline().rstrip())
nm = lambda: map(int, stdin.readline().split())
nl = lambda: list(map(int, stdin.readline().split()))
print(nl)
x, y, a, b, c = nm()
p = nl()
q = nl()
r = nl()
p.sort()
q.sort()
print(p)
print(q)
l = p[-x:] + q[-y:]
l.sort()
r.sort()
for i in range(c):
if l[i] < r[-1]:
l[i] = r.pop()
else:
break
print(sum(l))
|
p03371 | s727020656 | Accepted | a, b, c, x, y = map(int, input().split())
cost1 = a * x + b * y
cost2 = c * max(x, y) * 2
if x < y:
cost3 = c * x * 2 + b * (y - x)
else:
cost3 = c * y * 2 + a * (x - y)
print(min(cost1, cost2, cost3)) |
p02823 | s162886715 | Accepted | N, A, B=map(int, input().split())
if (B-A)%2==0:
print((B-A)//2)
else:
if A==1 or B==N:
ans=(B-A-1)//2+1
else:
ans=min(A-1, N-B)+(B-A-1)//2+1
print(ans)
|
p02584 | s301628238 | Accepted | x, k, d = map(int,input().split())
x = abs(x)
a = min(k, x//d)
k -= a
x -= a * d
if k%2==0:
print(x)
else:
print(d-x) |
p03035 | s675052672 | Accepted | a, b = map(int, input().split())
ans = 0
if a >= 13:
print(b)
elif 5 < a <= 12:
print(b // 2)
else:
print(0)
|
p02554 | s223883490 | Accepted | n = int(input())
mod=10**9+7
if n==1:
print(0)
else:
print(((10**n)-(9**n)-(9**n)+(8**n))%mod)
|
p03067 | s494234191 | Accepted | a, b, c = map(int, input().split())
print("Yes" if a <= c <= b or b <= c <= a else "No") |
p02933 | s687449648 | Wrong Answer | a=int(input())
if a>=3200:
print=("pink")
else:
print=("red") |
p02688 | s687956437 | Accepted | def io():
return map(int,input().split())
def op():
return list(map(int,input().split()))
n,k=io()
s=set()
c=0
for _ in range(k):
d=int(input())
s.update(op())
for i in range(1,n+1):
if i not in s:
c+=1
print(c) |
p03254 | s898068416 | Accepted | N,x = map(int,input().split())
a = list(map(int, input().split()))
a.sort()
cnt=0
for i in a:
x-=i
if x>=0:
cnt+=1
if x>0:
cnt-=1
print(cnt) |
p02987 | s533007084 | Accepted | s=sorted(input())
if s[0]==s[1] and s[2]==s[3] and s[1]!=s[2]:
print('Yes')
else:
print('No') |
p02678 | s216093813 | Wrong Answer | from collections import deque
N, M = map(int, input().split())
ways = [[] for i in range(N)]
for i in range(M):
a, b = map(int, input().split())
a -= 1
b -= 1
ways[a].append(b)
ways[b].append(a)
print(ways)
searched = [0 for i in range(N)]
searched[0] = 1
ans = [0 for i in range(N)]
d = deque([])
d.append(0)
while d:
tmp = d.popleft()
for w in ways[tmp]:
if searched[w] == 0:
searched[w] = 1
ans[w] = tmp
d.append(w)
print("Yes")
for a in ans[1:]:
print(a + 1) |
p02791 | s202919108 | Accepted | import sys
input = sys.stdin.readline
def main():
N = int(input())
P = [int(x) for x in input().split()]
ans = 1
mi = P[0]
for i in range(1, N):
if mi >= P[i]:
ans += 1
mi = min(mi, P[i])
print(ans)
if __name__ == '__main__':
main()
|
p03385 | s881857106 | Wrong Answer | a = input()
if a[0] != a[1] != a[2]:
print('Yes')
else:
print('No') |
p03645 | s966011125 | Accepted | import sys
from collections import defaultdict
d = defaultdict(int)
N, M = map(int, input().split())
li = [list(map(int, input().split())) for n in range(M)]
for i in li:
if i[1] == N:
d[i[0]] += 1
for i in li:
if i[0] == 1 and d[i[1]] != 0:
print("POSSIBLE")
sys.exit()
print("IMPOSSIBLE") |
p02754 | s803254653 | Accepted | N, A, B = map(int, input().split())
p = N // (A + B)
q = N % (A + B)
if q < A:
print(p*A + q)
else:
print((p+1)*A) |
p03380 | s704050327 | Accepted | n=int(input())
a=list(map(int,input().split()))
a.sort()
s=a[-1]/2
b=[[i,abs(i-s)] for i in a]
b.sort(key=lambda z:z[1])
print(a[-1],b[0][0]) |
p03565 | s410308019 | Wrong Answer | s=input()
t=input()
f=1
tmp=0
if len(s)<len(t):
print("UNRESTORABLE")
exit()
n=len(s)
m=len(t)
for i in range(n-m+1):
x=s[i:i+m]
for j in range(m+1): #
if j==m:
print((s[:i]+t+s[i+m:]).replace("?","a"))
exit()
if x[j]=="?":
continue
elif x[j]!=t[j]:
break
print("UNRESTORABLE") |
p03696 | s429077254 | Accepted | import sys
input = sys.stdin.readline
def main():
N = int(input())
S = input().strip()
S2 = S
while S2.count("()"):
S2 = S2.replace("()", "")
x = S2.count("(")
y = S2.count(")")
print(y * "(" + S + x * ")")
if __name__ == '__main__':
main()
|
p03611 | s987843324 | Wrong Answer | import collections
N = int(input())
a=list(map(int,input().split()))
b = collections.Counter(a)
b=b.most_common()
b.sort()
ans = 1
for i in range(len(b)-2):
if b[i+2][0]-b[i][0]==2:
ans=max(ans,b[i][1]+b[i+1][1]+b[i+2][1])
elif b[i+2][0]-b[i][0]>2 and b[i+1][0]-b[i][0] <= 2:
ans=max(ans,b[i][1]+b[i+1][1])
else:
ans=max(ans,b[i][1])
print(ans) |
p03605 | s691354376 | Accepted | import sys
sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7
def resolve():
n = input()
print("Yes") if "9" in n else print("No")
if __name__ == '__main__':
resolve()
|
p03338 | s318595504 | Accepted | from string import ascii_lowercase
def main():
N = int(input())
S = input()
ans = 0
for i in range(1, N-1):
left = S[:i]
right = S[i:]
letters = []
for c in ascii_lowercase:
if(c in left):
letters.append(c)
count = 0
for c in letters:
if c in right:
count += 1
ans = max(ans, count)
print(ans)
if __name__ == "__main__":
main() |
p03645 | s858051000 | Accepted | n, m = map(int, input().split())
s = []
e = []
for _ in range(m):
a, b = map(int, input().split())
if a == 1:
s.append(b)
if b == n:
e.append(a)
if set(s) & set(e):
print('POSSIBLE')
else:
print('IMPOSSIBLE') |
p02642 | s997599849 | Accepted | from sys import stdin
import sys
import math
from functools import reduce
import functools
import itertools
from collections import deque,Counter
from operator import mul
from functools import reduce
n = int(input())
a = list(map(int, input().split()))
a.sort()
count = Counter(a)
b = [1]*(max(a) + 1)
for aa in a:
for j in range(2*aa,len(b), aa):
b[j] = 0
c = 0
for d in count.items():
if d[1] == 1 and b[d[0]] == 1: c += 1
print(c) |
p03360 | s684976742 | Accepted | l = list(map(int,input().split()))
k = int(input())
l.sort(reverse=True)
for i in range(k):
l[0] *= 2
print(sum(l)) |
p03481 | s165598317 | Wrong Answer | a,s=map(int,input().split())
ans=0
while a<s:
ans+=1
a*=2
print(ans) |
p03624 | s680988078 | Wrong Answer | s=sorted(list(set(input())))
alph=[chr(i) for i in range(97,97+26)]
if len(s) == 26:
print("None")
else:
for i,j in zip(s,alph):
if i != j:
print(j)
exit() |
p02900 | s527667878 | Wrong Answer | a,b = [int(x) for x in input().split()]
import fractions
g = fractions.gcd(a,b)
ans = 1
flag = 0
mama = int(g**(1/2))
for i in range(2,mama+2):
while True:
if g%i != 0:
break
else:
g = g/i
flag = 1
if flag == 1:
ans += 1
flag = 0
if g == a and ans == 1:
ans += 1
print(ans) |
p02957 | s396713431 | Accepted | a,b = list(map(int,input().split()))
if (a+b)%2 == 0:
print((a+b)//2)
else:
print("IMPOSSIBLE") |
p03328 | s472878943 | Wrong Answer | a, b = map(int, input().split())
sub = 0
for i in range(1, 1000):
sub += i
if sub > a:
print(sub - a)
break |
p03211 | s295067094 | Accepted | #coding:utf-8
s = input()
#print(int(s[0:3]))
ans = abs(int(s[0:3]) - 753)
for i in range(0, len(s)-2):
#print(int(s[i:i+3]))
ans = min(ans, abs(int(s[i:i+3]) - 753))
print(ans) |
p03944 | s003926857 | Wrong Answer | wmax,hmax,n=map(int,input().split())
wmin,hmin=0,0
field=wmax*hmax
for i in range(n):
x,y,a=map(int,input().split())
if a==1:
wmin=max(wmin,x)
elif a==2:
wmax=min(wmax,x)
elif a==3:
hmin=max(hmin,x)
elif a==4:
hmax=min(hmax,x)
print(field-(wmax-wmin)*(hmax-hmin)) |
p02900 | s654366537 | Wrong Answer | a, b = list(map(int, input().split(' ')))
def gcd(l, s):
return l if s == 0 else gcd(s, l % s)
temp = gcd(a, b)
ans = 0
for i in range(2,100000000):
if temp % i == 0:
ans += 1
while temp % i == 0:
temp = temp // i
if temp == 1:
break
print(ans+1) |
p03037 | s053275937 | Accepted | N,M = map(int,input().split())
L = [0 for _ in range(N)]
for i in range(M):
l,r = map(int,input().split())
l-=1;r-=1 #0index
L[l] += 1
if r+1 < N:
L[r+1] -= 1
S = [0]
for i in range(N):
temp = L[i] + S[-1]
S.append(temp)
#print(S)
ans = 0
for i in range(1,N+1):
if S[i] == M:
ans += 1
print(ans) |
p02607 | s308729170 | Accepted | n = int(input())
a = list(map(int, input().split()))
ans = 0
for i in a[::2]:
if i % 2 == 1:
ans += 1
print(ans)
|
p03673 | s386973398 | Accepted | from collections import deque
n = int(input())
a = list(map(int,input().split()))
b = deque()
for i in range(n):
if i%2 == n%2:
b.extend([a[i]])
else:
b.extendleft([a[i]])
print(*list(b)) |
p02843 | s098056853 | Accepted | x = int(input())
for i in range(x):
if 100 * i <= x <= 105 * i:
print(1)
exit()
print(0) |
p03624 | s085810353 | Wrong Answer | s=sorted(set(input()))
ro='abcdefghijklmnopqrstuvwxyz'
if len(s)==len(ro):
print('None')
else:
for i in range(len(s)):
if s[i]!=ro[i]:
print(ro[i])
break |
p03371 | s627237948 | Accepted | a, b, c, x, y = map(int, input().split())
print(min([a*x+b*y, a*(x-min([x,y]))+b*(y-min([x,y]))+2*c*min([x,y]),2*c*max([x, y])])) |
p03524 | s737324253 | Accepted | S = input()
dic = {'a': 0, 'b':0, 'c':0}
for c in S:
dic[c] += 1
l = [dic['a'], dic['b'], dic['c']]
if max(l)-min(l) <= 1:
print('YES')
else:
print('NO') |
p02678 | s914300599 | Accepted | import sys
input = sys.stdin.readline
from collections import defaultdict, deque
(n, m), g = map(int, input().split()), defaultdict(list)
for i in range(m): a, b = map(int, input().split()); g[a].append(b); g[b].append(a)
s, q = [0, 0] + [-1 for i in range(1, n)], deque([1])
for i in range(2, n + 1):
x = q.popleft()
for a in g[x]:
if s[a] == -1: q.append(a); s[a] = x
if not all([a != -1 for a in s]): print('No')
else:
print('Yes')
for i in s[2:]: print(i) |
p03377 | s198996147 | Accepted | a,b,c=map(int,input().split())
print('YES' if a+b>=c and a<=c else 'NO') |
p02772 | s691797697 | Wrong Answer | n = int(input())
ai = list(map(int,input().split()))
for i in ai:
if i%3 == 0 or i%5 == 0:
print('APPROVED')
else:
print('DENIED')
|
p03000 | s992258687 | Accepted | N, X = map(int, input().split())
L = list(map(int ,input().split()))
D = 0
ans = 1
for i in range(N):
D += L[i]
if D > X:
break
ans += 1
print(ans) |
p03417 | s037147460 | Accepted | import sys
readline = sys.stdin.readline
def main():
N, M = map(int, readline().rstrip().split())
if N == 1 and M == 1:
print(1)
return
if N == 1 or M == 1:
print(max(N, M) - 2)
return
print((N-2) * (M-2))
return
if __name__ == '__main__':
main() |
p03854 | s772384714 | Accepted | import sys
S = input()
while S:
if S[-1] == 'r':
if S[-7:] == 'dreamer':
S = S[:-7]
elif S[-6:] == 'eraser':
S = S[:-6]
else:
print('NO')
sys.exit()
elif S[-5:] == 'dream' or S[-5:] == 'erase':
S = S[:-5]
else:
print('NO')
sys.exit()
print('YES') |
p02796 | s978671892 | Accepted | from collections import deque
N = int(input())
L = []
for _ in range(N):
x, l = map(int, input().split())
L.append([x-l, x+l])
L.sort(key=lambda x: x[1])
L = deque(L)
s, ans = -10**8, 0
while L:
l = deque.popleft(L)
if s<=l[0]:
ans += 1
s = l[1]
print(ans) |
p03910 | s376517839 | Accepted | n = int(input())
k = int((n * 2) ** 0.5)
while True:
p = (k+1) * k // 2
if p >= n: break
k += 1
diff = abs(n - p)
for i in range(1, k+1):
if i != diff: print(i) |
p03038 | s295798360 | Accepted | N,M=map(int,input().split())
import heapq
A=list(map(int,input().split()))
heapq.heapify(A)
BC=[]
for i in range(M):
B,C=map(int,input().split())
BC.append((B,C))
BC.sort(key=lambda x:x[1],reverse=True)
import bisect
A.sort()
now=0
D=[0]*N
for i in range(M):
B=BC[i][0]
C=BC[i][1]
for j in range(now,min(now+B,N)):
D[j]=C
now+=B
if now>N-1:
break
for i in range(N):
a=A[i]
d=D[i]
if d>a:
A[i]=d
else:
break
print(sum(A)) |
p03680 | s204131800 | Accepted | n = int(input())
line = [0]
for i in range(n):
line.append(int(input()))
check = [0 for i in range(n+1)]
count = 0
check[1] = 1
a = 1
while True:
count += 1
if line[a] == 2:
break
else:
a = line[a]
check[a] += 1
if check[a] > 1:
count = -1
break
print(count)
|
p02555 | s137296764 | Wrong Answer | #D
s = int(input())
num = [0,0,1]
for i in range(s-3):
num = [num[1],num[2],num[0]+num[2]]
#print(num)
print(num[2]%(10**9+7)) |
p02582 | s805799877 | Accepted | n = input().split('S')
print(len(sorted(n,key=len, reverse=True)[0]))
|
p03555 | s707526842 | Wrong Answer | x =[str(input()) for i in range(2)]
if x[0][0]==x[1][0] and x[0][1]==x[1][1] and x[0][2]==x[1][2]:
print("YES")
else:
print("NO") |
p03284 | s332326593 | Wrong Answer | n, k = map(int, input().split())
print(n%k) |
p03699 | s505014334 | Wrong Answer | n = int(input())
s = sorted(list(int(input()) for _ in range(n)))
ans = sum(s)
i = 0
while ans % 10 == 0:
ans -= s[i]
i += 1
if i == n:
break
print(ans) |
p02973 | s072411923 | Accepted | from collections import deque
from bisect import bisect_left
n=int(input())
d=deque()
for i in range(n):
a=int(input())
b=bisect_left(d,a)
if b==0:
d.appendleft(a)
else:
d[b-1]=a
print(len(d))
|
p03069 | s443094354 | Accepted | import sys
import collections
sys.setrecursionlimit(10 ** 8)
input = sys.stdin.readline
def main():
N = int(input())
S = input().strip()
c = collections.Counter(S)
c2 = collections.Counter()
ans = min(c['.'], c['#'])
for i in range(N):
c2[S[i]] += 1
ans = min(ans, c2['#'] + c['.'] - c2['.'])
print(ans)
if __name__ == '__main__':
main()
|
p03637 | s861533225 | Accepted | def main():
n, *a = map(int, open(0).read().split())
o = sum([i % 2 == 1 for i in a])
p = sum([i % 4 == 0 for i in a])
q = sum([i % 2 == 0 for i in a]) - p
if p + 1 >= o and not q:
print("Yes")
elif p >= o and q:
print("Yes")
else:
print("No")
if __name__ == '__main__':
main()
|
p03705 | s722540189 | Wrong Answer | N,A,B = map(int,input().split())
mx = B*(N-1)+A
mn = A*(N-1)+B
print(mx-mn+1) |
p02982 | s860964577 | Accepted | import itertools
n, d = map(int, input().split())
x = []
for _ in range(n):
xli = list(map(int, input().split()))
x.append(xli)
cnt = 0
for c in list(itertools.combinations(range(n), 2)):
total = 0
for i in range(d):
total += (abs(x[c[0]][i] - x[c[1]][i])) ** 2
ans = total ** 0.5
if ans == int(ans):
cnt += 1
print(cnt) |
p03150 | s693468168 | Accepted | s = input()
n = len(s)
ok = 0
for i in range(n):
for j in range(i, n):
if s[:i] + s[j:] == "keyence":
ok = 1
if ok == 1:
print("YES")
else:
print("NO") |
p03243 | s770132598 | Wrong Answer | n = input()
print(n[0]*len(n)) |
p02603 | s861854237 | Wrong Answer | N = int(input())
A = list(map(int, input().split()))
money = 1000
stock = 0
for i in range(N-1):
if A[i+1] > A[i]:
stock = money // A[i]
money = money % A[i]
if A[i+1] < A[i]:
money += stock * A[i]
stock = 0
print(stock * A[N-1] + money)
|
p02838 | s598982595 | Accepted | N = int(input())
a = list(input().split())
A = [int(a[i])for i in range(N)]
frag = [0 for i in range(60)]
mod = 10 ** 9 + 7
ans = 0
for i in range(60):
j = 1 << i
cnt = sum((k & j) >> i for k in A)
ans += (cnt * (N - cnt)) << i
ans %= mod
print(ans) |
p02831 | s976006421 | Accepted | import math
a, b=(int(x) for x in input().split())
print(int((a*b)/math.gcd(a,b))) |
p03221 | s487457868 | Wrong Answer | N,M = map(int,input().split())
ls = []
for i in range(M):
P,Y = map(int,input().split())
ls.append([P,Y,i])
ls.sort()
num = 1
city = ls[0][0]
for i in range(M):
if ls[i][0] == city:
ls[i][1] = num
num += 1
else:
num = 1
ls[i][1] = num
city = ls[i][0]
ls.sort(key=lambda x:x[2])
for i in range(M):
print('{0:06d}'.format(ls[i][0])+'{0:06d}'.format(ls[i][1]))
|
p03592 | s205163467 | Accepted | h,w,k = map(int,input().split())
for x in range(1001):
for y in range(1001):
if w*x + h*y - 2*x*y == k and 0<= x <= h and 0<= y <= w:
print("Yes")
exit()
print("No") |
p04011 | s499183801 | Accepted | N,K,X,Y=[int(input()) for i in range(4)]
if N>K:
print(K*X+(N-K)*Y)
else:
print(N*X) |
p02719 | s602835909 | Accepted |
n,m=map(int,input().split())
if(m>n):
c=m-n
print(min(c,n))
else:
if(n%m==0):
print('0')
else:
c=n%m
print(min(c,m-c))
|
p03632 | s198290701 | Accepted | a, b, c, d = map(int, input().split())
print(max(min(b, d) - max(a, c), 0)) |
p02719 | s195530810 | Accepted | n,k=map(int,input().split())
if n<k:
if k-n<n:
print(k-n)
else:
print(n)
elif n%k==0:
print(0)
else:
a = n // k
b= (a + 1) * k - n
c = n - a * k
t=n-k
p=k//t
r=k-p*t
print(min(b,c,r)) |
p03319 | s197943943 | Wrong Answer | def ii():return int(input())
def iim():return map(int,input().split())
def iil():return list(map(int,input().split()))
def ism():return map(str,input().split())
def isl():return list(map(str,input().split()))
n,k = iim()
A = iil()
num = A.index(1)
#if num <= k:
# print(1+(n-2)//(k-1))
#else:
print((n+k-2)//(k-1)) |
p03962 | s859479984 | Accepted | abc = map(int, input().split())
s = set(abc)
print(len(s))
|
p03338 | s068709728 | Accepted | N = int(input())
S = input()
print(max([len(set(S[:i]) & set(S[i:])) for i in range(N)])) |
p02597 | s019516610 | Wrong Answer | N=int(input())
List=list(input())
a=0
for i in range(N-1):
if List[i]=="R":
pass
else:
if List[i+1]=="W":
pass
else:
List[i+1]="W"
a+=1
print(a)
|
p03556 | s303674844 | Accepted | # -*- coding: <encoding name> -*-
n = int(input())
m = int(n ** (1 / 2)) ** 2
print(m) |
p03455 | s835566412 | Accepted | a, b = list(map(int, input().split()))
if a * b % 2:
print("Odd")
else:
print("Even") |
p03437 | s561001589 | Accepted | x,y = map(int,input().split())
if x % y == 0:
print(-1)
else:
print(x) |
p03126 | s338259731 | Accepted | n,m = map(int, input().split())
judge = [i for i in range(1, m+1)]
ans = [1 for i in range(m)]
for i in range(n):
a = list(map(int, input().split()))
a.pop(0)
for j in judge:
if not j in a:
ans[j-1] = 0
print(sum(ans)) |
p02598 | s022057153 | Accepted | n,k = map(int,input().split())
a = list(map(int,input().split()))
l = 0
r = 10**10
while r > l + 1:
m = (r+l)//2
count = 0
for i in a:
if i <= m:
continue
count += (i-1)//m
if count > k:
l = m
else:
r = m
print(r) |
p03059 | s385467952 | Wrong Answer | a,b,t = map(int,input().split())
print(b*(a//t)) |
p03997 | s342846084 | Accepted | a=int(input())
b=int(input())
h=int(input())
print(int((a+b)*h/2)) |
p02796 | s617318145 | Accepted | N = int(input())
LR = [[0,0] for _ in range(N)]
for i in range(N):
a,b = map(int, input().split())
LR[i] = [a-b,a+b]
LR.sort(key=lambda x: x[0])
# print(LR)
prev_right = - 10**9 #一つ前の右端
cnt = 0
for i in range(N):
if LR[i][0]>=prev_right: #次の左端が前の右端以上なら
cnt += 1
prev_right = LR[i][1]
else:
if LR[i][1]<prev_right:
prev_right = LR[i][1]
# print(prev_right)
print(cnt) |
p03838 | s860497084 | Accepted | x,y=map(int,input().split())
ans=0
if x*y>0:
if x<=y:
ans=y-x
else:
ans=x-y+2
elif x*y==0:
if x<=y:
ans=y-x
else:
ans=x-y+1
else:
ans=abs(abs(x)-abs(y))+1
print(ans)
|
p03474 | s931663202 | Accepted | a,b=map(int,input().split())
s=input()
if s[a]=='-' and s.count('-')==1:
print('Yes')
else:
print('No') |
p03071 | s612122874 | Wrong Answer | A, B = [int(i) for i in input().split()]
if B < A:
print(A + B + 1)
else:
print(A + B) |
p02786 | s162787861 | Accepted | import math
n=int(input())
print(2**int(math.log(n,2)+1)-1) |
p03012 | s382951846 | Accepted | n = int(input())
w = list(map(int, input().split()))
delta = max(w)
for i in range(n):
c = abs( sum(w[0:i]) - sum(w[i:n]) )
if c <= delta:
delta = c
print (delta) |
p02647 | s576593268 | Accepted | N,K = map(int,input().split())
A = list(map(int,input().split()))
B = A.copy()
def update(A):
res = [0]*N
for i in range(N):
if A[i]+i+1<N:
res[A[i]+i+1] -= 1
res[max(0,i-A[i])] += 1
for i in range(N-1):
res[i+1] += res[i]
return res
while K:
B = update(B)
K -= 1
if sum(B)==N**2:
break
print(*B) |
p03475 | s802214056 | Accepted | n = int(input())
csf = [list(map(int, input().split())) for _ in range(n-1)]
for i in range(n):
current = 0
for j in range(i, n-1):
if current < csf[j][1]:
current = csf[j][1]
if current % csf[j][2] != 0:
current += csf[j][2] - (current % csf[j][2])
current += csf[j][0]
print(current) |
p02766 | s739928538 | Wrong Answer | import math
N, K = map(int, input().split())
print(math.ceil(math.log(N, K))) |
p02624 | s811245833 | Accepted | def main():
n = int(input())
ans = 0
for i in range(1,n+1):
#print(range(i,n+1,i),sum(range(i,n+1,i)))
ans += sum(range(i,n+1,i))
print(ans)
main() |
p03293 | s604093875 | Accepted | S=input()
T=input()
for i in range(0,len(S)):
if S[-i:]+S[:-i]==T:
print('Yes')
exit()
print('No') |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.