problem_id
stringclasses 428
values | submission_id
stringlengths 10
10
| status
stringclasses 2
values | code
stringlengths 5
816
|
|---|---|---|---|
p02548
|
s954284785
|
Wrong Answer
|
def solve():
ans = 0
for a in range(1, N):
for b in range(1, N):
x = a * b
if x >= N:
break
ans += 1
return ans
N = int(input())
ans = solve()
print(ans)
|
p03495
|
s491230239
|
Accepted
|
def main():
n, target = map(int, input().split())
count = {}
numbers = list(map(int, input().split()))
for num in numbers:
if num in count:
count[num] += 1
else:
count[num] = 1
count = sorted(count.values())
print(sum(count[:-target]) if len(count) > target else 0)
if __name__ == '__main__':
main()
|
p03106
|
s371081789
|
Accepted
|
a, b,K = map(int, input().split())
ans=[]
for i in range(1,min(a,b)+1):
if a%i==0 and b%i==0:
ans.append(i)
ans=ans[::-1]
print(ans[K-1])
|
p03759
|
s126863957
|
Wrong Answer
|
a, b, c = map(int, input().split())
if (b - a) == (c - b):
print('Yes')
else:
print('No')
|
p02797
|
s390529557
|
Accepted
|
N,K,S = map(int,input().split())
A = [10**9]*N
if S != 10**9:
for i in range(K):
A[i] = S
else:
for i in range(N-K):
A[i] = 10**9-1
print(*A)
|
p04034
|
s307675684
|
Wrong Answer
|
n, m = map(int, input().split())
num = [1] * n
red = [0] * n
red[0] = 1
for i in range(m):
x, y = map(int, input().split())
x -= 1
y -= 1
if red[x] and num[y]:
red[y] = 1
num[x] -= 1
num[y] += 1
ans = 0
for i in range(n):
if num[i] and red[i]:
ans += 1
print(ans)
|
p03994
|
s488308047
|
Accepted
|
if __name__ == "__main__":
s = input()
k = int(input())
s_num = [0] * len(s)
res = k
for i in range(len(s)):
tmp = ord(s[i]) - 97
if tmp != 0 and 26 - tmp <= res:
res -= (26 - tmp)
s_num[i] = 0
else:
s_num[i] = tmp
res %= 26
s_num[-1] += res
ans = ''
for i in s_num:
ans += chr(i + 97)
print(ans)
|
p03282
|
s115616733
|
Wrong Answer
|
A = input()
B = input()
for i in range(len(B)):
if A[i] != 1:
print(A[i])
break
|
p04031
|
s381959369
|
Accepted
|
n = int(input())
a = list(map(int, input().split()))
res = 10**9
for i in range(-100,101):
ans = 0
for j in a:
ans += (abs(i-j))**2
res = min(res,ans)
print (res)
|
p03309
|
s134465475
|
Wrong Answer
|
# ABC102C
import numpy as np
n = int(input())
a = [int(x) for x in input().split()]
a = np.array(a)
Min = np.inf
for b in range(100000):
x = b+np.arange(1, n+1)
Min = min(Min, sum(abs(a - x)))
print(Min)
|
p03625
|
s838986024
|
Accepted
|
from collections import defaultdict
n = int(input())
a_list = [int(x) for x in input().split()]
d = defaultdict(int)
for a in a_list:
d[a] += 1
temp_list = sorted([(k, v) for k, v in d.items() if v >= 2], reverse=True)
if len(temp_list) >= 2:
print(temp_list[0][0] ** 2 if temp_list[0][1] >= 4 else temp_list[0][0] * temp_list[1][0])
else:
print(0)
|
p02705
|
s460997564
|
Wrong Answer
|
a=int(input())
print(2*a*6.28318530717958623200)
|
p03211
|
s531009897
|
Wrong Answer
|
import math
s=list(input())
a=[]
for i in range(len(s)-2):
p=100*int(s[i])+10*int(s[i+1])+int(s[i])
a.append(abs(p-753))
print(min(a))
|
p03767
|
s090034775
|
Wrong Answer
|
n = int(input())
A = list(map(int,input().split()))
A.sort()
a = sum(A[n//3:n//3*2])
b = sum(A[-2:-2-n//3*2:-2])
c = sum(A[1:n+1:2])
ans = max(a,b,c)
print(ans)
|
p03013
|
s444218347
|
Accepted
|
n, m = map(int, input().split())
dp = [0 for i in range(n + 1)]
mod = 10 ** 9 + 7
broke = set()
for i in range(m):
broke.add(int(input()))
dp[0] = 1
for i in range(n):
if i + 1 <= n and i + 1 not in broke:
dp[i + 1] += dp[i]
dp[i + 1] %= mod
if i + 2 <= n and i + 2 not in broke:
dp[i + 2] += dp[i]
dp[i + 2] %= mod
print(dp[-1] % mod)
|
p02729
|
s405078696
|
Accepted
|
n, m = map(int, input().split())
print(int(n*(n-1)/2+m*(m-1)/2))
|
p03043
|
s696373157
|
Accepted
|
import sys
# sys.setrecursionlimit(100000)
def input():
return sys.stdin.readline().strip()
def input_int():
return int(input())
def input_int_list():
return [int(i) for i in input().split()]
def main():
n, k = input_int_list()
ans = 0
for i in range(1, n + 1):
start = i
cnt = 0
while start < k:
start *= 2
cnt += 1
ans += 1 / (n * 2**cnt)
print(ans)
return
if __name__ == "__main__":
main()
|
p02780
|
s378341785
|
Accepted
|
#from math import sqrt
#from heapq import heappush, heappop
#from collections import deque
n, k = [int(v) for v in input().split()]
p = [int(v) for v in input().split()]
max_p = max(p)
dp = [0] * (max_p+1)
dp[1] = 1
for i in range(2, max_p+1):
dp[i] = dp[i - 1] + i
dp[i - 1] /= (i - 1)
dp[max_p] /= max_p
e = 0
for i in range(k):
e += dp[p[i]]
max_e = e
for i in range(k, n):
e -= dp[p[i - k]]
e += dp[p[i]]
max_e = max(max_e, e)
print(max_e)
|
p02684
|
s088680823
|
Accepted
|
n, k = map(int, input().split())
a = list(map(int, input().split()))
for i in range(n):
a[i] -= 1
l = [-1]*(n + 1)
l[0] = 0
order = 0
now = 0
while k > 0:
k -= 1
now = a[now]
order += 1
if l[now] == -1:
l[now] = order
else:
loop = order - l[now]
k %= loop
break
while k > 0:
k -= 1
now = a[now]
print(now + 1)
|
p02705
|
s195812624
|
Wrong Answer
|
R=int(input())
a=R*3.141516
print(a)
|
p02583
|
s223460805
|
Accepted
|
n = int(input())
L = [*map(int, input().split())]
M = {}
for l in L:
if l in M: M[l] += 1
else: M[l] = 1
M = list(M.items())
M.sort()
m = len(M)
c = 0
for i in range(m):
for j in range(i+1, m):
for k in range(j+1, m):
if M[i][0]+M[j][0] > M[k][0]:
c += M[i][1] * M[j][1] * M[k][1]
print(c)
|
p02879
|
s009070578
|
Wrong Answer
|
A,B=map(int,input().split())
if A and B <10:
print(A*B)
else:
print("-1")
|
p03448
|
s596041412
|
Accepted
|
A=int(input())
B=int(input())
C=int(input())
X=int(input())
cnt=0
for i in range(A+1):
for j in range(B+1):
for k in range(C+1):
if 500*i+100*j+50*k ==X:
cnt += 1
print(cnt)
|
p02759
|
s541562131
|
Accepted
|
N = int(input())
print( -(-N // 2))
|
p02693
|
s847042959
|
Wrong Answer
|
k = int(input())
a, b = map(int, input().split())
a1 = a//k
b1 = b//k
if (b1>a1 and b1 != 0):
print("OK")
elif (a == b and a%k == 0):
print("OK")
else:
print("NG")
|
p02706
|
s608872410
|
Wrong Answer
|
n,m = map(int,input().split())
a = list(map(int,input().split()))
if n > sum(a):
print(n-sum(a))
else:
print(-1)
|
p03360
|
s257586917
|
Accepted
|
num_list = [int(i) for i in input().split()]
K = int(input())
max_sum = max(num_list)*2**K + sum(num_list) - max(num_list)
print(max_sum)
|
p02597
|
s113950726
|
Wrong Answer
|
import sys
sys.setrecursionlimit(10**6)
read = sys.stdin.read
readlines = sys.stdin.readlines
def main():
n = int(input())
a = input()
if not 'WR' in a:
print(0)
else:
rightmostW = a.find('RW')
wnum = a[rightmostW+1:].count('R')
leftmostR = a.rfind('R')
wnum2 = a[:leftmostR+1].count('W')
r = min(wnum, wnum2)
print(r)
if __name__ == '__main__':
main()
|
p02789
|
s680794148
|
Accepted
|
A,B=map(int,input().split())
print('Yes' if A==B else 'No')
|
p02683
|
s530581631
|
Wrong Answer
|
N, M, X = map(int, input().split())
INF = 30
ans = 1 << INF
data = []
for i in range(N):
c = list(map(int, input().split()))
data.append(c)
for i in range(1, 2**N):
tmp = 0
skill = [0] * M
for j in range(N):
if i >> j & 1:
tmp += data[j][0]
for k in range(M):
skill[k] += data[j][k - 1]
if min(skill) >= X and tmp < ans:
ans = tmp
if ans == 1 << INF:
print('-1')
else:
print(ans)
|
p02793
|
s974170375
|
Accepted
|
n = int(input())
a = list(map(int,input().split()))
def gcd(a, b):
if b == 0:
return a
return gcd(b, a%b)
def lcm(a, b):
return a * b // gcd(a, b)
k = a[0]
for ai in a:
k = lcm(ai, k)
res = 0
for ai in a:
res += k//ai
print(res % 1000000007)
|
p03607
|
s609951761
|
Wrong Answer
|
def main():
import sys
from itertools import groupby
*_, = sys.stdin.read()
__ = _ [2::2]
__.sort()
___ = 0
________ = 2
for ____, _____ in groupby(__):
______ = tuple(_____)
_______ = len(______)
_______ %= ________
___ += _______
print(___)
if __name__ == '__main__':
main()
|
p03219
|
s963506029
|
Accepted
|
X, Y = map(int, input().split())
print(X+Y//2)
|
p02594
|
s245857631
|
Accepted
|
x = int(input())
if x >= 30:
print('Yes')
else:
print('No')
|
p02706
|
s473284931
|
Accepted
|
n, m = map(int, input().split())
a = list(map(int, input().split()))
print(max(n - sum(a), - 1))
|
p03673
|
s326323257
|
Wrong Answer
|
n = int(input())
a = list(map(int,input().split()))
ans = []
for i in range(n):
if i%2==1:
ans.insert(0,a[i])
else:
ans.append(a[i])
if n%2==1:
ans.reverse()
print(ans)
|
p03013
|
s558847625
|
Wrong Answer
|
n,m = map(int, input().split())
a = [int(input()) for i in range(m)]
step = [1] + [0]*n
for i in range(1,n+1):
if i in a:
continue
else:
if i-1 not in a:
step[i] += step[i-1]
if i-2 not in a and i>=2:
step[i] += step[i-2]
if i-1 in a and i-2 in a:
print(0)
break
print(step[n]%(10**9+7))
|
p02947
|
s610888773
|
Accepted
|
#!/usr/bin/env python3
from scipy.special import comb
n, *s = open(0).read().split()
d = {}
for i in s:
l = "".join(sorted(j for j in i))
if l in d:
d[l] += 1
else:
d[l] = 1
print(sum(comb(i, 2,exact=True) for i in d.values()))
|
p02765
|
s847276247
|
Accepted
|
n, r = map(int, input().split())
if n >= 10:
print(r)
else:
print(r + 100*(10-n))
|
p03323
|
s369220613
|
Wrong Answer
|
'x = int(input())\n\nprint(x)\n\nprint("Hello World!")'
|
p03407
|
s299566314
|
Wrong Answer
|
a, b, c = map(int, input().split())
if a+b*2 >= c:
print('Yes')
else:
print('No')
|
p02553
|
s912248565
|
Accepted
|
a, b, c, d = map(int, input().split())
print(max(a * c, a * d, b * c, b * d))
|
p02952
|
s595205299
|
Accepted
|
n = int(input())
ans = 0
for i in range(1,n+1):
num = str(i)
if (len(num) % 2) != 0:
ans += 1
print(ans)
|
p03160
|
s917961893
|
Accepted
|
n=int(input())
l=list(map(int,input().split()))
dp=[0]*n
dp[0]=0
dp[1]=abs(l[1]-l[0])
for i in range(2,n):
dp[i]=min(dp[i-1]+abs(l[i-1]-l[i]),dp[i-2]+abs(l[i-2]-l[i]))
print(dp[-1])
|
p02983
|
s759292107
|
Accepted
|
l,r = map(int,input().split())
sub = r-l
l %= 2019
r %= 2019
if(sub >= 2019):
print(0)
exit()
mina = float('INF')
for x in range(l,r+1):
for y in range(x,r+1):
if(x==y):
continue
ans = (x * y) % 2019
if(mina > ans):
mina = ans
print(mina)
|
p03592
|
s678593895
|
Accepted
|
N, M, K = map(int,input().split())
for k in range(N+1):
for l in range(M+1):
if k*l + (M-l)*(N-k) == K:
print("Yes")
exit(0)
print("No")
|
p03077
|
s734679395
|
Accepted
|
import math
n,a,b,c,d,e = map(int,open(0).read().split())
print(5+math.ceil(n/min([a,b,c,d,e]))-1)
|
p02613
|
s238192575
|
Wrong Answer
|
##B
N = int(input())
S = list(input() for i in range(N))
a=0
b=0
c=0
d=0
for i in S:
if i =="AC":
a +=1
elif i =="WA":
b +=1
elif i =="TLE":
c +=1
elif i =="RE":
d +=1
print("AC × "+ str(a))
print("WA × "+ str(b))
print("TLE × "+ str(c))
print("RE × "+ str(d))
|
p04043
|
s480773146
|
Wrong Answer
|
syl=sorted(list(map(int,input().split())))
print(syl)
syl2=[5, 5, 7]
if syl == syl2:
print('YES')
else:
print('NO')
|
p02684
|
s230559177
|
Accepted
|
N,K = map(int, input().split())
A = [*map(lambda x:int(x)-1, input().split())]
index = [-1]*N
path = []
pre = 0
while index[pre] < 0:
index[pre] = len(path)
path += [pre]
pre = A[pre]
one = index[pre]
loops = len(path) - one
if K < one: print(path[K]+1)
else: print(path[(K-one) % loops + one]+1)
|
p03779
|
s596303918
|
Wrong Answer
|
def main():
X = int(input())
for i in range(1, 100000):
if X == i:
print(i)
break
elif X - i <= i + 1:
pass
else:
X -= i
if __name__ == "__main__":
main()
|
p03416
|
s469762870
|
Wrong Answer
|
A,B = map(int,input().split())
count = 0
for i in range(A,B+1):
i = str(i)
num = 1
if len(i)%2 == 0:
num = 0
if i[:len(i)//2] == i[len(i)//2+num:]:
count += 1
print(count)
|
p04012
|
s470725159
|
Accepted
|
w = input()
w_set = set(w)
d = {}
for i in w_set:
d[i] = 0
for i in w:
d[i] += 1
for i in d.values():
if i % 2 != 0:
print("No")
exit()
print("Yes")
|
p03679
|
s289827743
|
Accepted
|
x,a,b = map(int, input().split())
if b <= a:
print('delicious')
elif b-a <= x:
print('safe')
else:
print('dangerous')
|
p03107
|
s357978754
|
Wrong Answer
|
import sys
def solve():
input = sys.stdin.readline
S = input().strip("\n")
z, o = 0, 0
for i in range(len(S)):
if S[i] == "0": z += 1
else: o += 1
print(2 * min(z, o))
return 0
if __name__ == "__main__":
solve()
|
p03000
|
s498433222
|
Wrong Answer
|
n, x = map(int,input().split())
l = list(map(int,input().split()))
a = 0
for i in range(n):
a = a + l[i]
#print(a)
if x == a:
print(i+1+1)
break
elif x <= a:
print(i+1)
break
else:
continue
|
p02714
|
s619479720
|
Accepted
|
N = int(input())
S = input()
R_count = S.count("R")
B_count = S.count("B")
G_count = S.count("G")
distance_1To2 = 0
t = 0
for i in range(N-2):
for j in range(i+1,N):
if j+(j-i) >= N:
break
if S[j] != S[i]:
if S[j] != S[j+(j-i)] and S[i] != S[j+(j-i)]:
t += 1
print((R_count*B_count*G_count) - t)
|
p03338
|
s340708776
|
Wrong Answer
|
n = int(input())
s = list(input())
print(s)
ans = 0
for i in range(1, n-1):
x = set(s[:i])
y = set(s[i:])
cnt = 0
for c in x:
if c in y:
cnt += 1
if cnt > ans:
ans = cnt
print(ans)
|
p03210
|
s843467872
|
Wrong Answer
|
print('YNeos'[input()not in'357'::2])
|
p03380
|
s729933767
|
Accepted
|
n = int(input())
a = list(map(int,input().split()))
a.sort()
maxkouho = a[-1]
k = maxkouho/2
maxans = 10**18
ans = 0
for i in range(n-1):
s = abs(a[i]-k)
if s < maxans:
maxans = s
ans = a[i]
print(maxkouho, ans)
|
p03607
|
s046518985
|
Accepted
|
import sys
def IS(): return sys.stdin.readline().rstrip()
def II(): return int(IS())
from functools import partial, reduce
from collections import Counter
def f_chain(*args):
return reduce(lambda x, f: f(x), args)
def main():
n = II()
aa = [II() for _ in range(n)]
c_cnt = Counter(aa).values()
f_chain(c_cnt,
partial(map, lambda x: 1 if x%2==1 else 0),
sum,
print)
if __name__ == '__main__':
main()
|
p02660
|
s676066018
|
Accepted
|
n = int(input())
temp = n
p = 2
res = 0
while p * p <= n:
if temp % p == 0:
cnt = 1
while temp % (p ** (cnt + 1)) == 0:
cnt += 1
res += int((-1 + (1 + 8 * cnt) ** 0.5) // 2)
temp //= p ** cnt
p += 1
print(res + (temp != 1))
|
p03206
|
s727522387
|
Wrong Answer
|
d = 25 - (int(input()))
answer = "Christmas"
for i in range(d):
answer += "Eve"
print(answer)
|
p03698
|
s746854153
|
Wrong Answer
|
S = input().split()
ans =set(S)
a = len(S)
b = len(ans)
if a == b:
print("yes")
else:
print("no")
|
p02702
|
s661692162
|
Accepted
|
n = input()
mod = [0]*2019
mod[0] += 1
T = 0
d = 1 # 桁数
for i, s in enumerate(n[::-1]):
T += int(s) * d
T %= 2019
d = (d * 10) % 2019
mod[T] += 1
res = 0
for m in mod:
res += m*(m-1)/2
print(int(res))
|
p02687
|
s426049775
|
Accepted
|
S = input()
if S == 'ABC':
print('ARC')
else:
print('ABC')
|
p02676
|
s606562058
|
Wrong Answer
|
n = int(input())
a = input()
if len(a) > n:
print(a[0:n+1])
else:
print(a +'...')
|
p02675
|
s211821197
|
Accepted
|
n = input()
if n[-1] == "3":
print("bon")
elif n[-1] in ["0", "1", "6", "8"]:
print("pon")
else:
print("hon")
|
p04044
|
s817667629
|
Accepted
|
n,l=map(int,input().split())
s=[input() for _ in range(n)]
s.sort()
x=''
for i in s:
x+=i
print(x)
|
p03665
|
s811487121
|
Accepted
|
from math import factorial
n,p=map(int,input().split())
A=list(map(int,input().split()))
a,b=0,0
for i in A:
if i%2==0:a +=1
else:b +=1
cnt=0 if p==1 else 1
for i in range(p,b+1,2):
if i==0:continue
cnt +=factorial(b)//(factorial(i)*factorial(b-i))
print(cnt*(2**a))
|
p02633
|
s913284064
|
Wrong Answer
|
x = int(input())
print(360//x)
|
p02645
|
s134951163
|
Accepted
|
s = input()
print(s[:3])
|
p02731
|
s554431011
|
Wrong Answer
|
import math
L = int(input())
length = L*100
max_vol=0
for w in range(1,math.ceil((length+1)/3)):
if max_vol<w*((length-w)/2)**2:
max_vol = w*((length-w)/2)**2
print(max_vol/1000000)
|
p03408
|
s461198572
|
Wrong Answer
|
n = int(input())
red =[]
for i in range(n):
l = str(input())
red.append(l)
m = int(input())
blue =[]
for i in range(m):
l = str(input())
blue.append(l)
import collections
cr = collections.Counter(red)
crs = list(cr.most_common())
cb = collections.Counter(blue)
cbs = list(cb.most_common())
result =[]
for i in range(len(crs)):
for j in range(len(cbs)):
if crs[i][0]==cbs[j][0]:
result.append(crs[i][1]-cbs[j][1])
else:
result.append(crs[i][1])
if max(result)>0:
print(max(result))
else:
print(0)
|
p03075
|
s317881683
|
Wrong Answer
|
n=int(input())
mb=[int(input()) for i in range(5)]
print(-(-n//min(mb))+4)
|
p02595
|
s843930548
|
Wrong Answer
|
n, d = map(int, input().split())
xy = []
for i in range(n):
xy.append(list(map(int,input().split())))
c = 0
for i in range(n):
if xy[i][0] * xy[i][0] + xy[i][1] * xy[i][1] < d * d:
c += 1
print(c)
|
p02831
|
s691120477
|
Accepted
|
#!/usr/bin/env python3
import fractions
a, b = map(int, input().split())
f = fractions.gcd(a, b)
ans = a * b // f
print(ans)
|
p02823
|
s175968991
|
Accepted
|
N, A, B = map(int, input().split())
if abs(A - B) % 2 == 0:
print(abs(A - B) // 2)
else:
ans = min(A - 1, N - B) + (B - A - 1) // 2 + 1
print(ans)
|
p02578
|
s581291939
|
Wrong Answer
|
n = int(input())
a = [int(i) for i in input().split()]
print(a)
ans=0
for i in range(n-1):
d = a[i-1] - a[i]
if d<0:
ans+= d+1
a[i]=a[i]+d+1
else:
continue
print(abs(ans))
|
p02823
|
s725512559
|
Accepted
|
N,A,B=map(int,input().split())
if (B-A)%2==0:
print((B-A)//2)
else:
tmp=A-1+(B-A+1)//2
a=A+(N-B);b=N
tmpp=N-B+(b-a+1)//2
print(min(tmp,tmpp))
|
p03623
|
s757229870
|
Accepted
|
x,a,b=map(int,input().split())
print("A" if abs(x-a)<abs(x-b) else "B")
|
p03076
|
s690527057
|
Wrong Answer
|
import math
x=0
y=0
for _ in range(5):
i=int(input())
x+=math.ceil(i)
if i%10>y:
y=i%10
print(x+y-10)
|
p02708
|
s888494026
|
Accepted
|
n,k = map(int,input().split())
mod = 10**9+7
ans = 0
for i in range(k,n+2):
ans += (n-i+1)*i+1
ans %= mod
print(ans)
|
p02973
|
s445247651
|
Accepted
|
import bisect
N=int(input())
ls=[int(input()) for _ in range(N)]
color=[ls[-1]]
ans=1
for i in range(N-1):
a=ls[-2-i]
k=bisect.bisect_right(color,a)
if k==ans:
color.append(a)
ans+=1
else:
color[k]=a
print(ans)
|
p02994
|
s881839321
|
Accepted
|
N, L=map(int, input().split())
ans=sum([L+i-1 for i in range(1, N+1)])
if L>0:
ans-=L
elif N+L-1<0:
ans-=N+L-1
print(ans)
|
p02759
|
s265120193
|
Accepted
|
import math
def main():
N = int(input())
N = math.ceil(N / 2)
print(N)
if __name__ == "__main__":
main()
|
p02577
|
s693737574
|
Accepted
|
n = input()
r = 0
for c in n:
r += int(c)
if r % 9 == 0:
print('Yes')
else:
print('No')
|
p02922
|
s889408242
|
Accepted
|
import math
A,B =map(int,input().split())
soc= 1
tap=0
while(soc<B):
soc-=1
soc+=A
tap+=1
#print(tap)
print(math.ceil((B-1)/(A-1)))
|
p02760
|
s621354477
|
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())
num =[]
for j in range(n):
num.append(int(input()))
if (a and d and g )in num:
print('Yes')
elif (b and e and h) in num:
print('Yes')
elif (c and f and i) in num:
print('Yes')
elif (a and b and c) in num:
print('Yes')
elif (g and h and i) in num:
print('Yes')
elif (a and e and i) in num:
print('Yes')
elif (c and e and g) in num:
print('Yes')
else:
print('No')
|
p03095
|
s732786863
|
Wrong Answer
|
mod = 10**9 + 7
def main():
N = int(input())
S = input()
num_chars = 0
A = {}
for s in S:
if s not in A:
A[s] = 0
num_chars += 1
A[s] += 1
# print(num_chars, A)
B = [(a, A[a]) for a in A]
ans = 1
for b in B:
ans = (ans * (b[1] + 1)) % mod
print(ans)
if __name__ == '__main__':
main()
|
p03469
|
s697629421
|
Accepted
|
s = input()
print(s[0:3]+"8"+s[4:10])
|
p03705
|
s223912455
|
Accepted
|
n,a,b = map(int,input().split())
if a > b:
print(0)
elif n == 1:
print(int(a==b))
else:
print((b-a)*(n-2)+1)
|
p03838
|
s401365431
|
Wrong Answer
|
x, y = map(int, input().split())
ans = 0
if x < y:
if x < 0 and y > 0:
ans = y + x
else:
ans = abs(y) - abs(x)
elif x == y * -1:
ans = 1
elif x > y and x < 0 and y < 0 and abs(y) > abs (x):
ans = abs(y) - abs(x) + 2
else:
ans = max(abs(y), abs(x)) - min(abs(y), abs(x)) + 1
print(ans)
|
p03030
|
s401755928
|
Accepted
|
n=int(input())
sp=[]
for i in range(n):
s,p=input().split()
p=int(p)
sp.append([s,p,i+1])
sp.sort(key=lambda sp:(sp[0],-sp[1]))
for i in sp:
print(i[2])
|
p03252
|
s221494142
|
Accepted
|
from collections import defaultdict
S = input()
T = input()
s_to_t = defaultdict(set)
t_to_s = defaultdict(set)
for s, t in zip(S, T):
s_to_t[s].add(t)
t_to_s[t].add(s)
for v in s_to_t.values():
if len(v) > 1:
print("No")
exit()
for v in t_to_s.values():
if len(v) > 1:
print("No")
exit()
print("Yes")
|
p03146
|
s279736914
|
Accepted
|
n=int(input())
l=[n]
i=1
while(True):
i+=1
if n%2==0:
n=n/2
else:
n=3*n+1
if n in l:
print(i)
break
else:
l+=[n]
|
p02578
|
s670990283
|
Wrong Answer
|
n = int(input())
a = list(map(int, input().split()))
ans = 0
i = 0
maxi = a[i]
while True:
if i == n - 1:
break
if a[i + 1] < a[i]:
ans += (maxi - a[i + 1])
else:
maxi = a[i + 1]
i += 1
print(ans)
|
p02888
|
s674097390
|
Wrong Answer
|
import bisect
N=int(input())
L=list(map(int,input().split()))
i=0
L=sorted(L)
for a in range(N):
for b in range(a+1,N):
c=bisect.bisect_left(L,L[a]+L[b])
if c>b:
i+=c-b
else:
i=i
print(i)
|
p03659
|
s878413579
|
Accepted
|
from itertools import accumulate
n = int(input())
a = [int(i) for i in input().split()]
ac = list(accumulate(a))
d = float("inf")
for i in range(n - 1):
d = min(abs(ac[i] * 2 - ac[-1]), d)
print(d)
|
p02627
|
s203977377
|
Wrong Answer
|
s = input()
print(s)
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.