problem_id
stringclasses 428
values | submission_id
stringlengths 10
10
| status
stringclasses 2
values | code
stringlengths 5
816
|
|---|---|---|---|
p02811
|
s254918092
|
Accepted
|
k,x = map(int,input().split())
if 500*k >= x:
print("Yes")
else:
print("No")
|
p02982
|
s915142291
|
Wrong Answer
|
n,d=map(int,input().split())
l=[list(map(int,input().split())) for _ in range(n)]
cnt=0
for i in range(n-1):
for i2 in range(i+1,n):
distance = 0
for j in range(d):
distance+=(abs(l[i][j])-abs(l[i2][j]))**2
if (distance**0.5).is_integer():
cnt+=1
print(cnt)
|
p02642
|
s430141516
|
Accepted
|
N = int(input())
A = [int(x) for x in input().split()]
count = [0 for _ in range(10**6+10)]
for a in A:
if count[a] > 1:
continue
for x in range(0, 10**6+10, a):
count[x] += 1
ans = 0
for a in A:
if count[a] == 1:
ans += count[a]
print(ans)
|
p03210
|
s142509852
|
Accepted
|
X = int(input())
if(X == 7 or X == 5 or X == 3):
print('YES')
else:
print("NO")
|
p02847
|
s637007634
|
Accepted
|
S = input()
lis = ["SUN", "MON", "TUE", "WED", "THU", "FRI", "SAT"]
print(7 - lis.index(S))
|
p03433
|
s188402900
|
Wrong Answer
|
N = int(input())
A = int(input())
nokori = N % 500
if nokori <= A:
print("YES")
else:
print("NO")
|
p03127
|
s982859151
|
Wrong Answer
|
import sys
input=sys.stdin.buffer.readline
from math import*
n=int(input())
arr=list(map(int,input().split()))
ans=1
if n>2:
ans=gcd(arr[0],arr[1])
for i in range(2,n-1):
ans=gcd(ans,arr[i])
else:
ans=arr[0]
if arr[-1]%ans==0:
print(ans)
else:
print(arr[-1]%ans)
|
p03109
|
s469418011
|
Accepted
|
import re
s=input()
S=re.sub(r'([0-9]{4})/([0-9]{2})/([0-9]{2})',r'\1\2\3',s)
if int(S)<=20190430:
print('Heisei')
else:
print('TBD')
|
p02995
|
s231923810
|
Accepted
|
#!/usr/local/bin python
# -*- coding: utf-8 -*-
#
# ~/PycharmProjects/atcoder/C-RemainderMinimization.py
#
# import math
from fractions import gcd
a, b, c, d = map(int, input().split())
# cd_lcm = (c * d) // math.gcd(c, d)
cd_lcm = (c * d) // gcd(c, d)
ab_c = b//c - (a-1)//c
ab_d = b//d - (a-1)//d
ab_cd_both = b//cd_lcm - (a-1)//cd_lcm
ab_cd_either = ab_c + ab_d - ab_cd_both
ab_cd_neither = b-a+1 - ab_cd_either
print(ab_cd_neither)
|
p02771
|
s643587612
|
Wrong Answer
|
A,B,C=map(int,input().split())
ans = 0
if A==B:
ans = ans+1
if B==C:
ans=ans+1
if A==C:
ans=ans+1
if ans==3:
print("Yes")
else:
print("No")
|
p04019
|
s324444224
|
Accepted
|
S = list(input())
S.sort()
flag = 1
if 'N' in S:
if 'S' not in S:
flag = 0
if 'S' in S:
if 'N' not in S:
flag = 0
if 'E' in S:
if 'W' not in S:
flag = 0
if 'W' in S:
if 'E' not in S:
flag = 0
if flag:
print('Yes')
else:
print('No')
|
p03607
|
s084146683
|
Accepted
|
from collections import Counter
N=int(input())
A=[int(input()) for _ in range(N)]
l=[]
c=Counter(A)
values=list(c.values())
key=list(c.keys())
cnt=0
for i in range(len(key)):
l.append([key[i],values[i]])
for i in range(len(key)):
if l[i][1]%2==1:
cnt=cnt+1
print(cnt)
|
p02959
|
s693667039
|
Accepted
|
N = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
ans = 0
for i in range(N-1, -1, -1):
if B[i] >= A[i+1]:
B[i] -= A[i+1]
ans += A[i+1]
A[i+1] = 0
if B[i] >= A[i]:
ans += A[i]
A[i] = 0
else:
ans += B[i]
A[i] -= B[i]
else:
ans += B[i]
print(ans)
|
p02601
|
s746375774
|
Accepted
|
a, b, c = map(int, input().split())
k = int(input())
cnt = 0
while a >= b:
b *= 2
cnt += 1
while b >= c:
c *= 2
cnt += 1
if cnt <= k:
print("Yes")
else:
print("No")
|
p03495
|
s398005478
|
Accepted
|
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
import collections
c = collections.Counter(A)
lis = list()
for i in c.most_common():
lis.append(i[:][1])
lis.sort()
ans = 0
if len(c.most_common()) > K:
ans += sum(lis[:(len(c.most_common())- K)])
print(ans)
|
p02848
|
s029306585
|
Accepted
|
N=int(input())
S=list(input())
A = list('ABCDEFGHIJKLMNOPQRSTUVWXYZ')
for i in range(len(S)):
for j in range(26):
if S[i]==A[j]:
S[i]=A[(j+N)%26]
break
print(''.join(S))
|
p02578
|
s135421370
|
Accepted
|
n = int(input())
a = [int(i) for i in input().split(' ')]
result = 0
max_height = 0
for i in range(n):
an = a[i]
if i == 0:
max_height = an
max_height_idx = 0
continue
if an >= max_height:
max_height = an
max_height_idx = i
continue
result += (max_height - an)
print(result)
|
p03000
|
s684101250
|
Accepted
|
n,x = map(int,input().split())
l = list(map(int,input().split()))
ans = 0
count = 1
for i in range(n):
ans = ans + l[i]
if ans > x:
break
count += 1
print(count)
|
p02792
|
s953995290
|
Accepted
|
N = int(input())
cnt = [[0] * 10 for i in range(10)]
for n in range(1, N + 1):
cnt[int(str(n)[0])][int(str(n)[-1])] += 1
ans = 0
for i in range(10):
for j in range(10):
ans += cnt[i][j] * cnt[j][i]
print(ans)
|
p03433
|
s598241814
|
Accepted
|
import sys
input = sys.stdin.readline
def main():
N = int(input())
A = int(input())
if N % 500 <= A:
ans = "Yes"
else:
ans = "No"
print(ans)
if __name__ == "__main__":
main()
|
p02597
|
s170647057
|
Accepted
|
n = int(input())
C = list(input())
if "R" not in C:
print(0)
exit()
W = C.count("W")
R = C.count("R")
w = 0
r = R
ans = float('inf')
for c in C:
if c == "W":
w += 1
else:
r -= 1
ans = min(ans, max(w, r))
print(ans)
|
p03069
|
s561634619
|
Accepted
|
def main():
import sys
def input(): return sys.stdin.readline().rstrip()
n = int(input())
s = input()
cnt = [0]
for i in range(n):
cnt.append(cnt[-1])
if s[i] == '#':
cnt[-1] += 1
m = cnt[-1]
ans = 10**9
for i in range(n+1):
tmp = cnt[i] + (n-i)-(m-cnt[i])
ans = min(tmp, ans)
print(ans)
if __name__ == '__main__':
main()
|
p02802
|
s323313662
|
Accepted
|
n, m = map(int, input().split())
problem = [0] * n
ac = 0
penalty = 0
for i in range(m):
p, s = map(str, input().split())
if s == "AC":
temp = problem[int(p) - 1]
if temp >= 0:
ac += 1
penalty += temp
problem[int(p) - 1] = -1
else:
if problem[int(p) - 1] >= 0:
problem[int(p) - 1] += 1
print(ac, penalty)
|
p03282
|
s443321697
|
Accepted
|
def solve(s, k):
# 2^5000兆 >> 10^18 なので、sのk文字目までに1以外の数字xがあれば、k番目はxになる
for i in range(min(k, len(s))):
if s[i] != '1':
return int(s[i])
else:
return 1
_s = input()
_k = int(input())
print(solve(_s, _k))
|
p02842
|
s752508274
|
Wrong Answer
|
n = int(input())
for i in range(n+1):
if i * 1.08 == n:
print(i)
exit()
print(":(")
|
p02793
|
s995449609
|
Accepted
|
from fractions import gcd
MOD = 1000000007
N = int(input())
A = list(map(int, input().split()))
lcm = 1
for i in A: lcm = lcm * i // gcd(lcm, i)
ans = 0
for i in A: ans += lcm // i
print(ans % MOD)
|
p02773
|
s615493085
|
Wrong Answer
|
from collections import Counter
n = int(input())
a = [s for s in input().split()]
c = Counter(a)
list = c.most_common()
max = list[0][1]
ans = []
for i, j in list:
if j == max:
ans.append(i)
else:
break
ans.sort()
for i in range(len(ans)):
print(ans[i])
|
p02621
|
s338014328
|
Accepted
|
a = int(input())
print(a + a**2 + a**3)
|
p02572
|
s584651454
|
Accepted
|
from itertools import accumulate
mod = 10 ** 9 + 7
input()
l = list(map(int, input().split()))
print(sum(a * b % mod for a, b in zip(list(accumulate(l))[:-1], l[1:])) % mod)
|
p02725
|
s705486555
|
Accepted
|
k,n = [int(x) for x in input().split()]
l = [int(x) for x in input().split()]
from collections import deque
d = deque()
d.append(k-l[n-1]+l[0])
for i in range(n-1):
d.append(l[i+1]-l[i])
print(k-max(d))
|
p04011
|
s998943038
|
Wrong Answer
|
N = int(input())
K = int(input())
X = int(input())
Y = int(input())
print(K*X + max(0,(N-K))*Y)
|
p02647
|
s670858418
|
Wrong Answer
|
import numpy as np
N, K = (int(x) for x in input().split())
A = [int(x) for x in input().split()]
for k in range(K):
B = np.zeros(N)
for i in range(N):
B[int(max(0, i - A[i])):int(min(i + A[i], N - 1))] += 1
A = B
for a in A:
print(int(a), end=" ")
print()
|
p02792
|
s069213082
|
Accepted
|
#参考：http://at274.hatenablog.com/entry/2020/01/24/060000
N = int(input())
# cnt[i][j] := 先頭がi, 末尾がjで始まるような数
# 個数を格納できる行列の準備
cnt = [[0] * 10 for i in range(10)]
# Nまでカウントする（11>(1,1) 10231>(1,1))
for n in range(1, N + 1):
cnt[int(str(n)[0])][int(str(n)[-1])] += 1
ans = 0
for i in range(10):
for j in range(10):
ans += cnt[i][j] * cnt[j][i]
print(ans)
|
p02570
|
s551449779
|
Accepted
|
D, T, S = list(map(int, input().split()))
if T*S >= D:
print('Yes')
else:
print('No')
|
p02793
|
s440873947
|
Accepted
|
# -*- coding: utf-8 -*-
N = int(input())
A_list = list(map(int, input().split()))
# lcm & gcd not math
def gcd(a, b):
while b:
a, b = b, a % b
return a
def lcm(x, y):
return (x * y) // gcd(x, y)
from functools import reduce
def lcm_multi(num_list):
return reduce(lcm, num_list, 1)
div_num = 10 ** 9 + 7
lcm_num = lcm_multi(tuple(A_list))
ans = 0
for i in range(N):
ans += (lcm_num // A_list[i])
print(ans % div_num)
|
p02694
|
s730663948
|
Accepted
|
x = int(input())
t = 100
ans = 0
while t<x:
t += t//100
ans +=1
print(ans)
|
p03087
|
s035451720
|
Accepted
|
N, Q=map(int, input().split())
S = input()
t = [0]*(N + 1)
for i in range(N):
t[i+1] = t[i] + (1 if S[i:i+2] == 'AC' else 0)
for i in range(Q):
l, r = map(int, input().split())
print(t[r-1]-t[l-1])
|
p02761
|
s132193179
|
Accepted
|
N, M = map(int, input().split())
lst = [list(map(int, input().split())) for _ in range(M)]
lst.sort(key=lambda x: x[0])
n = 10 ** N
for i in range(n):
moji = str(i)
k = len(moji)
if k != N:
continue
flag = True
for s, c in lst:
if s > k or moji[s - 1] != str(c):
flag = False
break
if flag:
print(str(i))
exit()
print('-1')
|
p03161
|
s889985571
|
Wrong Answer
|
import math
n,k =map(int,input().split())
h= list(map(int,input().split()))
dp=[0]*n
dp[1]=abs(h[1]-h[0])
for i in range(2,n):
mindp=dp[i-1]+ abs(h[i]- h[i-1])
for j in range(max(i-k,0),i-2):
mindp= min(dp[j]+ abs(h[i]- h[j]), mindp)
dp[i]=mindp
print(dp[n-1])
|
p02597
|
s083126379
|
Accepted
|
n = int(input())
c = input()
cnt = 0
r = c.count('R')
r_s = c[:r].count('R')
print(r - r_s)
|
p02742
|
s868186636
|
Accepted
|
h, w = map(int, input().split())
if h == 1 or w == 1:
print(1)
elif h % 2 == 1 and w % 2 == 1:
print((h - 1) * w // 2 + (w+1) // 2 )
else:
print(h*w//2)
|
p02744
|
s299994611
|
Wrong Answer
|
if __name__ == '__main__':
n = int(input())
r = lambda n: [''] if n <= 0 else [e + j for e in r(n - 1) for j in [chr(ord('a') + e) for e in range(n)]]
a = r(n)
for e in a:
print(e)
|
p02861
|
s782483321
|
Accepted
|
n = int(input())
xy = []
ans = 0
for _ in range(n):
xy.append([int(i) for i in input().split()])
for i in range(n-1):
for j in range(i+1, n):
ans += ((xy[j][0] - xy[i][0])**2 + (xy[j][1] - xy[i][1])**2)**0.5
print(ans*2/n)
|
p02888
|
s606720789
|
Accepted
|
import bisect
N=int(input())
L=list(map(int,input().split()))
L.sort()
ans=0
for i in range(N):
for j in range(i+1,N):
ans+=bisect.bisect_left(L,L[i]+L[j])-j-1
print(ans)
|
p02647
|
s247768143
|
Accepted
|
from itertools import accumulate
N, K = map(int, input().split())
A = list(map(int, input().split()))
for k in range(min(50, K)):
B = [0]*N
for i in range(N):
B[max(0, i-A[i])] += 1
r = i+A[i]+1
if r < N:
B[r] -= 1
A = list(accumulate(B))
print(*A)
|
p02784
|
s536209348
|
Accepted
|
H, N = [int(x) for x in input().split()]
attacks = [int(x) for x in input().split()]
print("Yes" if H - sum(attacks) <= 0 else "No")
|
p02768
|
s911445341
|
Wrong Answer
|
def framod(x,y,p=10**9+7):
for i in range(x+1,y+1):
x = (x*i)%p
return x
#########################################
n,a,b=map(int,input().split())
p=10**9+7
ans=0
for i in [a,b]:
upper = framod(n-i+1,n,p)
lower = framod(1,i,p)
ret = (upper*pow(lower,p-2,p))%p
ans = (ans+ret)%p
print(pow(2,n,p)-ans-1)
|
p02790
|
s330258267
|
Accepted
|
a, b=map(int, input().split())
if a<=b:
ans = [a for i in range(b)]
else:
ans = [b for i in range(a)]
print(*ans, sep="")
|
p03721
|
s759157824
|
Accepted
|
N,K=map(int,input().split())
d={}
for i in range(N):
a,b=map(int,input().split())
if a not in d:
d[a]=b
else:
d[a]+=b
d=sorted(d.items())
for i in d:
K-=i[1]
if K<=0:
print(i[0])
break
|
p03323
|
s944758625
|
Wrong Answer
|
a,b = map(int,input().split())
if a <= 8 and b <= 8:
print('Yey!')
else:
print(':(')
|
p03624
|
s622515620
|
Accepted
|
# coding: utf-8
S = sorted(input())
A = ['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']
for i in A:
if i not in S:
print(i)
exit()
else:
print('None')
|
p02712
|
s058715216
|
Wrong Answer
|
N = int(input())
N3 = N//3
N5 = N//5
N15 = N//15
S = N * (N+1) / 2
S3 = N3 * (N3+1) / 2 *3
S5 = N5 * (N5+1) / 2 *5
S15 = N15 * (N15+1) / 2 *15
sum = S - (S3 + S5 -S15)
print(sum)
|
p03385
|
s366858279
|
Wrong Answer
|
S = str(input())
if S[0] == S[1] == S[2]:
print('No')
else:
print('Yes')
|
p02695
|
s367047171
|
Accepted
|
N, M, Q = map(int, input().split())
X=[0]*Q
for i in range(Q):
X[i] = list(map(int, input().split()))
from itertools import combinations_with_replacement
def solve(N,M,Q,X):
ans = 0
for c in combinations_with_replacement(range(1,M+1), N-1):
A = [1]+list(c)
score = 0
for x in X:
if A[x[1]-1]-A[x[0]-1]==x[2]:
score += x[3]
ans = max(ans,score)
return ans
print(solve(N,M,Q,X))
|
p03208
|
s208487951
|
Wrong Answer
|
n,k=map(int,input().split());h=sorted([int(input()) for _ in range(n)])
a,b=h[:k],h[k-1:];print(min(max(a)-min(a),max(b)-min(b)))
|
p02785
|
s397183840
|
Wrong Answer
|
import numpy as np
import numpy
N,K =(float(x) for x in input().split())
list1 = np.array([float(s) for s in input().split()])
print(list1)
list2=np.sort(list1)
i=0
sum=0
while i<N-K:
sum=sum+list2[i]
i=i+1
print(sum)
|
p02786
|
s284727418
|
Accepted
|
H = int(input())
n = 0
while(H != 1):
H = H//2
n += 1
#print(n)
print(pow(2, n+1)-1)
|
p03994
|
s136446963
|
Wrong Answer
|
# coding: utf-8
# Your code here!
s=input()
K=int(input())
ans=[]
#122
for item in s[:len(s)-1]:
cost=(123-ord(item))
if K>=cost:
K-=cost
ans.append("a")
else:
ans.append(item)
K%=26
last=ord(s[-1])
if last+K>122:
ans.append(chr(last+K-26))
else:
ans.append(chr(last+K))
print("".join(ans))
|
p02910
|
s982999522
|
Wrong Answer
|
S = input()
if all([x in ['R', 'U', 'D'] for x in S[::2]]):
print('Yes')
elif all([x in ['L', 'U', 'D'] for x in S[1::2]]):
print('Yes')
else:
print('No')
|
p03013
|
s544737785
|
Wrong Answer
|
N,M = map(int,input().split())
A = [int(input()) for _ in range(M)]
dp = [0]*(N+1)
dp[0] = 1
dp[1] = 1
for i in range(2,N+1):
if i not in A:
dp[i] = (dp[i-1] + dp[i-2])%1000000007
else:
dp[i] = 0
print(dp[N])
|
p02989
|
s511472173
|
Wrong Answer
|
N=int(input())
d=[int(s) for s in input().split(" ")]
d.sort()
if (N//2)%2==0:
print(0)
else:
K=d[(N//2)]-d[(N//2)-1]
if d[N//2]==d[(N//2)-2]:
K=0
print(K)
|
p02818
|
s300897753
|
Accepted
|
A,B,K = list(map(int,input().split()))
if K <= A:
print('{} {}'.format(A-K,B))
if A < K <= A+B:
print('{} {}'.format(0,A+B-K))
if A+B < K:
print('{} {}'.format(0,0))
|
p03698
|
s700762648
|
Accepted
|
# coding = SJIS
s = str(input())
if len(set(s)) == len(s):
print("yes")
else:
print("no")
|
p03385
|
s408075538
|
Accepted
|
a = list(input())
a.sort()
if a[0] == "a" and a[1] == "b" and a[2] == "c":
print("Yes")
else:
print("No")
|
p02642
|
s585549590
|
Wrong Answer
|
from collections import Counter
from math import sqrt
from bisect import bisect_left
n = int(input())
a = Counter(map(int, input().split()))
nums = sorted(list(a.keys()))
ans = n
for num, count in a.items():
if count > 1:
ans -= count
continue
index = bisect_left(nums, sqrt(num))
search_range = nums[:index + 1]
for i in search_range:
if num % i == 0 and num != i:
ans -= count
break
print(ans)
|
p02783
|
s629210278
|
Accepted
|
h, n = map(int,input().split())
ans = int(h // n)
if h % n:
ans += 1
print(ans)
|
p02556
|
s774756722
|
Wrong Answer
|
N = int(input())
M0 = M1 = 0
m0 = m1 = float('inf')
for _ in range(N):
x, y = map(int, input().split())
M0 = max(M0, x - y)
m0 = min(m0, x - y)
M1 = max(M1, x + y)
m1 = min(m1, x + y)
print(max(M0 - m0, M1 - m1))
|
p03251
|
s878686065
|
Accepted
|
def resolve():
n, m, x, y = map(int, input().split())
xp = list(map(int, input().split()))
yp = list(map(int, input().split()))
for i in range(-99, y+1):
ok = True
if i <= x or i > y:
continue
for cx in xp:
if cx >= i:
ok = False
break
for cy in yp:
if cy < i:
ok = False
break
if ok:
print('No War')
return
print('War')
resolve()
|
p03037
|
s395994953
|
Accepted
|
n, m = map(int, input().split())
l = []
r = []
for i in range(m):
L, R = map(int, input().split())
l += [L]
r += [R]
l_max = max(l)
r_min = min(r)
print(max(r_min - l_max + 1, 0))
|
p03815
|
s033316162
|
Accepted
|
print((2*int(input())-2)//11+1)
|
p03109
|
s612622548
|
Accepted
|
a,b,c=map(int,input().split('/'))
if a>2019 or(a==2019 and b>4):print('TBD')
else:print('Heisei')
|
p03449
|
s288732474
|
Accepted
|
n = int(input())
a = [list(map(int,input().split())) for i in range(2)]
ans = 0
for i in range(n):
k = sum(a[1][i:])+sum(a[0][0:i+1])
if k > ans:
ans = k
print(ans)
|
p04012
|
s183844493
|
Accepted
|
n = list(input())
for i in n:
if n.count(i)%2 != 0:
print("No")
exit()
print("Yes")
|
p02712
|
s207989311
|
Wrong Answer
|
N=int(input())
array=[]
for i in range(N):
if i%3!=0 and i%5!=0:
array.append(i)
value=sum(array)
print(value)
|
p02995
|
s890007028
|
Wrong Answer
|
import math
a,b,c,d=map(int,input().split())
def gcd(a,b):
if b>a:
b,a=a,b
if b==0:
return a
else:
return gcd(b,a%b)
def warikiri(n,c,d):
koubai=(c*d)//gcd(c,d)
return n-math.floor(n/d)-math.floor(n/c)+math.floor(n/koubai)
print(warikiri(b,c,d)-warikiri(a-1,c,d))
|
p03623
|
s643473045
|
Wrong Answer
|
x, a, b = map(int, input().split())
c = 1 if a < b else -1
print("A" if x < (a + b) * c / 2 else "B")
|
p02973
|
s311756254
|
Wrong Answer
|
from sys import stdin, setrecursionlimit
from collections import defaultdict
def main():
input = stdin.buffer.readline
n = int(input())
a = [int(input()) for _ in range(n)]
ans = 0
min = float('inf')
dic = defaultdict(int)
for ai in a:
dic[ai] += 1
if ai <= min:
ans += 1
min = ai
elif dic[ai] > ans:
ans += 1
print(ans)
if __name__ == "__main__":
setrecursionlimit(10000)
main()
|
p02689
|
s868045905
|
Accepted
|
N, M = map(int, input().split())
H = list(map(int, input().split()))
h = []
for i in H:
h.append(i)
for i in range(M):
a, b = map(int, input().split())
if h[a-1] <= H[b-1] and h[a-1] != -1:
h[a-1] = -1
if h[b-1] <= H[a-1] and h[b-1] != -1:
h[b-1] = -1
ans = N
for i in h:
if i == -1:
ans -= 1
print(ans)
|
p02785
|
s179171336
|
Accepted
|
n,k = map(int, input().split())
a = list(map(int,input().split()))
list_a = sorted(a, reverse = True)
if k >= n:
print(0)
else:
attack = sum(list_a[k:])
print(attack)
|
p02658
|
s302082154
|
Accepted
|
n=int(input())
A=list(map(int,input().split()))
if 0 in A:
print(0)
exit()
a=1
f=0
for i in range(n):
a=a*A[i]
if a>10**18:
f=1
break
if f==0:
print(a)
else:
print(-1)
|
p03557
|
s464967175
|
Accepted
|
n = int(input())
#k, x = map(int, input().split())
al = list(map(int, input().split()))
bl = list(map(int, input().split()))
cl = list(map(int, input().split()))
import bisect
al.sort();bl.sort();cl.sort()
ans=0
for bi in bl:
c1 = bisect.bisect_right(al, bi-1)
c2 = n-bisect.bisect_left(cl, bi+1)
ans += c1*c2
print(ans)
|
p02761
|
s579770967
|
Accepted
|
n, m = map(int, input().split())
S = [list(map(int, input().split())) for _ in range(m)]
for i in range(10 ** n):
flag = True
st = str(i)
if len(st) != n:
continue
for s, c in S:
if int(st[s - 1]) != c:
flag = False
break
if flag:
print(int(st))
break
else:
print(-1)
|
p03035
|
s167470278
|
Accepted
|
a,b=map(int,input().split())
if a<6:
print(0)
elif a<13:
print(b//2)
else:
print(b)
|
p02835
|
s236285171
|
Wrong Answer
|
import sys
stdin=sys.stdin
ip=lambda: int(sp())
lp=lambda:list(map(int,stdin.readline().split()))
sp=lambda:stdin.readline().rstrip()
a,b,c=lp()
if a+b+c>=22:
print('burst')
else:
print('win')
|
p03555
|
s218827114
|
Accepted
|
c1 = input()
c2 = input()
print("YES" if c1 == c2[::-1] else "NO")
|
p03997
|
s817461287
|
Wrong Answer
|
a = int(input())
b = int(input())
h = int(input())
print((a+b)*h/2)
|
p02639
|
s118590656
|
Accepted
|
import sys
A = list(map(int, sys.stdin.readline().strip().split()))
print(A.index(0) + 1)
|
p03557
|
s278512437
|
Accepted
|
import bisect
N = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))
A.sort()
B.sort()
C.sort()
ans = 0
for b in B:
n_lower_B = bisect.bisect_left(A, b)
n_higher_B = N - bisect.bisect_right(C, b)
ans += n_lower_B * n_higher_B
print(ans)
|
p03075
|
s068060436
|
Accepted
|
N = []
for i in range(6):
N.append(int(input()))
ans = "Yay!"
for i in range(5):
for j in range(i+1,5):
dist = abs(N[j] - N[i])
if dist > N[5]:
ans = ":("
print(ans)
##5m
|
p02578
|
s027473613
|
Wrong Answer
|
n=int(input())
l=list(map(int,input().split()))
mx=l[0]
an=0
for i in range(1,n):
if l[i]<mx:
an+=mx-l[i]
else:
l[i]=mx
print(an)
|
p02859
|
s684476590
|
Wrong Answer
|
import math
r=(input("半径を入力してください"))
r1=int(r)
area1 = math.pi*r1**2
ratio = area1/math.pi
print(ratio)
|
p02695
|
s575644088
|
Accepted
|
from itertools import *
N,M,Q = map(int,input().split())
abcd = [list(map(int,input().split())) for q in range(Q)]
print(max(sum(d for a,b,c,d in abcd if i[b-1]-i[a-1]==c) for i in combinations_with_replacement(range(M),N)))
|
p02555
|
s875949070
|
Accepted
|
n = int(input())
if n<3:
print(0)
exit()
mod=10**9+7
memo=[0]*(n+1)
memo[0]=1
for i in range(3,n+1):
memo[i]=sum(memo[:i-2])%mod
print(memo[n])
|
p02823
|
s160139711
|
Accepted
|
n,a,b = map(int, input().split())
if (b-a)%2==0:
ans = (b-a)//2
else:
ans = min(n-a, b-1)
ans = min(ans, min(a-1, n-b) + (b-a-1)//2 + 1)
# ans = ((b-a)+2-1)//2 + 1
print(ans)
|
p03448
|
s128487819
|
Accepted
|
a, b, c, x = [int(input()) for i in range(4)]
print(sum(500*i+100*j+50*k == x for i in range(a+1) for j in range(b+1) for k in range(c+1)))
|
p02935
|
s060964504
|
Accepted
|
N = int(input())
v = list(map(int, input().split()))
v.sort()
for i in range(N-1):
v[1] = (v[0]+v[1]) / 2
v.pop(0)
print(sum(v))
|
p04033
|
s380179745
|
Wrong Answer
|
a,b=map(int,input().split())
if (a>0 and b>0) or (((a+b) % 2)==0):
print("Positive")
elif a<=0<=b:
print("Zero")
else:
print("Negative")
|
p03011
|
s480620980
|
Accepted
|
P, Q, R = map(int, input().split())
print(min(P+Q,Q+R,R+P))
|
p03720
|
s310775488
|
Accepted
|
n,m=map(int,input().split())
freq=[0]*n
for _ in range(m):
a,b=map(int,input().split())
a-=1
b-=1
freq[a]+=1
freq[b]+=1
for i in range(n):
print(freq[i])
|
p02622
|
s431805848
|
Wrong Answer
|
s=input()
t=input()
a=t.count(s)
b=len(t)-a
print(b)
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.