problem_id
stringclasses 428
values | submission_id
stringlengths 10
10
| status
stringclasses 2
values | code
stringlengths 5
816
|
|---|---|---|---|
p02842
|
s593588096
|
Accepted
|
N = int(input())
X = int(N/1.08)
if int(X*1.08) == N:
print(X)
elif int((X+1)*1.08) == N:
print(X+1)
else:
print(":(")
|
p02553
|
s258095478
|
Wrong Answer
|
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(1000000)
from collections import deque
# スペース区切りの整数の入力
a, b, c, d = map(int, input().split())
if b <= 0 and d <= 0:
print(a*c)
elif b < 0 and d > 0:
print(b*c)
elif b >0 and d < 0:
print(a*d)
else:
print(b*d)
|
p03696
|
s551891902
|
Wrong Answer
|
def main():
n = int(input())
S = input()
ans = ''
left, right = 0, 0
for s in S:
if s == '(':
left += 1
if right:
m = max(left, right)
ans += '(' *m + ')'*m
left, right = 1, 0
else:
right += 1
if right or left:
m = max(left, right)
ans += '(' *m + ')'*m
print(ans)
main()
|
p02766
|
s865641883
|
Wrong Answer
|
N,K = map(int,input().split())
Count=0
while N > 0:
N = int(N/K)
print(N)
Count=Count+1
print(Count)
|
p04033
|
s388845455
|
Accepted
|
a, b = map(int, input().split())
if a <= 0 and b >= 0:
print('Zero')
elif a > 0:
print('Positive')
else:
if (b - a) % 2 == 0:
print('Negative')
else:
print('Positive')
|
p03485
|
s566351358
|
Accepted
|
a, b = map(int, input().split())
print(-(-(a+b)//2))
|
p03438
|
s599249936
|
Accepted
|
n=int(input())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
aPlus=0
bPlus=0
for i in range(n):
if a[i]>b[i]:
aPlus+=(a[i]-b[i])
elif a[i]<b[i]:
if (b[i]-a[i])%2==0:
bPlus+=(b[i]-a[i])//2
else:
aPlus+=1
bPlus+=(b[i]+1-a[i])//2
if aPlus<=bPlus:
print("Yes")
else:
print("No")
|
p02795
|
s309901008
|
Accepted
|
h = int(input())
w = int(input())
n = int(input())
if n % max(h, w) == 0:
print(int(n / max(h, w)))
else:
print(int(n // max(h, w) + 1))
|
p02882
|
s504024758
|
Accepted
|
import math
A,B,X = map(int,input().split())
if(X >= A*A*B/2):
arctan = (2*(A*A*B-X))/(A**3)
else:
arctan = A*B*B/(2*X)
ans = math.degrees(math.atan(arctan))
print(ans)
|
p03472
|
s498790530
|
Accepted
|
n,h = map(int,input().split())
a = [0]*n
b = [0]*n
for i in range(n):
a[i], b[i] = map(int,input().split())
a = sorted(a, reverse=True)
b = sorted(b, reverse=True)
c = 0
j = 0
while j<n:
if b[j] > a[0]:
c += b[j]
else:
break
j += 1
if c >= h:
break
if c < h:
j += -(-(h-c)//a[0])
print(j)
|
p02697
|
s965549792
|
Accepted
|
N, M = map(int, input().split())
n = 2*M+1
# Mが奇数の場合
if M%2==1:
for i in range(1, M//2+1):
print('{} {}'.format(i,M+1-i))
for i in range(1, (M+1)//2+1):
print('{} {}'.format(M+i,2*M+2-i))
# Mが偶数の場合
else:
for i in range(1, M//2+1):
print('{} {}'.format(i,M+2-i))
for i in range(1, M//2+1):
print('{} {}'.format(M+i+1,2*M+2-i))
|
p03077
|
s862897386
|
Accepted
|
N = int(input())
abcde = [int(input()) for _ in range(5)]
m = min(abcde)
ans = (N + m - 1) // m
ans += 4
print(ans)
|
p03408
|
s377560482
|
Accepted
|
N = int(input())
S = list()
for i in range(N):
S.append(input())
M = int(input())
T = list()
for i in range(M):
T.append(input())
count = 0
maxcount = 0
for i in range(N):
count = 0
for j in range(N):
if S[i] == S[j]:
count += 1
for j in range(M):
if S[i] == T[j]:
count -= 1
if count > maxcount:
maxcount = count
print(maxcount)
|
p02606
|
s556849409
|
Accepted
|
l, r, d = map(int, input().split())
print(len([i for i in range(l, r+1) if i % d == 0]))
|
p03565
|
s746417704
|
Wrong Answer
|
def check(s, t, k):
for i in range(len(t)):
if s[i+k] != t[i] and s[i+k] != '?':
return False
return True
def construct(s, t, k):
for i in range(len(t)):
s[i+k] = t[i]
for i in range(len(s)):
if s[i] == '?':
s[i] = 'a'
return "".join(s)
def resolve():
s = list(input())
t = list(input())
if len(s) < len(t):
print('UNRESTORABLE')
return
for i in range(len(s) - len(t) + 1):
if check(s, t, i):
print(construct(s, t, i))
return
print('UNRESTORABLE')
resolve()
|
p02909
|
s869729307
|
Accepted
|
n = input()
w = ["Sunny", "Cloudy", "Rainy"]
for i in range(3):
if w[i]==n:
break
print(w[(i+1)%3])
|
p03474
|
s526011211
|
Wrong Answer
|
a,b = map(int,input().split())
s = input()
ans = ["0","1","2","3","4","5","6","7","8","9"]
ch1 = list(map(str,s[:a]))
ch2 = list(map(str,s[b:]))
count = 0
for i in range(len(ch1)):
if ch1[i] not in ans:
count +=1
for j in range(len(ch2)):
if ch2[i] not in ans:
count += 1
if count == 0 and s[a] == "-":
print("Yes")
else:
print("No")
|
p03633
|
s117399624
|
Accepted
|
import fractions
from functools import reduce
def lcm(x, y):
return (x * y) // fractions.gcd(x, y)
def lcm_for_lst(lst):
return reduce(lcm, lst)
n = int(input())
lst = []
for i in range(n):
t = int(input())
lst.append(t)
print(lcm_for_lst(lst))
|
p02813
|
s230535158
|
Wrong Answer
|
from itertools import permutations
n=int(input())
p=list(map(int,input().split()))
q=list(map(int,input().split()))
l=[]
for i in range(n):
l.append(i+1)
dic= sorted(list(permutations(l,n)))
r=len(dic)
dicp=0
dicq=0
for x in range(r):
dic[x]=list(dic[x])
if dic[x]==p:
dicp=x+1
elif dic[x]==q:
dicq=x+1
print(max(dicp-dicq,dicq-dicp))
|
p03377
|
s866675597
|
Accepted
|
A, B, X=map(int, input().split())
print('YES') if A<=X and A+B>=X else print('NO')
|
p04020
|
s694772980
|
Wrong Answer
|
N = int(input())
cnt = 0
tmp = 0
for i in range(N):
a = int(input())
if tmp ==0:
cnt += a//2
tmp = a%2
elif tmp ==1 and a>0:
cnt += (a+tmp)//2
tmp == (a+tmp)%2
elif a==0:
tmp = 0
print(cnt)
|
p02663
|
s571685361
|
Accepted
|
H1,M1,H2,M2,K= list(map(int, input().split()))
a1 = H1*60+M1
a2 = H2*60+M2
print(a2-a1-K)
|
p03386
|
s134958863
|
Accepted
|
a, b, k = map(int,input().split())
if a+k+1 <= b:
for i in range(a, k+a):
print(i)
if a+k+1 <= b+1-k:
for i in range(b+1-k, b+1):
print(i)
else:
for i in range(a+k, b+1):
print(i)
else:
for i in range(a, b+1):
print(i)
|
p02946
|
s816072280
|
Accepted
|
#B
k,x = map(int,input().split())
min_k = x - k + 1
max_k = x + k - 1
ans = []
for i in range(min_k,max_k+1):
ans.append(i)
print(*ans)
|
p02697
|
s924438116
|
Accepted
|
N, M = map(int, input().split())
d = (N-1)//2
ans = [(1, 1+d)]
while True:
a, b = ans[-1][0]+1, ans[-1][1]-1
if a<b:
ans.append((a, b))
else:
break
ans.append((2+d, 1+2*d))
while True:
a, b = ans[-1][0]+1, ans[-1][1]-1
if a<b:
ans.append((a, b))
else:
break
for a, b in ans[:M]:
print(a, b)
|
p03145
|
s237725742
|
Accepted
|
a,b,c = sorted(map(int, input().split()))
print(a*b//2)
|
p02753
|
s080790381
|
Accepted
|
if __name__ == '__main__':
s = input()
if (s[0] == s[1]) and (s[1] == s[2]):
print("No")
else:
print("Yes")
|
p03836
|
s394976088
|
Accepted
|
def main():
sx, sy, tx, ty = map(int, input().split())
ans = solve(sx, sy, tx, ty)
print(ans)
def solve(sx, sy, tx, ty):
dx = tx - sx
dy = ty - sy
st = 'U' * dy + 'R' * dx
ts = 'D' * dy + 'L' * dx
rt1 = st + ts
rt2 = 'L' + 'U' + st + 'R' + 'D' + 'R' + 'D' + ts + 'L' + 'U'
ans = rt1 + rt2
return ans
if __name__ == '__main__':
main()
|
p03745
|
s244964436
|
Accepted
|
n = int(input())
a = list(map(int,input().split()))
state = 100
count = 1
tmp = a[0]
for i in a:
if i == tmp:
pass
elif i > tmp:
if state == 1:
pass
elif state == 0:
count += 1
state = 100
else:
state = 1
else:
if state == 0:
pass
elif state == 1:
count += 1
state = 100
else:
state = 0
tmp = i
print(count)
|
p03767
|
s827452165
|
Accepted
|
n = int(input())
a = sorted(map(int,input().split()),reverse=True)
ans = 0
t = (n*3)//3
cnt = 0
i = 1
while cnt<t:
cnt += 1
ans += a[i]
i += 2
print(ans)
|
p03659
|
s066222626
|
Accepted
|
n=int(input())
A=list(map(int,input().split()))
S=sum(A)
x=A[0]
y=S-x
xy_min=abs(x-y)
for i in range(1,n-1):
x+=A[i]
y=S-x
xy=abs(x-y)
if xy<xy_min:
xy_min=xy
print(xy_min)
|
p02832
|
s299920855
|
Accepted
|
n = int(input())
a = list(map(int,input().split()))
k = 1
for i in range(n):
if k == a[i]:
k +=1
if k ==1:
print(-1)
else:
print(n-k+1)
|
p03351
|
s218800828
|
Wrong Answer
|
a, b, c, d = map(int,input().split())
if int(a - b) <= d and int(b - c) <= d and int(a - c) <= d:
print('Yes')
else :
print('No')
|
p03145
|
s123708088
|
Wrong Answer
|
a,b,c=map(int,input().split())
print(a*b/2)
|
p04034
|
s558023281
|
Accepted
|
def main():
n, m = input_list()
box = [False]*n
box[0] = True
nums = [1]*n
for i in range(m):
x, y = input_list()
if box[x-1]:
box[y-1] = True
nums[x-1] = nums[x-1] - 1
nums[y-1] = nums[y-1] + 1
if nums[x-1] == 0:
box[x-1] = False
print(box.count(True))
def input_list():
return map(int, input().split())
import math
main()
|
p02548
|
s927885415
|
Accepted
|
def main():
import sys
ikimasu = sys.stdin.buffer.readline
ini = lambda: int(ins())
ina = lambda: list(map(int, ikimasu().split()))
ins = lambda: ikimasu().strip()
n = ini()
rick = 0
import math
for i in range(1,n+1):
rick+=math.floor((n-1)/i)
print(rick)
if __name__ == "__main__":
main()
|
p02628
|
s674213605
|
Accepted
|
n, k = map(int, input().split())
P = tuple(map(int, input().split()))
P = sorted(P)
print(sum(P[:k]))
|
p02952
|
s745122451
|
Wrong Answer
|
n = int(input())
ans = 0
if n < 10:
ans += n
else:
ans += 9
if n < 1000:
ans += max(0, n-999)
else:
ans += 900
if n < 100000:
ans += max(0, n-99999)
else:
ans += 90000
print(ans)
|
p02953
|
s999445192
|
Wrong Answer
|
n = int(input())
h = [int(e) for e in input().split()]
flg = "Yes"
equal = 0
for i in range(n-1):
if equal:
if h[i] > h[i+1]:
flg = "No"
break
else:
h[i] -= 1
if h[i+1] < h[i]:
flg = "No"
break
elif h[i+1] == h[i]:
equal = 1
else:
equal = 0
print(flg)
|
p03592
|
s498682906
|
Wrong Answer
|
#!/usr/bin/env python3
def main():
n, m, k = map(int, input().split())
ans = 'No'
for i in range(n):
for j in range(m):
if n - i + m - j == k:
ans = 'Yes'
print(ans)
if __name__ == "__main__":
main()
|
p02923
|
s035592037
|
Wrong Answer
|
N = int(input())
H = list(map(int, input().split()))
H2 =[0]*(N-1)
for i in range(N-1):
H2[i] = H[i]-H[i+1]
ans = 0
cnt = 0
for i in range(N-1):
if H2[i] >= 0:
cnt += 1
elif H2[1] < 0:
if ans < cnt:
ans = cnt
cnt = 0
else:
cnt = 0
if ans < cnt:
ans = cnt
print(ans)
|
p04043
|
s485070454
|
Accepted
|
from sys import stdin
l = stdin.readline().rstrip().split()
cnt5 = cnt7 = 0
for ln in range(3):
if l[ln] == '5' : cnt5 += 1
if l[ln] == '7' : cnt7 += 1
if cnt5 == 2 and cnt7 == 1 : print('YES')
else : print('NO')
|
p02759
|
s044422244
|
Wrong Answer
|
import math
N = int(input())
number_of_pages = math.floor(N / 2)
print(number_of_pages)
|
p03035
|
s938419080
|
Accepted
|
a, b = map(int, input().split())
if a <= 5:
fare = 0
elif a <= 12:
fare = b // 2
else:
fare = b
print(fare)
|
p03693
|
s333875397
|
Wrong Answer
|
p = input().split()
s = int(p[0])*100 + int(p[1])*10 + int(p[2])
print(s)
if s % 4 == 0:
print("YES")
else:
print("NO")
|
p02783
|
s107488399
|
Accepted
|
a, b = map(int, input().split())
if a % b == 0:
print(a // b)
else:
print(a // b + 1)
|
p03592
|
s546130775
|
Accepted
|
def readinput():
n,m,k=list(map(int,input().split()))
return n,m,k
def main(n,m,k):
for x in range(0,m+1):
for y in range(0,n+1):
if (n-y)*x+y*(m-x)==k:
return 'Yes'
return 'No'
if __name__=='__main__':
n,m,k=readinput()
ans=main(n,m,k)
print(ans)
|
p02786
|
s660129350
|
Accepted
|
H = int(input())
memo = {}
def attack(h):
if h in memo: return memo[h]
if h <= 1:
memo[h] = 1
return memo[h]
else:
memo[h//2] = attack(h//2)
return 1 + memo[h//2] + memo[h//2]
print(attack(H))
|
p02548
|
s494697420
|
Accepted
|
N = int(input())
res = 0
for i in range(1,N+1):
Q = (N-1)//i
res += Q
print(res)
|
p03836
|
s526781090
|
Wrong Answer
|
sx, sy, tx, ty = map(int, input().split())
x = ['R', 'L'] if tx - sx > 0 else ['L', 'R']
y = ['U', 'D'] if ty - tx > 0 else ['D', 'U']
abs_x = abs(tx - sx)
abs_y = abs(ty - sy)
i = 0
ans = ''
ans += y[0] * abs_y + x[0] * abs_x
ans += y[1] * abs_y + x[1] * abs_x
ans += x[1]
ans += y[0] * (abs_y + 1) + x[0] * (abs_x + 1)
ans += y[1]
ans += x[0]
ans += y[1] * (abs_y + 1) + x[1] * (abs_x + 1)
ans += y[0]
print(ans)
|
p02629
|
s305733516
|
Accepted
|
from string import ascii_lowercase
N = int(input())
l = []
while N != 0:
N -= 1
l.append(N%26)
N //= 26
print("".join(ascii_lowercase[x] for x in l[::-1]))
|
p02989
|
s032564504
|
Accepted
|
n = int(input())
di = list(map(int, input().split()))
di.sort()
print(di[n//2] - di[n//2 - 1])
|
p03944
|
s199457957
|
Accepted
|
import numpy as np
W, H, N = map(int, input().split())
c = np.zeros((W, H), int)
for i in range(N):
x, y, a = map(int, input().split())
if a == 1:
c[:x, :] = 1
elif a == 2:
c[x:, :] = 1
elif a == 3:
c[:, :y] = 1
else:
c[:, y:] = 1
ans = W * H - np.sum(c)
print(ans)
|
p03475
|
s552451833
|
Accepted
|
n = int(input())
li=[list(map(int,input().split())) for _ in range(n-1)]
for i in range(n-1):
ans=li[i][1]+li[i][0]
for j in range(i+1,n-1):
if ans>=li[j][1]:
if ans%li[j][2]==0:
ans+=li[j][0]
else:
ans=(ans//li[j][2]+1)*li[j][2]+li[j][0]
else:
ans=li[j][1]+li[j][0]
print(ans)
print("0")
|
p02681
|
s272838646
|
Wrong Answer
|
s=list(input())
t=list(input())
if s==t[:len(s)]:
print("Yse")
else:
print("No")
|
p02797
|
s456702628
|
Wrong Answer
|
N,K,S = map(int, input().split())
for i in range(K):
print(S,end=" ")
for i in range(N-K):
print(10**10,end=" ")
|
p03705
|
s875171701
|
Accepted
|
N, A, B = map(int,input().split())
ans = (A+(B*(N-1)))-(B+(A*(N-1)))+1
if ans < 0:
ans =0
print(ans)
|
p02732
|
s071682413
|
Wrong Answer
|
n = int(input())
A = list(map(int,input().split()))
S={}
for i in range(n):
a = A[i]
if a in S :
S[a]+=1
else:
S[a]=1
V=list(S.values())
c = sum([v*(v-1)//2 for v in V])
cdiff=0
K=[]
for i in range(n):
a = A[i]
s=S[a]
if s>=2 :
cdiff=(s*(s-1)-(s-1)*(s-2))//2
print(c-cdiff)
|
p03778
|
s168176786
|
Accepted
|
s = input().split()
w = int(s[0])
a = int(s[1])
b = int(s[2])
answer = 0
if a + w < b:
answer = b - (a + w)
else:
answer = a - (b + w)
if (a <= b and b <= a + w) or (a <= b + w and b + w <= a + w):
answer = 0
print(answer)
|
p02760
|
s651000055
|
Accepted
|
import sys
import numpy as np
readline = sys.stdin.buffer.readline
a = np.array([])
for _ in range(3):
a = np.append(a,list(map(int, readline().split())))
n = int(readline())
a = a.reshape(3,3)
a_2 = np.append(a,np.diag(a))
a_2 = np.append(a_2,[a[0][2],a[1][1],a[2][0]])
a_2 = a_2.reshape(5,3)
for _ in range(n):
temp=int(readline())
a[a==temp]=0
a_2[a_2==temp]=0
print('Yes' if 0 in np.sum(a_2, axis=1) or 0 in np.sum(a, axis=0) else 'No')
|
p03075
|
s275298508
|
Accepted
|
a, b, c, d, e, k = (int(input()) for _ in range(6))
print('Yay!' if abs(a-e) <= k else ':(')
|
p02630
|
s170047702
|
Wrong Answer
|
N=int(input())
A=list(map(int,input().split()))
Q=int(input())
D=dict()
s=0
for i in A:
s+=i
if i in D:
D[i]+=1
else:
D[i]=1
for _ in range(Q):
b,c=map(int,input().split())
if b in D:
s+=(c-b)*D[b]
if c in D:
D[c]+=D[b]
else:
D[c]=D[b]
print(s)
|
p02621
|
s683718752
|
Accepted
|
a = int(input())
print(a+a**2+a**3)
|
p02688
|
s376771651
|
Accepted
|
n, k = list(map(int, input().split()))
d = list()
s = set()
for _ in range(k):
d = int(input())
A = list(map(int, input().split()))
for a in A:
s.add(a)
c = 0
for i in range(1, n+1):
if i not in s:
c += 1
print(c)
|
p02708
|
s647690635
|
Wrong Answer
|
n,k=map(int,input().split())
ans=0
for i in range(k,n+2):
mi=i*(i-1)//2
ma=(2*n-i-1)*i//2
ans+=ma-mi+1
print(ans)
|
p02623
|
s281826102
|
Accepted
|
import bisect
n, m, k = map(int, input().split())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
a = [0]+a
b = [0]+b
ans = 0
for i in range(1, n):
a[i+1] += a[i]
for i in range(1, m):
b[i+1] += b[i]
for i in range(n+1):
res = k - a[i]
if res<0: continue
index = bisect.bisect_right(b, res)
ans = max(ans, index+i-1)
print(ans)
|
p02756
|
s529959360
|
Wrong Answer
|
from collections import deque
s = deque(input())
q = int(input())
flag = 1
for i in range(q):
st = input().split()
if int(st[0]) == 1:
flag *= -1
else:
tmp = int(st[1])*flag
if tmp == 1 or -2:
s.appendleft(st[2])
else:
s.append(st[2])
if flag == -1:
s.reverse()
print(''.join(s))
|
p03317
|
s006908066
|
Wrong Answer
|
S = input().split(" ")
N = int(S[0])
K = int(S[1])
ARR = input().split(" ")
import re
import math
def calculate(n,k,arr):
miniest = int(min(arr))
s = "".join(arr)
brr = re.split(str(miniest)+'{1,}',s)
counts = 0
for br in brr:
counts += math.ceil(len(br) / (k-1))
return counts
result = calculate(N,K,ARR)
print(result)
|
p02553
|
s725522582
|
Accepted
|
a, b, c, d = map(int, input().split())
print(max(a*d, a*c, b*c, b*d))
|
p02811
|
s436289939
|
Accepted
|
K, X = map(int, input().split())
print("Yes" if 500 * K >= X else "No")
|
p02554
|
s722403062
|
Accepted
|
inf = pow(10,9)+ 7
n=int(input())
if n==1:
print(0)
elif n==2:
print(2)
else:
f=pow(10,n,inf) - 2*pow(9,n,inf) + pow(8,n,inf)
print(f%inf)
|
p03095
|
s994265099
|
Accepted
|
def resolve():
'''
code here
'''
import sys
N = int(input())
S = sys.stdin.readline().strip()
mod = pow(10, 9) + 7
set_S = set([item for item in S])
res = 1
for s in set_S:
cnt = 1
for letter in S:
if s == letter:
cnt += 1
res *= cnt
res %= mod
mod = pow(10, 9) + 7
print(res-1)
if __name__ == "__main__":
resolve()
|
p03038
|
s091596375
|
Wrong Answer
|
N, M = map(int, input().split())
A = list(map(int, input().split()))
A.sort()
L = []
for i in range(M):
B, C = map(int, input().split())
L.append([C, B])
L.sort(reverse=True)
S = [0 for i in range(N)]
i, j = 0, 0
while j < N and i < len(L):
if j+L[i][1] < N:
for k in range(L[i][1]):
S[j+k] = L[i][0]
j += L[i][1]
else:
for k in range(j, N):
S[k] = L[i][0]
i += 1
print(sum(max(S[i], A[i]) for i in range(N)))
|
p02916
|
s403904673
|
Wrong Answer
|
n = int(input())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = list(map(int, input().split()))
m = 0
for i in range(n):
m += b[a[i]-1]
if i==0:
continue
elif i==n-1:
continue
if a[i] == a[i-1]+1:
m += c[i-1]
print(m)
|
p02791
|
s204403130
|
Wrong Answer
|
import bisect
n = int(input())
ARR = list(map(int,input().split()))
arr =ARR[::-1]
lis =[arr[0]]
for i in range(1,n):
pos = bisect.bisect_right(lis,arr[i])
if arr[i] >=lis[-1]:
lis.append(arr[i])
else:
lis[pos]=arr[i]
print(len(lis))
|
p04031
|
s357939347
|
Wrong Answer
|
n = int(input())
a = [int(i) for i in input().split()]
m_cost = 10 ** 5
for i in range(min(a), max(a)+1):
cost = 0
for j in range(n):
cost += (a[j] - i) ** 2
m_cost = min(m_cost, cost)
print(m_cost)
|
p03067
|
s715445225
|
Wrong Answer
|
a, b, c = [int(i) for i in input().split()]
if a < c < b:
print("Yes")
else:
print("No")
|
p03555
|
s672839951
|
Accepted
|
a=input()
b=input()[::-1]
if a==b:
print("YES")
else:
print("NO")
|
p03251
|
s284153351
|
Wrong Answer
|
import math
N, M, X, Y = map(int, input().split())
x = list(map(int, input().split()))
y = list(map(int, input().split()))
for Z in range(-100, 101, 1):
if X < Z and Z <= Y and max(x) < Z and min(y) >= Z:
print('No War')
else:
print('War')
|
p03243
|
s892244523
|
Accepted
|
# -*- coding: utf-8 -*-
import math
import itertools
import sys
import copy
# 入力
#A, B, C, D = map(int, input().split())
#L = list(map(int, input().split()))
#S = list(str(input()))
N = int(input())
b = 111
if N <= b :
print (b)
exit()
while N-b > 111 :
b += 111
b += 111
print (b)
|
p02572
|
s962351494
|
Accepted
|
n=int(input())
list=input().split()
sum=0
for i in range(n):
sum+=int(list[i])
sum=sum*sum
sum2=0
for i in range(n):
sum2+=int(list[i])*int(list[i])
sum-=sum2
sum//=2
sum%=1000000007
print(int(sum))
|
p02602
|
s407540562
|
Accepted
|
n,k = map(int,input().split())
A = list(map(int,input().split()))
#print(A)
L = []
ave = sum(A[:k])
L.append(ave)
for i in range(n-k):
#print(A[i],A[k+i])
ave = ave - A[i] + A[k+i]
L.append(ave)
for i in range(len(L)-1):
if L[i] < L[i+1]:
print("Yes")
else:
print("No")
|
p03076
|
s758759045
|
Wrong Answer
|
import math
a=int(input())
b=int(input())
c=int(input())
d=int(input())
e=int(input())
print(math.ceil(a/10)+math.ceil(b/10)+math.ceil(c/10)+math.ceil(d/10)+math.ceil(e/10))
|
p02642
|
s777727050
|
Accepted
|
N = int(input())
A = list(map(int, input().split()))
M = max(A)+1
cnt = [0]*M
ans = 0
for a in A:
if cnt[a] != 0:
cnt[a] = 2
else:
for i in range(a, M, a):
cnt[i] += 1
for a in A:
if cnt[a] == 1:
ans += 1
print(ans)
|
p02879
|
s512525119
|
Accepted
|
A, B = map(int,input().split())
if A > 9 or B > 9:
print(-1)
else:
print(A * B)
|
p03324
|
s273948659
|
Accepted
|
# -*- coding: utf-8 -*-
d, n = map(int,input().split())
if d == 0:
if n <= 99:
print(n)
else:
print(101)
if d == 1:
if n <= 99:
print(n * 100)
else:
print(10100)
if d == 2:
if n <= 99:
print(n * 10000)
else:
print(1010000)
|
p03760
|
s760633128
|
Wrong Answer
|
a = input()
b = input()+""
for c,d in zip(a,b):
print(c+d,end="")
|
p02708
|
s498851370
|
Wrong Answer
|
n, k = map(int, input().split())
MOD = 1e9+7
def a(m):
s0 = 1
s1 = (m * (n+1)) % MOD
s2 = (m * m) % MOD
return s1 - s2 + s0
s = [0] * (n+2)
for i in range(1,n+2):
#print(i,a(i))
s[i] = s[i-1] + a(i)
print(int(s[n+1] - s[k-1]))
|
p02693
|
s579064965
|
Accepted
|
n = int(input())
a,b = map(int,input().split())
#L = list(map(int,input().split()))
for i in range(a,b+1):
if i%n == 0:
print("OK")
exit()
print("NG")
|
p02802
|
s595621764
|
Accepted
|
d=dict()
wa=ans=0
N,M=map(int,input().split())
for i in range(M):
p,s=input().split()
if p not in d:
d[p]=0
if d[p]>=0 and s=="AC":
ans+=1
wa+=d[p]
d[p]=-float("inf")
else:
d[p]+=1
print(ans,wa)
|
p03274
|
s083759296
|
Wrong Answer
|
n,k = map(int, input().split())
x = list(map(int, input().split()))
ans=10**12
for i in range(n):
if i+k <= n:
t=x[i:i+k]
if min(t)*max(t) > 0:
ans=min(ans, abs(max(t)))
else:
ans=min(ans,min(abs(min(t)),max(t))*2+max(abs(min(t)),max(t)))
print(ans)
|
p03719
|
s059965587
|
Wrong Answer
|
a,b,c=map(int,input().split())
print('Yes' if a<=c<=c else 'No')
|
p03644
|
s455340902
|
Wrong Answer
|
n = int(input())
ans = 0
for i in range(n):
if i**2<=n:
ans = i**2
print(ans)
|
p02607
|
s878680968
|
Accepted
|
n=int(input())
a=list(map(int,input().split()))
count=0
for i in range(n):
if (i+1)%2!=0:
if a[i]%2!=0:
count+=1
print(count)
|
p02594
|
s122310108
|
Wrong Answer
|
x=int(input())
if(x>=30):
print("YES")
else:
print("NO")
|
p02556
|
s811355062
|
Accepted
|
import sys
input = sys.stdin.readline
N = int(input())
xy = [[int(i) for i in input().split()] for _ in range(N)]
d1 = []
d2 = []
for x, y in xy :
d1.append(x + y)
d2.append(x - y)
d1.sort(reverse=True)
d2.sort(reverse=True)
print(max(
d1[0] - d1[-1],
d2[0] - d2[-1],
))
|
p03524
|
s112824692
|
Accepted
|
from collections import Counter
s = input()
s_counter = Counter(s)
s = [0]*3
s[0] = s_counter["a"]
s[1] = s_counter["b"]
s[2] = s_counter["c"]
if max(s)-min(s) >= 2:
print("NO")
else:
print("YES")
|
p02547
|
s177504394
|
Wrong Answer
|
import sys
input = sys.stdin.readline
from collections import *
N = int(input())
D = [tuple(map(int, input().split())) for _ in range(N)]
for i in range(N-3):
if D[i][0]==D[i][1] and D[i+1][0]==D[i+1][1] and D[i+2][0]==D[i+2][1]:
print('Yes')
exit()
print('No')
|
p03285
|
s224098559
|
Wrong Answer
|
n = int(input())
c = 0
ans = 'No'
for i in range(15):
for j in range(26):
c = 4 * j + 7 * i
if n == c:
ans = 'Yes'
break
print(ans)
|
p02642
|
s648199254
|
Accepted
|
#D-Not Divisible
#pdf見た
n = int(input())
a = list(map(int,input().split()))
a = sorted(a)
maxi = a[-1]
boo = [True]*(maxi+1)
for i in range(n):
k = a[i]
if not boo[k]:
continue
if i != n-1 and k == a[i+1]:
boo[k] = False
for j in range(2,maxi//k+1):
boo[k*j] = False
count = 0
for k in a:
if boo[k] == True:
count += 1
print(count)
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.