problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p03449 | s035318373 | Accepted | n = int(input())
l = []
for _ in range(2):
a = list(map(int,input().split()))
l.append(a)
if n == 1:
print(l[0][0]+l[1][0])
exit()
m1 = []
m2 = []
m1.append(0)
m1.append(l[0][0])
m2.append(0)
m2.append(l[1][0])
for i in range(1,n):
m1.append(m1[i]+l[0][i])
m2.append(m2[i]+l[1][i])
ans = [0]*n
for j in range(1,n+1):
ans[j-1] = m1[j]+(m2[n]-m2[j-1])
print(max(ans)) |
p02727 | s759144831 | Accepted | x, y, a, b, c = map(int, input().split())
p = list(map(int, input().split()))
q = list(map(int, input().split()))
r = list(map(int, input().split()))
p.sort(reverse = True)
q.sort(reverse = True)
r.sort(reverse = True)
pp = p[:x]
qq = q[:y]
if x+y <= c:
rr = r[:(x+y)]
else:
rr = r
ppqqrr = pp + qq + rr
ppqqrr.sort(reverse = True)
print(sum(ppqqrr[:x+y])) |
p02583 | s623893077 | Wrong Answer | # coding: utf-8
# Your code here!
N = input()
L = input().split(' ')
l = len(L)
L = [int(s) for s in L]
L.sort()
if len(L) < 3:
print(0)
exit
a = 0
for i in range(l - 2):
for j in range(i + 1, l - 1):
for k in range(j + 1, l):
if (L[i] + L[j]) > L[k]:
if (L[i] != L[j]) and (L[k] != L[j]) and (L[i] != L[k]):
a += 1
print(int(a)) |
p03797 | s313406626 | Accepted | n,m = map(int,input().split())
if n >=m//2:
print(m//2)
else:
print(n+(m-2*n)//4) |
p02657 | s137971564 | Accepted | n=input().split(" ")
print(int(n[0])*int(n[1])) |
p03455 | s772971617 | Accepted | a, b = map(int, input().split())
print("Even" if a * b % 2 == 0 else "Odd") |
p03557 | s881744122 | Wrong Answer | #import numpy as np
import sys
from collections import defaultdict
import math
import itertools
import bisect
import time
read = sys.stdin.buffer.read
readline = sys.stdin.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10000)
s = time.time()
N = int(readline())
tmp = list(map(int,input().split()))
A = []
[bisect.insort_right(A, x) for x in tmp]
#tmp.sort()
e = time.time()
print(e-s) |
p03434 | s429987425 | Accepted | N=int(input())
ls=input().split()
l=[ int(v) for v in ls ]
l.sort(reverse=True)
A=0
B=0
for i in range(N):
if i% 2 == 0:
A+=l[i]
else :
B+=l[i]
print(A-B)
|
p04044 | s689840861 | Accepted | N, L = map(int, input().split())
S = [input() for i in range(N)]
S.sort()
print("".join(S))
|
p02793 | s146843036 | Wrong Answer | from functools import lru_cache
import numpy as np
@lru_cache(maxsize=None)
def lcm(x, y):
def gcd(x, y):
if x == 0:
return y
else:
return gcd(y % x, x)
return x * y // gcd(x, y)
n = int(input())
a = np.array(list(map(int, input().split())))
mod = 10**9 + 7
x = a[0]
for i in a[1:]:
x = lcm(x, i)
r = x / a
print(int(sum(r) % mod))
|
p02624 | s039621847 | Accepted | from functools import reduce
n = int(input())
def f(x, y):
k = n // y
return x + k * (y + y * k) // 2
ans = reduce(f, range(n + 1))
print(ans)
|
p04034 | s595665489 | Wrong Answer | N,M = map(int,input().rstrip().split(" "))
ans = [False for _ in range(N + 1)]
balls = [1 for _ in range(N + 1)]
ans[1] = True
for i in range(M):
q = list(map(int,input().rstrip().split(" ")))
if ans[q[0]] == True:
ans[q[1]] = True
balls[q[0]] -= 1
if balls[q[0]] == 0: ans[q[0]] = False
balls[q[1]] += 1
ansi = 0
print(ans)
for i in range(N + 1):
if ans[i]: ansi += 1
print(ansi) |
p02658 | s957278982 | Wrong Answer | n = int(input())
a = list(map(int, input().split()))
limit = 10**18
ans = 1
flag = True
if 0 in a:
print(0)
flag = False
if flag:
for i in a:
ans *= i
if ans >= limit:
print(-1)
flag = False
break
if flag:
print(ans)
|
p02836 | s834621901 | Wrong Answer | lit = input().split()
length = len(lit)
times = 0
if length != 1:
for i in range(int(length/2)):
if lit[i] != lit[length-1-i]:
times += 1
print(times)
else:
print(times) |
p04005 | s161506086 | Accepted | a,b,c = map(int,input().split())
ans = a*b*c
if ans%2==0:
print(0)
else:
abc_list = [a,b,c]
abc_list.sort()
print(abc_list[0]*abc_list[1])
|
p02584 | s736542345 | Accepted | X, K, D = map(int, input().split())
X = abs(X)
if X > K*D:
print(X-K*D)
exit()
K -= X//D
if K%2 == 0:
print(abs(X-(X//D)*D))
else:
print(abs(X-(X//D)*D-D)) |
p02818 | s858969810 | Accepted | a , b, k = (int(x) for x in input().split())
if k > a:
if b - k + a <= 0:
b = 0
a = 0
else:
b = b - k + a
a = 0
else:
a = a - k
print(a,b)
|
p03449 | s717549046 | Accepted | N = int(input())
A=[list(map(int, input().split())) for i in range(2)]
for i in range(1, N):
A[0][i]=A[0][i]+A[0][i-1]
for i in range(N-1, 0, -1):
A[1][i-1]=A[1][i-1]+A[1][i]
max=0
for i in range(0, N):
if max<A[0][i]+A[1][i]:
max=A[0][i]+A[1][i]
print(max) |
p03625 | s585289753 | Accepted | from collections import Counter
n = int(input())
a = list(map(int, input().split()))
c = Counter(a) # リストの要素をカウント
cnt = [k for k, v in c.items() if v >= 2]
if len(cnt) < 2:
print(0)
else:
cnt = sorted(cnt, reverse=True)
if c[cnt[0]] >= 4:
print(cnt[0] * cnt[0])
else:
print(cnt[0] * cnt[1]) |
p02641 | s560223190 | Wrong Answer | x,n=map(int,input().split())
a=list(map(int,input().split()))
if n==0:
print(x)
else:
for i in range(n):
y=x-i
if y not in a:
print(y)
break
z=x+i
if z not in a:
print(z)
break |
p02773 | s683684461 | Accepted | N = int(input())
S = [input() for i in range(N)]
from collections import Counter
B = []
mycounter = Counter(S)
max_v = max(mycounter.values())
for s, v in mycounter.items():
if v == max_v:
B.append(s)
for a in sorted(B):
print(a) |
p03795 | s070819612 | Accepted | n = int(input())
print(n * 800 - (n // 15 * 200)) |
p03681 | s388494977 | Accepted | def fact(n):
val = 1
for i in range(2, n + 1):
val *= i
val %= 10**9 + 7
return val
x, y = map(int,input().split())
ans = 1
if abs(x-y) > 1:
print(0)
elif x == y:
print((fact(x)**2 *2) % (10**9+7))
else:
print((fact(x) * fact(y)) % (10**9+7))
|
p03815 | s310441646 | Wrong Answer | x = int(input())
def calc(n):
if n < 7:
return 1
elif n < 12:
return 2
else:
return (n // 11)*2 + calc(n % 11)
print(calc(x)) |
p03698 | s680402166 | Wrong Answer | S = input()
a = []
result = "Yes"
for s in S:
if s in a:
result = "No"
break
a.append(s)
print(result) |
p03695 | s703475787 | Wrong Answer | N = int(input())
a = list(map(int,input().split()))
color = [0 for j in range(9)]
for i in range(N):
if a[i] >= 3200:
color[8] += 1
else:
for j in range(8):
if a[i] // 400 == j:
color[j] += 1
color_min = 8 - color[:8].count(0)
if 8 - color_min <= color[8]:
color_max = 8
else:
color_max = color_min + color[8]
if color_min == 0:
color_min = 1
print(color_min, color_max) |
p03077 | s214195168 | Accepted | # import sys
# sys.setrecursionlimit(10 ** 6)
# import bisect
# from collections import deque
# from decorator import stop_watch
#
#
# @stop_watch
def solve(N, A, B, C, D, E):
tmp = min(A, B, C, D, E)
tmp, tmp2 = divmod(N, tmp)
tmp += 0 if tmp2 == 0 else 1
print(tmp + 4)
if __name__ == '__main__':
N = int(input())
A = int(input())
B = int(input())
C = int(input())
D = int(input())
E = int(input())
solve(N, A, B, C, D, E)
# # test
# from random import randint
# from func import random_str
# solve()
|
p02970 | s091894277 | Accepted | def people(n):
p=0
while n>0:
n-=(d*2+1)
p+=1
return p
def main():
print(people(n))
if __name__=='__main__':
n,d=map(int,input().split())
main() |
p03062 | s112515487 | Accepted | n = int(input())
a = list(map(int, input().split()))
cnt = 0
b = []
for i in range(n):
if a[i] < 0:
cnt += 1
b.append(abs(a[i]))
if cnt % 2 == 0:
ans = sum(b)
print(ans)
else:
ans = sum(b) - 2 * min(b)
print(ans)
|
p03524 | s368561005 | Wrong Answer | from collections import Counter
S = input()
d = Counter(S).values()
if len(d) == 3 and max(d) - min(d) <=1:
ans = "YES"
else:
ans = "NO"
print(ans) |
p03059 | s087642840 | Wrong Answer | a,b,t=map(int,input().split())
cnt=0
c=a
for i in range(a,t,c):
cnt=cnt+b
print(cnt)
|
p02747 | s355690652 | Accepted | S = input()
last = 'i'
if len(S) == 1:
print("No")
exit()
for c in S:
if (last == 'i' and c != 'h') or (last == 'h' and c != 'i'):
print("No")
exit()
last = c
if last != "i":
print("No")
exit()
print("Yes")
exit()
|
p02916 | s728811954 | Accepted | n = int(input())
order = list(map(int, input().split()))
for i in range(n):
order[i] -= 1
point = list(map(int, input().split()))
bonus = list(map(int, input().split()))
ans = 0
pre = -2
for i in range(n):
now = order[i]
ans += point[now]
if pre == now - 1:
ans += bonus[pre]
pre = now
print(ans) |
p03163 | s219504344 | Accepted | N, W = map(int, input().split())
dp = [[0]*(W+1) for _ in range(N+1)]
for i in range(1, N+1):
w, v = map(int, input().split())
for j in range(1, W+1):
if j >= w:
dp[i][j] = max(dp[i-1][j], dp[i-1][j-w]+v)
else:
dp[i][j] = dp[i-1][j]
print(dp[N][W]) |
p02775 | s753399934 | Accepted | S=input()
B0=int(S[-1])
B1=10-int(S[-1])
for s in S[::-1][1:]:
x=int(s)
B0,B1=min(B0+x,B1+x+1),min(B0+(10-x),B1+(10-x-1))
print(min(B0,B1+1)) |
p04033 | s747936630 | Accepted | # n, m, l = map(int, input().split())
# list_n = list(map(int, input().split()))
# n = input()
# list = [input() for i in range(N)
# list = [[i for i in range(N)] for _ in range(M)]
import sys
input = sys.stdin.readline
a, b = map(int, input().split())
if a > 0 and b > 0:
print("Positive")
elif a * b <= 0:
print("Zero")
elif (b - a) % 2 == 1:
print("Positive")
else:
print("Negative")
|
p02639 | s348771310 | Accepted | import copy
a = []
a = list(map(int, input().split()))
ctn = 0
for i in a:
if (i == 0):
print(ctn+1)
ctn += 1
|
p02615 | s623553381 | Wrong Answer | n = int(input())
a_list = list(map(int,input().split()))
print(sum(a_list) - min(a_list))
|
p02603 | s854679478 | Accepted | n = int(input())
A = list(map(int, input().split()))
money = 1000
stock = 0
schedule = []
for i in range(n-1):
if A[i] < A[i+1]:
schedule.append(i)
for i in schedule:
stock, money = divmod(money, A[i])
money = money+stock*A[i+1]
print(money)
|
p03665 | s747264389 | Wrong Answer | import math
def combinations(n, r):
return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))
n,p=map(int,input().split())
a=list(map(int,input().split()))
n0=0
n1=0
ans=0
for i in range(len(a)):
if a[i]%2:
a[i]=1
n1+=1
else:
a[i]=0
n0+=1
s=sum(a)
for i in range(0,s+1,2):
ans+=combinations(n1,i)
print(ans*(2**n0)) |
p03962 | s278797040 | Wrong Answer | a,b,c=map(int,input().split())
if a==b and a==c:
print(3)
elif a==b or a==c or b==c:
print(2)
else:
print(1) |
p02677 | s615665069 | Accepted | import math
all = input()
A = int(all.split(' ')[0])
B = int(all.split(' ')[1])
H = int(all.split(' ')[2])
M = int(all.split(' ')[3])
delta_ = H/12+(1/12)*(M/60)-M/60
c = (A**2+B**2-2*A*B*math.cos(2*delta_*math.pi))**0.5
print(c) |
p03761 | s447593528 | Accepted | import sys
from collections import Counter
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 8)
INF = float('inf')
MOD = 10 ** 9 + 7
def main():
N = int(readline())
count = Counter(readline().decode('utf-8').strip())
for _ in range(N-1):
count &= Counter(readline().decode('utf-8').strip())
ans = ''
for key, value in count.items():
ans += key*value
ans = sorted(ans)
print(''.join(map(str,ans)))
if __name__ == '__main__':
main()
|
p03680 | s227086402 | Accepted | N = int(input())
As = [int(input())-1 for i in range(N)]
seen = [-1] * N
# print(As)
from collections import deque
q = deque()
q.append(0)
seen[0] = 1
cnt = 1
while len(q) > 0:
a = q.popleft()
n = As[a]
# print("pop",n)
if n == 1:
print(seen[a])
exit()
if seen[n] > -1: continue
seen[n] = seen[a] + 1
q.append(n)
print(-1)
|
p03673 | s219835877 | Accepted | n = int(input())
A = list(map(int,input().split()))
odd = A[0::2]
even = A[1::2][::-1]
ans = even + odd
if n % 2 == 1:
ans = ans[::-1]
print(*ans) |
p02761 | s453472834 | Accepted | N, M=map(int, input().split())
ans=["-1"]*N
f=0
for i in range(M):
s, c=map(int, input().split())
if s==1 and c==0 and N!=1:
f=1
if ans[s-1]!=str(c) and ans[s-1]!="-1":
f=1
ans[s-1]=str(c)
if f==1:
print(-1)
else:
if ans[0]=="-1" and N!=1:
ans[0]="1"
elif M==0 and N==1:
ans[0]="0"
a="".join(ans)
b=a.replace("-1", "0")
print(b)
|
p03605 | s094973872 | Accepted | n = input()
count = 0
for i in n:
if i == '9':
count = 1
if count == 1:
print('Yes')
else:
print('No') |
p03264 | s754417703 | Accepted | n = int(input())
q, r = divmod(n, 2)
print(q*(q+r)) |
p02973 | s736223382 | Accepted | import bisect
from collections import deque
N = int(input())
nums = [int(input()) for _ in range(N)]
# i<jで、 AiとAjが同じ色で塗られている場合、Ai < Ajが成り立つ.
# その際に、色の最小数をだす。
LIS = deque([nums[0]])
count = 0
for index, num in enumerate(nums):
if index == 0:
continue
if num <= LIS[0]:
LIS.appendleft(num)
else:
insert_index = bisect.bisect_left(LIS, num)
LIS[insert_index - 1] = num
print(len(LIS))
|
p02629 | s184276109 | Accepted | N=int(input())
N_26=[]
while N>0:
N-=1
N_mod=N%26
N=N//26
N_26.append(chr(97+N_mod))
print("".join(list(reversed(N_26))))
|
p02784 | s218669792 | Accepted | h, n = map(int, input().split())
a = list(map(int, input().split()))
if h <= sum(a):
print('Yes')
else:
print('No') |
p02970 | s110343738 | Accepted | n,d=map(int,input().split())
print((n+2*d)//(2*d+1)) |
p02836 | s711765765 | Wrong Answer | s = input()
ans = 0
for i in range(0,len(s)):
if s[i] != s[len(s)-i-1]:
ans += 1
print(ans/2)
|
p03852 | s709882810 | Wrong Answer | c=raw_input()
if c=="a,e,i,o,u,y":
print "vowel"
else:
print "consonant" |
p03037 | s214906192 | Accepted | n,m=map(int,input().split())
limax=0
rimin=n
for i in range(m):
li,ri=map(int,input().split())
if li>limax:
limax=li
if ri<rimin:
rimin=ri
if rimin<limax:
print(0)
else:
print(rimin-limax+1) |
p02861 | s893503039 | Accepted | import itertools
import math
n = int(input())
x,y = [0] * n, [0] * n
for i in range(n):
dx,dy = map(int,input().split())
x[i], y[i] = dx, dy
ans = 0
for i in itertools.permutations(range(n)):
i = list(i)
for j in range(n - 1):
ans += math.sqrt(pow(x[i[j]] - x[i[j + 1]], 2) + pow(y[i[j]] - y[i[j + 1]], 2))
num = 1
for i in range(n):
num *= i + 1
print(ans / num) |
p02548 | s671249766 | Wrong Answer | n = int(input())
count = 0
for a in range(1, n):
count += (n - 0.5) // a
print(count) |
p03309 | s013703521 | Wrong Answer | N=int(input())
A=list(map(int,input().split()))
for i in range(N):
A[i] = A[i] - i - 1
b = sum(A) // N
b1 = b + 1
ans = 0
ans1 = 0
for i in range(N):
ans += abs(A[i] - b)
ans1 += abs(A[i] - b1)
print(min(ans,ans1))
|
p02682 | s736926703 | Accepted | A, B, C, K = map(int, input().split())
if K <= A:
print(K)
elif A < K <= A+B:
print(A)
else:
K -= (A+B)
print(A-K) |
p03986 | s463818605 | Accepted | def main():
x = input()
s = 0
count = 0
for cur in x:
if cur == "S":
s += 1
else:
if s != 0:
s -= 1
else:
count += 2
print(count)
if __name__ == '__main__':
main() |
p03548 | s265637203 | Wrong Answer | x, y, z = map(int, input().split())
ans = 0
while x > y + z:
ans += 1
x -= y + z
print(ans)
|
p03485 | s183290691 | Accepted | print((sum(map(int,input().split()))+1)//2) |
p02947 | s539084230 | Wrong Answer | n = int(input())
d = {}
ans = 0
for i in range(n):
s = str(input())
s = "".join(sorted(list(s)))
if s in d:
d[s] += 1
else:
d[s] = 1
for j in d.values():
if j == 1:
pass
elif j == 2:
ans += 1
else:
ans += j
print(ans) |
p02699 | s852806346 | Accepted | S,W = map(int, input().split())
s = 'safe' if S > W else 'unsafe'
print(s) |
p02793 | s578770478 | Accepted | #import math
#g = math.gcd
import fractions
g = fractions.gcd
n = int(input())
a = [int(_) for _ in input().split()]
mod = 10**9 + 7
lcm = 1
for x in a:
lcm *= x // g(lcm, x)
ans = 0
for x in a:
ans += lcm * pow(x, mod - 2, mod)
ans %= mod
print(ans) |
p03150 | s356317118 | Wrong Answer | s = input()
k = 'keyence'
for i in range(1, 8):
a, b = i, 7-i
l, r = k[:i], k[i:]
if l in s and r in s:
print("YES")
exit()
print('NO') |
p03042 | s284238238 | Wrong Answer | s = input()
if '00' in s:
print('NA')
elif int(s[:2]) <= 12 and int(s[2:]) <= 12:
print('AMBIGUOUS')
elif int(s[2:]) > 13:
print('MMYY')
elif int(s[:2]) > 13:
print('YYMM')
else:
print('NA') |
p02633 | s798153454 | Accepted | x=int(input())
from math import gcd
g=gcd(x,360)
print(360//g)
|
p02700 | s569759353 | Accepted | import math
a,b,c,d = map(int,input().split())
if math.ceil(c/b) <= math.ceil(a/d):
print("Yes")
else:
print("No") |
p03059 | s934768045 | Accepted | a,b,t = list(map(int,input().split()))
print("{:}".format(t//a*b)) |
p02831 | s634918305 | Accepted | import fractions
a, b = map(int, input().split())
print(a*b//fractions.gcd(a,b)) |
p02899 | s043485855 | Accepted | n = int(input())
a = list(map(int, input().split()))
b = [0] * n
for i, x in enumerate(a):
b[x - 1] = i + 1
print(' '.join(map(str, b))) |
p04033 | s591611241 | Accepted | a,b=map(int,input().split())
if 0<a:
print("Positive")
exit()
else:
if b<0:
S=(b-a+1)%2
if S==1:
print("Negative")
else:
print("Positive")
else:
print("Zero") |
p02994 | s344126355 | Wrong Answer | n, l = map(int, input().split())
aji = (l + l+n-1)*(n/2)
if l >= 0 :
ans = aji - l
elif l < 0 and abs(l)-n > 0 :
ans = aji - (l+n-1)
else :
ans = aji
print(int(ans))
|
p02848 | s114799362 | Wrong Answer | n = int(input())
S = input()
tmp = []
for s in S:
if ord(s)+n > ord('Z'):
tmp.append(ord('A')+(ord(s)+n)%ord('Z'))
else:
tmp.append(ord(s)+n)
ans = ''
for i in tmp:
ans += chr(i)
print(ans) |
p03251 | s842919297 | Wrong Answer | N,M,X,Y = map(int,input().split())
x = [X] + list(map(int,input().split()))
y = [Y] + list(map(int,input().split()))
if max(x) >= min(y):
print("War")
else:
print("NO War") |
p03077 | s096657531 | Wrong Answer | n=int(input())
a=int(input())
b=int(input())
c=int(input())
d=int(input())
e=int(input())
from math import floor
print(5+floor(n/min(a,b,c,d,e))) |
p02726 | s943513665 | Wrong Answer | n,x,y = list(map(int,input().split()))
ans = [0]*(n-1)
for i in range(n-1):
for j in range(i+1,n):
ans[min(j-i,1+abs(x-1-i)+abs(y-1-j))]+=1
for num in ans:
print(num) |
p03673 | s926198623 | Accepted | n = int(input())
a = list(map(int, input().split()))
even = []
odd = []
for i in range(n):
if i % 2:
even.append(a[i])
else:
odd.append(a[i])
if n % 2 == 0:
print(*even[::-1], end=" ")
print(*odd)
else:
print(*odd[::-1], end=" ")
print(*even)
|
p02773 | s362192367 | Accepted | import sys
input = sys.stdin.readline
d = {}
for _ in range(int(input())):
s = input().replace("\n", "")
if s in d:
d[s] += 1
else:
d[s] = 1
x = max(d.values())
l = sorted(s for (s, i) in d.items() if i == x)
print(*l, sep="\n") |
p03592 | s849924558 | Accepted | n, m, k = map(int, input().split())
for i in range(n+1):
for j in range(m+1):
area = i*j + (n-i) * (m-j)
if k == area:
print('Yes')
exit()
print('No') |
p03673 | s408620302 | Accepted | from collections import deque
n = int(input())
a = list(map(int,input().split()))
b = deque()
for i in range(n):
if i%2==0:
b.append(a[i])
else:
b.appendleft(a[i])
if n%2==0:
print(*b)
else:
print(*reversed(b)) |
p02784 | s435036375 | Accepted | h, n = list(map(int,input().split()))
a = list(map(int,input().split()))
if(sum(a) >= h):
print('Yes')
else:
print('No') |
p02596 | s550923243 | Accepted | k = int(input())
x = 7
e = 10
for i in range(10000000):
# print(x)
if x % k == 0:
print(i + 1)
exit()
x = (x * e + 7) % k
print("-1") |
p02993 | s499922318 | Accepted | # -*- coding: utf-8 -*-
s = str(input())
if s[0] == s[1] or s[1] == s[2] or s[2] == s[3]:
print('Bad')
else:
print('Good') |
p02659 | s775706309 | Accepted | def main():
A, B = input().split()
A = int(A)
B_big, B_small = B.split(".")
B_big = int(B_big)
B_small = int(B_small)
print(A*B_big + A*B_small//100)
if __name__ == "__main__":
main()
|
p03285 | s521331102 | Accepted | n=int(input())
exist=False
for i in range(n):
for j in range(n):
if 4*i+7*j==n:
print("Yes")
exist=True
if exist:
break
if exist:
break
if not exist:
print("No") |
p02983 | s357599930 | Wrong Answer | L,R = map(int,input().split())
L = L%2019
R = R%2019
ans = 2018
for i in range(L,R+1):
for j in range(i+1,R+1):
ans=min(ans,i*j)
print(ans) |
p03211 | s378797828 | Wrong Answer | comp=753
s=input()
ans=1000000000
for i in range(7,0,-1):
if s.count(str(i)):
left = s.find(str(i))
while left!=-1 and left<=len(s)-3:
tmp = max(ans,int(s[left:left+3]))
ans = min(ans, abs(comp-ans))
left = s.find(str(i),left+1)
break
print(ans)
|
p03107 | s814123807 | Accepted | list_n = list(input())
l = len(list_n)
a = list_n.count("0")
b = list_n.count("1")
ab = max(a, b) - min(a, b)
print(l-ab) |
p03639 | s465116044 | Accepted | n = int(input())
a = list(map(int, input().split()))
c1 = c2 = 0
for x in a:
if x % 4 == 0:
c1 += 1
elif x % 2 == 0:
c2 += 1
print(("Yes" if c1 + int(c2 / 2) >= int(n / 2) else "No")) |
p02881 | s901639085 | Accepted | import math
N = int(input())
ans = 10**13
for k in range(1,math.floor(math.sqrt(N))+1):
if N % k == 0:
ans = min(ans,k+N//k-2)
print(ans)
|
p03323 | s811892039 | Accepted | a,b=map(int,input().split())
if a>8 or b>8:
print(":(")
else:
print("Yay!") |
p02880 | s908520255 | Accepted | n=int(input())
flag=0
for i in range(1,10):
for j in range(1,10):
if i*j==n:
flag+=1
if flag>=1:
print('Yes')
else:
print('No') |
p02708 | s477475611 | Accepted | n,k = map(int,input().split())
count = 0
for i in range(k, n+2):
min_num = int((i-1) * i /2)
max_num = int(i*(2*n-i+1)/2)
count += (max_num - min_num+1)
print(count % (10**9 + 7)) |
p02970 | s122680315 | Wrong Answer | n,d=map(int,input().split())
print(n//d)
|
p02676 | s368427263 | Wrong Answer | k=int(input())
s=str(input())
if(len(s)==k):
print(s)
elif (len(s)>k):
i=len(s)-k
palabra=s[i:len(s)]+s[0:i]
print(palabra) |
p02989 | s230347821 | Wrong Answer | n=int(input())
d=list(map(int,input().split()))
d.sort()
a=int(n/2)
i=int(n/2-1)
print(d)
if d[a]!=d[i]:
num=d[a]-d[i]
print(num)
else:
print(0) |
p02546 | s252358086 | Accepted | s=input()
if(s[-1]=='s'):
print(s+'es')
else:
print(s+'s') |
p02696 | s132237388 | Wrong Answer | a, b, n = map(int, input().split())
print(a * (b-1) // b)
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.