problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p03723 | s986317039 | Wrong Answer | a, b, c = map(int, input().split())
t = 0
if a == b == c:
print(-1)
else:
while (a % 2 + b % 2 + c % 2) == 0:
a, b, c = (b + c) / 2, (a + c) / 2, (a + b) / 2
t += 1
print(t) |
p02645 | s153787287 | Accepted | S = input()
print(S[:3]) |
p02633 | s745435967 | Wrong Answer | n = int(input())
print(360//n) |
p02777 | s999898357 | Accepted | S,T=input().split()
A,B=map(int,input().split())
U=input()
if S==U:
A-=1
else:
B-=1
print(str(A)+" "+str(B)) |
p02546 | s488167015 | Accepted | s = input()
if (s[-1]=='s'):
print(s+'es')
else:
print(s+'s') |
p03478 | s418291955 | Wrong Answer | a,b,c=input().split()
a=int(a)
b=int(b)
c=int(c)
d=0
for i in range(1,a):
if b<=(i//10+(i-(i//10)*10))<=c:
d=d+i
print(d) |
p02972 | s623258016 | Accepted | N=int(input())
a=[0]+list(map(int,input().split()))
b=[0]*(N+1)
for i in range(N,0,-1):
cnt=0
j=2
while i*j<=N:
cnt+=b[i*j]
j+=1
if (cnt+1)%2==a[i]:
b[i]=1
else:
b[i]=0
M=0
s=''
for i in range(1,N+1):
if b[i]==1:
s+=str(i)+' '
M+=1
print(M)
if M>0:
print(s[:-1]) |
p02897 | s291485956 | Wrong Answer | N = int(input())
if N % 2 == 0:
print("0.5000000000")
else:
tmp = int(N+1/2) +1
print(tmp/N)
|
p02553 | s701265917 | Accepted | n = input()
a, b, c, d = n.split(" ")
a = int(a)
b = int(b)
c = int(c)
d = int(d)
ac = a*c
ad = a*d
bc = b*c
bd = b*d
print(max([ac, ad, bc, bd]))
|
p02682 | s839187901 | Accepted | A, B, C, K = map(int, input().split())
if A >= K:
print(K)
elif A + B >= K:
print(A)
else:
D = K-A-B
print(A-D)
|
p03254 | s342032042 | Accepted | n, x = map(int, input().split())
a = list(map(int, input().split()))
a.sort()
s = 0
num = 0
if x>sum(a):
print(len(a)-1)
else:
for i in range(len(a)):
if x >= a[i]:
x -= a[i]
num += 1
else:
break
print(num)
|
p03472 | s077457241 | Accepted | N,H = map(int,input().split())
kill = []
throw = []
ans = 0
for i in range(N):
a,b = map(int,input().split())
kill.append(a)
throw.append(b)
throw.sort()
throw.reverse()
const = max(kill)
for j in throw:
if j <= const:
break
else:
H -= j
ans += 1
if H <= 0:
break
if H > 0:
time = H//const
if H % const == 0:
ans += time
else:
ans += time+1
print(ans) |
p02613 | s891791757 | Accepted | N=int(input())
a=0
b=0
c=0
d=0
for _ in range(N):
S=input()
if S=='AC':
a+=1
elif S=='WA':
b+=1
elif S=='TLE':
c+=1
else:
d+=1
print('AC x '+str(a))
print('WA x '+str(b))
print('TLE x '+str(c))
print('RE x '+str(d)) |
p02835 | s720141072 | Accepted | A1, A2, A3 = map(int, input().split())
R = 'win'
if A1 + A2 + A3 >= 22:
R = 'bust'
print(R) |
p02628 | s890950911 | Wrong Answer | n = input()
m = n.split()
a = [input() for l in range(0,1)]
b = a[0].split()
c = sorted(b, reverse=True)
p = 0
for i in range(0,int(m[1])):
p = p + int(c[i])
print(p) |
p02790 | s495482858 | Accepted | a,b= map(int, input().split())
if a<=b:
for i in range(b):
print(a,end="")
else:
for j in range(a):
print(b,end="")
|
p02701 | s623817949 | Accepted | n = int(input())
s = []
for i in range(n):
s.append(input())
print(len(set(s))) |
p04012 | s561880732 | Accepted | w = list(input())
all = sorted([x for x in set(w) if w.count(x) > 0])
beautiful = sorted([x for x in set(w) if w.count(x) % 2 == 0])
if all == beautiful:
print("Yes")
else :
print("No")
|
p02694 | s521277483 | Accepted | X=int(input())
cnt=0
a=100
while a<X:
cnt+=1
a=int(1.01*a)
print(cnt) |
p02912 | s036458804 | Accepted | n, m = map(int, input().split())
L=list(map(int, input().split()))
A=[]
for i in range(n):
A.append(-L[i])
import heapq
heapq.heapify(A)
for i in range(m):
a= -heapq.heappop(A)
heapq.heappush(A, -(a//2))
print(-sum(A)) |
p03042 | s807853129 | Accepted | 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") |
p02767 | s119068663 | Wrong Answer | n = int(input())
x = list(map(int,input().split()))
phy = []
tmp = 0
max = 0
count = 0
for i in range(101):
phy.append(i*i)
for j in range(1,x[n-1]):
for k in range(n):
tmp += phy[abs((j-x[k]))]
if(max > tmp or count == 0):
max = tmp
count += 1
tmp = 0
print(max) |
p03127 | s476081074 | Accepted | from fractions import gcd
n=int(input())
*a,=map(int,input().split())
a.sort()
g=gcd(a[0],a[1])
for i in range(2,n):
g=gcd(g,a[i])
print(g) |
p03162 | s161528197 | Accepted | n = int(input())
dp = [[0]*3 for i in range(n)]
li = [list(map(int, input().split())) for i in range(n)]
dp[0] = li[0]
for i in range(1,n):
dp[i][0] = max(dp[i-1][1]+li[i][0], dp[i-1][2]+li[i][0])
dp[i][1] = max(dp[i-1][0]+li[i][1], dp[i-1][2]+li[i][1])
dp[i][2] = max(dp[i-1][0]+li[i][2], dp[i-1][1]+li[i][2])
print(max(dp[-1][0], dp[-1][1], dp[-1][2])) |
p03208 | s091664470 | Accepted | n,k = map(int, input().split())
h = [[] for i in range(n)]
for i in range(n):
h[i] = int(input())
h.sort()
diff = [[] for i in range(n-1)]
for i in range(n-1):
diff[i] = h[i+1]-h[i]
t = [[] for i in range(n-1)]
t[0] = diff[0]
for i in range(1,n-1):
t[i] = t[i-1]+diff[i]
t = [0] + t
# print(h)
# print(diff)
# print(t)
ans = float("inf")
for i in range(n-k+1):
a = t[i+k-1]-t[i]
ans = min(ans, a)
print(ans)
|
p03998 | s206660709 | Accepted | s={chr(ord("a")+i): list(input()) for i in range(3)}
turn=s["a"].pop(0)
while s[turn]:
turn=s[turn].pop(0)
print(turn.upper()) |
p03086 | s155410995 | Accepted | S = list(input())
n = len(S)
ACGT = ["A","C","G","T"]
ans = 0
for i in range(n):
if S[i] in ACGT:
if i == n-1:
ans = max(ans,1)
else:
streak = 1
for j in range(i+1,n):
if S[j] in ACGT:
streak += 1
else:
break
ans = max(ans,streak)
print(ans)
|
p03105 | s261175558 | Wrong Answer | import sys
import copy
import math
import bisect
import pprint
import bisect
from functools import reduce
from copy import deepcopy
from collections import deque
if __name__ == '__main__':
a, b,c = map(int, input().split())
print( min (a//b ,c))
|
p03069 | s891997181 | Wrong Answer | #!/usr/bin/env python3
from itertools import*
n = int(input())
l = list(accumulate(map(int, input().translate(str.maketrans("#.","10")))))
q = l[-1]
m = INF = float("inf")
for i in range(n):
m = min(m, l[i] + n - i - (q - l[i]) - 1)
print(m) |
p02706 | s035586575 | Accepted | n,m = map(int,input().split())
a = list(map(int,input().split()))
print('-1' if sum(a)>n else n-sum(a)) |
p02629 | s288459424 | Accepted | num=int(input())
def num2alpha(num):
if num<=26:
return chr(64+num)
elif num%26==0:
return num2alpha(num//26-1)+chr(90)
else:
return num2alpha(num//26)+chr(64+num%26)
ans=num2alpha(num).lower()
print(ans) |
p03821 | s090844069 | Accepted | def main():
N = int(input())
A = list()
for i in range(N):
a, b = map(int, input().split())
A.append([a, b])
A.reverse()
ans = 0
offset = 0
for pair in A:
a, b = pair
if (a + offset) % b == 0:
n = 0
else:
n = b - ((a + offset) % b)
ans += n
offset += n
print(ans)
if __name__ == "__main__":
main() |
p03474 | s422879852 | Accepted | import re
a,b=input().split()
s=input()
pat ="^\d{"+a+"}-\d{"+b+"}$"
match = re.search(pat,s)
if match:
print('Yes')
else:
print('No')
|
p02778 | s728168186 | Accepted | s = input()
ans = 'x' * len(s)
print(ans) |
p02584 | s581300545 | Wrong Answer | X, K, D = map(int, input().split())
shou = X//D
amari = X%D
if D * K <= X:
print(abs(X) - D*K)
elif K - shou % 2 == 0:
print(amari)
else:
print(abs(amari - D)) |
p03380 | s702118787 | Wrong Answer | n = int(input())
l = list(map(int, input().split()))
l.sort()
m = l.pop()
a = 0
ans = 0
for r in l:
if abs((m / 2) - r) < a:
a = abs((m / 2) - r)
ans = r
print(m, ans) |
p02953 | s437121190 | Wrong Answer | N = int(input())
H = list(map(int,input().split()))
check = 0
for i in range(0,N-1):
if(H[i+1] < H[i]):
H[i+1] = H[i]
elif(H[i]-H[i+1] >= 2):
check = 1
if(check == 1):
print("No")
else:
print("Yes") |
p02742 | s481471699 | Accepted | import sys
h,w=map(int,input().split())
n=h*w
if h==1 or w==1:
print(1)
sys.exit()
if n%2==0:
print(n//2)
else:
print(n//2+1) |
p03761 | s373173909 | Accepted | N = int(input())
S = [input() for i in range(N)]
alphabet = ["a","b","c","d","e","f","g","h","i","j","k","l","m","n","o","p","q","r","s","t","u","v","w","x","y","z"]
ans = []
for i in alphabet:
tmp = 1000
for j in range(N):
count = S[j].count(i)
if count < tmp:
tmp = count
for j in range(tmp):
ans.append(i)
for i in range(len(ans)):
print(ans[i],end="") |
p03493 | s512550322 | Accepted | #!/usr/bin/env python3
print(input().count("1")) |
p03680 | s474926036 | Accepted | N=int(input())
A = []
for i in range(N):
Ai=int(input())
A.append(Ai)
on = 1 #現実世界での番号
for i in range(N):
on = A[on-1] #次のボタンを知るために、配列を参照する
if on == 2:
print(i+1)
break
if on != 2:
print(-1)
|
p02618 | s366476811 | Wrong Answer | D=int(input())
c=list(map(int,input().split()))
s=[]
for i in range(D):
s.append(input().split())
print(i*2) |
p02957 | s148991130 | Accepted | A, B = map(int, input().split())
K = abs(A+B)//2
print(K if abs(A-K) == abs(B-K) else 'IMPOSSIBLE') |
p04019 | s312529259 | Wrong Answer | s=input()
ryoko={'S':False,'N':False,'W':False,'E':False}
for c in s:
ryoko[c]=True
if (ryoko['S'] and ryoko['N']) or (ryoko['W'] and ryoko['E']):
print('Yes')
else:
print('No')
|
p03286 | s646833530 | Wrong Answer | import sys
n = int(sys.stdin.readline().rstrip())
def base_convert(n, b):
res = ''
while n:
r = abs(n % b)
res = str(r) + res
n = (n - r) // b
return int(res) if res else 0
def main():
return base_convert(n, 3)
if __name__ == '__main__':
ans = main()
print(ans) |
p02688 | s788751228 | Accepted | n,k=map(int,input().split())
a=[1]*n
for i in range(k):
d=int(input())
x=list(map(int,input().split()))
for j in x:
a[j-1]=0
print(sum(a)) |
p02866 | s575834744 | Accepted | n = int(input())
d = list(map(int,input().split()))
MOD = 998244353
dmax = max(d)
dmin = min(d[1:])
cnt = [0] * n
for i, dd in enumerate(d):
cnt[dd] += 1
if d[0] != 0 or dmin == 0:
print(0)
exit()
ans = 1
before = cnt[0]
for i in range(1,dmax+1):
ans *= pow(before, cnt[i],MOD)
before = cnt[i]
ans %= MOD
print(ans)
|
p04030 | s970343670 | Wrong Answer | ans=""
for i in list(input()):
if ans and i=="B":ans=ans[:-1]
else:ans=ans+i
print(ans) |
p02785 | s861296752 | Accepted | N, K = map(int,input().split())
H = sorted(list(map(int,input().split())))
if K >= N:
print(0)
else:
print(sum(H[:(N-K)])) |
p02693 | s915311863 | Accepted | K = eval(input())
A, B = [eval(v) for v in input().strip().split(" ")]
i = 1
while K * i <= B:
if K * i >= A:
print("OK")
exit(0)
i += 1
print("NG") |
p03720 | s296007738 | Wrong Answer | dd = {}
n, m = map(int, input().split())
for _ in range(m):
a, b = map(int, input().split())
dd[a] = dd.get(a,0) + 1
dd[b] = dd.get(b,0) + 1
for i in sorted(dd.keys()):
print(dd[i]) |
p03095 | s915908268 | Accepted | import sys
from collections import defaultdict
sys.setrecursionlimit(10 ** 7)
rl = sys.stdin.readline
def solve():
_ = rl()
S = input()
MOD = 10 ** 9 + 7
counter = defaultdict(int)
for si in S:
counter[si] += 1
ans = 1
s = set(S)
for si in s:
ans = ans * (counter[si] + 1) % MOD
ans -= 1
print(ans)
if __name__ == '__main__':
solve()
|
p03854 | s928224405 | Wrong Answer | s = input()
import re
output ="NO"
s = re.sub('dreamer', '', s)
s = re.sub('dream', '', s)
s = re.sub('eraser', '', s)
s = re.sub('erase', '', s)
if s == "":
output = "YES"
print(output)
|
p03380 | s694131337 | Accepted | N = int(input())
A = list(map(int, input().split()))
mx = max(A)
A = [a for a in A if a < mx]
A.sort(key=lambda a: abs(mx / 2 - a))
print(mx, A[0])
|
p03067 | s856457814 | Accepted | A, B, C = map(int, input().split())
if A <= C <= B or A >= C >= B:
print("Yes")
else:
print("No") |
p02983 | s362302627 | Wrong Answer | l,r = map(int,input().split())
a = l%2019
b = r-l
if a+b >= 2019:
print(0)
else:
c = []
for i in range(l,r+1):
c.append(i%2019)
c = sorted(c)
print(c[0]*c[1]) |
p03208 | s435076798 | Wrong Answer | n,k=map(int,input().split())
h=[int(input())for _ in range(n)]
h.sort()
ls=[]
for i in range(n-1):
ls+=str(abs(h[i]-h[i+1]))
ls.sort()
ans=0
for i in range(k-1):
ans+=int(ls[i])
print(ans) |
p03407 | s971518294 | Wrong Answer | A, B, C = map(int, input().split())
print("Yes" if A+B>C else "No") |
p02818 | s688295899 | Accepted | A, B, K = map(int, input().split())
AK = A-K
if AK < 0:
BK = AK+B
if BK < 0:
print(0, 0)
else:
print(0, BK)
else:
print(AK, B)
|
p03077 | s202994047 | Accepted | n = int(input())
a = []
for i in range(5):
a.append(int(input()))
x = min(a)
ans = (n-1)//x + 5
print(ans) |
p02861 | s097600642 | Accepted | import itertools as itr
N = int(input())
x = [0]*N
y = [0]*N
for i in range(N):
x[i],y[i] = map(int,input().split())
L = list(range(N))
P = list(itr.permutations(L,N))
D = 0
for i in P:
for j in range(N-1):
D += ((x[i[j]] - x[i[j+1]])**2 + (y[i[j]] - y[i[j+1]])**2)**0.5
print(D / len(P))
|
p03457 | s064323262 | Wrong Answer | N=int(input())
L=[[0,0,0]]
for i in range(N):
L.append(list(map(int,input().split())))
s=0
for i in range(1,N+1):
if abs(L[i][1]-L[i-1][1])+abs(L[i][2]-L[i-1][2]) > L[i][0]-L[i-1][0]:
s=1
break
print("Yes" if s==0 else "No") |
p03623 | s311182766 | Accepted | x, a, b = map(int, input().split())
if abs(x - a) < abs(x - b):
print('A')
else:
print('B') |
p02613 | s581083527 | Accepted | n = int(input())
li = [input() for _ in range(n)]
check = ['AC', 'WA', 'TLE', 'RE']
ans = [0] * 4
for i in li:
for j in range(4):
if i == check[j]:
ans[j] += 1
for i in range(4):
print(check[i] + ' x ' + str(ans[i])) |
p02778 | s640049003 | Accepted | S = input()
L = len(S)
res = ""
for l in range(L):
res = res + "x"
print(res) |
p02664 | s779850720 | Wrong Answer | s=input()
s=s.split()
for i in range(len(s)):
if(s[i]=='?'):
s[i]='D'
#PD?D??P
for i in range(len(s)):
print(s[i]) |
p02983 | s321245797 | Wrong Answer | l,r=map(int,input().split())
cnt=[]
for i in range(l,r+1):
if i%2019!=0:
for j in range(l,r+1):
if j%2019>=0:
a=(l*(l+1)%2019)
cnt.append(a)
break
else:
a=(j*(j-1)%2019)
cnt.appnd(a)
break
print(min(cnt)) |
p02595 | s992936858 | Accepted | import math
N, D = list(map(int, input().split()))
ans = 0
for _ in range(N):
x, y = list(map(int, input().split()))
d = math.sqrt(x ** 2 + y ** 2)
if D >= d:
ans += 1
print(ans) |
p03210 | s724357890 | Wrong Answer | i=int(input())
if(i==7 or i==5 or i==3):
print("YES")
else:
print("No") |
p03556 | s561964928 | Wrong Answer | N = int(input())
answer = 0
for x in range(1, 100000):
if x ** 2 <= N:
answer = x
else:
break
print(answer)
|
p03680 | s442184406 | Wrong Answer | n = int(input())
a = [int(input()) for i in range(n)]
t = 1
while a.count(-1) <= n:
t = a[t-1]
a[t-1] = -1
# print(t)
# print(a)
if t == -1:
break
elif t == 2:
break
if a.count(-1) >= n:
print(-1)
else:
print(a.count(-1)) |
p03759 | s902270604 | Wrong Answer | a,b,c = map(int,input().split())
print('YNEOS'[a-b!=c-b::2]) |
p02665 | s676283308 | Accepted | N = int(input())
A = list(map(int, input().split()))
if N == 0 and A[0] != 1:
print(-1)
elif N != 0 and A[0] != 0:
print(-1)
else:
ans = 1
nodes = 1
preF = 0
sucF = sum(A)
for d in range(1, N+1):
fol = A[d]
nodes = min((nodes-preF)*2, sucF)
if nodes < fol:
print(-1)
exit()
ans += nodes
preF = fol
sucF -= fol
print(ans) |
p03284 | s911210853 | Accepted | n,k=map(int,input().split())
if n%k==0:
ans=0
else:
ans=1
print(ans) |
p02779 | s327788708 | Accepted | import sys
N = int(input())
A = list(map(int,input().split()))
res = dict()
for key in A:
if key not in res:
res[key] = 0
res[key] += 1
if res[key] >= 2:
print('NO')
sys.exit(0)
print('YES') |
p02612 | s166743774 | Accepted | N=int(input())
print(0 if N%1000==0 else 1000-N%1000) |
p03282 | s157333145 | Accepted | S = input()
K = int(input())
last = "1"
ind = 100
for i,s in enumerate(S):
if s != "1":
last = s
ind = i
break
if K-1 < ind:
print("1")
else:
print(last) |
p03293 | s942672545 | Accepted | S = [*input()]
T = [*input()]
if S == T:
print("Yes")
exit()
for i in range(len(S) - 1):
s = [S[-1], *S[:-1]]
if s == T:
print("Yes")
exit()
S = s[:]
print("No") |
p02854 | s447305789 | Wrong Answer | def main():
n = int(input())
a_list = list(map(int, input().split()))
total_length = sum(a_list)
accum_length = 0
for a in a_list:
accum_length += a
if 2 * accum_length >= total_length:
ans = 2 * accum_length - total_length
break
print(ans)
if __name__ == "__main__":
main()
|
p03252 | s339231981 | Accepted | import sys
S = input()
T = input()
d_T = {}
d_S = {}
for i in range(len(S)):
if T[i] in d_T and d_T[T[i]]!=S[i]:
print("No")
sys.exit()
d_T[T[i]] = S[i]
for i in range(len(T)):
if S[i] in d_S and d_S[S[i]]!=T[i]:
print("No")
sys.exit()
d_S[S[i]] = T[i]
print("Yes") |
p03417 | s296950199 | Wrong Answer | n, m = map(int, input().split())
print((n-2)*(m-2)) |
p03759 | s593986765 | Wrong Answer | # 柱の高さ（aメートル,bメートル,cメートル）を整数で入力
a,b,c = map(int,input().split())
# b-aとc-bが同じなら美しい（Yes）、そうでなければNo
if b - a == c - b:
print("Yes")
else:
print("No") |
p03680 | s125183988 | Accepted | n = int(input())
buttons = [0] * 10**5
for i in range(n):
buttons[i] = int(input())
next = 1
i = 0
while next != 2:
i += 1
next = buttons[next-1]
if next == 2:
print(i)
exit()
if i >= 10**5:
print(-1)
break
|
p03543 | s330841467 | Accepted | N = input()
if N[0] == N[1] == N[2] or N[1] == N[2] == N[3]:
print('Yes')
else:
print('No') |
p03427 | s007168582 | Wrong Answer | n=int(input())
m=int(n)
cnt=int(0)
while m>9:
m/=10
cnt+=1
ans=m-1+cnt*9
Ans=int(0)
while n>0:
Ans+=n%10
n/=10
print(int(max(Ans,ans))) |
p03910 | s274474501 | Accepted | N = int(input())
s = 0
for i in range(1, N + 1):
s += i
if s >= N:
tmp = i
break
n = s - N
for i in range(1, n):
print(i)
for i in range(n + 1, tmp + 1):
print(i)
|
p03069 | s718763694 | Accepted | N=int(input())
S=input()
use=[0 if S[i]=="." else 1 for i in range(N)]
now=[0 for i in range(N)]
count=sum(use)
lst=set()
lst.add(count)
for i in range(N-1,-1,-1):
now[i]=1
if use[i]:
use[i]=0
count-=1
else:
use[i]=1
count+=1
lst.add(count)
print(min(lst))
|
p03417 | s607771472 | Accepted | N, M = map(int, input().split())
if N == 1 and M == 1:
print(1)
elif M == 1:
print(N-2)
elif N == 1:
print(M-2)
else:
print((N-2)*(M-2))
|
p03437 | s214811006 | Wrong Answer | from sys import exit
X, Y = map(int,input().split())
if X % Y == 0 or Y % X == 0: pass
else:
for i in range(10 ** 18 + 1):
if i % X == 0 and i % Y != 0:
print(i)
exit()
print(-1) |
p02900 | s249909944 | Accepted | import math
def prime(g):
l = []
p = 2
while p * p <= g:
if g % p != 0:
p += 1
continue
while g % p == 0:
g //= p
l.append(p)
p += 1
if g != 1:
l.append(g)
return len(l)
a, b = map(int, input().split())
g = math.gcd(a, b)
print(prime(g) + 1)
|
p02748 | s552356624 | Accepted | a, b, m = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
minv = min(A) + min(B)
for i in range(m):
x, y, c = map(int, input().split())
x -= 1
y -= 1
minv = min(minv, A[x] + B[y] - c)
print(minv) |
p02631 | s751765941 | Wrong Answer | n=int(input())
a=list(map(int,input().split()))
ans=[]
b=a.copy()
del b[0]
a1=0
for i in b:
a1=a1^i
ans.append(a1)
for i in b:
ansi=a1^i
ans.append(ansi)
for i in range(n):
print(ans[i],end=' ') |
p02778 | s300403348 | Wrong Answer | s=input()
s=list(s)
print("X"*len(s)) |
p03371 | s871637592 | Accepted | a,b,c,X,Y=map(int,input().split())
s=min(X,Y)
t=max(X,Y)
ans1=2*c*s+a*(X-s)+b*(Y-s)
ans2=a*X+b*Y
ans3=2*c*t
print(min(ans1,ans2,ans3))
|
p02832 | s644798679 | Accepted | n = int(input())
a_list = list(map(int, input().split()))
ans = 0
wait_for = 1
for a in a_list:
if a == wait_for:
wait_for += 1
else:
ans += 1
if wait_for == 1:
print(-1)
else:
print(ans) |
p02983 | s490615449 | Wrong Answer | l, r = list(map(int,input().split()))
mins = 10**9
for i in range(l, r):
mins = min( (i * (i+1))%2019, mins)
if mins == 0:
break
print(mins) |
p03339 | s508249003 | Accepted | n = int(input())
s = input()
ecounter = [0 for _ in range(n)]
wcounter = [0 for _ in range(n)]
ecounter[0] = int(s[0]=='E')
wcounter[n-1] = int(s[n-1]=='W')
ans = n
for i in range(n-1):
ecounter[i+1] = ecounter[i] + (s[i+1]=='E')
wcounter[n-2-i] = wcounter[n-1-i] + (s[n-2-i]=='W')
for j in range(n):
cnt = n - (ecounter[j]+wcounter[j])
ans = min(cnt,ans)
print(ans) |
p03416 | s455141062 | Accepted | # coding: utf-8
(a,b) = map(int, input().rstrip().split(" "))
ans = 0
for i in range(a,b+1):
if str(i) == "".join(reversed((str(i)))):
ans += 1
print(ans) |
p03241 | s354733366 | Wrong Answer | n,m=map(int,input().split())
m_root = int(m**0.5)
ans=0
for i in range(1,m_root+1):
if m%i == 0 and m/i >= n:
ans = max(ans, i)
print(ans) |
p02756 | s643153883 | Wrong Answer | from collections import deque
S = deque(input().split())
Q = int(input())
for i in range(Q):
QList = deque(input().split())
if QList[0] == '1':
S.reverse()
else:
if QList[1] == '1':
S.appendleft(QList[2])
else:
S.append(QList[2])
print("".join(list(S))) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.