problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p02910 | s095402109 | Wrong Answer | S = list(input())
Ki = S[::2]
Gu = S[1::2]
count=0
for i,k in zip(S[::2],S[1::2]):
if k=='R'or i=='L':
print('No')
break
else:
print('Yes') |
p02657 | s569564516 | Accepted | a,b=map(int,input().split())
print(a*b) |
p02725 | s243894775 | Accepted | K, N = map(int, input().split())
A = [int(i) for i in input().split()]
dist = [A[i + 1] - A[i] for i in range(N - 1)]
dist.append(A[0] + K - A[N - 1])
print(K - max(dist)) |
p03699 | s855954203 | Wrong Answer | N = int(input())
scores = sorted([int(input()) for i in range(N)])[::-1]
def get_max(nums):
for num in nums:
if num % 10 == 0:
continue
return num
return 0
# accumulateは使わない
accum = [scores[0]]
# 降順で数字を足し込んでいく（後半になるほど増加分を少なくする）
for i in range(1, N):
accum.append(accum[i-1] + ... |
p02677 | s754018297 | Wrong Answer | import math
a, b, h, m = map(int, input().split())
hh = h * 30
mm = m * 6
do = max(hh, mm) - min(hh, mm)
do = min(do, 360 - do)
sin = math.sin(math.radians(do))
if do == 90:
print(math.sqrt(a ** 2 + b ** 2))
elif do > 90:
hi = b * sin
a_sub = math.sqrt(b ** 2 - hi ** 2)
hy = math.sqrt((a + a_sub) ** ... |
p02771 | s854547118 | Accepted | l = list(map(int,input().split()))
n = len(set(l))
if n == 2:
print("Yes")
else:
print("No") |
p02783 | s211078551 | Accepted | h,a = list(map(int, input().split()))
import math
print(math.ceil(h/a)) |
p02972 | s777000976 | Accepted | n=int(input())
a=list(map(int,input().split()))
ans=[-1 for _ in range(n)]
for i in range(n):
j=n-i
if n//j<2:
ans[j-1]=a[j-1]
else:
p=sum(ans[2*j-1::j])
ans[j-1]=abs(a[j-1]-p)%2
b=[0 for _ in range(sum(ans))]
i=0
#print(ans)#######
m=sum(ans)
for j in range(n):
if ans[j]!=1 and ans[j]!=0:
print... |
p03103 | s011446601 | Accepted | n,m=map(int,input().split())
A=[list(map(int,input().split()))for i in range(n)]
A=sorted(A,key=lambda y:y[0])
cnt=0#ドリンクの本数
ans=0
for i in range(n):
cnt+=A[i][1]
if m<=cnt:
over=cnt-m #mを超えた時の超過本数
ans+=(A[i][0]*A[i][1])-(over*A[i][0])
break
else:
ans+=A[i][0]*A[i][1]
print(a... |
p03293 | s274160045 | Wrong Answer | S = input()
T = input()
if S == T:
print('Yes')
l = len(S)
L = list(S)
for i in range(l):
a = L[0]
del L[0]
L.append(a)
s = ''.join(L)
if s == T:
print('Yes')
break
else:
print('No') |
p02743 | s235994629 | Accepted | from decimal import *
getcontext().prec = 50
a,b,c = map(int,input().split())
if Decimal(a).sqrt() + Decimal(b).sqrt() < Decimal(c).sqrt():
print("Yes")
else:
print("No") |
p03076 | s334679137 | Accepted | from math import ceil
lst = []
ten = []
for i in range(5):
t = int(input())
if t % 10 == 0:
ten.append(t)
else:
lst.append(t)
if lst == []:
print(sum(ten))
exit()
x = min(lst, key=lambda x: x % 10)
lst.remove(x)
for i in range(len(lst)):
lst[i] = 10 * (lst[i] // 10 + 1)
print(x + sum(lst) + sum(ten)... |
p03338 | s994795223 | Wrong Answer | n = int(input())
s = input()
ch = []
for i in range(1, n):
x = s[:i+1]
y = s[i:len(s)]
a = set(x)
b = set(y)
c = a.intersection(b)
ch.append(len(c))
print(max(ch)) |
p03693 | s923865397 | Wrong Answer | r,g,b = input().split()
is_four_multiple = g+b
if int(is_four_multiple) % 4 == 0:
print("Yes")
else:
print("No") |
p03106 | s710872777 | Wrong Answer | A,B,K = map(int,input().split())
count = 0
for i in range(101,0,-1):
if A%i == 0 and B%i == 0:
count += 1
print(i)
if count == K:
print(i)
exit()
|
p03627 | s816244048 | Accepted | n = int(input())
A = list(map(int,input().split()))
A.sort(reverse = True)
ans = 1
i = 0
cnt = 0
while i < n-1:
if A[i] == A[i+1]:
ans *= A[i]
i += 2
cnt += 1
else:
i += 1
if cnt == 2:
print(ans)
exit(0)
print(0)
|
p02677 | s575082496 | Accepted | import numpy
if __name__ == "__main__":
hour_len, min_len, hours, minutes = map(int, input().strip().split(' '))
angle_minute = 2 * numpy.pi * (minutes / 60)
angle_hour = 2 * numpy.pi * (((hours * 60) + minutes) / 720)
if angle_hour >= angle_minute:
final_angle = angle_hour - angle_minute
elif angle_minute > an... |
p03106 | s883608801 | Accepted | a, b, k = map(int, input().split())
dividors = []
for i in range(1, max(a, b) + 1):
if a % i == 0 and b % i == 0:
dividors.append(i)
print(dividors[::-1][k - 1]) |
p02881 | s817265146 | Accepted | N = int(input())
i = int(N ** (1/2))
ans = 10 **13
while i > 0:
if N % i == 0:
ans = min(ans, i + N // i -2)
i -= 1
print(ans) |
p02801 | s426304754 | Wrong Answer | x=input()
arr="abcdefghijklmnopqrstuvwxyz"
arr[arr.index(x)+1] |
p02982 | s131490761 | Accepted | import math
import itertools
N, D = [int(n) for n in input().split()]
X = []
for i in range(N):
X.append([int(m) for m in input().split()])
def get_distance(p1, p2):
d2 = 0
for i in range(D):
d2 += (p1[i] - p2[i])**2
return math.sqrt(d2)
count = 0
for i, j in itertools.combinations(range(N), ... |
p02546 | s833393609 | Wrong Answer | string = input()
if string[-1] != 's':
new_string = string[0:] + 's'
if string[-1] == 's':
new_string = string[0:-1] +'es'
print(new_string) |
p02761 | s990318578 | Accepted | n,m = map(int,input().split())
done = [0]*n
ans = [0]*n
for i in range(m):
s,c = map(int,input().split())
if done[s-1] != 0 and ans[s-1] != c:
print(-1)
exit()
elif n != 1 and s == 1 and c == 0:
print(-1)
exit()
else:
done[s-1] = 1
ans[s-1] = c
ans_f = str()
for j in ans:
ans_f += str(... |
p03252 | s956585707 | Accepted | from collections import Counter
s = input()
t = input()
if sorted(Counter(s).values()) == sorted(Counter(t).values()):
print("Yes")
else:
print("No") |
p02688 | s375692077 | Accepted | N, K = map(int, input().split())
S = [0] * N
for _ in range(K):
n = int(input())
for a in [int(x) for x in input().split()]:
S[a - 1] += 1
print(sum([1 for s in S if s == 0])) |
p02922 | s448745414 | Wrong Answer | a, b = map(int, input().split())
num = 1
ans = 0
while num < b:
num += a
ans += 1
print(ans)
|
p02597 | s965160060 | Accepted | n=int(input())
s=input()
i,j=0,len(s)-1
ans=0
while(i<=j):
if(s[j]=='W'):
j-=1
elif(s[i]=='R'):
i+=1
else:
ans+=1
i+=1
j-=1
print(ans)
|
p03239 | s288489425 | Wrong Answer | N, T = map(int, input().split())
res = 10 ** 9
for _ in range(N):
c, t = map(int, input().split())
if t <= T:
res = min(res, c)
if res <= T:
print(res)
else:
print("TLE")
|
p03161 | s013345870 | Accepted | def cal_cost(co, h, i, j):
return co + abs(h[i]-h[j])
n, k = map(int, input().split())
h = [int(i) for i in input().split(" ")]
lis = [0 for i in range(n)]
for i in range(1, n):
a = min([cal_cost(lis[i-j], h, i-j, i) for j in range(1, k+1) if j<=i])
lis[i] = a
print(lis[-1]) |
p03592 | s340904029 | Accepted | N,M,K = [int(hoge) for hoge in input().split()]
ans = "No"
for n in range(N+1):
for m in range(M+1):
if m*(N-n) +n*(M-m) == K:
ans = "Yes"
print(ans) |
p02729 | s657820491 | Accepted | n, m = map(int, input().split())
n1 = n - 1
m1 = m - 1
res = int((n * n1) / 2 + (m * m1) / 2)
print(res) |
p03163 | s919923379 | Accepted | N,W=map(int,input().split())
w=[]
v=[]
for i in range(N):
w_,v_=map(int,input().split())
w.append(w_)
v.append(v_)
dp=[[0]*(W+1) for i in range(N+1)]
for i in range(N):
for j in range(W+1):
dp[i+1][j]=max(dp[i+1][j],dp[i][j])
if j+w[i] <=W:
dp[i+1][j+w[i]]=max(dp[i+1][j+w[i]],dp[i][j]+v[i])
pr... |
p02618 | s697148623 | Accepted | d=int(input())
c=list(map(int, input().split()))
s=[list(map(int,input().split())) for _ in range(d)]
from random import randint
for i in range(d):
print(c.index(max(c))+1) |
p04029 | s921555100 | Wrong Answer | n=int(input())
sum=n*(n+1)/2
print(sum) |
p02677 | s473482448 | Accepted | import math
a, b, h, m = map(int, input().split())
H = 30 * h + 0.5 * m
M = 6 * m
angle = abs(H - M)
ans = a**2 + b**2 - (2 * a * b * math.cos(math.radians(angle)))
print(math.sqrt(ans)) |
p02618 | s600668131 | Accepted | import numpy as np
D = int(input())
c = list(map(int, input().split()))
s = []
for i in range(D):
tmp = list(map(int, input().split()))
s.append(tmp)
for i in range(D):
val_max = 0
idx_max = 0
for j in range(26):
if val_max < s[i][j]:
val_max = s[i][j]
idx_max = j+1
print(idx_max) |
p02705 | s954449131 | Wrong Answer | R = int(input())
print(2 * 3.14159265) |
p02952 | s445579774 | Wrong Answer | N=int(input())
count=0
S=""
for i in range(1,N-1):
S=len(str(i))
if S%2!=0:
count=count+1
print(count) |
p03605 | s449538183 | Wrong Answer | import random
a=input()
kekka=['Yes','No']
print(random.choice(kekka)) |
p02801 | s685894576 | Wrong Answer | C=input()
CN=ord(C)
print(chr((CN)+1))
print(C+" is followed by "+chr((CN)+1)+".") |
p02697 | s174799706 | Accepted | import math
n, m = map(int, input().split(" "))
start = 1
end = n
wq = n // 4
for i in range(m):
if i == wq and n % 2 == 0:
start += 1
print(start, end)
start += 1
end -= 1 |
p02922 | s824859805 | Wrong Answer | A,B = map(int,input().split())
if B == 1:
print(0)
exit()
if B <= A:
print(1)
exit()
B -= A
ans = 1
while B >= 0:
B -= (A - 1)
ans += 1
print(ans)
exit()
|
p03067 | s367850704 | Accepted | a,b,c=map(int,input().split())
if a<c<b or b<c<a:
print("Yes")
else:
print("No")
|
p03556 | s042379474 | Accepted | N = int(input())
print((int(N**0.5))**2) |
p02623 | s572102108 | Accepted | from itertools import accumulate
from bisect import bisect_right
n, m, k = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
A = list(filter(lambda x: x <= k, accumulate(A)))
B = list(filter(lambda x: x <= k, accumulate(B)))
ans = 0
for i, a in enumerate(A):
j = bisec... |
p03673 | s190042915 | Wrong Answer | n=int(input())
a=list(map(int,input().split()))
s=''
for i in range(n):
if i%2==0:
s=s+str(a[i])
else:
s=str(a[i])+s
if n%2==1:
s=s[::-1]
print(' '.join(s)) |
p02775 | s258427836 | Accepted | N=input()
dp0=[0]*(len(N)+1)
dp1=[0]*(len(N)+1)
dp1[0]=1
for i in range(len(N)):
n=int(N[i])
dp0[i+1]=min(dp0[i]+n, dp1[i]+(10-n))
n+=1
dp1[i+1]=min(dp0[i]+n, dp1[i]+(10-n))
#print(dp0)
#print(dp1)
print(dp0[-1])
|
p03475 | s607945553 | Accepted | n=int(input())
c=[]
s=[]
f=[]
for i in range(n-1):
a,b,d=map(int,input().split())
c.append(a)
s.append(b)
f.append(d)
for i in range(n-1):
count=0
for j in range(i,n-1):
if count<=s[j]:
count=s[j]
else:
if (count-s[j])%f[j]!=0:
count+=f[j]... |
p02572 | s000889210 | Wrong Answer | import sys
import numpy as np
import math
import collections
import copy
import decimal
from collections import deque
from functools import reduce
from itertools import product
from itertools import combinations
N = int(input())
An = list(map(int, input().split()))
An_s = collections.Counter(An)
total = 0
for k in An... |
p02958 | s335899354 | Wrong Answer | n = int(input())
p = [int(i) for i in input().split()]
x = p.copy()
x.sort()
pma = max(p)
pmi = min(p)
p[0] = pmi
p[-1] = pma
if x == p:
print('YES')
else:
print("NO") |
p03001 | s623545930 | Accepted | W,H,x,y=map(int,input().strip().split())
a=W*H/2
if x==W/2 and y==H/2:
b=1
else:
b=0
print(str(a)+" "+str(b)) |
p03693 | s800264293 | Accepted | r, g, b = map(int, input().split())
num = r * 100 + g * 10 + b
if (num % 4 == 0):
print('YES')
else:
print('NO') |
p03698 | s763174062 | Accepted | s = input()
for i in range(len(s)):
for j in range(len(s)):
if i != j and s[i] == s[j]:
print("no")
exit()
print("yes") |
p02555 | s928322463 | Accepted | N = int(input())
M = 10**9 + 7
if N < 3:
print(0)
elif N < 6:
print(1)
else:
dp = [0] * (N + 1)
dp[3] = 1
dp[4] = 1
dp[5] = 1
P = dp[3]
for i in range(6, N + 1):
dp[i] = (P + 1) % M
P = (P + dp[i - 2]) % M
print(dp[-1] % M) |
p02730 | s963485648 | Accepted | s = list(input())
if s == list(reversed(s)) and s[:len(s)//2] == list(reversed(s[:len(s)//2])):
print("Yes")
else:
print("No") |
p02577 | s653827053 | Accepted | if (int(input()))%9 == 0:
print("Yes")
else:
print("No")
|
p03456 | s928497291 | Wrong Answer | a,b=map(str,input().split())
c=int(a+b)
sq = [i*i for i in range(1,101)]
if c in sq: print('Yes')
else: print('No') |
p03385 | s239198145 | Accepted | s = input()
if s=="abc" or s=="acb" or s=="bac" or s== "bca" or s=="cba" or s=="cab":
print("Yes")
else:
print("No") |
p02663 | s028371811 | Accepted | import math
h,m,h2,m2,k = map(int,input().split())
all = h2*60+m2 - (h*60+m)
print(all - k) |
p02719 | s582718608 | Wrong Answer | N, K = map( int, input().split() )
# ユークリッドの互除法
# a = b * q + r
# b = b'* r + r' ...
a = N
b = K
if a < b:
r = b - a
else:
r = a % b
ret = 0
while r != 0:
a = b
b = r
r = a % b
if r == 0:
break
ret = r
print( ret ) |
p02996 | s144222049 | Wrong Answer | N = int(input())
lst = []
for i in range(N):
A,B = map(int,input().split())
lst.append([B,A])
lst.sort()
left = lst[0][0] - lst[0][1]
for i in range(1,N):
left = left + (lst[i][0] - lst[i-1][0])
left -= lst[i][1]
if left < 0:
print("No")
exit()
print("Yes") |
p03386 | s788897868 | Accepted | a, b, k = map(int, input().split())
if b - a < k*2:
for j in [i for i in range(a, b+1)]:
print(j)
else:
for j in [i for i in range(a, a+k)]:
print(j)
for j in [i for i in range(b-k+1, b+1)]:
print(j) |
p03730 | s973833220 | Accepted | def main(a: int, b: int, c: int):
ls = []
for i in range(a, b * a + 1, a):
if i % b in ls:
break
ls.append(i % b)
if c in ls:
print("YES")
else:
print("NO")
if __name__ == "__main__":
a, b, c = map(int, input().split())
main(a, b, c)
|
p03264 | s270744308 | Accepted | n=int(input())
odd=0
even=0
for i in range(1,n+1):
if i%2==0:
even+=1
else:
odd+=1
print(even*odd) |
p03799 | s816132849 | Accepted | n,m=map(int,input().split())
if n*2<m:
print((2*n+m)//4)
else:
print(m//2) |
p02677 | s510768261 | Wrong Answer | import math
A,B,H,M = map(int,input().split())
m = 0
if M != 0:
m = M / 5
if H == 0:
h = 12
else:
h = H*30
if m == 0:
mm = 360
else:
mm = m*30
if h >= mm:
rad = (h+0.5*M)-(mm)
else:
rad = (mm)-(h+0.5*M)
ans = A**2 + B**2 - 2*A*B*(math.cos(math.radians(rad)))
print(ans**0.5) |
p02633 | s520476322 | Accepted | import sys
import math
def input(): return sys.stdin.readline().rstrip()
def main():
x = int(input())
xx = x
ans = 1
while xx%360 != 0:
xx += x
ans += 1
print(ans )
if __name__=='__main__':
main() |
p03997 | s286086438 | Accepted | a = int(input())
b = int(input())
h = int(input())
print(int((a+b)*h/2)) |
p02683 | s727539725 | Accepted | import sys
import numpy as np
input = sys.stdin.readline
N,M,X = list(map(int,input().split()))
CA = [ list(map(int,input().split())) for _ in range(N)]
bit = 2**N
cost = float('inf')
for bi in range(1,bit):
tmp=[]
for i in range(N):
if bi & 1<<i:
tmp.append(CA[i-1])
tmp = np.array(tmp... |
p02873 | s992135512 | Accepted | s=input()
n=len(s)+1
l=[0]*n
r=[0]*n
for i in range(n-1):
if s[i]=='<':
l[i+1]=l[i]+1
if s[n-2-i]=='>':
r[n-2-i]=r[n-1-i]+1
ans=0
for i in range(n):
ans+=max(l[i],r[i])
print(ans)
|
p02658 | s127682973 | Accepted | def main():
N = int(input())
A = list(map(int, input().split()))
if 0 in A:
print(0)
return
anser = 1
for a in A:
anser *= a
if anser > 1000000000000000000:
print(-1)
return
print(anser)
main()
|
p02606 | s954716787 | Accepted | l, r, d = map(int, input().split())
cnt = 0
for i in range(l, r + 1):
cnt += (i % d == 0)
print(cnt)
|
p03624 | s199954869 | Accepted | alph = [chr(i) for i in range(97, 97+26)]
s = input()
s_li = set(sorted(list(s)))
for v in alph:
if v not in s_li:
print(v)
exit(0)
print('None') |
p03160 | s153334044 | Accepted | import sys
sys.setrecursionlimit(200000)
n = int(input())
h = [int(i) for i in input().split()]
d = {}
def dp(p):
if p in d:
return d[p]
if p == n-1:
return 0
if p < n-2:
m = min(dp(p+1)+abs(h[p]-h[p+1]), dp(p+2)+abs(h[p]-h[p+2]))
d[p] = m
return m
if p == n-2:
return dp(p+1)+abs... |
p02879 | s334277905 | Accepted | A, B = map(int, input().split())
if 1 <= A and A<= 9 and 1 <= B and B<= 9:
print(A*B)
else:
print(-1) |
p02987 | s681774611 | Accepted | S = sorted(input())
if S[0]==S[1]==S[2]==S[3]:
print("No")
elif S[0]==S[1] and S[2]==S[3]:
print("Yes")
else:
print("No") |
p02594 | s132939801 | Accepted | X = int ( input().strip() ) ;
print ( "No" if X < 30 else "Yes" ) ; |
p03041 | s840875648 | Accepted | n,k = map(int, input().split())
s = input()
k = k-1
for i in range(n):
if i == k:
x = s[i].lower()
print(x,end="")
else:
print(s[i],end="")
|
p02665 | s345635453 | Accepted | def main():
import sys
import math
input = sys.stdin.buffer.readline
n = int(input())
A = list(map(int, input().split()))
ans = 0
node = 1
max_node = sum(A)
for i in range(n+1):
ans += node
max_node -= A[i]
node = min(max_node,(node-A[i])*2)
if node < ... |
p04033 | s048834747 | Accepted | import sys
input = sys.stdin.readline
# A - Range Product
a, b = map(int, input().split())
if a > 0:
print('Positive')
elif b >= 0:
print('Zero')
else:
if b > 0:
b == 0
if (abs(a)-abs(b)+1) % 2 == 1:
print('Negative')
else:
print('Positive') |
p02842 | s917793973 | Accepted | import math
N = int(input())
if N%27!=26 and N%27!=13:
print(math.ceil(N/1.08))
else:
print(':(')
|
p02687 | s319542844 | Wrong Answer | S = "ARC" or "ABC"
if S == "ABC" :
print("ARC")
if S == "ARC" :
print("ABC") |
p03623 | s121433763 | Accepted | x, a, b = map(int, input().split())
if abs(x-a) < abs(x-b):
print("A")
else:
print("B") |
p02753 | s701249165 | Accepted | S=input()
if S=="AAA" or S=="BBB":
print("No")
else: print("Yes")
|
p02916 | s253541113 | Accepted | f=lambda:list(map(int,input().split()))
n,a,b,c=f()[0],f(),f(),f()
print(sum(b)+sum(c[a[i]-1] for i in range(n-1) if a[i+1]-a[i]==1)) |
p03251 | s561755157 | Accepted | import sys
import heapq, math
from itertools import zip_longest, permutations, combinations, combinations_with_replacement
from itertools import accumulate, dropwhile, takewhile, groupby
from functools import lru_cache
from copy import deepcopy
N, M, X, Y = map(int, input().split())
XS = list(map(int, input().split())... |
p02831 | s055251086 | Wrong Answer | a, b = map(int, input().split())
c = min(a, b)
print(c)
for i in range(c, a * b + 1):
if i % a == 0 and i % b == 0:
print(i)
exit() |
p02861 | s742735408 | Accepted | N=int(input())
x=[]
y=[]
for _ in range(N):
a, b=map(int, input().split())
x.append(a)
y.append(b)
from math import factorial
from math import sqrt
ans=0
def d(x1, x2, y1, y2):
return sqrt((x1-x2)**2+(y1-y2)**2)
num=factorial(N-1)*2
for i in range(N-1):
for j in range(i+1,N):
ans+=num*d(x[i],x[j],y[i],... |
p03778 | s662787159 | Accepted | w, a, b = map(int, input().split())
if abs(a - b) < w:
ans = 0
else:
ans = abs(a - b) - w
print(ans) |
p03107 | s176491426 | Wrong Answer | l=list(map(str,input()))
print(2*(min(l.count(0),l.count(1))))
|
p02910 | s982544148 | Accepted | S =input()
print('No' if 'L' in S[::2] or 'R' in S[1::2] else 'Yes')
|
p03012 | s357302755 | Accepted | N = int(input())
W = [int(n) for n in input().split()]
W_ = [W[0]]
for i in range(1, N):
W_.append(W_[-1] + W[i])
#print(W_)
d_min = 100000
for i in range(N):
d = abs(2 * W_[i] - W_[-1])
d_min = min(d_min, d)
print(d_min)
|
p03067 | s898983007 | Accepted | L = [int(T) for T in input().split()]
print(['No','Yes'][sorted(L)[1]==L[2]]) |
p02665 | s366034123 | Wrong Answer | import sys
N=int(input())
A=list(map(int,input().split()))
if A[0]>=1:
print(-1)
sys.exit()
ans=A[N]
left=1
P=[1 for i in range(N+1)]
for i in range(1,N+1):
point=left*2
P[i]=point
if i!=N and point-A[i]<0:
print(-1)
sys.exit()
if i==N and point-A[i]<0:
print(-1)
sys.exit()
left=point-A[i]... |
p02784 | s735892343 | Wrong Answer | H,N=map(int,input().split())
sum = 0
1<=H<=10**9
1<=N<=10**4
import random
for i in range(1,N+1):
attack = random.randint(1,10**4)
print(attack)
sum += attack
total = sum
if H - total <= 0:
print("Yes")
else:
print("No")
|
p02801 | s872192465 | Wrong Answer | #!/usr/bin/env python3
# -*- coding: utf-8 -*-
"""
Created on Sun Jan 12 22:19:09 2020
@author: nanasakiwataru
"""
C = input()
ans = chr(ord(C) + 1)
st = C + 'の次は' + ans + 'です。'
print(st)
|
p04034 | s062172041 | Accepted | N, M = map(int, input().split())
num = [1]*(N+1)
red = [0]*(N+1)
red[1] = 1
for _ in range(1,M+1):
x, y = map(int, input().split())
if red[x]:
red[y] = 1
num[x] = num[x]-1
num[y] = num[y]+1
if num[x]==0:
red[x] = 0
ans = 0
for i in range(1,N+1):
if red[i] == 1:
ans+=... |
p02642 | s449668628 | Wrong Answer | import sys
N = int(input())
if N == 1:
print(int(input()))
sys.exit()
A = set(map(int, input().split()))
if len(A) == 1:
print(0)
sys.exit()
count = 1
A = sorted(A)
B = [A[0]]
for i in range(len(A)-1):
Flag = True
for j in B:
if A[i+1] % j == 0:
Flag = False
if Fla... |
p03493 | s274016559 | Accepted | print(input().count('1')) |
p02582 | s217976324 | Accepted | s = input()
if s == 'RRR':
print(3)
elif s == 'RRS' or s == 'SRR':
print(2)
elif s == 'SSS':
print(0)
else:
print(1)
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.