problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p02571 | s993941525 | Wrong Answer | # coding:utf-8
s = input()
t = input()
ans = len(t)
for i in range(len(s) - len(t)):
count = 0
for j in range(0, len(t)):
if s[i + j] != t[j]:
count += 1
ans = min(ans, count)
print(ans)
|
p02714 | s926680618 | Accepted | n = int(input())
s = input()
ans = s.count('R')*s.count('G')*s.count('B')
c = 0
for i in range(n):
for j in range(n):
k = 2*j - i
if 0 <= k <= n-1:
if i < j and j < k:
if s[i] != s[j] and s[j] != s[k] and s[i] != s[k]:
c += 1
print(ans-c) |
p03331 | s174968003 | Wrong Answer | import math
N = int(input())
n = N
amari = 0
for i in range (len(str(N))):
amari += n % 10
n = math.floor(n / 10)
if amari < 10:
print(10+amari)
else:
print(amari) |
p03345 | s065640147 | Wrong Answer | print('Unfair') |
p02621 | s923524634 | Accepted | a = int(input())
print(a+a**2+a**3) |
p02684 | s199815836 | Accepted | N,K=map(int,input().split())
A=[int(i)-1 for i in input().split()]
def times(X,Y):
return [X[Y[i]] for i in range(N)]
def exponen(X,n):
if n==0:
return [i for i in range(N)]
if n==1:
return X
if n%2==0:
Y=exponen(X,n//2)
return times(Y,Y)
if n%2==1:
Y=exponen(X,n//2)
return times(times(Y,Y),X)
B=exponen(A,K)
print(B[0]+1)
|
p02607 | s255804482 | Accepted | #import numpy as np
#import functools
#import operator
#from itertools import combinations as comb
#from itertools import combinations_with_replacement as comb_with
#from itertools import permutations as perm
#import collections as C #most_common
#import math
#import sympy
N = int(input())
#N,K,d= map(int,input().split())
A = list(map(int,input().split()))
#S = str(input())
#T = str(input())
c=0
for i in range(1,N+1):
if i%2!=0 and A[i-1]%2!=0:
c+=1
print(c)
|
p03145 | s979409685 | Accepted | a = list(map(int, input().split()))
a.sort()
print(a[0] * a[1] // 2) |
p02595 | s645072866 | Accepted | import math
N,D = map(int,input().split())
c = 0
for i in range (N):
x, y = map(int,input().split())
dis = x**2 + y**2
if D >= math.sqrt(dis):
c = c + 1
print(c) |
p03998 | s988490474 | Wrong Answer | import sys
stdin = sys.stdin
ns = lambda: stdin.readline().rstrip()
ni = lambda: int(stdin.readline().rstrip())
nm = lambda: map(int, stdin.readline().split())
nl = lambda: list(map(int, stdin.readline().split()))
p=[0]*3
p[0]=ns()
p[1]=ns()
p[2]=ns()
turn='A'
d={'A':0,'B':1,'C':2}
while(len(p[d[turn]])==0):
tmp=p[d[turn]][0]
p[d[turn]][0]=[]
turn=tmp
print(turn) |
p02729 | s650115822 | Accepted | N,M=[int(s) for s in input().split(" ")]
Ans1=M*(M-1)/2
Ans2=N*(N-1)/2
print(int(Ans1+Ans2)) |
p02760 | s641206285 | Accepted | f = lambda:list(map(int,input().split()))
la = f()+f()+f()
sb = set()
n = int(input())
for i in range(n):
b = int(input())
if b in la:
sb.add(la.index(b))
ls = [{0,1,2},{0,3,6},{0,4,8},{1,4,7},{2,4,6},{2,5,8},{3,4,5},{6,7,8}]
for s in ls:
if s<=sb:
print('Yes')
break
else:
print('No') |
p02935 | s525960674 | Accepted | n = int(input())
v = list(map(int,input().split()))
v.sort()
p = v[0]
for i in range(1,n):
p = (p + v[i]) / 2
print(p) |
p02793 | s994968701 | Accepted | MOD=10**9+7
def gcd(x,y):
if(x<y) :
z=y
y=x
x=z
if(y==0):
return x
return gcd(x%y,y)
def lcm(x,y):
return x//gcd(x,y)*y
n=int(input())
a=list(map(int,input().split()))
l=1
for x in a:
l=lcm(l,x)
ans=0
for x in a:
ans += l//x
print(ans%MOD)
|
p03328 | s143264696 | Accepted | a, b = map(int, input().split())
sum = 0
for i in range(b-a):
sum += i
print(sum - a) |
p02624 | s873310721 | Wrong Answer | N=int(input())
s=0
for i in range(1,N+1):
cnt=0
for j in range(1,int(N**0.5)+1):
if i%j==0:
cnt+=1
if (i**0.5).is_integer():
s+=i*((cnt-1)*2+1)
else:s+=i*cnt*2
print(s) |
p03486 | s710334205 | Accepted | s = input()
t = input()
print('Yes' if sorted(s) < sorted(t, reverse=True) else 'No') |
p03323 | s572215620 | Wrong Answer | a,b=map(int,input().split())
if a>9 or b>9:
print(":(")
else:
print("Yay!") |
p02730 | s643288793 | Accepted | s = input()
n = len(s)
a = (n - 1) // 2
b = (n + 3) // 2
s_reverse = s[::-1]
s_first = s[:a]
s_first_reverse = s_first[::-1]
s_second = s[b-1:]
s_second_reverse = s_second[::-1]
if s == s_reverse and s_first == s_first_reverse and s_second == s_second_reverse:
print('Yes')
else:
print('No')
|
p02838 | s842624339 | Wrong Answer | #python3
import numpy as np
n=int(input())
a=np.array([int(i) for i in input().split()])
mod=int(1e9+7)
ans=0
for k in range(60):
b = (a>>k)&1
m = b.sum()
ans += m*(n-m)*2**k
print(ans%mod) |
p03665 | s328901730 | Accepted | import sys
import itertools
# import numpy as np
import time
import math
import heapq
from collections import defaultdict
sys.setrecursionlimit(10 ** 7)
INF = 10 ** 18
MOD = 10 ** 9 + 7
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
# map(int, input().split())
N, P = map(int, input().split())
A = list(map(int, input().split()))
dp = [0] * 5005
dp[0] = 1
for a in A:
for i in range(5000, 0, -1):
if i - a >= 0:
dp[i] += dp[i - a]
print(sum(dp[i] for i in range(len(dp)) if i % 2 == P)) |
p02696 | s641536109 | Accepted | A,B,N= map(int,input().split())
floor_num=[]
if N >=B:
floor_num.append(int(A*(B-1)/B))
else:
floor_num.append(int(A*N/B))
print(max(floor_num))
|
p02862 | s836251763 | Accepted | mod=10**9+7
N,K=list(map(int,input().split()))
if (N+K)%3==0 and N*2>=K and K*2>=N:
A=max(N,K)-min(N,K)
low=(min(N,K)-A)//3
all_pt=low*2+A
else:
print(0)
exit()
up,down=1,1
for i in range(low):
up=up*(all_pt-i)%mod
down=down*(i+1)%mod
base=pow(down,mod-2,mod)
print(up*base%mod) |
p02888 | s222889198 | Wrong Answer | import sys
import bisect
readline = sys.stdin.readline
readlines = sys.stdin.readlines
ns = lambda: readline().rstrip() # input string
ni = lambda: int(readline().rstrip()) # input int
nm = lambda: map(int, readline().split()) # input multiple int
nl = lambda: list(map(int, readline().split())) # input multiple int to list
n = ni()
l = sorted(nm())
print(l)
ans = 0
for i in range(n-2):
for j in range(i+1, n-1):
a = l[i]
b = l[j]
idx = bisect.bisect_left(l, a + b)
if idx > j: ans += idx - j - 1
print(ans) |
p02842 | s180854655 | Wrong Answer | import math
x = int(input())
ans = round(x/1.08)
if x == math.floor(ans * 1.08):
print(ans)
else:
print(":(") |
p03557 | s887036678 | Wrong Answer | import bisect
n = int(input())
A = list(map(int, input().split()))
B= list(map(int, input().split()))
C= list(map(int, input().split()))
print(sum(bisect.bisect_left(A,b)*(n-bisect.bisect_right(C,b)) for b in B)) |
p02595 | s537899160 | Accepted |
def main():
N, D = map(int, input().split())
P = [list(map(int, input().split())) for _ in range(N)]
D2 = D**2
count = 0
for p in P:
if p[0]**2 + p[1]**2 <= D2:
count += 1
print(count)
if __name__ == '__main__':
main()
|
p02792 | s797577363 | Wrong Answer | N = int(input())
cnts = [[0] * 10 for _ in range(10)]
ans = 0
for i in range(N):
if i % 10 == 0:
continue
s = str(i)
cnts[int(s[0])][int(s[-1])] += 1
for i in range(N):
if i % 10 == 0:
continue
s = str(i)
ans += cnts[int(s[-1])][int(s[0])]
print(ans)
|
p02860 | s196873991 | Accepted | import sys
input = sys.stdin.readline
def main():
N = int(input())
S = input().strip()
t = len(S) // 2
if S[:t] == S[t:]:
print('Yes')
else:
print('No')
if __name__ == "__main__":
main()
|
p02996 | s461197588 | Accepted | N = int(input())
AB = [tuple(map(int, input().split())) for i in range(N)]
AB.sort(key=lambda x: x[1])
t = 0
for a, b in AB:
t += a
if t <= b:
continue
else:
print("No")
exit(0)
print("Yes")
|
p02718 | s334973333 | Accepted |
def resolve():
N,M=map(int,input().split())
A=sorted(list(map(int,input().split())),reverse=True)
val=sum(A)/(4*M)
cnt=0
for i in A:
if i >=val:
cnt+=1
if cnt>=M:
print('Yes')
else:
print('No')
resolve() |
p02952 | s315361833 | Accepted | N = int(input())
count = 0
for i in range(1, N+1):
if len(str(i)) % 2 != 0:
count = count + 1
print(count) |
p02606 | s772678397 | Accepted | l , r , d = map(int, input().split())
print(r//d-(l-1)//d)
|
p03723 | s428219886 | Wrong Answer | import sys
inint = lambda: int(sys.stdin.readline())
inintm = lambda: map(int, sys.stdin.readline().split())
inintl = lambda: list(inintm())
instrm = lambda: map(str, sys.stdin.readline().split())
instrl = lambda: list(instrm())
a, b, c = inintm()
if a == b == c:
print(-1)
exit()
ans = 0
while a % 2 == b % 2 == c % 2 == 0:
d = a
e = b
f = c
a = e/2 + f/2
b = d/2 + f/2
c = d/2 + e/2
ans += 1
print(ans) |
p03644 | s378159561 | Wrong Answer | n=int(input())
i=0
while n-2**i>0:
i+=1
print(2**(i-1)) |
p02707 | s693631409 | Accepted | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
N = int(input())
A = list(map(lambda x: int(x)-1, input().split()))
dic = {}
for a in A:
dic[a] = dic.get(a, 0)+1
for i in range(N):
print(dic.get(i, 0)) |
p03221 | s314347203 | Wrong Answer | from collections import deque
x,y=map(int,input().split())
citylist=deque([[] for x in range(x)])
inputlist=deque()
arucity=set()
for a in range(y):
s,t=map(int,input().split())
citylist[s-1].append(t)
inputlist.append(s)
inputlist.append(t)
arucity.add(s)
for a in arucity:
citylist[a-1].sort()
for b in range(y):
e=inputlist.popleft()
print("{:08}{:08}".format(e,(citylist[e-1].index(inputlist.popleft())+1))) |
p02818 | s636451997 | Accepted | a, b, k = map(int, input().split())
print(f"{max(a-k,0)} {max(b-max(k-a,0),0)}") |
p03761 | s006401837 | Accepted | import string
import collections
n = int(input())
res = ''
dic_lst = []
for i in range(n):
w = collections.Counter(input())
dic_lst.append(w)
for ch in string.ascii_lowercase:
cc = 100
for w in dic_lst:
cc = min(cc, w[ch])
res += ch * cc
print(res)
|
p03944 | s830181458 | Accepted | w, h, n = map(int, input().split())
x1 = 0
y1 = 0
x2 = w
y2 = h
f = 0
for i in range(n):
x, y, a = map(int, input().split())
if a == 1:
x1 = max(x, x1)
elif a == 2:
x2 = min(x, x2)
elif a == 3:
y1 = max(y, y1)
elif a == 4:
y2 = min(y, y2)
if x1 >= x2 or y1 >= y2 or x2 <= 0 or y2 <= 0:
f = 1
if f:
print("0")
else:
print((x2-x1)*(y2-y1)) |
p03001 | s873036869 | Accepted | # C - Rectangle Cutting
W,H,x,y = map(int,input().split())
S = W*H
# H,W の中心と x,y の距離
distx = abs(W/2 - x)
disty = abs(H/2 - y)
if distx == disty == 0:
ans = (S/2,1)
else:
ans = (S/2,0)
print(*ans) |
p03220 | s876551776 | Accepted | # -*- coding: utf-8 -*-
def get_diff(T, A, x):
temp = T - x * 0.006
return abs(temp - A)
N = int(input())
T,A = map(int, input().split())
H_list = list(map(int, input().split()))
for i, h in enumerate(H_list):
if i==0:
diff_min = get_diff(T, A, h)
diff_min_idx = i + 1
else:
diff = get_diff(T, A, h)
if diff_min > diff:
diff_min = diff
diff_min_idx = i + 1
print(diff_min_idx)
|
p02603 | s357632667 | Accepted | n = int(input())
a = list(map(int, input().split()))
money = 1000
for i in range(n - 1):
if a[i+1] > a[i]:
money = money % a[i] + money // a[i] * a[i+1]
print(money) |
p03067 | s039441635 | Wrong Answer | A,B,C = map(int,input().split())
print("Yes" if A<=C and C<=B else "No") |
p02633 | s257194177 | Accepted | from math import gcd
X = int(input())
def lcm(a, b):
return a * b // gcd(a, b)
print(360 // gcd(X, 360))
|
p03000 | s460348339 | Wrong Answer | y = [int(z) for z in input().split()]
l = [int(z) for z in input().split()]
d = [0]*(y[0]+1)
for i in range(1,y[0]+1):
d[i] = d[i-1]+l[i-1]
if (d[i]>y[1]):
if (i==y[0]):
i+=1
break
print(i)
|
p02582 | s568962080 | Accepted | S = input()
compareStr = 'R' * len(S)
while len(compareStr) > 0:
if compareStr in S:
break
compareStr = compareStr[:-1]
print(len(compareStr))
|
p03474 | s967519222 | Accepted | dic = ["0","1","2","3","4","5","6","7","8","9"]
A,B = map(int,input().split())
S = list(input())
ok = True
for i in range(A):
if not(S[i] in dic):
ok=False
if S[A]!="-":
ok=False
for i in range(A+1,A+B+1,1):
if not(S[i] in dic):
ok =False
print("Yes" if ok else"No")
|
p03611 | s516281639 | Wrong Answer | from collections import defaultdict
N = int(input())
A = list(map(int,(input().split())))
c = defaultdict(lambda:0)
for i in A:
c[i] += 1
p = []
for i in range(1,10**5-1):
p.append(c[i]+c[i+1]+c[i+2])
print(max(p)) |
p02829 | s594490669 | Accepted | num_l = [1, 2, 3]
num_l.remove(int(input()))
num_l.remove(int(input()))
print(num_l.pop()) |
p02775 | s971407908 | Accepted | N = map(int, input()[::-1])
a, b = 0, 9
for n in N:
a, b = min(n+a, n+b), min(11-n+a, 9-n+b)
print(min(a, b)) |
p03107 | s770487071 | Accepted | S = input()
num_0 = S.count('0')
num_1 = S.count('1')
print(min(num_0, num_1)*2) |
p03035 | s847542755 | Accepted | a, b=map(int, input().split())
if(a >=6):
print(b if a>=13 else b//2)
else:
print(0) |
p03623 | s284110841 | Wrong Answer | x, a, b = map(int, input().split())
if abs(x - a) > abs(x - b):
print("A")
else:
print("B")
|
p03160 | s117906989 | Wrong Answer | n = int(input())
heights = list(map(int, input().split()))
dp = [0] * n
for i in range(n):
act_h = heights[i]
for j in [(i+1), (i+2)]:
if j < n:
next_h = heights[j]
new_w = abs(next_h -act_h)
if dp[j] == 0:
dp[j] = dp[i] + new_w
else:
dp[j] = min(dp[i] + new_w, dp[j])
print(dp[-1]) |
p03544 | s821499893 | Accepted | n=int(input())
l0=2
l1=1
if n>1:
for i in range(2,n+1):
l=l0+l1
l0=l1
l1=l
print(l1)
elif n==1:
print(1)
else:
print(2) |
p03041 | s771718642 | Accepted | n, k = map(int, input().split())
s = input()
print(s[:k-1]+s[k-1].lower()+s[k:])
|
p03328 | s876795206 | Wrong Answer | a,b=map(int,input().split())
count=0
A=[]
B=[]
for i in range(1000):
count+=i
if 0<=count-a<=a:
A.append(count-a)
if 0<=count-b<=b:
B.append(count-b)
for i in A:
if i in B:
print(i)
break |
p02983 | s117149505 | Wrong Answer | l,r = map(int,input().split())
x = []
for i in range(l,r+1):
x.append(i%2019)
x.sort()
print(x[0]*x[1]%2019) |
p03073 | s469109558 | Accepted | s = list(input())
cnt0 = 0
cnt1 = 0
for i, ss in enumerate(s):
if i % 2 == 0 :
if ss == '0':
cnt1 += 1
else:
cnt0 += 1
else:
if ss == '1':
cnt1 += 1
else:
cnt0 += 1
print(min(cnt0,cnt1))
|
p03416 | s945435357 | Accepted | a, b = map(int, input().split())
ans = 0
for i in range(a, b+1):
if str(i) == str(i)[::-1]:
ans += 1
print(ans)
|
p02708 | s869915232 | Accepted | n, k = map(int, input().split(" "))
ans = 0
for i in range(k, n+2):
min = i * ( 0 + i-1) / 2
max = i * ( (n+1 - i) + n) / 2
ans += int(max - min + 1)
print(ans % (10**9 + 7)) |
p02835 | s329201165 | Accepted | #A
a = sum(map(int, input().split()))
if a > 21:
print('bust')
else:
print('win') |
p02813 | s446796020 | Accepted | from itertools import permutations
n = int(input())
p = tuple(map(int,input().split()))
q = tuple(map(int,input().split()))
list_ = list(permutations(range(1,n+1)))
print(abs(list_.index(p)-list_.index(q))) |
p02675 | s209536659 | Accepted | mod = int(1e9+7)
def add(a, b):
c = a + b
if c >= mod:
c -= mod
return c
def main():
#N, K = map(int,raw_input().split())
n = int(raw_input())
d = n % 10
if d == 3:
print('bon')
elif d == 0 or d == 1 or d == 6 or d == 8:
print('pon')
else:
print('hon')
main() |
p02775 | s053517123 | Wrong Answer | n=[int(str) for str in list(input())]
#print(n)
#calculate how many times you have to modify
a=len(n)
for i in range(1,a):
if n[-i]==5 & n[-i-1]>=5:
n[-i]=5.0000001
if 5<n[-i] :
n[-i]=10-n[-i]
n[-i-1]+=1
if 6<=n[0]:
n[0]=10-n[0]
n.insert(0,1)
print(round(sum(n))) |
p03042 | s993589652 | Accepted | s = input()
a = 1<= int(s[:2]) <=12
b = 1<= int(s[2:]) <=12
if a and b:
print("AMBIGUOUS")
elif a:
print('MMYY')
elif b:
print('YYMM')
else:
print('NA') |
p03434 | s214824981 | Wrong Answer |
# Press the green button in the gutter to run the script.
if __name__ == '__main__':
n = int(input())
a = input().split()
bob = 0
alice = 0
sort_a = sorted(a, reverse=True)
count = 0
for m in range(len(sort_a)):
if m % 2 == 0:
alice += int(sort_a[m])
else:
bob += int(sort_a[m])
print(alice - bob)
|
p02923 | s381466011 | Accepted | n = int(input())
h = list(map(int, input().split()))
answer = 0#これなに
m = 0#カウントするやつやね
for i in range(n-1):
if h[i] >= h[i+1]:
m += 1
else:
answer = max(answer,m)
m = 0
answer = max(answer,m)
print(answer)
|
p03821 | s771881845 | Wrong Answer | from sys import stdin
import fractions
n = int(stdin.readline().rstrip())
li = [[0,0]]+[list(map(int,stdin.readline().rstrip().split())) for _ in range(n)]
li = li[::-1]
count = 0
for i in range(n):
if li[i][0]%li[i][1] != 0:
count += -li[i][0]%li[i][1]
li[i+1][0] += count
print(count) |
p03095 | s549148173 | Accepted | from collections import defaultdict
N = int(input())
S = input()
d = defaultdict(int)
for s in S:
d[s] += 1
ans = 1
for c in d:
ans *= (d[c] + 1)
mod = pow(10, 9) + 7
print((ans - 1) % mod) |
p03264 | s271836152 | Wrong Answer | k = int(input())
if k%2==0:
print((k//2)**2)
elif k%2==1:
print(((k-1)//2)*(k//2))
|
p02819 | s826253651 | Accepted | import math
def is_prme_number(num):
if num == 1:
return False
for i in range(2, int(math.sqrt(num)) + 1):
if num % i == 0:
return False
return True
def main():
x = int(input())
while True:
if is_prme_number(x):
break
x += 1
print(x)
if __name__ == '__main__':
main()
|
p04020 | s453195181 | Accepted | import sys
sys.setrecursionlimit(10 ** 5 + 10)
def input(): return sys.stdin.readline().strip()
def resolve():
n = int(input())
A = [int(input()) for i in range(n)]
ans = 0
seq_cnt = 0
for i in range(n):
if A[i] != 0:
seq_cnt += A[i]
else:
ans += seq_cnt // 2
seq_cnt = 0
ans += seq_cnt // 2
print(ans)
resolve() |
p02723 | s468829581 | Accepted | S=input()
if S[2]==S[3]:
if S[4]==S[5]:
print('Yes')
else:
print('No')
else:
print('No') |
p02861 | s565853444 | Wrong Answer | from math import factorial
def dist(x1, y1, x2, y2):
return ((x1 - x2)**2 + (y1 - y2)**2)**0.5
N = int(input())
x, y = [0]*N, [0]*N
for i in range(N):
x[i], y[i] = map(int, input().split())
ans = 0
for i in range(N-1):
for j in range(i+1, N):
ans += dist(x[i], y[i], x[j], y[j]) * 2
ans /= factorial(N)
print(ans)
|
p02597 | s724390586 | Accepted | n = int(input())
c = input()
s = [0]
for i in range(n):
if c[i] == 'R':
s.append(s[i])
else:
s.append(s[i] + 1)
r = n - s[n]
ans = 10**10
for i in range(n + 1):
ans = min(ans, max(s[i], r - i + s[i]))
print(ans)
|
p03417 | s110745747 | Accepted | n, m = list(map(int, input().split()))
if n == m == 1:
print(1)
elif n == 1 or m == 1:
print(n * m - 2)
else:
print(n * m - 2 * (n + m - 2))
|
p03319 | s289369884 | Accepted | n, k = map(int, input().split())
a = list(map(int, input().split()))
print(-(-(n-1)//(k-1)))
|
p03359 | s446456536 | Accepted | a, b = map(int, input().split())
if a>b:
print(a-1)
else:
print(a) |
p03319 | s611373058 | Accepted | n,k=map(int,input().split())
a=input()
print((n-1+k-2)//(k-1)) |
p02705 | s077615907 | Accepted | import math
def solve():
r = int(input())
ans = r * 2 * math.pi
print(ans)
if __name__ == '__main__':
solve()
|
p03103 | s787682513 | Accepted | import math
N,M = map(int, input().split())
l = [[int(i) for i in input().split()] for j in range(N)]
l.sort()
count = 0
i = 0
while(M > 0):
M -= l[i][1]
count += l[i][0]*l[i][1]
if(M < 0):
count -= abs(M)*l[i][0]
i += 1
print(count) |
p02933 | s321364983 | Accepted | import sys
a = int(input())
s = input()
if not ( 2800 <= a < 5000 ): sys.exit()
if not ( 1 <= len(s) <= 10 ): sys.exit()
if not s.islower(): sys.exit()
print(s) if a >= 3200 else print('red') |
p02742 | s722629943 | Accepted | def main():
H,W = map(int,input().split())
N = H*W
#print(N//2)
if H == 1 or W == 1:
return 1
elif N%2 == 0:
ans = int(N/2)
else:
ans = int((N//2) + 1)
return ans
print(main())
|
p02711 | s938664519 | Accepted | n = int(input())
has_7 = '7' in str(n)
if has_7:
print('Yes')
else:
print('No') |
p03721 | s582044974 | Accepted | N,K = map(int,input().split())
ans = []
for i in range(N):
ab = list(map(int,input().split()))
ans.append(ab)
ans.sort()
l = 0
for i in range(N):
l += ans[i][1]
if l >= K:
s = i
break
print(ans[s][0]) |
p02785 | s512451076 | Accepted | n,k=map(int, input().split())
h=list(map(int, input().split()))
h.sort(reverse=True)
ans=sum(h)
if n>k:
for i in range(k):
ans=ans-h[i]
else:
ans=0
print(ans) |
p02612 | s439149919 | Accepted | #abc173a
n=int(input())
if n%1000==0:
print(0)
exit()
print(1000-n%1000)
|
p03241 | s850644137 | Wrong Answer | n,m=map(int,input().split())
for i in reversed(range(int(m**0.5)+1)):
if m%i==0:
if i>=n:print(m//i)
elif m//i>=n:print(i)
break |
p03730 | s442125160 | Accepted | a, b, c = map(int, input().split())
for i in range(1, b+1):
if (a*i)%b == c:
print("YES")
exit(0)
print("NO") |
p03162 | s197874730 | Wrong Answer | n=int(input())
dp=[[0 for i in range(3)] for i in range(n)]
ans = 0
I=[0]*n
for i in range(n):
dp[i]=list(map(int,input().split()))
S=dp[i].copy()
S.sort(reverse = True)
if i == 0 or dp[i].index(S[0]) != I[i-1]:
I[i]=dp[i].index(S[0])
ans += S[0]
else:
I[i]=dp[i].index(S[1])
ans += S[1]
print(ans) |
p03862 | s140732771 | Accepted | N,X = map(int,input().split())
A = list(map(int,input().split()))
ans = 0
for i in range(1,N):
if A[i] + A[i-1] <= X: continue
diff = A[i] + A[i-1] - X
ans += diff
if diff < A[i]:
A[i] -= diff
else:
#diff -= A[i]
A[i] = 0
#A[i-1] -= diff
print(ans) |
p03160 | s913553132 | Wrong Answer | size = int(input())
array = list(map(int, input().split()))
dp = [0]* size
for jump in range(1,size):
z= [1,2]
for i in range(len(z)):
dp[jump] = min(dp[jump],dp[i] + dp[jump] )
print(dp[-1]) |
p02983 | s640933229 | Accepted | l, r = map(int, input().split())
mod = 2019
ans = 1001001001
for i in range(l, min(r+1, l+2020)):
for j in range(i+1, min(r+1, i+1+2020)):
ans = min(ans , i*j%mod)
print(ans) |
p02600 | s159925785 | Wrong Answer | X = int(input())
if X > 400 and X < 599:
print('8')
elif X > 600 and X < 799:
print('7')
elif X > 800 and X < 999:
print('6')
elif X > 1000 and X < 1199:
print('5')
elif X > 1200 and X < 1399:
print('4')
elif X > 1400 and X < 1599:
print('3')
elif X > 1600 and X < 1799:
print('2')
elif X > 1800 and X < 1999:
print('1') |
p03494 | s813591722 | Wrong Answer | n=int(input())
a=list(map(int, input().split()))
t=0
g=0
for i in range(n):
while a[i]%2==0:
t+=1
a[i]=a[i]//2
if g==0:
g=t
else:
g=min(g,t)
print(g) |
p02952 | s875628522 | Wrong Answer | N = int(input())
ans = 0
for i in range(N+1):
if i % 2 != 0:
ans += 1
else:
ans += 0
print("%d"%(ans))
|
p02753 | s501022110 | Accepted | S = input()
if("A" in S and "B" in S):
print("Yes")
else:
print("No") |
p02866 | s714024717 | Accepted | mod = 998244353
n = int(input())
D = list(map(int, input().split()))
if D[0] != 0:
print(0)
exit()
CNT = [0] * n
for d in D:
CNT[d] += 1
if CNT[0] >= 2:
print(0)
exit()
ans = 1
for i in range(1, n):
ans *= pow(CNT[i - 1], CNT[i], mod)
ans %= mod
print(ans)
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.