problem_id
stringclasses 428
values | submission_id
stringlengths 10
10
| status
stringclasses 2
values | code
stringlengths 5
816
|
|---|---|---|---|
p02640
|
s059261608
|
Wrong Answer
|
x, y = list(map(int, input().split()))
if y % 2 != 0:
print('No')
exit(0)
a = x * 4
if a < y:
print('No')
exit(0)
if x == y:
print('No')
exit(0)
print('Yes')
|
p02756
|
s001725146
|
Wrong Answer
|
S = list(input())
Q = int(input())
x = 1
for i in range(Q):
a, *b = input().split()
if a == "1":
x *= -1
elif a == "2":
c, d = b
if c == "2":
x *= -1
if x == 1:
S.insert(0, d)
elif x == -1:
S.append(d)
print(*S, sep="")
|
p03076
|
s422549409
|
Accepted
|
import sys
input = sys.stdin.readline
def main():
ans = 0
ex = []
for _ in range(5):
t = int(input())
e = 10 - t%10
if e != 10:
ex.append(e)
ans += t
ex.sort()
ans += sum(ex[:-1])
print(ans)
if __name__ == '__main__':
main()
|
p03293
|
s422649696
|
Accepted
|
s=input()
t=input()
ans='No'
l=len(s)
if s==t:
ans='Yes'
for _ in range(l):
s=s[l-1]+s[:l-1]
if s==t:
ans='Yes'
break
print(ans)
|
p03745
|
s959535603
|
Accepted
|
n = int(input())
ans = list(map(int,input().split()))
key = ans[0]
up_key = True
down_key = True
count = 0
for i in range(n):
if key < ans[i]:
down_key = False
if key > ans[i]:
up_key = False
if up_key == False and down_key == False:
count += 1
up_key = True
down_key = True
key = ans[i]
print(count+1)
|
p02713
|
s774494054
|
Wrong Answer
|
import math
k = int(input())
ans = 0
for i in range(1,k+1):
ans += i
for j in range(i+1,k+1):
for m in range(j+1,k+1):
ans += 3*math.gcd(math.gcd(i,j),m)
print(ans)
|
p03545
|
s906503846
|
Accepted
|
import numpy as np
S = input()
ans = int(S[0])
ope = []
while True:
for i in S[1:]:
if np.random.randint(2) == 0:
ans += int(i)
ope.append("+")
else:
ans -= int(i)
ope.append("-")
if ans == 7:
print(S[0]+ope[0]+S[1]+ope[1]+S[2]+ope[2]+S[3]+"=7")
exit()
else:
ans = int(S[0])
ope = []
|
p02792
|
s200870046
|
Wrong Answer
|
N=int(input())
T=str(N)
K=len(T)-1
A=N//10
if N<10:
print(N)
else:
print(A*A+8+N%10)
|
p02661
|
s481872201
|
Accepted
|
N = int(input())
A = []
B = []
for _ in range(N):
a,b = map(int,input().split())
A.append(a)
B.append(b)
A.sort()
B.sort(reverse=True)
#print(A,B)
if N % 2 == 1:
x = (N+1) // 2
ans = B[x-1] - A[x-1] + 1
else:
x = N // 2
ans = (B[x-1] + B[x]) - (A[x] + A[x-1]) + 1
print(ans)
|
p03086
|
s373452705
|
Wrong Answer
|
S=input()
flag =0
ans =0
for i in range(len(S)):
flag =0
for j in range(len(S)-i):
if S[i+j] == 'A' or S[i+j] == 'G' or S[i+j] == 'T' or S[i+j] == 'C':
flag +=1
else:
ans = max(ans,flag)
flag =0
break
print(ans)
|
p02789
|
s096667447
|
Accepted
|
if __name__=="__main__":
n, m = map(int, input().split())
if n==m:
print("Yes")
else:
print("No")
|
p03387
|
s536976681
|
Wrong Answer
|
a,b,c=sorted(list(map(int,input().split())))
p,q=(c-a)//2,(c-b)//2
c=p+q
a,b=a+2*p,b+2*q
if a==c and b==c:
print(c)
elif a==c or b==c:
print(c+2)
else:
print(c+1)
|
p03359
|
s008197206
|
Wrong Answer
|
a, b = map(int, input().split())
print(a if a>=b else a-1)
|
p03485
|
s652637464
|
Wrong Answer
|
a,b = map(int,input().split())
print(round((a + b) / 2))
|
p02811
|
s694857651
|
Accepted
|
k,x=map(int, input().split())
print("Yes" if 500*k >= x else "No")
|
p03095
|
s944916833
|
Accepted
|
from collections import Counter
mod = 10**9 + 7
n = int(input())
s = [i for i in input()]
cnt = Counter(s)
l = len(cnt)
val = list(cnt.values())
val = [i + 1 for i in val if i != 1]
ans = 2**(l-len(val)) % mod
for vi in val: ans *= vi % mod
print((ans - 1) % mod)
|
p02823
|
s327553212
|
Accepted
|
N,A,B=map(int,input().split())
if (B-A)%2==0:
print((B-A)//2)
else:
if A-1<=N-B:
print((A+B-1)//2)
else:
print((1-A-B)//2+N)
|
p03061
|
s355301774
|
Wrong Answer
|
from fractions import gcd
n = int(input())
*A, = map(int, input().split())
B = A[::-1]
L, R = [0]*(n+1), [0]*(n+1)
for i in range(n):
L[i+1] = gcd(L[i], A[i])
R[i+1] = gcd(R[i], B[i])
R = [0] + R[1:][::-1]
print(max(gcd(L[i-1], R[i+1]) for i in range(1, n)))
|
p03017
|
s437811507
|
Wrong Answer
|
n, a, b, c, d = map(int, input().split())
s = input()
if c < d:
if "##" in s[a:d+1]:
print("No")
else:
print("Yes")
else:
if "..." in s[b:d+1] and "##" not in s[a:d+1]:
print("Yes")
else:
print("No")
|
p03778
|
s977221060
|
Accepted
|
w,a,b = map(int,input().split())
if a+w < b:
print(b-(a+w))
elif b+w < a:
print(a-(b+w))
else:
print(0)
|
p02911
|
s918446718
|
Accepted
|
import sys
input = sys.stdin.readline
def main():
ans = ''
N, K, Q = map(int, input().split())
a = [K-Q]*N
for _ in range(Q):
a[int(input())-1] += 1
for i in a:
if i > 0:
ans += 'Yes'
else:
ans += 'No'
ans += '\n'
print(ans)
if __name__ == '__main__':
main()
|
p02713
|
s556285785
|
Accepted
|
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
k = int(input())
sum_of_gcd = 0
dict_of_gcd = {}
for a in range(k):
for b in range(k):
for c in range(k):
if a == b == c:
sum_of_gcd += a + 1
else:
sum_of_gcd += gcd((a + 1), (b + 1), (c +1))
print(sum_of_gcd)
|
p03617
|
s779954392
|
Accepted
|
q, h, s, d = map(int, input().split())
n = int(input())
s_ = min(q*4, h*2, s)
d_ = min(q*8, h*4, s*2, d)
print(min(s_*n, d_*(n//2)+(n%2)*s_))
|
p02862
|
s965152074
|
Accepted
|
def bigcmb(N, R, MOD): # nCr(mod p) #n>=10**7,r<=10**6 #前処理不要
if (R < 0) or (N < R):
return 0
R = min(R, N - R)
fact, inv = 1, 1
for i in range(1, R + 1):
fact = (fact * (N - i + 1)) % MOD
inv = (inv * i) % MOD
return fact * pow(inv, MOD - 2, MOD) % MOD
x, y = map(int, input().split())
mod = 10 ** 9 + 7
if (x + y) % 3 != 0:
print(0)
else:
cnt = (x + y) // 3
print(bigcmb(cnt, x - cnt, mod))
|
p03699
|
s865804904
|
Wrong Answer
|
a = int(input())
list=[]
for i in range(a):
list.append(int(input()))
if not sum(list)%10==0:
print(sum(list))
else:
for i in sorted(list):
if not i%10==0:
print(sum(list)-i)
break
print(0)
|
p03696
|
s326584652
|
Wrong Answer
|
n = int(input())
s = list(input())
d = []
x = 0
for i in range(len(s)):
if s[i] == '(':
x += 1
else:
x -= 1
d.append(x)
ans = []
x = min(d)
for i in range(max(0,(-1*x))):
ans.append('(')
for i in s:
ans.append(i)
for i in range(max(d[len(d)-1]-x,0)):
ans.append(')')
a = ''.join(ans)
print(a)
|
p03852
|
s680645448
|
Wrong Answer
|
a = input()
if ((a == "a") or (a == "b") or (a == "c") or (a == "d") or (a == "e")):
print("vowel")
else:
print("consonant")
|
p03211
|
s553335188
|
Accepted
|
import sys
inint = lambda: int(sys.stdin.readline())
inintm = lambda: map(int, sys.stdin.readline().split())
inintl = lambda: list(inintm())
instrm = lambda: map(str, sys.stdin.readline().split())
instrl = lambda: list(instrm())
s = input()
base = 753
ans = 1000
for i in range(len(s)-2):
if abs(base - int(s[i:i+3])) < ans:
ans = abs(base - int(s[i:i+3]))
print(ans)
|
p03696
|
s541147317
|
Accepted
|
import sys
input = sys.stdin.readline
def main():
N = int(input())
S = input().rstrip()
L = 0
R = 0
for s in S:
if s == "(":
R += 1
else:
if R > 0:
R -= 1
else:
L += 1
ans = "".join(["(" * L, S, ")" * R])
print(ans)
if __name__ == "__main__":
main()
|
p02765
|
s670388638
|
Accepted
|
N, R = tuple(map(int, input().split()))
if N >= 10:
print(R)
else:
print(R+(100 * (10 - N)))
|
p03161
|
s440180384
|
Accepted
|
N, K = map(int, input().split())
h = list(map(int, input().split()))
h.insert(0, float("inf"))
dp = [float("inf")] * (N + 1)
dp[1] = 0
for i in range(2, N + 1):
for k in range(1, K + 1):
if i - k >= 0:
dp[i] = min(dp[i], dp[i - k] + abs(h[i - k] - h[i]))
else:
break
print(dp[N])
|
p03011
|
s692360137
|
Accepted
|
lst = list(map(int, input().split()))
print(sum(lst) - max(lst))
|
p02987
|
s890432699
|
Accepted
|
s = list(input())
s.sort()
if s[0] == s[1] and s[1] != s[2] and s[2] == s[3]:
print("Yes")
else:
print("No")
|
p03681
|
s466749698
|
Accepted
|
def fact(a, mod):
ret = 1
for i in range(a):
ret *= (i + 1)
ret %= mod
return ret
def main():
MOD = 10**9 + 7
N, M = list(map(int, input().split(' ')))
if abs(N - M) > 1:
print(0)
elif abs(N - M) == 0:
print((2 * fact(N, MOD) * fact(M, MOD)) % MOD)
else:
print((fact(N, MOD) * fact(M, MOD)) % MOD)
if __name__ == '__main__':
main()
|
p02623
|
s538040345
|
Wrong Answer
|
# ABC C-Tsundoku
n,m,k = map(int,input().split())
an = list(map(int,input().split()))
bn = list(map(int,input().split()))
suma = [0]
sumb = [0]
a = 0
b = 0
for i in an:
a += i
suma.append(a)
for i in bn:
b += i
sumb.append(b)
res = [0]
for j in range(n+1):
if k-suma[j] < 0:
break
for l in range(m+1):
if k-suma[j]-sumb[l] < 0:
res.append(j+l-1)
break
print(max(res))
|
p03852
|
s437772855
|
Wrong Answer
|
import sys
read = sys.stdin.read
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 8)
INF = float('inf')
MOD = 10 ** 9 + 7
def main():
C = input()
if C in ['a', 'i', 'u', 'e', 'o']:
print('vouel')
else:
print('consonant')
if __name__ == '__main__':
main()
|
p02777
|
s805405467
|
Wrong Answer
|
# 入力された文字列をすべてxで置き換える
# 文字列の標準入力
s = input()
sLength = len(s)
hoge = []
for i in range(sLength):
c = s[i]
c = "x"
hoge.append(c)
print(''.join(map(str,hoge)))
|
p03319
|
s613922815
|
Wrong Answer
|
def main():
N, K = map(int, input().split(' '))
An = list(map(int, input().split(' ')))
# N, K = 4, 3
# An = [2, 3, 1, 4]
# N, K = 8, 3
# An = [7, 3, 1, 8, 4, 6, 2, 5]
num = len(An)
print(num // (K-1))
# for i in range(0, len(An), K-1):
# print(i)
main()
|
p03086
|
s674640423
|
Accepted
|
S = input()
a = 'ACGT'
memo = []
cnt = 0
for s in S:
if s in a:
cnt += 1
else:
cnt = 0
memo.append(cnt)
print(max(memo))
|
p02693
|
s840441750
|
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)
|
p03069
|
s453315341
|
Accepted
|
N=int(input())
S=list(map(lambda x:1*(x=="#"),input()))
L=M=S.count(0)
for i in range(N):
if S[i]:
M+=1
else:
M-=1
L=min(L,M)
print(L)
|
p02548
|
s210152960
|
Accepted
|
n = int(input())
ans = 0
for i in range(1,n):
ans += n//i
if n%i == 0:
ans -= 1
print(ans)
|
p02602
|
s474700178
|
Wrong Answer
|
import numpy as np
N, K = map(int, input().split())
risu = list(map(int, input().split()))
res = np.cumprod(risu[0: K])[K - 1]
for i in range(K + 1, N +1):
if np.cumprod(risu[i - K: i])[K - 1] > res:
print('Yes')
else:
print('No')
res = np.cumprod(risu[i - K: i])[K - 1]
|
p02719
|
s672471241
|
Wrong Answer
|
n, k = list(map(int, input().split()))
if k == 1:
print(0)
else:
print( abs( (n%k) -1 ) )
|
p02577
|
s689666306
|
Wrong Answer
|
def sum_nine(a: int):
a = sum(map(int, str(a)))
if a % 9 == 0:
print("Yes")
else:
print(False)
|
p04030
|
s436803045
|
Accepted
|
n = input()
res = []
for char in n:
if char == '0':
res.append(char)
elif char == '1':
res.append(char)
elif char == 'B':
if len(res) > 0:
res.pop()
print(''.join(res))
|
p02601
|
s722522110
|
Accepted
|
r,g,b = map(int, input().split())
k = int(input())
a = 0
while r>=g:
g *= 2
a += 1
while g>=b:
b *= 2
a += 1
if a<=k:
print("Yes")
else:
print("No")
# print(r,g,b,a)
|
p03449
|
s692029938
|
Accepted
|
n = int(input())
a = [list(map(int,input().split())) for _ in range(2)]
print(max(sum(a[0][:i+1] + a[1][i:]) for i in range(n)))
|
p03329
|
s710780594
|
Wrong Answer
|
N=int(input())
inf=100000
dp=[inf for _ in range(N+1)]
dp[0]=0
dp[1]=1
for n in range(N+1):
num=100000
i=0
j=0
while n>9**i:
i+=1
while n>6**j:
j+=1
for k in range(i):
num=min(num,dp[n-9**k]+1)
for k in range(j):
num=min(num,dp[n-6**k]+1)
num=min(num,dp[n-1]+1)
dp[n]=min(dp[n],num)
print(dp[N])
|
p02923
|
s317564840
|
Accepted
|
N = int(input())
H = list(map(int,input().split()))
cnt = 0
ans = 0
for i in range(N-1):
if H[i] >= H[i+1]:
cnt += 1
ans = max(ans, cnt)
if H[i] < H[i+1]:
cnt = 0
print(ans)
|
p03160
|
s533040439
|
Wrong Answer
|
n = int(input())
h_L = list(map(int,input().split()))
#dp = [float("inf")] * (10**4 + 1)
dp = [10**8] * n
dp[0] = 0
dp[1] = abs(h_L[0]-h_L[1])
for i in range(2,n):
#dp[i]
# 1
tmp1 = dp[i-1] + abs(h_L[i-1] - h_L[i])
dp[i] = min(dp[i],tmp1)
# 2
tmp2 = dp[i-2] + abs(h_L[i-2] - h_L[i])
dp[i] = min(dp[i],tmp2)
#print(dp)
print(dp[n-1])
|
p02744
|
s445609183
|
Accepted
|
from string import ascii_lowercase
n = int(input())
def f(l):
if len(l)==n:
print("".join([ascii_lowercase[i] for i in l]))
return
for i in range(max(l)+2):
f(l+[i])
f([0])
|
p03681
|
s123871483
|
Accepted
|
import math
MOD = 1000000007
m,n=map(int,input().split())
f=abs(m-n)
if f == 0:
ans=2*math.factorial(m)*math.factorial(n)%MOD
print(ans)
exit()
elif f == 1:
ans=math.factorial(m)*math.factorial(n)%MOD
print(ans)
exit()
else:
print(0)
exit()
|
p03385
|
s677807116
|
Wrong Answer
|
s=input()
if s.join(sorted(s))=='abc':
print('Yes')
else:
print('No')
|
p02664
|
s699503566
|
Wrong Answer
|
t = input()
if t[-1]=='P' or t[-1]=='D': ans = t[-1]
else:ans = 'D'
for i in t[len(t)-2::-1]:
if i=='P' or i=='D':
ans += i
else:
if ans[-1]=='P':
ans += 'D'
else:
ans += 'P'
print(ans[::-1])
|
p03035
|
s405477633
|
Wrong Answer
|
A, B = map(int, input().split())
if A < 13:
if A >= 6:
print(B/2)
else:
print(0)
else:
print(B)
|
p02947
|
s920957073
|
Wrong Answer
|
n = int(input())
s = [input() for _ in range(n)]
import collections
li = []
li2 = []
for i in range(n):
cou = collections.Counter(list(s[i]))
if cou in li:
li2 += [str(cou)[8:-1]]
li += [cou]
li3 = collections.Counter(li2)
li4 = list(li3.values())
ans = 0
for i in li4:
ans += (i+1)*i//2
print(ans)
|
p03385
|
s981681451
|
Accepted
|
s = input()
if s.count('a') and s.count('b') and s.count('c'):
print('Yes')
else:
print('No')
|
p02847
|
s668509924
|
Wrong Answer
|
l=["MON","TUE","WED","THU","FRI","SAT","SUN"]
S=input()
print(6-l.index(S))
|
p02664
|
s231318133
|
Wrong Answer
|
import re
T=input()
T=T.replace("???", "DDD")
T=T.replace("??", "DD")
T=T.replace('D?D', 'DPD')
T=T.replace('D?P', 'DDP')
T=T.replace('P?D', 'PDD')
T=T.replace('P?P', 'PDP')
T=T.replace('?P', 'DP')
T=T.replace('?D', 'PD')
T=T.replace('P?', 'PD')
T=T.replace('D?', 'DD')
T=T.replace('?', 'D')
|
p02642
|
s433732737
|
Wrong Answer
|
n = int(input())
p = list(map(int,input().split()))
p = [ x for x in set(p) if p.count(x) == 1]
p.sort()
tp = [ 1 for _ in range(len(p))]
for i in range(len(p)):
if tp[i]:
for j in range(i+1,len(p)):
if p[j]:
if p[j] % p[i] == 0:
tp[j] = 0
print(sum(tp))
|
p02642
|
s908929882
|
Accepted
|
from collections import Counter
n = int(input())
A = sorted(map(int, input().split()))
c = Counter(A)
yes_or_no = [True for i in range(A[n-1]+1)]
for a in A:
t = a*2
while t <= A[n-1]:
yes_or_no[t] = False
t += a
ans = 0
for a in A:
if c[a] == 1 and yes_or_no[a] == True:
ans += 1
print(ans)
|
p02971
|
s693631263
|
Accepted
|
N=int(input())
A=[]
for _ in range(N):
A.append(int(input()))
B=sorted(A,reverse=True)
for i in range(N):
if A[i]!=B[0]:
print(B[0])
else:
print(B[1])
|
p02641
|
s043084255
|
Accepted
|
X,N=map(int,input().split())
if N==0:
input()
print(X)
exit(0)
xn=list(map(int,input().split()))
a=[(abs(x-X),x) for x in xn]
for d in range(0, 100):
a1=d+X
a2=-d+X
if a2 not in xn:
print(a2)
exit(0)
elif a1 not in xn:
print(a1)
exit(0)
|
p03705
|
s785575197
|
Accepted
|
n, a, b = map(int, input().split())
if n==1:
if a==b:
ans = 1
else:
ans = 0
else:
if a>b:
ans = 0
else:
ans = ((n-2)*b-(n-2)*a)+1
print(ans)
|
p02596
|
s149126634
|
Wrong Answer
|
k = int(input())
if(k%2==0):
print("-1")
else:
i = 1
while True:
m = 7
if(m%k==0):
print(i)
break
if(i>10000000):
print("-1")
break
m = m*10 + 7
i += 1
|
p02766
|
s129889859
|
Accepted
|
n,k = map(int,input().split())
cnt = 0
while True:
if n < k and n%k == 0:
break
cnt += 1
n //= k
print(cnt)
|
p03162
|
s908647377
|
Wrong Answer
|
import numpy as np
N = int(input())
h_list = []
for i in range(N):
h_list.append([i for i in map(int,input().split())])
print(h_list)
dp = np.zeros((N,3))
dp[0] = h_list[0]
for i in range(1,N):
dp[i,0] = max(dp[i-1,1], dp[i-1,2]) + h_list[i][0]
dp[i,1] = max(dp[i-1,0], dp[i-1,2]) + h_list[i][1]
dp[i,2] = max(dp[i-1,0], dp[i-1,1]) + h_list[i][2]
print(max(dp[-1]))
|
p02583
|
s064750323
|
Accepted
|
import itertools
N = int(input())
L = list(map(int,input().split()))
count=0
p_list=list(itertools.combinations(range(N),3))
for i in p_list:
if((L[i[0]]!=L[i[1]]) and (L[i[2]]!=L[i[1]]) and (L[i[0]]!=L[i[2]]) ):
if((L[i[0]]+L[i[1]]> L[i[2]]) and (L[i[1]]+L[i[2]]> L[i[0]]) and (L[i[0]]+L[i[2]]> L[i[1]])):
count+=1
print(count)
|
p02578
|
s489866954
|
Wrong Answer
|
def Step():
num = int(input())
data = list(map(int,input().split()))
print(max(data) - min(data))
if __name__ == '__main__':
Step()
|
p02629
|
s248831268
|
Wrong Answer
|
n = int(input())
b = 26
ans = []
for i in range(1,99):
if n <= b:
n -= 1
for j in range(i-1):
ans.append(chr(97 + n % b))
n //= b
break
else:
n -= b ** i
for k in range(len(ans)):
print(ans[-(k+1)],end="")
|
p02972
|
s835802397
|
Accepted
|
idx = lambda x: x-1
n = int(input())
a = list(map(int, input().split()))
b = [0]*n
for i in reversed(range(1, n+1)):
cnt = 0
for j in range(i*2, n+1, i):
cnt += b[idx(j)]
if cnt % 2 == a[idx(i)]: continue
b[idx(i)] += 1
s = sum(b)
if s == 0:
print(0)
exit()
print(s)
for i in range(1, n+1):
if b[idx(i)]: print(i)
|
p03162
|
s267494997
|
Wrong Answer
|
a=int(input())
hahaha=0
for i in range(a):
r=str(input()).split()
m=[int(u) for u in r]
hahaha+=max(m)
print(hahaha)
|
p03328
|
s346473845
|
Accepted
|
a, b = map(int, input().split())
c = b - a
d = 0
for i in range(c, 0, -1):
d += i
print(d - b)
|
p03069
|
s864687481
|
Accepted
|
n=int(input())
s=input()
ans=10**9
w=[0]*n
b=[0]*n
cw,cb=0,0
for i in range(n):
if s[i]==".":
cw+=1
else:
cb+=1
w[i]=cw
b[i]=cb
for i in range(n):
ans=min(ans,b[i]+w[-1]-w[i])
ans=min(ans,b[-1],w[-1])
print(ans)
|
p03145
|
s624396347
|
Accepted
|
ab, bc, ca = map(int, input().split())
print((ab * bc) // 2)
|
p02755
|
s174857151
|
Accepted
|
A, B = map(int, input().split())
x_min_tmp = A * 12.5
if x_min_tmp.is_integer:
x_min = int(x_min_tmp)
else:
x_min = int(x_min_tmp) + 1
x_max_tmp = (A + 1) * 12.5
x_max = int(x_max_tmp) + 1
ans = -1
for n in range(x_min, x_max + 1):
if int(n * 0.08) == A and int(n * 0.1) == B:
ans = n
break
print(ans)
|
p03556
|
s080834044
|
Accepted
|
import math
n = int(input())
print(math.floor(math.sqrt(n)) ** 2)
|
p02767
|
s551679482
|
Wrong Answer
|
n = int(input())
x = list(map(int, input().split()))
hel = []
cnt = 0
for i in range(max(x)):
for j in range(n):
cnt += abs(x[j] - i) ** 2
hel.append(cnt)
cnt = 0
print(min(hel))
|
p03693
|
s658459092
|
Wrong Answer
|
r, g, b = map(int, input().split())
if (r + g + b) % 4 == 0:
print("YES")
else:
print("NO")
|
p03475
|
s972089311
|
Accepted
|
n=int(input())
C=[0]*(n-1)
S=[0]*(n-1)
F=[0]*(n-1)
for i in range(n-1):
C[i],S[i],F[i]=map(int,input().split())
for i in range(n-1):
ans=0
for j in range(i,n-1):
ans=max((ans+F[j]-1)//F[j]*F[j],S[j])+C[j]
print(ans)
print(0)
|
p02988
|
s604016952
|
Wrong Answer
|
N=int(input())
l=[int(x) for x in input().rstrip().split()]
now=[]
n=[]
for i in range(1,N-1):
now.append(l[i-1])
now.append(l[i])
now.append(l[i+1])
now.sort()
n.append(now[1])
now=[]
print(len(set(n)))
|
p03986
|
s222331193
|
Accepted
|
X=list(input())
counter_s = 0
counter_t = 0
for i in range(len(X)):
if counter_s == 0 and X[i] == 'T':
counter_t += 1
elif 0 < counter_s and X[i] == 'T':
counter_s -= 1
elif X[i] == 'S':
counter_s += 1
print(counter_s+counter_t)
|
p02783
|
s360553088
|
Wrong Answer
|
H,A =map(int,input().split())
print((H//A)+1)
|
p02818
|
s518594479
|
Wrong Answer
|
a, b, k = map(int, input().split());
a = max(0, a - k);
if a == 0:
b = max(0, b - k + a);
print(a,b);
|
p03862
|
s038177665
|
Accepted
|
N,x = map(int,input().split())
a = list(map(int,input().split()))
count = 0
if a[0] > x:
count += a[0] - x
a[0] = x
for i in range(1,N):
if a[i-1]+a[i] > x:
count += (a[i-1]+a[i]) - x
a[i] = x - a[i-1]
print(count)
|
p02959
|
s081668613
|
Wrong Answer
|
n = int(input())
a = [int(i) for i in input().split()]
b = [int(i) for i in input().split()]
cnt = 0
for i in range(n):
cnt += min(a[i], b[i])
b[i] -= min(a[i], b[i])
cnt += min(a[i + 1], b[i])
a[i] -= min(a[i + 1], b[i])
print(cnt)
|
p02801
|
s288725813
|
Wrong Answer
|
alphabet = 'abcdefghijklmnopqrstuvwxyz'
print(alphabet[alphabet.find('a') + 1])
|
p04045
|
s303590348
|
Wrong Answer
|
n,k=list(map(int,input().split()))
d = list(map(int,input().split()))
i =1
while True:
if 10**(i-1)>n:
break
#i桁目の数字を取得
tmp = (n%(10**i))//(10**(i-1))
if tmp not in d:
i+= 1
continue
else:
n+=10**(i-1)
print(n)
|
p03329
|
s150323239
|
Wrong Answer
|
n=int(input())
nl=[9**i for i in range(1,6)]
sl=[6**i for i in range(1,7)]
l = sorted(nl+sl)[::-1]
x=0
for i in l:
while True:
if i <=n:
n=n-i
x+=1
else:
break
print(x+n)
|
p03695
|
s408122830
|
Accepted
|
N = int(input())
A = list(map(int, input().split()))
ans = [0] * 9
for i in range(N):
aa = int(A[i] / 400)
if aa > 8:
aa = 8
ans[aa] += 1
min_a = 0
max_a = 0
for i in range(9):
if i != 8:
if ans[i] != 0:
min_a += 1
max_a += 1
else:
max_a += ans[i]
min_a = max(min_a, 1)
print(min_a, max_a)
|
p02957
|
s098951502
|
Wrong Answer
|
a,b=map(int,input().split())
if a%2==0 and b%2==0:
print((a+b)//2)
else:
print('IMPOSSIBLE')
|
p03438
|
s819805781
|
Accepted
|
N = int(input())
A = list(map(int,input().split()))
B = list(map(int,input().split()))
cnt1 = 0
cnt2 = 0
for i in range(N):
if A[i]>B[i]:
cnt1 += A[i]-B[i]
elif A[i]<B[i]:
cnt2 += (B[i]-A[i])//2
if cnt1<=cnt2:
print("Yes")
else:
print("No")
|
p02717
|
s161441436
|
Wrong Answer
|
X=int()
Y=int()
Z=int()
1<=X,Y,Z<=100
X,Y=Y,X
X,Z=Z,X
|
p03821
|
s733829294
|
Accepted
|
N = int(input())
A = [list(map(int,input().split())) for i in range(N)]
cnt = 0
for i in range(N)[::-1]:
if (A[i][0] + cnt)%A[i][1] != 0:
cnt += A[i][1] - (A[i][0] + cnt)%A[i][1]
print(cnt)
|
p02642
|
s322529614
|
Wrong Answer
|
d=[0]*8**7
for i in[*open(0)][1].split():d[int(i)]+=1
i=r=0
while i<1e6:
i+=1;r+=d[i]==1;j=i
while j<1e6:j+=i;d[j]&=d[i]<1
print(r)
|
p02767
|
s232974915
|
Accepted
|
n = int(input())
x = list(map(int, input().split()))
if max(x)-min(x)==0:
print(0)
else:
k=max(x)-min(x)
box=[0]*k
for i in range(0,k):
aa=0
for j in range(0,n):
aa = aa+(x[j]-min(x)-i)**2
box[i]=aa
print(min(box))
|
p03592
|
s469375073
|
Accepted
|
import sys
N,M,K=map(int,input().split())
for i in range(N+1):
for j in range(M+1):
if i*j+(N-i)*(M-j)==K:
print('Yes')
sys.exit(0)
print('No')
|
p03644
|
s647474710
|
Accepted
|
N = int(input())
ans = 1
for n in range(N):
ans*=2
if ans>N:
print(int(ans/2))
exit()
|
p04019
|
s499489210
|
Accepted
|
s = list(input())
s = list(set(s))
flag = True
if "N" in s and not "S" in s:
flag = False
if "S" in s and not "N" in s:
flag = False
if "E" in s and not "W" in s:
flag = False
if "W" in s and not "E" in s:
flag = False
print("Yes" if flag else "No")
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.