problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p03607 | s969212390 | Wrong Answer | n = int(input())
l = []
for _ in range(n):
a = int(input())
l.append(a)
l.sort()
print(l)
ans = 0
cnt = 1
tmp = l[0]
for i in range(1,len(l)):
if tmp == l[i]:
cnt += 1
tmp = l[i]
else:
if cnt%2 != 0:
ans += 1
cnt = 1
tmp = l[i]
else:... |
p04045 | s738760184 | Accepted | import collections, math, bisect
local = False
if local:
file = open("input.txt", "r")
import time
def inp():
if local:
return file.readline().rstrip()
else:
return input().rstrip()
def ints():
return [int(_) for _ in inp().split()]
if local:
start=time.time()
N, K = ints()
... |
p02959 | s286698381 | Accepted | n = int(input())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
sum_ = 0
for i in range(n):
if a[i]>=b[i]:
a[i]-=b[i]
sum_+=b[i]
b[i]=0
else:
b[i]-=a[i]
sum_+=a[i]
a[i]=0
if a[i+1]>=b[i]:
a[i+1]-=b[i]
sum_+=b[i]
b[i]=0
else:
b[i]-=a[i... |
p03220 | s940152686 | Wrong Answer | n = int(input())
t, a = map(int, input().split())
h = list(map(float, input().split()))
dt = 10000000
ans = 0
for i in range(len(h)):
print(i)
tmp = float(t) - 0.006 * h[i]
if dt > abs( a - tmp ):
dt = abs( a - tmp )
ans = i + 1
print(ans)
|
p03150 | s729792527 | Wrong Answer | s = input()
for i in range(7):
if s[i] + s[-7 + i] == "keyence":
print("YES")
exit()
print("NO") |
p02641 | s297292460 | Accepted | x,n = map(int,input().split())
if n == 0:
print(x)
exit()
a = list(map(int,input().split()))
b = [0 for _ in range(-300,301)]
for y in a:
b[y+300] = 1
c = []
for i in range(601):
j = i - 300
if b[i] == 0:
c.append([abs(x-j),j])
print(min(c)[1]) |
p02912 | s394686499 | Wrong Answer | n,m = map(int,input().split())
a = sorted(map(int,input().split()))
import bisect
for i in range(m):
a[-1] //= 2
if 1 < len(a):
if a[-2] > a[-1]:
bisect.insort(a,a[-1])
a = a[:-1]
print(sum(a)) |
p02602 | s275454372 | Accepted | n,k=map(int,input().split())
a=list(map(int,input().split()))
for i in range(n-k):
print(["No","Yes"][a[i] <a[i+k]]) |
p03274 | s812019289 | Accepted | N, K = map(int, input().split())
X = list(map(int, input().split()))
ans = 10**9
for i in range(N-K+1):
if X[i] >= 0:
ans = min(ans, X[K+i-1])
elif X[K+i-1] <= 0:
ans = min(ans, -X[i])
else:
ans = min(ans, 2*X[K+i-1]-X[i], X[K+i-1]-2*X[i])
print(ans)
|
p02792 | s039527783 | Accepted | import sys
input = sys.stdin.readline
n=int(input())
D={}
for i in range(1,n+1):
s=(str(i)[0],str(i)[-1])
if s not in D:
D[s]=1
else:
D[s]+=1
ans=0
for i in D:
t=(i[1],i[0])
if t in D:
ans+=D[t]*D[i]
print(ans) |
p02571 | s301451259 | Accepted | S = list(str(input()))
T = list(str(input()))
l = len(S) - len(T)
f = len(T)
for i in range(l+1):
temp = 0
for j in range(len(T)):
if S[i+j] != T[j]:
temp += 1
if f > temp:
f = temp
print(f) |
p02606 | s678877001 | Accepted | L,R,d = map(int, input().split())
if L%d==0:
print(R//d-L//d+1)
else:
print(R//d-L//d)
|
p03785 | s129416442 | Wrong Answer | N, C, K = list(map(int, input().split()))
T = []
for i in range(N):
T.append(int(input()))
bus = []
departure=0
T.sort()
for passenger in T:
if bus == []:
bus.append(passenger)
elif passenger <= bus[0]+K and len(bus)<(C-1):
bus.append(passenger)
else:
bus.clear()
departure+=1
if ... |
p03627 | s757914269 | Wrong Answer | import sys
from collections import Counter
N = int(input())
A = list(map(int, sys.stdin.readline().rsplit()))
C = list(Counter(A).items())
C.sort(reverse=True)
a = 0
b = 0
for c in C:
if c[1] > 1 and a == 0 and b == 0:
a = c[0]
elif c[1] > 1 and a != 0 and b == 0:
b = c[0]
break
prin... |
p02684 | s154073008 | Accepted | N, K = map(int, input().split())
A = list(map(int, input().split()))
B = [0] * N
C = []
C.append(0)
now = 0
B[0] = 1
for i in range(N):
now = A[now] - 1
if B[now] == 1:
break
else:
C.append(now)
B[now] = 1
mae = 0
for i in range(len(C)):
if C[i] == now:
mae = i
... |
p03324 | s017924665 | Accepted | d,n = map(int,input().split())
if n == 100:
n += 1
print(100 ** d * n) |
p03071 | s609505758 | Accepted | A,B = map(int,input().split())
if A == B:
print(2*A)
else:
print(max(A,B)+max(A,B)-1) |
p02787 | s194338194 | Accepted | (h, n), *m = [[*map(int, i.split())] for i in open(0)]
dp = [0] * 20001
for i in range(1, h + 1):
dp[i] = min(dp[i-a]+b for a, b in m)
print(dp[h])
|
p02743 | s156605878 | Accepted | from decimal import Decimal, getcontext
getcontext().prec = 50
a, b, c = map(Decimal, input().split())
print('Yes' if a.sqrt() + b.sqrt() < c.sqrt() else 'No')
|
p03860 | s340566498 | Accepted | s=input().split()[1][0]
print("A"+s+"C")
|
p02675 | s396170683 | Wrong Answer | N = input()
if N[-1] == "3":
print("bon")
elif N[-1] == "0" or N[-1] == "1" or N[-1] == 6 or N[-1] ==8:
print("pon")
else:
print("hon") |
p02683 | s007023250 | Accepted | n,m,x=map(int,input().split())
lis=[list(map(int,(input().split()))) for i in range(n)]
c=float('inf')
p=0
for i in range(2**(n+1)):
al=[0]*m
cost=0
for j in range(n):
if (i>>j)&1:
for k in range(1,m+1):
al[k-1]+=lis[j][k]
cost+=lis[j][0]
if min(al)>=x:
... |
p02933 | s131428669 | Accepted | a = int(input())
s = input()
if a >= 3200:
print(s)
else:
print('red')
|
p03821 | s093805098 | Wrong Answer | n = int(input())
a_list = []
b_list = []
ans = 0
for i in range(n):
a,b = map(int,input().split())
a_list.append(a)
b_list.append(b)
for i,j in zip(a_list[::-1],b_list[::-1]):
if (i+ans) > j:
if (i+ans)%j != 0:
inc = j - ((i+ans)%j)
ans += inc
else:
ans += (... |
p03241 | s836693142 | Accepted | n,m=map(int,input().split())
l=m//n #gの下限値
def make_divisors(n):
D=[]
for i in range(1, int(n**0.5)+1):
if n%i==0:
D.append(i)
if i!=n//i:
D.append(n//i)
return list(sorted(D))
D=make_divisors(m)
ans=1
for d in D:
if d>l:
continue
if m//d>=n... |
p03324 | s036375727 | Accepted | d,n = map(int,input().split())
if n==100:
n=101
print(n*100**d) |
p02772 | s538349715 | Wrong Answer | N = int(input())
applist = list(map(int, input().split()))
flag = 0
for i in applist:
if i % 2 == 0:
if i % 3 == 0 or i % 5 == 0:
flag = 1
else:
flag = 0
break
if flag == 1:
print("APPROVED")
else:
print("DENIED") |
p03317 | s428463177 | Accepted | n, k = map(int, input().split())
print((n + k - 3) // (k - 1))
|
p03371 | s601060219 | Wrong Answer | a,b,c,x,y = map(int,input().split())
if a//2 + b//2 > c:
buf = min(x,y) * c * 2
buf2 = max(x,y) * c * 2
if min(x,y) == y:
tmp = buf + abs(x-y) * a
else:
tmp = buf + abs(x-y) * b
ans = min(buf2,tmp)
else:
ans = x * a + y * b
print(ans)
|
p02823 | s765101248 | Wrong Answer | n, a, b = list(map(int, input().split()))
dis = abs(a-b)
if dis % 2 == 0:
print(dis // 2)
else:
high = n - min(a, b)
low = max(a, b) - 1
print(min(high, low)) |
p03761 | s568250585 | Wrong Answer | n = int(input())
s = [input() for _ in range(n)]
az = "abcdefghijklmnopqrstuvwxyz"
counts = {}
for v in az:
counts[v] = n
for i in range(n):
counts[v] = min(counts[v], s[i].count(v))
ans = ""
for k, v in counts.items():
ans += k*v
print(ans)
|
p03379 | s647041884 | Accepted | import sys
import bisect
input = sys.stdin.readline
def readstr():
return input().strip()
def readint():
return int(input())
def readnums():
return map(int, input().split())
def readstrs():
return input().split()
def main():
N = readint()
X = list(readnums())
xs = sorted(X)
for... |
p02952 | s134545322 | Wrong Answer | number = int(input())
ans = 0
for i in range(1,number+1):
if len(str(i)) % 2 != 1:
ans += 1
print(ans) |
p02754 | s455739914 | Wrong Answer | i = input()
a = i.split(" ")
n = len(i)
if n == 5:
N = int(a[0])
A = int(a[1])
B = int(a[2])
if A == 0:
print("0")
elif N-(A+B) == 0:
print(A)
elif A+B != N:
x = N-(A+B)
print(A+x) |
p02641 | s473094661 | Accepted | x, n = map(int, input().split())
p = list(map(int, input().split()))
for i in range(x+1):
if not(x - i) in p:
print(x - i)
exit()
elif not(x + i) in p:
print(x + i)
exit()
print(x) |
p02612 | s361120463 | Wrong Answer | x=int(input())
if(x&1000==0):
print(0)
else:
print(x%1000) |
p03698 | s302865985 | Accepted | def main():
s = input()
dic = {}
for v in s:
dic.setdefault(v, 0)
dic[v] += 1
if dic[v] == 2:
print('no')
exit()
print('yes')
if __name__ == '__main__':
main()
|
p02792 | s986661268 | Accepted | n = int(input())
tbl=[[0 for j in range(10)] for i in range(10)]
for i in range(1,n+1):
s= str(i)
h=int(s[0])
b=int(s[-1])
tbl[h][b]+=1
ans = 0
for i in range(10):
for j in range(10):
ans+=tbl[i][j]*tbl[j][i]
print(ans) |
p03804 | s760314307 | Wrong Answer | n, m = map(int, input().split())
a = [input() for _ in range(n)]
b = [input() for _ in range(m)]
flag = 0
for i in range(n-m+1):
for j in range(n-m+1):
for k in range(m):
if a[j+k][i:i+m]!=b[k]:
break
else:
flag = 1
print("Yes" if flag else "No") |
p03359 | s793392099 | Accepted | a, b = map(int, input().split())
if a <= b:
print(a)
else:
print(a-1) |
p03095 | s142866203 | Accepted | from collections import Counter
N = int(input())
S = input()
mod = 10**9+7
cnt = Counter(S)
res = 1
for v in cnt.values():
res *= v+1
res %= mod
print((res-1)%mod) |
p02957 | s149116153 | Accepted | A, B = map(int,input().split())
if (A + B) % 2 == 0:
print(int((A+B)/2))
else:
print("IMPOSSIBLE") |
p03351 | s802185192 | Accepted | a,b,c,d=map(int,input().split())
if abs(b-c)<=d & abs(a-b)<=d:
print('Yes')
elif abs(a-c)<=d:
print('Yes')
else:
print('No') |
p03250 | s188250382 | Accepted | ABC=[x for x in input().rstrip().split()]
ABC.sort(reverse=True)
ab=ABC[0]+ABC[1]
c=ABC[2]
print(int(ab)+int(c)) |
p02859 | s349400584 | Wrong Answer | a = int(input("半径"))
a *= a
print(a)
|
p02989 | s901641504 | Accepted | N = int(input())
d = list(map(int, input().split()))
d.sort()
print(d[N//2]-d[N//2-1]) |
p02843 | s587778066 | Wrong Answer | n = int(input())
#indexが負の場合、末尾から参照されるので多めにとる
dp = [0]*100200
dp[0] = 1
for i in range(0,100000):
if dp[i-105]:
dp[i] = 1
if dp[i-104]:
dp[i] = 1
if dp[i-103]:
dp[i] = 1
if dp[i-102]:
dp[i] = 1
if dp[i-101]:
dp[i] = 1
if dp[i-100]:
dp[i] = 1
print... |
p03471 | s169190592 | Accepted | n, y = (int(x) for x in input().split())
ans = 0
m = y // 10000 + 1
for i in reversed(range(m)):
for j in range(n-i+1):
if 10000*i + 5000*j + 1000*(n-i-j) == y:
ans = [i, j, n-i-j]
break
if ans != 0:
break
if ans == 0: print(*[-1, -1, -1])
else: print(*ans) |
p03328 | s290932797 | Accepted | import sys
sys.setrecursionlimit(10000000)
MOD = 10 ** 9 + 7
INF = 10 ** 15
def main():
a,b = map(int,input().split())
idx = b - a
ans = 0
for i in range(idx):
ans += i
ans -= a
print(ans)
if __name__ == '__main__':
main() |
p02814 | s740314028 | Accepted | import numpy as np
import math
from fractions import gcd
n,m = map(int,input().split())
a = np.array(input().split(),dtype=int)
a /= 2
def t_per2(k):
return format(k,'b')[::-1].find('1')
f = False
dcm = a[0]
t_2 = t_per2(a[0])
for i in a:
dcm = (dcm*i)//gcd(dcm,i)
if dcm > m or not t_per2(i) == t_2:
... |
p03107 | s489942514 | Accepted | s = list(input())
n = len(s)
for i in range(n):
s[i] = int(s[i])
ones = sum(s)
zeros = n-sum(s)
print(min(ones,zeros)*2) |
p03071 | s638490562 | Wrong Answer | a,b=map(int,input().split())
print(max(a,b)*2-1) |
p02835 | s250225837 | Accepted | import sys
import math
def i():return int(sys.stdin.readline().replace("\n",""))
def i2():return map(int,sys.stdin.readline().replace("\n","").split())
def s():return str(sys.stdin.readline().replace("\n",""))
def l():return list(sys.stdin.readline().replace("\n",""))
def intl():return [int(k) for k in sys.stdin.readli... |
p03285 | s967350544 | Wrong Answer | n = int(input())
a = n//4
b = n//7
ans =0
if a == 0 or b == 0:
print('No')
exit()
for i in range(a+1):
for j in range(b+1):
if i*4+j*7 == n:
ans += 1
break
if ans == 1:
print('Yes')
else:
print('No') |
p03417 | s127769712 | Accepted | n,m=map(int,input().split())
if n!=1 and m!=1:
print((n-2)*(m-2))
elif n==m==1:
print(1)
else:
print(max(n,m)-2)
|
p02647 | s510190228 | Accepted | #!/usr/bin/env python3
N, K = map(int, input().split())
A = list(map(int, input().split()))
if K > 41:
K = 41
for k in range(K):
D = [0]*N
for i in range(N):
left = max(i - A[i], 0)
right = min(i + A[i], N-1)
D[left] += 1
if right + 1 < N: D[right+1] -= 1
for i i... |
p02683 | s096730523 | Accepted | from itertools import product
import numpy as np
N, M, X = list(map(int, input().split()))
INF = 10**5 * 12 + 1
books = np.array([list(map(int, input().split())) for i in range(N)])
ans = INF
for selection in product([0, 1], repeat=N):
selection = np.array(selection).reshape(N, 1)
res = (books * selection).su... |
p03625 | s327416396 | Accepted | n = int(input())
l = list(map(int, input().split()))
c_dic={}
for i in l:
if i in c_dic:
c_dic[i]+=1
else:
c_dic[i]=1
c_l=[]
for i,j in c_dic.items():
if j>=2:
c_l.append(i)
if j>=4:
c_l.append(i)
c_l.sort(reverse=True)
if len(c_l)<2:
print(0)
else:
print(c_l[0]*c... |
p03067 | s588330342 | Accepted | (a,b,c) = map(int,input().split())
if min(a,b) <= c <= max(a,b):
print("Yes")
else:
print("No") |
p03106 | s572846150 | Wrong Answer | A,B,K = map(int,input().split())
list=[]
for i in range(1,101):
if A%i==0 and B%i==0:
list.append(i)
list.sort(reverse=True)
print(list)
print(list[K-1])
|
p03796 | s473760896 | Accepted | N=int(input())
p=10**9+7
pow=1
for i in range(1,N+1):
pow=pow*i % p
print(pow) |
p02624 | s046065290 | Accepted | def main():
N,t=int(input()),0
for x in range(1,N+1):
t+=(N//x)*(N//x+1)*x//2
print(t)
main()
|
p02797 | s990945493 | Wrong Answer | N,K,S=map(int, input().split())
ans=[0]*N
if K==0:
if S==10**9:
for i in range(N):
ans[i]=1
else:
for i in range(N):
ans[i]=S
else:
for i in range(K):
ans[i]=S
if S==10**9:
for i in range(K,N):
ans[i]=1
else:
for i in range(... |
p03416 | s991507892 | Accepted | def kaibun(s):
l=len(str(s))
check=list(s)
half=l//2
a=check[:half]
b=check[::-1][:half]
if a==b:
return True
return False
a,b=[int(i) for i in input().split()]
ans=0
for i in range(a,b+1):
if kaibun(str(i)):
ans+=1
print(ans) |
p02983 | s281336881 | Accepted | #!/usr/bin/python3
# -*- coding:utf-8 -*-
def main():
l, r = map(int, input().strip().split())
x = 2019
remains = [l%x]
for i in range(l+1, r+1):
remain = i % x
if remains[0] == remain:
break
remains.append(remain)
min = x
for i in range(len(remains)-1):
for j in range(i+1, len(r... |
p03721 | s173488673 | Wrong Answer | n,k = map(int,input().split())
for i in range(n):
a,b = map(int,input().split())
k -= b
if k <= 0:
print(a)
exit() |
p02775 | s737176722 | Wrong Answer | from sys import stdin,setrecursionlimit
setrecursionlimit(10**6)
n = int(stdin.readline().rstrip())
point = 0
def otsuri(n,point):
now = 0
while True:
if 10**(now)<= n < 10**(now+1):
break
else:
now += 1
if n-10**(now)<10:
point += n-10**(now)
return ... |
p02765 | s853934527 | Wrong Answer | N, R = map(int,input().split())
if N>=10:
print(R)
else:
print(10-R/100) |
p03799 | s923708896 | Wrong Answer | N, M = map(int, input().split())
count = 0
# まず，変換しないで行けるやつをできるだけ
if M >= 2*N:
count += N
M -= 2*N
else:
count += N//2
print(count)
exit()
count += M//4
print(count) |
p03329 | s785115080 | Wrong Answer | def main():
n = int(input())
dp = [None]*n
dp[0] = 1
nl = list(sorted([6**i for i in range(10) if (6**i)<=n]+[9**i for i in range(1, 10) if (9**i)<=n]))
for i in range(1, n):
d = 10**15
for j in nl:
if j > i:
break
d = min(d, 1+dp[i-j])
... |
p03077 | s477463486 | Accepted | import math
N, AE = int(input()), [int(input()) for _ in range(5)]
print(math.ceil(N / min(AE)) + 4) |
p02639 | s843477943 | Accepted | x=list(map(int,input().split()))
for i in range(5):
if x[i]!=(i+1):
print(i+1)
|
p03109 | s194290326 | Accepted | print('Heisei' if input() <= '2019/04/30' else 'TBD') |
p03971 | s442156611 | Accepted | count1 = 0
count2 = 0
N, A, B = map(int, input().split())
S = list(input())
for i in S:
if i == "a" and A + B > count1:
print("Yes")
count1 += 1
elif i == "b" and A + B > count1 and B > count2:
print("Yes")
count1 += 1
count2 += 1
else :
print("No") |
p03387 | s559495494 | Wrong Answer | import statistics
a, b, c = map(int, input().split())
mn = min(a, b, c)
md = statistics.median([a, b, c])
mx = max(a, b, c)
if (md - mn) % 2 == 0:
print((md - mn) // 2 + (mx - md))
else:
print((md + 1 - mn) // 2 + (mx - 2 - md) + 2) |
p03637 | s684038751 | Wrong Answer | N=int(input())
a=input().split()
numbers=[int(b) for b in a]
kazu=0
suuji=0
for z in numbers:
if z%2==0:
kazu+=1
for y in numbers:
if y%4==0:
suuji+=1
if kazu==N:
print('Yes')
elif suuji>=N//2:
print('Yes')
elif kazu>=N-suuji*2:
print('Yes')
else:
print('No')
|
p02548 | s886759031 | Accepted | import math
N = int(input())
Nsq = math.floor(math.sqrt(N-1))
count = 0
for i in range(1, Nsq + 1):
a = (N - 1) // i - (i-1)
count = count + a
count = count * 2 - Nsq
print(count)
|
p02732 | s728851196 | Wrong Answer | def nC2(n):
return n*(n-1)/2
n = int(input())
a = list(map(int, input().split()))
cnt = [0]*(n+1)
total = 0
ans = 0
for i in range(n):
cnt[a[i]] += 1
for i in range(n):
total += nC2(cnt[i])
for i in range(n):
print(total - nC2(cnt[a[i]]) + nC2(cnt[a[i]] - 1)) |
p02795 | s020001201 | Accepted | import sys
from collections import defaultdict
readline = sys.stdin.buffer.readline
#sys.setrecursionlimit(10**8)
def geta(fn=lambda s: s.decode()):
return map(fn, readline().split())
def gete(fn=lambda s: s.decode()):
return fn(readline().rstrip())
def main():
h = gete(int)
w = gete(int)
n = ... |
p03617 | s910603756 | Accepted | import sys
q, h, s, d = [int(i) for i in sys.stdin.readline().split()]
n = int(input())
if h > q * 2:
h = q * 2
if s > h * 2:
s = h * 2
if d > s * 2:
d = s * 2
_sum = 0
ls = [(0.25, q), (0.5, h), (1, s), (2, d)]
ls.reverse()
ind = 0
while n:
cur = ls[ind]
_sum += cur[1] * (n // cur[0])
n %= cur[... |
p02811 | s426305475 | Accepted | k,x = map(int,input().split())
if 500*k >= x:print('Yes')
else:print('No') |
p02612 | s683505416 | Wrong Answer |
def abc173_a():
N = int(input())
#N = 1900
print(1000-N%1000)
abc173_a() |
p03705 | s875559547 | Accepted | n,a,b=map(int,input().split())
if n>1 and b>=a or n==1 and a==b:
print ((n-2)*(b-a)+1);
else:
print ("0"); |
p02861 | s804681618 | Accepted | import math
import itertools
N = int(input())
XY = [list(map(int, input().split())) for x in range(N)]
P = list(itertools.permutations(XY, N))
total = 0
for p in P:
for i in range(1, N):
a = p[i - 1]
b = p[i]
total += math.sqrt((a[0] - b[0]) ** 2 + (a[1] - b[1]) ** 2)
ans = to... |
p03086 | s199039807 | Accepted | S = input()
N = len(S)
l = []
for i in range(N):
if S[i] == "A" or S[i] == "C" or S[i] == "G" or S[i] == "T":
l.append(1)
else:
l.append(0)
#print(l)
ans = 0
for i in range(N):
for j in range(i, N):
tf = True
for k in range(i, j + 1):
if l[k] == 0:
... |
p03076 | s497968521 | Wrong Answer | def ip():return int(input())
ans=0
m=9
for i in range(5):
a=ip()
ans+=a
if ans%10!=0:ans=(ans//10+1)*10
if a%10>0:m=min(m,a%10)
print(ans-(10-m))
|
p02665 | s551813899 | Accepted | *a,=map(int,[*open(0)][1].split())
c=[s:=0]
for i in a[:0:-1]:c+=c[-1]+i,
b=1
for a in a:
if b<a:
s=-1
break
s+=b
b=min(c.pop(),(b-a)*2)
print(s) |
p03013 | s655604685 | Accepted | n, m = map(int, input().split())
a = [True]*(n+1)
for _ in range(m):
i = int(input())
a[i] = False
dp = [0]*(n+1)
dp[0] = 1
for i in range(n):
for j in range(i+1, min(n+1, i+3)):
if a[j]:
dp[j] += dp[i]
dp[j] %= 10**9+7
print(dp[n])
|
p02700 | s615483612 | Accepted | A,B,C,D = map(int, input().split())
while A > 0 or C > 0:
C -= B
if C <= 0:
print("Yes")
break
A -= D
if A <= 0:
print("No")
break |
p02953 | s200800655 | Accepted | N = int(input())
H = list(map(int, input().split()))
H[-1] += 1
for i in range(N - 2, 0, -1):
if H[i] == H[i + 1]:
continue
elif H[i] < H[i + 1]:
H[i] += 1
else:
print("No")
break
else:
print("Yes")
|
p03962 | s120191888 | Wrong Answer | a,b,c = input().split()
score = 1
if a != b:
score = score + 1
elif a !=c:
score = score + 1
else:
score = score
print(score) |
p03817 | s372628642 | Accepted | x = int(input())
if x%11 == 0:
ans = (x//11)*2
elif x%11 <= 6:
ans = (x//11)*2 + 1
else:
ans = (x//11)*2 + 2
print(ans) |
p02708 | s540986647 | Wrong Answer | line=input()
n,k=map(int,line.split())
sums=0
while k!=(n+2):
if k==1:
mini=1
if k>=2:
mini=(((k)*(k-1))/2)#%((10**9)+7)
maxi=( (((n+1)*(n)) - ((n+1-k)*(n-k)) )/2 )#%((10**9)+7)
sums+=(maxi-mini+1)
sums=sums%((10**9)+7)
k+=1
print(int(sums)) |
p03243 | s996836735 | Wrong Answer | N = int(input())
a = 0
for i in range(N,999):
if i == 111 or i == 222 or i == 333 or i ==444 or i ==555 or i == 666 or i ==777 or i ==888 or i == 999:
a = i
break
print(a) |
p03774 | s172599597 | Accepted | n,m=map(int,input().split())
AB=[list(map(int,input().split())) for i in range(n)]
CD=[list(map(int,input().split())) for i in range(m)]
ans=[0]*n
for i in range(n):
cnt=float('inf')
dist=0
a,b=AB[i]
for j in range(m):
c,d=CD[j]
dist=abs(a-c)+abs(b-d)
if cnt>dist:
ans... |
p02801 | s783074692 | Accepted | # import numpy as np
# import math
# import copy
import sys
# input = sys.stdin.readline
# sys.setrecursionlimit(10000)
def main():
C = input()
alpha = 'abcdefghijklmnopqrstuvwxyz'
for i in range(len(alpha)):
if C == alpha[i]:
print(alpha[i+1])
break
main()
|
p02773 | s681516660 | Accepted | #python3
from collections import defaultdict
from operator import itemgetter
def main():
n = int(input())
a = [input() for _ in range(n)]
s = defaultdict(int)
for i in a:
s[i]+=1
t = []
for i, j in s.items():
t.append((i, j))
t.sort(reverse=True,key=itemgetter(1))
... |
p02775 | s233705366 | Accepted | N=("0"+input())[::-1]
ans=0
kuriagari=0
for i in range(len(N)):
n=int(N[i])+kuriagari
if n==5:
if i+1<len(N):
if int(N[i+1])>=5:
ans+=(10-n)
kuriagari=1
else:
ans+=n
kuriagari=0
else:
ans+=n
kuriagari=0
elif n<=5:
ans+=n
kuriagari=0
else:
... |
p02665 | s040758470 | Wrong Answer | N = int(input())
n_l = [1]
n = 1
A = [int(a) for a in input().split()]
for i in range(1,N+1):
a = A[i-1]
n = (n - a) * 2
n_l.append(n)
if n <= 0:
Good = False
break
if n > A[N]:
counter = A[N]
m = A[N]
Good = True
else:
Good = False
if Good:
for i in range(N-1,-1,-1):... |
p03385 | s114191209 | Accepted | s=list(input())
if "a" in s:
if "b" in s:
if "c" in s:
print("Yes")
exit()
print("No") |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.