problem_id
stringclasses 428
values | submission_id
stringlengths 10
10
| status
stringclasses 2
values | code
stringlengths 5
816
|
|---|---|---|---|
p02571
|
s035330854
|
Accepted
|
#!/usr/bin/env python
def main():
s = input() + "#"
t = input()
m = len(s)
n = len(t)
c_max = 0
for i in range(m-n):
cnt = 0
for j in range(n):
if s[i+j] == t[j]:
cnt += 1
if cnt > c_max:
c_max = cnt
print(n - c_max)
if __name__ == '__main__':
main()
|
p02952
|
s626109667
|
Accepted
|
n=int(input())
ans=0
ans+=9 if n>=10 else n
ans+=900 if n>=1000 else max(n-99,0)
ans+=90000 if n>=100000 else max(n-9999,0)
print(ans)
|
p03448
|
s587465695
|
Wrong Answer
|
a = int(input());b = int(input());c = int(input());x = int(input())
s = 0
n = 0
counter = 0
for i in range(a):
for j in range(b):
for k in range(c):
s = 500*i + 100*j + 50*k
if s == x:
counter += 1
for s in range(c):
for t in range(b):
for u in range(a):
n = 50*s + 100*t + 500*u
if n == x:
counter += 1
print(counter)
|
p02701
|
s671610689
|
Wrong Answer
|
s = input().split()
print(len(set(s))-1)
|
p02570
|
s767101235
|
Accepted
|
def tc(arr):
tn = arr[0]/arr[2]
return "Yes" if tn<=arr[1] else "No"
u = list(map(int, input().split()))
print(tc(u))
|
p03910
|
s855369442
|
Accepted
|
n = int(input())
sum_i = 0 # 問題のインデックスの合計
i = 0
while sum_i < n:
i += 1
sum_i += i
for ans in range(1, i+1):
if ans == sum_i - n:
continue
print(ans)
|
p03351
|
s937418600
|
Wrong Answer
|
a, b, c, d = map(int,input().split())
if abs(a -c) <= d:
print("Yes")
elif abs(a - b) <= d and (b - c) <= d:
print("Yes")
else:
print("No")
|
p02663
|
s175868081
|
Wrong Answer
|
H_1, M_1, H_2, M_2, K = map(int, input().split())
H_ = H_2 * 60 + M_2 - K
H = H_ - (H_1*60+M_2)
print(H)
|
p02596
|
s969347190
|
Accepted
|
k = int(input())
if k==1 or k==7:
print(1)
elif k%2==0:
print(-1)
else:
cnt = 1
pre = 7
while(True):
surp = (pre*10+7)%k
cnt += 1
if surp==0:
break
if cnt>1000000:
cnt = -1
break
pre = surp
print(cnt)
|
p02899
|
s426720032
|
Accepted
|
n = int(input())
A = list(map(int, input().split()))
B = [(a, i + 1) for i, a in enumerate(A)]
B.sort()
ans = [j for _, j in B]
print(*ans)
|
p02881
|
s438605633
|
Accepted
|
n = int(input())
res = 10 ** 15
for i in range(1, int(n ** .5) + 1):
if n % i == 0:
j = n // i
res = min(res, i + j - 2)
print(res)
|
p03994
|
s070814217
|
Accepted
|
s = input()
K = int(input())
for i in range(len(s)-1):
z2a = (ord('z') + 1 - ord(s[i])) % 26
if z2a <= K:
s = s[:i] + 'a' + s[i+1:]
K -= z2a
print(s[:len(s)-1] + chr(((ord(s[len(s)-1]) - ord('a')) + K % 26) % 26 + ord('a')))
|
p02970
|
s554001235
|
Accepted
|
n,d = map(int, input().split())
if n % (2*d+1) == 0:
print(n // (2*d+1))
else:
print(n // (2*d+1) + 1)
|
p03471
|
s145372390
|
Accepted
|
import sys
num = sys.stdin.readline().split(' ')
N = int(num[0])
Y = int(num[1])
for x in range(N+1):
for y in range(N+1):
if 10000 * x + 5000 * y + 1000*(N-x-y) == Y and N-x-y >= 0:
print(str(x)+' '+str(y)+' '+str(N-x-y))
sys.exit()
else:
continue
print('-1 -1 -1')
|
p03380
|
s727988844
|
Accepted
|
import bisect
n = int(input())
a = list(map(int,input().split()))
a.sort()
idx = bisect.bisect_left(a,a[-1]/2)
if idx == 0:
print(a[-1],a[idx])
else:
x,y = a[idx-1],a[idx]
if y - a[-1]/2 < a[-1]/2 - x:
print(a[-1],y)
else:
print(a[-1],x)
|
p02571
|
s346425357
|
Accepted
|
s = input()
s = list(s)
t = input()
t = list(t)
l = []
for i in range(len(s)-len(t)+1) :
moji = s[i]
for j in range(len(t)-1) :
moji += s[i+j+1]
l.append(moji)
moji = ""
c = 0
ans = 1000
for i in range(len(l)):
c = 0
for j in range(len(t)):
if l[i][j] != t[j] :
c += 1
if ans > c :
ans = c
print(ans)
|
p02714
|
s867466960
|
Accepted
|
n=int(input())
s=input()
ans=s.count("R")*s.count("G")*s.count("B")
for i in range(n):
for j in range(n):
k=i+j
l=k+j
if l >= n:
break
if s[i]!=s[k] and s[k]!=s[l] and s[l]!=s[i]:
ans -= 1
print(ans)
|
p04043
|
s829367290
|
Accepted
|
a = list(map(int, input().split()))
if a.count(5) == 2 and a.count(7) == 1:
print('YES')
else:
print('NO')
|
p02690
|
s660528066
|
Wrong Answer
|
def main():
X = int(input())
A = 1
B = 0
while A <= 100:
for B in range(A-1, A*(-1)-1, -1):
x = A ** 5 - B ** 5
# print(A, B, x)
if x == X:
print(A, B, sep=" ")
return
# break
A += 1
if __name__ == "__main__":
main()
|
p04011
|
s202327905
|
Accepted
|
n = int(input())
k = int(input())
x = int(input())
y = int(input())
if k < n:
print(k*x+(n-k)*y)
else:
print(n*x)
|
p03778
|
s244168359
|
Accepted
|
w, a, b = map(int, input().split())
if b+w < a:
print(a-b-w)
elif a+w < b:
print(b-a-w)
else:
print(0)
|
p03785
|
s655672403
|
Wrong Answer
|
import sys
input = sys.stdin.readline
N, C, K = map(int, input().split())
T = [int(input()) for _ in range(N)]
T.sort()
ans = 0
i = 0
while i<N:
lim = T[i]+K
ans += 1
cnt = 0
while i<N and cnt<C and T[i]<lim:
i += 1
cnt += 1
print(ans)
|
p02641
|
s407730096
|
Wrong Answer
|
target = input().split()
target = [int(i) for i in target]
arr = input().split()
arr = [int(i) for i in arr]
if len(arr)==0:
print(target[0])
else:
i=0
while(1):
if target[0]-i in arr:
i+=1
else:
print(target[0]-i)
break
|
p02836
|
s628098218
|
Accepted
|
S=input()
N=len(S)
if N%2==0:
T0=S[:N//2]+S[:N//2][::-1]
T1=S[::-1][:N//2]+S[::-1][:N//2][::-1]
else:
T0=S[:N//2]+S[N//2]+S[:N//2][::-1]
T1=S[::-1][:N//2]+S[N//2]+S[::-1][:N//2][::-1]
count0=0
count1=0
for n in range(N):
if S[n]!=T0[n]:
count0+=1
if S[n]!=T1[n]:
count1+=1
print(min(count0,count1))
|
p02765
|
s468394737
|
Accepted
|
import sys
import math
import bisect
def main():
n, m = map(int, input().split())
if n < 10:
m += 100 * (10 - n)
print(m)
if __name__ == "__main__":
main()
|
p02706
|
s488410331
|
Accepted
|
n,m = map(int,input().split())
ls_a = list(map(int,input().split()))
days = n - sum(ls_a)
if days < 0:
print(-1)
else:
print(days)
|
p02953
|
s345820053
|
Accepted
|
n = int(input())
h = list(map(int, input().split()))
def f():
global h
for i in range(n - 1, 0, -1):
diff = h[i - 1] - h[i]
if diff >= 2:
return 'No'
elif diff == 1:
h[i - 1] = h[i - 1] - 1
return 'Yes'
print(f())
|
p03285
|
s553557354
|
Wrong Answer
|
n=int(input())
if n%4==0:
print("Yes")
elif (n-4*(n//4))%7==0:
print("Yes")
else:
print("No")
|
p02658
|
s191660678
|
Wrong Answer
|
N=int(input())
A = [int(x) for x in input().split()]
x=1
flg=0
for i in range(N):
x=x*A[i]
if x>10**18:
flg=1
break
if flg==1:
print(-1)
else:
print(x)
"""
3
101 9901 999999000001
"""
|
p03698
|
s692314246
|
Wrong Answer
|
s = input()
end = []
for i in s:
if (end.count(i)==0):
end.append(i)
else:
print("no")
exit()
print("Yes")
|
p02801
|
s824159353
|
Accepted
|
#!/usr/bin/env python3
import collections as cl
import sys
def II():
return int(sys.stdin.readline())
def MI():
return map(int, sys.stdin.readline().split())
def LI():
return list(map(int, sys.stdin.readline().split()))
def main():
c = input()
print(chr(ord(c) + 1))
main()
|
p03160
|
s732160579
|
Accepted
|
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)
INF = 10 ** 10
n = int(input())
h = [0] + list(map(int, input().split()))
dp = [INF] + [INF] * n
dp[1] = 0
def chmin(dp_table, index, value):
if dp_table[index] > value:
dp_table[index] = value
for i in range(2, n+1):
chmin(dp, i, dp[i-1] + abs(h[i] - h[i-1]))
chmin(dp, i, dp[i-2] + abs(h[i] - h[i-2]))
print(dp[n])
|
p03323
|
s640006466
|
Accepted
|
A, B = map(int, input().split())
if A <= 8 and B <= 8:
print('Yay!')
else:
print(':(')
|
p03071
|
s261613109
|
Accepted
|
a,b = map(int,input().split())
print(max(a+a-1,a+b,b+b-1))
|
p03069
|
s424091856
|
Wrong Answer
|
N = int(input())
S = input()
right_white = S.count(".")
left_black = 0
ans = float("inf")
for i in range(N):
if S[i] == ".":
right_white -= 1
else:
left_black += 1
ans = min(ans, right_white+left_black)
print(ans)
|
p04019
|
s213376041
|
Accepted
|
S=input()
sn = "N" in S
se = "E" in S
ss = "S" in S
sw = "W" in S
if (sn==ss) and (se==sw):
print("Yes")
else:
print("No")
|
p03071
|
s052785330
|
Accepted
|
a,b=map(int,input().split())
if a<b:
ct=b
b-=1
else :
ct=a
a-=1
if a<b:
ct+=b
else:
ct+=a
print(ct)
|
p02603
|
s923676087
|
Wrong Answer
|
n = int(input())
a = list(map(int,input().split()))
lis = [0]*n
for i in range(n-1):
if a[i] > a[i+1]:
lis[i] = -1
b = a[::-1]
for i in range(n-1):
if b[i] < b[i+1]:
lis[i] = 1
lis[-1] = -1
m = 1000
k = 0
for i in range(n):
if lis[i] == 1:
k += m//a[i]
m = m%a[i]
elif lis[i] == -1:
m += k*a[i]
k = 0
print(m)
|
p02657
|
s670107401
|
Wrong Answer
|
a, b = map(int, input().split())
print(a)
print(b)
answer = a * b
print(answer)
|
p02618
|
s763634714
|
Accepted
|
D=int(input())
c=list(map(int,input().split()))
s=[list(map(int,input().split())) for i in range(D)]
lastday=[0 for j in range(26)]
points=[0 for i in range(D)]
t=[0 for i in range(D)]
# first day
lastday=[lastday[i]+1 for i in range(26)]
firstday=s[0].index(max(s[0]))
lastday[firstday]=0
t[0]=firstday+1
for days in range(1,D):
temp=[s[days][i]-c[i]*lastday[i] for i in range(26)]
today=temp.index(min(temp))
lastday=[lastday[i]+1 for i in range(26)]
lastday[today]=0
t[days]=today+1
for ts in t:
print(ts)
|
p02613
|
s383166603
|
Wrong Answer
|
n = int(input())
s = list(input() for i in range(n))
ac = 0
wa = 0
tle = 0
re = 0
for i in range(n):
if s[i] == "AC":
ac+=1
elif s[i] == "WA":
wa += 1
elif s[i] == "TLE":
tle += 1
else:
re += 1
print("AC ×", str(ac))
print("WA ×",str(wa))
print("TLE ×",str(tle))
print("RE ×",str(re))
|
p03617
|
s803842171
|
Accepted
|
Q, H, S, D = map(int, input().split())
N = int(input())
S = min(S, 4*Q, 2*H)
D = min(D, 2*S)
print(D*(N//2) if N % 2 == 0 else D*(N//2) + S)
|
p02699
|
s983518884
|
Accepted
|
S, W = map(int, input().split())
if S <= W:
print('unsafe')
else:
print('safe')
|
p03339
|
s282134109
|
Wrong Answer
|
n = int(input())
s = input()
e = s.count("E")
w = n - e
ans = 10**9
if s[0] == "W":
cnt = e
else:
cnt = w
num = cnt
for i in range(n-1):
if s[i] == s[i+1] and s[i] == "E":
cnt -= 1
elif s[i] == s[i+1]:
cnt += 1
#print(i,cnt)
ans = min(ans,cnt,num)
ans = max(ans,0)
print(max(ans,0))
|
p03011
|
s066041499
|
Accepted
|
num = list(map(int, input().split()))
ans = 1000
for i in range(3):
t = num[i-1] + num[i]
ans = min(t, ans)
print(ans)
|
p02678
|
s009154969
|
Wrong Answer
|
N,M=map(int,input().split())
P=[[] for i in range(N+1)]
for i in range(M):
a,b=map(int,input().split())
P[a].append(b)
P[b].append(a)
#AB=[list(map(int,input().split())) for i in range(M)]
ans=[0]*N
con=set()
now=[1]
while now!=[]:
_now=[]
for n in now:
for p in P[n]:
if p in con:
continue
ans[p-1]=n
_now.append(p)
con.add(p)
#con.add(n)
now=_now
print('yes')
for a in ans[1:]:
print(a)
|
p03438
|
s264040674
|
Accepted
|
N = int(input())
A = list(map(int,input().split()))
B = list(map(int,input().split()))
out = "No"
SBA = sum(B)-sum(A)
if SBA>=0:
cnt = 0
for i in range(N):
if A[i]<B[i]:
cnt += (B[i]-A[i]+1)//2
if cnt<=SBA:
out = "Yes"
print(out)
|
p03495
|
s279785500
|
Accepted
|
n, k = map(int, input().split())
a = list(map(int, input().split()))
a.sort()
count = 1
num_count = 1
num_count_list = list()
for i in range(1, n):
if(a[i] == a[i - 1]):
num_count += 1
else:
num_count_list.append(num_count)
num_count = 1
count += 1
num_count_list.append(num_count)
num_count_list.sort()
result = 0
if(count > k):
loop = count - k
for i in range(loop):
result += num_count_list[i]
print(result)
|
p03730
|
s024040782
|
Accepted
|
a, b, c = map(int, input().split())
from fractions import gcd
if c % gcd(a, b) == 0:
print('YES')
else:
print('NO')
|
p02814
|
s807409355
|
Accepted
|
import math
def lcm(a, b):
return (a * b) // math.gcd(a, b)
def div2(n):
return bin(n)[::-1].find("1")
n, m = map(int, input().split())
a = list(map(int, input().split()))
ans = a[0]
count = div2(a[0])
for i in range(1, len(a)):
if count != div2(a[i]):
print(0)
exit()
ans = lcm(ans, a[i])
ans //= 2
print((m // ans + 1) // 2)
|
p03163
|
s264227106
|
Accepted
|
INF = float('inf')
MAX_N = 110
MAX_W = 10**5 + 100
N, W = map(int, input().split())
w, v = [0]*N, [0]*N
for i in range(N):
w[i], v[i] = map(int, input().split())
dp = [[0]*MAX_W for _ in range(MAX_N)]
for i in range(1,N+1):
for j in range(W+1):
if j-w[i-1]>=0:
dp[i][j] = max(dp[i][j], dp[i-1][j-w[i-1]]+v[i-1])
dp[i][j] = max(dp[i][j], dp[i-1][j])
print(dp[N][W])
|
p03042
|
s198575386
|
Wrong Answer
|
s = input()
l = s[:2]
r = s[2:]
if(int(l) <=12 and int(r) <= 12):
print('AMBIGUOUS')
else :
if(int(l) <= 12):
print('MMYY')
else:
if(int(r) <= 12):
print('YYMM')
else:
print('NA')
|
p02690
|
s277886141
|
Accepted
|
X = int(input())
fif = [i**5 for i in range(200)]
for i in range(len(fif)):
B5 = fif[i] - X
if abs(B5) in fif:
index = fif.index(abs(B5))
B = B5//abs(B5) * index
break
print(i, B)
|
p03087
|
s812862535
|
Wrong Answer
|
N,M = list(map(int,input().split()))
l_n = input()
l_a = [0] * (N+1)
for i in range(N):
l_a[i+1] = l_a[i] + (1 if l_n[i:i+2] == 'AC' else 0)
print(l_a)
for i in range(M):
l,r = map(int,input().split())
print(l_a[r-1]-l_a[l-1])
|
p03163
|
s886538150
|
Accepted
|
import numpy as np
N,W = map(int,input().split())
w,v = [],[]
for i in range(N):
a,b = map(int,input().split())
w += [a]
v += [b]
dp = np.zeros(W+1,dtype = int)
for i in range(N):
dp[w[i]:] = np.maximum(dp[:-w[i]]+v[i],dp[w[i]:])
print(dp[-1])
|
p02951
|
s259183701
|
Accepted
|
A, B, C = map(int, input().split())
if C -(A-B) > 0:
print(C -(A-B))
else:
print(0)
|
p03971
|
s867917744
|
Wrong Answer
|
n, a, b = map(int, input().split())
s = input()
print(len(s))
total_cnt = 0
b_cnt = 0
ans = ["No"]*n
for i in range(n):
if total_cnt >= a+b:
break
if s[i] == "c":
continue
if s[i] == "a":
total_cnt += 1
ans[i] = "Yes"
if s[i] == "b":
b_cnt += 1
if b_cnt <= b:
ans[i] = "Yes"
for i in range(n):
print(ans[i])
|
p03041
|
s560538760
|
Wrong Answer
|
s=input()
a=int(s[:2])
b=int(s[2:])
if 1<=a<=12 and 1<=b<=12:
print("AMBIGUOUS")
elif 1<=a<=12 and (12<b or b==0):
print("MMYY")
elif (12<a or a==0) and 1<=b<=12:
print("YYMM")
else:
print("NA")
|
p02718
|
s511025165
|
Accepted
|
N, M = map(int, input().split(" "))
A = list(map(int, input().split(" ")))
sum_votes = sum(A)
count = 0
for i in range(N):
if not sum_votes > A[i] * 4 * M:
count += 1
if count >= M:
print('Yes')
else:
print('No')
|
p02696
|
s578918747
|
Wrong Answer
|
A, B, N = map(int, input().split())
x = B-1 if B-1 > N else N
print(A*x//B-A*(x//B))
|
p02677
|
s404823496
|
Wrong Answer
|
import math
a, b, h, m = map(int, input().split())
# 角度を求める
H = 30 * h + (m/2)
M = 6 * m
theta = abs(H-M)
if theta == 0 or theta == 360:
print(abs(a-b))
exit()
if theta > 180:
theta = theta - 180
#print(a, b, H, M, theta, math.sin(theta), math.cos(theta), math.tan(theta), math.sin(math.radians(theta)), math.cos(math.radians(theta)), math.tan(math.radians(theta)))
l = a * a + b * b - 2 *a*b* math.cos(math.radians(theta))
print(math.sqrt(round(l,9)))
|
p02572
|
s496148800
|
Accepted
|
n = int(input())
a = list(map(int,input().split()))
sum_a = sum(a)
ans = 0
for i in a:
sum_a -= i
ans += i * sum_a
ans %= 10**9 + 7
print(ans)
|
p04030
|
s806321200
|
Accepted
|
ans=''
s=input()
for i in s:
if i=='B':
ans=ans[:-1]
else :
ans+=i
print(ans)
|
p02820
|
s935280496
|
Accepted
|
N, K = list(map(int,input().split()))
r, s, p = list(map(int,input().split()))
T = input()
ans = 0
def sc(st):
if st == "p": return s
elif st == "r": return p
return r
for i in range(K):
pre = T[i]
cnt = i
ans += sc(T[i])
while(1):
cnt += K
if cnt >= N: break
if T[cnt] == pre: pre = "#"
else:
ans += sc(T[cnt])
pre = T[cnt]
print(ans)
|
p02726
|
s822127729
|
Wrong Answer
|
n ,x, y = map(int, input().split())
sub_degree = [0]*n
for i in range(1,n):
for j in range(i+1, n+1):
a = min(abs(j-i), abs(x-i)+1+abs(j-y), abs(y-i)+1+abs(j-x))+1
sub_degree[a]+=1
for i in range(n-1):
print(sub_degree[i])
|
p02719
|
s155841535
|
Accepted
|
l = list(map(int,input().split()))
s = l[0]%l[1]
if abs(s-l[1])<s:
print(abs(s-l[1]))
else:
print(s)
|
p02959
|
s584056975
|
Accepted
|
n = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
remain = A[0]
power = 0
ans = 0
for i in range(n):
if remain < B[i]:
power = B[i] - remain
ans += remain
if A[i + 1] > power:
ans += power
remain = A[i + 1] - power
else:
ans += A[i + 1]
remain = 0
else:
power = 0
ans += B[i]
remain = A[i + 1]
print(ans)
|
p02641
|
s378867558
|
Accepted
|
x, n = map(int, input().split())
s = list(map(int, input().split()))
for i in range(n//2 +2):
if x-i not in s:
print(x-i)
exit(0)
if x+i not in s:
print(x+i)
exit(0)
|
p04012
|
s199287093
|
Accepted
|
import sys
sys.setrecursionlimit(4100000)
import math
import itertools
INF = float('inf')
from heapq import heapify, heappop, heappush
import collections
import bisect
def main():
W = input()
c = collections.Counter(W)
for key in c.keys():
if c[key] % 2 != 0:
print('No')
return
print('Yes')
if __name__ == '__main__':
main()
|
p02771
|
s467023460
|
Wrong Answer
|
num = [x for x in input()]
ans = 0
if num[0] == num[1]:
ans = ans + 1
if num[0] == num[2]:
ans = ans + 1
if num[1] == num[2]:
ans = ans + 1
if ans == 1:
print('Yes')
else:
print('No')
|
p02645
|
s125516263
|
Accepted
|
S = input()
print(S[:3])
|
p02547
|
s716098100
|
Accepted
|
n = int(input())
cnt = 0
for i in range(n):
d1,d2 = map(int,input().split())
if d1 == d2:
cnt += 1
if cnt == 3:
print("Yes")
exit()
else:
cnt = 0
else:
print("No")
|
p02627
|
s148352637
|
Wrong Answer
|
a=input()
import string
list1=list(string.ascii_lowercase)
if a in list1 == 'true':
print('a')
else:
print('A')
|
p03219
|
s594613501
|
Wrong Answer
|
X, Y = map(int, input().split())
print(X+Y/2)
|
p03910
|
s972671095
|
Wrong Answer
|
n = int(input())
# 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, ...
# 1, 2, 2, 3, 3, 3, 4, 4, 4, 4, ...
# 開始位置を用意
A = [0] * (n + 1)
A[1] = 1
for i in range(1, n):
A[i + 1] = A[i] + i
from bisect import bisect_left
idx = bisect_left(A, n)
for i in range(1, idx):
if i == idx - 1 - (n - A[idx - 1] + 1): continue
print(i)
|
p03545
|
s602601560
|
Wrong Answer
|
s=input()
for bit in range(1<<3):
ans=int(s[0])
f=s[0]
for i in range(3):
if bit & (1<<i):
ans+=int(s[i+1])
f+="+s[i+1]"
else:
ans-=int(s[i+1])
f+="-s[i+1]"
if ans==7:
print(f+"=7")
exit()
|
p03385
|
s819978733
|
Wrong Answer
|
S = list(input())
if list(set(S)) == ["A","B","C"]:
print("Yes")
else:
print("No")
|
p02658
|
s507186368
|
Accepted
|
import sys
n = int(input())
a = list(map(int, input().split()))
if 0 in a:
print(0)
sys.exit()
hg = 10 ** 18
ans = 1
for i in a:
ans *= i
if ans > hg:
print(-1)
sys.exit()
print(ans)
|
p02922
|
s248814929
|
Wrong Answer
|
A,B = map(int,input().split())
print(B//A if B%A==0 else (B//A)+1)
|
p03760
|
s670582140
|
Wrong Answer
|
O = input()
E = input()
P = ''
for i in range(min(len(O),len(E))) :
P = P + O[i]
P = P + E[i]
print(P)
|
p03852
|
s775716540
|
Accepted
|
vowel = ("a", "i", "u", "e", "o")
input_str = input()
if input_str in vowel:
print("vowel")
else:
print("consonant")
|
p02608
|
s605166236
|
Accepted
|
N = int(input())
chk = [0] * (10 ** 4 + 2)
for i in range(1, 100):
for j in range(1, 100):
for k in range(1, 100):
a = i**2 + j**2 + k**2 + i*j + j*k + i*k
if a > 10001:
break
chk[a] += 1
for i in range(N):
print(chk[i+1])
|
p02791
|
s751786439
|
Accepted
|
import sys
input = sys.stdin.readline
n=int(input())
L=list(map(int,input().split()))
MIN = 1<<30
ans = 0
for i in L:
MIN = min(MIN,i)
if i<=MIN:
ans+=1
print(ans)
|
p04031
|
s945746274
|
Accepted
|
N=int(input())
s=list(map(int,input().split()))
s_max=max(s)
s_min=min(s)
A=[]
for i in range(s_min,s_max+1):
b=0
for j in s:
b+=(j-i)**2
A.append(b)
print(min(A))
|
p02572
|
s884321191
|
Accepted
|
n = int(input())
a = list(map(int, input().split()))
MOD = 10 ** 9 + 7
summ = 0
ans = 0
for i in range(1, n):
summ += a[-i]
ans += a[-(i + 1)] * summ
ans %= MOD
print(ans % MOD)
|
p03612
|
s489983720
|
Wrong Answer
|
N=int(input())
*P,=map(int, input().split())
ans=0
for i in range(N-1):
if P[i]==i+1:
P[i],P[i+1]=P[i+1],P[i]
ans+=1
print(ans)
|
p03385
|
s525341350
|
Wrong Answer
|
s = list(input())
if set(s) == 3:
print("Yes")
else:
print("No")
|
p02699
|
s227708345
|
Wrong Answer
|
s,w = map(int,input().split())
print("safe") if s>=w else print("unsafe")
|
p03815
|
s963669288
|
Wrong Answer
|
import math
x = int(input())
if x == 6:
x -= 1
print(math.ceil(x/5.5))
|
p03814
|
s523043221
|
Accepted
|
s = input()
for i in range(len(s)):
if s[i]=='A':
left = i
break
for i in range(len(s)):
if s[-i-1]=='Z':
right = len(s)-i
break
print(right-left)
|
p03457
|
s512755079
|
Accepted
|
N = int(input())
t = [0] * (N+1)
x = [0] * (N+1)
y = [0] * (N+1)
for i in range(N):
t[i+1], x[i+1], y[i+1] = map(int, input().split())
f = True
for i in range(N):
dt = t[i+1] - t[i]
dist = abs(x[i+1]-x[i]) + abs(y[i+1]-y[i])
if dt < dist:
f = False
if dist%2 != dt%2:
f = False
print('Yes' if f else 'No')
|
p02796
|
s303858004
|
Accepted
|
n=int(input())
l=[list(map(int,input().split())) for i in range(n)]
l.sort()
ans=1
c=l[0][0]+l[0][1]
for i in range(1,n):
if c>=l[i][0]+l[i][1]:
c=l[i][0]+l[i][1]
elif c<=l[i][0]-l[i][1]:
c=l[i][0]+l[i][1]
ans+=1
print(ans)
|
p02747
|
s654119159
|
Wrong Answer
|
S = input()
flg = False
if len(S) < 2:
print('No')
else:
for i in range(len(S)-1):
if S[i:i+2] == 'hi':
print('Yes')
flg = True
break
if not flg:
print('No')
|
p02744
|
s533588285
|
Wrong Answer
|
import sys
import math
def permutations_count(n, r):
ret = 0
for i in range(r):
ret += (n-i)
return ret
N = int(input())
#print(N)
if N == 1:
print(1)
sys.exit()
elif N == 2:
print(2)
sys.exit()
r = N - 2
ret = permutations_count(N, r) + 2
print(ret)
|
p02897
|
s284666301
|
Wrong Answer
|
n = int(input())
if n//2 == 0:
print((n//2)/n)
else:
print((n//2+1)/n)
|
p02813
|
s160223476
|
Wrong Answer
|
from itertools import permutations
import math
N = int(input())
P = list(map(str, input().split()))
Q = list(map(str, input().split()))
np = int(''.join(P))
nq = int(''.join(Q))
lst = []
lstn = ['1', '2', '3', '4', '5', '6', '7', '8']
for i in permutations(lstn[:N]):
lst.append(int(''.join(i)))
lst.sort()
for i in range(1, math.factorial(N)):
if lst[i] == np: np = i
if lst[i] == nq: nq = i
print(abs(np - nq))
|
p03331
|
s141209728
|
Accepted
|
N = int(input())
min = 100000000000000
for i in range(1, N):
A = str(i)
B = str(N - i)
ref = 0
for a in A:
ref += int(a)
for b in B:
ref += int(b)
if ref < min:
min = ref
print(min)
|
p02948
|
s997985105
|
Accepted
|
N, M = map(int, input().split())
AB = [[] for _ in range(M + 10)]
ans = 0
for _ in range(N):
a, b = map(int, input().split())
if a > M:
continue
AB[a].append(b)
import heapq
reward = []
heapq.heapify(reward)
for i in range(1, M + 1):
for item in AB[i]:
heapq.heappush(reward, -item)
if reward:
ans -= heapq.heappop(reward)
print(ans)
|
p04044
|
s378029409
|
Accepted
|
import sys
input = sys.stdin.readline
n, l = map(int, input().split())
s = [input().strip() for _ in range(n)]
s.sort()
print(''.join(s))
|
p02756
|
s568944472
|
Accepted
|
from collections import deque
S = input()
Q = int(input())
ANS = deque(S)
rev = 0
for _ in range(Q):
query = input().split(' ')
if len(query) == 1:
rev = rev ^ 1
else:
f, c = int(query[1]), query[2]
if (f - 1) ^ rev:
ANS.append(c)
else:
ANS.appendleft(c)
if rev:
ANS.reverse()
print(''.join(ANS))
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.