problem_id stringclasses 428 values | submission_id stringlengths 10 10 | status stringclasses 2 values | code stringlengths 5 816 |
|---|---|---|---|
p02646 | s116762545 | Wrong Answer | N,S = map(int,input().split())
n,s = map(int,input().split())
T = int(input())
ans1 = N + S*T
ans2 = n + s*T
if S - s <= 0 or n < N:
print("NO")
elif ans1 >= ans2 and (n-N) % (S-s) == 0:
print("YES")
else:
print("NO") |
p02748 | s047794911 | Accepted | A,B,m=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
tmp=min(a)+min(b)
for i in range(m):
x,y,c=map(int,input().split())
if a[x-1]+b[y-1]-c<tmp:
tmp=a[x-1]+b[y-1]-c
print(tmp) |
p02695 | s378021847 | Accepted | from itertools import combinations_with_replacement
n,m,q=map(int,input().split())
l=[list(map(int,input().split())) for i in range(q)]
ans=0
for i in combinations_with_replacement([i for i in range(1,m+1)], n):
tmp=0
for a,b,c,d in l:
if i[b-1]-i[a-1]==c:
tmp+=d
ans=max(ans,tmp)
print(ans) |
p03760 | s968523187 | Accepted | o=list(input())
e=list(input()+" ")
for x,y in zip(o,e):
print((x+y),end="") |
p02996 | s456750503 | Accepted | n = int(input())
ab = sorted([list(map(int, input().split())) for _ in range(n)], key=lambda x: x[1])
current = 0
for a, b in ab:
current += a
if current > b:
print("No")
exit()
print("Yes") |
p02719 | s537616335 | Wrong Answer | n,k=map(int,input().split())
if k==1:
print(0)
elif n>k:
print(k-(n%k))
else:
print(k-(n%k)) |
p03011 | s603325382 | Accepted | P=list(map(int,input().split()))
Q=sorted(P)
print(Q[0]+Q[1])
|
p03457 | s866963852 | Accepted | def dist(s1,s2):
return abs(s1[1]-s2[1]) + abs(s1[2]-s2[2])
N=int(input())
now = (0,0,0)
for i in range(N):
next_ = list(map(int,input().split()))
if dist(now,next_)<=next_[0]-now[0] and dist(now,next_) % 2 == (next_[0]-now[0])%2:
now = next_
continue
else:
print('No')
exit()
print('Yes') |
p02797 | s581783707 | Wrong Answer | n,k,s=map(int,input().split())
ans=[]
for i in range(k):
ans.append(s)
for i in range(n-k):
ans.append(0)
print(*ans) |
p03338 | s239463303 | Accepted | N = int(input())
S = list(input())
ans = 0
for i in range(N):
a = S[:i]
b = S[i:]
aset = set(a)
bset = set(b)
count = 0
for i in aset:
if i in bset:
count += 1
ans = max(ans,count)
print(ans) |
p02594 | s717381713 | Accepted | x = int(input())
if x >= 30:
print("Yes")
else:
print("No") |
p03062 | s211998180 | Wrong Answer | import numpy as np
n = int(input())
a = np.array([int(i) for i in input().split()])
if np.prod(a) >= 0:
print(int(np.abs(a).sum()))
else:
m = np.abs(a).min()
print(int(np.abs(a).sum() - 2 * m)) |
p03544 | s553911726 | Accepted | N = int(input())
ryuka = [0]*(N+1)
ryuka[0] = 2
ryuka[1] = 1
for i in range(2, N+1):
ryuka[i] = ryuka[i-1]+ryuka[i-2]
print(ryuka[-1]) |
p02882 | s822881893 | Wrong Answer | a,b,x = map(int,input().split())
import numpy as np
if x<=(a*a*b)/2:
A = 2*x/(a*b*b)
Z = A
print(a)
print(90-np.arctan(Z)*180/(np.pi))
else:
A = 2*a*a*b-2*x
B = A/(a*a*a)
Z = B
print(np.arctan(Z)*180/np.pi) |
p03106 | s143501498 | Accepted | a, b, k = map(int, input().split())
m = min(a, b)
div = []
for i in range(1, m+1):
if a % i == 0 and b % i == 0:
div.append(i)
div.reverse()
print(div[k-1])
|
p03013 | s114998686 | Accepted | N, M = list(map(int, input().split()))
A = {i: 0 for i in range(N+1)}
mod = 10 ** 9 + 7
for _ in range(M):
A[int(input())] = 1
dp = [0 for _ in range(N+1)]
dp[0] = 1
for i in range(N+1):
if A.get(i+1) == 0:
dp[i + 1] += dp[i]
if A.get(i+2) == 0:
dp[i + 2] += dp[i]
print(dp[N]%mod)
|
p02595 | s242458584 | Accepted | import math
# import bisect
import sys
# from collections import Counter
input = sys.stdin.readline
def inp():
return(int(input()))
def inlt():
return(list(map(int,input().split())))
def insr():
s = input()
return(s[:len(s)-1])
def invr():
return(map(int,input().split()))
def print_fract(p,q):
g = math.gcd(p,q)
p//=g
q//=g
print(str(p)+"/"+str(q))
# list1, list2 = zip(*sorted(zip(list1, list2)))
N, D = invr()
out = 0
for n in range(N):
X, Y = invr()
if ((X**2)+(Y**2))**0.5 <= D:
out += 1
print(out) |
p03250 | s031386072 | Accepted | a,b,c=map(int,input().strip().split(" "))
k=max(a,b,c)
print(9*k+a+b+c) |
p02832 | s562061378 | Wrong Answer | n = int(input())
A = list(map(int, input().split()))
c = 1
res = 0
for a in A :
if c == a :
c += 1
else :
res += 1
print(res)
|
p03711 | s893749040 | Accepted | n1=[1,3,5,7,8,10,12]
n2=[4,6,9,11]
a,b=map(int,input().split())
print("Yes" if (a in n1 and b in n1) or (a in n2 and b in n2) or (a == 2 and b == 2) else "No") |
p03360 | s294743399 | Accepted | List = list(map(int, input().split()))
K = int(input())
sort = sorted(List)
for i in range(K):
sort[-1] = sort[-1]*2
print(sum(sort))
|
p02708 | s510636836 | Accepted | N, K = map(int, input().split())
list = list(range(N+1))
t = 10**9+7
result = 0
for i in range(K,N+2):
result += i*(N-i+1) + 1
print(result%t)
|
p03264 | s647663123 | Accepted | K = int(input())
Q = 0
A = 0
for i in range(1,K+1):
if i % 2 == 0:
Q += 1
else:
A += 1
print(Q*A) |
p02744 | s569839931 | Wrong Answer | n = int(input())
cs = 'abcdefghijklmn'
cm = {cs[i]:i for i in range(len(cs))}
def rec(string, l):
if (l >= n):
print(string)
return 0
now = string[-1]
k = max(cm[string[i]]+1 for i in range(len(string)))
k = max(k, cm[now] + 2)
for c in cs[:k]:
rec(string + c,l+1)
rec('a',1) |
p02948 | s129003258 | Accepted | import heapq
n,m=map(int,input().split())
X=[[] for _ in range(10**5+5)]
for i in range(n):
a,b=map(int,input().split())
X[a-1].append(-b)
ans=0
p=[]
heapq.heapify(p)
for i in range(m):
if len(p)==0 and len(X[i])==0:
continue
for j in range(len(X[i])):
heapq.heappush(p,X[i][j])
a=heapq.heappop(p)
ans+=a*-1
print(ans) |
p02859 | s863356542 | Accepted | r = int(input())
print(r ** 2)
|
p03605 | s707176753 | Wrong Answer | n=input()
n=int(n)
og=n
flag=0
while(n>0):
d=n%10
n=n//10
if(d==7):
flag=flag+1
if(flag>0):
print("Yes")
else:
print("No")
|
p03778 | s665750188 | Wrong Answer | a, W, b = map(int,input().split())
if a <= b:
print(max(0,b-(a+W)))
elif a > b:
print(max(0,(a-b))) |
p03359 | s597293024 | Accepted | a,b = map(int,input().split())
if a <= b:
print(a)
else:
print(a-1) |
p03836 | s234749187 | Accepted | sx, sy, tx, ty = map(int, input().split())
p1 = 'U' * (ty - sy) + 'R' * (tx - sx)
p2 = 'U' + 'L' * (tx - sx + 1) + 'D' * (ty - sy + 1) + 'R'
p3 = p1[::-1]
p4 = p2[::-1]
print(p1 + p2 + p3 + p4) |
p02697 | s599988063 | Accepted | N,M=map(int,input().split())
ans=[]
if N%2==0:
N-=1
half=N//2
if half%2==0:
for i in range(half//2):
ans.append((i+1,half-i))
for j in range(half//2):
ans.append((half+1+j,N-j))
else:
for i in range(half//2):
ans.append((i+1,half-i))
for j in range(half//2+1):
ans.append((half+1+j,N-j))
#print(ans)
for i in range(M):
print(*ans[i]) |
p03493 | s726376365 | Accepted | st = input()
tl = 0
for s in st[:]:
tl += int(s)
print(tl) |
p02935 | s002294218 | Wrong Answer | from itertools import combinations
n = int(input())
v = list(map(int, input().split()))
if len(set(v)) == 1:
print(v[0])
elif len(set(v)) == 2:
print(sum(list(set(v)))/2)
else:
p = set(v)
res = []
s = list(combinations(p, 2))
for i in s:
a = sum(i)/2
b = max(list(p-set(i)))
res.append((a+b)/2)
print(max(res))
|
p02606 | s280993170 | Accepted | import sys
sys.setrecursionlimit(10 ** 8)
input = sys.stdin.readline
def main():
L, R, d = [int(x) for x in input().split()]
print(R // d - (L - 1) //d)
if __name__ == '__main__':
main()
|
p02743 | s427645801 | Wrong Answer | a,b,c=map(int,input().split())
if 4*a*b<(c-a-b)**2:
print("Yes")
else:
print("No") |
p02811 | s906953254 | Accepted | k,x=[int(x) for x in input().split()]
a=500*k
if a>=x:
print("Yes")
else:
print("No") |
p02726 | s304478611 | Accepted |
n, x, y = map(int, input().split())
d = [0]*(n-1)
for i in range(1, n):
for j in range(i+1,n+1):
c = min(j-i, abs(i-x)+1+abs(j-y))
d[c-1] = d[c-1] + 1
for i in d:
print(i) |
p02717 | s466909755 | Wrong Answer | x,y,z = map(int,input().split(' '))
tmp = x
x = y
y = tmp
tmp = x
x = z
z = tmp |
p02854 | s714407010 | Accepted | n=int(input())
a=list(map(int,input().split()))
def Csum(a):
b,c=[0],0
for i in range(len(a)):
c+=a[i]
b.append(c)
return b
b=Csum(a)
c=sum(a)
d=[]
for i in range(1,n):
d.append(abs((c-b[i])-b[i]))
print(min(d)) |
p03767 | s045121136 | Accepted | N = int(input())
A = list(map(int,input().split()))
A.sort(reverse=True)
print(max(sum(A[N:2*N]),sum(A[1:2*N:2]))) |
p02768 | s112630464 | Wrong Answer | n,a,b = [int(x) for x in input().split()]
INF = (10**9 + 7)
if n == 2:
print(0)
else:
ans = (2 ** n -1) - (2**a - 1) - (2 ** b - 1)
print(ans % INF) |
p02773 | s233218545 | Wrong Answer | N = int(input())
cnt_list = {}
for i in range(N):
S = input()
if S in cnt_list:
cnt_list[S] += 1
else:
cnt_list[S] = 0
max_cnt = max(cnt_list.values())
res_list = []
for a in cnt_list.items():
if a[1] == max_cnt:
res_list.append(a[0])
res_list.sort()
print(res_list) |
p02645 | s481136404 | Wrong Answer | s = input()
print(s[:2]) |
p02995 | s731147537 | Wrong Answer | from fractions import gcd
a, b, c, d = map(int, input().split())
cd_gcd = gcd(c, d)
cd_lcm = c * d // cd_gcd
ans = (b - a + 1) - (b - a -1)//c - (b - a -1)//d + (b - a -1)//cd_lcm
print(ans) |
p02691 | s150331405 | Accepted | from collections import defaultdict
N = int(input())
values = list(map(int, input().split()))
keys = list(range(1, N + 1))
memo = defaultdict(int)
count = 0
for i, x in enumerate(values):
count += memo[i - x]
memo[i + x] += 1
print(count) |
p03109 | s994525142 | Accepted | # coding: utf-8
# https://atcoder.jp/contests/abc119
def main():
S = input()
m = int(S[5:7])
if m <= 4:
return "Heisei"
else:
return "TBD"
print(main())
|
p03971 | s493654560 | Wrong Answer | N, A, B = map(int, input().split())
S = input()
ok_count = 0
ok_fcount = 0
for i in range(N):
if S[i] == 'a':
if ok_count < A+B-1:
print('Yes')
ok_count +=1
else:
print('No')
elif S[i] == 'b':
if ok_count <= A+B-1 and ok_fcount <= B-1:
print('Yes')
ok_count+=1
ok_fcount+=1
else:
print('No')
else:
print('No')
|
p02694 | s336838031 | Accepted | x=int(input())
ans=1
a=int(100*(1.01)**ans)
while a<x:
ans+=1
a*=1.01
a=int(a)
print(ans) |
p02818 | s057160882 | Accepted | A, B, K = map(int, input().split())
if A > K:
print(A-K, B)
elif A+B > K:
print(0, A+B-K)
else:
print(0, 0) |
p02796 | s823626905 | Wrong Answer | n = int(input())
robos = []
for i in range(n):
x,l = map(int,input().split())
robos.append([x-l+1,x+l-1])
robos.sort(key= lambda x:x[1])
# print(robos)
edge = -10000000000
out = 0
for i in range(n):
if robos[i][0] > edge:
out += 1
edge = robos[i][1]
else:
continue
print(out) |
p02747 | s569112638 | Accepted | S = input()
print("Yes" if S.count("hi")*2==len(S) else "No") |
p03289 | s364545869 | Accepted | S = list(input())
ans = "AC"
if S[0] != "A":
ans = "WA"
if S[2:-1].count("C") != 1:
ans = "WA"
else:
S.pop(S[2:-1].index("C") + 2)
if not "".join(S[1:]).islower():
ans = "WA"
print(ans)
|
p02951 | s732901200 | Wrong Answer | a,b,c = map(int,input().split())
print(c-(a-b)) |
p02714 | s760138241 | Accepted | n = int(input())
s = list(input())
a = s.count('R')
b = s.count('G')
c = s.count('B')
ans = a * b * c
m = (n-1) // 2
ans = a * b * c
for d in range(1, n):
if d * 2 >= n:
break
for i in range(n):
if i + d * 2 >= n:
break
if s[i] != s[i+d] and s[i] != s[i+d*2] and s[i+d] != s[i+d*2]:
ans -= 1
print(ans) |
p02767 | s822577467 | Wrong Answer | N=int(input())
X=list(map(int,input().split()))
sum=0
A=[]
for i in range(int(X[N-1]+5)):
for j in range(N):
sum+=(X[j]-i)**2
A.append(sum)
sum=0
print(min(A)) |
p02946 | s657007388 | Accepted |
[K, X] = list(map(int,input().split()))
min= X-K+1
max= X+K-1
out=[]
for i in range(min,max+1):
out.append(i)
out = ' '.join(map(str,out))
print(out)
|
p03262 | s713598335 | Accepted | n,x = map(int,input().split())
xi = list(map(int,input().split()))
xi.sort()
diff = []
for i in range(n):
diff.append(abs(xi[i]-x))
import numpy
print(numpy.gcd.reduce(diff))
|
p02923 | s666300405 | Wrong Answer | N = int(input())
H = list(map(int, input().split()))
ans = 0
temp = 0
for i in range(N-1):
if H[i] >= H[i+1]:
temp += 1
else:
if temp > ans:
ans = temp
temp = 0
if temp > ans:
ans = temp
print(ans) |
p03645 | s789694573 | Accepted | n, m = list(map(int, input().split()))
ab = [list(map(int, input().split())) for i in range(m)]
if m == 1:
print("IMPOSSIBLE")
else:
root = [[] for i in range(n)]
for a, b in ab:
root[a-1].append(b-1)
flag = False
for j in root[0]:
if n-1 in root[j]:
flag = True
break
print("POSSIBLE" if flag else "IMPOSSIBLE")
|
p02910 | s712140460 | Accepted | S = input()
a = {'R', 'U', 'D'}
b = {'L', 'U', 'D'}
Odd = set(S[0::2])
Even = set(S[1::2])
if Even <= b and Odd <= a:
print('Yes')
else:
print('No') |
p02682 | s160905421 | Accepted | A, B, C, K = map(int, input().split())
if K <= A:
print(K)
elif K <= A + B:
print(A)
else:
print(A - (K - A - B))
|
p03126 | s286206658 | Accepted | n,m = map(int,input().split())
ls = [list(map(int,input().split())) for i in range(n)]
for i in range(n):
del ls[i][0]
Ls = []
for i in range(m):
a = 0
for j in range(n):
a += ls[j].count(i+1)
Ls.append(a)
print(Ls.count(n)) |
p02631 | s696202481 | Accepted | n = int(input())
a = list(map(int, input().split()))
s = 0
for i in range(n):
s = s ^ a[i]
b = [0] * n
for i in range(n):
b[i] = s ^ a[i]
print(*b) |
p03038 | s036926806 | Wrong Answer | from collections import Counter
N,M = map(int,input().split())
A = Counter(list(map(int,input().split())))
for i in range(M):
b,c = map(int,input().split())
if c in A.keys():
A[c] += b
else:
A[c] = b
A = sorted(A.items(),reverse=True)
check = N
ans = 0
for i in A:
if i[1]<check:
check -= i[1]
ans += (i[0] * i[1])
else:
ans += i[1] * check
print(ans)
|
p02693 | s332827978 | Accepted | k = int(input())
a, b = map(int, input().split())
ans = 'NG'
for i in range(a, b+1):
if i % k == 0:
ans = 'OK'
break
print(ans) |
p03282 | s562227458 | Accepted | s=input()
k=int(input())
for i in range(len(s)):
if s[i]!="1":
nextone=s[i]
break
if s.count("1")==len(s):
print(1)
elif i>=k:
print(1)
else:
print(nextone)
|
p03385 | s921341313 | Accepted | s=input()
print('Yes' if len(set(s))==3 else 'No')
|
p03067 | s884273637 | Accepted | A, B, C=map(int,input().split(' '))
if((A-C)*(B-C)<0):
print('Yes')
else:
print('No')
|
p03281 | s693078667 | Accepted | n = int(input())
count = 0
for i in range(1, n + 1, 2):
div = 0
for j in range(1, i + 1):
if i % j == 0:
div += 1
if div == 8:
count += 1
print(count)
|
p04012 | s249643121 | Accepted | w=input()
lst=[]
flag = 0
for i in w:
lst.append(i)
for i in range(len(w)):
if lst[i] == 99:
continue
c = 1
j = i + 1
while j < len(w):
if lst[i] == lst[j]:
lst[j] = 99
c += 1
j += 1
if c % 2 != 0:
print("No")
flag = 1
break
if flag == 0:
print("Yes")
|
p03327 | s887687672 | Accepted |
n = int(input())
if n <= 999:
answer = "ABC"
else:
answer = "ABD"
print(answer)
|
p03043 | s090143144 | Accepted | import math
n, k = map(int, input().split())
ans = 0
for i in range(1, n+1):
if i > k:
ans += 1/n
else:
x = math.ceil(math.log2(k/i))
ans += 1/n/(2**x)
print(ans) |
p02633 | s573512842 | Accepted | from math import gcd
def lcm(a, b):
return a * b // gcd (a, b)
X = int(input())
print(lcm(X, 360) // X) |
p02601 | s057109745 | Wrong Answer | from sys import stdin
a,b,c=map(int,stdin.readline().split())
k=int(stdin.readline())
for i in range(k):
if i%2!=0:
c*=2
if i%2==0:
b*=2
if c>b and b>a:
print("Yes")
else:
print("No") |
p02612 | s251184498 | Wrong Answer | N = int(input())
res = N%1000
if N == 0:
print(res)
else:
print(1000-res) |
p02777 | s063689611 | Accepted | S,T=input().split()
#print(S)
A,B=map(int,input().split())
U=input()
if U==S:
A-=1
else:
B-=1
print(A,B) |
p02785 | s310379580 | Wrong Answer | N,K = map(int,input().split())
H = [int(i) for i in input().split()]
if K >= N:
print(0)
else:
I = sorted(H)
a = 0
for i in range(N-K):
a += H[i]
print(a)
|
p03317 | s474013155 | Accepted | #!/usr/bin/env python3
import sys
def main():
N, K = map(int,input().split())
a = list(map(int,input().split()))
answer = 0
for i in range(N):
if K + (i-1)*(K-1) >= N:
answer = i
break
print(answer)
return
if __name__ == '__main__':
main()
|
p02755 | s295722070 | Accepted | A, B = map(int, input().split())
ans = -1
for i in range(1250):
if int(i * 0.08) == A and int(i * 0.10) == B:
ans = i
break
print(ans)
|
p03329 | s552725439 | Accepted | #!/usr/bin/env python3
# import math
n = int(input())
ans = [-1]*(n+1)
ans[0] = 0
for i in range(1, n+1):
num = i
data = ans[i-1]+1
for j in range(8):
index = i-6**j
if index < 0:
break
data = min(data, ans[index]+1)
for j in range(8):
index = i-9**j
if index < 0:
break
data = min(data, ans[index]+1)
ans[i] = data
print(ans[-1])
|
p03672 | s911884591 | Wrong Answer | def main():
s = input()
for i in range(1, len(s)):
r = s[:-i]
q = len(s[:-i])
if q % 2 != 0:
continue
if r[:q//2] == r[q//2:]:
ans = q
print(ans)
if __name__ == "__main__":
main()
|
p02697 | s865186005 | Accepted | N, M = map(int, input().split())
order = [i for i in range(2, N+1)]
reverse = order[::-1]
d = 0
for i in range(M):
if N%4 == 0 and reverse[i] - order[i] == N//2:
d = 1
if N%2 == 0 and i == (N//2-1) //2:
d = 1
print(order[i+d], reverse[i]) |
p03062 | s538666455 | Accepted | n = int(input())
a = list(map(int, input().split()))
m = 0
ab = []
for i in a:
if i < 0:
m+=1
i = i*-1
ab.append(i)
if m%2 == 0:
print(sum(ab))
else:
ab.sort()
print(sum(ab[1:])-ab[0] ) |
p03821 | s709461437 | Wrong Answer | n = int(input())
A = [0]*n
B = [0]*n
for i in range(n):
A[i],B[i] = map(int,input().split())
ans = 0
for i in range(n):
j = -1-i
if B[j] == 1:
continue
ans += B[j] - (A[j]+ans)%B[j]
print(ans) |
p02729 | s605041455 | Accepted | N, M = [int(i) for i in input().split(" ")]
con = 0
for i in range(N):
con += i
for j in range(M):
con += j
print(con) |
p03264 | s699814067 | Wrong Answer | k = int(input())
n = k // 2
if k % 2 == 0:
print(k**2)
else:
print(k * (k + 1))
|
p03103 | s313232544 | Accepted | n,m = map(int,input().split())
li = [list(map(int, input().split())) for _ in range(n)]
li.sort()
s = 0
money = 0
for i in range(len(li)):
s+=li[i][1]
if s>= m:
s -=li[i][1]
nokori = m-s
money += li[i][0]*nokori
break
else:
money += li[i][0]*li[i][1]
print(money) |
p03799 | s211214112 | Wrong Answer | N,M=map(int,input().split())
O = M//2
print( (N+O)//2 ) |
p02595 | s276388006 | Wrong Answer | import math
n, d = map(int, input().split())
ans = 0
for _ in range(n):
x, y = map(int, input().split())
a = x**2 + y **2
d = d**2
if a <= d:
ans+=1
print(ans) |
p03761 | s624524859 | Accepted | import string
atoz = string.ascii_lowercase
N = int(input())
azcount = {}
for i in range(N):
s = input()
for alph in atoz:
if alph in azcount:
azcount[alph] = min(s.count(alph), azcount[alph])
else:
azcount[alph] = s.count(alph)
res = ''
for alph in atoz:
res += alph * azcount[alph]
print(res) |
p03804 | s655303822 | Wrong Answer | N, M = map(int, input().split())
A = [input() for _ in range(N)]
B = [input() for _ in range(M)]
ans = None
for i in range(N-M):
for j in range(N-M):
try:
for k in range(i, i+M):
for l in range(j, j+M):
if A[i+k][j+l] != B[k][l]:
raise ""
else:
ans = 'Yes'
except:
pass
print(ans if ans else 'No')
|
p03001 | s310269896 | Accepted | w, h, x, y = map(int, input().split())
print(w * h / 2, 1 if x == w / 2 and y == h / 2 else 0) |
p03387 | s420405553 | Accepted | abc = list(map(int, input().split()))
c = max(abc)
abc.remove(c)
a = abc[0]
b = abc[1]
#%%
d_ca = c - a
d_cb = c - b
if d_ca%2 == 0 and d_cb%2 == 0:
ans = d_ca // 2 + d_cb // 2
elif d_ca%2 == 1 and d_cb%2 == 1:
ans = d_ca // 2 + d_cb // 2 + 1
else:
ans = d_ca // 2 + 1 + d_cb // 2 + 1
print(ans) |
p03455 | s207957515 | Wrong Answer | a,b=map(int,input().split())
print(a)
print(b)
if a%2!=0 and b%2!=0:
print("Odd")
else:
print("Even")
|
p03645 | s530166080 | Accepted | n,m=map(int,input().split())
adj=[[]for i in range(n)]
for i in range(m):
a,b=map(int,input().split())
a,b=a-1,b-1
adj[a].append(b)
adj[b].append(a)
for i in adj[0]:
if n-1 in adj[i]:
print("POSSIBLE")
exit()
print("IMPOSSIBLE") |
p02732 | s731310126 | Accepted | from collections import Counter as cnt
n = int(input())
A = list(map(int, input().split()))
dic = cnt(A)
total = 0
for num in dic.values():
if num >= 2:
total += num * (num - 1) // 2
for num in A:
target = dic[num]
ans = total
if target >= 2:
ans -= target * (target - 1) // 2
ans += (target - 1) * (target - 2) // 2
print(ans) |
p02702 | s751317300 | Accepted | s = input()
l = len(s)
t = [0] * l
t[l - 1] = int(s[l - 1])
m = [0] * 2019
m[0] = 1
m[int(s[l - 1])] = 1
ten = 10
ans = 0
for i in range(l - 1, 0, -1):
t[i - 1] = (t[i] + int(s[i - 1]) * ten) % 2019
ten = ten * 10 % 2019
m[t[i - 1]] += 1
for i in m:
ans += i * (i - 1) // 2
print(ans) |
p03438 | s220097421 | Accepted | def main():
N = int(input())
A = [int(i) for i in input().split()]
B = [int(i) for i in input().split()]
op = sum(B) - sum(A)
D = [(b-a+1)//2 if b > a else 0 for a, b in zip(A, B)]
print("Yes" if op >= sum(D) else "No")
if __name__ == '__main__':
main()
|
p02639 | s170520839 | Wrong Answer | num_list = input().split()
i = 0
while True:
if num_list[i] != i + 1:
print(i + 1)
break
i += 1 |
p03821 | s792328614 | Wrong Answer | n = int(input())
ab = [input().split() for _ in [0]*n]
a = [int(i) for i, j in ab][::-1]
b = [int(j) for i, j in ab][::-1]
ans = 0
for i in range(n):
if b[i] == 1:
continue
ans += b[i] - ((a[i]+ans) % b[i])
print(ans)
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.