problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p03338 | s593253155 | Accepted | n=int(input())
s=list(input())
max=0
count=0
for i in range(1,len(s)):
str1=set(list(s[0:i]))
str2=set(list(s[i:n]))
for c in str1:
if c in str2:
count+=1
if max<=count:
max=count
count=0
print(max)
|
p02835 | s307006893 | Wrong Answer | import sys
sum = 0
for x in sys.argv[1:]:
sum += int(x)
if sum > 21:
print('bust')
else:
print('win') |
p03944 | s670127003 | Wrong Answer | W, H, N = map(int, input().split())
X_Y_A = [map(int, input().split()) for _ in range(N)]
oX = 0
oY = 0
for x, y, a in X_Y_A:
if a == 1:
oX = x
elif a == 2:
W = x
elif a == 3:
oY = y
else:
H = y
A = (W-oX)*(H-oY)
print(A) if A > 0 else print(0)
|
p02612 | s864054488 | Accepted | N = int(input())
print(1000 - N % 1000 if N % 1000 != 0 else 0) |
p03106 | s371853670 | Wrong Answer | a, b, k = map(int, input().split())
def make_divisors(n):
lower_divisors , upper_divisors = [], []
i = 1
while i*i <= n:
if n % i == 0:
lower_divisors.append(i)
if i != n // i:
upper_divisors.append(n//i)
i += 1
return lower_divisors + upper_divisors[::-1]
a_y = set(make_divisors(a))
b_y = set(make_divisors(b))
#print(a_y & b_y)
y = list(a_y & b_y)
print(y[k-1])
|
p02783 | s533377821 | Accepted | h,a = map(int,input().split())
print(h//a if h%a == 0 else h//a +1) |
p02700 | s072467722 | Accepted | A, B, C, D = map(int, input().split())
while True:
if C <= B:
print("Yes")
break
if A <= D:
print("No")
break
A -= D
C -= B |
p02785 | s069068107 | Wrong Answer | N,K=map(int,input().split())
List=list(map(int,input().split()))
S=sorted(List)
if K==0:
i=1
else:
i=0
del S[i:K+1]
print(sum(S))
|
p03471 | s966250350 | Wrong Answer | n, y = map(int, input().split())
for i in range(n+1):
for g in range(n-i):
s = n-i-g
if 10000*i + 5000*g + 1000*s == y:
print(i, g, s)
exit()
print('-1 -1 -1') |
p03524 | s423722125 | Wrong Answer | from collections import Counter
S = str(input())
CS = Counter(S)
V = list(CS.values())
ans = 'YES'
if len(V) == 1:
ans = 'NO'
elif len(V) == 2:
if V[0] >= V[1]+1:
ans = 'NO'
else:
if V[0]-V[2] > 1 or V[1]-V[2] > 1 or V[0]-V[1] > 1:
ans = 'NO'
print(ans)
|
p03835 | s948109676 | Accepted | K, S = list(map(int, input().split()))
answer = 0
for i in range(K+1):
for j in range(K+1):
if S - (i + j) >= 0 and S - (i + j) <= K:
answer += 1
print(str(answer)) |
p03971 | s027808437 | Accepted | n,a,b=map(int,input().split())
s=input().strip()
njp=0
nop=0
for i in range(len(s)):
if s[i]=='a':
if njp<(a+b):
njp+=1
print('Yes')
else:
print('No')
elif s[i]=='b':
if njp<(a+b):
if nop<b:
nop+=1
njp+=1
print('Yes')
else:
print('No')
else:
print('No')
else:
print('No')
|
p02911 | s228766063 | Wrong Answer | n,k,q =map(int,input().split())
a = [int(input()) for _ in range(q)]
point = [0]*n
for i in range(q):
point[a[i]-1] += 1
print(point)
for i in range(n):
if point[i]>= q-k+1:
print("Yes")
else:
print("No") |
p02793 | s645343322 | Accepted | N = int(input())
n = input()
m = n.split()
p = [int(i) for i in m]
a = 0
b = 1
import fractions
for i in p:
c = fractions.gcd(i, b)
a = (a * i // c + b // c) % 1000000007
b = b * i // c
print(a) |
p03543 | s143589993 | Wrong Answer | n = input()
print("Yes" if (n[1] == n[2]) and len(set(n)) <= 2 else "No") |
p03555 | s360277463 | Accepted | C1=list(map(str,input()))
C2=list(map(str,input()))
if C1[0]==C2[2] and C1[1]==C2[1] and C1[2]==C2[0]:
print("YES")
else:
print("NO") |
p03286 | s023045134 | Accepted | n = int(input())
x = ""
while n != 0:
x = str(n % 2)+x
n = -(n//2)
print(0 if x == "" else x)
|
p02866 | s718023127 | Accepted | mod = 998244353
n = int(input())
d = list(map(int, input().split()))
if d[0] != 0:
print(0)
exit(0)
max_d = max(d)
cnt = [0] * (max_d + 1)
for num in d:
cnt[num] += 1
if cnt[0] > 1:
print(0)
exit(0)
ans = 1
for i in range(1, len(cnt)):
ans *= pow(cnt[i - 1], cnt[i], mod)
ans %= mod
print(ans)
|
p02847 | s543861687 | Accepted | S = input()
if S == 'SUN':
print('7')
elif S == 'MON':
print('6')
elif S == 'TUE':
print('5')
elif S == 'WED':
print('4')
elif S == 'THU':
print('3')
elif S == 'FRI':
print('2')
elif S == 'SAT':
print('1')
else:
print('Error') |
p03210 | s953437074 | Accepted | x=int(input())
if x==3 or x==5 or x==7:
print("YES")
else:
print("NO")
|
p03971 | s317850676 | Accepted | n,a,b = map(int, input().split())
s = input()
students_passed = 0
rank = 0
for i, j in enumerate(s):
if students_passed < a+b and j == 'a':
students_passed += 1
print('Yes')
elif students_passed < a+b and j == 'b' and rank <= b-1:
rank += 1
students_passed += 1
print('Yes')
else:
print('No')
|
p02957 | s487317410 | Accepted | A,B=map(int,input().split())
C=max(A,B)+min(A,B)
if C % 2 !=0:
print("IMPOSSIBLE")
else:print(C//2) |
p03434 | s708333370 | Accepted | n = int(input())
nums = sorted(list(map(int, input().split(' '))), reverse=True)
bob = 0
alice = 0
for id, num in enumerate(nums):
if id % 2 == 0:
bob += num
else:
alice += num
print(bob - alice)
|
p02707 | s579425796 | Wrong Answer | N = int(input())
s = input().split(" ")
A = []
d = {}
for w in s:
A.append(int(w))
if w in d.keys():
d[w] += 1
else:
d[w] = 1
for n in range(N):
if str(n + 1) in d.keys():
print(d[w])
else:
print(0) |
p03289 | s325123639 | Wrong Answer | s = input()
if s[0] != 'A' or s[2] != 'C':
print('WA')
else:
for i,c in enumerate(s):
if i in (0,2):
continue
else:
if not 'a'<=c<='z':
print('WA')
break
else:
print('AC') |
p02862 | s519061020 | Accepted | x, y = map(int, input().split())
if (x+y)%3 != 0:
print(0)
exit(0)
n = (2*y-x)//3
m = (2*x-y)//3
if n<0 or m<0:
print(0)
exit(0)
mi = min(n,m)
num = n+m
mod = 10**9+7
a = 1
b = 1
for i in range(mi):
a = a*(num-i)%mod
b = b*(mi-i)%mod
print((a*pow(b,mod-2,mod))%mod) |
p03998 | s600839913 | Wrong Answer | cards = [list(input().replace("a", "0").replace("b","1").replace("c","2")) for _ in range(3)]
next = 0
while len(cards[0]) * len(cards[1]) * len(cards[2]) != 0:
next = int(cards[next].pop(0))
print("A" if len(cards[0]) == 0 else ("B" if len(cards[1]) == 0 else "C")) |
p03544 | s646363318 | Accepted | N = int(input())
lucas = (N+2)*[0]
lucas[0] = 2
lucas[1] = 1
for i in range(2,N+2):
lucas[i] = lucas[i-1]+lucas[i-2]
print(lucas[N]) |
p02820 | s827539629 | Accepted | N, K = map(int, input().split())
R, S, P = map(int, input().split())
score = {"r": P, "s": R, "p": S, "x": 0}
T = input()
ans = 0
for i in range(K):
temp = []
for j in range(i, N, K):
if not temp:
temp.append(T[j])
else:
if temp[-1] == T[j]:
temp.append("x")
else:
temp.append(T[j])
ans += score[temp[-1]]
print(ans) |
p03861 | s979661458 | Accepted | def main():
end, start, divisor = [int(i) for i in input().split()]
a = start//divisor - (end-1)//divisor
print(a)
main() |
p03723 | s207157050 | Accepted | A, B, C = map(int, input().split())
cnt = 0
while A % 2 == 0 and B % 2 == 0 and C % 2 == 0:
A,B,C = B//2+C//2, A//2+C//2, A//2+B//2
cnt += 1
if cnt >= 10 * 7:
print(-1)
break
else:
print(cnt)
|
p03910 | s755432570 | Wrong Answer | N = int(input())
left = 0
right = 3162
while right - left > 1:
mid = (left + right) // 2
if mid * (mid + 1) // 2 < N:
left = mid
else:
right = mid
ans = {i for i in range(1, right + 1)}
ans -= {right * (right - 1) // 2 - N + right}
print('\n'.join(map(str, ans)))
|
p03693 | s660241390 | Accepted | r,g,b = map(int,input().split())
if (g*10+b)%4 == 0:
print("YES")
else:
print("NO")
|
p02897 | s739742454 | Accepted | s=0
t=0
n=int(input())
for x in range(1,n+1):
if x%2==1:
s+=1
print(s/n) |
p02641 | s752401397 | Accepted | x, n = map(int, input().split())
if n == 0:
print(x)
exit()
p = set(map(int, input().split()))
i = 0
while True:
if x - i not in p:
print(x-i)
break
elif x + i not in p:
print(x+i)
break
i += 1 |
p03067 | s854477796 | Accepted | #!/usr/bin/env python3
a,b,c = map(int,input().split())
if a > b: a,b = b,a
if a < c and c < b: print("Yes")
else: print("No") |
p03328 | s799042926 | Accepted | a, b = [int(x) for x in input().split()]
temp = b - a
print(temp * (temp + 1) // 2 - b) |
p03860 | s316933590 | Wrong Answer | a=input().split(' ')
b=a[1]
c=list(str(b))
print(c)
d=c[0]
print('A',d,'C',sep='')
|
p03705 | s444791824 | Accepted | def main():
n, a, b = list(map(int, input().split()))
if (n == 1 and a != b) or (b < a):
print(0)
exit()
mini = a * (n - 1) + b
maxi = a + b * (n - 1)
print(maxi - mini + 1)
if __name__ == '__main__':
main()
|
p02623 | s692101328 | Accepted | N, M, K = map(int,input().split())
A = list(map(int,input().split()))
B = list(map(int,input().split()))
Asum = [0]
Bsum = [0]
a = 0
b = 0
for i in range(N):
a += A[i]
Asum.append(a)
for i in range(M):
b += B[i]
Bsum.append(b)
Asum.append(0)
Bsum.append(0)
res, j = 0, M
for i in range(N+1):
if Asum[i] > K:
break
while Asum[i] + Bsum[j] > K:
j -= 1
res = max(res,i+j)
print(res) |
p03250 | s745765902 | Accepted | a=list(map(int,input().split()))
l=sorted(a,reverse=True)
max=str(l[0])+str(l[1])
print(int(max)+l[2]) |
p02854 | s966012005 | Wrong Answer | import numpy as np
from bisect import bisect_left
N = int(input())
A = list(map(int, input().split()))
cum_A = np.cumsum(A)
median = sum(A) / 2
idx = bisect_left(cum_A, median)
# print(idx)
if idx == N - 1:
right = A[-1]
else:
right = cum_A[-1] - cum_A[idx]
ans = abs(cum_A[idx] - right)
# print(cum_A, idx, right)
print(ans)
|
p02916 | s176003741 | Accepted | n=int(input())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
c=list(map(int,input().split()))
sum=0
for i in range(n):
sum+=b[i]
#print(sum)
for j in range(n-1):
if a[j+1]==a[j]+1:
#print(a[j])
#print(c[a[j]-1])
sum+=c[a[j]-1]
print(sum) |
p03289 | s626098602 | Accepted | s = input()
n = len(s)
for i in range(1, n):
if ord(s[i]) < 97 and s[i] != "C":
print("WA")
exit()
cnt_c = 0
for i in range(2, n - 1):
if s[i] == "C":
cnt_c += 1
if cnt_c != 1:
print("WA")
exit()
print("AC" if s[0] == "A" else "WA") |
p03821 | s599699418 | Accepted | n = int(input())
ab = [list(map(int, input().split())) for i in range(n)]
ab = ab[::-1]
z = 0
cnt = 0
for a, b in ab:
a += z
if a % b != 0:
z += b - (a % b)
print(z)
|
p03251 | s633999739 | Wrong Answer | N,M,X,Y = map(int,input().split())
x=max(list(map(int,input().split())))
y=min(list(map(int,input().split())))
for z in range(X+1,Y+1):
if x<=z<=y:
print("No War")
exit()
print("War")
|
p03037 | s257345335 | Wrong Answer | n, m = map(int, input().split())
mini, maxi = 0, 10**5+1
for _ in range(m):
l, r = map(int, input().split())
if l>mini:
mini = l
if r<maxi:
maxi = r
print(maxi - mini + 1) |
p03136 | s747996174 | Wrong Answer | N = int(input())
L = list(map(int, input().split()))
L.sort(reverse=True)
if L[0] > sum(L[1:]):
print('Yes')
else:
print('No') |
p02953 | s979630497 | Accepted | import sys
n=int(input())
h=[int(x) for x in input().split()][::-1]
for i in range(n-1):
if h[i]>=h[i+1]:
continue
elif h[i]==h[i+1]-1:
h[i+1]-=1
else:
print("No")
sys.exit()
print("Yes")
|
p02953 | s304177722 | Accepted | N=int(input())
H=list(map(int,input().split()))
if len(H)==1:
print("Yes")
exit()
for i in range(1,N):
if H[i-1]<=H[i]-1:
H[i]-=1
elif H[i-1]>H[i]:
print("No")
exit()
else:
print("Yes") |
p03086 | s787026202 | Accepted | S = input()
max_length = 0
length = 0
for s in S:
if s in ["A", "C", "G", "T"]:
length += 1
else:
if length > max_length:
max_length = length
length = 0
if length > max_length:
max_length = length
print(max_length) |
p02639 | s143686111 | Accepted | A = list(map(int,input().split()))
#print(A)
for i in range(len(A)):
if A[i]==int(0):
print(i+1) |
p03637 | s911236097 | Accepted | n = int(input())
a = list(map(int, input().split()))
n2 = 0
n4 = 0
for ai in a:
if ai % 4 == 2:
n2 += 1
if ai % 4 == 0:
n4 += 1
if n2 == 0 and n4:
n2 += 1
if n2 + n4 * 2 >= n:
print('Yes')
else:
print('No')
|
p02639 | s535585301 | Accepted | import sys
def input(): return sys.stdin.readline().strip()
def resolve():
l=list(map(int,input().split()))
for i in range(len(l)):
if l[i]==0:
print(i+1)
break
resolve() |
p02743 | s875832472 | Accepted | import math
a,b,c = (int(x) for x in input().split())
if (c - a - b)**2 > 4 * a * b and c - a - b > 0:
print('Yes')
else:
print('No') |
p03338 | s500115944 | Wrong Answer | n=int(input())
s=input()
count=0
for i in range(n):
str_1=s[0:i]
str_2=s[i+1:n]
if count<len(set(str_1)&set(str_2)):
count=len(set(str_1)&set(str_2))
print(count) |
p02633 | s176133486 | Wrong Answer | n=int(input())
for i in range(1, n):
x=360*i%n
if x==0:
print(360*i//n)
break;
else:
continue; |
p03206 | s045814447 | Wrong Answer | import sys
def input(): return sys.stdin.readline().strip()
def main():
D = int(input())
print("Christma" + " Eve" * (25 - D))
if __name__ == "__main__":
main()
|
p02661 | s951007750 | Accepted | import sys
sys.setrecursionlimit(10**6)
readline = sys.stdin.readline
n = int(input())
ls = []; rs = []
for _ in range(n):
a,b = [int(i) for i in readline().split()]
ls.append(a)
rs.append(b)
ls.sort()
rs.sort()
ans = 0
if n%2 == 1:
l = ls[n//2]
r = rs[n//2]
ans = r-l+1
else:
l2 = ls[n//2-1]+ls[n//2]
r2 = rs[n//2-1]+rs[n//2]
ans = r2-l2+1
print(ans) |
p02695 | s740459295 | Wrong Answer | from itertools import combinations_with_replacement
N, M, Q = map(int, input().split())
list = [list(map(int,input().split())) for _ in range(Q)]
seq = [i for i in range(1,M+1)]
C = combinations_with_replacement(seq, N)
max_score = 0
for A in C:
A = sorted(A)
score = 0
for q in list:
if A[q[1]-1] - A[q[0]-1] == q[2]:
score += q[3]
print(score)
max_score = max(score, max_score)
print(max_score)
|
p03285 | s346723550 | Wrong Answer | n = int(input())
cnt = 0
for i in range(26):
for j in range(16):
if 4 *i + 7 *j == n:
cnt += 1
print(i, j)
if cnt >= 1:
print("Yes")
else:
print("No") |
p02847 | s986640017 | Wrong Answer | from sys import stdin
S = stdin.readline().rstrip()
days = ["MON","TUE","WED","THU","FRI","SAT","SUN"]
if S == "SUN":
print(days[6])
else:
i = days.index(S)
print(days[6 - i]) |
p02951 | s732111818 | Accepted | import sys
input = lambda: sys.stdin.readline().rstrip()
def main():
a, b, c = map(int, input().split())
if a - b >= c:
print(0)
else:
print(c - (a - b))
if __name__ == '__main__':
main() |
p02678 | s900712185 | Accepted | from collections import deque
N, M = map(int, input().split())
rooms = [0] + [[] for _ in range(N)]
ans = [0] * (N+1)
for _ in range(M):
A, B = map(int, input().split())
rooms[A].append(B)
rooms[B].append(A)
que = deque([1])
while len(que) > 0:
x = que.popleft()
for r in rooms[x]:
if ans[r] == 0:
ans[r] = x
que.append(r)
print('Yes')
for i in range(2, N+1):
print(ans[i]) |
p02743 | s364550225 | Accepted | a,b,c = map(int,input().split())
p = c - a - b
if p <= 0:
print("No")
else:
if p**2 - 4*a*b > 0:
print('Yes')
else:
print('No')
|
p03069 | s276460094 | Wrong Answer | n = int(input())
s=input()
bc = [0 for i in range(n)]
wc = [0 for i in range(n)]
for i in range(n):
if s[i] == '#':
bc[i] =1
else:
wc[i] = 1
for i in range(n-1):
bc[i+1] += bc[i]
for i in range(n-1,0,-1):
wc[i-1] += wc[i]
bc.insert(0,0)
wc.insert(0,0)
bc.append(0)
wc.append(0)
ans = n
for i in range(n-1):
ans = min(ans,bc[i]+wc[i+1])
print(ans) |
p02707 | s386299354 | Wrong Answer | n=int(input())
a=list(map(int,input().split()))
l=[]
for i in range(1,n+1):
if a.count(i)>0:
print(a.count(i))
exit()
l.append(a.count(i))
x=n-len(l)
y='0'*x
m=list(str(y))
n='\n'.join(m)
print(n)
|
p03252 | s446622145 | Accepted | s = [c for c in str(input())]
t = [c for c in str(input())]
from collections import Counter
s_cntr = sorted(Counter(s).values())
t_cntr = sorted(Counter(t).values())
if s_cntr == t_cntr: print('Yes')
else: print('No') |
p03146 | s956789362 | Accepted | s = int(input())
a1 = s
a = set()
while not (a1 in a):
a.add(a1)
if a1%2 == 0:
a1 = int(a1/2)
else:
a1 = a1*3+1
print(len(a)+1) |
p03001 | s348355196 | Accepted | w,h,x,y = [int(x) for x in input().split()]
if x * 2 == w and y * 2 == h:
print((w*h)/2, 1)
else:
print((w*h)/2, 0) |
p02665 | s533386209 | Wrong Answer | import sys #追加
from collections import deque
sys.setrecursionlimit(10**9) #追加
n = int(input())
A = list(map(int, input().split()))
ans = 0
if n == 0:
print(-1)
exit()
elif A[0] == 1:
print(-1)
exit()
start = 1
way = sum(A)
for i in range(1,n+1):
start *= 2
if start < A[i]:
print(-1)
exit()
if start > way:
start = way
ans += start
#print(start, start-A[i])
start -= A[i]
way -= A[i]
#print()
print(ans+1)
|
p02994 | s402354533 | Accepted | N,L=map(int, input().split())
List=[]
i=1
while i<=N:
List.append(L+i-1)
i+=1
MIN=abs(List[0])
HIKU=List[0]
j=1
while j<N:
if abs(List[j])<MIN:
HIKU=List[j]
MIN=abs(List[j])
j+=1
del List[List.index(HIKU)]
print(sum(List)) |
p03745 | s972571857 | Accepted | n = int(input())
A = list(map(int, input().split()))
#左から丹頂非増加、単調非減少を試して行って長い方を採用すれば良いO(N)
#値の増減の反転するポイントを探索する
ans = 1
tmp = 0
for i in range(1, n):
if (A[i] - A[i-1]) * tmp < 0:
ans += 1
tmp = 0
elif A[i] - A[i-1] != 0:
tmp = A[i] - A[i-1]
print(ans)
|
p02725 | s146031464 | Wrong Answer | k, n = map(int, input().split())
list_a = list(map(int, input().split()))
x = 0
longest = 0
for a in list_a:
if a - x > longest:
longest = a - x
x = a - x
print(k-longest) |
p02823 | s275390204 | Accepted | N,A,B=map(int,input().split())
if (B-A)%2==0:
ans =(B-A)//2
else:
ans = min(A-1,N-B) + (B-A + 1)//2
print(ans)
|
p03998 | s437212793 | Accepted | def main():
# player = {"a": [], "b": [], "c": []}
# for k in player:
# player[k] = list(input())
player = {i:list(input()) for i in 'abc'}
p = 'a'
while player[p]:
p = player[p].pop(0)
print(p.upper())
if __name__ == '__main__':
main() |
p03774 | s504415563 | Wrong Answer | N,M=map(int,input().split())
a=[[int(b) for b in input().split()] for i in range(N)]
c=[[int(d) for d in input().split()] for i in range(M)]
for i in range(N):
p=a[i]
tmp=10000
pos=-1
for j in range(M):
cp=c[j]
dist=abs(cp[0]-p[0])+abs(cp[1]-p[1])
if dist < tmp:
tmp=dist
pos=j+1
#print(pos)
print(pos)
|
p03261 | s748591521 | Accepted | n = int(input())
w = [input()]
for i in range(1,n):
w.append(input())
if len(set(w)) != n:
print("No")
else:
for i in range(1,n):
if w[i-1][-1] != w[i][0]:
print("No")
break
else:
print("Yes") |
p02701 | s825355294 | Accepted | n = int(input())
lst = [input() for _ in range(n)]
print(len(set(lst)))
|
p04034 | s322259364 | Accepted | n,m=map(int,input().split())
flg=[False for i in range(n)]
flg[0]=True
t=[1 for i in range(n)]
tmp=1
for i in range(m):
x,y=map(int,input().split())
x,y=x-1,y-1
t[x]-=1
t[y]+=1
if flg[x]:
flg[y]=True
if t[x]==1 and len(flg)==1:
flg[x]=False
if t[x]==0:
flg[x]=False
ans=0
for i in range(n):
if flg[i]:
ans+=1
print(ans) |
p03719 | s460210959 | Accepted | a,b,c = map(int,input().split())
if a < c < b or a == b == c :
print("Yes")
else :
print("No") |
p02982 | s017651318 | Accepted | import math
n,d=list(map(int,input().split()))
x=[list(map(int,input().split())) for i in range(n)]
count=0
tmp=0
for i in range(n):
for j in range(i+1,n):
for k in range(d):
tmp+=pow(x[i][k]-x[j][k],2)
distance=math.sqrt(tmp)
if distance.is_integer()==True:
count+=1
tmp=0
print(count) |
p03693 | s585522188 | Accepted | a, b, c = input().split()
n = int(a+b+c)
print('NO') if n % 4 else print('YES') |
p03548 | s387637581 | Accepted | #078_B
x,y,z=map(int,input().split())
print((x-z)//(y+z)) |
p02658 | s355566231 | Accepted | n=int(input())
mul=1
limit=1000000000000000000
x=input().split()
for i in range (n):
p=int(x[i])
if(p==0):
mul=0
break
if(mul==0):
print(mul)
else:
for i in range (n):
p=int(x[i])
mul*=p
if(mul>limit):
break
if(mul>limit):
print(-1)
else:
print(mul) |
p02717 | s366160340 | Accepted | a,b,c=map(int,input().split())
print(c,a,b) |
p03243 | s806526865 | Accepted |
n = int(input())
for i in range(n, 1000):
s = str(i)
if (s[0] == s[1] == s[2]):
print(s)
break |
p03455 | s642436668 | Accepted | num = input().split(" ")
sum = int(num[0]) * int(num[1])
if sum % 2 == 0:
print("Even")
else:
print("Odd")
|
p03804 | s459425449 | Wrong Answer | def resolve():
n, m = map(int, input().split())
A = []
B = []
ans = False
for _ in range(n):
A.append(list(input()))
for _ in range(m):
B.append(list(input()))
for i in range(n):
for j in range(n):
if i + m - 1 >= n or j + m - 1 >= n:
continue
tmp_ans = True
for k in range(m):
for l in range(m):
if A[i+k][j+l] != B[k][l]:
tmp_ans = False
break
ans = tmp_ans
if ans:
print('Yes')
else:
print('No')
resolve() |
p02607 | s684583665 | Accepted | import sys
read = sys.stdin.read
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 8)
INF = float('inf')
MOD = 10 ** 9 + 7
def main():
N = int(readline())
A = list(map(int, readline().split()))
ans = 0
for i in range(0,N,2):
if A[i]%2==1:
ans += 1
print(ans)
if __name__ == '__main__':
main()
|
p02957 | s858829344 | Wrong Answer | a,b=map(int,input().split())
if a+b%2==0:
print(a+b//2)
else:
print("IMPOSSIBLE") |
p03814 | s463560863 | Accepted | S = input()
flag = False
start = 0
for i in range(len(S)):
s = S[i]
if s == 'A' and not flag:
flag = True
start = i
if flag and s == 'Z':
end = i
ans = end - start + 1
print(ans)
|
p02628 | s404463607 | Accepted | n,k=map(int,input().split( ))
price=list(map(int,input().split( )))
price.sort(key=int)
ans=0
for i in range(k):
ans+=price[i]
print(ans) |
p03607 | s889465655 | Accepted | N = int(input())
A = [int(input()) for i in range(N)]
import collections
c = collections.Counter(A)
#print(c)
ans = 0
for i in c:
if c[i] % 2 != 0:
ans += 1
print(ans)
|
p02633 | s652238869 | Wrong Answer | a = int(input())
print(360//a) |
p02595 | s647625686 | Wrong Answer | from collections import Counter
import copy
from itertools import combinations
def A(x):
return 'Yes' if x >= 30 else 'No'
def B(N, D, X, Y):
ans = 0
for i in range(N):
Di = X[i]**2 + Y[i]**2
if Di < D**2:
ans += 1
return ans
def main():
N, D = map(int, input().split())
X = []
Y = []
for i in range(N):
Xi, Yi = map(int, input().split())
X.append(Xi)
Y.append(Yi)
print(B(N, D, X, Y))
if __name__ == '__main__':
main()
|
p02547 | s178624451 | Accepted |
N=int(input())
ok=False
count=0
for i in range(N):
d1,d2=map(int, input().split())
if d1==d2:
count+=1
else:
count=0
if count==3:
ok=True
break
if ok:
print("Yes")
else:
print("No") |
p02813 | s665393276 | Accepted | import sys
from itertools import permutations
def input(): return sys.stdin.readline().rstrip()
def main():
n=int(input())
P=tuple([int(_) for _ in input().split()])
Q=tuple([int(_) for _ in input().split()])
p_list=list(permutations(list(range(1,n+1))))
print(abs(p_list.index(Q)-p_list.index(P)))
if __name__=='__main__':
main() |
p02601 | s695049566 | Accepted | A, B, C = input().split()
A = int(A)
B = int(B)
C = int(C)
K = input()
K = int(K)
z = 0
while B <= A:
B = B * 2
z = z + 1
while C <= B:
C = C * 2
z = z + 1
if K < z:
print('No')
else:
print('Yes') |
p02832 | s274327338 | Accepted | #14:50
n = int(input())
a = list(map(int,input().split()))
ans = 0
now = 1
for i in range(n):
if a[i] == now:
now += 1
ans += 1
if ans == 0:
print(-1)
else:
print(n-ans) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.