problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p03799 | s506794551 | Accepted | n, m = map(int,input().split())
ans = 0
if n*2 >= m:
ans += m//2
else:
ans += n
m -= n*2
ans += m//4
print(ans) |
p02678 | s212392728 | Accepted | import networkx as nx
n,m=map(int,input().split())
s=[list(map(int,input().split())) for i in range(m)]
g=nx.Graph()
g.add_edges_from(s)
print("Yes")
for x in sorted(nx.bfs_predecessors(g,1)):
print(x[1]) |
p03524 | s661675391 | Accepted | from collections import Counter
S = input()
C = Counter(S)
vs = sorted(list(C.values()))
if len(vs) == 1:
print("YES") if vs[0] == 1 else print("NO")
elif len(vs) == 2:
print("YES") if vs[0] == vs[1] and vs[0] == 1 else print("NO")
else:
print("YES") if vs[2] - 1 <= vs[0] and vs[2] - 1 <= vs[1] else print("NO")
|
p03827 | s051581430 | Accepted | n = int(input())
s = input()
x = 0
max = 0
for i in range(n):
if s[i]=='I':
x += 1
if x > max:
max = x
else:
x -= 1
print(max) |
p02970 | s344030139 | Accepted | from sys import stdin
nii=lambda:map(int,stdin.readline().split())
lnii=lambda:list(map(int,stdin.readline().split()))
n,d=nii()
num=d*2+1
print((n+num-1)//num) |
p02627 | s986784042 | Accepted | import sys
input = sys.stdin.readline
x = input()
print('A' if x.isupper() else 'a')
|
p03633 | s583844013 | Wrong Answer | def gcd(a, b):
if(a == 0):
return b
return gcd(b % a, a)
def lcm(a, b):
return int(a/(gcd(a, b) * b))
t = int(input())
ans = 1
while(t != 0):
t -= 1
n = int(input())
ans = lcm(ans, n)
ans = int(ans)
print(int(ans))
|
p02628 | s063522656 | Wrong Answer | a,b = map(int,input().split())
mylist = input().split()
mylist.sort()
c = 0
print(mylist)
for i in range(b-1):
c = c + int(mylist[i-1])
print(c) |
p03352 | s894467286 | Wrong Answer | a=int(input())
i=0
while i**2<=a:
i=i+1
print((i-1)**2) |
p03208 | s731302246 | Accepted | import sys
def main():
N, K = list(map(int,input().split()))
h = [0] * N
for i in range(N):
h[i] = int(input())
h = sorted(h)
ave = []
for j in range(0,N-K+1):
ave.append(abs(h[j]-h[j+K-1]))
print(min(ave))
main() |
p03161 | s442403370 | Wrong Answer | N,K = map(int, input().split())
h = list(map(int, input().split()))
dp = [float('inf')] * 10 ** 5
dp[0] = 0
for i in range(1, N):
tmp = i
if tmp > K:
tmp = K
for j in range(1,tmp + 1):
dp[i] = dp[i - j] + abs(h[i - j] - h[i])
print(dp[N-1])
|
p03407 | s169613284 | Wrong Answer | a,b,c=map(int,input().split())
z=0
for i in range (1000):
if c-a*i<0:
break
if (c-a*i)%b==0:
Z=1
break
print("Yes" if z==1 else "No") |
p02996 | s661626196 | Wrong Answer | n = int(input())
i = 0
ab = []
while i < n:
a, b = map(int, input().split())
ab.append((a, b))
i += 1
ab.sort(key=lambda x: x[1], reverse=True)
limit = ab[0][1] - ab[0][0]
i = 1
ans = 'Yes'
while i < n:
limit -= ab[i][0]
if limit < 0:
ans = 'No'
break
i += 1
print(ans) |
p03695 | s787729380 | Accepted | n = int(input())
a = list(map(int, input().split()))
s = [0] * 13
for i in a:
s[i // 400] += 1
ans = 0
for i in range(8):
if s[i] > 0:
ans += 1
print(max(1, ans), ans + sum(s[8:]))
|
p02843 | s245134465 | Accepted | n = int(input())
if n//100*5 >= n%100:
print(1)
else:
print(0) |
p02835 | s367934120 | Accepted | a = list(map(int, input().split()))
if sum(a) >= 22:
print("bust")
else:
print("win") |
p04031 | s296716008 | Accepted | def resolve():
N = int(input())
A = sorted(list(map(int, input().split())))
start, end = min(A), max(A)
mincost = float("inf")
for i in range(start, end+1):
_cost = 0
for a in A:
_cost += abs(a-i)**2
mincost = min(mincost, _cost)
print(mincost)
if '__main__' == __name__:
resolve()
|
p03126 | s289482429 | Accepted | n,m = map(int,input().split())
ans = [int(0) for i in range(m+1)]
for i in range(n):
k = list(map(int,input().split()))
for j in range(1,k[0]+1):
ans[k[j]] += 1
#print(ans)
cnt = 0
for i in range(1,len(ans)):
if ans[i]==n:
cnt += 1
print(cnt) |
p02859 | s494086323 | Wrong Answer | r = int(input())
print("r ** 2") |
p02546 | s179619045 | Wrong Answer | s=input()
print(s+'es'[s[-1]<'s':]) |
p02767 | s361853535 | Accepted | n = int(input())
X = list(map(int,input().split()))
ans = 10000000
for p in range(1,101):
s = 0
for x in X:
s += (x - p) ** 2
ans = min(ans, s)
print(ans) |
p03408 | s197583879 | Wrong Answer | n = int(input())
s = list()
for a in range(n):
s.append(input())
t = list()
m = int(input())
for a in range(m):
t.append(input())
kind = list(set(s))
kind_length = len(kind)
counter = dict()
for a in range(kind_length):
counter[kind[a]] = 0
for a in range(n):
counter[s[a]] += 1
for a in range(m):
if t[a] not in counter:
continue
counter[t[a]] -= 1
print(max(counter.values()))
|
p02847 | s254256253 | Accepted | import sys
sys.setrecursionlimit(4100000)
import math
INF = 10**9
def main():
S = input()
weeks = ['SUN','MON','TUE','WED','THU','FRI','SAT']
for i in range(len(weeks)):
if weeks[i] == S:
print(7-i)
return
if __name__ == '__main__':
main()
|
p02747 | s887851335 | Wrong Answer | S = str(input())
ans = 0
if len(S) == 1:
print('No')
ans = 1
for i in range(len(S)-1):
if S[i] == 'h' and S[i+1] != 'i':
print('No')
ans = 1
break
if ans == 0:
print('Yes')
|
p02983 | s533266185 | Accepted |
def main():
L, R = [int(i) for i in input().split()]
if (L//2019) < (R//2019):
ans = 0
else:
ans = 10 ** 10
for l in range(L, R+1):
for r in range(l+1, R+1):
ans = min(ans, (l*r)%2019)
print(ans)
if __name__ == "__main__":
main() |
p03761 | s533267862 | Accepted | N = int(input())
al = [chr(ord('a') + i) for i in range(26)]
out = dict(zip(al,[100]*26))
for i in range(N):
S = list(input())
tmp = dict(zip(al,[0]*26))
for T in S:
tmp[T] += 1
for key in out.keys():
out[key]=min(out[key],tmp[key])
outS = ""
for key in out.keys():
outS += key*out[key]
print(outS)
|
p02958 | s920345716 | Accepted | n = int(input())
p_list = list(map(int,input().split()))
count = 0
for i in range(n):
if i+1 != p_list[i]:
count+=1
if count ==0 or count==2:
print('YES')
else:
print('NO') |
p02818 | s307242565 | Accepted | A, B, K = map(int, input().split())
if K <= A:
print(A-K, B)
elif K <= A+B:
print(0, B-(K-A))
else:
print(0, 0) |
p02996 | s583275372 | Accepted | N = int(input())
AB = []
for _ in range(N):
A, B = map(int,input().split())
AB.append([B,A])
AB.sort()
t = 0
for i in range(N):
t += AB[i][1]
if t > AB[i][0]:
print("No")
exit()
print("Yes") |
p02570 | s636501023 | Accepted | # 入力
D, T, S = input().split()
# 以下に回答を記入
D = int(D)
T = int(T)
S = int(S)
if D - T * S <= 0:
print('Yes')
else:
print('No') |
p02881 | s597556799 | Accepted | N = int(input())
ans = N-1
for i in range(2, int(N**0.5)+1):
if N%i == 0:
ans = min([ans, i+N//i-2])
print(ans) |
p03455 | s309557910 | Accepted | a,b = [int(i) for i in input().split()]
print("EOvdedn"[a*b%2::2]) |
p02742 | s586885825 | Accepted | H,W = map(int,input().split())
if H == 1 or W == 1:
print(1)
else:
print((H*W+1)//2) |
p02912 | s137809278 | Accepted | import math # noqa
import bisect # noqa
import queue # noqa
if __name__ == '__main__':
N, M = map(int, input().split())
A = list(map(int, input().split()))
que = queue.PriorityQueue()
for a in A:
que.put(-a)
while M > 0:
M -= 1
a = que.get()
que.put(-(-a // 2))
ans = 0
while not que.empty():
ans += -que.get()
print(ans)
|
p02848 | s280735267 | Wrong Answer | n=int(input())
s=input()
alpha=[chr(i) for i in range(ord("A"),ord("Z")+1)]
encode=alpha[n:]+alpha[:n]
text=[]
for c in s:
text.append(encode[alpha.index(c)])
print("".join) |
p03796 | s188260024 | Wrong Answer | n=int(input())
mod=10**9+7
p=n
for i in range(n):
p*=i+1
p=p%mod
print(p) |
p04044 | s210408022 | Accepted | N,L=map(int,input().split())
lst=[]
for _ in range(N):
arg=input()
lst.append(arg)
lst.sort()
print(''.join(lst)) |
p02706 | s406276484 | Accepted | m,n = map(int,input().split())
l = list(map(int,input().split()))
s = 0
for i in range(n):
s += l[i]
print(max(m-s,-1)) |
p02594 | s219760273 | Accepted | X=int(input())
if X>=30:
print("Yes")
else:
print("No") |
p02756 | s524839773 | Wrong Answer | s=input()
n=int(input())
r=-1
for i in range(n):
q=input().split()
if q[0]=='1':
r*=-1
else:
t=int(q[1])
if t*r==(-1 or 2):
s=q[2]+s
else:
s=s+q[2]
if r==1:
s=s[::-1]
print(s)
|
p03435 | s458898035 | Wrong Answer | ll=[list(map(int,input().split())) for i in range(3)]
for i in range(2):
for j in range(i+1,3):
for k in range(3):
if ll[k][i]==ll[k][j]:
if not all(ll[t][i]==ll[t][j] for t in range(3)):
print('No')
exit()
if ll[i][k]==ll[j][k]:
if not all(ll[i][t]==ll[j][t] for t in range(3)):
print('No')
exit()
print('Yes') |
p02608 | s867664677 | Accepted | n = int(input())
cont = [0 for i in range(10050)]
for x in range(1,105):
for y in range(1,105):
for z in range(1,105):
v = x**2 + y**2 + z**2 + z*x + y*z + x*y
if v <= 10001:
cont[v]+=1
for i in range(1,n+1):
print(cont[i])
|
p02820 | s318374892 | Wrong Answer | N, K = map(int, input().split())
R, S, P = map(int, input().split())
T = list(input())
opt = {
"r": "p",
"s": "r",
"p": "s"
}
ans = 0
prev = []
for i, x in enumerate(T):
if i - K >= 0 and opt[x] == prev[i-K]:
prev.append(x)
else:
prev.append(opt[x])
for i, x in enumerate(prev):
if x == T[i]:
pass
else:
ans += eval(x.upper())
print(ans) |
p02682 | s636993049 | Accepted | a,b,c,k=map(int,open(0).read().split())
if k<=a+b:
print(min(a,k))
else:
cntc=k-a-b
print(a-cntc) |
p02608 | s902245572 | Accepted | import math
N = int(input())
S = [0]*N
lim = math.sqrt(N)
lim = math.floor(lim)
for i in range(1,lim):
for j in range(1,lim):
for k in range(1,lim):
temp = int(i**2+ j**2 + k**2 + i*j + j*k + k*i)
if temp <N+1:
S[temp-1] += 1
for i in range(N):
print(S[i])
|
p02608 | s604333815 | Wrong Answer | def func(n):
cnt = 0
for x in range(1, 101):
for y in range(1, 101):
for z in range(1, 101):
if x**2+y**2+z**3+x*y+y*z+z*x == n:
cnt += 1
return(cnt)
n = int(input())
for i in range(1, n+1):
print(func(i))
|
p04020 | s160078062 | Accepted | n = int(input())
cur = 0
res = 0
for _ in range(n):
x = int(input())
if x == 0:
res += cur // 2
cur = 0
else:
cur += x
res += cur // 2
print(res)
|
p02848 | s965435595 | Wrong Answer | n = int(input())
s = input()
ans = s[:-1] + chr((ord(s[-1])+n-1 - ord('A'))%26 + 1 + ord('A'))
print(ans)
|
p02714 | s096875471 | Accepted | N = int(input())
S = input()
r = S.count('R')
g = S.count('G')
b = S.count('B')
ans = r*g*b
for i in range(0,N):
for j in range(i,N):
k = 2*j - i
if j < k <= N-1:
if S[i] != S[j] and S[i] != S[k] and S[j] != S[k]:
ans -= 1
print(ans) |
p03711 | s820833316 | Wrong Answer | x, y = map(int, input().split())
group_1 = [1, 3, 5, 7, 8, 10, 12]
group_2 = [4, 6, 9, 11]
if x == 2 or y == 2:
print("No")
exit()
else:
if x in group_1 and y in group_1:
print("Yes")
elif x in group_2 and y in group_2:
print("Yes")
|
p03555 | s857616143 | Accepted | a = input()
b = input()
if a[::-1] == b:
print("YES")
else:
print("NO") |
p02713 | s587179906 | Wrong Answer | import math
math.gcd(2,10)
N =int(input())
total = 0
a=1
b=1
c=1
if N ==1:
total =1
while a <=N:
b=1
while b <=N:
c=1
while c <=N:
if math.gcd(a,b)==1:
total += N
break
total += math.gcd(a,math.gcd(b,c))
c+=1
b+=1
a+=1
print(total) |
p02731 | s887653623 | Accepted | l = int(input())
x = l / 3
print(x ** 3)
|
p03544 | s638464502 | Accepted | N = int(input())
L = [0 for i in range(N+1)]
if N == 1:
print(1)
else:
L[0] = 2
L[1] = 1
for n in range(2,N+1):
L[n] = L[n-1] + L[n-2]
print(L[N]) |
p03705 | s081733428 | Accepted | N, A, B = map(int,input().split())
min = A * (N - 1) + B
max = B * (N - 1) + A
if (max - min) + 1 < 0:
print("0")
else:
print((max - min) + 1) |
p03644 | s064265803 | Wrong Answer | n=int(input())
maxx=0
maxn=0
for i in range(1,n+1):
tmp=i
cnt=0
while 1:
if tmp%2==0:
tmp=tmp//2
cnt+=1
else:
break
if cnt > maxx:
maxn=tmp
print(maxn)
|
p02606 | s987913791 | Accepted | l,r,d=list(map(int,input().split()))
cnt=0
for i in range(l,r+1):
if i%d==0:
cnt+=1
print(cnt) |
p03767 | s369629304 | Wrong Answer | N=int(input())
ai=list(map(int,input().split()))
ai.sort()
ans1=ai[N:]
ans2=ans1[:N]
print(ans1)
print(ans2)
print(sum(ans2)) |
p02897 | s816615490 | Accepted | X = int(input())
print(((X//2)+1)/X if X % 2 != 0 else 0.5) |
p03243 | s284390406 | Wrong Answer | n = set(input())
print(max(n)*3) |
p03720 | s430026930 | Accepted | f = lambda:map(int,input().split())
n,m = f()
d = {}
for i in range(n):
d[i+1]=0
for _ in range(m):
a,b = f()
d[a] += 1
d[b] += 1
for k in d:
print(d[k]) |
p03071 | s731091522 | Accepted | a,b=map(int,input().split())
print(max(a+a-1,a+b,b+b-1)) |
p03475 | s172316313 | Accepted | n=int(input())
L=[]
for _ in range(n-1):
L.append(tuple(map(int,input().split())))
ans=[]
for i in range(n-1):
c,t,f=L[i]
t += c
for j in range(i+1,n-1):
cn,sn,fn=L[j]
if t>sn:
t=-int(-t//fn)*fn
else:
t=sn
t += cn
ans.append(t)
ans.append(0)
for i in ans:
print(i) |
p02970 | s322080550 | Accepted | n,d=map(int,input().split())
if n%(2*d+1)!=0:
a=n//(2*d+1)+1
else:
a=n//(2*d+1)
print(a) |
p02756 | s801955552 | Wrong Answer | from collections import deque
import sys
input = sys.stdin.readline
S = input().rstrip()
Q = int(input())
FTC = [tuple(input().split()) for _ in range(Q)]
que = deque([S])
cnt = 0
for query in FTC:
if query[0] == '1':
cnt ^= 1
continue
sign = 0 if query[1] == '1' else 1
if sign ^ cnt == 0:
que.appendleft(query[2])
else:
que.append(query[2])
ans = ''
while que:
ans += que.popleft() if cnt == 0 else que.pop()
print(ans) |
p02972 | s704614727 | Wrong Answer | n=int(input())
a=list(map(int,input().split()))
ans=[0]*(n+1)
for i in range(n,0,-1):
temp=0
for j in range(i,n+1,i): temp+=ans[j]
if a[i-1]!=temp%2: ans[i]=1
print(sum(ans))
for i in range(n):
if ans[i]==1: print(i,end=" ") |
p02933 | s862146421 | Wrong Answer | if int(input())>= 3200:
print("red")
else:
print(input()) |
p02756 | s557253871 | Accepted | s = input()
p = int(input())
dir = 0
mae = []
usi = []
for _ in range(p):
Q = input().split()
if Q[0] == "1":
dir = not dir
else:
if (int(Q[1]) - 1) == dir:
mae.append(Q[2])
else:
usi.append(Q[2])
ans = "".join(mae[::-1]) + s + "".join(usi)
if not dir:
print(ans)
else:
print(ans[::-1]) |
p02882 | s741252762 | Accepted | import math
a,b,x=map(int,input().split())
S=x/a
if S<=a*b/2:
h=2*S/b
answer=math.degrees(math.atan(b/h))
print(answer)
else:
T=a*b-S
h=2*T/a
answer=math.degrees(math.atan(h/a))
print(answer)
|
p02711 | s401862967 | Wrong Answer | n = list(str(input()))
flag = True
for i in range(len(n)):
if n[i] == '7':
print('YES')
flag = False
break
if flag:
print('NO') |
p03994 | s030644331 | Accepted | t="abcdefghijklmnopqrstuvwxyz"
s=input()
k=int(input())
a=[t.index(i)for i in s]
ans=""
for i in a:
j=i
if i==0:
ans+="a"
continue
if k>=26-i:
k-=26-i
j=0
ans+=t[j]
j+=k
j%=26
ans=ans[:-1]+t[j]
print(ans) |
p03206 | s763829570 | Accepted | D = int(input())
if D == 25:
print('Christmas')
elif D == 24:
print('Christmas Eve')
elif D == 23:
print('Christmas Eve Eve')
else:
print('Christmas Eve Eve Eve')
|
p03639 | s974570137 | Accepted | n=int(input())
a=list(map(int,input().split()))
b=[0,0,0]
for i in a:
if i % 4==0:
b[0]+=1
elif i % 2==0:
b[1]+=1
else:
b[2]+=1
if b[2]<=b[0]:
print("Yes")
elif b[2]-1==b[0] and b[1]==0:
print("Yes")
else:
print("No") |
p02705 | s615936922 | Wrong Answer | print(int(input())*3.14159) |
p02603 | s255548587 | Wrong Answer | n=int(input())
I=list(map(int,input().split()))
num=1000
for i in range(n-1):
if I[i]<I[i+1]:
num-=(num//I[i])*I[i]
num+=(num//I[i])*I[i+1]
print(num)
|
p03457 | s508178105 | Wrong Answer | N = int(input())
cs = []
t1, x1, y1 = 0, 0, 0
ans = 'Yes'
for i in range(N):
t2, x2, y2 = map(int, input().split())
d = abs(x1-x2) + abs(y1+y2)
if d > (t2 - t1) or d % (t2 - t1):
ans = 'No'
print(ans)
|
p02796 | s746881188 | Accepted | from collections import deque
n = int(input())
list = [list(map(int,input().split())) for i in range(n)]
p = []
for i in list:
p.append([i[0] - i[1],i[0] + i[1]])
p = sorted(p,key = lambda x: x[1])
p = deque(p)
ex = []
ex.append(p.popleft())
for i in range(len(p)):
if(ex[-1][1] <= p[0][0]):
ex.append(p.popleft())
else:
p.popleft()
print(len(ex)) |
p02602 | s210125162 | Wrong Answer | import sys
import math
sys.setrecursionlimit(int(1e6))
n, k = list(map(int, input().split()))
A = list(map(int, input().split()))
#print('n, k = ', n, k)
#print('A = ', A)
i_l = 0
for i_r in range(k, n):
#print('i_l, i_r = ', i_l, i_r)
if A[i_l] > A[i_r]:
print('No')
else:
print('Yes')
i_l = i_l + 1
|
p02743 | s953542260 | Accepted | import math
a,b,c=map(int,input().split())
aa=math.sqrt(a)
bb=math.sqrt(b)
cc=math.sqrt(c)
ans=a**2+b**2+c**2-2*(a*b+b*c+a*c)
ans2=((aa+bb+cc)*(c-a-b+2*math.sqrt(a*b)))
print("Yes" if 0<ans/ans2 else "No") |
p03827 | s444181115 | Wrong Answer | n=int(input())
s=input()
ans=[]
for i in range(len(s)):
ans.append(s[:i].count("I")-s[:i].count("D"))
print(max(ans)) |
p03711 | s732134949 | Accepted | S="ACABABAABABA"
a,b = map(int,input().split())
print("Yes" if S[a-1]==S[b-1] else "No") |
p03434 | s107092287 | Accepted | N = int(input())
a = list(map(int, input().split()))
a = sorted(a, reverse=True)
Alice = 0
Bob = 0
for i in range(N):
if i % 2 == 0:
Alice += a.pop(0)
else:
Bob += a.pop(0)
print(Alice - Bob)
|
p03077 | s131194706 | Wrong Answer | N = int(input())
A = int(input())
B = int(input())
C = int(input())
D = int(input())
E = int(input())
X = min(A, B, C, D, E)
print((N+1)//X + 4) |
p02594 | s428544989 | Accepted | x = int(input())
if x >= 30:
print('Yes')
else:
print('No') |
p02879 | s964257481 | Wrong Answer | a,b=map(int,input().split())
print([a*b,-1][a|b>9]) |
p03001 | s783325608 | Wrong Answer | W,H,x,y=map(int,input().split())
s=W*H/2
x=1 if W//2==x and H//2==y else 0
print('{} {}'.format(s,x)) |
p02596 | s832278601 | Wrong Answer | k = int(input())
a = 0
for i in range(k):
a = (a*10+7)/k
if a == 0:
print(i+1)
quit()
print(-1) |
p02882 | s302789291 | Accepted | import math
a, b, water = map(int, input().split())
pool = a ** 2 * b
if water == pool:
ans = 0
elif water > pool / 2:
high = 2 * (pool - water) / (a ** 2)
ans = 90 - math.degrees(math.atan(a / high))
elif water == pool / 2:
ans = 45
else:
high = 2 * water / (a * b)
ans = 90 - math.degrees(math.atan(high / b))
print(ans) |
p02659 | s022101282 | Wrong Answer | a,b = input().split()
a1 = int(a)
bs = list(b)
b1 = int(bs[0])
b2 = 0
if len(b)==3:
b2 = int(bs[2])*10
else:
b2 = int(bs[2]+bs[3])
b1 = b1*100+b2
ans = int(a1*b1/100)
print(ans) |
p03997 | s267864040 | Wrong Answer | a = int(input("上底は？"))
b = int(input("下底は？"))
h = int(input("高さは？"))
daikei = (a + b) * h / 2
print("台形の面積は", daikei, "cm2") |
p03035 | s325803481 | Wrong Answer | a, b = map(int, input().split())
if a >= 13:
print(b)
elif a > 5 and a < 13:
print(b/2)
else:
print(0) |
p02820 | s411866993 | Accepted | n, k = map(int, input().split())
s = list(map(int, input().split())) # r, s, p
t = list(map(str, input()))
ans = 0
for i in range(n):
if i-k >= 0:
if t[i] == t[i-k]:
t[i] = 'change'
else:
continue
for j in range(n):
if t[j] == 'r':
ans += s[2]
elif t[j] == 's':
ans += s[0]
elif t[j] == 'p':
ans += s[1]
else:
continue
print(ans) |
p03699 | s686906146 | Accepted | N = int(input())
a = [int(input()) for _ in range(N)]
a.sort()
sum_a = sum(a)
d = sum_a
for i in range(N):
if a[i]%10 != 0:
d = a[i]
break
if sum_a%10 != 0:
ans = sum_a
else:
ans = sum_a-d
print(ans) |
p03001 | s645155231 | Wrong Answer | w,h,x,y=map(int,input().split())
if x==w or x==0:
if y==h or y==0:
print(0.0,0)
else:
w2=w//2
h2=h//2
s1=h*w2
s2=w*h2
if s1>s2:
print(s1,0)
elif s1==s2:
print(s1,1)
else:
print(s2,0)
|
p03030 | s393295284 | Accepted | N = int(input())
SP =[]
for i in range(N):
S, P = input().split()
app = [i+1,S,int(P)]
SP.append(app)
SP.sort(key=lambda x: x[2], reverse=True)
SP.sort(key=lambda x: x[1])
for i in range(N):
print(SP[i][0]) |
p02601 | s264500978 | Accepted | a, b, c = map(int, input().split())
k = int(input())
for i in range(k):
if a >= b:
b *= 2
elif b >= c:
c *= 2
if a < b and b < c:
print('Yes')
else:
print('No') |
p02696 | s631727051 | Accepted | A,B,N=map(int,input().split())
if N<B:
print(A*N//B-A*(N//B))
else:
print(A*(B-1)//B) |
p02572 | s884020738 | Accepted | N = int(input())
A = list(map(int,input().split()))
sum = 0
ans = 0
for i in range(1, N):
sum +=A[i-1]
sum = sum % (10**9 + 7)
ans = ans + (sum * A[i]) % (10**9 + 7)
ans = ans % (10**9 + 7)
print(ans) |
p03286 | s086334448 | Wrong Answer | a = int(input(""))
list = []
while(a):
if(a%(-2)==0):
list.append(0)
a//=-2
elif(a%(-2)==-1):
list.append(1)
a -= 1
a//=-2
list.reverse()
for i in list:print(i,end='')
print() |
p03797 | s877012738 | Wrong Answer | n,m=[int(x) for x in input().rstrip().split()]
mm=m//2
ave=(n+mm)//2
print(ave) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.