problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p02820 | s334272145 | Wrong Answer | n, k = map(int, input().split())
r, s, p = tuple(map(int, input().split()))
t = input()
point = {"r":p, "s":r, "p":s}
log = [0 for _ in range(k)]
ans = 0
for i, play in enumerate(t):
if point[play] == log[i % k]:
log[i % k] = 0
continue
log[i % k] = point[play]
ans += point[play]
print(ans) |
p02948 | s421742736 | Accepted | import heapq
n, m = map(int, input().split())
l = [[] for _ in range(m)]
for i in range(n):
a, b = map(int, input().split())
if a <= m:
l[a-1].append(b)
a = []
ans = 0
for i in range(m):
for j in l[i]:
heapq.heappush(a, (-1) * j)
if a:
ans += heapq.heappop(a) * (-1)
print(ans)
|
p02813 | s302571339 | Accepted | # coding: utf-8
from itertools import permutations
N = int(input())
P = list(map(str, input().split()))
Q = list(map(str, input().split()))
l = list(permutations(P))
l.sort()
ll = []
for i in range(len(l)):
a = list(map(str, l[i]))
ll.append("".join(a))
p_idx = ll.index("".join(P))
q_idx = ll.index("".join(Q))
print(abs(p_idx - q_idx)) |
p03309 | s891429191 | Accepted | def main():
N = int(input())
A = list(map(int,input().split()))
B = [A[i-1] - i for i in range(1,N+1)]
B.sort()
b = B[N // 2] if N%2 == 1 else round((B[N // 2 - 1] + B[N // 2]) / 2)
print(sum([abs(bb -b) for bb in B]))
return
if __name__ == "__main__":
main() |
p02880 | s834475628 | Accepted | n = int(input())
s = {1}
for i in range(1, 10):
for k in range(1, 10):
s.add(i * k)
if n in s:
print('Yes')
else:
print('No')
|
p02556 | s001188265 | Accepted | n=int(input())
INF=float('inf')
cmin0,cmax0=INF,-INF
cmin1,cmax1=INF,-INF
for _ in range(n):
x,y=map(int,input().split())
cx,cy=x-y,x+y
cmin0=min(cmin0,cx)
cmax0=max(cmax0,cx)
cmin1=min(cmin1,cy)
cmax1=max(cmax1,cy)
ans=max(cmax0-cmin0,cmax1-cmin1)
print(ans) |
p03030 | s889306706 | Accepted | n = int(input())
rests = {}
for i in range(n):
s,p = input().split()
p = int(p)
if s in rests:
rests[s].append((i+1,p))
else:
rests[s] = [(i+1,p)]
for s in sorted(list(rests)):
rest = rests[s]
rest.sort(key = lambda x:x[1], reverse = True)
for i,p in rest:
print(i)
|
p02665 | s620930800 | Accepted | #葉の総和-1=分岐の数
n=int(input())
a=list(map(int,input().split()))
s=sum(a)-1
ans,x=0,1
for i in range(n):
if a[i]>x-1:
print(-1)
exit()
ans+=x
x-=a[i]
if i<n-1 and x<=0:
print(-1)
exit()
if s>=0:
if s>=x:
s-=x
x=x*2
else:
x=(x-s)+s*2
s=0
if x!=a[-1] or x<=0:
print(-1)
exit()
ans+=x
print(ans) |
p02783 | s712979336 | Accepted | import math
H,A = map(int, input().split())
print(math.ceil(H/A)) |
p03416 | s796182191 | Wrong Answer | a, b = map(int, input().split())
c = 0
while a <= b:
if str(a)[:2] == str(a)[3:]:
c += 1
a += 1
print(c) |
p03836 | s417759004 | Accepted | sx, sy, tx, ty = map(int, input().split())
dx = abs(tx - sx)
dy = abs(ty - sy)
s = ["L"]+["U"]*(dy+1)+["R"]*(dx+1)+["D"] + ["R"]+["D"]*(dy+1)+["L"]*(dx+1)+["U"] + ["U"]*dy+["R"]*dx + ["D"]*dy+["L"]*dx
print("".join(s)) |
p03206 | s346023240 | Accepted | d=int(input())
if d==25:
print("Christmas")
elif d==24:
print("Christmas Eve")
elif d==23:
print("Christmas Eve Eve")
else:
print("Christmas Eve Eve Eve") |
p03219 | s022628974 | Wrong Answer | a,b = map(int,input().split())
print(b/2+a) |
p03274 | s435294051 | Accepted | import sys
input = sys.stdin.readline
def main():
N, K = map(int, input().split())
X = [int(c) for c in input().split()]
def fullsearch():
for i in range(N-K+1):
l = X[i]
r = X[i+K-1]
distance = abs(r - l)
yield distance + abs(r)
yield distance + abs(l)
print(min(fullsearch()))
main() |
p03433 | s717410577 | Accepted | n, a = [int(input()) for _ in range(2)]
print('Yes' if n%500<=a else 'No') |
p04034 | s868355904 | Accepted | n,m=map(int,input().split())
ans=[False]*n
ans[0]=True
co=[1]*n
for i in range(m):
x,y=map(int,input().split())
ans[y-1]|=ans[x-1]
co[x-1]-=1
co[y-1]+=1
if co[x-1]==0:ans[x-1]=False
print(ans.count(True)) |
p03797 | s948708171 | Accepted | def main():
# import sys
# readline = sys.stdin.buffer.readline
# readlines = sys.stdin.buffer.readlines
N, M = map(int, input().split())
cnt = 0
if N >= M // 2:
cnt = M // 2
else:
cnt += N
M -= 2 * N
cnt += M // 4
print(cnt)
if __name__ == "__main__":
main()
|
p02646 | s475940994 | Accepted | A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())
if abs(A-B) <= (V-W) * T:
print("YES")
else:
print("NO")
|
p02659 | s868345471 | Accepted | from decimal import *
a, b = map(Decimal, input().split())
c = int(a * b)
print(c) |
p03161 | s815149023 | Accepted | N,K = map(int,input().split())
h = list(map(int,input().split()))
cost = [0]
for i in range(2,N+1):
cost.append( min([cost[j] + abs(h[i-1]-h[j]) for j in range(max(0,i-K-1), i-1)]) )
print(cost[-1])
|
p02713 | s238495372 | Wrong Answer | k = int(input())
def gcd(a,b,c):
s = [a,b,c]
s.sort()
a,b,c = s
for n in range(1,a+1):
if a % n == 0 and b % n == 0 and c % n == 0:
yakusu = n
return n
total = 0
for x in range(1,k+1):
for y in range(1,k+1):
for z in range(1,k+1):
total += gcd(x,y,z)
print(total)
|
p02697 | s883481235 | Wrong Answer | n,m = map(int, input().split())
l = 1
r = n
cnt = 0
while cnt < m:
print(l,r)
l += 1
r -= 1
cnt += 1 |
p03289 | s876390869 | Accepted | s = list(input())
if s[0]!="A":
print("WA")
exit()
else:
del s[0]
cnt=0
for i in range (1,len(s)-1):
if s[i]=="C":
cnt+=1
if cnt==1:
del s[s.index("C")]
else:
print("WA")
exit()
for i in range(len(s)):
if s[i].islower()==True:
continue
else:
print("WA")
exit()
print("AC") |
p02946 | s991907188 | Wrong Answer | K,X =map(int,input().split())
l = []
for i in range(X-K+1,X+K):
l.append(str(i))
##print(l)
print(",".join(l))
|
p02948 | s294276024 | Wrong Answer | import bisect
N, M = map(int, input().split())
X = []
for i in range(N):
X.append(list(map(int, input().split())))
X.sort(key=lambda x: (-x[1], x[0]))
days = [i for i in range(1, M+1)]
ans = 0
for a, b in X:
if len(days) == 0:
break
if days[-1] < a:
continue
left = bisect.bisect_right(days, a)
if left > 0:
days.pop(left-1)
elif left == 0 and days[0] >= a:
days.pop(0)
else:
continue
ans += b
print(ans) |
p03087 | s208840751 | Wrong Answer | n, q = map(int, input().split())
s = input()
lst = [0] * (n + 1)
reach = False
for i in range(n):
if s[i] == 'A':
reach = True
lst[i + 1] = lst[i]
else:
if reach and s[i] == 'C':
lst[i + 1] = lst[i] + 1
else:
lst[i + 1] = lst[i]
lst.pop(0)
#print(lst)
for i in range(q):
l, r = map(int, input().split())
print(lst[r - 1] - lst[l - 1]) |
p03076 | s164594822 | Accepted | a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
menu = [a, b, c, d, e]
mintime = 9
minindex = 4
for i, m in enumerate(menu):
if m % 10 == 0:
continue
if m % 10 < mintime:
minindex = i
mintime = m % 10
ans = menu[minindex]
for i, m in enumerate(menu):
if i == minindex:
continue
if m % 10 != 0:
m += 10 - m % 10
ans += m
print(ans)
|
p02790 | s922464925 | 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())
a, b = map(int, input().split())
x = ""
y = ""
for _ in range(b) :
x += str(a)
for _ in range(a) :
y += str(b)
if int(x) >= int(y) :
print (int(x))
else :
print (int(y))
|
p02688 | s600011816 | Accepted | N, K = input().split()
sunuke = []
for n in range(int(N)):
sunuke.append([])
for k in range(int(K)):
people = input()
no = input().split()
for i in no:
sunuke[int(i)-1].append(int(K))
target = []
for i in range(int(N)):
if len(sunuke[i]) == 0:
target.append(i)
print(len(target)) |
p04020 | s233773078 | Accepted | n = int(input())
a = [0]*n
for i in range(n):
a[i] = int(input())
ans = 0
for i in range(n-1):
if a[i] >= 2:
ans += a[i]//2
a[i] = a[i]%2
if a[i] == 1 and a[i+1] >= 1:
ans += 1
a[i] -= 1
a[i+1] -= 1
print(ans+a[-1]//2)
|
p02677 | s019280993 | Accepted | import math
a, b, h, m = map(int, input().split())
a_angle = h * 30 + m / 2
b_angle = m * 6
cos_x = math.cos(math.radians(a_angle-b_angle))
d = math.sqrt(a ** 2 + b ** 2 - 2 * a * b * cos_x)
print(d)
|
p02861 | s803360714 | Accepted | from itertools import permutations, combinations
import math
def factorial(num):
if num <= 1:
return 1
return num * factorial(num - 1)
n = int(input())
xy =[list(map(int, input().split())) for _ in range(n)]
ans = 0
for i, j in combinations(range(n), 2):
l = math.sqrt((xy[i][0] -xy[j][0]) ** 2 + (xy[i][1] -xy[j][1]) ** 2)
ans += 2 * factorial(n - 2) * (n - 1) * l
print(ans / factorial(n)) |
p03163 | s312902828 | Wrong Answer | n, w = map(int, input().split())
a = [[int(i) for i in input().split(" ")] for j in range(n)]
dp = [[0]*(w+1) for i in range(n+1)]
for i in range(1, n+1):
w_, v_ = a[i-1]
for j in range(1, w+1):
if j < w_:
dp[i][j] = dp[i-1][j]
else:
dp[i][j] = max(dp[i-1][w-w_]+v_, dp[i-1][w])
print(dp[n][w]) |
p02556 | s729433928 | Wrong Answer | n = int(input())
max1 = -100
min1 = 10 ** 10
max0 = -100
min0 = 10 ** 10
for i in range(n):
x,y = list(map(int,input().split()))
k0 = x - y
k1 = x + y
if k0 > max0:
max0 = k0
if k0 < min0:
min0 = k0
if k1 > max1:
max1 = k1
if k1 < min1:
min1 = k1
ans = int(max(max1-min1,max0-min0))
print(ans) |
p03759 | s258689500 | Wrong Answer | a, b, c = map(int,input().split())
print("Yes" if b-a == c-b else "No") |
p03380 | s239661668 | Accepted | def main():
n = int(input())
A = list(map(int, input().split()))
A.sort()
ans = [str((m := A.pop())), ]
m /= 2
A = [(a, abs(a - m)) for a in A]
A.sort(key = lambda x: x[1])
ans.append(str(A[0][0]))
print(' '.join(ans))
if __name__ == '__main__':
main()
|
p03037 | s188967145 | Accepted | n,m = map(int, input().split())
ns = set(i+1 for i in range(n))
l_min = 0
r_max = n
for i in range(m):
l, r = map(int, input().split())
l_min = max(l_min, l)
r_max = min(r_max, r)
print(max(r_max - l_min+1, 0))
|
p04029 | s346637753 | Accepted | text = int(input())
answer = 0
for i in range(text):
answer += i + 1
print(answer)
|
p02912 | s360722925 | Accepted | import heapq
N, M = map(int, input().split())
A = list(map(int, input().split()))
A = list(map(lambda x: x*(-1), A))
heapq.heapify(A)
for _ in range(M):
Max = heapq.heappop(A) * -1
heapq.heappush(A, Max//2 * -1)
ans = 0
for i in range(N):
ans += -1 * A[i]
print(ans) |
p02843 | s034532544 | Accepted | x = int(input())
print(1 if x-x//100*100 <= x//100*5 else 0) |
p04029 | s734176871 | Accepted | n = int(input())
print( (1+n)*n//2 )
|
p02916 | s136844423 | Wrong Answer | N = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))
C.append(0)
ans = sum(B) + sum(C) - C[A[N-1] - 1]
print(ans) |
p02820 | s026001524 | Accepted | n, k = map(int, input().split())
s, p, r = map(int, input().split())
t = input()
ans = 0
for i in range(k):
pre = "0"
for j in t[i::k]:
if j != pre:
pre = j
if j == "s":
ans += s
elif j == "p":
ans += p
else:
ans += r
else:
pre = "0"
print(ans) |
p02727 | s353055211 | Wrong Answer | X,Y,A,B,C = map(int,input().split())
ps = list(map(int, input().split()))
qs = list(map(int, input().split()))
rs = list(map(int, input().split()))
ans = sorted(qs)[-X:] + sorted(ps)[-Y:] + sorted(rs)
print(str(sum(sorted(ans)[-X-Y:]))) |
p03994 | s756968618 | Accepted | a = list(input())
k = int(input())
abc = "abcdefghijklmnopqrstuvwxyz"
c = 0
for e,i in enumerate(a[:-1]):
# print(26-abc.index(i))
if k-26+abc.index(i)>=0 and i!='a':
a[e] = 'a'
k-=26-abc.index(i)
# print(k)
k+=abc.index(a[-1])
k%=26
a[-1] = abc[k]
print("".join(a)) |
p03457 | s443734490 | Accepted | n = int(input())
l = [[0, 0, 0]] + list(list(map(int, input().split())) for i in range(n))
for i in range(1, n+1):
dt = l[i][0] - l[i-1][0]
dx = abs(l[i][1] - l[i-1][1])
dy = abs(l[i][2] - l[i-1][2])
tmp = dt - dx - dy
if tmp < 0 or tmp % 2 == 1:
print('No')
break
else:
print('Yes')
|
p02578 | s309760350 | Accepted | import math
def main():
n = int(input())
a_li = list(map(int,input().split()))
ans = 0
for i in range(1,n):
if(a_li[i] >= a_li[i-1]):
continue
ans += a_li[i-1] - a_li[i]
a_li[i] = a_li[i-1]
print(ans)
if __name__ == "__main__":
main() |
p03043 | s186500385 | Accepted | n, k = map(int, input().split())
ans = 0
for i in range(1,n+1):
t = 1
while i * t < k:
t *= 2
ans += 1 / t
print(ans / n)
|
p03803 | s932639099 | Accepted | # 入力
A, B = map(int, input().split())
# 同じなら引き分け、1が出たら勝ち、大きい方が勝ち
if A == B:
print('Draw')
elif A == 1:
print('Alice')
elif B == 1:
print('Bob')
elif A > B:
print('Alice')
elif A < B:
print('Bob') |
p03317 | s989738263 | Accepted | import sys
import math
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
for i in range(N):
if A[i] == 1:
ans = N
for j in range(max(0, i-(K-1)), min(N, i+K-1)):
ans = min(math.ceil(j/(K-1)) + math.ceil((N-j-1)/(K-1)), ans)
break
print(ans) |
p02640 | s278713458 | Accepted | n,m = map(int,input().split())
if m%2==1 or m//2<n or m//2-n>n:
print('No')
exit()
print('Yes')
|
p03852 | s215334451 | Accepted | c = input()
if c == 'a' or c == 'i' or c == 'u' or c == 'e' or c == 'o':
print('vowel')
else:
print('consonant') |
p03637 | s523765583 | Accepted | n=int(input())
a=list(map(int,input().split()))
two=0
four=0
other=0
for i in range(n):
if a[i]%4==0:
four+=1
elif a[i]%2==0:
two+=1
else:
other+=1
if four>=two+other-1:
print("Yes")
elif four>=two%2+other-1:
print("Yes")
else:
print("No")
|
p03041 | s790195107 | Accepted | n, k = map(int, input().split())
s = input()
ans = ''
for i in range(n):
if i == k - 1:
ans += s[i].lower()
else:
ans += s[i]
print(ans)
|
p02717 | s598505465 | Accepted |
x, y, z = (int(x) for x in input().split())
temp = y
y = x
x = temp
temp = z
z = x
x = temp
print(x,y,z) |
p02723 | s995289858 | Wrong Answer | S = list(input())
if S[2] == S[3]:
if S[4] == S[5]:
print("Yse")
else:
print("No")
else:
print("No") |
p02707 | s143020146 | Accepted | n = int(input())
a = list(map(int,input().split()))
ans = [0]*(n)
for i in a:
ans[i-1] += 1
for j in ans:
print(j) |
p03208 | s200190901 | Accepted | n,k=map(int,input().split());h=sorted([int(input()) for _ in range(n)])
print(min([h[i+k-1]-h[i] for i in range(n-k+1)])) |
p02811 | s579134825 | Accepted | k,x=map(int,input().split())
if 500*k>=x:
print("Yes")
else:
print("No") |
p03434 | s126946513 | Accepted | # solution
import io
n = input()
m = sorted(list(map(int,input().split())),reverse=True)
print(sum(m[0::2])-sum(m[1::2])) |
p03087 | s178967717 | Accepted | n, q = map(int, input().split())
s = list(input())
s.append("")
cusum = [0]*(len(s))
for i in range(len(s)-1):
if s[i] == "A" and s[i+1] == "C":
cusum[i+1] = cusum[i] + 1
else:
cusum[i+1] = cusum[i]
for _ in range(q):
l, r = map(int, input().split())
print(cusum[r-1] - cusum[l-1])
|
p03127 | s996990283 | Wrong Answer | n = int(input())
a = [int(x) for x in input().split()]
buf = sum(a)
mn = min(a)
if (buf-mn) % mn == 0:
print(mn)
else:
print((buf-mn)%mn)
|
p03759 | s978560485 | Accepted | a,b,c=map(int,input().split())
print("YNEOS"[(b-a!=c-b)::2]) |
p03815 | s859787573 | Accepted | x = int(input())
cnt = 2 * (x // 11)
cnt += (0 if x % 11 == 0 else 1 if x % 11 <= 6 else 2)
print(cnt) |
p03206 | s029093698 | Accepted | d = int(input())
s = ['Christmas Eve Eve Eve','Christmas Eve Eve','Christmas Eve','Christmas']
print(s[d-22]) |
p03150 | s143803276 | Wrong Answer | s=input()
k='keyence'
if k in s:
exit(print('YES'))
for i in range(len(k)):
print(s[:i], s[len(k)-i:])
if s[:i]+s[len(s)-len(k)+i:] == k:
exit(print('YES'))
print('NO')
|
p02596 | s502024006 | Accepted | k= int(input())
seen = [0]*(k+1)
rem=0
for i in range(0,k+1):
rem = (rem*10+7) % k
# print(rem)
if rem == 0:
print(i + 1)
break
elif seen[rem] ==1:
print('-1')
break
else:
seen[rem] =1 |
p03471 | s401513516 | Wrong Answer | import sys
n, y = map(int, input().split())
for i in range(n):
for j in range(n - i):
k = n - i - j
if 10000 * i + 5000 * j + 1000 * k == y:
print(i, j, k)
sys.exit()
print('-1, -1, -1') |
p02730 | s475712746 | Accepted | # -*- coding: utf-8 -*-
def check_palindrome(S):
for i in range(int(len(S) / 2)):
if S[i] != S[-1 * (i + 1)]:
return False
return True
S = input()
if not check_palindrome(S):
print('No')
else:
if not check_palindrome(S[:int(len(S) / 2)]):
print('No')
else:
if not check_palindrome(S[int(len(S) / 1) + 2:]):
print('No')
else:
print('Yes') |
p02554 | s990637414 | Accepted | num=int(input())
num2=[10, 9 ,8]
num2a=map(int, num2)
def multi(x):
y=x**num
return y
a, b, c=map(multi, num2a)
print((a-2*b+c)%(int(1e9+7))) |
p02554 | s810527803 | Accepted | N=int(input())
if N==1:
print(0)
exit()
MOD=10**9+7
ALL=pow(10,N,MOD)
No0=pow(9,N,MOD)
No9=pow(9,N,MOD)
No09=pow(8,N,MOD)
ans=ALL-No9-No0+No09+MOD
print(ans%MOD)
|
p02697 | s778166086 | Accepted | #E
import numpy as np
n, m = list(map(int, input().split()))
lists = list(np.arange(1, n+1))
list1 = lists[:m]
list2 = lists[m:]
num = m
for i in range(m//2 +1):
if num == 0:
break
print(list2[i],list2[m+1-i-1])
num -= 1
if num == 0:
break
print(list1[i],list1[m-i-1])
num -= 1 |
p03611 | s663472744 | Accepted | N=int(input())
A=list(map(int,input().split()))
ans=[0]*(max(A)+3)
for a in A:
ans[a-1]+=1
ans[a]+=1
ans[a+1]+=1
print(max(ans)) |
p02802 | s054343358 | Wrong Answer | n,m=map(int,input().split())
TF=[0]*n
p=[0]*n
for _ in range(m):
i,s =map(str,input().split())
i=int(i)-1
if (s=="WA") and TF[i]==0:
p[i]+=1
elif (s=="WA")and TF[i]==1:
pass
elif s=="AC" and TF[i]==0:
TF[i]=1
else:
pass
ac=sum(TF)
pe=sum(p)
print(ac,pe) |
p02618 | s825495525 | Accepted | D=int(input())
C=list(map(int,input().split()))
import sys
S=sys.stdin.readlines()
A=[0]*26
B=[0]*D
k=0
p=C.index(max(C))
for i in range(26):
if C[i]!=0:
k+=C[i]
for i in range(26):
A[i]=int(C[i]/k*D)
for i in range(26):
for j in range(A[i]):
m=max([l if B[l]==0 and l<(D+1)//A[i]*j else 0 for l in range(D)])
B[m]=i+1
for i in range(D):
if B[i]==0:
B[i]=p+1
for i in range(D):
print(B[i])
|
p02700 | s447042574 | Wrong Answer | A,B,C,D = map(int, input().split())
S = 0
while S != 1:
A -=B
C -=D
if A <= 0:
S = 1
print("Yes")
elif C <= 0:
S = 1
print("No")
else:
continue |
p03208 | s852110308 | Accepted | # -*- coding: utf-8 -*-
n, k = map(int,input().split())
h = []
for i in range(n):
h.append(int(input()))
h.sort()
ans = 10 ** 5 * 10 ** 10
for i in range(n - k + 1):
#print(i, i + k - 1)
if h[i + k - 1] - h[i] < ans:
ans = h[i + k - 1] - h[i]
print(ans)
|
p02675 | s744795435 | Wrong Answer | n = list(map(str, input().split()))
n = int(n[-1])
if n==2 or n==4 or n==5 or n==7 or n==9 :
print('hon')
elif n==0 or n==1 or n==6 or n==8:
print('pon')
else:
print('bon') |
p03951 | s809673649 | Accepted | n = int(input())
s = str(input())
t = str(input())
if s == t:
print(n)
exit()
for i in range(n):
#print(s[i:], t[:n-1-i+1])
if s[i:] == t[:n-1-i+1]:
break
else:
i = n
#pass
ans = i*2+(n-i)
print(ans)
|
p03556 | s372822234 | Accepted | N = int(input())
print(int(N**(1/2))**2) |
p03067 | s919260129 | Accepted | a,b,c=map(int,input().split())
if min(a,b)<c and c<max(a,b):
print("Yes")
else:
print("No") |
p03720 | s905601536 | Accepted | a,b=list(map(int,input().split()))
c = [0] * a
for i in range(b):
x,y=list(map(int,input().split()))
c[x-1]=c[x-1]+1
c[y-1]=c[y-1]+1
for j in range(a):
print(c[j]) |
p03645 | s736529300 | Wrong Answer | n, m = map(int, input().split())
A = [list(map(int, input().split())) for _ in range(m)]
A.sort()
aa = []
bb = []
for i in range(m):
if A[i][0]==1 or i>0 and A[i][0] in bb:
aa.append(A[i][0])
bb.append(A[i][1])
if bb[-1]==n and len(set(aa))<=2:
print('POSSIBLE')
exit()
print('IMPOSSIBLE') |
p03565 | s580685568 | Accepted | s = input()
t = input()
ans = []
for i in range(len(s)-len(t)+1):
tmp = s[i:i+len(t)]
flg = True
for j in range(len(t)):
if tmp[j]!=t[j]:
if tmp[j]!='?':
flg = False
if flg:
c = s[:i]+t+s[i+len(t):]
ans.append(c.replace('?', 'a'))
print('UNRESTORABLE' if len(ans)==0 else min(ans)) |
p03352 | s959264341 | Accepted | x = int(input())
a = []
if x==1:
print(1)
else:
for b in range(1,x+1):
for i in range(2,x+1):
c = b**i
if c>x:
break
else:
a.append(c)
print(max(a)) |
p03327 | s083616597 | Accepted | n=int(input())
if n<=999:
print('ABC')
else:
print('ABD') |
p03075 | s677664126 | Accepted | a=[int(input()) for i in range(5)]
k=int(input())
ok=True
for i in range(4):
for j in range(i+1,5):
if abs(a[i]-a[j])>k:
ok=False
break
if ok:
print("Yay!")
else:
print(":(") |
p02603 | s297842560 | Accepted | n = int(input())
a = list(map(int, input().split()))
a_cur = a[0]
m = 1000
s = 0
for i in range(1, n):
a_next = a[i]
if a_cur < a_next:
# buy
s += m // a_cur
m -= m // a_cur * a_cur
else:
# sell
m += s * a_cur
s = 0
a_cur = a_next
m += s * a_cur
print(m)
|
p03407 | s362906582 | Accepted | a,b,c=map(int,input().split())
if a+b>=c:
print('Yes')
else:
print('No') |
p02658 | s192905481 | Wrong Answer | n = int(input())
num = 1
a = list(map(int, input().split()))
if 0 in a:
print(0)
exit(0)
for i in a:
num *= i
if num >= 10**8:
print(-1)
exit(0)
print(num) |
p03556 | s754149879 | Accepted | a=int(input())
k=1
for i in range(0,100000):
if a<(k**2):
break
else:
k+=1
print((k-1)**2)
|
p03548 | s696597219 | Accepted | X, Y, Z = map(int, input().split())
if X < (2*Z + Y):
print(0)
else:
print(int((X-Z)/(Z+Y)))
|
p02756 | s143523424 | Accepted | from collections import deque
s = deque(list(input()))
q = int(input())
asc = True
for _ in range(q):
qs = input()
if qs[0]=="1":
asc = not asc
continue
_,f,c = qs.split()
if f=="1":
if asc:
s.appendleft(c)
else:
s.append(c)
else:
if asc:
s.append(c)
else:
s.appendleft(c)
if not asc:
s.reverse()
print("".join(s)) |
p02748 | s660431531 | Accepted | A,B,M=map(int,input().split())
at=list(map(int,input().split()))
bt=list(map(int,input().split()))
xyc=[list(map(int,input().split())) for i in range(M)]
minc=min(at)+min(bt)
for i in range(M):
minc=min(minc,at[xyc[i][0]-1]+bt[xyc[i][1]-1]-xyc[i][2])
print(minc) |
p02900 | s767522270 | Wrong Answer | A,B = map(int,input().split())
#a,bの最大公約数
def gcd(a,b):
if b == 0:
return a
else:
return gcd(b,a%b)
li = {1}
g = gcd(A,B)
for i in range(2,int(g**0.5)+1):
while g%i == 0:
g = g//i
li.add(i)
print(len(li))
|
p03835 | s196115169 | Accepted | import sys
input = sys.stdin.readline
def main():
K, S = map(int, input().split())
CNT = 0
for x in range(K+1):
for y in range(K+1):
if S - x -y >= 0 and S - x -y <= K:
CNT += 1
print(CNT)
if __name__ == '__main__':
main() |
p02995 | s060786907 | Accepted | from fractions import gcd
a,b,c,d = map(int, input().split())
lcm = (c*d)//gcd(c,d)
x = ((a-1)//c)+((a-1)//d)-((a-1)//lcm)
y = (b//c)+(b//d)-(b//lcm)
print((b-(a-1))-(y-x))
|
p02843 | s690933360 | Accepted | X = int(input())
shou = X // 100
val = shou*5
mod = X % 100
if val >= mod:
print(1)
else:
print(0) |
p02777 | s350132205 | Wrong Answer | S, T = input().split()
A,B = map(int,input().split())
U = input()
print(A,B)
if U == S:
A -= 1
print(A,B)
else:
B -= 1
print(A,B)
|
p02823 | s719045347 | Accepted | n, a, b = map(int, input().split())
print([(b-a)//2, min(a-1, n-b) + 1 + (b-a-1)//2][a%2-b%2]) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.