problem_id
stringclasses 428
values | submission_id
stringlengths 10
10
| status
stringclasses 2
values | code
stringlengths 5
816
|
|---|---|---|---|
p03774
|
s593305351
|
Accepted
|
n, m = map(int, input().split())
a = [list(map(int, input().split())) for i in range(n)]
c = [list(map(int, input().split())) for i in range(m)]
for i in range(n):
dim, num = 10**10, -1
for j in range(m):
if abs(a[i][0] - c[j][0]) + abs(a[i][1] - c[j][1]) < dim:
dim = abs(a[i][0] - c[j][0]) + abs(a[i][1] - c[j][1])
num = j
print(num+1)
|
p03013
|
s639674954
|
Wrong Answer
|
import itertools,sys
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
N,M = LI()
a = set([I() for _ in range(M)])
dp = [0]*(N+1) #1_indexed
dp[0] = 1
dp[1] = 0 if 1 in a else 0
for i in range(2,N+1):
if i in a:
dp[i] = 0
continue
dp[i] = (dp[i-1]+dp[i-2])%(10**9+7)
print(dp[-1])
|
p02727
|
s177289630
|
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)
p = p[:x]
q = q[:y]
s = p+q+r
s.sort(reverse=True)
print(sum(s[:(x+y)]))
|
p03711
|
s143961020
|
Wrong Answer
|
x = input()
ls_x = x.split()
# print(ls_x)
for i in range(len(ls_x)):
ls_x[i] = int(ls_x[i])
gA = [1,3,5,7,8,10,12]
gB = [4,6,9,11]
if ls_x[0] == 2 or ls_x[1] == 2:
print("No")
if ls_x[0] == gA[i] and ls_x[1] == gA[i]:
print("Yes")
else:
print("No")
if ls_x[0] == gB[i] and ls_x[1] == gB[i]:
print("Yes")
else:
("No")
|
p02712
|
s003705964
|
Accepted
|
n = int(input())
ans = 0
for i in range(1,n+1):
if i%3!=0 and i%5!=0:
ans += i
else:
continue
print(ans)
|
p03657
|
s029661891
|
Wrong Answer
|
print(['P','Imp'][eval(input().replace(' ','+'))%3>0]+'ossible')
|
p03449
|
s288947138
|
Accepted
|
n = int(input())
a1 = list(map(int, input().split()))
a2 = list(map(int, input().split()))
mx = 0
for idx in range(n) :
list = a1[:idx+1] + a2[idx:]
mx = max(mx, sum(list))
print(mx)
|
p03665
|
s587833382
|
Wrong Answer
|
N,P = map(int,input().split())
A = list(map(int,input().split()))
odd = 0
for v in A:
if v % 2:
odd += 1
even = N-odd
print((2**even)*int(2**(odd-1)))
|
p02813
|
s410533772
|
Wrong Answer
|
N=int(input())
P= list(map(int, input().split()))
Q= list(map(int, input().split()))
dic=[]
Pn=0
Qn=0
import itertools
import numpy
l=numpy.arange(1,N+1,1,int)
for v in itertools.permutations(l, N):
dic.append(v)
for i in range(len(dic)):
if list(dic[i])==P:
Pn=i
elif list(dic[i])==Q:
Qn=i
elif Pn!=0 and Qn!=0:
break
print(abs(Pn-Qn))
|
p02771
|
s389872689
|
Accepted
|
a, b, c= input().split()
a, b, c= int(a), int(b), int(c)
if (a==b and c==b) or (a!=b and b!=c and c!=a):
print('No')
else:
print('Yes')
|
p02947
|
s313075606
|
Accepted
|
n = int(input())
s_lsit = {}
cnt = 0
for i in range(n):
s = list(input())
s.sort()
s = "".join(s)
if s in s_lsit:
cnt += s_lsit[s]
s_lsit[s] += 1
else:
s_lsit[s] = 1
print(cnt)
|
p02742
|
s746896330
|
Wrong Answer
|
import math
H, W = list(map(int, input().split()))
sum = float(H*W)
if sum%2 == 0:
print(H*W//2)
else:
print(math.floor(H*W/2)+1)
|
p02663
|
s380095325
|
Wrong Answer
|
h1,h2,m1,m2,k = map(int,input().split())
a = 60*h2 + m2
b = 60+h1 + m1
print(a-b-k)
|
p03075
|
s631008847
|
Accepted
|
l = []
for i in range(5):
l.append(int(input()))
k = int(input())
ok = True
for i in range(5):
for j in range(5):
if i == j: continue
diff = abs(l[i] - l[j])
if diff > k:
ok = False
if ok: print('Yay!')
else: print(':(')
|
p03625
|
s032734677
|
Accepted
|
from collections import Counter
N=int(input())
A=list(map(int, input().split()))
C=Counter(A)
L=[]
R=[]
for i in C:
l=C.get(i)
if l>=2:
L.append(i)
if l>=4:
R.append(i)
L.sort()
R.sort()
ans=0
if len(L)>=2:
ans=max(L[-1]*L[-2], ans)
if len(R)>=1:
ans=max(R[-1]**2, ans)
print(ans)
|
p03438
|
s578830409
|
Wrong Answer
|
N=int(input())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
d=[]
for i in range(N):
d.append(a[i]-b[i])
cnt=-sum(d)
p=0
n=0
for j in range(N):
if d[j]>0:
p+=d[j]
if d[j]<0:
n+=-d[j]/2
if p<=cnt and n<=cnt:
print("Yes")
else:
print("No")
|
p02546
|
s552738512
|
Wrong Answer
|
#!python3.8
# -*- coding: utf-8 -*-
# abc179/abc179_b
import sys
s2nn = lambda s: [int(c) for c in s.split(' ')]
ss2nn = lambda ss: [int(s) for s in list(ss)]
ss2nnn = lambda ss: [s2nn(s) for s in list(ss)]
i2s = lambda: sys.stdin.readline().rstrip()
i2n = lambda: int(i2s())
i2nn = lambda: s2nn(i2s())
ii2ss = lambda n: [i2s() for _ in range(n)]
ii2nn = lambda n: ss2nn(ii2ss(n))
ii2nnn = lambda n: ss2nnn(ii2ss(n))
def main():
return
main()
|
p02813
|
s843461929
|
Accepted
|
import itertools
n = int(input())
sp = str(list(map(int,input().split())))
sq = str(list(map(int,input().split())))
d = [i+1 for i in range(n)]
p = list(itertools.permutations(d))
order_dict = {}
for i in range(len(p)):
order_dict[str(p[i])] = i
sp_str = sp.replace('[', '(').replace(']',')')
sq_str = sq.replace('[', '(').replace(']',')')
print(abs(order_dict[sq_str] - order_dict[sp_str]))
|
p03071
|
s695486928
|
Wrong Answer
|
a, b = map(int, input().split())
if a == b:
print(a + b)
else:
print(max(a, b) * 2 + 1)
|
p02847
|
s802307926
|
Accepted
|
S=input()
if S=='SUN':
print(7)
elif S=='MON':
print(6)
elif S=='TUE':
print(5)
elif S=='WED':
print(4)
elif S=='THU':
print(3)
elif S=='FRI':
print(2)
elif S=='SAT':
print(1)
|
p02820
|
s732944193
|
Accepted
|
n, k = map(int, input().split())
r, s, p = map(int, input().split())
t = list(input())
l = [0] * n
for i in range(n):
if t[i] == 'r':
l[i] = p
elif t[i] == 's':
l[i] = r
else:
l[i] =s
ans = sum(l)
for i in range(k, n):
if t[i] == t[i - k]:
ans -= l[i]
t[i] = 'o'
print(ans)
|
p02681
|
s545498824
|
Accepted
|
s = input()
t = input()
if s == t[:-1]:
print("Yes")
else:
print("No")
|
p04019
|
s875825842
|
Wrong Answer
|
s = input()
if 'N' in s and 'W' in s and 'S' in s and 'E' in s:
print('Yes')
elif 'N' in s and 'W' in s and 'S' not in s and 'E' not in s:
print('Yes')
elif 'N' not in s and 'W' not in s and 'S' in s and 'E' in s:
print('Yes')
else:
print('No')
|
p02555
|
s138152046
|
Accepted
|
n = int(input())
MOD = 1000000007
s = [0]*2020
s[0]=1
s[1]=0
s[2]=0
for i in range(3,n+1,1):
s[i] = (s[i] + sum(s[:(i-2)])) % MOD
print(s[n])
|
p02797
|
s477544574
|
Accepted
|
n, k, s = map(int, input().split())
ans = [s for _ in range(k)]
if s == 10**9:
ans += [1 for _ in range(n - k)]
else:
ans += [s+1 for _ in range(n - k)]
print(*ans)
|
p02970
|
s606848434
|
Accepted
|
import math
n, d = map(int, input().split())
print(math.ceil(n/(d*2+1)))
|
p03286
|
s142703942
|
Wrong Answer
|
n=int(input())
ans=""
while n!=0:
if (n%2)!=0:
n-=1
ans="1"+ans
else:
ans="1"+ans
n/=-2
if ans=="":
ans="0"
print(ans)
|
p02861
|
s630962864
|
Wrong Answer
|
n = int(input())
l = []
cnt = 1
for i in range(1, n):
cnt *= i
print(i)
|
p02948
|
s659909965
|
Wrong Answer
|
import sys
def LI(): return list(map(int,sys.stdin.readline().rstrip().split())) #空白あり
def S(): return sys.stdin.readline().rstrip()
N,M = map(int,S().split())
AB = [tuple(LI()) for i in range(N)]
from operator import itemgetter
AB = sorted(AB,key = itemgetter(1,0),reverse=True)
ANS = []
# 価値が大きく、報酬までの時間が長いものから貪欲に
r = M
for i in range(N):
a,b = AB[i]
if a <= r:
ANS.append(b)
r -= 1
print(sum(ANS))
|
p02732
|
s066793907
|
Accepted
|
import copy
from collections import Counter
l = ['a', 'a', 'a', 'a', 'b', 'c', 'c']
c = Counter
def nC2(n):
if n < 2:
return 0
else:
return n*(n-1)//2
n = int(input())
A = list(map(int, input().split()))
count = 0
C = Counter(A)
for num in C.values():
count += num*(num-1)//2
#print(count)
for a in A:
print(count - (C[a] - 1))
|
p02657
|
s501155135
|
Accepted
|
a,b = map(int,input().split())
print(a * b)
|
p02687
|
s282286538
|
Wrong Answer
|
print('A%sC'%'BR'[id(id)%9%2])
|
p02792
|
s610162979
|
Wrong Answer
|
import sys
if sys.platform =='ios':
sys.stdin=open('input_file.txt')
N=int(input())
cnt=0
for i in range(1,N):
for j in range(1,N):
if str(i)[0]==str(j)[-1] and str(i)[-1]==str(j)[0]:
cnt+=1
print(cnt)
|
p03319
|
s418464366
|
Wrong Answer
|
import math
n, k = map(int, input().split())
A = list(map(int, input().split()))
print(math.ceil((n-k)/k+1))
|
p03437
|
s776973847
|
Accepted
|
x,y = map(int,input().split())
if x % y == 0:
print(-1)
else:
print(x)
|
p03145
|
s094080024
|
Accepted
|
a, b, c = map(int, input().split())
print(int(a*b/2))
|
p02719
|
s400678492
|
Wrong Answer
|
n, k = map(int,input().split())
ans = 0
if n < k:
ans = n
else:
ans = min(n%k,k-n%k)
print(ans)
|
p03720
|
s370002080
|
Wrong Answer
|
n,m=map(int,input().split())
A=[0]*n
print(A)
for i in range(m):
a,b=map(int,input().split())
A[a-1] += 1
A[b-1] += 1
for h in range(n):
print(A[h])
|
p03817
|
s561324467
|
Accepted
|
def I(): return int(input())
x = I()
div,mod = divmod(x,11)
print(div*2+(0 if mod==0 else 1 if mod<=6 else 2))
|
p02597
|
s627221530
|
Accepted
|
n = int(input())
c = input()
print(c[:c.count('R')].count('W'))
|
p03328
|
s459167255
|
Accepted
|
from itertools import accumulate
import sys
a,b=map(int,input().split())
n = 500000
l=[]
for i in range(n):
l.append(i)
tmp = sum(l)
if abs(abs(a+tmp) - abs(b+tmp)) == i:
print(tmp -b)
sys.exit()
|
p02727
|
s527458760
|
Accepted
|
X, Y, A, B, C = map(int, input().split())
P = sorted(list(map(int, input().split())), reverse=True)[:X]
Q = sorted(list(map(int, input().split())), reverse=True)[:Y]
R = sorted(list(map(int, input().split())), reverse=True)
print(sum(sorted(P+Q+R, reverse=True)[:X+Y]))
|
p03043
|
s840980124
|
Wrong Answer
|
import math
n,k = map(int,input().split())
ans = 0
for i in range(1,n+1,1):
temp = i
count = 0
while (temp <= k):
temp *= 2
count += 1
#print("1/{} * (1/2)^{}".format(n,count))
ans += min(1,(math.pow((1/2),count)))
print("{:1.9f}".format(ans/n))
|
p02773
|
s641271870
|
Accepted
|
import collections
N = int(input())
S = [input() for _ in range(N)]
c = collections.Counter(S)
cnt=max(c.values())
tmp = [k for k, v in c.items() if cnt==v]
print(*sorted(tmp), sep='\n')
|
p03862
|
s662008658
|
Accepted
|
N,x = [int(i) for i in input().split()]
a = [int(i) for i in input().split()]
count = 0
while a[0] > x:
count += a[0] - x
a[0] = x
for i in range(N-1):
if a[i] + a[i+1] > x:
count += a[i+1] - (x - a[i])
a[i+1] = x - a[i]
print(count)
|
p02642
|
s732171146
|
Accepted
|
import sys; input = sys.stdin.buffer.readline
sys.setrecursionlimit(10**7)
from collections import defaultdict
con = 10 ** 9 + 7; INF = float("inf")
def getlist():
return list(map(int, input().split()))
num = 10 ** 6 + 1 #適当に値を入れる
L = [0 for i in range(num)]
ans = 0
N = int(input())
A = getlist()
for i in range(N):
L[A[i]] += 1
for i in range(num):
if L[i] >= 1:
if L[i] == 1:
ans += 1
c = 2
while i * c <= num - 1:
L[i * c] = 0; c += 1
print(ans)
|
p02744
|
s951139955
|
Wrong Answer
|
import sys
sys.setrecursionlimit(10**9)
ordA = ord('a')
N = int(input())
def dfs(i, sSt):
if i == N:
# print(Ss)
ans = ''.join([chr(ordA+S) for S in Ss])
anss.append(ans)
else:
for s in range(0, sSt+2):
Ss[i] = s
dfs(i+1, s)
anss = []
Ss = [0] * N
dfs(1, 0)
print('\n'.join(anss))
|
p03767
|
s521981576
|
Accepted
|
N = int(input())
A = list(map(int,input().split()))
A=sorted(A,reverse=1)
print(sum(A[1:N*2:2]))
|
p03407
|
s836705973
|
Accepted
|
a,b,c=tuple(map(int,input().split()))
[print("Yes") if a+b>=c else print("No")]
|
p03721
|
s272835875
|
Wrong Answer
|
N, K = map(int, input().split())
l = []
for i in range(N):
a, b = map(int, input().split())
l.append([a, b])
c = 0
ans = 0
for r in l:
c += r[1]
if c >= K:
ans = r[0]
break
print(ans)
|
p03041
|
s788573486
|
Accepted
|
n,k=map(int,input().split())
s=list(input())
s[k-1]=s[k-1].lower()
print(''.join(s))
|
p03107
|
s354381280
|
Accepted
|
S = list(input())
cnt0 = S.count("0")
cnt1 = S.count("1")
print(min(cnt0, cnt1) * 2)
|
p03042
|
s353879649
|
Accepted
|
S = int(input())
L = S // 100 # 前半2桁
R = S % 100 # 後半2桁
if L > 12 or L == 0:
if R > 12 or R == 0: print('NA')
else: print('YYMM')
else:
if R > 12 or R == 0: print('MMYY')
else: print('AMBIGUOUS')
|
p03487
|
s936834690
|
Accepted
|
import collections
n = int(input())
ls = list(map(int, input().split()))
c = collections.Counter(ls)
ans = 0
for k, v in c.items():
if k <= v:
ans += v - k
else:
ans += v
print(ans)
|
p03693
|
s421636549
|
Accepted
|
r, g, b = map(int, input().split())
if (r * 100 + g * 10 + b) % 4 == 0:
print("YES")
else:
print("NO")
|
p02646
|
s537623367
|
Accepted
|
a, v = map(int,input().split())
b, w = map(int, input().split())
t = int(input())
if v < w:
print('NO')
elif abs(a-b) <= (v-w)*t:
print('YES')
else:
print('NO')
|
p02717
|
s250776671
|
Wrong Answer
|
N,A,B = input().split()
print(B,A,N)
|
p02705
|
s032292232
|
Accepted
|
n=int(input()) #Pythonの標準入力
ans=n*6.28
print(ans)
|
p03208
|
s601928985
|
Wrong Answer
|
n, k = (int(x) for x in input().split())
h = sorted([int(input()) for i in range(n)])
res = 10 ** 6
for i in range(n-k+1):
res = min(res, h[i+k-1]-h[i])
print(res)
|
p02860
|
s398155069
|
Accepted
|
n = int(input())
s = input()
ans = "No"
if n%2 == 0:
half = n//2
if s[0:half] == s[half:n]:
ans = "Yes"
print(ans)
|
p03665
|
s822639827
|
Wrong Answer
|
n,p = map(int,input().split())
a = list(map(int,input().split()))
odd = [i for i in a if i%2==1]
eve = [i for i in a if i%2==0]
odd_len = len(odd)
eve_len = len(eve)
if p==0:
ans = 2**eve_len
else:
ans = 0
count = 0
if p==0:
ans *= 2**odd_len//2
else:
ans += (2**eve_len)*(2**odd_len//2)
print(ans)
|
p02833
|
s351341566
|
Accepted
|
def solve(n):
if n % 2 == 1:
return 0
div_2 = 0
cur = 2
while cur <= n:
div_2 += (n // cur)
cur = cur * 2
div_5 = 0
cur = 5
while cur <= n:
div_5 += (n // cur) // 2
cur = cur * 5
return min(div_2, div_5)
n = int(input())
print(solve(n))
|
p02778
|
s365247228
|
Wrong Answer
|
s = str(input())
n = len(s)
for i in range(n):
A=(s.replace(s[i],"x"))
print(A)
|
p03721
|
s020535425
|
Accepted
|
def main():
n,k=map(int,input().split())
arr = []
for _ in range(n):
a,b=map(int,input().split())
arr.append((a, b))
arr.sort()
for x, c in arr:
if k <= c:
print(x)
break
else:
k -= c
if __name__ == "__main__":
main()
|
p02829
|
s900118145
|
Wrong Answer
|
a = int(input())
b = int(input())
if (a==1) | (b==2):
print(3)
if (a==1) | (b==3):
print(2)
if (a==2) | (b==3):
print(1)
|
p02646
|
s282942007
|
Wrong Answer
|
from sys import stdin
input = stdin.readline
A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())
if B > A:
if (V - W) * T + A >= B:
print("YES")
else:
print("NO")
else:
if (V - W) * T + A <= B:
print("YES")
else:
print("NO")
|
p03145
|
s677784284
|
Wrong Answer
|
def main():
AB, BC, CA = list(map(int, input().split()))
print(AB * BC / 2)
main()
|
p03796
|
s336761313
|
Wrong Answer
|
n = int(input())
mod = 10**9 + 7
ans = 1
for i in range(1,n+1):
ans *= i
ans %= mod
print(mod)
|
p03435
|
s765236213
|
Wrong Answer
|
mat = [map(int ,raw_input().split()) for _ in range(3)]
def f(m):
return m[1] - m[0] == m[2] - m[1]
b = True
for l in mat:
if not(f(l)):
b = False
for j in range(3):
c = [mat[i][j] for i in range(3)]
if not(f(c)):
b = False
print 'Yes' if b else 'No'
|
p02972
|
s827011134
|
Accepted
|
N = int(input())
A = tuple(map(int, input().split()))
state = [0] * (N + 1)
for i in range(N, 0, -1):
if N < i + i:
state[i] = A[i-1]
else:
state[i] = A[i-1]
j = i + i
while j <= N:
state[i] ^= state[j]
j += i
ans = [str(i) for i, x in enumerate(state) if x == 1]
print(len(ans))
if ans:
print(" ".join(ans))
|
p02959
|
s515646603
|
Accepted
|
n, p, *a = map(int, open(0).read().split())
c = 0
for a, b in zip(a, a[n:]):
c += min(p+a, b)
p = a - max(min(b-p, a), 0)
print(c)
|
p03860
|
s343031123
|
Accepted
|
s = input()
print("A"+s[8]+"C")
|
p02594
|
s596859693
|
Wrong Answer
|
import sys
input = lambda: sys.stdin.readline().rstrip()
def main():
x = int(input())
print('Yse' if x >= 30 else 'No')
if __name__ == '__main__':
main()
|
p02778
|
s843994372
|
Accepted
|
S = input()
print('x' * len(S))
|
p03612
|
s943613199
|
Wrong Answer
|
a=input()
a=list(map(int,input().split()))
count=0
for itr in range(len(a)):
if itr+1==a[itr]: count+=1
if count==0: print(0)
elif count%2:
print(count//2)
else: print(count//2+1)
|
p03557
|
s366619415
|
Accepted
|
import bisect
N=int(input())
A=list(map(int,input().split()))
B=list(map(int,input().split()))
C=list(map(int,input().split()))
A.sort()
B.sort()
C.sort()
ans = 0
for b in B:
a=bisect.bisect_left(A,b)
c=bisect.bisect_right(C,b)
ans += a *(N-c)
print(ans)
|
p03012
|
s373164055
|
Accepted
|
n = int(input())
w = list(map(int,input().split()))
ans = 0
for i in range(n):
ans += w[i]
if ans >= sum(w)//2:
print(min(abs(sum(w[:i+1])-sum(w[i+1:])), abs(sum(w[:i])-sum(w[i:]))))
break
|
p03210
|
s119442753
|
Wrong Answer
|
X = input()
print("Yes" if (X in "753") else "NO")
|
p02690
|
s370695703
|
Accepted
|
X = int(input())
A = 1
while True:
if X > A ** 5:
S = X - A ** 5
B = S ** (1 / 5) * (-1)
else:
S = A ** 5 - X
B = S ** (1 / 5)
if A ** 5 - int(B) ** 5 == X:
break
A += 1
print(A, int(B))
|
p02888
|
s961232781
|
Accepted
|
from bisect import bisect_left
import copy
n = int(input())
l = list(map(int, input().split()))
l.sort()
ans = 0
for small in range(n - 2):
for mid in range(small + 1, n - 1):
div = bisect_left(l, l[small] + l[mid], 0, n)
if div > mid + 1:
ans += div - mid - 1
print(ans)
|
p02987
|
s925033753
|
Accepted
|
print('YNeos'[len(set(input()))!=2::2])
|
p02555
|
s414716760
|
Wrong Answer
|
def main():
S=int(input())
mod=10**9+7
all=pow(2,S-1)
for i in range(S-2,S-5,-1):
all=all-pow(2,i)
all-=S
print(all%mod)
if __name__=="__main__":
main()
|
p03486
|
s769919886
|
Wrong Answer
|
s = list(input()).sort()
t = list(input()).sort()
if str(s) < str(t):
print("Yes")
else:
print("No")
|
p03910
|
s340246340
|
Wrong Answer
|
import math
N=int(input())
p=math.sqrt(N*2-0.25)-0.5
q=int(p)+1
M=q*(q+1)//2
L=M-N#must0or+
for i in range(q+1):
if i != L:
print(i)
|
p02723
|
s951096821
|
Wrong Answer
|
s = input()
print("Yes" if s[4]==s[5] else "No")
|
p02879
|
s571969951
|
Accepted
|
a, b = map(int, input().split())
if a <= 9 and b <= 9:
print(a*b)
else:
print(-1)
|
p02760
|
s691862005
|
Wrong Answer
|
a,b,c = map(int, input().split())
d,e,f = map(int, input().split())
g,h,i = map(int, input().split())
n=int(input())
A = list(map(int, input().split()))
if (a and b and c) in A:
print("Yes")
elif (d and e and f) in A:
print("Yes")
elif (g and h and i) in A:
print("Yes")
elif (a and d and g) in A:
print("Yes")
elif (b and e and h) in A:
print("Yes")
elif (c and f and i) in A:
print("Yes")
elif (a and e and i) in A:
print("Yes")
elif (c and e and g) in A:
print("Yes")
else:
print("No")
|
p02790
|
s398293311
|
Accepted
|
a, b = map(int, input().split())
str1 = str(a)*b
str2 = str(b)*a
if str1<=str2:
print(str1)
else:
print(str2)
|
p03107
|
s682376713
|
Accepted
|
S = list(input())
count_0 = 0
count_1 = 0
for i in S:
if i == "0":
count_0 += 1
if i == "1":
count_1 += 1
print(min(count_0, count_1)*2)
|
p02854
|
s658473639
|
Accepted
|
n = int(input())
li = list(map(int,input().split()))
ans = 100000000000000000
for i in range(1,n):
if i == 1:
x = sum(li[:i])
y = sum(li[i:])
else:
x += li[i-1]
y -= li[i-1]
z = abs(x-y)
if z < ans:
ans = z
print(ans)
|
p03779
|
s268306631
|
Accepted
|
X = int(input())
sum = 0
i = 1
while sum < X:
sum += i
i += 1
print(i-1)
|
p03210
|
s107194401
|
Accepted
|
X = int(input())
if X in [3,5,7]:
print("YES")
else:
print("NO")
|
p03910
|
s458046714
|
Wrong Answer
|
n = int(input())
ans = []
tmp = 0
i = 1
while tmp < n:
ans.append(i)
tmp += i
i += 1
print('\n'.join(map(str, ans)))
|
p03086
|
s662437203
|
Accepted
|
s = input()
l = list(s)
count = 0
ans = 0
for i in range(len(l)):
if l[i] == "A" or l[i] == "T" or l[i] == "G" or l[i] == "C":
count += 1
continue
ans = max(ans,count)
count = 0
ans = max(ans,count)
print(ans)
|
p03605
|
s211823659
|
Wrong Answer
|
# coding: utf-8
# Your code here!
n=input()
for i in range(len(n)):
if n[i] ==9:
print('Yes')
break
else:
print('No')
|
p03437
|
s187837724
|
Accepted
|
X,Y = list(map(int,input().split()))
if X % Y == 0:
print(-1)
else:
for i in range(1,1000000):
if X*i > 10**18:
print(-1)
break
if X*i % Y != 0:
print(X*i)
break
|
p03474
|
s001400525
|
Accepted
|
a,b = map(int,input().split())
s=input()
if s[a]=="-" and len(s)==a+b+1 and s.count("-")==1:
print("Yes")
else:
print("No")
|
p03086
|
s378535458
|
Accepted
|
s=input()
n=len(s)
def check(s):
a=list(set(list(s)))
b=list("ACGT")
for i in b:
if i in a:
a.remove(i)
if a==[]:
return len(s)
return 0
ans=0
for i in range(n):
for j in range(n+1):
ans=max(ans,check(s[i:j]))
print(ans)
|
p03017
|
s237332838
|
Wrong Answer
|
n, a, b, c, d = map(int, input().split())
s = input()
a = a-1
b = b-1
c = c-1
d = d-1
cnt = 0
for i in range(a+1, d+1):
if s[i] == '#':
cnt += 1
else:
cnt = 0
if cnt == 2:
print('No')
exit()
if c < d:
print('Yes')
exit()
for i in range(b+1, d+1):
if s[i-1] == '.' and s[i] == '.' and s[i+1] == '.':
print('Yes')
exit()
print('No')
|
p02695
|
s290585017
|
Accepted
|
import itertools
N, M, Q = map(int, input().split())
input_lists = []
A = []
point = [0]
for _ in range(Q):
input_lists.append([int(i) for i in input().split()])
for A in itertools.combinations_with_replacement(range(1, M+1), N):
d_sum = 0
for input_list in input_lists:
a, b, c, d = input_list
if A[b-1] - A[a-1] == c:
d_sum += d
point.append(d_sum)
print(max(point))
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.