problem_id stringclasses 428 values | submission_id stringlengths 10 10 | status stringclasses 2 values | code stringlengths 5 816 |
|---|---|---|---|
p02600 | s362988949 | Accepted | x = int(input())
for i in range(8, 0, -1):
j = 8 - i
num = 400 + 200 * j
if num <= x < num + 200:
print(i)
exit() |
p03252 | s082460724 | Accepted | S = input()
T = input()
ok = True
RS = {}
RT = {}
for i in range(len(S)):
s = S[i]
t = T[i]
if s in RS:
if RS[s] != t:
ok = False
if t in RT:
if RT[t] != s:
ok = False
RS[s] = t
RT[t] = s
if ok:
print('Yes')
else:
print("No") |
p03160 | s522139342 | Wrong Answer | INF = 10**6
N = int(input())
h = [int(i) for i in input().split()] + [0, 0]
dp = [INF] * 100010
dp[0] = 0
for i in range(N):
dp[i+1] = min(dp[i+1], dp[i]+abs(h[i+1]-h[i]))
dp[i+2] = min(dp[i+2], dp[i]+abs(h[i+2]-h[i]))
print(dp[N-1]) |
p02621 | s983329051 | Accepted | num=int(input())
ans=num+num**2+num**3
print(ans) |
p03487 | s480118503 | Accepted | from collections import*
_, *a = map(int, open(0).read().split())
print(sum(v - i if i < v else v if i > v else 0 for i, v in Counter(a).items())) |
p03000 | s794523030 | Wrong Answer | n,x=map(int,input().split())
Y = list(map(int,input().split()))
Z = [0]*n
a = 0
for i in range(n):
a +=Y[i]
Z[i]=a
import bisect
print(1+bisect.bisect_left(Z,x)) |
p03210 | s210153912 | Wrong Answer | n=int(input())
if(3<=n<=7 and n%2==1):print("Yes")
else: print("No") |
p02720 | s714342378 | Accepted | import queue
k=int(input())
q=queue.Queue()
for i in range(1,10):
q.put(i)
for i in range(k):
x=q.get()
if x%10!=0:
q.put(10*x+(x%10)-1)
q.put(10*x+(x%10))
if x%10 !=9:
q.put(10*x+(x%10)+1)
print(x) |
p02664 | s120235237 | Wrong Answer | #!/usr/bin/env python
"""AtCoder nomura 2020: B - Postdocs -
https://atcoder.jp/contests/nomura2020/tasks/nomura2020_b
"""
__author__ = 'bugttle <bugttle@gmail.com>'
def calc(t):
return t.count('D') + t.count('PD')
def main():
T = input()
t = T.replace('??', 'DD').replace('?D', 'DD').replace('D?', 'DD').replace('P?', 'PD').replace('?P', 'DP')
print(t)
if __name__ == '__main__':
main()
|
p02862 | s306683211 | Wrong Answer | #coding:utf-8
x, y = map(int, input().split())
mod = 10**9 + 7
f = [1]
for i in range(10**6):
f.append(f[-1] * (i+1) % mod)
def nCr(n, r):
return f[n] * pow(f[r], mod-2, mod) * pow(f[n-r], mod-2, mod) % mod
def main():
if (x + y) % 3 != 0 or (x + y) // 3 < abs(x - y):
print(0)
return
n = (x + y) // 3
r = n // 2 + abs(x - y) // 2
print(nCr(n, r))
return
main() |
p02660 | s806236744 | Accepted | N = int(input())
import collections
import math
cnt = 0
def prime_factorize(n):
a = []
while n % 2 == 0:
a.append(2)
n //= 2
f = 3
while f * f <= n:
if n % f == 0:
a.append(f)
n //= f
else:
f += 2
if n != 1:
a.append(n)
return a
c = collections.Counter(prime_factorize(N))
v = c.values()
for i in v:
cnt += math.floor((math.sqrt(8*i+1)-1)/2)
print(cnt) |
p03038 | s933252436 | Accepted | n, m = map(int, input().split())
a = list(map(int, input().split()))
bc = [list(map(int, input().split())) for _ in range(m)]
a.sort()
bc.sort(key=lambda x:x[1], reverse=True)
i = 0
j = 0
while i < n and j < m:
if a[i] < bc[j][1]:
a[i] = bc[j][1]
i += 1
bc[j][0] -= 1
if bc[j][0] == 0:
j += 1
else:
break
print(sum(a)) |
p03241 | s643073238 | Accepted | N,M = map(int,input().split())
m = 1
ds = set()
while m*m <= M:
if M%m==0:
ds.add(m)
ds.add(M//m)
m += 1
ans = 1
for d in ds:
if d*N > M: continue
ans = max(ans,d)
print(ans) |
p03261 | s960301174 | Wrong Answer | N = int(input())
Word = []
tail = ""
for i in range(N):
W = list(input())
tail = W[-1]
if i != 0:
if tail != W[0] or (W in Word):
print("No")
exit()
Word.append(W)
print("Yes") |
p02970 | s886604719 | Accepted | n,d=map(int,input().split())
p=0
while n>0:
n-=(d*2+1)
p+=1
print(str(p)) |
p02601 | s744610271 | Wrong Answer | def main():
a, b, c = map(int, input().split())
k = int(input())
for i in range(1, k+2):
if a < b and b < c:
print("Yes")
return 0
elif i == k+1:
print("No")
return 0
elif c < a or c < b:
c = c * 2
elif b < a:
b = b * 2
main() |
p03146 | s948813134 | Accepted | s = int(input())
lst = [s]
i = 1
while True:
if s % 2 == 0:
s = s // 2
else:
s = 3 * s + 1
i += 1
if s in lst:
print(i)
break
else:
lst.append(s)
|
p02640 | s017087357 | Accepted | #!/usr/bin/env python3
import sys
import collections
input = sys.stdin.readline
a,b= map(int,input().split())
if b %2 ==0 :
B=b//2
if a<=B and B<=2*a:
print('Yes')
sys.exit()
else:
print('No')
sys.exit()
else:
print("No")
sys.exit()
|
p02556 | s051809820 | Wrong Answer | N = int(input())
xy = [list(map(int,input().split())) for _ in range(N)]
ma = 0
mi = float('inf')
for x,y in xy:
ma = max(ma,abs(x-y))
mi = min(mi,abs(x-y))
ans = ma - mi
ma = 0
mi = float('inf')
for x,y in xy:
ma = max(ma,x+y)
mi = min(mi,x+y)
ans = max(ans, ma - mi)
print(ans) |
p03657 | s936127040 | Wrong Answer | A, B = map(int,input().split())
if (A+B)%3==0: print('Possible')
else: print('Impossible') |
p03075 | s484060714 | Accepted | import sys
A = [int(input()) for _ in range(5)]
k = int(input())
for i in range(5):
for j in range(i,5):
if A[j]-A[i]>k:
print(":(")
sys.exit()
else:
print("Yay!") |
p02659 | s540811915 | Wrong Answer | import math
a,b = map(float, input().split())
sum=a*b
result=math.floor(sum)
print(int(result)) |
p03998 | s167686394 | Accepted | # solution
data = {p: input() for p in 'abc'}
card = 'a'
while data[card]:
new_card, data[card] = data[card][0], data[card][1:]
card = new_card
print(card.upper()) |
p03695 | s131926820 | Accepted | N = int(input())
As = list(map(int,input().split()))
mi=0
ma=0
r = []
for i in range(N):
rate = As[i]//400
if rate < 8:
if not rate in r:
r.append(rate)
mi += 1
ma += 1
else:
ma+=1
if mi == 0:
mi =1
print(mi,ma) |
p02918 | s994956512 | Wrong Answer | n,k = map(int,input().split())
s = input()
edge,inside,cnt,on = 0,0,0,0
if s[0]=='L':
edge = 1
else:
on = 1
if s[-1]=='L':
edge = 1
temp = ''
for i in range(n):
if temp=='L' and s[i]=='R':
if on:
inside += 1
else:
on = 1
elif temp==s[i]:
cnt += 1
temp = s[i]
if inside>=k:
print(min(k*2+cnt,n-1))
else:
print(min(inside*2+edge+cnt,n-1)) |
p02665 | s567754663 | Accepted | n = int(input())
a = list(map(int, input().split()))
if n==0:
if a[0]==1:
print(1)
else:
print(-1)
exit()
ma = [None]*n
ma[0] = 1
for i in range(n-1):
ma[i+1] = (ma[i]-a[i])*2
node = a[-1]
ans = node
for i in range(n-1, -1, -1):
mi = (node+1)//2
if ma[i]-a[i]<mi:
print(-1)
exit()
node = min(ma[i]-a[i], node) + a[i]
ans += node
print(ans) |
p03434 | s189602402 | Accepted | N = int(input())
a = sorted(list(map(int, input().split())))[::-1]
f = int(0)
Ali = int(0)
Bob = int(0)
for i in range(N):
if f == 0:
Ali = Ali + a[0]
del a[0]
f = 1
else:
Bob = Bob + a[0]
del a[0]
f = 0
print(Ali-Bob)
|
p02987 | s362060026 | Accepted | s = input()
a = set(s)
if len(a) != 2:
print('No')
exit()
import collections
c = collections.Counter(s)
if c.most_common()[0][1] == 2:
print('Yes')
else:
print('No') |
p03814 | s413253621 | Accepted | s=input()
s_r=s[::-1]
f=s.index("A")
l=s_r.index("Z")
l_r=len(s)-1-l
print(l_r-f+1) |
p02753 | s986186045 | Accepted | S = input()
if S == "AAA" or S == "BBB":
print("No")
else:
print("Yes") |
p02624 | s174794282 | Accepted | def calc(n, a, d):
return (n * (2 * a + (n - 1) * d)) // 2
n = int(input())
ans = 0
for i in range(1, n + 1):
n_ = (n // i)
d, a = i, i
sm = calc(n_, a, d)
ans += sm
print(ans)
|
p03359 | s885492056 | Accepted | a, b = map(int, input().split())
print(a - (a > b))
|
p02547 | s547707347 | Accepted | n = int(input())
def count():
count = 0
result = ''
for i in range(n):
d1, d2 = map(int, input().split())
if result == 'Yes':
continue
if d1 == d2:
count += 1
if count == 3:
result = 'Yes'
else:
count = 0
result = 'No'
return result
print(count()) |
p03720 | s941266309 | Accepted | n,m=map(int,input().split())
a_s=[]
b_s=[]
for i in range(m):
a,b=map(int,input().split())
a_s.append(a)
b_s.append(b)
for i in range(1,n+1):
print(a_s.count(i)+b_s.count(i))
|
p02675 | s237195248 | Wrong Answer | def yomikata(N):
N_firstdigit=N%10
if N_firstdigit==3:
print("bon")
elif N_firstdigit==0 or 1 or 6 or 8:
print("pon")
else:
print("hon")
N = int(input())
yomikata(N) |
p03035 | s494459411 | Accepted | A,B = list(map(int,input().split()))
if A >=13:
print(B)
elif A >= 6 and A <=12:
print(int(B/2))
else:
print(0) |
p02756 | s198409555 | Wrong Answer | s=[input()]
q=int(input())
for i in range(q):
aa=list(map(str,input().split()))
if len(aa)==1:
s.reverse()
else:
if aa[1]=="1":
s.insert(0,aa[2])
else:
s.append(aa[2])
print(*s,sep='') |
p02688 | s320399578 | Accepted | (n, k) = map(int, raw_input().split())
snakes = [[] for i in xrange(n + 1)]
for i in xrange(k):
s = int(raw_input())
ns = map(int, raw_input().split())
for num in ns:
snakes[num].append(s)
tot = 0
for i in xrange(1, n + 1):
if not snakes[i]:
tot += 1
print tot
|
p03061 | s671560589 | Wrong Answer | n=int(input())
a=list(map(int,input().split()))
m=min(a)
c=0
for i in range(1,m):
cnt=0
for j in range(n):
if a[j]%i==0:
cnt+=1
if cnt>=n-1:
c=i
print(c) |
p03910 | s035479523 | Accepted | n = int(input())
ans = []
a = 0
for i in range(1,n+1):
a += i
ans.append(i)
if a >= n:
break
a -= n
for x in ans:
if x != a:
print(x) |
p02684 | s266589754 | Accepted | n,k=map(int,input().split())
A=list(map(int,input().split()))
V=[0]*n
V[0]=0
a=0
c=0
for i in range(k):
a=A[a]-1
if V[a]!=0:
break
V[a]=i+1
if i==k-1:
print(a+1)
exit()
else:
k=(k-V[a])%(i+1-V[a])
for i in range(k):
a=A[a]-1
if k==0:
print(a+1)
else:
print(a+1)
|
p02779 | s525649796 | Accepted | n=int(input())
a=list(map(int,input().split()))
a=len(list(set(a)))
if n==a:
print('YES')
else:
print('NO') |
p02946 | s940935957 | Accepted | def solve():
N, M = map(int, input().split())
l = [i for i in range(M-(N-1), M+(N-1)+1)]
print(*l)
# print(solve())
# def solve()が@return voidのとき
solve() |
p03035 | s150949807 | Accepted | line = input()
numbers = [int(n) for n in line.split()]
if numbers[0] <= 5:
predicted_value = 0
elif numbers[0] <= 12:
predicted_value = numbers[1]//2
else:
predicted_value = numbers[1]
print(predicted_value) |
p03161 | s017993326 | Accepted | N,K = map(int,input().split())
lh = list(map(int,input().split()))
dp = [float("inf")]*N
dp[0] = 0
for i in range(N):
for k in range(i+1,min((i+K+1),N)):
dp[k] = min(dp[k],(dp[i]+abs(lh[i]-lh[k])))
print(dp[-1])
|
p02982 | s707424397 | Accepted | import math
n, d = map(int, input().split())
xs = [list(map(int, input().split()))for _ in range(n)]
c = 0
check = []
for i in range(n):
check.append(i)
for j in range(n):
if i == j or j in check:
continue
else:
a = xs[i][:]
b = xs[j][:]
length = math.sqrt(sum([(n-m)**2 for n,m in zip(a,b)]))
if length%1 == 0:
c += 1
print(c) |
p02555 | s606632493 | Accepted | memo = dict()
def dp(n):
if n == 0: return 1
if n in memo: return memo[n]
ans = 0
mod = pow(10, 9) + 7
for i in range(n-2):
ans = (ans + dp(i)) % mod
memo[n] = ans
return ans
s = int(input())
ans = dp(s)
print(ans) |
p03804 | s774696052 | Accepted | N,M = map(int,input().split())
A = list()
B = list()
for i in range(N):
A.append(input())
for i in range(M):
B.append(input())
def check(posx, posy):
for y in range(M):
for x in range(M):
if not B[y][x] == A[y + posy][x + posx]:
return False
return True
for y in range(N - M + 1):
for x in range(N - M + 1):
if check(x,y):
print("Yes")
exit()
print("No") |
p03211 | s012691982 | Accepted | s=input()
n=len(s)
list=[]
for i in range(n-2):
list.append(''.join(s[i:i+3]))
ans=[]
for l in list:
ans.append(abs(int(l)-753))
print(min(ans)) |
p03281 | s997523736 | Wrong Answer | n=int(input())
ans=0
for i in range(1,n+1,2):
count=0
for j in range(1,i+1):
if n%j==0:
count=count+1
if count==8:
ans=ans+1
else:
print(ans)
|
p02861 | s950683589 | Accepted | from sys import stdin
#input = stdin.readlines
import math
def main():
N = int(input())
p = [list(map(int, input().split())) for _ in range(N)]
s = 0.0
for i in range(N - 1):
for j in range(i + 1, N):
s += math.sqrt((p[i][0] - p[j][0])**2 + (p[i][1] - p[j][1])**2)
print(s*2/N)
if __name__ == '__main__':
main() |
p02797 | s707945156 | Accepted | N, K, S = map(int, input().split())
ans = [0]*N
T = 10**9
if T == S:
T = 10**9 - 1
for i in range(N):
if i < K:
ans[i] = S
else:
ans[i] = T
print(" ".join(map(str, ans)))
|
p03997 | s836255907 | Accepted | a=input()
b=input()
h=input()
print((int(a)+int(b))*int(h)//2) |
p02768 | s972270182 | Accepted | from math import factorial
M = 10**9 + 7
n, a, b = map(int, input().split())
r = pow(2, n, M) - 1
c = 1
for i in range(b):
c = c * (n - i) % M
if i + 1 == a:
r -= c * pow(factorial(a), M - 2, M)
a = b
print(r % M)
|
p04005 | s093211527 | Accepted | a = list(map(int,input().split()))
f = 0
for i in a:
if i % 2 == 0:
f = 1
if f:
ans = 0
else:
tmp = []
for i in range(2):
for j in range(i+1,3):
tmp.append(a[i] * a[j])
#print(tmp)
ans = min(tmp)
print(ans)
|
p03017 | s205416656 | Accepted | n,a,b,c,d=map(int,input().split())
s=input()
if d>c:
if "##" in s[b-1:d] or "##" in s[a-1:c]:
print("No")
else:
print("Yes")
elif c>d:
if ("##" not in s[a-1:c]) and ("..." in s[b-2:d+1]):
print("Yes")
else:
print("No") |
p02570 | s891507173 | Accepted | d, t, s = map(int, input().split())
if d <= t*s:
print("Yes")
else:
print("No") |
p03309 | s226662047 | Accepted | # coding: utf-8
import sys
import numpy as np
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
N = ir()
A = np.array(lr(), dtype=np.int32)
A -= np.arange(1, N+1)
answer = np.abs(A - int(np.median(A))).sum()
print(answer)
|
p03711 | s731239909 | Wrong Answer | list1 = [1, 3, 5, 7, 8, 10, 12]
list2 = [4, 6, 9, 11]
list3 = [2]
num = map(int, input().split())
if num in list1 or num in list2 or num in list3:
print('Yes')
else:
print('No') |
p03162 | s939679376 | Accepted | n = int(input())
arr = [[int(i) for i in list(input().split())] for j in range(n)]
for i in range(1,n):
arr[i][0] += max(arr[i-1][1], arr[i-1][2])
arr[i][2] += max(arr[i-1][1], arr[i-1][0])
arr[i][1] += max(arr[i-1][0], arr[i-1][2])
print(max(arr[n-1])) |
p02918 | s748472467 | Accepted | # ABC-140-D
N, K = map(int, input().split())
S = input()
ans = 0
#初期値を確認する。
for i in range(0, len(S)-1):
if S[i] == S[i+1]:
ans += 1
ans = min(N-1, ans + 2 * K)
print(ans) |
p02629 | s753327994 | Accepted | N = int(input())
def num2alpha(num):
if num<=26:
return chr(64+num)
elif num%26==0:
return num2alpha(num//26-1)+chr(90)
else:
return num2alpha(num//26)+chr(64+num%26)
print(num2alpha(N).lower()) |
p03637 | s085230202 | Accepted | n = int(input())
*a, = map(int, input().split())
*b, = filter(lambda x: x%4 != 0, a)
mul_4 = n-len(b)
*c, = filter(lambda x: x%2 != 0, b)
mul_2 = (len(b)-len(c))
k = n-(mul_4+mul_2)
if mul_2 == 0 and k <= mul_4+1:
print("Yes")
elif k <= mul_4:
print("Yes")
else:
print("No")
|
p02720 | s669409218 | Wrong Answer | K = int(input())
l = [x for x in range(1,11)]
if K <= 10:
print(K)
for i in range(1,K-9):
num = 10+ 9 *((i) // 3) + i - (i//3)
if l[i+9-1] % 10 == 0:
l.append(l[i+9-1]+1)
else:
l.append(num)
print(l[K-1])
|
p03160 | s980964290 | Wrong Answer | n=int(input())
a=list(map(int,input().split()))
dp=[-1]*n
dp[0]=0
dp[1]=abs(a[1]-a[0])
for i in range(2,len(a)):
dp[i]=min(dp[i-2]+abs(a[i]-a[i-2]),dp[i-1]+abs(a[i]-a[i-1]))
print(dp)
print(dp[-1])
|
p03803 | s327060497 | Accepted | a,b=map(int,input().split())
l=[2,3,4,5,6,7,8,9,10,11,12,13,1]
if l.index(a) < l.index(b):
print('Bob')
elif l.index(a) > l.index(b):
print('Alice')
else:
print('Draw') |
p02909 | s559211399 | Accepted | S = input()
w = ""
if S == "Sunny":
w = "Cloudy"
if S == "Cloudy":
w = "Rainy"
if S == "Rainy":
w = "Sunny"
print(w) |
p02688 | s087726960 | Accepted | n,k=map(int,input().split())
a=[]
for i in range(k):
d=int(input())
a+=list(map(int,input().split()))
a=set(a)
print(n-len(a)) |
p02723 | s901591276 | Accepted | s = input()
if s[2] == s[3] and s[4] == s[5]:
print("Yes")
else:
print("No") |
p03548 | s010570432 | Accepted | X,Y,Z=map(int,input().split())
p=1;t=Y+2*Z
while t<X:
t=t+Y+Z
if t>X:
break
#print(t)
p=p+1
print(p) |
p03086 | s807365745 | Wrong Answer | S = input()
ACGT = ['A','C','G','T']
anss = []
for i in range(len(S)):
tmp_s = ""
if S[i] in ACGT:
tmp_s += S[i]
for j in range(i+1,len(S)-i):
if S[j] in ACGT:
tmp_s += S[j]
else:
break
anss.append([len(tmp_s),tmp_s])
anss.sort()
print(anss[-1][0]) |
p03773 | s724862313 | Wrong Answer | a, b = map(int, input().split())
print(a+b if a+b<=24 else a+b-24) |
p03377 | s377178689 | Accepted | a,b,x=map(int,input().split())
print('YES' if a<=x and a+b>=x else 'NO') |
p03013 | s056678263 | Accepted | n,m = map(int, input().split())
a = set([int(input()) for _ in range(m)])
p = [0]*(n+1)
p[0] = 1
if 1 not in a:
p[1] = 1
t = 1000000007
for i in range(2, n+1):
if i in a:
continue
s = p[i-1] + p[i-2]
s = s%t
p[i] = s
print(p[n])
|
p03281 | s320476083 | Accepted | n = int(input())
ans = 0
for i in range(1, n + 1):
if i % 2 == 1:
cnt = 0
for j in range(1, i + 1):
if i % j == 0:
cnt += 1
if cnt == 8:
ans += 1
print(ans) |
p03262 | s163963997 | Accepted | import math
from functools import reduce
def gcd(numbers):
return reduce(math.gcd, numbers)
n, x = map(int, input().split())
xn = list(map(int, input().split()))
xn = [abs(i-x) for i in xn]
print(gcd(xn))
|
p03797 | s503529783 | Accepted | n,m = map(int,input().split())
if n*2 >= m:
print(m//2)
else:
print(n + (m-n*2)//4) |
p02996 | s643074983 | Accepted | N=int(input())
A=[list(map(int,input().split())) for _ in range(N)]
A.sort(key=lambda x:x[1])
ans=0
for i in range(N):
if ans+A[i][0]>A[i][1]:
print('No')
exit()
ans+=A[i][0]
print('Yes') |
p02657 | s038663772 | Accepted | def main():
a, b = (int(i) for i in input().split())
print(a*b)
if __name__ == '__main__':
main()
|
p02982 | s849604238 | Wrong Answer | n,d = map(int,input().split())
x = [list(map(int,input().split())) for _ in range(n)]
ans = 0
for i in range(n-1):
for j in range(i+1,n):
sub = 0
for k in range(d) :
sub += (x[i][k]-x[j][k])**2
sub = sub**0.5
print(sub)
if sub.is_integer() :
ans += 1
print(ans)
|
p03324 | s000322098 | Wrong Answer | D, N = map(int, input().split())
print(N*100**D) |
p03860 | s849546276 | Wrong Answer | vowelslist=["a","e","i","o","u"]
print(input() in vowelslist) |
p03720 | s694762175 | Wrong Answer | N,M=map(int,input().split())
city_l=[]
for i in range(M):
a,b=map(int,input().split())
city_l.append(a)
city_l.append(b)
print(city_l)
for i in range(1,N+1):
print(city_l.count(i)) |
p02731 | s574548543 | Wrong Answer | import math
from decimal import Decimal
if __name__ == "__main__":
L = int(input())
hoge = L / 3
ret = (hoge* 10**6) **3
print(ret)
|
p04005 | s377695863 | Accepted | import math
a, b ,c = map(int, input().split())
lis = [a, b, c]
lis = sorted(lis)
t = lis[0] * lis[1]
b = math.ceil(lis[2]/2)
s = math.floor(lis[2]/2)
print(t*b - t*s) |
p02582 | s793898876 | Accepted | s=input()
if ("RRR" in s):
print(3)
elif ("RR" in s):
print(2)
elif ("R" in s):
print(1)
else:
print(0)
|
p03067 | s543200812 | Accepted | import sys
sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7
def resolve():
a, b, c = map(int, input().split())
print("Yes") if a < c < b or b < c < a else print("No")
if __name__ == '__main__':
resolve()
|
p02629 | s214437756 | Wrong Answer | n=int(input())
cnt=1##文字数
tmp=26
while n>tmp:
cnt+=1
tmp+=26**cnt
num=n-(tmp//26)
alp=["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"]
if n<=26:
ans=alp[n-1]
print(ans)
else:
ans=["0"]*cnt
for i in range(cnt):
j=num%26
ans[-i-1]=alp[j]
num//=26
print(ans) |
p03624 | s936104121 | Accepted | s=list(input())
alp=list("abcdefghijklmnopqrstuvwxyz")
ans="None"
for w in alp:
if w not in s:
ans=w
break
else:
pass
print(ans) |
p02639 | s299785556 | Wrong Answer | abcde=input().split()
for i in range(5):
if int(abcde[i]) == 0:
print(i)
|
p03264 | s235743179 | Accepted | K = int(input())
odd = (K + 1) // 2
even = K - odd
print(odd * even)
|
p03324 | s676853189 | Accepted | d,n = map(int,input().split())
a = 100**d
if n != 100:
print(a*n)
else:
print(a*(n+1)) |
p03639 | s056120060 | Accepted | n=int(input())
a=list(map(int,input().split()))
cnt=[0,0]
for i in range(n):
if a[i]%2==0:
if a[i]%4==0:
cnt[1]+=1
else:
cnt[0]+=1
if cnt[0]==0 and cnt[1]!=0:
if 2*cnt[1]+1>=n:
print("Yes")
else:
print("No")
elif cnt[0]+2*cnt[1]>=n:
print("Yes")
else:
print("No") |
p02987 | s176873816 | Accepted | s = list(input())
dup = [x for x in set(s) if s.count(x) == 2]
if len(dup) == 2:
print("Yes")
else:
print("No") |
p03324 | s420047712 | Accepted | import sys
sys.setrecursionlimit(10**6)
d,n=map(int,input().split())
if d==0:
if n==100:
print(n+1)
exit()
print(n)
elif d!=0 and n==100:
print((n+1)*100**d)
else:
print(n*100**d)
|
p03351 | s104867903 | Accepted | a,b,c,d=map(int,input().split())
ans="No"
if abs(a-c)<=d:
ans="Yes"
if abs(a-b)<=d and abs(b-c)<=d:
ans="Yes"
print(ans) |
p04012 | s017302770 | Accepted | def resolve():
w = input()
flag = 0
abc = "abcdefghijklmnopqrstuvwxyz"
for i in range(len(abc)):
if w.count(abc[i])%2 == 0:
continue
else:
flag = 1
print("Yes" if flag == 0 else "No")
resolve() |
p03387 | s916908749 | Wrong Answer | import sys
def rs(): return sys.stdin.readline().rstrip()
def ri(): return int(rs())
def rs_(): return [_ for _ in rs().split()]
def ri_(): return [int(_) for _ in rs().split()]
a = sorted(ri_(),reverse=True)
b = a[0] - a[1]
c = a[0] - a[2]
print(b // 2 + b % 2 + c // 2 + c % 2) |
p03773 | s060920826 | Accepted | a, b = map(int,input().split())
if a+b >= 24:
print(a + b -24)
else:
print(a+b) |
p03971 | s689658457 | Accepted | N, A, B = map(int, input().split())
S = list(input().rstrip())
limit = A+B
cnt = 0
for s in S:
if s=="c":
print("No")
elif (s=="a") & (cnt<limit):
print("Yes")
cnt += 1
elif (s=="b") & (cnt<limit) & (B>0):
print("Yes")
cnt += 1
B -= 1
else:
print("No") |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.