problem_id
stringclasses 428
values | submission_id
stringlengths 10
10
| status
stringclasses 2
values | code
stringlengths 5
816
|
|---|---|---|---|
p02718
|
s623153801
|
Wrong Answer
|
N, M = map(int, input().split())
A = list(map(int, input().split()))
A.sort(reverse = True)
if A[M-1] >= sum(A)/4*M:
print("Yes")
else:
print("No")
|
p02699
|
s812718427
|
Accepted
|
S,W=(int(x) for x in input().split())
if S>W:
print('safe')
else:
print('unsafe')
|
p02664
|
s252911716
|
Accepted
|
t = str(input())
ans = t.replace('?', 'D')
print(ans)
|
p03136
|
s133201413
|
Accepted
|
N = int(input())
L = list(map(int, input().split()))
M = max(L)
S = sum(L) - M
print('Yes' if M < S else 'No')
|
p02823
|
s832821821
|
Accepted
|
n, a, b = map(int,input().split())
if (b-a)%2 == 0:
print((b-a)//2)
else:
print(min(a-1, n-b) + 1 + (b-a-1)//2)
|
p03699
|
s465762939
|
Accepted
|
n = int(input())
point_t = []
f = []
ans = 0
index_0 = 0
cnt = 0
sum_of_0 = 0
for _ in range(n):
point_t.append(int(input()))
point = sorted(point_t)
for i in range(n):
if point[i]%10 != 0:
if cnt == 0:
index_0 = i
cnt += 1
f.append(int(point[i]%10))
if sum(f) == 0:
print(0)
elif sum(f)%10 != 0:
for i in range(n):
ans += int(point[i])
print(ans)
else:
print(sum(point) - point[index_0])
|
p03071
|
s035471275
|
Accepted
|
a,b=map(int,input().split())
if a-1>=b:
print(a+a-1)
elif b-1>=a:
print(b+b-1)
else:
print(a+b)
|
p02772
|
s750751075
|
Wrong Answer
|
n = int(input())
A = list(map(int, input().split()))
bad = 0
for i in range(n):
if(A[i] % 2):
if(A[i] % 3 != 0 or A[i] % 5 != 0):
bad += 1
if(bad == 1):
print("DENIED")
else:
print("APPROVED")
|
p03095
|
s889650260
|
Accepted
|
n=int(input())
s=input()
l=[s[i] for i in range(n)]
import collections
c=collections.Counter(l)
mod=10**9+7
li=list(c.values())
ans=1
for i in li:
ans*=1+i
ans%=mod
print(ans-1)
|
p02783
|
s690754733
|
Accepted
|
# coding: utf-8
# Your code here!
a = input().split(" ")
H = int(a[0])
A = int(a[1])
ans = 0
while H > 0:
H -= A
ans += 1
print(ans)
|
p03657
|
s417145839
|
Wrong Answer
|
a,b=map(int,input().split())
print('Possible' if a==3 or b==3 or ((a+b)%3)==0 and a!=0 and b!=0 else 'Impossible')
|
p03774
|
s678127398
|
Accepted
|
n,m=map(int,input().split())
l_n=[list(map(int,input().split())) for _ in range(n)]
l_m=[list(map(int,input().split())) for _ in range(m)]
# print(l_n,l_m)
for i,j in l_n:
distance=0
cnt = 0
ans = float ( "inf" )
for k,l in enumerate(l_m,1):
a,b=l
distance=abs(i-a)+abs(j-b)
if ans>distance:
ans=min(ans,distance)
cnt=k
print(cnt)
|
p02707
|
s680678708
|
Accepted
|
N = int(input())
A = list(map(int, input().split()))
B = [0]*N
for i in range(N-1):
B[A[i]-1] += 1
for i in range(N):
print(B[i])
|
p02683
|
s540236383
|
Accepted
|
n,m,x = map(int, input().split())
C = []
A = []
ans = 10**9
for i in range(n):
AC = list(map(int,input().split()))
C.append(AC.pop(0))
A.append(AC)
for i in range(2**n):
cost = 0
crit = [0]*m
for j in range(n):
if (i>>j)& 1:#use
for k in range(m):
crit[k] += A[j][k]
cost += C[j]
if min(crit) >= x:
ans = min(ans, cost)
#print(crit, cost)
if ans == 10**9:
ans = -1
print(ans)
|
p03817
|
s271194064
|
Accepted
|
import sys
input = sys.stdin.buffer.readline
#sys.setrecursionlimit(10**9)
#from functools import lru_cache
def RD(): return sys.stdin.read()
def II(): return int(input())
def MI(): return map(int,input().split())
def MF(): return map(float,input().split())
def LI(): return list(map(int,input().split()))
def LF(): return list(map(float,input().split()))
def TI(): return tuple(map(int,input().split()))
# rstrip().decode()
def main():
x=II()
q,r=divmod(x,11)
ans=0
if r==0:
ans-=1
ans+=2*q+1+(r>6)
print(ans)
if __name__ == "__main__":
main()
|
p03359
|
s189053553
|
Accepted
|
import sys
readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)
def main():
a, b = map(int, readline().split())
ans = a - 1
if a <= b:
ans += 1
print(ans)
if __name__ == '__main__':
main()
|
p02727
|
s220101498
|
Accepted
|
x, y, r, g, c = map(int, input().split())
r_d = list(map(int, input().split()))
g_d = list(map(int, input().split()))
c_d = list(map(int, input().split()))
r_d.sort(reverse=True)
g_d.sort(reverse=True)
c_d.sort(reverse=True)
a = r_d[:x]+g_d[:y]+c_d
a.sort(reverse=True)
print(sum(a[:x+y]))
|
p02690
|
s659477145
|
Accepted
|
x = int(input())
for i in range(-120, 121):
for j in range(-120, 120):
if i ** 5 - j ** 5 == x:
print(f'{i} {j}')
break
else:
continue
break
|
p03071
|
s135107762
|
Wrong Answer
|
a,b=map(int,input().split())
c=max(a,b)
print(c+(c-1))
|
p03427
|
s947505027
|
Accepted
|
S = list(input())
S = list(map(lambda x: int(x),S))
ans = 0
for i in range(len(S) - 1,0,-1):
if S[i] == 9:
tmp = sum(S)
else:
S[i] = 9
S[i - 1] -= 1
tmp = sum(S)
ans = max(tmp,ans)
if len(S) == 1:
ans = S[0]
print(ans)
|
p02640
|
s775040341
|
Accepted
|
x,y=map(int,input().split())
if y%2!=0:
print('No')
elif (y-2*x)//2 < 0 or (4*x-y)//2 < 0:
print('No')
elif (y-2*x)//2 == 0 and (4*x-y)//2==0:
print('No')
else:
print('Yes')
|
p03592
|
s350822920
|
Accepted
|
n, m, k = map(int, input().split())
for i in range(n+1):
for j in range(m+1):
if (i*m + j*n - 2*i*j) == k:
print("Yes")
exit()
print("No")
|
p03095
|
s131333190
|
Accepted
|
from sys import stdin
import string
from itertools import groupby
n = int(stdin.readline().rstrip())
s = list(stdin.readline().rstrip())
s.sort()
lin = []
for key, value in groupby(s):
lin.append(len(list(value)))
point = 1
for i in lin:
point *= i+1
point %= 10**9+7
print(point-1)
|
p02577
|
s462120792
|
Accepted
|
N = input()
temp = 0
for i in N:
temp += int(i)
if temp % 9 == 0:
print("Yes")
else:
print("No")
|
p03284
|
s504046937
|
Accepted
|
import math
a,b = map(int,input().split())
maxi = math.ceil(a/b)
minu = math.floor(a/b)
print(maxi - minu)
|
p03385
|
s897009192
|
Accepted
|
S = str(input())
if S[0] != S[1] and S[0] != S[2] and S[1] != S[2]:
result = 'Yes'
else:
result = 'No'
print(result)
|
p02618
|
s414696125
|
Accepted
|
D = int(input())
cs = list(map(int, input().split()))
#s = [input().split() for l in range(D)]
S=0
for d in range(D):
s=list(map(int, input().split()))
max_value = max(s)
max_index = s.index(max_value)
print(max_index+1)
S+=max_value
|
p02811
|
s107727624
|
Accepted
|
k,x = map(int,input().split())
if k * 500 >= x :
print('Yes')
else :
print('No')
|
p03449
|
s286575828
|
Wrong Answer
|
import numpy as np
N = int(input())
A = np.array([list(map(int, input().split())) for _ in range(2)])
U = A[0][::-1]
cumsum_U = U[:-1].cumsum()[::-1]
D = A[1][::-1]
cumsum_D = D[1:].cumsum()[::-1]
# print('cumsum_U', cumsum_U)
# print('cumsum_D', cumsum_D)
b = cumsum_U >= cumsum_D
# print('b', b)
ans = 0
for i in range(N - 1):
if b[i]:
ans += A[0][i + 1]
else:
ans += (A[1][i:-1]).sum()
ans += A[0][0] + A[1][-1]
print(ans)
|
p03627
|
s325567379
|
Wrong Answer
|
from collections import Counter
N = int(input())
cnt = Counter(map(int, input().split()))
L = sum([[] for a, c in cnt.items()], [])
L.sort()
ans = 0 if len(L) < 2 else L[-1] * L[-2]
print(ans)
|
p03250
|
s681382484
|
Accepted
|
a, b, c = sorted([i for i in input().split()], reverse=True)
print(int(a + b) + int(c))
|
p03220
|
s523035929
|
Wrong Answer
|
N = int(input())
T,A = map(int,input().split())
H = list(map(int,input().split()))
a_list = []
for i in range(N):
a_list.append(A-(T-H[i]*0.006))
print(a_list.index(min(a_list))+1)
|
p03456
|
s944841356
|
Accepted
|
a = int(input().replace(" ",""))
c=0
for i in range(10**4):
if i**2 <= a:c=i**2
else:break
print("Yes" if c == a else "No")
|
p03910
|
s438551597
|
Wrong Answer
|
N = int(input())
W = [0]*(N+1)
W[1] = 1
for i in range(1, N+1):
W[i] += W[i-1]
if W[i] >= N:
for j in range(1, i+1):
if j != (W[i] - N):
print(j)
break
|
p03612
|
s527373844
|
Accepted
|
n = int(input())
m = [i for i in range(1,n)]
p = list(map(int,input().split()))
cnt = 0
for i in m:
if p[i-1] == i:
p[i-1] = p[i]
p[i] = i
cnt += 1
if p[-1] == n:
cnt += 1
print(cnt)
|
p03698
|
s120587760
|
Wrong Answer
|
# coding: utf-8
S=list(input())
if len(S)==len(set(S)):
print('Yes')
else:
print('No')
|
p02971
|
s695362427
|
Accepted
|
n = int(input())
al = list(int(input()) for _ in range(n))
al_s = sorted(list(set(al)), reverse=True)
if al.count(al_s[0]) == 1:
for a in al:
if a != al_s[0]:
print(al_s[0])
else:
print(al_s[1])
else:
for i in range(n):
print(al_s[0])
|
p02645
|
s317009816
|
Accepted
|
a = input()
print(a[0:3])
|
p02873
|
s019969301
|
Wrong Answer
|
S = list(input())
a = 0
ans = 0
for s in S:
if s == '<':
a += 1
elif s == '>':
a = max(a-1,0)
ans += a
print(ans)
|
p04030
|
s804917033
|
Accepted
|
"""
kari1 = '01B0' #00
kari1 = '0BB1' #1
in1 = kari1
"""
in1 = input()
RC = ''
for idx1 in range(len(in1)):
if in1[idx1] == '0':
RC = RC + '0'
elif in1[idx1] == '1':
RC = RC + '1'
elif in1[idx1] == 'B':
if RC != '':
RC = RC[0:len(RC) - 1]
print(RC)
|
p03106
|
s075975718
|
Accepted
|
abk = [int(i) for i in input().split()]
a = abk[0]
b = abk[1]
k = abk[2]
anss = []
for i in range(1,min(a,b)+1):
if a%i==0 and b%i==0:
anss.append(i)
anss.sort(reverse=True)
print(anss[k-1])
|
p03487
|
s403239541
|
Accepted
|
from collections import Counter
N = int(input())
a = list(map(int, input().split()))
a_counter = Counter(a)
ans = 0
if N == 1 and a[0] != 1:
print(1)
exit()
elif N == 1 and a[0] == 1:
print(0)
exit()
for i in (a_counter.items()):
key = (i[0])
value = (i[1])
if key == value:
pass
elif key < value:
ans = ans + (value - key)
else:
ans = ans + (value)
print(ans)
|
p03062
|
s287164711
|
Accepted
|
N=int(input())
L=list(map(int,input().split()))
count=0
sum=0
A=float("inf")
for i in L:
sum+=abs(i)
A=min(A,abs(i))
if i<0:
count+=1
if count%2==0:
print(sum)
else:
B=float("inf")
for i in L:
if abs(i)==A:
if i==0:
print(sum)
exit()
elif i>0:
print(sum-2*i)
exit()
elif i<0:
print(sum-2*A)
exit()
|
p04030
|
s499742598
|
Wrong Answer
|
a = input()
a=a.replace("0B","").replace("1B","")
if "B" in a:
a=a.replace("0B","").replace("1B","").replace("B","")
print(a)
else:
print(a)
|
p02970
|
s071590550
|
Wrong Answer
|
n,d = map(int,input().split())
print(-(-(n-d)/(d+1)))
|
p03261
|
s627756319
|
Wrong Answer
|
N = int(input())
W = []
for i in range(N):
W.append(input())
flag = True
for i in range(N-1):
if W[i][-1] != W[i+1][0]:
flag = False
break
for j in range(i+1):
if W[i] == W[j]:
flag = False
break
print("Yes") if flag else print("No")
|
p02922
|
s019431772
|
Accepted
|
A, B = map(int, input().split(' '))
print((B + A - 3) // (A - 1))
|
p02618
|
s700423835
|
Wrong Answer
|
import sys
import numpy as np
ri = lambda: int(sys.stdin.readline())
rl = lambda: list(map(int, sys.stdin.readline().split()))
D = ri()
c = np.array(rl())
s = np.array([np.array(rl()) for _ in range(D)])
t = []
for lis in s:
max_idx = np.argmax(lis)
t.append(max_idx)
t = np.array(t)
score = 0
li = np.zeros(26)
li_one = np.ones(26)
c_sum = sum(c)
d = 0
for i in t:
li += li_one
li[i] = 0
tmp = sum(c*li)
score += s[d][i] - tmp
print(int(score))
d += 1
|
p02552
|
s779952268
|
Accepted
|
i1=lambda : input()
i2=lambda : int(input())
i3=lambda : map(int,input().split())
i4=lambda n : [list(map(int,input().split()) for _ in range(n))]
X=i2()
print(1 if X==0 else 0)
|
p02696
|
s465498334
|
Accepted
|
a,b,n=map(int,input().split())
i=b-1
ans=(min(n,b-1)*a)//b;
while(i<=n):
if((i*a)//b-a*(i//b)<=ans):
break;
ans=max(ans,(i*a)//b-a*(i//b));
print(ans+"\n")
i+=b;
print(ans);
|
p02779
|
s418842270
|
Accepted
|
n=int(input())
a=set(map(int,input().split()))
if n==len(a):
print("YES")
else:
print("NO")
|
p03427
|
s240231693
|
Accepted
|
s = input()
n = int(s)
m = str(int(s[0]) - 1) + (len(s) - 1) * "9"
ans1 = 0
for i in range(len(m)):
ans1 += int(m[i])
if s[-1] != "9" and n >= 10:
n1 = n - (int(s[-1]) + 1)
s = str(n1)
ans2 = 0
for i in range(len(s)):
ans2 += int(s[i])
print(max(ans1, ans2))
|
p03323
|
s464921160
|
Wrong Answer
|
d,n = map(int, raw_input().split())
print (n + (1 if n == 100 else 0)) * (100 ** d)
|
p03221
|
s107430159
|
Accepted
|
N, M = map(int,input().split())
py = []
for i in range(M):
py.append(list(map(int,input().split())))
py[i].append(i)
sorted_py = sorted(py, key=lambda x: x[1])
P = [0]*N
p_num = 0
num = 0
output = ''
output2 = []
outputs = []
for i in range(M):
P[sorted_py[i][0]-1] += 1
p_num = sorted_py[i][0]
num = P[sorted_py[i][0]-1]
output = str(p_num).zfill(6) + str(num).zfill(6)
output2 = [output, sorted_py[i][2]]
outputs.append(output2)
sorted_outputs = sorted(outputs, key=lambda x: x[1])
for out in sorted_outputs:
print(out[0])
|
p03639
|
s212289512
|
Accepted
|
n=int(input())
a=list(map(int,input().split()))
f2=lambda x:x%2==0 and x%4!=0
f4=lambda x:x%4==0
c2,c4=0,0
for i in a:
c2+=f2(i)
c4+=f4(i)
print('Yes' if c2+c4*2>=n or (c2==0 and c4*2+1>=n)else 'No')
|
p03075
|
s471821577
|
Wrong Answer
|
l=[]
for _ in range(5):
l.append(int(input()))
k = int(input())
print('Yay' if l[-1] - l[0]<=k else ':(')
|
p02790
|
s545435947
|
Wrong Answer
|
a, b = [int(i) for i in input().split()]
if(a > b):
# for j in range (a):
print(str(b)*a)
if(a < b):
#for k in range (b):
print(str(a)*b)
|
p03548
|
s298027429
|
Accepted
|
x, y, z = map(int, input().split())
ans = 0
x -= z
while x >= y + z:
ans += 1
x -= y + z
print(ans)
|
p02597
|
s295033288
|
Wrong Answer
|
N=int(input())
S= list(input())
W_count=S.count('W')
R_count=S.count('R')
if((W_count==0) or (R_count==0)):
print(0)
else:
if(len(S)%2==0):
print(min(W_count,R_count-S[:len(S)//2].count('R')))
else:
print(min(W_count,R_count-S[:len(S)//2+1].count('R')))
|
p02602
|
s137712033
|
Wrong Answer
|
n,k = map(int,input().split())
e = list(map(int,input().split()))
c = -1
for i in range(k-1,n):
b = e[i]+e[i-1]+e[i]
if i> k-1 and b>c:
print('Yes')
elif i > k-1:
print('No')
c = b
|
p02657
|
s194034584
|
Accepted
|
a, b = map(int, input().split())
print(a*b)
|
p03264
|
s750702967
|
Accepted
|
K = int(input())
a = K//2
b = (K+1)//2
print(a*b)
|
p02678
|
s161963122
|
Accepted
|
import numpy as np
from scipy import sparse
n, m = map(int, input().split())
ab = np.array([list(map(int, input().split())) for _ in range(m)])
g = sparse.csr_matrix(([1]*m, (ab[:, 0]-1, ab[:, 1]-1)), shape=(n, n))
_bfo, predecessors = sparse.csgraph.breadth_first_order(g, 0, directed=False)
if all(predecessors[1:] >= 0):
print('Yes')
for p in predecessors[1:]:
print(p+1)
else:
print('No')
|
p03137
|
s531492480
|
Wrong Answer
|
n, m = map(int, input().split())
x = sorted(set(list(map(int, input().split()))))
d = []
if n<m:
for i in range(m-1):
d.append(x[i+1] - x[i])
print(sum(sorted(d)[:-(n-1)]))
else:
print(1)
|
p03475
|
s255747997
|
Wrong Answer
|
n = int(input())
l = [list(map(int, input().split())) for _ in range(n-1)]
ans = [0]*n
for i in range(n):
time = 0
for j in range(i, n-1):
if l[j][1] - time > 0:
time += l[j][1] - time
time += time % l[j][2] + l[j][0]
ans[i] += time
print(ans)
|
p03328
|
s831938493
|
Wrong Answer
|
a,b = map(int, raw_input().split())
og = b - a - 1
print og * (og + 1) - a
|
p03681
|
s764093759
|
Wrong Answer
|
import math
n, m = map(int, input().split())
div = 10**9 + 7
if abs(n-m)>1:
print(0)
exit()
elif n == m:
ans1 = math.factorial(n)
ans = 2 * ans1 * ans1
else:
ma = max(n,m)
mi = max(n,m)
ans1 = math.factorial(mi)
ans = ans1*ans1*ma
print(ans % div)
|
p02792
|
s903458257
|
Wrong Answer
|
N = int(input())
ans = 0
C = [ [0 for i in range(10)] for i in range(10)]
for i in range(1,N):
first_num = int(str(i)[0])
last_num = int(str(i)[-1])
C[first_num][last_num] += 1
for first_num in range(1,10):
for last_num in range(1,10):
ans += C[first_num][last_num] * C[last_num][first_num]
print(ans)
|
p02594
|
s917229848
|
Wrong Answer
|
a=int(input())
if a <= 30:
print("Yes")
else:
print("No")
|
p02847
|
s233958835
|
Wrong Answer
|
x = ['SUN', 'MON', 'TUE', 'WED', 'THU', 'FRI', 'SAT', 'SUN']
y = x.index(input())
if (y == 0):
print(7)
else:
print(min(abs(7-y),abs(y)))
|
p02613
|
s456913296
|
Wrong Answer
|
N = int(input())
i = 0
C0 = 0
C1 = 0
C2 = 0
C3 = 0
while (i < N):
i += 1
S = input()
if(S == 'AC'):
C0 += 1
elif(S == 'WA'):
C1 += 1
elif(S == 'TLE'):
C2 += 1
else:
C3 += 1
print("AC × " + str(C0))
print("WA × " + str(C1))
print("TLE × " + str(C2))
print("RE × " + str(C3))
|
p02933
|
s163901689
|
Accepted
|
a=int(input())
s=input()
if a>=3200:
print(s)
else:
print("red")
|
p02556
|
s619151066
|
Accepted
|
def get_ints():
return list(map(int,input().split()))
n = int(input())
a,b = [],[]
for i in range(n):
x,y = get_ints()
a.append(x+y)
b.append(x-y)
a.sort()
b.sort()
ans = max(a[-1]-a[0], b[-1]-b[0])
print(ans)
|
p02970
|
s076335674
|
Accepted
|
import math
N, D = map(int, input().split())
print(math.ceil(N/(D * 2 + 1)))
|
p03331
|
s162544158
|
Accepted
|
N = int(input())
A = [i for i in str(N)]
result = 0
for j in range(len(A)):
result += int(A[j])
if result == 1 and A[0] == "1":
print(10)
else:
print(result)
|
p02918
|
s004701920
|
Accepted
|
n,k=map(int,input().split())
s=input()
c=1
for i in range(n-1):
if s[i]!=s[i+1]:c+=1
print(n-c+min(c-1,k*2))
|
p03076
|
s864130123
|
Accepted
|
nums = [int(input()) for _ in range(5)]
mods = [(10 - num % 10 if num % 10 != 0 else 0) for num in nums]
last = max(mods)
print(sum(nums) + sum(mods) - last)
|
p03986
|
s571178147
|
Wrong Answer
|
import sys
input = sys.stdin.readline
def log(*args):
print(*args, file=sys.stderr)
def main():
x = input().strip()
tc = 0
sc = 0
for c in x[::-1]:
if c == 'S':
sc += 1
else:
break
for c in x:
if c == 'T':
tc += 1
else:
break
print(max(sc, tc) * 2)
if __name__ == '__main__':
main()
|
p03478
|
s513933654
|
Accepted
|
n,a,b = [int(x) for x in input().split()]
ans = 0
for x in range(n+1):
amount = sum([int(i) for i in list(str(x))])
if amount >= a and amount <= b:
ans += x
print(ans)
|
p02771
|
s261926422
|
Accepted
|
a,b,c=sorted(list(map(int,input().split())))
if (a==b and b!=c)or(a!=b and b==c):print("Yes")
else:print("No")
|
p03352
|
s870489616
|
Wrong Answer
|
import math
X = int(input())
print(math.floor(X**0.5)**2)
|
p03261
|
s463459566
|
Wrong Answer
|
N = int(input())
W = [input() for _ in range(N)]
Ws =[]
ans = 'Yes'
for i in range(N):
Ws.append(W[i])
for j in range(1,N+1):
if W[i][-1] == W[j][0]:
break
else:
ans = 'No'
break
#print(Ws)
if len(set(W)) != len(Ws):
ans = 'No'
print(ans)
|
p03001
|
s046879873
|
Accepted
|
W, H, x, y = map(int, input().split())
menseki = (W*H)/2
if (x == W/2) & (y == H/2):
print(str(menseki) + " 1")
else:
print(str(menseki) + " 0")
|
p03479
|
s539429865
|
Accepted
|
x,y=map(int, input().split()) #a1 a2 a3
ans=x
i=0
while ans<=y:
ans*=2
i+=1
print(i)
|
p02881
|
s100808345
|
Accepted
|
n = int(input())
m = int(n**0.5)
c = float("inf")
for i in range(m, 0, -1):
if n%i == 0:
print(n//i + i - 2)
exit()
|
p03612
|
s813063245
|
Wrong Answer
|
a=input()
a=list(map(int,input().split()))
count=0
for itr in range(len(a)):
if itr==a[itr]: count+=1
print(count-1)
|
p03131
|
s293051969
|
Accepted
|
k, a, b = map(int, input().split())
if b-a<=2 or a>=k:
print(k+1)
else:
print((b-a)*((k-a+1)//2)+(k-a+1)%2+a)
|
p02835
|
s696757874
|
Wrong Answer
|
A = list(map(int, input().split()))
if sum(A) >= 22:
print("win")
else:
print("bust")
|
p02554
|
s835607372
|
Wrong Answer
|
import sys
input = sys.stdin.readline
def main():
n = int(input())
if n == 1:
ans = 0
else:
mod = pow(10, 9)+7
ans = pow(10, n, mod) + pow(8, n, mod) - 2*pow(9, n, mod)
print(ans)
if __name__ == "__main__":
main()
|
p02753
|
s004933634
|
Accepted
|
S = input()
if S == "AAA" or S == "BBB":
print("No")
else:
print("Yes")
|
p03759
|
s262648755
|
Accepted
|
a,b,c = map(int, input().split())
if b-a == c-b:
print('YES')
else:
print('NO')
|
p02639
|
s991174569
|
Accepted
|
x = list(map(int, input().split()))
n = len(x)
for i in range(n):
if x[i] == 0:
print(i+1)
exit()
|
p03067
|
s941050458
|
Wrong Answer
|
a,b,c, = map(int,input().split())
if a<b:
if c<b:
print("Yes")
elif c>b:
print("No")
else:
if b<c:
print("Yes")
elif b>c:
print("No")
|
p02935
|
s156361450
|
Accepted
|
N = int(input())
V = sorted(list(map(int, input().split())), reverse=True)
for _ in range(N-1):
x = V.pop()
y = V.pop()
V.append((x + y) / 2)
V.sort(reverse=True)
print(*V)
|
p03827
|
s628028929
|
Accepted
|
from sys import stdin
nii=lambda:map(int,stdin.readline().split())
lnii=lambda:list(map(int,stdin.readline().split()))
n=int(input())
s=input()
x=0
ans=0
for i in s:
if i=='I':
x+=1
else:
x-=1
ans=max(ans,x)
print(ans)
|
p02601
|
s274581652
|
Accepted
|
a, b, c = map(int, input().split())
k = int(input())
while True:
if b > a:
break
b *= 2
k -= 1
while True:
if c > b:
break
c *= 2
k -= 1
if k < 0:
print('No')
else:
print('Yes')
|
p02713
|
s875149904
|
Wrong Answer
|
import math
from functools import reduce
def gcd(*number):
return reduce(math.gcd, number)
n = int(input())
a, b, c = 1, 1, 1
sum = 0
list_number = []
while True:
print(a,b,c)
list_number.append(gcd(a, b, c))
if n > c:
c += 1
elif n == c and n == b and n == a:
break
elif n == c and n == b:
a += 1
b = 1
c = 1
elif n == c:
b += 1
c = 1
print(list_number)
for i in list_number:
sum = sum + i
print(sum)
|
p02923
|
s006687580
|
Wrong Answer
|
n = int(input())
h = list(map(int, input().split()))
ans = 0
s = 0
c = h[0]
for i in h[1:]:
if c >= i:
s += 1
else:
s = 0
c = i
ans = max(ans, s)
print(ans)
|
p03252
|
s736719454
|
Wrong Answer
|
import collections
S = list(input())
T = list(input())
cntS = collections.Counter(S)
cntT = collections.Counter(T)
if len(cntS) != len(cntT):
print('No')
exit()
else:
valS = cntS.most_common()[::-1]
valT = cntT.most_common()[::-1]
for i in range(len(valS)):
if valS[i][1] != valS[i][1]:
print('No')
exit()
print('Yes')
|
p02989
|
s216953388
|
Wrong Answer
|
n = int(input())
d = list(map(int,input().split()))
arc_list = list()
abc_list = list()
harf_num = int(n/2)
d.sort()
abc_list = d[:harf_num]
arc_list = d[harf_num:]
abc_max = max(abc_list)
arc_min = min(arc_list)
print(abc_max - arc_min)
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.