problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p03069 | s178936792 | Wrong Answer | n = int(input())
s = input()
# 左側の黒の個数, 右側の白の個数
ans = n
b, w = 0, s.count('.')
for i in range(n):
if s[i] == '#':
b += 1
elif s[i] == '.':
w -= 1
ans = min(ans, b+w)
print(ans) |
p03251 | s255780226 | Accepted | n, m, x, y = map(int, input().split())
x_list = list(map(int, input().split()))
y_list = list(map(int, input().split()))
x_max = max(x_list)
y_min = min(y_list)
if (x_max < y_min) and (x_max+1 > x and y_min <= y):
print('No War')
else:
print('War') |
p03043 | s234300586 | Wrong Answer | import math
n,k=map(int,input().split())
x=0
ans=0
for i in range(1,n+1):
if k/i<=1:
x=0
else:
x=int(math.log2(k/i))+1
ans+=(1/n)*(1/2)**x
print(ans)
|
p03241 | s883015668 | Wrong Answer | import math
import sys
MOD = 1000000007
n, m = map(int, input().split())
if n == 1:
print(m)
sys.exit()
ans = 1
for i in range(1, int(math.sqrt(m))):
if i > m/n:
break
if m % i == 0:
ans = i
print(ans)
|
p02866 | s696510704 | Accepted | from collections import Counter
import sys
MOD = 998244353
n = int(input())
a = list(map(int,input().split()))
aa = Counter(a)
ma = max(aa)
def po(x,n):
k = 1
for i in range(n):
k = k*x % MOD
return k
if aa[0] != 1 or a[0] != 0:
print(0)
sys.exit()
ans = 1
for i in range(ma):
c,d = aa[i],aa[i+1]
if c == 0 or d == 0:
print(0)
sys.exit()
else:
ans = ans * po(c,d) % MOD
print(ans) |
p03434 | s009481453 | Accepted | n = int(input())
As = sorted(map(int, input().split()), reverse=True)
print(sum(As[::2])-sum(As[1::2])) |
p03673 | s395907990 | Accepted | n=int(input())
a=list(map(int,input().split()))
even = [a[i] for i in range(1,n,2)]
odd = [a[i] for i in range(0,n,2)]
if n % 2 == 0:
print(*(even[::-1]+odd))
else:
print(*(odd[::-1]+even)) |
p02552 | s263083179 | Accepted | A = int(input())
if A == 1:
print(0)
else :
print(1) |
p03379 | s082298845 | Accepted | n = int(input())
X = list(map(int,input().split()))
h = int(n/2)
Xs = sorted(X)
m1 = Xs[h-1]
m2 = Xs[h]
for i in range(n):
if X[i] <= m1:
print(m2)
else:
print(m1) |
p02918 | s246994152 | Accepted | n,k = map(int,input().split())
s = input()
flag = [0]*n
f = s[0]
cnt = 0
for i,t in enumerate(s):
if t == 'L':
if i != 0 and s[i-1] == 'L':
flag[i] = 1
if t == 'R':
if i != n-1 and s[i+1] == 'R':
flag[i] = 1
if t == f and i != n-1 and s[i+1] != f:
cnt += 1
ans = sum(flag)
if s[-1] == f:
ans += min(k,cnt)*2
else:
ans += 2*cnt - 1 if cnt <= k else 2*k
print(ans)
|
p02597 | s986478641 | Accepted | n = int(input())
c = input()
count = c.count('R')
ans = 0
for i in range(n):
if c[i] == 'R' and i >= count:
ans += 1
print(ans)
|
p03219 | s859996356 | Accepted | a=list(map(int,input().split()))
print(int(a[0]+(a[1]/2))) |
p03103 | s045946616 | Wrong Answer | N,M = map(int,input().split())
X =[]
for i in range(N):
a,b = map(int,input().split())
X.append([a,b])
X.sort(key=lambda x: x[0])
count = 0
ans = 0
for i in X:
if M - count > i[1]:
count += i[1]
ans += i[0] * i[1]
print(ans,count)
else:
x = M - count
ans += i[0] * x
break
print(ans) |
p03487 | s067554302 | Wrong Answer | import collections
n = int(input())
a = list(map(int, input().split()))
l = collections.Counter(a)
#print(l)
v = list(l.keys())
#print(v)
ans = 0
for i in v:
ans += min(abs(l.get(i)-i),l.get(i))
print(ans) |
p02899 | s534525948 | Accepted | n = int(input())
l = list(map(int, input().split()))
L = [0]*n
for i, order in enumerate(l, 1):
L[order-1] = i
print(*L)
|
p02838 | s429901576 | Wrong Answer | N=int(input())
A=list(map(int,input().split()))
list=[]
for i in range(100):
list.append(0)
ans=0
mod=(10**9)+7
print(list)
|
p03672 | s539937309 | Accepted | s = input()
l = len(s)
ans = 0
search = l-1
if search < 2:
print(0)
exit()
while search >= 2:
if search % 2 == 0:
if s[0:search//2] == s[search//2:search]:
ans = max(ans, search)
else:
pass
search -= 1
print(ans) |
p02678 | s500612782 | Accepted | n, m = map(int, input().split())
road = [[] for _ in range(n)]
for _ in range(m):
i, j = map(int, input().split())
road[i-1].append(j-1)
road[j-1].append(i-1)
# BFS
from collections import deque
ans = [-1] * n
todo = deque()
todo.append(0)
while len(todo) > 0:
i = todo.popleft()
for j in road[i]:
if ans[j] > -1:
continue
ans[j] = i
todo.append(j)
print('Yes')
for i in range(1, n):
print(ans[i] + 1) |
p03612 | s010004552 | Accepted | # 前から順番に後ろに向けてswap
n = int(input())
ps = list(map(int, input().split()))
cnt = 0
for i in range(n-1):
if i + 1 == ps[i]:
tmp = ps[i]
ps[i] = ps[i+1]
ps[i+1] = tmp
cnt += 1
# 最後残っていたら直前とswap
if ps[n-1] == n:
cnt += 1
print(cnt)
|
p03254 | s865609383 | Accepted | import sys
input = sys.stdin.readline
# A - Candy Distribution Again
N, x = map(int, input().split())
a = list(map(int, input().split()))
a.sort()
candies = 0
ans = 0
for ai in a:
if candies < x:
candies += ai
ans += 1
else:
break
if candies != x:
ans -= 1
print(ans)
|
p03435 | s486833795 | Accepted | c11 ,c12, c13 = map(int,input().split())
c21 ,c22, c23 = map(int,input().split())
c31 ,c32, c33 = map(int,input().split())
if c11 - c12 == c21 -c22 == c31-c32 and c12 - c13 == c22 -c23 == c32-c33 and c11 - c21 == c12 -c22 == c13-c23 and c21 - c31 == c22 -c32 == c23-c33 :
print('Yes')
else :
print('No') |
p03284 | s969032532 | Wrong Answer | n,k = map(int,input().split())
print(n % k) if n >= k else print(1) |
p02923 | s565564880 | Accepted | N=int(input())
H=list(map(int,input().split()))
s=0
t=0
for i in range(N-1):
if H[i]>=H[i+1]:
s+=1
else:
t=max(s,t)
s=0
t=max(s,t)
print(t) |
p02747 | s678772590 | Accepted | a = input()
b = ['hi','hihi','hihihi','hihihihi','hihihihihi']
if a in b:
print("Yes")
else:
print("No") |
p03997 | s772781884 | Accepted | l=[int(input()) for i in range(3)]
print((l[0]+l[1])*l[2]//2) |
p02848 | s922392545 | Accepted | n=int(input())
s=input()
ais1=ord("A")
res=""
for i in range(0,len(s)):
res = res + chr((ord(s[i])+n-65)%26+65)
print(res) |
p02601 | s347765047 | Accepted | a,b,c=map(int, input().split())
d=int(input())
ans="No"
k=0
for i in range(d+1):
b2=b*(2**(d-k))
c2=c*(2**(k))
if(a<b2<c2):
ans="Yes"
k+=1
print(ans) |
p03681 | s287828784 | Accepted | def factmod(n):
tmp = 1
for i in range(1,n+1):
tmp *= i
tmp %= (10**9+7)
return tmp
N,M = list(map(int,input().split()))
if abs(N-M) > 1:
print(0)
exit()
if N == M:
print((2*(factmod(N)*factmod(M))%(10**9+7)))
else:
print(factmod(N)*factmod(M)%(10**9+7)) |
p03282 | s009175403 | Wrong Answer | n = input()
k = int(input())
if n.count("1") == k:
print(1)
exit()
for i in range(k):
if n[i] != "1":
print(n[i])
exit()
|
p02995 | s100682557 | Accepted | import math
def lcm(x,y):
return (x*y)//math.gcd(x,y)
a,b,c,d=map(int,input().split())
bc=b//c
bd=b//d
bcd=b//lcm(c,d)
x=b-(bc+bd-bcd)
a=a-1
ac=a//c
ad=a//d
acd=a//lcm(c,d)
y=a-(ac+ad-acd)
print(x-y) |
p03804 | s746037094 | Accepted | def check():
N,M = map(int, input().split())
A = [input() for _ in range(N)]
B = [input() for _ in range(M)]
for i in range(N-M+1):
for j in range(N-M+1):
flag = True
for k in range(M):
if A[i+k][j:j+M] != B[k]:
flag = False
if flag:
return 'Yes'
return 'No'
print(check()) |
p02909 | s494693819 | Accepted | import itertools
import fractions
def main():
S = ['Sunny','Cloudy','Rainy']
s = input()
i = 0
while True:
if s == S[i]:
break
i += 1
print(S[(i+1)%3])
if __name__ == '__main__':
main() |
p02784 | s001864714 | Accepted | h,n = map(int,input().split())
a = [int(i) for i in input().split()]
sum_a = sum(a)
if h > sum_a:
ans = 'No'
else:
ans = 'Yes'
print(ans) |
p02933 | s058676737 | Wrong Answer | a = int(input())
input_s = input()
if 3200 <= a:
output_s = ("pink")
elif a <3200:
output_s = ("red")
print(output_s) |
p02813 | s807368987 | Wrong Answer | import itertools
N = int(input())
permu = [i+1 for i in range(N)]
s = 0
flag = False
P = tuple([int(i) for i in input().split(" ")])
Q = tuple([int(i) for i in input().split(" ")])
print(P)
for i, value in enumerate(itertools.permutations(permu)):
if value == P or value == Q:
# print(i)
if flag:
s -= i
else:
s += i
flag = True
print(abs(s))
|
p03612 | s762979526 | Accepted | N = int(input())
p = list(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
if p[N-1]==N:
ans+=1
print(ans) |
p02778 | s647462834 | Accepted | s=list(input())
for i in range(len(s)):
s[i]="x"
print("".join(s)) |
p03127 | s584490743 | Accepted | from math import gcd
def readinput():
n=int(input())
a=list(map(int,input().split()))
return n,a
def main(n,a):
ans=gcd(a[0],a[1])
for i in range(2,n):
ans=gcd(ans,a[i])
return ans
if __name__=='__main__':
n,a=readinput()
ans=main(n,a)
print(ans)
|
p03438 | s563202921 | Wrong Answer | n = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
sum_a = sum(A)
sum_b = sum(B)
ans = 'No'
if sum_a % 3 == 0 and sum_b % 3 == 0:
if abs(sum_a - sum_b) // 3 <= 2:
ans = 'Yes'
print(ans) |
p02727 | s035054261 | Accepted | X, Y, A, B, C = map(int, input().split())
p = list(map(int, input().split()))
q = list(map(int, input().split()))
r = list(map(int, input().split()))
p.sort(reverse=True)
q.sort(reverse=True)
r.sort(reverse=True)
p = p[:X]
q = q[:Y]
all = p + q + r
all.sort(reverse=True)
ans = sum(all[:X + Y])
print(ans)
|
p03698 | s419484452 | Accepted | S = list(input())
S.sort()
ans = True
for i in range(len(S)-1):
if S[i] == S[i + 1]:
ans = False
break
if ans:
print("yes")
else:
print("no") |
p02777 | s224658061 | Wrong Answer | N,M = map(str,input().split())
NN,MM = map(int,input().split())
ress = input()
if(ress == N):
NN = NN-1
elif(ress == M):
MM == MM-1
print(MM,NN)
|
p02823 | s620971648 | Wrong Answer | #agc041 a
n,a,b=map(int,input().split())
ans=0
if (b-a)%2==0:
ans=(b-a)/2
else:
left=b-1
right=n-a
ans=min(left,right)
print(int(ans)) |
p02836 | s112801666 | Accepted | import math
s=list(input())
N=len(s)
x=0
for i in range(0,N):
if s[i]!=s[N-1-i]:
x+=1
x=math.ceil(x/2)
print(x) |
p02778 | s046198011 | Wrong Answer | s = input()
a = 'x'
print('a' * len(s)) |
p03814 | s328686931 | Wrong Answer | s = input()
print(s[1:-1])
r_s = s[::-1]
if r_s.index("Z")==0:
print(len(s[s.index("A"):]))
else:
print(len(s[s.index("A"):-r_s.index("Z")])) |
p02689 | s791404098 | Accepted | n, m = map(int, input().split())
height = list(map(int, input().split()))
good = [1 for j in range(n)]
for i in range(m):
a,b = map(int, input().split())
if height[a-1] >= height[b-1]:
good[b-1] = 0
if height[a-1] <= height[b-1]:
good[a-1] = 0
ans = good.count(1)
print(ans) |
p02731 | s107765857 | Wrong Answer | l = int(input())
ans = 0
for i in range(l+1):
for j in range(l-i+1):
k = l-i-j
ans = max(ans,i*j*k)
print(ans) |
p02696 | s200919343 | Wrong Answer | A,B,N=map(int,input().split())
x=min(B,N)
ans=(A*x)//B-(A)*(x//B)
for i in range(B,10**12+1,B):
if i>N:
break
ans=max(ans,(A*i)//B-A*(i//B))
print(ans) |
p02786 | s851720255 | Accepted | import math
h = int(input())
hp = h
c = 0
ans = 0
while hp > 1:
hp = math.floor(hp/2)
c += 1
for i in range(0,c+1):
ans += 2 ** i
print(ans) |
p03433 | s625693512 | Accepted | n = int(input())
a = int(input())
if n%500<=a:
print('Yes')
else:
print('No') |
p02601 | s990193028 | Wrong Answer | A, B, C = map(int, input().split())
K = int(input())
for i in range(K):
if A > B:
B *= 2
elif B > C:
C *= 2
else:
break
if C > B > A:
print('Yes')
else:
print('No')
|
p02702 | s641513353 | Wrong Answer | from itertools import accumulate
from collections import defaultdict
S = list(input().rstrip())
r = 1
i=len(S)
acc=0
dd = defaultdict(int)
for s in S[::-1]:
acc+=r*int(s)
acc%=2019
r%=2019
r*=10
dd[acc]+=1
i-=1
ans=0
for i in dd.values():
ans+=(i*(i-1))//2
print(ans)
|
p02606 | s083890796 | Accepted | l, r, d = map(int, input().split())
count = 0
for i in range(l, r + 1):
if i % d == 0:
count += 1
print(count) |
p03252 | s345420690 | Wrong Answer | s = list(input())
t = list(input())
n = len(s)
s_par = [i for i in range(n + 1)]
t_par = [i for i in range(n + 1)]
def operation(x, par):
for i in range(n):
for j in range(i):
if x[i] == x[j]:
par[i] = par[j]
return par
if operation(s, s_par) == operation(t, t_par):
print('yes')
else:
print('No') |
p03795 | s692907370 | Accepted | n = int(input())
x = 0
y = 0
for i in range(1, n+1):
x += 800
if i % 15 == 0:
y += 200
print(x - y) |
p03109 | s834744459 | Accepted | S=input()
num=int(S[:4]+S[5:7]+S[8:])
if num<=20190430:
print("Heisei")
else:
print("TBD") |
p02683 | s473314239 | Accepted | n,m,x=map(int,input().split())
ans=999999999999999999
a=[0]*n
for i in range(n):
a[i]=list(map(int,input().split()))
for i in range(2**n):
t=[0]*m
temp=0
for j in range(n):
if (i>>j)&1:
temp=temp+a[j][0]
for k in range(m):
t[k]=t[k]+a[j][k+1]
if min(t)>=x:
ans=min(ans,temp)
if ans==999999999999999999:
print(-1)
else:
print(ans) |
p03495 | s482943008 | Accepted | #!/usr/bin/env python3
from collections import Counter
import sys
sys.setrecursionlimit(10**6)
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
c = Counter(a)
c = list(c.most_common())
# c = c.most_common()
len_c = len(c)
# print(len_c)
# print(c)
ans = 0
while(len_c-k > 0):
# print(len_c-k)
# print()
# print(k)
i, j = c.pop()
len_c -= 1
ans += j
print(ans)
|
p03796 | s615767203 | Wrong Answer | N=int(input())
power=1
for i in range(1,N+1):
power=power*i
print(power%(10*9+7))
|
p02623 | s500443103 | Accepted | from bisect import bisect_right
n, m, k = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
def ruisekiwa(List):
for i in range(1, len(List)):
List[i] += List[i - 1]
return List
arui = ruisekiwa(a)
brui = ruisekiwa(b)
arui.insert(0, 0)
brui.insert(0, 0)
ans = 0
for i in range(n + 1):
if arui[i] > k:
break
j = bisect_right(brui, k - arui[i])
ans = max(ans, i + j - 1)
print(ans) |
p03309 | s553893584 | Accepted | import sys
import math
def resolve():
N = int(input())
A = list(map(int, input().split(" ")))
Adiff = sorted([a - i for i, a in enumerate(A)])
if N % 2 == 0:
print(min(
sum([abs(ad - Adiff[N//2]) for ad in Adiff]),
sum([abs(ad - Adiff[N//2+1]) for ad in Adiff])
))
else:
print(sum([abs(ad - Adiff[N//2]) for ad in Adiff]))
if '__main__' == __name__:
resolve() |
p02972 | s701959476 | Accepted | n=int(input())
a=list(map(int,input().split()))
ans=[0 for _ in range(n+1)]
t=[]
S=0
for i in range(n):
b=n-i
c=(n-i)*2
ch=0
while c<=n:
ch+=ans[c]
c+=b
if ch%2==0:
if a[b-1]==1:
ans[b]+=1
S+=1
t.append(str(b))
else:
if a[b-1]==0:
ans[b]+=1
S+=1
t.append(str(b))
print(S)
if S>0:
print(' '.join(t))
|
p02578 | s334504889 | Wrong Answer | n = int(input())
l = list(map(int, input().split()))
l.reverse()
count = 0
for i in range(len(l) - 1):
if l[i] > l[i + 1]:
count += abs(l[i] - l[i + 1])
print(count)
|
p03711 | s043614638 | Wrong Answer | print("No" if 2 in [int(x) for x in input().split()] else "Yes") |
p02789 | s997393306 | Wrong Answer | n, m = (int(x) for x in input().split())
if n == m:
print('Yes')
else:
print('no') |
p03745 | s916927125 | Wrong Answer | n=int(input())
a=list(map(int,input().split()))
ans=0
i=1
while i+1<n:
if a[i-1]<=a[i]<=a[i+1] or a[i-1]>=a[i]>=a[i+1]: i+=1
else:
ans+=1
i+=2
print(ans+1) |
p02725 | s847825759 | Accepted | K,N = list(map(int, input().split()))
A = list(map(int, input().split()))
max = 0
for i in range(N):
if i == N-1:
if max < K - (A[i]-A[0]):
max = K - (A[i]-A[0])
else:
if max < A[i+1]-A[i]:
max = A[i+1]-A[i]
print(K-max) |
p03617 | s375378939 | Wrong Answer | q , h , s , d = map(int,input().split())
n = int(input())
qb = q*4
hb = h*2
db = d/2
if min(qb,hb,db,s) != db:
print(n*min(qb,hb,s))
elif min(qb,hb,db,s) == db:
if n % 2 == 0:
print(n*db)
elif n % 2 == 1:
ans = (n//2) * d
ans += min(qb,hb,s)
print(ans) |
p03109 | s469327256 | Accepted | S = list(map(int, input().split('/')))
if S[0] > 2019:
print('TBD')
elif S[0] == 2019 and S[1] > 4:
print('TBD')
else:
print('Heisei') |
p02597 | s352739079 | Accepted | N = int(input())
S = input()
r = S.count('R')
w = S.count('W')
if r == N or r == 0:
print(0)
exit()
a = S[:r].count('W')
print(a) |
p02947 | s569257529 | Wrong Answer | def kaijyou(x):
a=1
for i in range(x):
a*=i
return a
cnt=0
n=int(input())
x=[input() for i in range(n)]
y=set(x)
for i in y:
cnt+=kaijyou(x.count(i))
print(cnt) |
p02768 | s152031928 | Accepted | from functools import reduce
def nCr(n,r,DIV):
# X/Y mod DIV == X*Y**(DIV-2)
X=reduce(lambda x,y:x*y%DIV,range(n-r+1,n+1))
Y=reduce(lambda x,y:x*y%DIV,range(1,r+1))
return X*pow(Y,DIV-2,DIV)%DIV
DIV=10**9+7
n,a,b=map(int,input().split())
ans=pow(2,n,DIV)-1
ans-=nCr(n,a,DIV)
ans-=nCr(n,b,DIV)
print(ans%DIV) |
p03285 | s716581780 | Accepted | n = int(input())
for i in range(n//4 + 1):
if (n-4*i)%7 == 0:
print('Yes')
exit()
print('No')
|
p02881 | s813199414 | Wrong Answer | import math
N = int(input())
min_move_count = 10**7
for i in range(1, int(math.sqrt(N)) + 1):
if N % i == 0:
move_count = i + (N // i) - 2
if move_count < min_move_count:
min_move_count = move_count
ans = min_move_count
print(ans)
|
p03555 | s298640962 | Accepted | print(("NO","YES")[input()==input()[::-1]]) |
p03042 | s134432960 | Accepted | s=list(input())
s1="".join(s[:2])
s2="".join(s[2:])
if 0<int(s1)<=12 and 0<int(s2)<=12:
print("AMBIGUOUS")
elif 0<int(s1)<=12 and (int(s2)>12 or int(s2)==0):
print("MMYY")
elif 0<int(s2)<=12 and (int(s1)>12 or int(s1)==0):
print("YYMM")
else:
print("NA") |
p03544 | s681101571 | Accepted | n = int(input())
l = [0] * (n+1)
l[0] = 2
l[1] = 1
if n == 1:
ans = l[1]
else:
for i in range(2, n+1):
l[i] = l[i-1] + l[i-2]
ans = l[-1]
print(ans) |
p03632 | s073941624 | Accepted | A,B,C,D = map(int, input().split())
a = []
b = []
for i in range(A,B+1):
a.append(i)
for i in range(C,D+1):
b.append(i)
print(max(len(set(a)&set(b))-1,0)) |
p02987 | s915538366 | Wrong Answer | s = input()
if(s[0]==s[1])and(s[2]==s[3]):
print("Yes")
elif(s[1]==s[2])and(s[0]==s[3]):
print("Yes")
elif(s[1]==s[3])and(s[0]==s[2]):
print("Yes")
elif(s[0]==s[1])and(s[2]==s[3])and(s[1]==s[2]):
print("No")
else:
print("No") |
p03434 | s807165856 | Wrong Answer | n=int(input())
a=sorted(map(int,input().split()))
A=0
B=0
for i in range(n):
if i%2 ==1:
A += a[i]
else:
B += a[i]
print(A-B) |
p02631 | s498947960 | Wrong Answer | N=int(input())
a=list(map(int,input().split()))
ans=[['']*30 for _ in range(N)]
i=29
while True:
curbit=[aa%2 for aa in a]
s=sum(curbit)
if s%2==0:
for j in range(N):
ans[j][i]=str(curbit[j])
else:
for j in range(N):
ans[j][i]=str(0 if curbit[j] else 1)
if s==0:
break
a=[aa//2 for aa in a]
i-=1
print(' '.join([str(int(''.join(aa),2)) for aa in ans])) |
p04029 | s973266863 | Wrong Answer | n = int (input())
result =0
for i in range(1,n):
result =result +i
print (result) |
p03495 | s176511647 | Accepted | N,K = list(map(int,input().split()))
A = list(map(int,input().split()))
Asort = sorted(A)
from collections import Counter
c = Counter(A)
keys, values = zip(*c.most_common())
ans = 0
N = len(keys)
for i in range(K,N):
ans += values[i]
print(ans) |
p03416 | s544087819 | Accepted | a,b=map(int,input().split())
cnt=0
for i in range(a,b+1):
ii=str(i)
if ii[-1]!="0":
flg=True
for i in range(2):
if ii[i] != ii[-i-1]:
flg=False
if flg:
cnt+=1
print(cnt) |
p02910 | s045920550 | Wrong Answer | S = input()
odd = list(S[::2])
even = list(S[1::2])
xx = "No"
x1 = ""
x2 = ""
check = 0
check2 = 0
for i in range(len(odd)):
if odd[i] == "R" or odd[i] == "U" or odd[i] == "D":
check += 1
if check == len(odd):
x1 = "Y"
for i in range(len(even)):
if even[i] == "L" or "U" or "D":
check2 += 1
if check2 == len(even):
x2 = "Y"
if x1 and x2 == "Y":
xx = "Yes"
print(xx) |
p03059 | s950467412 | Wrong Answer | A,B,T=list(map(int, input().split()))
n=T//A
print((n*(n+1)//2)*B) |
p02847 | s908319680 | Accepted | S = input()
if S == 'SUN':
ans = 7
elif S == 'MON':
ans = 6
elif S == 'TUE':
ans = 5
elif S == 'WED':
ans = 4
elif S == 'THU':
ans = 3
elif S == 'FRI':
ans = 2
elif S == 'SAT':
ans = 1
print(ans) |
p03951 | s624896154 | Accepted | N=int(input())
a=input()
b=input()
ans = N
for i in range(N):
if a[i:] == b[:N-i]:
break
else:
ans += 1
print(ans) |
p03017 | s155700264 | Accepted | def main():
N, A, B, C, D = (int(i) for i in input().split())
S = input()
if "##" in S[A:C] or "##" in S[B:D]:
return print("No")
if D < C and (S[D-2] == "#" or S[D] == "#"):
if (S[B-2] == "#" or S[B] == "#") and "..." not in S[B-1:D]:
return print("No")
print("Yes")
if __name__ == '__main__':
main()
|
p03633 | s322394976 | Wrong Answer | def main():
from fractions import gcd
from functools import reduce
from operator import mul
n, *t = map(int, open(0).read().split())
g = reduce(gcd, t)
ans = reduce(mul, t) // g
print(ans)
if __name__ == '__main__':
main()
|
p02594 | s225995727 | Wrong Answer | x=int(input())
if(x<=40 and x>=-40):
print('Yes')
else:
print('No') |
p02970 | s933729187 | Accepted | n,d=map(int,input().split())
a=n/(2*d+1)
print(int(a) if a==a//1 else int(a)+1)
|
p03001 | s437692127 | Wrong Answer | import math
def main():
t = [int(t)for t in input().split()]
w,h,x,y = t[0],t[1],t[2],t[3]
left,right = x, w-x
top, bottom = y, h-y
s_ = [left*h,right*h,top*w,bottom*w]
s_ = sorted(s_)
print(s_[2],1 if s_[2]==s_[3] else 0)
if __name__ == "__main__":
main() |
p02640 | s836947614 | Accepted | a = list(map(int,input().split()))
if a[1]%2 == 1:
print('No')
else:
if a[0]*2<= a[1] and a[1] <= a[0]*4:
print('Yes')
else:
print('No') |
p03011 | s672392508 | Wrong Answer | num_list = list(map(int, input().split()))
s_List = sorted(num_list)
print(num_list[0] + num_list[1])
|
p02848 | s569106400 | Accepted | Num=int(input())
Str=input()
Letters =list('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'.split())
Ans=''
for i in range(len(Str)):
Index = Letters.index(Str[i])
if Index + Num < 26:
Ans += Letters [Index + Num]
else:
Diff = (Index + Num) - 26
Ans += Letters [Diff ]
print(Ans) |
p02584 | s276131437 | Accepted | from sys import stdin
def main():
input = lambda: stdin.readline()[:-1]
X, K, D = map(int, input().split())
d, m = divmod(X, D)
if abs(d) >= K:
print(abs(abs(X) - (K * D)))
else:
if (K - d) % 2:
print(D - m)
else:
print(m)
main()
|
p02970 | s808198779 | Accepted | def main():
n, d = list(map(int, input().split()))
a, s = divmod(n, (d*2)+1)
print(a) if s == 0 else print(a+1)
if __name__ == '__main__':
main() |
p02556 | s162163840 | Accepted | n = int(input())
z = [0]*n
w = [0]*n
for i in range(n):
x, y = map(int, input().split())
z[i] = x+y
w[i] = x-y
a = max(z)
b = min(z)
c = max(w)
d = min(w)
print(max(a-b, b-a, c-d, d-c)) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.