problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p02660 | s347113212 | Accepted | n=int(input())
ans=0
i=2
while i*i<=n:
cnt=0
while n%i==0:
n//=i
cnt+=1
j=0
# print(i,cnt)
for k in range(1,cnt+1):
if (k*(k+1))//2<=cnt:
j=max(j,k)
ans+=j
i+=1
# print('n',n)
if n>1:
ans+=1
print(ans)
|
p04012 | s169973327 | Accepted | from collections import defaultdict
w = list(input())
alphabet_count_dict = defaultdict(int)
for c in w:
alphabet_count_dict[c] += 1
for k, v in alphabet_count_dict.items():
if v % 2 == 1:
print("No")
exit()
print("Yes")
|
p03645 | s554738084 | Accepted | n, m = map(int, input().split())
list_AB = [ list(map(int,input().split(" "))) for i in range(m)]
list_MAP = [0]*(n+1)
for l in list_AB:
l.sort()
if l[0] == 1:
list_MAP[l[1]] += 1
if l[1] == n:
list_MAP[l[0]] += 1
ans = "IMPOSSIBLE"
for num in list_MAP:
if num > 1:
ans = "POSS... |
p03524 | s121858575 | Wrong Answer | s=input()
t = set(s)
if len(t) != 3:
if len(t)==1:
print("YES")
else:
print("NO")
else:
a = s.count("a")
b = s.count("b")
c = s.count("c")
M = max(a,b,c)
m = min(a,b,c)
if M - m >1 :
print("NO")
else:
print("YES")
|
p02924 | s233152181 | Accepted | n = int(input())
print((n - 1) * n // 2) |
p03773 | s933333602 | Wrong Answer | A, B = map(int, input().split())
print(A + B if A + B <= 24 else (A + B) % 24) |
p03838 | s144263811 | Accepted | x,y=map(int,input().split())
if 0<=x<y or x<y<=0:
print(y-x)
elif 0<y<x or y<x<0:
print(2+x-y)
elif x<0<y or y<0<x:
print(1+abs(x+y))
if x==0 and y<0 :
print(abs(y)+1)
if y==0 and x>0:
print(x+1) |
p02823 | s940785927 | Wrong Answer | n, a, b = map(int, input().split())
if (b - a) % 2 == 0:
print(int((b-a)/2))
else:
print(min(a-1, n-b)+1+int((b-a-1)/2)) |
p02848 | s996910481 | Wrong Answer | N=int(input())
S=input()
tmp=""
for i in range(len(S)):
chtmp=ord(S[i])+N
if(chtmp>ord('Z')):
chtmp-=ord('A')
tmp+=chr(chtmp)
print(tmp)
|
p02790 | s922888413 | Accepted | def main():
a, b = map(int, input().split())
str_ba = str(b) * a
str_ab = str(a) * b
if str_ab > str_ba:
print(str_ba)
else:
print(str_ab)
if __name__ == '__main__':
main()
|
p03329 | s593608795 | Accepted | import math
n=int(input())
l1=math.ceil(math.log(n,6))
l2=math.ceil(math.log(n,9))
dp=[i for i in range(n+1)]
for i in range(1,l1+1):
for j in range(n):
if j+6**i<n+1:
dp[j+6**i]=min(dp[j]+1,dp[j+6**i])
for i in range(1,l1+1):
for j in range(n):
if j+9**i<n+1:
dp[j+9**i]=... |
p03838 | s550761149 | Wrong Answer | x,y=map(int,input().split())
if abs(x) == abs(y):
print(1)
elif x>=0 and y >=0 and x<y:
print(abs(x-y))
elif x>= 0 and y >= 0 and x>y:
print(y+x+1)
elif x<=0 and y<=0 and x<y:
print(y-x)
else:
print(abs(x-y)+2) |
p02719 | s522072609 | Accepted | N,K = list(map(int,input().split()))
a=N//K
p=abs(N-a*K)
m=abs(N-(a+1)*K)
if p>m:
print(m)
else:
print(p) |
p03475 | s902472222 | Accepted | N = int(input())
C = [list(map(int,input().split())) for _ in range(N-1)]
for i in range(N-1):
now = 0
for j in range(i,N-1):
now = max(C[j][1], -(-now//C[j][2])*C[j][2])
now += C[j][0]
print(now)
print(0) |
p04005 | s150687128 | Accepted | a, b, c = map(int, input().split())
if a % 2 == 1 and b % 2 == 1 and c % 2 == 1:
print(a*b*c//max(a, b, c))
else:
print(0) |
p02615 | s008351724 | Accepted | N = int(input())
A = list(map(int, input().split()))
A.sort(reverse=True)
gain = 0
n = 1
while n <= N-1:
if n % 2:
gain += A[(n-1)//2]
# print(f'{n}, added {A[(n-1)//2]}')
else:
gain += A[(n+1)//2]
# print(f'{n}, added {A[(n+1)//2]}')
n += 1
print(gain) |
p02713 | s555109034 | Accepted | K = int(input())
#a,bの最大公約数
def gcd(a, b):
while b:
a, b = b, a % b
return a
ans = 0
for i in range(1, K+1):
for j in range(1, K+1):
for k in range(1, K+1):
ans += gcd(gcd(i, j), k)
print(ans)
|
p03043 | s702883434 | Accepted | N, K = map(int, input().split())
P = 0
for i in range(1, N+1):
if i >= K:
P += (N-i+1) / N
break
else:
n = 1
while i*n < K:
n *= 2
P += 1 / (N*n)
print(P) |
p02873 | s772085683 | Wrong Answer | s = input()
n = len(s)
dp = [0]*(n+1)
t = 0
for e,i in enumerate(s,1):
if i=='<' :
dp[e]=dp[e-1]+1
print(dp)
t = 0
for e in range(n-1,-1,-1):
i = s[e]
print(t)
if i=='>' :
dp[e]=max(dp[e],dp[e+1]+1)
# print(dp)
print(sum(dp)) |
p02747 | s968153897 | Accepted | # coding: utf-8
# Your code here!
s = list(input())
Flg = True
if len(s) % 2 == 1:
Flg = False
for i in range(len(s)-1):
if i % 2 == 0:
if s[i] == 'h' and s[i+1] == 'i':
pass
else:
Flg = False
if Flg:
print('Yes')
else:
print('No') |
p03545 | s682331197 | Accepted | n=input()
op_cnt=len(n)-1
for i in range(2**op_cnt):
op=["-"]*op_cnt
for j in range(op_cnt):
if ((i>>j)&1):
op[j]="+"
formula=""
for p_n, p_o in zip(n, op + [""]):
formula += (p_n + p_o)
if eval(formula) == 7:
print(formula + "=7")
break
|
p02661 | s948739427 | Accepted |
def Z(): return int(input())
def ZZ(): return [int(_) for _ in input().split()]
def main():
N = Z()
A, B = [], []
for _ in range(N):
a, b = ZZ()
A.append(a)
B.append(b)
A.sort()
B.sort()
midA = A[N//2] if N%2 == 1 else (A[N//2-1] + A[N//2])
midB = B[N//2] if N%2 == ... |
p02948 | s113105884 | Wrong Answer |
N, M = map(int, input().split())
T = []
for i in range(N):
a, b = map(int, input().split())
T.append((a, b))
T.sort(key=lambda x: (-x[1], -x[0]))
j = 0
ans = 0
for i in range(N):
days, money = map(int, T[i])
if j + days <= M:
ans += money
j += 1
i += 1
print(ans) |
p03339 | s848898874 | Accepted | from sys import maxsize
n = int(input())
s = input()
count_e = [0]
count_w = [0]
for i in range(1, n+1):
if s[i-1] == 'E':
count_e.append(count_e[i-1]+1)
count_w.append(count_w[i-1])
else:
count_e.append(count_e[i-1])
count_w.append(count_w[i-1]+1)
min = maxsize
for i in range... |
p02971 | s878493682 | Wrong Answer | N = int(input())
A = [0]*N
for i in range (N):
A[i] = int(input())
max1 = 0
max2 = 0
for i in range (N):
if A[i] >= max1:
max1 = A[i]
elif A[i] >= max2:
max2 = A[i]
for i in range (N):
if A[i] == max1:
print(max2)
else:
print(max1) |
p02859 | s853424623 | Accepted | #!/usr/bin/env python3
def main():
r = int(input())
print(r * r)
main() |
p02755 | s547796583 | Accepted | a,b = map(int,input().split())
for i in range(1,10000):
if int(i*0.08) == a and int(i*0.1) == b:
print(i)
break
else:
print(-1) |
p03761 | s313422014 | Accepted | #ran time eerror
from collections import Counter
d = int(input())
l = []
for k in range(d):
r = input()
l.append(Counter(r))
oi = l[0]
for g in range(1,d):
oi = oi & l[g]
print("".join(sorted(oi.elements())))
|
p03681 | s184691745 | Wrong Answer | a,b = map(int,input().split())
div = 10e9+7
if abs(a-b)>1:
print(0)
else:
print(a*b*2//div) |
p02689 | s980273002 | Accepted | # -*- coding: utf-8 -*-
n, m = map(int, input().split())
h = list(map(int, input().split()))
s = set()
for i in range(m):
a, b = map(int, input().split())
if h[a-1] == h[b-1]:
s.add(a)
s.add(b)
elif h[a-1] > h[b-1]:
s.add(b)
else:
s.add(a)
print(n-len(s)) |
p02797 | s183569402 | Accepted | n, k, s = map(int, input().split())
if s == 10**9:
print(*([10**9] * k + [1] * (n - k)))
else:
print(*([s] * k + [10**9] * (n - k)))
|
p03030 | s544185985 | Accepted | n=int(input())
R=[]
for i in range(n):
s,p=input().split()
R.append([s,100-int(p),i+1])
R.sort()
for r in R:
print(r[2]) |
p03457 | s587241648 | Accepted | N = int(input())
T, X, Y = 0, 0, 0
can_reach = True
for i in range(N):
next_T, next_X, next_Y = map(int, input().split())
z = next_T - T - abs(X - next_X) - abs(Y - next_Y)
if z >= 0 and z % 2 == 0:
T, X, Y = next_T, next_X, next_Y
else:
can_reach = False
break
if can_reach:
print('Yes')
... |
p02606 | s288598360 | Accepted | l,r,d=map(int, input().split()) #a1 a2 a3
ans=0
for i in range(l,r+1):
if i%d==0:
ans+=1
print(ans) |
p03804 | s637295989 | Accepted | n,m = map(int,input().split())
a = [input() for i in range(n)]
b = [input() for i in range(m)]
ans = "No"
for i in range(n-m+1):
for j in range(n-m+1):
flag = True
for k in range(m):
if a[i+k][j:j+m]!=b[k]:
flag = False
break
if flag:
a... |
p02912 | s505962409 | Accepted | import heapq
n, m = map(int, input().split())
a = list(map(lambda x: int(x) * (-1), input().split()))
heapq.heapify(a)
for _ in range(m):
tmp_min = heapq.heappop(a)
heapq.heappush(a, (-1) * (-tmp_min // 2))
print(-sum(a))
|
p02689 | s764644684 | Accepted | N,M=map(int,input().split())
a=list(map(int,input().split()))
lst=[]
for i in range(M):
b=list(map(int,input().split()))
if a[b[0]-1]>a[b[1]-1]:
lst.append(b[1])
elif a[b[0]-1]==a[b[1]-1]:
lst.append(b[0])
lst.append(b[1])
else:
lst.append(b[0])
print(N-len(set(lst))) |
p03962 | s418622065 | Wrong Answer | def iroha():
a, b, c = map(int, input().split())
if a == b == c:
print(1)
elif a != b != c:
print(3)
else:
print(2)
if __name__ == "__main__":
iroha()
|
p03282 | s288900061 | Wrong Answer | s = input()+"2"
k = int(input())
for i,j in enumerate(s):
if j != "1":
now = i
break
if s == "1"*len(s):
print(1)
else:
if k < now:
print(1)
else:
print(s[now]) |
p03745 | s293592579 | Accepted | N = int(input())
A = list(map(int, input().split()))
li = []
for i in range(N-1):
if A[i+1] - A[i] > 0:
li.append('+')
elif A[i+1] - A[i] < 0:
li.append('-')
else:
pass
# print(li)
ans = 1
p = 0
m = 0
for i in li:
if i == '+':
p = 1
elif i == '-':
m = 1
i... |
p02775 | s107651587 | Accepted | n = input()
n = n[::-1]
n += '0'
cnt = 0
dp = [[float('inf')] * 2 for _ in range(len(n) + 1)]
dp[0][0] = 0
dp[0][1] = 1
for i in range(len(n)):
a = int(n[i])
dp[i + 1][0] = min(dp[i][0] + a, dp[i][1] + a + 1)
dp[i + 1][1] = min(dp[i][0] + 10 - a, dp[i][1] + 10 - (a + 1))
print(min(dp[len(n)][0], dp[len(n)][... |
p03469 | s339895363 | Wrong Answer | s = input()
print('2017'+s[4:]) |
p02970 | s722437344 | Accepted | import math
n,d = map(int,input().split())
print(math.ceil(n/(d*2+1))) |
p02718 | s127136552 | Accepted | N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
gross_vote = sum(A)
A_pop = [i for i in A if i>=gross_vote/4/M]
if len(A_pop)>=M:
print("Yes")
else:
print("No") |
p02642 | s686103600 | Accepted | import sys
input = sys.stdin.readline
n = int(input())
a = list(map(int, input().split()))
a.sort()
c = [0] * (10**6+1)
for i in a:
c[i] += 1
uni = []
a = list(set(a))
for i in a:
if c[i] == 1:
uni.append(i)
b = [0 for _ in range(10**6+1)]
for i in a:
for j in range(i*2, 10**6+1, i):
... |
p02718 | s280979201 | Wrong Answer | N, M = map(int, input().split())
A_list = list(map(int, input().split()))
sum_list = sum(A_list)
n = sum_list*0.25*M
a = 0
for i in A_list:
if i>=n:
a+=1
if a>=M:
print('Yes')
else:
print('Yes')
|
p02657 | s911276168 | Wrong Answer | a,b=list(map(int,input().split()))
print(a,b) |
p02796 | s232858584 | Accepted | M,a =-float("inf"),0
for X,L in sorted(zip(*[iter(map(int,open(0).read().split()[1:]))]*2),key=sum):
l,r=X-L,X+L
if M<=l:a+=1;M=r
print(a) |
p02989 | s270181520 | Wrong Answer | n=int(input())
d=list(map(int,input().split()))
ans=0
for k in range(max(d)):
dn=0
for i in d:
if i<k:
dn+=1
else:
pass
if dn==len(d)/2:
ans+=1
print(ans) |
p03814 | s796805078 | Wrong Answer | s = input()
ans = 0
flg = 0
for i in range(len(s)):
if s[i] == 'A' and flg == 0:
ans += 1
flg = 1
elif flg == 1 and s[i] == 'Z':
flg = 2
ans += 1
elif flg == 1:
ans += 1
print(ans) |
p03075 | s720150766 | Accepted | I = list(map(int, open(0).read().split()))
print("Yay!" if I[4] - I[0] <= I[5] else ":(") |
p03220 | s207562055 | Accepted | N = int(input())
T, A = map(int, input().split())
list1 = []
H = list(map(int, input().split()))
X = [abs(T-h*0.006-A) for h in H]
print(X.index(min(X))+1) |
p03469 | s525784857 | Accepted | s= input()
print(s[:3] + '8' + s[4:])
|
p03760 | s806605654 | Accepted | O = input()
E = input()
for o, e in zip(O, E):
print(o, e, end='', sep='')
if len(O) != len(E):
print(O[-1]) |
p03479 | s246473412 | Wrong Answer | import math
a,b = map(int, input().split())
n= math.floor(math.log2(b/a))
print(n+1) |
p02900 | s450720940 | Accepted | from fractions import gcd
import math
def test(a,b):
x = gcd(a,b)
s = []
for i in range(2, int(math.sqrt(x)) + 1):
while x % i == 0:
s.append(i)
x //= i
s.append(x)
s.append(1)
return list(set(s))
def main():
a, b = map(int, input().split())
num = []
num = test(a, b)
print(len... |
p03293 | s933913052 | Wrong Answer | s = list(input())
t = list(input())
for i in range(len(s)):
if s == t:
print('Yes')
exit(0)
a = s[-1]
s.pop(0)
s.append(a)
print('No') |
p02700 | s737717073 | Accepted | a,b,c,d = map(int,input().split())
while a > 0 and c > 0:
a -= d
c -= b
if c <= 0:
print('Yes')
else:
print('No')
|
p02993 | s000294056 | Accepted | passw = input()
if passw[0] == passw[1] or passw[1] == passw[2] or passw[2] == passw[3]: print("Bad")
else: print("Good")
|
p02629 | s185135447 | Accepted | # -*- coding: utf-8 -*-
n=int(input())
namelist=[]
name=''
while n>0:
n-=1
namelist.append(chr(ord('a')+n%26))
n=int(n/26)
for i in namelist[::-1]:
name+=i
print(name) |
p03250 | s093070173 | Wrong Answer | a,b,c=map(int,input().split())
print(max([10*a+b,a+10*b,10*b+c,b+10*c,10*a+c,a+10*c])) |
p02696 | s416430276 | Wrong Answer | A,B,N= list(map(int, input().split()))
print(min(B-1,N)) |
p02720 | s744986750 | Accepted | from collections import*
a=deque([1,2,3,4,5,6,7,8,9])
k=int(input())
for _ in range(k):
i=a.popleft()
if i%10>0:a.append(10*i+i%10-1)
a.append(10*i+i%10)
if i%10<9:a.append(10*i+i%10+1)
print(i) |
p02726 | s388920523 | Wrong Answer | n, x, y = map(int, input().split())
def count(k, n):
counter = 0
for i in range(1, n):
for j in range(i+1, n+1):
if i <= x and y <= j:
if k == ((j - i) - (y - x) + 1):
counter += 1
else:
if k == (j - i):
counter += 1
return counter
def main():
for k in range... |
p02796 | s712415025 | Wrong Answer | n=int(input())
list=[]
for i in range(n):
x,l=map(int,input().split())
list.append([x-l+1,x+l-1])
list=sorted(list,key=lambda x:x[1])
cnt=0
min=-10**10
for r,l in list:
if min<r:
cnt+=1
min=l
print(cnt) |
p02754 | s871317241 | Accepted | N, A, B = map(int, input().split())
how_many = N // (A+B)
r = N % (A+B)
if r >= A:
print(A*how_many + A)
else:
print(A*how_many + r) |
p03319 | s796226635 | Wrong Answer | n, k =map(int, input().split())
a = list(map(int, input().split()))
if n == k:
print(1)
elif k == 2:
print(n - 1)
else:
print(int(n / (k - 1))) |
p03612 | s753199270 | Accepted | n = int(input())
p = [int(i) for i in input().split()]
i = 0
ans = 0
while i < n:
if i < n - 1:
if p[i] == i + 1:
p[i], p[i+1] = p[i+1], p[i]
ans += 1
elif p[i] == i + 1:
ans += 1
i += 1
print(ans)
|
p02622 | s745267052 | Accepted | S = input()
T = input()
count = 0
for i in range(len(S)):
if S[i] != T[i]:
count += 1
print(count)
|
p02842 | s358226073 | Wrong Answer | n = int(input())
price = n *25 / 27
p = price.is_integer()
if p == True:
print(price // 1)
elif p == False:
print(":(") |
p03827 | s311052929 | Accepted | # -*- coding: utf-8 -*-
n = int(input())
s = input()
x = [0 for _ in range(n + 1)]
for i in range(n):
if s[i] == 'I':
x[i + 1] = x[i] + 1
else:
x[i + 1] = x[i] - 1
print(max(x))
|
p03323 | s977362527 | Accepted | A, B = map(int, input().split())
if max(A, B) > 8:
print(':(')
else:
print('Yay!') |
p02988 | s690498049 | Accepted | n = int(input())
p = list(map(int,input().split()))
ans = 0
for j in range(n-2):
if p[j] < p[j+1] < p[j+2] or p[j+2] < p[j+1] < p[j]:
ans += 1
print(ans) |
p03109 | s128813967 | Accepted | s = input().split('/')
if int(s[0]) >= 2020:
print('TBD')
elif int(s[0]) == 2019 and int(s[1]) >= 5:
print('TBD')
else:
print('Heisei') |
p03012 | s930475103 | Wrong Answer | n = int(input())
W = list(map(int,input().split()))
ans = sum(W)
for t in range(1,100):
x = 0
y = 0
for w in W:
if w<=t:
x+=w
else:
y+=w
ans = min(ans,abs(x-y))
print(ans) |
p03086 | s975127443 | Accepted | import re
print(len(max("".join(re.sub(r"[^ATCG]", " ", input())).split(" "), key=lambda x: len(x)))) |
p03407 | s487167666 | Wrong Answer | from numpy import *;i=int32;q=searchsorted;n,*x=map(int,open(0).read().split());A,B,c=i(x[:n]),i(x[n:]),0;
for k in range(1,30):
a,b=sort(hstack((A%(1<<k),A%(1<<k)-2**k))),B%(1<<k);c+=(sum(q(a,2**k-b)-q(a,2**(k-1)-b)))%2<<k-1
print(c)
|
p02546 | s118599423 | Accepted | s = input()
if s[len(s)-1] == 's':
print(s+'es')
else:
print(s+'s')
|
p02982 | s493650643 | Wrong Answer | import math
n,d=map(int,input().split())
l=[]
ans=0
cnt=0
for i in range(n):
l.append(list(map(int,input().split())))
for i in range (n-1):
for j in range(d):
ans+=((l[i][j])-(l[i+1][j]))**2
if float.is_integer(math.sqrt(ans))==True:
cnt+=1
print(cnt)
|
p02640 | s318703842 | Accepted | x,y=map(int,input().split())
tei=x*2
kou=x*4
if y%2==0 and tei<=y and kou>=y:
print("Yes")
else:
print("No") |
p03109 | s708408109 | Wrong Answer | S = input()
if S[5:7] == "12>=5":
print("TBD")
else:
print("Heisei") |
p02836 | s279531251 | Wrong Answer | s = input()
ans=0
for i in range(len(s)//2):
if s[i] != s[-i]:
ans+=1
print(ans) |
p02719 | s092887580 | Accepted | #
import sys
input=sys.stdin.readline
def main():
N,K=map(int,input().split())
print(min(N%K, abs(K-N%K)))
if __name__=="__main__":
main()
|
p03456 | s612714792 | Wrong Answer | a, b = input().split()
ab = int(a + b)
for i in range(1, 150):
if i**2 == ab:
print("Yes")
break
else:
print("No") |
p02910 | s232159567 | Wrong Answer | S = input()
# L = len(S) % 2
youtube = 0
ようつべ = 0
for i in range(len(S)):
if i % 2 == 0:
if S[i] == "L" or S[i] == "U" or S[i] == "D":
youtube += 1
else:
ようつべ += 1
# if S[2] % 2 == 0:
if youtube == 1:
print("Yes")
elif ようつべ == 1:
print("No") |
p02862 | s588202536 | Wrong Answer | x,y = map(int,input().split())
mod = 10**9+7
s = 0
if x<0 or y<0:
print(s)
exit()
mx = 10**6
fact = [1]*(mx+1)
for i in range(mx):
fact[i+1] = fact[i]*(i+1)%mod
def inv(n):
return pow(n,mod-2,mod)
if (x%3==0 and y%3==0) or (x%3==1 and y%3==2) or (x%3==2 and y%3==1):
n = int(2*x/3-y/3)
m = int(-x/3 + 2*y/3)
... |
p03493 | s036508216 | Accepted | import sys
from itertools import combinations
import math
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int, sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())
a = S()
ans = 0
for i i... |
p03221 | s627629613 | Accepted | # solution
nim,mike=map(int,input().split())
array=[]
for i in range(mike):
p,y=map(int,input().split())
array.append([i,p,y])
PY_sort=sorted(array,key=lambda x: x[2])
k=list(range(1,10**5+1))
v=[0]*10**5
cnt_dict=dict(zip(k,v))
arr=[]
for i,j,k in PY_sort:
cnt_dict[j]+=1
arr.append([i,str(j).z... |
p02571 | s330092217 | Accepted | S = input()
T = input()
ans = len(T)
n1 = len(S)-len(T)+1
for i in range(n1):
ans2 = 0
for k in range(len(T)):
# print(S[k+i],T[k])
if S[k+i] != T[k]:
ans2 += 1
ans = min([ans,ans2])
# print(ans)
print(ans) |
p03804 | s197089499 | Accepted | n, m = map(int, input().split())
aaa = [input() for _ in range(n)]
bbb = [input() for _ in range(m)]
ans = False
for i in range(n - m + 1):
for j in range(n - m + 1):
flag = True
for k in range(m):
for l in range(m):
if aaa[i + k][j + l] != bbb[k][l]:
... |
p03000 | s939597489 | Accepted | N,X = map(int,input().split())
L = list(map(int,input().split()))
ans = 1
for i in range(N):
if sum(L[:i+1]) <= X:
ans += 1
else:
break
print(ans) |
p03493 | s924000811 | Accepted | s = list(input())
print(s.count('1')) |
p02596 | s844157806 | Wrong Answer | k = int(input())
answer = -1
cou = 7
for i in range(k+1):
if cou%k == 0:
answer = cou
else:
cou*10 + 7
print(answer) |
p03705 | s440203934 | Accepted | n,a,b=map(int,input().split())
if a>b:
print(0)
exit()
if n==1:
if a!=b:
print(0)
exit()
if n==1 and a==b:
print(1)
exit()
print((n-2)*(b-a)+1)
|
p03774 | s223443536 | Wrong Answer | N, M = map(int,input().split())
students = []
points = []
for _ in range(N):
students.append(list(map(int,input().split())))
for _ in range(M):
points.append(list(map(int,input().split())))
for i in range(N):
MIN = 10 ** 8
index = -1
for j in range(M):
if MIN > abs(students[i][0] - points[j... |
p02687 | s255187105 | Wrong Answer | s=input()
if s == 'abc':
print('arc')
else:
print('abc') |
p03379 | s107289117 | Wrong Answer | N=int(input())
X=list(map(int,input().split()))
for i in range(N):
if i<N//2:
print(X[N//2])
else:
print(X[N//2-1]) |
p03696 | s307753582 | Accepted | import sys
from collections import *
import heapq
import math
import bisect
from itertools import permutations,accumulate,combinations,product
from fractions import gcd
def input():
return sys.stdin.readline()[:-1]
mod=10**9+7
n=int(input())
s=input()
i=0
leftcnt=0
rightcnt=0
for i in range(len(s)):
if s[i]=="... |
p03803 | s205933269 | Wrong Answer | a=input().split(' ')
A=int(a[0])
B=int(a[1])
if A>B:
print('Alice')
elif A==B:
print('Draw')
else:
print('Bob') |
p04034 | s706791389 | Accepted | n,m = list(map(int, input().split()))
box = [1] * (n+1)
redbox = [False] * (n+1)
redbox[1] = True
for _ in range(m):
x,y = list(map(int, input().split()))
box[x]-=1
box[y]+=1
if redbox[x]:
redbox[y] = True
if box[x]==0:
redbox[x] = False
# print(box)
# print(redbox)
print(su... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.