problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p02963 | s852409726 | Accepted | S = int(input())
m = 10**9
x = (m - S % m) % m
y = (S + x) // m
print(0, 0, m, 1, x, y)
|
p02785 | s390503467 | Accepted | h, n = map(int, input().split())
k = list(map(int, input().split()))
k = sorted(k,reverse=True)
k = k[n:]
print(sum(k))
|
p02724 | s766432214 | Wrong Answer | inp = input()
inp = int(float(inp))
aaa =0
bbb =0
nega = 0
big = 0
if 0 <= inp and inp <= 10**9:
if 500 <= inp:
big = (inp // 500)
sma = big % 500
if 5 <= sma:
nega = (sma // 5)
aaa = 1000*big
bbb = 5*nega
print(aaa + bbb)
elif 5 <= inp:
nega = (inp // 5)
bbb = 5*nega
print(bbb)
else:
print(0)
|
p02773 | s447997422 | Accepted | # -*- coding: utf-8 -*-
import collections
def main():
n = int(input())
s = [input() for i in range(n)]
most_counters = collections.Counter(s).most_common()
most_count = most_counters[0][1]
for t in sorted(map(lambda x: x[0], filter(lambda x: x[1] == most_count, most_counters))):
print(t)
if __name__ == '__main__':
main()
|
p02714 | s977202063 | Wrong Answer | N = int(input())
S = list(input())
rc = S.count("R")
gc = S.count("G")
bc = S.count("B")
tc = int(rc*gc*bc)
aa = 0
for i in range(N):
for j in range(1,N//2):
if i+j+j < N:
if S[i] != S[i+j]:
if S[i] != S[i+j+j]:
if S[i+j] != S[i+j+j]:
aa += 1
print(int(tc-aa)) |
p02657 | s493435373 | Accepted | A,B=map(int,input().split())
print(A*B) |
p02584 | s390512495 | Wrong Answer | import math
import sys
x,k,d=map(int,input().split())
num=math.floor(x/d)
if num>k:
print(x-k*d)
sys.exit()
n=x-num*d
remaining=k-num
if remaining%2==0:
if n>0:
print(n)
else:
print(n*-1)
else:
if n>0:
n-=d
if n>0:
print(n)
else:
print(n*-1)
else:
n+=d
if n>0:
print(n)
else:
print(n*-1) |
p02797 | s426234323 | Accepted | N,K,S = map(int,input().split())
A = [str(10**9) for i in range(N)]
if S != 10**9:
for i in range(K):
A[i] = str(S)
else:
for i in range(N-K):
A[i] = str(1)
A = ' '.join(A)
print(A) |
p03042 | s958530356 | Wrong Answer | def main():
s = int(input())
f = s/100
b = s%100
if f > 0 and f <= 12:
if b > 0 and b <= 12:
print("AMBIGUOUS")
else:
print("MMYY")
else:
if b > 0 and b <= 12:
print("YYMM")
else:
print("NA")
main()
|
p02683 | s358221033 | Wrong Answer | import sys
import numpy as np
n, m, x = map(int, input().split())
c = []
for _ in range(n):
c.append(np.array(list(map(int, input().split()))))
def ok(lst):
for tokuten in lst:
if tokuten < 10:
return False
return True
c.sort(key=lambda e: e[0])
total = np.array([0] * (m + 1))
for book in c:
total += book
if ok(total[1:]):
print(total[0])
sys.exit()
print(-1) |
p02775 | s822684104 | Accepted | s = input()
l = len(s)
INF = float('inf')
dp = [[INF]*2 for _ in range(l+1)]
dp[0][0]=0
dp[0][1]=1
for i in range(l):
num = int(s[i])
dp0 = dp[i][0]
dp1 = dp[i][1]
dp[i+1][0] = min(dp0+num, dp1+min(10-num,num+1))
dp[i+1][1] = min(dp0+num+1,dp1+10-num-1)
print(dp[-1][0])
|
p03449 | s089303089 | Wrong Answer | n = int(input())
a = []
for _ in range(2):
a.append(list(map(int, input().split(" "))))
res = 0
for i in range(n):
res += a[0][i]
sum_row_1 = sum(a[0][i + 1:n])
sum_row_2 = sum(a[1][i:n])
if sum_row_1 <= sum_row_2:
res += sum_row_2
break
print(res)
|
p02952 | s503595839 | Accepted | N = input()
if int(N) < 9:
print(N)
elif len(N) == 1 or len(N) == 2:
print(9)
elif len(N) ==3:
print(9+int(N)-99)
elif len(N) == 4:
print(9 + 900)
elif len(N) == 5:
print(9+900+int(N)-9999)
else:
print(90909) |
p03371 | s285592193 | Accepted | A, B, C, X, Y = list(map(int, input().split()))
max_AB = max(X, Y)
ans = float('inf')
for i in range(0, max_AB + 1):
X_num = max(X - i, 0)
Y_num = max(Y - i, 0)
ans = min(X_num * A + Y_num * B + 2 * C * i, ans)
print(ans)
|
p03637 | s670289978 | Wrong Answer | n = int(input())
al = list(map(int, input().split()))
foud = 0
twod = 0
for i in range(n):
if al[i] % 4 ==0:
foud += 1
elif al[i] % 2 ==0:
twod += 1
if (foud*2+1)+(twod//2) >=n:
print("Yes")
else:
print("No") |
p03785 | s593707226 | Wrong Answer | N, C, K = map(int, input().split())
T = sorted(list(int(input()) for _ in range(N)))
bus = 0
pa = 1
point = T[0]
for i in T[1:]:
pa += 1
if point +K < i or pa > C:
bus += 1
pa = 1
c = i
print(bus+1) |
p03543 | s392333546 | Accepted |
n = list(input())
if n[0] == n[1] == n[2] or n[1] == n[2] == n[3] or n[0] == n[1] == n[2] == n[3]:
print("Yes")
else:
print("No")
|
p02755 | s560222718 | Wrong Answer | a, b = map(int, input().split())
for n in range(10000):
xa = n * 0.08
xb = n * 0.1
if a == xa and b == xb:
print(n)
exit()
print(-1) |
p03254 | s926870694 | Accepted | n, x = map(int, input().split())
a = list(map(int, input().split()))
a.sort()
if x == sum(a):
print(n)
elif x > sum(a):
print(n-1)
else:
for i in range(n):
if x < a[i]:
print(i)
break
x -= a[i]
|
p02546 | s535829368 | Accepted | S = input()
print(S+'es' if S.endswith('s') else S+'s') |
p02882 | s899525670 | Accepted | import math
a, b, x = map(int, input().split())
if x <= a ** 2 * b / 2:
bottom = (x * 2 / (a * b))
hype = math.sqrt(bottom ** 2 + b ** 2)
print(math.degrees(math.atan2(b, bottom)))
else:
x = a ** 2 * b - x
height = x * 2 / (a ** 2)
print(math.degrees(math.atan2(height, a))) |
p03162 | s897296191 | Wrong Answer | n = int(input())
l = [list(map(int,input().split())) for i in range(n)]
a,b,c = [list(i) for i in zip(*l)]
dp = [[0,0,0] for i in range(n+1)]
for i in range(n):
dp[i+1][0] = max(dp[i][1]+a[i],dp[i][2]+a[i])
dp[i+1][1] = max(dp[i][0]+b[i],dp[i][2]+b[i])
dp[i+1][2] = max(dp[i][0]+c[i],dp[i][1],c[i])
print(max(dp[-1])) |
p03160 | s651022165 | Accepted | n = int(input())
arr = list(map(int,input().strip().split(" ")))
dp = [0]*n
dp[0] = 0
dp[1] = abs(arr[0]-arr[1])
for i in range(2,n):
p = abs(arr[i]-arr[i-1])
q = abs(arr[i]-arr[i-2])
dp[i] = min(p+dp[i-1],q+dp[i-2])
print(dp[n-1]) |
p02700 | s054776200 | Accepted | a,b,c,d=map(int,input().split())
print('Yes' if (a+d-1)//d >= (c+b-1)//b else 'No') |
p02783 | s073882601 | Wrong Answer |
h,a = map(int,input().split())
print((h//a)+1)
|
p03624 | s902498898 | Wrong Answer | s = input()
for i in range(97, 114+1):
if s.find(chr(i)) == -1:
print(chr(i))
exit()
print('None') |
p03329 | s704160380 | Accepted | N = int(input())
moneylist = [1]
money = 6
while money < 100000:
moneylist.append(money)
money = money*6
money = 9
while money < 100000:
moneylist.append(money)
money = money*9
moneylist.sort()
dp = [10**6]*(N+1)
dp[0] = 0
for i in range(1,N+1): #γι
for j in moneylist: #δ½Ώγγγι
if j <= i:
dp[i] = min(dp[i],dp[i-j] + 1)
print(dp[-1]) |
p02838 | s946974031 | Wrong Answer | mod = 10**9+7
n = int(input())
A = list(map(int,input().split()))
from collections import defaultdict
zero = defaultdict(int)
one = defaultdict(int)
for a in A:
for i in range(60):
if a &(1<<i):
one[i] += 1
else:
zero[i] += 1
ans = 0
for a in A:
for i in range(60):
if a &(1<<i):
ans += pow(2,i,mod)*zero[i]
else:
ans += pow(2,i,mod)*one[i]
ans %= mod
print((ans//2)%mod) |
p03821 | s172441253 | Accepted | # A - Multiple Array
import numpy as np
N = int(input())
A = np.zeros(N, dtype=int)
B = np.zeros(N, dtype=int)
ans = 0
for i in range(N):
A[i], B[i] = map(int, input().split())
for i in range(1,N+1):
tmp = -(A[N-i] + ans) % B[N-i]
ans += tmp
print(ans) |
p02777 | s267140620 | Accepted | S, T = input().split()
A, B = map(int, input().split())
U = input()
if S == U:
print(A - 1, B)
else:
print(A, B - 1) |
p02677 | s499136588 | Accepted | import math
A, B, H, M = map(int, input().split())
m = H*60 + M
a_rad = m / (60 * 12) * math.pi * 2
b_rad = M / 60 * math.pi * 2
ans = (A*A + B*B - 2*A*B*math.cos(a_rad-b_rad))**0.5
print(ans)
|
p02879 | s863198442 | Wrong Answer | A,B = map(int,input().split())
print(A*B) if A >=9 and B >=9 else print('-1') |
p02756 | s980176514 | Accepted | S = input()
Q = int(input())
dir_changed = False
hd, ta = [], []
for _ in range(Q):
A = list(input().split())
if A == ["1"]:
dir_changed = not dir_changed
hd, ta = ta, hd
continue
F, C = int(A[1]), A[2]
#if dir_changed:
# F = 3-F
if F == 1:
hd.append(C)
else:
ta.append(C)
if dir_changed:
S = S[::-1]
print("".join(hd[::-1]) + S + "".join(ta)) |
p02657 | s705625012 | Accepted | # coding: utf-8
import string
n = list(map(int,input().split()))
print(n[0]*n[1]) |
p03854 | s729822057 | Accepted | s = input()
s = s.replace("eraser", "")
s = s.replace("erase", "")
s = s.replace("dreamer", "")
s = s.replace("dream", "")
if len(s) == 0:
print("YES")
else:
print("NO") |
p02553 | s045482842 | Wrong Answer | a,b,c,d = map(int,input().split())
if 0 <= a and 0 <= c:
print(b*d)
elif 0 <= a and d <= 0:
print(a*d)
elif b <= 0 and 0 <= c:
print(b*c)
elif b <= 0 and d <= 0:
print(a * c) |
p04020 | s014413539 | Accepted | N=int(input())
ans=0
tmp=0
for i in range(N):
s=int(input())
if s!=0:
tmp+=s
else:
ans+=tmp//2
tmp=0
ans+=tmp//2
print(ans) |
p02639 | s349478061 | Wrong Answer | x= list(map(int, input().strip().split()))
for i in range(len(x)):
if x[i]==3:
print(i+1)
break |
p02639 | s526502684 | Accepted | x = list(map(int,input().split()))
ans = x.index(0) + 1
print(ans) |
p02831 | s561027571 | Accepted | def gcd(x, y):
x, y = max(x, y), min(x, y)
while x % y > 0:
x, y = y, x % y
return y
A, B = list(map(int, input().split()))
g = gcd(A, B)
answer = int(A*B/g)
print(answer) |
p02646 | s076317848 | Accepted | a, v1 = map(int, input().split())
b, v2 = map(int, input().split())
t = int(input())
l = abs(a-b)
delta_v = v1-v2
if delta_v <= 0:
print("NO")
exit()
if delta_v * t >= l:
print("YES")
else:
print("NO") |
p03730 | s331444728 | Accepted | def main():
A,B,C = list(map(int, input().split()))
ans = "NO"
for i in range(1, B+1):
if((A * i) % B == C):
ans = "YES"
break
print(ans)
if __name__ == "__main__":
main() |
p03997 | s613750438 | Accepted | a = int(input())
b = int(input())
c = int(input())
print((a+b)*c//2)
|
p03087 | s578761829 | Wrong Answer | N,Q = list(map(int,input().split()))
S = input()
lr = [list(map(int,input().split())) for i in range(Q)]
count = 0
countList = [0 for i in range(N)]
for i in range(1, N):
if S[i - 1] == 'A' and S[i] == 'C':
count += 1
countList[i] = count
print(countList)
for i in range(Q):
l = lr[i][0]
r = lr[i][1]
lCount = countList[l - 1]
rCount = countList[r - 1]
print(rCount - lCount) |
p03723 | s597127588 | Accepted | a, b, c = map(int, input().split())
count = 0
if a % 2 == 0 and a == b == c:
print(-1)
exit()
while a % 2 == 0 | b % 2 == 0 | c % 2 == 0:
A = int((b + c) / 2)
B = int((c + a) / 2)
C = int((a + b) / 2)
a = A
b = B
c = C
count += 1
print(count) |
p02818 | s973644741 | Wrong Answer | def main():
a,b,k = map(int, input().split())
if k <= a:
a = k-a
else:
if k-a <= b:
b = b - (k-a)
a=0
else:
a = 0
b = 0
print(a,b)
if __name__ == '__main__':
main() |
p03524 | s764003143 | Accepted | s=input()
cnt=[0]*3
ans="YES"
for i in range(len(s)):
cnt[ord(s[i])-97]+=1
if max(cnt)-min(cnt)>=2:
ans="NO"
print(ans) |
p02792 | s837862594 | Accepted | N = int(input().strip())
map = {i: {j: 0 for j in range(1, 10)} for i in range(1, 10)}
div = 1
for n in range(1, N + 1):
h = n // div
if h >= 10:
div *= 10
h = n // div
t = n % 10
if t == 0:
continue
map[h][t] += 1
total = 0
for i in range(1, 10):
for j in range(1, 10):
total += map[i][j] * map[j][i]
print(total)
|
p02576 | s108891223 | Accepted | N, X, T = map(int, input().split())
import math
ans = math.ceil(N/X)*T
print(ans) |
p03001 | s854058720 | Accepted | W, H, x, y = map(int, input().split())
print(W * H / 2, int(x == W / 2 and y == H / 2))
|
p02711 | s745808159 | Accepted | n=input()
if "7" in n:
print("Yes")
else:
print("No") |
p03241 | s860654942 | Wrong Answer | n, m = map(int, input().split())
li = []
for i in range(int(m**0.5) + 1, 0, -1):
if m%i==0:
li.append(i)
for i in li:
if i <= m//n:
print(i)
exit() |
p03457 | s905593931 | Accepted | N = int(input())
ans = "Yes"
i = 0
while i < N:
t,x,y = [int(num) for num in input().split()]
if x+y <= t and (t-x-y)%2 == 0:
i += 1
else:
ans = "No"
break
print(ans) |
p03219 | s436066890 | Accepted | X,Y = map(int, input().split())
print(int(X+(Y/2)))
|
p03998 | s910181222 | Accepted | hand = [input() for _ in range(3)]
pos = [0 for i in range(3)]
turn = 0
d = {c:i for i,c in enumerate('abc')}
while pos[turn] < len(hand[turn]):
pos[turn], turn = pos[turn] + 1, d[hand[turn][pos[turn]]]
print('ABC'[turn])
|
p03625 | s199638172 | Wrong Answer | import collections
N = int(input())
A = list(map(int, input().split()))
edge = collections.Counter(A)
a = 0
b = 0
for i in sorted(edge.items()):
if i[1] >= 2:
if i[0] > a:
b = a
a = i[0]
print(a * b) |
p02829 | s495731500 | Accepted | a = input()
b = input()
# print(a)
# print(b)
# c = 6-a-b
# print(c)
c = int(a)
d = int(b)
e = 6-c-d
print(e) |
p03360 | s362072802 | Accepted | A,B,C=list(map(int,input().split()))
K=int(input())
m=max([A,B,C])
k=m
for i in range(1,K+1):
k=k*2
print(sum([A,B,C])-m+k) |
p03061 | s170356251 | Accepted | def gcd(n,m):return gcd(m,n%m) if m and n else n+m
n=int(input())
h=list(map(int,input().split()))
l=[0]*n
r=[0]*n
a,s=0,0
for i in range(n):
l[i]=a
a=gcd(a,h[i])
r[-i-1]=s
s=gcd(s,h[-i-1])
ans=1
for i in range(n):
ans=max(ans,gcd(l[i],r[i]))
print(ans) |
p03720 | s071718848 | Wrong Answer | n, m = map(int, input().split())
road = ""
for _ in range(m):
a, b = map(str, input().split())
road += a + b
print(road)
for i in range(n):
print(int(road.count(str(i+1)))) |
p03379 | s526261938 | Wrong Answer | from copy import deepcopy
def main():
n = int(input())
x = list(map(int, input().split()))
y = deepcopy(x)
y.sort()
median = y[n // 2]
next_median = y[n // 2 - 1]
for xx in x:
if xx == median:
print(next_median)
else:
print(median)
if __name__ == '__main__':
main()
|
p03457 | s113166583 | Accepted | N = int(input())
now = [0, 0]
for i in range(N):
t, x, y = map(int, input().split())
time = abs(x - now[0]) + abs(y - now[1])
if t >= time and (t - time)%2==0:
continue
print('No')
quit()
print('Yes') |
p02754 | s818450052 | Accepted | n, a, b = map(int, input().split())
c = n // (a+b)
d = n % (a+b)
if d > a:
d = a
print(c*a+d) |
p02723 | s906533011 | Accepted | S=input()
S=str(S)
a=len(S)
if a==6:
if S[2]==S[3]:
if S[4]==S[5]:
print("Yes")
else:
print("No")
else:
print("No") |
p03723 | s873612199 | Wrong Answer | a,b,c=map(int,input().split())
if (a==b==c):
print(-1)
elif (a%2==1 or b%2==1 or c%2==1):
print(0)
else:
for i in range(1,10**9):
a,b,c=(b//2+c//2),(a//2+c//2),(a//2+b//2)
#print(a,b,c)
if (a%2==1 or b%2==1 or c%2==1):
print(i)
break
|
p02678 | s640132444 | Accepted | from collections import deque
N, M = map(int, input().split())
AB = [list(map(int, input().split())) for _ in range(M)]
g = [[] for _ in range(N+1)]
for a, b in AB:
g[a].append(b)
g[b].append(a)
d = deque([1])
l = [0]*(N+1)
while d:
r = d.popleft()
for s in g[r]:
if l[s] == 0:
d.append(s)
l[s] = r
print("Yes", *l[2:], sep="\n") |
p02582 | s886155515 | Wrong Answer | s = input()
ans,cnt = 0,0
for l in s:
if l=='R':
cnt += 1
else:
ans = cnt
cnt = 0
print(ans) |
p02860 | s046676130 | Wrong Answer | N = int(input())
S = input()
len_S = len(S)
count = 0
if len_S % 2 == 1:
print('No')
else:
for i in range(len_S//2):
if S[i] == S[i+(len_S//2)]:
count += 1
else:
print('No')
break
if count == len_S//2:
print('Yes') |
p03360 | s198594063 | Accepted | a = list(map(int, input().split()))
k = int(input())
a.sort()
a[-1] *= 2 ** k
print(sum(a))
|
p03448 | s756859221 | Wrong Answer | [a,b,c,d]=[int(input()) for i in range(1,4+1)]
a1 = d // 500
b1 = d// 100
c1 = d// 50
value = 0
count = 0
for i in range(0,a1+1):
value = value + 500*i
for j in range(0,b1+1-5*i):
value = value + 100*j
for k in range(0,c1+1-10*i-2*j):
value = value + 50*k
if value == d :
count = count+1
break
value = 0
print(count) |
p03487 | s837753773 | Accepted | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
from collections import Counter
n, *a = map(int, read().split())
c = Counter(a)
ans =0
for k, v in c.items():
if v >= k:
ans += v - k
elif v < k:
ans += v
print(ans)
|
p03286 | s551609057 | Accepted | n=int(input())
s=[]
if n%2==0:
s.append(0)
else:
s.append(1)
nn=n
ii=0
while nn<=-1 or 2<=nn:
nn=(nn-s[ii])//(-2)
if nn%2==0:
s.append(0)
else:
s.append(1)
ii+=1
ss=""
for i in range(len(s)):
ss=str(s[i])+ss
print(ss) |
p02660 | s437993818 | Accepted | from collections import Counter
n = int(input())
def factorize(n):
b = 2
factor = []
while b * b <= n:
while n % b == 0:
n //= b
factor.append(b)
b += 1
if n > 1:
factor.append(n)
return factor
f = factorize(n)
c = Counter(f)
a = 0
for v in c.values():
i = 1
while v >= i:
v -= i
i += 1
a += 1
print(a)
|
p02641 | s335900147 | Accepted | X, N = map(int, input().split())
p = list(map(int, input().split()))
for d in range(X + 1):
for s in [- 1, 1]:
a = X + s * d
if p.count(a) == 0:
print(a)
exit(0) |
p03862 | s428065431 | Accepted | #!/usr/bin/env python3
# -*- coding: utf-8 -*-
def main():
N, X = map(int, input().split())
A = list(map(int, input().split())) + [0]
result = 0
for i in range(N):
tmp = max(0, A[i] + A[i - 1] - X)
result += tmp
A[i] -= tmp
print(result)
if __name__ == "__main__":
main()
|
p03011 | s028422434 | Accepted | p,q,r=map(int,input().split())
print(min(p+q,q+r,r+p)) |
p02817 | s655215535 | Accepted | S,T = input().split()
U = ""
U = U + T + S
print(U) |
p02823 | s741220231 | Wrong Answer | N,A,B=map(int,input().split())
if (A-B)%2==0:
ans=int((A-B)/2)
else:
ans=min(B-1,N-A)
print(ans) |
p03038 | s261352171 | Wrong Answer | print('γγγγ·γ«γγγγ') |
p03617 | s678454063 | Accepted | q,h,s,d=map(int,input().split())
n=int(input())
m=n//2*min(8*q,4*h,2*s,d)+n%2*min(4*q,2*h,s)
print(m) |
p03146 | s686637062 | Accepted | n = int(input())
temp_set = {n}
for i in range(2, 10 ** 6 + 1):
if n % 2 == 0:
n //= 2
else:
n = 3 * n + 1
if n in temp_set:
break
temp_set.add(n)
print(i) |
p03407 | s986569260 | Accepted | a,b,c=map(int,input().split())
if a+b>=c:
print('Yes')
else:
print('No') |
p02606 | s122852881 | Accepted | l, r, d = map(int, input().split())
ans = 0
for i in range(l, r+1):
if i%d == 0:
ans += 1
print(ans) |
p03075 | s364052292 | Accepted | a=int(input())
b=int(input())
c=int(input())
d=int(input())
e=int(input())
k=int(input())
v=e-a
if v <=k:
print('Yay!')
else:
print(':(')
|
p02602 | s883651816 | Accepted | def main():
n, k = map(int, input().split())
a = list(map(int, input().split()))
for i in range(0, n-k):
if a[i] < a[k+i]:
print("Yes")
else:
print("No")
if __name__ == '__main__':
main()
|
p02584 | s229040059 | Accepted | #!python3
import sys
iim = lambda: map(int, sys.stdin.readline().rstrip().split())
def resolve():
X, K, D = iim()
r = 1
if X < 0:
r = -1
X = -X
a, b = divmod(X, D)
diff = K - a
if diff <= 0:
print(abs(r*(X - K*D)))
return
if diff & 1:
b -= D
print(abs(r*b))
if __name__ == "__main__":
resolve()
|
p03556 | s778051017 | Accepted | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
n = int(readline())
ans = int(n** 0.5)**2
print(ans) |
p03854 | s864850386 | Wrong Answer | S = input()
replaced_t = S.replace('dreamer','').replace('dream', '').replace('eraseer', '').replace('erase', '')
if replaced_t:
print('NO')
else:
print('YES') |
p02707 | s255686711 | Accepted | N = int(input())
A = [int(_) for _ in input().split()]
cnt = [0 for i in range(N+1)]
for a in A:
cnt[a] += 1
for c in cnt[1:]:
print(c)
|
p02755 | s324893489 | Accepted | # -*- coding: utf-8 -*-
a, b = map(int, input().split())
for i in range(2000):
if int(i * 0.08) == a and int(i * 0.1) == b:
print(i)
exit()
print(-1)
|
p02982 | s429566156 | Accepted | N,D = map(int,input().split())
X = [list(map(int, input().split())) for j in range(N)]
count_ = 0
for j in range(0,N):
for i in range(j+1,N):
sum_ = 0
for d in range(D):
sum_+=(X[i][d]-X[j][d])**2
if (sum_**0.5)%1==0: count_+=1
print(count_) |
p03427 | s722752965 | Accepted | n = input()
if len(n)==1:
print(n)
else:
nines = 1
for i in range(1,len(n)):
if n[i]!="9":
nines = 0
if nines == 1:
print((len(n)-1)*9+int(n[0]))
else:
print((len(n)-1)*9+(int(n[0])-1)) |
p03042 | s832183039 | Accepted | #!/usr/bin/env python3
s = str(input())
a = s[0:2]
b = s[2:]
def div(a):
a = int(a)
if a <= 12 and a >= 1:
return "BOTH"
else:
return "YY"
if div(a) == div(b):
if div(a) == "YY":
print("NA")
else:
print("AMBIGUOUS")
elif div(a) == "YY":
print("YYMM")
else:
print("MMYY")
|
p02988 | s085845333 | Accepted | n = int(input())
p = list(map(int, input().split()))
ans = 0
for i in range(len(p)-2):
if p[i] < p[i+1] < p[i+2] or p[i] > p[i+1] > p[i+2]:
ans += 1
print(ans) |
p03319 | s460226644 | Accepted | n,k=map(int,input().split())
a=list(map(int,input().split()))
cnt=1
n=n-k
while n>0:
n-=k-1
cnt+=1
print(cnt)
|
p02848 | s583962539 | Wrong Answer | n=input()
s=list(input())
for i in range(len(s)):
ord_s=int(ord(s[i]))
ord_s+=int(n)
s[i]=chr(ord_s)
print("".join(s)) |
p02755 | s731411428 | Accepted | A, B = map(int, input().split())
for i in range(1, 1011):
a = i * 0.08
b = i * 0.1
if A <= a < A+1 and B <= b < B + 1:
print(i)
exit()
print('-1')
|
p03062 | s851601096 | Accepted | import sys
N = int(sys.stdin.readline().strip())
A = map(int, sys.stdin.readline().strip().split())
ans = 0
neg_count = 0
zero_count = 0
a_min = float("inf")
for a_i in A:
ans += abs(a_i)
a_min = min(a_min, abs(a_i))
if a_i == 0:
zero_count += 1
elif a_i < 0:
neg_count += 1
#print(ans)
if neg_count % 2 == 0 or zero_count > 0:
print(ans)
else:
#print(a_min)
print(ans - 2 * a_min) |
p02664 | s305272213 | Accepted | s = input()
print(s.replace('?', 'D')) |
p03264 | s329493714 | Wrong Answer | k=int(input())
if k%2==1:
print((k//2)*(k//2-1))
else:
print((k//2)**2)
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.