problem_id stringclasses 428 values | submission_id stringlengths 10 10 | status stringclasses 2 values | code stringlengths 5 816 |
|---|---|---|---|
p03131 | s174865185 | Wrong Answer | k,a,b=map(int,input().split())
ans=0
k+=1
if a>b+1:
ans=k
else:
if a+2>k:
ans=k
else:
ans+=b
k-=a+2
ans+=(b-a)*(k//2)
ans+=k%2
print(ans)
|
p02899 | s634252758 | Wrong Answer | n = int(input())
a = list(map(int, input().split()))
cnt = [0] * n
for i in range(n):
x = a[i]
cnt[x-1] = i+1
print(cnt)
|
p03657 | s916443599 | Accepted | a,b = map(int,input().split())
if a%3 == 0 or b%3 == 0 or (a+b)%3 == 0:
print("Possible")
else:
print("Impossible") |
p03862 | s276139135 | Accepted | N, x = map(int, input().split())
A = list(map(int, input().split()))
ans = 0
if A[0] > x:
ans = A[0] - x
A[0] = x
for i in range(N-1):
if A[i] + A[i+1] > x:
ans += A[i]+A[i+1]-x
A[i+1] = x-A[i]
print(ans)
|
p02784 | s441945736 | Wrong Answer | H, A = map(int, input().split())
sa = list(map(int, input().split()))
while H > 0:
for i in sa:
H = H - i
if H > 0:
break
if H <= 0:
print("YES")
else:
print("NO") |
p02796 | s923847878 | Wrong Answer | N = int(input())
robo = []
for _ in range(N):
robo.append(list(map(int, input().split())))
robo.sort()
ans = 0
flg = False
for i in range(N-1):
if flg:
flg = False
continue
if robo[i][0] + robo[i][1] <= robo[i+1][0] - robo[i+1][1]:
continue
else:
ans += 1
flg = True
print(N-ans) |
p03261 | s347187333 | Accepted | n=int(input())
lst=[]
for i in range(n):
w=input()
if w in lst:
print("No")
exit(0)
elif len(lst)>0:
if lst[-1][-1]!=w[0]:
print("No")
exit(0)
lst.append(w)
print("Yes") |
p02660 | s917931855 | Wrong Answer | from sys import stdin
def main():
read = stdin.readline
N =int(read())
count = 0
start = 2
while(1):
if N < start:
break
for i in range(start,N+1):
if N%i == 0:
count += 1
N = N//i
start = i+1
break
print(count)
if __name__ == "__main__":
main() |
p02918 | s688219854 | Accepted |
def read_int():
return int(input().strip())
def read_ints():
return list(map(int, input().strip().split(' ')))
def solve():
'''
RL...LL 0
RL...RR 0
RL...RL 0
RL...LR +2
LR...RL +2
RL +1
13 3
LRRLRLRRLRLLR
'''
N, K = read_ints()
S = input()
score = 0
for i in range(N-1):
if S[i] == S[i+1]:
score += 1
return min(score+2*K, N-1)
if __name__ == '__main__':
print(solve())
|
p02847 | s121184191 | Accepted | s = input()
if s == 'SUN':
print(7)
if s == 'MON':
print(6)
if s == 'TUE':
print(5)
if s == 'WED':
print(4)
if s == 'THU':
print(3)
if s == 'FRI':
print(2)
if s == 'SAT':
print(1) |
p03210 | s200918357 | Accepted | x = int(input())
if x == 7 or x == 5 or x == 3:
print("YES")
else:
print("NO")
|
p03103 | s807404632 | Accepted | n,m=map(int,input().split())
drink=[list(map(int,input().split())) for i in range(n)]
drink.sort(key=lambda i:i[0])
tot,cnt=0,0
for i in range(n):
if cnt+drink[i][1]>=m:
tot+=drink[i][0]*(m-cnt)
break
else:
cnt+=drink[i][1]
tot+=drink[i][0]*drink[i][1]
print(tot) |
p02732 | s463008039 | Accepted | from collections import Counter
n = int(input())
integer = list(map(int, input().split()))
length = len(integer)
counter = Counter(integer)
keys = counter.keys()
total = 0
for key in keys:
total += counter[key] * ( counter[key] -1 ) / 2
total = int(total)
for i in integer:
tmp = total
tmp -= counter[i] - 1
print(tmp)
|
p03103 | s714384961 | Accepted | n,m=map(int,input().split())
ab=[list(map(int,input().split())) for i in range(n)]
ab.sort()
ans=0
for i in range(n):
if m>ab[i][1]:
ans+=ab[i][0]*ab[i][1]
m-=ab[i][1]
else:
ans+=ab[i][0]*m
print(ans)
break
|
p03379 | s304260337 | Wrong Answer | import numpy as np
N = int(input())
X = np.array(input().split(), dtype=np.int64)
argsort = X.argsort().argsort()
X_sorted = X[argsort]
m1, m2 = N // 2 - 1, N // 2
for idx in argsort:
if idx > m1:
print(X_sorted[m1])
else:
print(X_sorted[m2])
|
p02631 | s976036223 | Accepted | n = int(input())
alist = list(map(int,input().split()))
s = 0
for i in alist:
s ^= i
ans = []
for i in alist:
ans.append(s ^ i)
print(" ".join(str(x) for x in ans)) |
p03448 | s317317114 | Accepted | #!/usr/bin/env python
# coding: utf-8
# In[20]:
A = int(input())
B = int(input())
C = int(input())
X = int(input())
# In[22]:
ans = 0
for a in range(min(X//500+1, A+1)):
for b in range(min((X-500*a)//100+1, B+1)):
c = (X-500*a-100*b)//50
# print(a,b,c)
if c <= C:
ans += 1
print(ans)
# In[ ]:
|
p03385 | s102688543 | Wrong Answer | li = list(input())
sorted(li)
if li[0] == 'a' and li[1] == 'b' and li[2] == 'c':
print('Yes')
else:
print('Yes')
|
p03309 | s438900095 | Accepted | N = int(input())
A = sorted(a-i-1 for i, a in enumerate(map(int, input().split())))
print(sum(abs(a-A[N//2]) for a in A))
|
p02766 | s943426698 | Accepted | import sys
stdin = sys.stdin
ns = lambda : stdin.readline().rstrip()
ni = lambda : int(ns())
na = lambda : list(map(int, stdin.readline().split()))
sys.setrecursionlimit(10 ** 7)
def main():
n, k = na()
def Base_10_to_n(X, n):
if (int(X/n)):
return Base_10_to_n(int(X/n), n)+str(X%n)
return str(X%n)
print(len(Base_10_to_n(n, k)))
if __name__ == '__main__':
main() |
p02951 | s875908936 | Accepted | #A
a, b, c = map(int, input().split())
d = c - a + b
if d < 0:
print(0)
else:
print(d) |
p03264 | s769225370 | Accepted | K = int(input())
e_n = K // 2
o_n = K - e_n
print(e_n * o_n) |
p02607 | s135111873 | Accepted | import sys
sys.setrecursionlimit(10**6)
n = int(input())
A = list(map(int, input().split()))
#n, m = map(int, input().split())
#s = input()
#s,t = input().split()
#a = [int(input()) for _ in range(n)]
#
#readline = sys.stdin.readline
#n,m = [int(i) for i in readline().split()]
#ab = [[int(i) for i in readline().split()] for _ in range(n)]
ID = [i for i in range(1,n+1)]
ans = 0
for i,a in zip(ID, A):
if i%2 == 1 and a%2 == 1:
ans += 1
print(ans) |
p02987 | s753822492 | Accepted | S = input()
s = sorted(S)
if s[0] == s[1] and s[2] == s[3] and s[0] != s[2]:
print('Yes')
else:
print('No') |
p03612 | s569808527 | Accepted | N=int(input())
P=map(int,input().split())
S=[]
for x,y in zip(P, range(1,N+1)):
if x==y: S.append(y)
S.append('$')
L=len(S)
lake=[]
lake.append(S[0])
i=1
a=0
while i<L:
if S[i]=='$':
a+=1
elif lake[0]+1!=S[i]:
a+=1
lake=[]
lake.append(S[i])
else:
lake.append(S[i])
i+=1
print(a) |
p03035 | s997313759 | Wrong Answer | a, b = map(int, input().split())
if a <= 5:
print("0")
elif 6 <= a and a <= 12:
print(b/2)
elif a >= 13:
print(b) |
p03779 | s993810986 | Wrong Answer | import math
x = int(input())
y = math.floor(x / 2)
if y == 1:
print(x)
else:
print(y)
|
p03612 | s821576705 | Accepted | n, *p = map(int, open(0).read().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
if p[n-1]==n: ans += 1
print(ans) |
p02641 | s684168730 | Accepted | x, n = map(int, input().split())
p = set(map(int, input().split()))
mi = 1000
for i in range(102):
if i in p:
continue
if abs(i-x)<mi:
mi = abs(i-x)
ans = i
print(ans) |
p02702 | s010109354 | Accepted | def main():
S = input()[::-1]
ans = 0
mods = [0] * 2019
mods[0] = 1
current = 0
x = 1
for s in S:
current = (current + x * int(s)) % 2019
mods[current % 2019] += 1
x = x * 10 %2019
for i in mods:
ans += i*(i-1)//2
print(ans)
if __name__ == '__main__':
main() |
p02641 | s472369571 | Accepted | x, n = map(int, input().split())
num_list = list(map(int, input().split()))
dif = 100000
o_list = []
if len(num_list) == 0:
print(x)
exit()
#
# for i in range(1, max(num_list)):
# if i not in num_list:
# o_list.append(i)
for i in range(-1000, 1000):
if i not in num_list:
o_list.append(i)
o_list.sort(reverse=True)
for num in o_list:
if abs(x - num) <= dif:
# if x not in num_list:
dif = abs(x -num)
ans = num
print(ans)
|
p02731 | s470554505 | Accepted | L = int(input())
ans = 0
i = L / 3
ans = i ** 3
print('{:.7f}'.format(ans)) |
p02899 | s518385571 | Accepted | n = int(input())
A = list(map(int,input().split()))
B = [i+1 for i in range(n)]
li = []
for i in range(n):
li.append([A[i],B[i]])
li.sort()
b = []
for i in range(n):
b.append(li[i][1])
b = map(str,b)
print(' '.join(b)) |
p02953 | s475953030 | Wrong Answer | n=int(input())
h=list(map(int,input().split()))
temp=0
if n==1:
print("Yes")
else:
for i in range(0,n-1):
if h[i]-1<temp:
print("No")
break
temp=max(temp,h[i])
else:
print("Yes") |
p02645 | s428056104 | Accepted | #!/usr/bin/env python
# coding: utf-8
# In[2]:
S = input()
print(S[:3])
# In[ ]:
|
p03767 | s455794124 | Wrong Answer | n = int(input())
a = sorted(list(map(int, input().split())))
ans1 = 0
ans2 = 0
for i in range(n, n*3):
if i%2 == 0:
ans1 += a[i]
if i < n*2:
ans2 += a[i]
print(max(ans1, ans2)) |
p03910 | s020529016 | Accepted | import math
n = int(input())
k = math.ceil(((1 + 8 * n) ** 0.5 - 1) / 2)
tmp = k * (k + 1) / 2 - n
for i in range(1, k + 1):
if i == tmp:
continue
print(i) |
p02720 | s009221846 | Wrong Answer | K = int(input())
answer = [0]
for k in range(K):
minvalue = min(answer)
if minvalue == 9:
for i in range(len(answer)):
answer[i] = 0
answer.append(1)
else:
target = answer.index(minvalue)
answer[target] += 1
if target != 0:
for i in range(len(answer) - target):
iindex = target - i - 1
if 1 <= iindex + 1 <= len(answer) - 1:
answer[iindex] = max(0, answer[iindex + 1] - 1)
answer.reverse()
print(''.join(map(str, answer))) |
p02553 | s715434272 | Accepted | a, b, c, d = [int(i) for i in input().split()]
nums = [a, b, c, d]
if a < 0 and b < 0 and 0 < c and 0 < d:
print(b * c)
exit(0)
if c < 0 and d < 0 and 0 < a and 0 < b:
print(d * a)
exit(0)
minus_num = len([i for i in nums if i < 0])
if minus_num == 4:
print(a * c)
exit(0)
if minus_num == 1 or minus_num == 0:
print(b * d)
exit(0)
if a * c < b * d:
print(b * d)
else:
print(a * c) |
p02693 | s044814258 | Wrong Answer | K = int(input())
A, B = map(int, input().split())
flag = False
for i in range(1000):
if A <= i*K and i*K <= B:
flag = True
if flag:
print("Yes")
else:
print("No") |
p02847 | s695953094 | Accepted | S=input()
day={"SUN":7,"MON":6,"TUE":5,"WED":4,"THU":3,"FRI":2,"SAT":1}
print(day[S]) |
p03633 | s699839303 | Accepted | N = int(input())
from fractions import gcd
ans = 1
for i in range(N):
T = int(input())
g = gcd(ans,T)
ans *= T//g
print(ans)
#print(*ans, sep='\n')
|
p03611 | s289548942 | Accepted | n=int(input())
alis=list(map(int,input().split()))
xlis=dict()
for i in set(alis):
xlis[i-1]=0
xlis[i+1]=0
xlis[i]=0
for i in alis:
xlis[i-1]+=1
xlis[i+1]+=1
xlis[i]+=1
print(max(xlis.values())) |
p03351 | s544658152 | Wrong Answer | a, b, c, d = map(int,input().split())
if (a - c) <= d or (a - b) <= d and (b - c) <= d:
print('Yes')
else :
print('No') |
p03815 | s917793401 | Accepted | def solve(x):
# 方針: ただ 6->5 を繰り返すだけ
return 2 * (x // 11) + (0 if x % 11 == 0 else 1 if x % 11 <= 6 else 2)
_x = int(input())
print(solve(_x)) |
p03449 | s060123087 | Accepted |
n = int(input())
row1 = list(map(int,input().split()))
row2 = list(map(int,input().split()))
mx = 0
for i in range(n):
pass
up = sum(row1[:i+1])
down = sum(row2[i:])
mx = max(mx,up+down)
print(mx)
|
p02861 | s408993316 | Accepted | import itertools
import math
n = int(input())
l = []
x = []
y = []
for i in range(n):
l.append(i+1)
tmp_x, tmp_y = map(int, input().split())
x.append(tmp_x)
y.append(tmp_y)
permutation = list(itertools.permutations(l, n))
ans = 0
for per in itertools.permutations(l, n):
for i in range(0, n-1):
suffix = per[i]
ans += math.sqrt((x[per[i]-1] - x[per[i+1]-1])**2 + (y[per[i]-1] - y[per[i+1]-1])**2)
print(ans / len(permutation))
|
p02910 | s733845152 | Wrong Answer | s=input()
if (s[::2]=='R' or 'U' or 'D') and (s[1::2]=='L' or 'U' or 'D'):
print('Yes')
else:
print('No') |
p04033 | s007950218 | Accepted | a,b = map(int, input().split())
if a > 0 and b > 0:
print("Positive")
elif a < 0 and b > 0:
print("Zero")
elif a == 0 or b == 0:
print("Zero")
else:
d = abs(a) - abs(b)
if d % 2 == 1:
print("Positive")
else:
print("Negative")
|
p02973 | s920383551 | Accepted | import bisect
n = int(input())
colors = [-1]*(n+1)
for _ in range(n):
a = int(input())
idx = bisect.bisect_left(colors, a)-1
colors[idx] = a
print(colors[::-1].index(-1))
|
p02987 | s718113130 | Accepted | s=input()
t=sorted(s)
u=''.join(t)
if u[0]==u[1] and u[1]!=u[2] and u[2]==u[3]:
print("Yes")
else:
print("No") |
p02924 | s094812312 | Wrong Answer | import math
N = int(input())
print(int(N*((N-1)/2)))
|
p02712 | s533008308 | Accepted | N = int(input())
temp = []
for i in range(1,N+1):
if (i%3 ==0)or(i%5==0)or((i%3==0)&(i%5==0)):
pass
else:
temp.append(i)
print(sum(temp)) |
p03478 | s051143514 | Wrong Answer | n,a,b = map(int,input().split())
count = 0
for i in range(1,n+1) :
s = str(i)
l = len(s)
x = 0
for j in range(l):
x += int(s[j])
if x >= a and x <= b:
print(i)
count += i
print(count) |
p02732 | s566335794 | Wrong Answer | n = int(input())
a = list(map(int,input().split()))
x = [0]*max(a)
for i in a:
x[i-1]+=1
for i in range(1,n+1):
x[a[i-1]-1]-=1
count = 0
x_ = [(k*(k-1))/2 for k in x if k>=2]
count = sum(x_)
# for j in x:
# if j>=2:
# count += int((j*(j-1)/2))
x[a[i-1]-1]+=1
print(count) |
p03289 | s178702872 | Wrong Answer | def main():
S = input()
if S[0] != 'A':
print('WA')
exit()
S = 'a'+S[1:]
if S.count('C', 2, len(S)-2) != 1:
print('WA')
exit()
tmp = S[2:len(S)-2].find('C') + 2
S = S[:tmp] + 'c' + S[tmp+1:]
if S != S.lower():
print('WA')
exit()
print('AC')
if __name__ == "__main__":
main()
|
p02624 | s480415408 | Wrong Answer | n = int(input())
ans = 0
for x in range(1, n+1):
k = n//x
ans += n*(2*x + (n-1)*x)//2
print(ans) |
p02706 | s812209275 | Accepted | n, m = map(int, input().split())
sequence = list(map(int, input().split()))
a = sum(sequence)
if a > n:
print(-1)
else:
print(n - a) |
p02661 | s974431777 | Accepted | n=int(input())
alis=[]
blis=[]
for i in range(n):
a,b=map(int,input().split())
alis.append(a)
blis.append(b)
alis=sorted(alis)
blis=sorted(blis)
if n%2!=0:
print(blis[int((n-1)/2)]-alis[int((n-1)/2)]+1)
else:
bb=(blis[int(n/2)-1]+blis[int(n/2)])
aa=(alis[int(n/2)-1]+alis[int(n/2)])
print(bb-aa+1) |
p02707 | s976963351 | Accepted | n = int(input())
li = list(map(int, input().split()))
diff = [0] * n
for i in li:
diff[i - 1] += 1
for j in diff:
print(j) |
p02664 | s916705507 | Wrong Answer | # B - Postdocs
T = list(str(input()))
len_T = len(T)
for i in range(1, len_T):
if T[i-1] == 'P' and T[i] == '?':
T[i] = 'D'
elif T[i-1] == '?' and T[i] == '?':
T[i-1] = 'P'
T[i] = 'D'
elif T[i-1] == '?' and T[i] == 'D':
T[i-1] = 'P'
elif T[i-1] == '?' and T[i] == 'P':
T[i-1] = 'D'
print(''.join(map(str, T))) |
p02772 | s215134992 | Wrong Answer | import sys
n = input()
list_a = list(map(int, input().split()))
for a in list_a:
if a%2 == 0:
if a%3 == 0:
if a%5 == 0:
pass
else:
print("DENIED")
sys.exit()
else:
print("DENIED")
sys.exit()
print("APPROVED") |
p02783 | s873515819 | Accepted | H, A = map(int, input().split())
if H % A == 0:
print(H // A)
else:
print((H // A) + 1) |
p02842 | s566967239 | Wrong Answer | N = int(input())
print(int(N / 1.08)) |
p02767 | s116488053 | Accepted | N = int(input())
List = [int(i) for i in input().split()]
ans = 10**18
def rally(p):
n = 0
for a in range(N):
n += (int(p)-List[a])**2
return n
for i in range(1,101):
ans = min(rally(i),ans)
print(ans)
|
p02607 | s257724121 | Accepted | #B
N=int(input())
A=list(map(int,input().split()))
ans=0
for i in range(N):
if (i+1)%2==1 and A[i]%2==1:
ans+=1
print(ans) |
p03860 | s139774750 | Wrong Answer | s=input().split()[1][0]
print("AtCode"+"Contest") |
p02795 | s306570608 | Wrong Answer | H, W, N = [int(input()) for _ in range(3)]
print(min((N+H-1)//H, (W+W-1)//W))
|
p02631 | s573678357 | Accepted | n = int(input())
a = list(map(int,input().split()))
sub = 0
for i in range(n):
sub ^= a[i]
for i in range(n):
print(sub ^ a[i],end = ' ')
|
p02755 | s794052795 | Accepted | import math
a,b = list(map(int,input().split()))
for i in range(1,1001):
if math.floor(i*0.08) == a and math.floor(i*0.1) == b:
print(i)
break
else:
print(-1) |
p02657 | s354714082 | Accepted | A, B = [int(v) for v in input().split()]
print(A * B) |
p03448 | s521235750 | Accepted | A=int(input())
B=int(input())
C=int(input())
X=int(input())
count=0
for i in range(A+1):
for j in range(B+1):
for k in range(C+1):
if 500*i+100*j+50*k==X:
count+=1
else:
pass
print(count) |
p03565 | s179740005 | Accepted | import re
s = "".join("." if i == "?" else i for i in input())
t = input()
lent = len(t)
mgroup = ""
mstart = 0
for start in range(len(s) - lent + 1):
m = re.match(re.compile(s[start:start+lent]), t)
if m:
mgroup, mstart = m.group(), start
else:
if mgroup:
s = s[:mstart] + t + s[mstart+lent:]
print(s.replace(".", "a"))
else:
print("UNRESTORABLE") |
p02664 | s807234786 | Accepted | t=input()
print(t.replace("?","D")) |
p02873 | s065434644 | Accepted | s = input()
n = len(s)
L=[0]
R=[0]
cnt = 0
for i in range(n):
if s[i] == '<':
cnt += 1
else:
cnt = 0
L.append(cnt)
cnt = 0
s = s[::-1]
for i in range(n):
if s[i] == '>':
cnt += 1
else:
cnt = 0
R.append(cnt)
R = R[::-1]
ans = 0
for i in range(n+1):
ans += max(R[i], L[i])
print(ans) |
p02719 | s285258133 | Accepted | n, k = map(int, input().split())
print(min(n%k, abs(n%k - k))) |
p03485 | s158163834 | Accepted | # -*- coding:utf-8 -*-
a, b = map(int, input().strip().split())
m = (a + b + 1)//2
print(m) |
p03274 | s610304294 | Accepted | n,k = map(int,input().split())
X = [int(i) for i in input().split()]
ans = 10**9
for i in range(n-k+1):
Max = X[i+k-1]
Min = X[i]
if Max<0 and Min<0:
tmp_ans = abs(Min)
elif Max>0 and Min >0:
tmp_ans = abs(Max)
else:
tmp_ans = abs(Max) + abs(Min) + min(abs(Max),abs(Min))
ans = min(ans,tmp_ans)
print(ans) |
p02785 | s268389362 | Accepted | n,k=map(int, input().split())
list1=list(map(int,input().split()))
list1.sort()
if k >= n:
print(0)
else:
sum1=0
for i in range(n-k):
sum1+=list1[i]
print(sum1) |
p03623 | s923384817 | Accepted | x, a, b = map(int, input().split())
if abs(x - a) > abs(x - b):
print('B')
else:
print('A')
|
p03695 | s526414507 | Accepted | n = int(input())
a = [int(int(x)/400) for x in input().split()]
b = [x if x <= 7 else 8 for x in a]
ans = len(set(b))
if (8 in b):
ans -= 1
ans2 = b.count(8) + ans
if (ans == 0):
print(1, ans2)
else:
print(ans, ans2)
else:
print(ans, ans)
|
p03208 | s411919134 | Accepted | n, k = map(int, input().split())
h = []
for _ in range(n):
h.append(int(input()))
h.sort(reverse=True)
ans = 10**9
for i in range(n-k+1):
ans = min(ans, h[i]-h[i+k-1])
print(ans) |
p03387 | s338129460 | Accepted | #C - Same Integers
ABC = list(map(int,input().split()))
ABC = sorted(ABC,reverse = True)
A = ABC[0]#max
B = ABC[1]
C = ABC[2]#min
count = 0
while A != B:
C += 1
B += 1
count += 1
while (B - C)%2 == 1:
A += 1
B += 1
count += 1
while A!=C:
C += 2
count += 1
print(count) |
p02613 | s752030624 | Wrong Answer | N = int(input())
ans = [0,0,0,0]
for _ in range(N):
a = input()
if a == "AC":
ans[0] += 1
elif a == "WA":
ans[1] += 1
elif a == "TLE":
ans[2] += 1
else:
ans[3] += 1
print("AC × "+ str(ans[0]))
print("WA × "+ str(ans[1]))
print("TLE × "+ str(ans[2]))
print("RE × "+ str(ans[3])) |
p02596 | s611245964 | Wrong Answer | n = int(input())
if n%2==0 or n%5==0:
print(-1)
ans,c = 0,0
while 1:
c+=1
for i in range(10):
if ((ans%10)+((n%10)*i)%10)%10==1:
ans += n*i
#print(ans,i)
break
ans = ans//10
if ans==0:
break
print(c) |
p03836 | s542625057 | Accepted | sx, sy, tx, ty = map(int, input().split())
ans = 'D'
ans += 'R'*(tx-sx+1)
ans += 'U'*(ty-sy+1)
ans += 'L'*(tx-sx+1)
ans += 'D'*(ty-sy)
ans += 'R'*(tx-sx)
ans += 'U'*(ty-sy+1)
ans += 'L'*(tx-sx+1)
ans += 'D'*(ty-sy+1)
ans += 'R'
print(ans) |
p02724 | s046092790 | Accepted | X = int(input())
h1k = X // 500
h5 = (X - h1k * 500) // 5
happiness = h1k*1000 + h5*5
print(happiness) |
p02820 | s555009573 | Accepted |
N, K = list(map(int, input().split()))
point= list(map(int, input().split()))
T = list(input())
d = dict()
d['s'] = point[0]
d['p'] = point[1]
d['r'] = point[2]
res = 0
ans = []
flag = [0,0,0]
for i in range(K):
res += d[T[i]]
ans.append(T[i])
for i in range(K,N):
if ans[i-K] == T[i]:
ans.append("n")
else:
res += d[T[i]]
ans.append(T[i])
print(res) |
p02773 | s816249696 | Accepted | from collections import defaultdict
from collections import OrderedDict
n = int(input())
answer = dict()
for _ in range(n):
z = str(input())
if z in answer:
answer[z]+=1
else:
answer.update({z:1})
groupedByValue = defaultdict(list)
for key, value in sorted(answer.items()):
groupedByValue[value].append(key)
M = groupedByValue[max(groupedByValue)]
for i in M:
print(i) |
p02633 | s208544800 | Accepted | from math import gcd
print(360//gcd(360,int(input()))) |
p03698 | s914109368 | Wrong Answer | def hantei(s):
return len(s) == len(set(s))
def main():
s = input()
s = list(s)
if hantei(s) == True:
print('yes')
else:
print('No')
if __name__ == '__main__':
main() |
p03495 | s446828834 | Accepted | import collections
n,k=map(int,input().split())
a=list(map(int,input().split()))
a=collections.Counter(a)
A=a.most_common()[::-1]
x=len(A)-k
if x<=0:
print("0")
else:
ans=0
for i in range(x):
ans+=A[i][1]
print(ans) |
p02924 | s385275988 | Accepted | N = int(input())
print(N*(N-1)//2) |
p02784 | s367001312 | Accepted | h, n, *a = map(int, open(0).read().split())
print(["No", "Yes"][h <= sum(a)]) |
p02835 | s205705068 | Wrong Answer | def main():
A = list(map(int, input().split()))
if sum(A) <= 22:
print('win')
else:
print('dust')
main() |
p02552 | s329410196 | Wrong Answer | import sys
import collections as cc
import math as mt
I=lambda:list(map(int,input().split()))
n,=I()
if n==1:
print(1)
else:
print(0) |
p02729 | s006439459 | Accepted | import math
def combinations_count(n, r):
if n == 1 or n == 0:
return 0
else:
return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))
N, M = [int(i.strip()) for i in input().split(' ')]
print(combinations_count(N,2) + combinations_count(M,2)) |
p04012 | s496344953 | Accepted | s=input()
ss=set(s)
ans="Yes"
for sss in ss:
if s.count(sss)%2==1:
ans="No"
print(ans) |
p02720 | s571931043 | Wrong Answer | k = int(input())
i = 0
a = []
while len(a) <= k:
if len(str(i)) == 1:
a.append(i+1)
else:
flg = True
for j in range(len(str(i))):
if j != len(str(i))-1:
t = abs(int(str(i)[j]) - int(str(i)[j+1]))
if t > 1:
flg = False
if flg == True:
a.append(i)
i = i+1
print(a[k])
|
p02779 | s792449720 | Accepted | n = int(input())
a = input().split()
b = set(a)
if len(b)<len(a):
print("NO")
else:
print("YES") |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.