problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p02714 | s743033706 | Accepted | from collections import Counter
n=int(input())
s=list(input())
C=Counter(s)
r,g,b=C["R"],C["G"],C["B"]
ans=r*g*b
for i in range(n-2):
for j in range(i+1,n-1):
k=2*j-i
if k<=n-1 and s[i]!=s[j] and s[j]!=s[k] and s[k]!=s[i]:
ans-=1
print(ans) |
p03645 | s682384875 | Accepted | N, M = map(int, input().split())
AB = [list(map(int, input().split())) for _ in range(M)]
res = []
for a, b in AB:
if a == 1:
res.append(b)
if b == N:
res.append(a)
print('IMPOSSIBLE' if len(res) == len(set(res)) else 'POSSIBLE')
|
p03699 | s243021965 | Accepted | n=int(input())
s=[int(input())for _ in range(n)]
ans=sum(s)
x=[]
for i in range(n):
if s[i]%10 != 0:
x.append(s[i])
if ans%10 != 0:
print(ans)
elif len(x)>=1:
print(ans-min(x))
else:
print(0) |
p02629 | s377846436 | Wrong Answer | n = int(input())
ans = ""
while n > 0:
n -= 1
ans += chr(ord('a') + n % 26)
n //= 26
print(n)
print(ans[::-1]) |
p02814 | s577042309 | Accepted | import fractions
from functools import reduce
def lcm1(x,y):
return (x*y)//fractions.gcd(x,y)
def lcm2(*numbers):
return reduce(lcm1,numbers,1)
n,m = map(int,input().split())
a = set(map(lambda x: int(x)//2,input().split()))
l = lcm2(*a)
for i in a:
if l // i % 2 == 0:
print(0)
exit()
print(... |
p02748 | s942735811 | Accepted | A,B,M = map(int,input().split())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
data = [0] * M
for i in range(M):
x,y,c = map(int,input().split())
x-=1
y-=1
data[i] = [x,y,c]
can = []
can.append(min(a)+min(b))
for i in range(M):
can.append(a[data[i][0]]+b[data[i][1]]-data[... |
p02629 | s538013057 | Accepted | n = int(input())
s = "abcdefghijklmnopqrstuvwxyz"
l = [26]
for i in range(2, 14):
a = 26 ** (i) + l[i-2]
l.append(a)
idx = 0
while True:
if n <= l[idx]:
break
idx += 1
if idx == 0:
print(s[n-1])
exit()
q = n - l[idx-1] - 1
ll = []
for j in range(idx+1):
q, mod = divmod(q, 26)
... |
p02953 | s199963269 | Accepted | #136c
N = int(input())
H_list = [int(e) for e in input().split()]
H_list[0] -= 1 #最初の奴は減らしても影響なし。
for i in range(1,N):
#print(H_list)
#print(H_list[i-1],H_list[i])
if H_list[i-1] < H_list[i]:
H_list[i] -= 1
if H_list[i-1] > H_list[i]:
print("No")
break
else:
print... |
p03042 | s908996412 | Accepted | s=input()
a=(int(s[0])-0)*10+int(s[1])
b=(int(s[2])-0)*10+int(s[3])
if 1<=b<=12 and (12<a or a==0):
print("YYMM")
elif 1<=a<=12 and (12<b or b==0):
print("MMYY")
elif 1<=a<=12 and 1<=b<=12:
print("AMBIGUOUS")
else:
print("NA")
|
p02835 | s994809704 | Accepted | A1, A2, A3 = [int(_) for _ in input().split()]
if A1+A2+A3 >= 22:
print("bust")
if A1+A2+A3 <= 21:
print("win")
|
p03062 | s181851597 | Accepted | n=int(input())
a=list(map(int,input().split()))
s=0
for i in range(n):
if a[i]<0:
s+=1
a[i]*=-1
if s%2==0:
print(sum(a))
else:
a.sort()
print(sum(a)-2*a[0]) |
p02888 | s467272988 | Accepted | n = int(input())
a_ls = list(map(int, input().split()))
def isOK(a,b,c):
return abs(a-b) < c < a+b
a_ls.sort()
ans = 0
for i in range(n):
short = a_ls[i]
r = i+1
num = 0
for l in range(i+1,n-1):
while r+1 < n and isOK(short, a_ls[l], a_ls[r+1]):
r += 1
num += r - l
... |
p02989 | s917320324 | Accepted | n = int(input())
d = list(map(int, input().split()))
d.sort()
a = d[n // 2 - 1]
b = d[n // 2]
print(b - a) |
p02768 | s475834629 | Wrong Answer | from operator import mul
from functools import reduce
def cmb(n,r):
r = min(n-r,r)
if r == 0: return 1
over = reduce(mul, range(n, n - r, -1))
under = reduce(mul, range(1,r + 1))
return over // under
n,a,b = map(int, input().split())
Ca = cmb(n, a)
Cb = cmb(n, a)
r = (2**n - Ca - Cb) % (10**9 + 7)... |
p03944 | s310297094 | Wrong Answer | import numpy as np
W,H,N=map(int,input().split())
A=np.zeros((W,H))
B=[list(map(int,input().split())) for _ in range(N)]
print(B)
for b in B:
if b[2]==1:
A[:b[0],:]=1
elif b[2]==2:
A[b[0]:,:]=1
elif b[2]==3:
A[:,:b[1]]=1
elif b[2]==4:
A[:,b[1]:]=1
print(A)
print(np.co... |
p02790 | s633578321 | Wrong Answer | a,b = input().split()
print(a,b)
inta = int(a)
intb = int(b)
A = a * intb
B = b * inta
list = []
list.append(A)
list.append(B)
list.sort()
print(list[0])
|
p02664 | s586139811 | Accepted | #-*-coding:utf-8-*-
import sys
def main():
strings = input()
replace_string=strings.replace('?','D')
print(replace_string)
if __name__ == "__main__":
main() |
p02866 | s676338050 | Wrong Answer | n=int(input())
d=list(map(int,input().split()))
ans=1
mod=998244353
pre=0
c=[0]*n
for dd in d:
c[dd]+=1
max_i=0
for cc in c:
if cc>0:
max_i+=1
for i in range(max_i):
if i==0:
if c[i]==1:
pre=c[i]
continue
else:
ans=0
break
if c[i]!=0:
ans*=pre**c[i]
pre=c[i]
ans%=... |
p02690 | s009821915 | Wrong Answer | x = int(input())
d = [[0 for i in range(110)] for j in range(110)]
e = [[0 for i in range(110)] for j in range(110)]
for i in range(110):
d[0][i] = i**5
d[i][0] = i**5
for i in range(1,110):
for j in range(1,110):
d[i][j] = d[0][j]-d[i][0]
e[i][j] = d[0][j]+d[i][0]
for m in range(110):
i... |
p03479 | s032712485 | Accepted | import math
X, Y = list(map(int, input().split()))
val = X
cnt = 1
while val <= Y:
val *= 2
cnt += 1
print(cnt - 1)
|
p03623 | s700744157 | Accepted | def main():
x, a, b = map(int, input().split())
if abs(x-a) < abs(x-b):
ans = 'A'
else:
ans = 'B'
print(ans)
if __name__ == "__main__":
main()
|
p02677 | s442581511 | Accepted | import math
def main():
A,B,H,M = map(int, input().split())
H_DO=(H*60+M)*360/(12*60)
M_DO=M*6
if(H_DO>M_DO):
sabu=H_DO-M_DO
elif(H_DO<M_DO):
sabu=M_DO-H_DO
else:
sabu=0
L=(A*A)+(B*B)-2*A*B*math.cos(math.radians(sabu))
C=math.sqrt(L)
print(C)
if __name__ == '__main__':
main() |
p03623 | s247907384 | Wrong Answer | import sys
S = list(input())
s = list(set(S))
s.sort()
alfa = list('abcdefghijklmnopqrstuvwxyg')
ans = 0
if(len(s)==len(alfa)):
print('None')
sys.exit()
else:
for i in range(len(s)):
if(s[i]!=alfa[i]):
print(alfa[i])
sys.exit()
print(alfa[len(s)+1]) |
p03495 | s109139556 | Wrong Answer | from collections import Counter
def main():
n, k = map(int, input().split())
a = tuple(map(int, input().split()))
col = max(0, len(set(a)) - k)
ac = Counter(a)
acl = ac.most_common()[::-1]
acll = [ace[1] for ace in acl[:col]]
r = sum(acll)
print(r) |
p03804 | s091541749 | Accepted | n, m = map(int, input().split())
a = [list(input()) for _ in range(n)]
b = [list(input()) for _ in range(m)]
def c(a, m, x, y):
tmp = []
for i in range(m):
tmp.append(a[y+i][x:x+m])
return tmp
for x in range(n - m + 1):
for y in range(n - m + 1):
if c(a, m, x, y) == b:
print("Yes")
exit(0)... |
p03062 | s077574923 | Wrong Answer | N = int(input())
An = list(map(int, input().split()))
An = [abs(a) for a in An]
if N % 2 == 0:
print(sum(An))
else:
print(sum(An) - 2*min(An)) |
p03062 | s229894523 | Wrong Answer | n=int(input())
l=list(map(int,input().split()))
d=l.copy()
ans=-float("INF")
for i in range(1,n-1):
if 0>=d[i]+d[i+1]:
if d[i]<0:
d[i]*=-1
d[i+1]*=-1
ans=max(ans,sum(d))
l[0]*=-1
l[1]*=-1
for i in range(1,n-1):
if 0>=l[i]+l[i+1]:
if l[i]<0:
l[i]*=-1
... |
p02900 | s774101939 | Accepted | def primes(n):
i = 2
prime = []
while i**2<= n:
if n % i:
i += 1
else:
n =n//i
prime.append(i)
if n > 1:
prime.append(n)
return prime
a,b=map(int,input().split())
pa=set(primes(a))
pb=set(primes(b))
inte=pa.intersection(pb)
print(len(inte)+... |
p02939 | s435900772 | Wrong Answer | s=input()
count=1
ps=s[0]
i=1
while i<len(s):
if s[i]!=ps:
count+=1
ps=s[i]
i+=1
elif i==len(s)-1:
break
else:
count+=1
ps=s[i:i+2]
i+=2
print(ps)
print(count) |
p03239 | s213096229 | Accepted | n, T = map(int, input().split())
minc = 1001
for i in range(n):
c, t = map(int, input().split())
if t <= T:
minc = min(minc, c)
if minc == 1001:
print("TLE")
else:
print(minc) |
p03208 | s225764830 | Wrong Answer | n,k = map(int,input().split())
h = []
for i in range(n):
h.append(int(input()))
h.sort()
min_number = 10**9+1
for i,j in zip(h[0:k],h[k-1:]):
min_number = min(min_number,j-i)
print(min_number)
|
p03161 | s492810788 | Wrong Answer | N,K=map(int,input().split())
H=list(map(int,input().split()))
cost =20000
DP=[0]*(N+10)
DP[0]=0
DP[1]=abs(H[1]-H[0])
for i in range(2,N):
cost=20000
for k in range(max(i-K,0),i):
cost=min(cost,(abs(H[i]-H[k])+DP[k]))
DP[i]=cost
print(DP[N-1]) |
p03814 | s750951232 | Accepted | s=input()
b=s.index("A")
a=[i for i, x in enumerate(s) if x == 'Z']
print(a[-1]-b+1) |
p02880 | s673055529 | Wrong Answer | N=int(input())
A=str()
for i in (1,9):
if N%i==0 and N/i<=9:
A=("Yes")
break
else:
A=("No")
print(A) |
p03472 | s889423117 | Wrong Answer | from math import ceil
n, h = map(int, input().split())
a, b = [0]*n, [0]*n
for i in range(n):
aa, bb = map(int, input().split())
a[i], b[i] = aa, bb
a_max = max(a)
b_thr = []
for i in b:
if i > a_max:
b_thr.append(i)
ans = 0
for i in b_thr:
if h > 0:
h -= i
ans += 1
else:
... |
p03720 | s436056526 | Accepted | from collections import defaultdict
n, m = map(int, input().split())
d = defaultdict(int)
for _ in range(m):
a, b = input().split()
d[a] += 1
d[b] += 1
for i in range(n):
print(d[str(i + 1)])
|
p03417 | s153065800 | Accepted | N,M = map(int,input().split())
if N == 1 and M == 1:
print(1)
elif N == 1 or M == 1:
print(max(N,M)-2)
else:
print((N-2)*(M-2))
|
p03386 | s948809192 | Wrong Answer |
a,b,k = map(int,input().split())
c = []
if 2*k >= b+a+1:
for i in range(a,b+1):
print(i)
else:
for i in range(a,a+k):
print(i)
for j in range(b-k+1,b+1):
print(j) |
p02714 | s384954190 | Accepted | n=int(input())
s=input()
L=len(s)
ans=0
r=s.count('R')
b=s.count('B')
g=s.count('G')
for i in range(L-2):
for j in range(i+1,L-1):
if s[j]!=s[i]:
if j+j-i<=L-1:
if s[j+j-i]!=s[i] and s[j+j-i]!=s[j]:
ans+=1
print(r*b*g-ans) |
p02755 | s276643969 | Accepted | from math import floor, ceil
A, B = [int(x) for x in input().split(" ")]
min_origin_a = ceil(A*12.5) # contains
max_origin_a = ceil((A+1)*12.5) # not contains
flag = False
for i in range(min_origin_a, max_origin_a):
if floor(0.1*i) == B:
print(i)
flag = True
break
if not flag:
... |
p03605 | s663985015 | Wrong Answer | n = input()
if n in "9":
print("Yes")
else:
print("No") |
p02640 | s768083179 | Accepted | X,Y=map(int,input().split())
A=4*X-Y
B=(-2)*X+Y
if A%2==0 and B%2==0 and A>=0 and B>=0:
print("Yes")
else:
print("No") |
p03624 | s228337368 | Accepted | ALPHABET = ["a", "b", "c", "d", "e", "f", "g", "h",
"i", "j", "k", "l", "m", "n", "o", "p",
"q", "r", "s", "t", "u", "v", "w", "x", "y", "z"]
s = input()
for i in range(26):
if s.count(ALPHABET[i]) == 0:
print(ALPHABET[i])
break
else:
print("None")
|
p03474 | s108719617 | Wrong Answer | # -*- coding: utf-8 -*-
A, B = map(int, input().split())
S = input()
if A<1 or B<1:
print("No")
elif len(S)!=(A+B+1):
print("No")
elif S[A]!="-":
print("No")
else:
s = S.replace("-", "")
if s.isdigit():
print("Yes")
else:
print("No")
|
p03679 | s480217035 | Accepted | x, a, b = map(int, input().split())
if a >= b:
print("delicious")
elif x + 1 > abs(a - b):
print("safe")
else:
print("dangerous") |
p02911 | s608700134 | Accepted | N, K, Q = map(int, input().split())
ans = [0]*(N+1)
for i in range(Q):
ans[int(input())] += 1
sum_ans = sum(ans)
for i in range(1,N+1):
print('Yes' if K-(sum_ans-ans[i]) > 0 else 'No') |
p02583 | s581423891 | Wrong Answer | n=int(input())
boulist=list(map(int,input().split()))
boulist.sort(reverse=True)
print(boulist)
count=0
for i in range(n):
for j in range(i,n):
for k in range(j,n):
if boulist[j] != boulist[k] and boulist[i] != boulist[j] and boulist[i]+boulist[j]>boulist[k]:
count+=1
print(count)
|
p02922 | s909603698 | Accepted | A, B = map(int, input().split())
ans = (B - A) // (A - 1) + 1
print(ans + 1 if (B - A) % (A - 1) else ans) |
p02713 | s687691118 | Accepted | from math import gcd
import sys
#import numpy as np
sys.setrecursionlimit(10 ** 9)
K = int(input())
ans = 0
for i in range(1,K+1):
for j in range(1,K+1):
tmp = gcd(i,j)
for k in range(1,K+1):
ans += gcd(tmp, k)
print(ans) |
p02993 | s471474058 | Wrong Answer | s = input()
res = "Good"
for i in range(1,len(s),1):
if s[i-1] == s[i]:
res = "BAD"
print(res) |
p03221 | s799803509 | Accepted | import collections
import bisect
n, m = map(int, input().split())
s = [[int(_) for _ in input().split() ] for _ in range(m)]
a = collections.defaultdict(list)
for x,y in sorted(s):
a[x]+=[y]
for x,y in s:
z = bisect.bisect(a[x],y)
print("%06d%06d"%(x,z))
|
p03030 | s840694762 | Accepted | n = int(input())
map_list = [[0,'abc',0] for i in range(n)]
for i in range(n):
input_line = input().split()
map_list[i]=[i,input_line[0],int(input_line[1])]
ans_li = sorted(map_list,key=lambda x:(x[1],-x[2]))
for ans in ans_li:
print(ans[0]+1)
|
p02833 | s247055257 | Wrong Answer | def q_e():
n = int(input())
if n % 2 == 1:
print(0)
return
n = int(n/2)
cc = 0
x = 1
x *= 5
while n >= x:
b = n % x
a = int((n - b) / x)
cc += a
x *= 5
print(cc)
if __name__ == '__main__':
q_e() |
p02793 | s276724524 | Wrong Answer | import sys
N = int(input().split()[0])
a = [int(i) for i in input().split()]
print(N, a)
def lcm(a, b):
x = a * b
if a < b:
tmp = a
a = b
b = tmp
r = a % b
while r != 0:
a = b
b = r
r = a % b
return x / b
l = a[0]
for i in range(1, N):
l = lcm(l,... |
p03759 | s174739459 | Accepted | a,b,c=map(int,input().split())
if(b-a)==(c-b):
print("YES")
else:
print("NO") |
p03163 | s063432410 | Accepted | n, k = map(int, input().split())
W, V = [0], [0]
for _ in range(n):
w, v = map(int, input().split())
W.append(w)
V.append(v)
dp = [[0]*(k+1) for _ in range(n+1)]
for i in range(1, n+1):
for w in range(1, k+1):
if w - W[i] >= 0:
dp[i][w] = max(dp[i-1][w], dp[i-1][w-W[i]] + V[i])
... |
p02730 | s570297846 | Accepted | s=raw_input()
flag=0
s1=s[::-1]
# print s1
if s1!=s:
print "No"
exit(0)
s1=s[0:(len(s)-1)/2]
s2=s1[::-1]
# print s1
if s1!=s2:
print "No"
exit(0)
print "Yes" |
p02682 | s806690067 | Accepted | def main():
A, B, C, K = map(int, input().split())
if A > K:
return print(K)
if A + B >= K:
return print(A)
else:
C = K - A - B
return print(A-C)
if __name__ == '__main__':
main()
|
p03324 | s890845148 | Accepted | d,n = map(int,input().split())
if n == 100:
print(101*(100**d))
else:
print(n*(100**d)) |
p03001 | s891952305 | Accepted | a, b, x, y = map(int, input().split())
ans = 0
if x + x == a and y + y == b:
ans = 1
else:
ans = 0
print(a * b / 2, ans)
|
p03286 | s024254230 | Accepted | #coding: utf-8
import math
import heapq
import bisect
import numpy as np
from collections import Counter
#from scipy.misc import comb
N = int(input())
ans = ""
while N:
ans = str(N&1)+ans
N = -(N>>1)
print(ans if ans else 0) |
p02775 | s409867139 | Wrong Answer | ans = 0
for s in reversed(input()):
n = int(s)
if n < 6:
ans += n
ans += n % 10
nxt = False
else:
ans += (10 - n) + 1
print(ans) |
p03657 | s733384550 | Accepted | a, b = map(int,input().split())
if a % 3 == 0:
print('Possible')
elif b % 3 == 0:
print('Possible')
elif (a + b) % 3 == 0:
print('Possible')
else:
print('Impossible') |
p02754 | s159242357 | Wrong Answer | # coding: utf-8
N, A, B = map(int, input().split())
if A == 0 or N == 0:
print(0)
else:
num = int(N / (A + B)) * A
#print("num:", num)
num += N % (A + B)
# print("num:", num)
print(num) |
p03617 | s054288268 | Accepted | q,h,s,d = map(int,input().split())
n = int(input())
h = min(q*2,h)
s = min(h*2,s)
if 2*s <= d:
print(n*s)
else:
print(n//2*d+(n%2)*s)
|
p02553 | s410333458 | Wrong Answer | a,b,c,d=map(int, input().split())
x=a if abs(a)>abs(b) else b
y=c if abs(c)>abs(d) else d
if ( (x>0 and y>0) or (x<0 and y<0) ):
print (x*y)
else :
x=a if abs(a)<abs(b) else b
y=c if abs(c)<abs(d) else d
print (x*y) |
p03711 | s465772294 | Accepted | import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
S = [set()] * 3
S[0] = {1, 3, 5, 7, 8, 10, 12}
S[1] = {4, 6, 9, 11}
S[2] = {2}
x, y = map(int, readline().split())
ans = '... |
p02772 | s036615054 | Accepted | N = int(input())
A = list(map(int, input().split()))
for i in range(N):
if (A[i] % 2 == 0 and A[i] % 3 != 0 and A[i] % 5 != 0):
print('DENIED')
exit(0)
print('APPROVED') |
p03243 | s997200184 | Wrong Answer | n = str(input())
memo = int( n[0] + n[0] + n[0] )
if int(n) < memo:
print(memo)
else:
print(memo + 111) |
p03543 | s718733137 | Wrong Answer | def main():
a=input()
b=set(a)
if(len(b)<=2):
if(a.count(b.pop())==2):
print('No')
else:
print('Yes')
else:
print('No')
main()
|
p02996 | s469921622 | Wrong Answer | import heapq
n = int(raw_input())
heap = [map(int, raw_input().split(' '))[::-1] for _ in range(n)]
heapq.heapify(heap)
def f(heap):
t = 0
while(heap):
nd,ct = heapq.heappop(heap)
gap = nd - t
while(heap and heap[0][0] == nd):
u,v = heapq.heappop(heap)
t += v
gap -= v
if gap < 0: return False
r... |
p03611 | s624357437 | Accepted | from collections import Counter as C
n=int(input())
a=list(map(int,input().split()))
a.sort()
aset=list(set(a))
ca = C(a)
ans=0
for i in aset:
if ans<ca[i-1]+ca[i]+ca[i+1]:
ans=ca[i-1]+ca[i]+ca[i+1]
print(ans) |
p03556 | s317769060 | Accepted | import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
import math
import collections
n = int(input())
print(int(n**0.5)**2) |
p02639 | s817824168 | Accepted | x=[-1]+list(map(int,input().split()))
print(x.index(0)) |
p02641 | s920472242 | Accepted | x,n = map(int,input().split())
p = list(map(int,input().split()))
ans = float("inf")
for i in range(-101,201):
if i not in p:
ans = min(ans,abs(x-i))
if x - ans not in p:
print(x-ans)
else:
print(x+ans) |
p03377 | s653356685 | Accepted | import itertools
import math
import sys
import heapq
from collections import Counter
from collections import deque
from fractions import gcd
INF = 1 << 60
sys.setrecursionlimit(10 ** 6)
#ここから書き始める
a, b, x = map(int, input().split())
if a <= x <= a + b:
print("YES")
else:
print("NO") |
p03962 | s283282250 | Accepted | a, b, c = map(int, input().split(" "))
if a == b and b == c:
print(1)
elif a== b or b == c or c == a:
print(2)
else:
print(3) |
p02700 | s683604915 | Wrong Answer | a,b,c,d=list(map(int,input().split()))
print("Yes" if c//b <= a//d else "No") |
p03854 | s591343695 | Accepted | S = input()
T = ['dream', 'dreamer', 'erase', 'eraser']
def reverse(t):
return t[::-1]
RT = [reverse(t) for t in T]
RS = reverse(S)
can = True
i = 0
while i < len(RS):
can2 = False
for j in range(4):
sizeT = len(RT[j])
if RT[j] == RS[i:i + sizeT]:
i += sizeT
can2 ... |
p03012 | s548173288 | Accepted | #入力:[n1,n2,...nk](int:整数配列)
def input_array():
return list(map(int,input().split()))
n=int(input())
W=input_array()
left=0
right=sum(W)
diff=right
for i in range(n):
left+=W[i]
right-=W[i]
diff_tmp=right-left
# print(diff,diff_tmp)
if abs(diff)<=abs(diff_tmp):
print(abs(diff))
break
else:
diff=diff_tm... |
p04005 | s818956502 | Accepted | import sys
readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)
def main():
l = list(map(int, readline().split()))
l.sort()
if any([x % 2 == 0 for x in l]):
print(0)
else:
s = l[0] * l[1]
print(s)
if __name__ == '__main__':
m... |
p03951 | s852078656 | Accepted | n = int(input())
s = input()
t = input()
res = s+t
kekka = n*2
import copy
for i in range(n):
tmp = list(res)
del tmp[n]
target = "".join(tmp)
if target[:n] == s and target[-n:] == t:
kekka = len(target)
#print(target)
res = copy.deepcopy(tmp)
print(kekka)
|
p02854 | s217399837 | Accepted | import sys
input = sys.stdin.readline
N=int(input())
A=list(map(int,input().split()))
total = sum(A)
total *= 2
mindif = 1e12
sub = 0
for i in range(N):
sub += 2 * A[i]
dif = abs(total//2-sub)
if dif < mindif:
mindif = dif
print(mindif)
|
p03719 | s805547006 | Accepted | a, b, c = map(int, input().split())
if a <= c <= b:
print("Yes")
else:
print("No") |
p03107 | s066058784 | Accepted | S=input()
zero=0
one=0
for i in range(len(S)):
if S[i]=='1':
one+=1
else:
zero+=1
print(min(zero,one)*2)
|
p03720 | s991629809 | Accepted | wlist = []
city, road = map(int, input().split())
for i in range(road):
wlist.append(list(map(int, input().split())))
dst = []
for i in range(city):
count = 0
for k in wlist:
if i+1 in k:
count += 1
dst.append(count)
for d in dst:
print(d)
|
p03696 | s991231023 | Accepted | input()
S = input()
left = right = 0
for c in S:
if c == "(":
left += 1
else:
if left:
left -= 1
else:
right += 1
print("(" * right + S + ")" * left)
|
p03556 | s175182795 | Accepted | import math
n=int(input())
x=0
for i in range(n):
if math.sqrt(n-i)%1==0.0:
break
else:
x+=1
print(n-x) |
p03254 | s073043984 | Accepted | n, a = map(int, input().split())
b = list(map(int, input().split()))
b.sort()
c = 0
for i in range(n):
if a < b[i] or (i == n - 1 and b[i] != a):
break
a -= b[i]
c += 1
print(c) |
p02744 | s450926272 | Accepted | def dfs(s, mx):
if len(s) == n:
print(s)
return
for i in range(ord('a'), mx + 2):
dfs(s + chr(i), max(mx, i))
n = int(input())
dfs('', ord('a') - 1)
|
p03030 | s633986602 | Accepted | from operator import itemgetter
N=int(input())
hako=[]
for i in range(N):
A,B=input().split()
hako.append([A,int(B)*-1])
kari=hako.copy()
#print(kari)
hako.sort()
hako=sorted(hako,key=itemgetter(0,1))
#print(hako)
for i in range(N):
print(kari.index(hako[i])+1) |
p02802 | s188304679 | Accepted | N,M = map(int,input().split())
AC = [0 for _ in range(N)]
WA = [0 for _ in range(N)]
for _ in range(M):
p,S = input().split()
p = int(p)-1
if not AC[p]:
if S == 'AC':
AC[p] = 1
else:
WA[p] += 1
else:
continue
WAcount = 0
for i in range(N):
if AC[i]:
... |
p03814 | s305164388 | Accepted | s = list(input())
a = [n for n,v in enumerate(s) if v == "A"]
z = [n for n,v in enumerate(s) if v == "Z"]
b = min(a)
y = max(z)
print(y-b+1)
|
p03799 | s931456144 | Wrong Answer | N, M = map(int, input().split())
total = N * 2 + M
ans = total // 4
if N > M // 2:
print(0)
else:
print(ans)
|
p02862 | s920740885 | Accepted | X, Y = map(int,input().split())
MOD = 10**9 + 7
def comb(n, r):
if n < r or n < 0 or r < 0:
return 0
n += 1
over = 1
under = 1
for i in range(1,r + 1):
over = over * (n - i) % MOD
under = under * i % MOD
return over * pow(under, MOD - 2, MOD) % MOD
if (X + Y) % 3 != 0:
... |
p03419 | s458585955 | Accepted | N, M = map(int, input().split())
if N == 1 and M == 1:
print(1)
elif N == 1:
print(M - 2)
elif M == 1:
print(N - 2)
else:
print(N * M - (N * 2 + M * 2 - 4)) |
p03774 | s613545163 | Accepted | # -*- coding: utf-8 -*-
N,M = list(map(int, input().rstrip().split()))
ab_list = [list(map(int, input().rstrip().split())) for i in range(N)]
cd_list = [list(map(int, input().rstrip().split())) for i in range(M)]
#-----
for a,b in ab_list:
dist = (10**8)*2*2 + 1
for i,[c,d] in enumerate(cd_list):
... |
p03486 | s433424823 | Accepted | s = input()
t = input()
S = ''.join(sorted(s))
T = ''.join(sorted(t, reverse=True))
if S<T:
print('Yes')
else:
print('No') |
p02548 | s858780854 | Accepted | n = int(input())
ans =0
for i in range(n-1):
ans += (n-1)//(i+1)
print(ans)
|
p02606 | s174340426 | Accepted | a,b,c=map(int,input().split())
d=0
for i in range(a,b+1):
if i%c==0:
d+=1
print(d) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.