problem_id
stringclasses 428
values | submission_id
stringlengths 10
10
| status
stringclasses 2
values | code
stringlengths 5
816
|
|---|---|---|---|
p03797
|
s654755757
|
Wrong Answer
|
import sys
n,m = map(int,input().split())
if m < 2:
print(0)
sys.exit()
if 2*n > m > n:
print(min(n,n//2))
sys.exit()
m -= 2*n
print(n+(m//4))
|
p02630
|
s250644591
|
Wrong Answer
|
n = int(input())
a = list(map(int,input().split()))
b = {}
for x in a:
try:
if b[x]:
b[x] += 1
except:
b[x] = 1
#print(b)
ans = sum(a)
q = int(input())
for _ in range(q):
x,y = map(int,input().split())
try:
if b[x]:
bx = b[x]
b[x] = 0
except:
#print(b)
print(ans)
continue
try:
if b[y]:
b[y] += bx
except:
b[y] = bx
#print(b)
ans -= bx * x
ans += bx * y
print(ans)
|
p03087
|
s144777218
|
Wrong Answer
|
N, Q = map(int, input().split())
S = list(input())
for _ in range(Q):
l, r = map(int, input().split())
line = S[l-1:r]
count = 0
for i in range(r-l):
if line[i] == 'A' and line[i+1] == 'C':
count += 1
|
p02900
|
s271644026
|
Accepted
|
a, b = map(int, input().split())
import fractions
import math
n = fractions.gcd(a,b)
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)
print(len(set(a))+1)
|
p03696
|
s282477481
|
Wrong Answer
|
N = int(input())
s = input()
ind1 = 0
ind2 = N
for i in range(N):
if s[i] == '(':
ind1 = i
break
for i in range(N):
if s[N-i-1] == ')':
ind2 = N-i
break
left = s[:ind1].count(')')
right = s[ind2:].count('(')
mid_left = s[ind1:ind2].count(')')
mid_right = s[ind1:ind2].count('(')
left += max(0,mid_left-mid_right)
right += max(0,mid_right-mid_left)
ans = '('*left + s + ')' * right
print(ans)
|
p03759
|
s214165914
|
Accepted
|
x, y, z = map(int, input().split())
if y - x == z - y:
print("YES")
else:
print("NO")
|
p04045
|
s609832867
|
Accepted
|
n, k = list(map(int, input().split()))
d = set(input().split())
for i in range(n, 100001):
if set(list(str(i))) & d == set():
print(i)
break
|
p03106
|
s348169535
|
Accepted
|
def solve():
A, B, K = map(int, input().split())
list = []
for i in range(1, min(A, B) + 1):
if A % i == 0 and B % i == 0:
list.append(i)
print(list[len(list)-K])
if __name__ == "__main__":
solve()
|
p02623
|
s744289514
|
Accepted
|
import sys
input = sys.stdin.buffer.readline
import bisect
N, M, K = map(int, input().split())
A = list(map(int, (input().split())))
B = list(map(int, (input().split())))
cumA, cumB = [0], [0]
for a in A:
cumA.append(cumA[-1]+a)
for b in B:
cumB.append(cumB[-1]+b)
ans = 0
for i in range(N, -1, -1):
if cumA[i] > K: continue
j = bisect.bisect_right(cumB, K-cumA[i])
ans = max(ans, i+j-1)
print(ans)
|
p02584
|
s294370407
|
Accepted
|
x, k, d = map(int, input().split())
def sol(x, k, d):
x = abs(x)
temp = x // d
if temp >= k:
return x - d * k
x -= temp * d
k -= temp
if k % 2 == 0:
return x
return abs(x - d)
print (sol(x, k, d))
|
p02767
|
s468016953
|
Accepted
|
def main():
N = int(input())
X = list(map(int, input().split()))
P = sum(X) // N
ans1 = 0
for x in X:
ans1 += (x - P) ** 2
ans2 = 0
for x in X:
ans2 += (x - (P + 1)) ** 2
print(min(ans1, ans2))
if __name__ == "__main__":
main()
|
p02723
|
s436243196
|
Accepted
|
S = input()
if S[2] == S[3] and S[4] == S[5]:
print("Yes")
else:
print("No")
|
p03435
|
s124473363
|
Accepted
|
import sys
input = sys.stdin.readline
c=[list(map(int,input().split())) for i in range(3)]
for i in range(2):
for j in range(2):
if c[i][j]-c[i][j+1] != c[i+1][j]-c[i+1][j+1]:
print("No")
exit()
if c[i][j]-c[i+1][j] != c[i][j+1]-c[i+1][j+1]:
print("No")
exit()
print("Yes")
|
p02959
|
s641499761
|
Accepted
|
n = int(input())
a_l = list(map(int, input().split()))
b_l = list(map(int, input().split()))
ans = 0
c = 0
for i in range(1, n+1):
a = a_l[-i]
if b_l[-i] + c >= a:
ans += a
d = c-a
if d >=0:
d=0
c = b_l[-i] - abs(d)
else:
ans += b_l[-i] + c
c = 0
if a_l[0] >= c:
ans+= c
else:
ans+= a_l[0]
print(ans)
|
p02720
|
s864323025
|
Accepted
|
k=int(input())
a=[i+1 for i in range(9)]
while (1):
if k<=len(a):
print(a[k-1])
f=1
break
k=k-len(a)
#print(k)
b=[]
for x in a:
for i in [-1,0,1]:
d=x%10+i
#print(d)
if d<0 or d>=10: continue
b.append(x*10+d)
a=b.copy()
#print(a)
|
p03309
|
s979001751
|
Accepted
|
import numpy as np
n = int(input())
a = np.array(list(map(int, input().split()))) - np.arange(1, n+1)
b = int(np.median(a))
print(int(np.sum(np.abs(a - b))))
|
p03380
|
s823960404
|
Wrong Answer
|
#094_D
n = int(input())
a = sorted(list(map(int, input().split())))
m = a[-1]
mid = m // 2
idx = 10 ** 10
for i in range(n-1):
if abs(a[i]-mid) < abs(a[i]-idx):
idx = a[i]
print(m, idx)
|
p03797
|
s323551687
|
Wrong Answer
|
N,M=map(int,input().split())
O = M//2
P = (N+O)//2
print(P)
|
p03437
|
s256313488
|
Accepted
|
x,y=map(int,input().split())
if x%y==0:
print(-1)
else:
print(x)
|
p03360
|
s843207109
|
Accepted
|
a = list(map(int, input().split()))
k = int(input())
for i in range(k):
a[a.index(max(a))] *= 2
print(sum(a))
|
p03555
|
s374073760
|
Wrong Answer
|
C=[list(input()) for i in range(2)]
N=C[1].reverse()
if C[0]==N:
print('YES')
else:
print('NO')
|
p03077
|
s405873968
|
Accepted
|
n = int(input())
l = [int(input()) for _ in range(5)]
ans = 0 - -n//min(l) + 4
print(ans)
|
p03994
|
s404414375
|
Accepted
|
S = input()
K = int(input())
cnt = K
ans = ''
for s in S:
if s == 'a':
ans += 'a'
elif cnt >= 123 - ord(s):
cnt -= 123 - ord(s)
ans += 'a'
else:
ans += s
last = ans[-1]
last = chr((ord(last) - 97 + cnt) % 26 + 97)
print(ans[:-1] + last)
|
p04030
|
s929912808
|
Accepted
|
s = []
for l in raw_input():
if l == 'B':
if s:s.pop()
else:
s.append(l)
print ''.join(s)
|
p02820
|
s544089706
|
Accepted
|
N,K = map(int,input().split())
R,S,P = map(int,input().split())
T = input()
ans = 0
log = ["*"]*N
win = {"r":"p","s":"r","p":"s"}
score = {"r":P,"s":R,"p":S}
for i,t in enumerate(T):
if log[i-K]==win[t]: continue
log[i] = win[t]
ans += score[t]
print(ans)
|
p02707
|
s098904610
|
Accepted
|
n=int(input())
a=[0]+list(map(int,input().split()))
b=[0 for i in range(n+1)]
for i in range(n):
b[a[i]]+=1
[print(i) for i in b[1:]]
|
p04045
|
s835835399
|
Accepted
|
# -*- coding: utf-8 -*-
import sys,math,itertools
input = sys.stdin.readline
n, k = map(int, input().split())
d = [int(_) for _ in input().split()]
d_set = set(d)
d_all = set(range(10))
d_use = [str(a) for a in list(d_all - d_set)]
keta = int(math.log10(n))+1
l1 = [int(''.join(list(a))) if int(''.join(list(a)))>=n else 100000 for a in list(itertools.product(d_use, repeat=keta+1))]
l2 = [int(''.join(list(a))) if int(''.join(list(a)))>=n else 100000 for a in list(itertools.product(d_use, repeat=keta))]
print(min(min(l1), min(l2)))
|
p02784
|
s823218317
|
Accepted
|
H, N = map(int, input().split())
A = list(map(int, input().split()))
print("Yes" if H<=sum(A) else "No")
|
p02548
|
s726910555
|
Accepted
|
N = int(input())
ans = 0
for i in range(1, N):
ans += (N-1) // i
print(ans)
|
p02571
|
s115665560
|
Accepted
|
S = input()
T = input()
ans = 1001
for i in range(len(S) - len(T) + 1):
a = 0
for s in range(len(T)):
if T[s] != S[i+s]:
a += 1
if a < ans:
ans = a
print(ans)
|
p02659
|
s977673556
|
Accepted
|
import math
A,B=[i for i in input().split()]
f2i = int(float(B)*100 + 0.5)
print( (int(A)*f2i) // 100 )
|
p02935
|
s783818819
|
Wrong Answer
|
import sys
import numpy as np
import numba
from numba import jit
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
@jit
def main(n, a):
for _ in range(1, n):
new = (a[1]+a[0])/2
a = np.delete(a, 0)
a[0] = new
return new
n = int(readline())
a = np.array(readline().split(), np.int64)
a = np.sort(a)
print(main(n,a))
|
p03107
|
s365162692
|
Wrong Answer
|
S = input()
o = S.count("1")
s = S.count("0")
print(min(o, s)**2)
|
p03493
|
s410140719
|
Wrong Answer
|
a = input()
b = int(a)
count = 0
for i in range(len(a)-1):
ichi = b%10
if ichi == 1:
count+=1
b %= 10
print(count)
|
p02823
|
s419387158
|
Wrong Answer
|
N, A, B = map(int, input().split())
if (B-A) % 2 == 0:
print((B-A) // 2)
else:
print(min(B - 1, N - A))
|
p03472
|
s038749155
|
Accepted
|
N, H, *blades = map(int, open(0).read().split())
cut = max(blades[::2])
throws = sorted(b for b in blades[1::2] if b >= cut)
ans = 0
while throws:
H -= throws.pop()
ans += 1
if H <= 0:
print(ans)
exit()
ans += (H + cut - 1) // cut
print(ans)
|
p02791
|
s095327189
|
Accepted
|
import numpy as np
n = int(input())
P = np.array(list(map(int, input().split())))
T = np.zeros(n)
T[0] = P[0]
for i in np.arange(1,n,1):
T[i] = min(T[i-1], P[i])
print(np.sum(P==T))
|
p04030
|
s370419501
|
Wrong Answer
|
s = list(input())
answer = []
for i in s:
if i == "B":
try:
answer.pop()
except IndexError:
pass
else:
answer.append(i)
print(" ".join(answer))
|
p03419
|
s401680682
|
Accepted
|
N, M = map(int, input().split())
if N >= 3 and M >= 3:
print((N-2)*(M-2))
elif N == 2 or M == 2:
print(0)
else:
print(max(N - 2, M - 2, 1))
|
p03371
|
s167026012
|
Wrong Answer
|
a, b, c, x, y = (int(each) for each in input().split())
cost = [x*a + y*b]
for i in range(max(x, y)*2):
numofabpizza = i*2
numofapizza = max(0, (x-numofabpizza))
numofbpizza = max(0, (y-numofabpizza))
# print(numofapizza, numofbpizza, numofabpizza)
cost.append(numofapizza*a + numofbpizza*b + (2*numofabpizza)*c)
# print(cost)
print(min(cost))
|
p03220
|
s108158513
|
Accepted
|
N = int(input()) # 地点の候補数
T, A = map(int, input().split()) # T:平均気温 A:温度
H = list(map(int, input().split())) #標高(x)
list = [abs(A-(T - i * 0.006)) for i in H]
print(list.index(min(list))+1)
|
p03759
|
s478044652
|
Accepted
|
a,b,c = map(int,input().split())
if a-b == b-c:
print('YES')
else:
print('NO')
|
p02797
|
s899616442
|
Accepted
|
N, K, S = map(int, input().split())
for i in range(N):
if 0 < K:
print(S)
K-=1
else:
if S-1 < 100:
print(S+1)
else:
print(S-1)
|
p02993
|
s419414925
|
Accepted
|
s = list(input())
ans = "Good"
for i in range(len(s) - 1):
if s[i] != s[i+1]:
continue
ans = "Bad"
print(ans)
|
p03274
|
s855630969
|
Accepted
|
n, k = map(int, input().split())
x = list(map(int, input().split()))
ans = 10 ** 16
for i in range(n-k+1):
if x[i] * x[i+k-1] < 0:
dis = min(abs(x[i]), abs(x[i+k-1])) * 2 + max(abs(x[i]), abs(x[i+k-1]))
else:
dis = max(abs(x[i]), abs(x[i+k-1]))
ans = min(ans, dis)
print(ans)
|
p02786
|
s774573103
|
Accepted
|
H = int(input())
index = 0
while(H!=1):
H //= 2
index += 1
print(2**(index+1)-1)
|
p02596
|
s298954650
|
Accepted
|
k=int(input())
a=7
for i in range(10**6):
if a%k==0:
print(i+1)
exit()
a=(a*10+7)%k
print(-1)
|
p02717
|
s984113311
|
Wrong Answer
|
x, y, z = map(int, input().split())
print(y, x, z)
|
p03814
|
s484189335
|
Wrong Answer
|
s=input()
i=s.find('A')
j=s.rfind('Z')
print(i)
print(j)
print(abs(i-j+1))
|
p02933
|
s202581951
|
Accepted
|
a=int(input())
s=input()
if a >= 3200:
print(s)
else:
print("red")
|
p03210
|
s429170527
|
Wrong Answer
|
l=[3,5,7]
print("Yes" if int(input()) in l else "No" )
|
p02629
|
s390260511
|
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)
kou=N
a= num2alpha(kou)
print(a.lower())
|
p03131
|
s879046450
|
Wrong Answer
|
K,A,B = map(int,input().split())
if A < B:
ans = 0
K += 1
while A < K:
K -= A
K -= 1
ans += B
ans += K
print(ans)
else:
print(K+1)
|
p03077
|
s812655604
|
Wrong Answer
|
import math
N = int(input())
A = int(input())
B = int(input())
C = int(input())
D = int(input())
E = int(input())
t_list = [A, B, C, D, E]
min_t = 10*18
min_i = 0
for i in range(5):
if t_list[i]<min_t:
min_i = i
min_t = t_list[i]
t_1 = int((N+min_t-1) / min_t)
print(t_1+4)
|
p03665
|
s773876790
|
Accepted
|
N,P=map(int,input().split())
A=list(map(int,input().split()))
if all(a%2==0 for a in A):
print(0 if P else 2**N)
else:
print(2**(N-1))
|
p02702
|
s665541007
|
Wrong Answer
|
N = input()
lenN = len(N)
h = lenN
cnt = 0
if lenN >= 6:
h = lenN // 2
for i in range(0,h-3):
for j in range(i + 3,h+1):
p = int(N[i:j])
if p % 2019 == 0:
print("{} : {}".format(i,j))
cnt += 1
if lenN >= 6:
for i in range(h-3,lenN-3):
for j in range(i + 3,lenN+1):
p = int(N[i:j])
if p % 2019 == 0:
print("{} : {}".format(i,j))
cnt += 1
print(cnt)
|
p02971
|
s493124103
|
Accepted
|
n=int(input())
A=[int(input()) for i in range(n)]
B=sorted(A,reverse=True)
amax=B[0]
asec=B[1]
for a in A:
if a==B[0]:
print(asec)
else:
print(amax)
|
p02963
|
s576106867
|
Accepted
|
import math
s=int(input())
up=int(math.sqrt(s))+1
if s==1000000000000000000:
print("0 0 1000000000 0 0 1000000000")
exit()
print("{} {} {} {} {} {}".format(0,0,1,up,up,up*up-s))
|
p03680
|
s858259652
|
Accepted
|
import sys
N = int(input())
if N < 1 or N > 10 ** 5:
sys.exit()
int_array = []
for I in range(N):
int_array.append(int(input()))
if len(int_array) < 0 or len(int_array) > N:
sys.exit()
next = int_array[0]
count = 1
for L in range(N):
if next == 2:
print(count)
sys.exit()
next = int_array[next-1]
count += 1
print("-1")
|
p03274
|
s283697494
|
Accepted
|
n,k = map(int,input().split())
x = list(map(int,input().split()))
ans = 114514191981036436433-4
for i in range(n+1-k):
a,b = x[i],x[i+k-1]
if a < 0 and b < 0:
ans = min(ans,abs(a))
elif a >= 0 and b >= 0:
ans = min(ans,abs(b))
else:
ans = min(ans,min(abs(a)+abs(b)*2,abs(b)+abs(a)*2))
print(ans)
|
p02640
|
s007292130
|
Accepted
|
X,Y =map(int,input().split())
if (Y % 2 == 0) and (4*X >= Y >=2*X):
print('Yes')
else:
print('No')
|
p03910
|
s888015136
|
Wrong Answer
|
#97 B - Exactly N points
N = int(input())
A = []
num = 1
cnt = 0
for _ in range(N):
A.append(num)
cnt += 1
if num == cnt:
cnt = 0
num += 1
ans = [A[-1]]
tgt = N - A[-1]
for i in range(1,A[-1]):
if tgt < A[-1]:
ans.append(tgt)
break
tgt -= i
ans.append(i)
for a in ans:
print(a)
|
p03013
|
s592876401
|
Wrong Answer
|
n, m = list(map(int, input().split(' ')))
aaa = [0] * (n + 3)
for i in range(m):
aaa[int(input())] = True
dp = [1] * (n + 3)
for i in range(1, n+1): # 1e5
if not aaa[i]:
dp[i] = dp[i-1]
dp[i] += dp[i-2]
dp[i] = dp[i] % int(1e9 + 7)
else:
dp[i] = 0
print(dp[n])
|
p02706
|
s289974868
|
Accepted
|
def main():
n,m=map(int,input().split())
a=list(map(int,input().split()))
ans=n-sum(a)
if ans<0:
ans=-1
print(ans)
if __name__=="__main__":
main()
|
p03262
|
s767250839
|
Wrong Answer
|
n, X = map(int, input().split())
x = list(map(int, input().split()))
x.append(X)
def euclid(a,b):
if a % b == 0:
return b
else:
return euclid(b, a%b)
now = abs(x[0] -x[1])
for i in range(1, len(x)-2):
r = euclid(now, abs(x[i] - x[i+1]))
if r < now:
now = r
print(now)
|
p03281
|
s487935871
|
Accepted
|
def have_eight_divisor_odd(n):
have_eight_divisor_odd_count = 0
for i in range(1, n+1):
count = 0
if i % 2 == 1:
for j in range(1, i+1):
if i % j == 0:
count += 1
if count == 8:
have_eight_divisor_odd_count += 1
return have_eight_divisor_odd_count
N = int(input())
result = have_eight_divisor_odd(N)
print(result)
|
p02690
|
s951065416
|
Wrong Answer
|
X = int(input())
for A in range(1000):
for B in range(1000):
if A**5 - B**5 == X:
print(A, B)
|
p02971
|
s460305611
|
Accepted
|
N = int(input())
A = [int(input()) for _ in range(N)]
AMax = max(A)
x = A.index(AMax)
Aelse = A[:x]+A[x+1:]
AelseMax = max(Aelse)
if AMax == AelseMax:
for i in range(N):
print(AMax)
else:
for i in range(N):
if x == i:
print(AelseMax)
else:
print(AMax)
|
p03160
|
s683990137
|
Accepted
|
import sys
import io
f = sys.stdin.buffer
n = int(f.readline())
h = list(map(int, f.readline().split()))
p0, p1 = 0, abs(h[1] - h[0])
for i in range(2, n):
p2 = min(p1 + abs(h[i] - h[i - 1]), p0 + abs(h[i] - h[i - 2]))
p0, p1 = p1, p2
print(p1)
|
p04044
|
s057713704
|
Accepted
|
n,l=map(int,input().split())
k=[input() for i in range(n)]
k.sort()
print("".join(k))
|
p03773
|
s805018001
|
Accepted
|
a, b = map(int, input().split())
if a + b >= 24:
print(a+b-24)
else:
print(a+b)
|
p03345
|
s130635736
|
Accepted
|
a,b,c,k = map(int, input().split())
cheak = 10**18
ans = a-b
def calc(a,b,c,k):
if a == b:
return 0
elif ans < 0:
if k % 2 == 1:
return -ans
else:
return ans
else:
if k % 2 == 1:
return -ans
else:
return ans
ans_n = calc(a,b,c,k)
if ans_n > cheak:
print("Unfair")
else:
print(ans_n)
|
p04033
|
s289189499
|
Accepted
|
a, b = map(int, input().split())
if 0 < a and 0 < b:
print("Positive")
elif a <= 0 and 0 <= b:
print("Zero")
else:
if (a + b) % 2 == 0:
print("Negative")
else:
print("Positive")
|
p02700
|
s691314404
|
Accepted
|
A,B,C,D=map(int,input().split())
while True:
C=C-B
if C<=0:
break
A=A-D
if A<=0:
break
if C<=0:
print('Yes')
else:
print('No')
|
p03645
|
s998950982
|
Accepted
|
n,m = map(int,input().split())
graph = {i:[] for i in range(1,n+1)}
for _ in range(m):
a,b = map(int,input().split())
graph[a].append(b)
graph[b].append(a)
if len(set(graph[1]).intersection(set(graph[n]))) > 0:
print('POSSIBLE')
else:
print('IMPOSSIBLE')
|
p03565
|
s336065856
|
Accepted
|
import re
sp=input()
t=input()
strlst=[]
def makeStrLex(i):
s=sp[:i]+t+sp[i+len(t):]
s=s.replace('?','a')
return s
for i in range(len(sp)-len(t)+1):
spat=sp[i:i+len(t)].replace('?','.')
repat=re.compile(spat)
if repat.match(t):
strlst.append(makeStrLex(i))
if len(strlst)>0:
print(sorted(strlst)[0])
else:
print('UNRESTORABLE')
|
p02570
|
s049914272
|
Accepted
|
D,T,S = map(int, input().split())
if D<=T*S:
print("Yes")
else:
print("No")
|
p03962
|
s295669607
|
Wrong Answer
|
a,b,c=(int(x) for x in input().split())
if a==b==c:
print(1)
elif a!=b!=c:
print(3)
else:
print(2)
|
p03730
|
s967135464
|
Accepted
|
a,b,c=map(int,input().split())
ans='NO'
for i in range(1,b+1):
if c==(a*i)%b:
ans='YES'
print(ans)
|
p02548
|
s295909264
|
Accepted
|
n = int(input())
ans = 0
for i in range(1,n):
ans += n // i
if n % i == 0:
ans -= 1
print(ans)
|
p03487
|
s709906273
|
Accepted
|
from collections import Counter
N=int(input())
A=list(map(int,input().split()))
ACounter=Counter(A)
ans=0
for k,v in ACounter.items():
if k<=v: ans+=(v-k)
elif k>v: ans+=v
print(ans)
|
p02995
|
s630112956
|
Accepted
|
import math
a,b,c,d=map(int,input().split())
lcm=(c*d)//math.gcd(c,d)
ans=(b-a)-((b//c-(a-1)//c)+(b//d-(a-1)//d)-(b//lcm-(a-1)//lcm))+1
print(ans)
|
p02820
|
s383924312
|
Accepted
|
#abc149d
n,k=map(int,raw_input().split())
r,s,p=map(int,raw_input().split())
t=map(str,raw_input().rstrip())
pt={'r':p,'s':r,'p':s,'':0}
res=0
for i in range(n):
x=i-k
if x>=0 and t[x]==t[i]:
t[i]=''
res+=pt[t[i]]
print res
|
p03352
|
s811161880
|
Wrong Answer
|
x=int(input())
for i in range(x, 0, -1):
for j in range(1, int(i**(1/2))+1):
if i/j == j:
print(i)
exit()
|
p02677
|
s118440128
|
Wrong Answer
|
import math
A, B, H, M = map(int, input().split())
KAKUDO=min(abs((H*30)-(M*6)),abs((M*6)-(H*30)))
KAKUDO=min(KAKUDO,(360-(H*30))+(M*6),)
ANS= (A**2)+(B**2)-(2*A*B*math.cos(math.radians(KAKUDO)))
print(math.sqrt(ANS))
|
p02784
|
s065667399
|
Accepted
|
import math
import itertools
import fractions
import heapq
import collections
import bisect
import sys
import copy
sys.setrecursionlimit(10**9)
mod = 998244353
inf = 10**20
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(): return [list(map(int, l.split())) for l in sys.stdin.readlines()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
h,n = LI()
a = LI()
if sum(a)>=h:
print("Yes")
else:
print("No")
|
p03011
|
s119888829
|
Wrong Answer
|
A = list(map(int, input().split()))
ans = 10**1000
tmp = 0
for i in range(3):
for j in range(i+1, 2):
tmp = A[i] + A[j]
ans = min(ans, tmp)
print(ans)
|
p03239
|
s271664102
|
Wrong Answer
|
def main():
N, T = map(int, input().split())
C = []
for _ in range(N):
c, t = map(int, input().split())
if t <= T:
C.append(c)
if len(C) == 0:
print("LTE")
else:
print(min(C))
if __name__ == '__main__':
main()
|
p03795
|
s434606269
|
Accepted
|
N = int(input())
print(N*800 - (N//15 * 200))
|
p02797
|
s343134896
|
Accepted
|
N , K ,S =map(int,input().split())
if S != 10**9:
ans = [S]*K + [10**9]*(N-K)
else:
ans = [S]*K + [1]*(N-K)
print(" ".join(map(str,ans)))
|
p03105
|
s575633314
|
Accepted
|
a,b,c=map(int,input().split())
print(min(b//a,c))
|
p03860
|
s219805884
|
Accepted
|
Atcoder,s,Contest=raw_input().split()
print Atcoder[0]+s[0].upper()+Contest[0]
|
p02748
|
s286130043
|
Wrong Answer
|
a, b, m = map(int, input().split())
a_price = list(map(int, input().split()))
b_price = list(map(int, input().split()))
m_prices = []
for i in range(m):
m_prices.append(list(map(int, input().split())))
ref = min(a_price)
mi = min(b_price)
c = []
for i in range(m):
temp = dict.fromkeys(m_prices[i])
if len(temp) != 1:
c.append(m_prices[i][2])
if len(c) != 0:
print(ref + mi - max(c))
else:
print(ref + mi)
|
p03067
|
s105618115
|
Accepted
|
a,b,c = map(int,input().split())
if a < c < b or b < c < a:
print('Yes')
else:
print('No')
|
p03062
|
s012699572
|
Wrong Answer
|
def main():
n = int(input())
a = list(map(int, input().split()))
s = [abs(i) for i in a]
print(sum(s) - 2*min(s))
if __name__ == "__main__":
main()
|
p03075
|
s625298683
|
Accepted
|
l = sorted([int(input()) for _ in range(5)])
n = int(input())
if max(l) - min(l) > n:
print(':(')
else:
print('Yay!')
|
p03761
|
s331055634
|
Accepted
|
from collections import Counter
alpha = [float('inf')] * 26
n = int(input())
for _ in range(n):
dic = Counter(list(input()))
for i in range(26):
if chr(i + 97) not in dic:
alpha[i] = 0
elif dic[chr(i + 97)] < alpha[i]:
alpha[i] = dic[chr(i + 97)]
ans = ''
for i in range(26):
ans += chr(i + 97) * alpha[i]
print(ans)
|
p03261
|
s621308109
|
Wrong Answer
|
N = int(input())
W = list(input() for _ in range(N))
cnt = 0
for i in range(N-1):
first = W[i]
next = W[i+1]
if first[-1] == next[0]:
cnt += 1
else:
cnt = cnt
if cnt == N-1:
print('Yes')
else:
print('No')
|
p03013
|
s894113008
|
Wrong Answer
|
n,m = map(int, input().split())
A = [int(input()) for i in range(m)]
if m == 0:
Fib = [1,2]
for i in range(2,n+1):
Fib.append(Fib[i-2]+Fib[i-1])
print(Fib)
print(Fib[n]%1000000007)
exit()
B = [A[i+1]- A[i] for i in range(m-1)]
B.insert(0,A[0]+1)
B.append(n+1-A[m-1])
M = max(A)
Fib = [0,1]
for i in range(2,M+10):
Fib.append(Fib[i-2]+Fib[i-1])
ans = 1
for i in range(len(B)):
ans = (ans * Fib[B[i]-1])%1000000007
print(ans)
|
p02642
|
s494287652
|
Wrong Answer
|
from sys import stdin
data = stdin.readlines()
n = int(data[0].split()[0])
a = [int(s) for s in data[1].split()]
a = sorted(a)
max = a[-1]
print(max)
l = [0]*(max+1)
for i in a:
l[i] += 1
if l[i] == 1:
for j in range(i*2,max+1,i):
l[j] = 2
print(l.count(1))
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.