problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p02694 | s390222600 | Wrong Answer | X = int(input())
m = 100
a = 0
while m<X:
m = int(1.01*m)
a+=1
print(a) |
p03705 | s087713583 | Accepted | import sys
n,a,b = map(int,input().split())
if a > b:
print(0)
sys.exit()
if n == 1:
if a == b:
print(1)
sys.exit()
else:
print(0)
sys.exit()
print((b-a)*(n-2)+1) |
p02689 | s490077279 | Wrong Answer | n,m = map(int,input().split())
h = list(map(int,input().split()))
dic = {}
for i in range(1,n+1):
dic[i] = 1
for j in range(1,m+1):
h_1,h_2 = map(int,input().split())
if h[h_1-1] < h[h_2-1]:
dic[h_1] = 0
else:
dic[h_2] = 0
lis = list(dic.values())
print(lis.count(1))
|
p03494 | s012803471 | Accepted | n = int(input())
a = [int(x) for x in input().split()]
count = 0
while(1):
check = [x % 2 for x in a]
if (sum(check) == 0):
count += 1
a = [x/2 for x in a]
else:
break
print(count)
|
p02682 | s510646510 | Wrong Answer | A,B, C,K = input().split()
a = int(A)
b= int(B)
c =int(C)
k=int(K)
if k-a-b-c==0:
print(a-c)
elif k-a-b>0 and k-a-c-b<0:
print(2*a-k+b)
else:
print(a)
|
p03998 | s237872385 | Accepted | a = input()
b = input()
c = input()
turn = "a"
d = {"a":a,"b":b,"c":c}
while True:
d[turn], turn = d[turn][1:], d[turn][0]
if len(d[turn]) == 0:
ans = turn.upper()
break
print(ans) |
p02661 | s675125602 | Wrong Answer | import math
def median(array):
if N % 2:
return array[N // 2]
else:
return sum(array[N // 2 - 1: N // 2 + 1]) / 2
N = int(input())
A, B = [], []
for _ in range(N):
a, b = map(int, input().split())
A.append(a)
B.append(b)
x = median(A)
y = median(B)
if N % 2:
print(y - x + 1)
... |
p02765 | s451814071 | Wrong Answer | N, R = map(int, input().split())
print(R - 100 * max(0, 10-N)) |
p02640 | s063785967 | Accepted | MOD = 10**9+7
def mi():
return map(int, input().split())
def ii():
return int(input())
def main():
X, Y = list(mi())
if 4*X-Y >= 0 and (4*X-Y)%2 == 0 and (4*X-Y)//2<= X:
print('Yes')
else:
print('No')
if __name__ == '__main__':
main() |
p02946 | s834830280 | Wrong Answer | k, x = map(int, input().split())
l = max(-1000000, x - k + 1)
r = min(1000000, x + k - 1)
list = []
for i in range(l, r + 1):
list.append(i)
print(list) |
p02731 | s178094523 | Wrong Answer | L=int(input())
ans=[]
for i in range(1,1000):
for j in range(1,1000):
k=L-(i+j)
ans.append(i*j*k)
Y=max(ans)
print(f"{Y:.6f}")
|
p02645 | s312792544 | Wrong Answer | S = input(str("Input text: "))
if 3 <= len(S) <= 20:
print(S[:3].lower()) |
p02726 | s168044035 | Accepted |
n, x, y = map(int, input().split())
d = [0]*(n-1)
for i in range(1, n+1):
for j in range(i+1,n+1):
c = min(j-i, abs(i-x)+1+abs(j-y))
d[c-1] = d[c-1] + 1
for i in d:
print(i) |
p03779 | s012949690 | Accepted | x = int(input())
t = 1
while 2*x > t**2 + t:
t += 1
print(t) |
p02879 | s382357468 | Accepted | n, m = list(map(int, input().split()))
if n <= 9 and m <= 9:
print(n*m)
else:
print(-1)
|
p03419 | s881763412 | Accepted | def ii():return int(input())
def iim():return map(int,input().split())
def iil():return list(map(int,input().split()))
n,m = iim()
if n == 1 and m == 1:
print(1)
elif n == 1:
print(m-2)
elif m == 1:
print(n-2)
else:
print((n-2)*(m-2)) |
p02818 | s440925391 | Accepted | a,b,k=map(int,input().split())
if a>=0 and b>=0:
leftover = a - k
if(leftover>=0):
print(leftover, b)
elif(b+leftover >= 0):
print(0, b+leftover)
else:
print(0, 0) |
p03380 | s970540703 | Accepted | _, *a = map(int, open(0).read().split())
n = max(a)
print(n, min((abs(n/2 - i), i) for i in a)[1]) |
p02859 | s836327325 | Accepted | r=int(input())
print(pow(r,2)) |
p03711 | s268120638 | Accepted | a,b = map(int, input().split())
lista = [1,3,5,7,8,10,12]
listb = [4,6,9,11]
tmp = a in listb
# print(tmp)
if (a == 2 and b ==2):
print("Yes")
elif (a in listb and b in listb):
print("Yes")
elif (a in lista and b in lista):
print("Yes")
else:
print("No") |
p02973 | s029625259 | Accepted | from bisect import bisect_right
n=int(input())
A=[int(input()) for _ in range(n)][::-1]
DP=[A[0]]
for i in range(1,n):
num=A[i]
if num>=DP[-1]:
DP.append(num)
else:
index=bisect_right(DP,num)
DP[index]=num
print(len(DP)) |
p02819 | s752153733 | Wrong Answer | x = int(input())
bu = [False]*2*10**5
bu[2] = True
cur = 2
while 1:
if not bu[cur]:
bu[::cur] = [True] * len(bu[::cur])
cur += 1
if cur>=x and not bu[cur]:
print(cur)
break |
p02717 | s223718074 | Wrong Answer | X, Y, Z = list(map(int, input().split()))
print(Z, Y, X) |
p03309 | s931516974 | Accepted | import numpy as np
N = int(input())
A = list(map(int, input().split()))
a = []
ans = 0
for i in range(N):
a.append(A[i]-i-1)
# 平均値ではなく、中央値を使う
b = int(np.median(a))
for i in range(N):
ans += abs(b-a[i])
print(ans)
|
p02935 | s817957126 | Accepted | N = int(input())
v = sorted(list(map(int, input().split())))
ans = (v[0] + v[1]) / 2
for i in range(2, N):
ans = (ans + v[i]) / 2
print(ans) |
p02554 | s783886218 | Wrong Answer | n = int(input())
mod = 10 ** 9 + 7
print(pow(10, n, mod) - 2 * pow(9, n, mod) + pow(8, n, mod))
|
p03243 | s131625011 | Wrong Answer | l=[x for x in input()];print(max(l)*len(l)) |
p02754 | s186327410 | Accepted | n, a, b = map(int, input().split())
print((n // (a + b)) * a + min(n%(a+b), a)) |
p03962 | s932676023 | Accepted | a,b,c = input().split()
list = [a,b,c]
num = len(set(list))
print(num) |
p03086 | s449756830 | Accepted | s = input()
sum = 0
max = 0
for i in range(len(s)):
if s[i] == 'A' or s[i] == 'C' or s[i] == 'G' or s[i] == 'T':
sum += 1
else: sum = 0
if sum >= max: max = sum
print(max) |
p03416 | s584522539 | Accepted | a,b=map(int,input().split())
ans=0
for i in range(a,b+1):
s=str(i)
if s == s[::-1]:
ans+=1
print(ans)
|
p02779 | s323357697 | Accepted | n = int(input())
#a,b = map(int,input().split())
a_L = list(map(int,input().split()))
#print(a_L)
if len(a_L) == len(set(a_L)):
print("YES")
else:
print("NO")
|
p02793 | s779630633 | Accepted | import sys
input = sys.stdin.readline
import fractions
def main():
N = int(input())
A = [int(x) for x in input().split()]
MOD = 10 ** 9 + 7
x = 1
for a in A:
x = (a * x) // fractions.gcd(a, x)
ans = 0
for a in A:
ans += x // a
print(ans % MOD)
if __name__ == '__ma... |
p04005 | s371050557 | Wrong Answer | a, b, c = list(map(int, input().split()))
if a % 2 == 1 and b % 2 == 1 and c % 2 == 1:
print(b * c)
else:
print(0)
|
p02612 | s458928286 | Wrong Answer | N = int(input())
print((N // 1000 + 1) * 1000 - N) |
p03241 | s972946004 | Wrong Answer | n,m=map(int,input().split())
if n==1:
print(m)
exit()
for i in range(int(m**0.5),0,-1):
if m%i==0 and m//i>=n:
print(i)
break
|
p03994 | s126641424 | Accepted | S=list(input())
K=int(input())
N=len(S)
for i in range(N):
k=(ord('z')-ord(S[i])+1)%26
if K>=k:
S[i]='a'
K-=k
S[-1]=chr(ord(S[-1])+K%26)
print(''.join(S)) |
p03126 | s636097839 | Accepted | N,M = map(int,input().split())
A = set(list(map(int,input().split()))[1:])
for i in range(N-1):
B = set(list(map(int,input().split()))[1:])
A = A&B
print(len(A)) |
p02660 | s377208932 | Accepted | import collections
def prime_decomposition(n):
i = 2
table = []
while i * i <= n:
while n % i == 0:
n /= i
table.append(i)
i += 1
if n > 1:
table.append(n)
return table
N = int(input())
l = collections.Counter(prime_decomposition(N))
ans = 0
for p,c in l.items():
i = 1
whi... |
p02789 | s563560797 | Accepted | input_values = list(map(int, input().split()))
if input_values[0] == input_values[1]:
print("Yes")
else:
print("No") |
p02801 | s032899392 | Accepted | C = input()
# 数値(1〜26)→アルファベット(A〜Z)
num2alpha = lambda c: chr(c+64)
# アルファベット(A〜Z)→数値(1〜26)
alpha2num = lambda c: ord(c) -ord('A') + 1
i = alpha2num(C.upper()) + 1
ans = num2alpha(i)
print(ans.lower())
|
p03371 | s612395438 | Accepted | a, b, c, x, y, = map(int, input().split())
price = 10 ** 16
for i in range(10 ** 7):
price = min(price, i * 2 * c + max(0, x - i) * a + max(0, y - i) * b)
print(price) |
p02712 | s396016765 | Wrong Answer | N = int(input())
i = 1
total = 0
while i < N:
if i % 3 != 0 and i % 5 != 0:
total += i
i += 1
print(total) |
p02596 | s988886451 | Wrong Answer | ip = int(input())
ans = 7
for i in range(1,8):
if int(ans) % ip == 0:
print(i)
break
else:
ans = int(ans) * 10 + 7
i += 1
|
p03485 | s070819682 | Accepted | import math
a, b = map(int, input().split())
print(math.ceil((a + b) / 2)) |
p02657 | s959014971 | Accepted | a,b = map(int, input().split())
ans = a * b
print(ans) |
p02608 | s298165778 | Accepted | import math
n = int(input())
ans = [0] * (n + 1)
for x in range(1, int(math.sqrt(n))):
for y in range(1, int(math.sqrt(n))):
for z in range(1, int(math.sqrt(n))):
a = x * x + y * y + z * z + x * y + y * z + z * x
if n >= a >= 1:
ans[a] += 1
print(*ans[1:],sep="\n") |
p03095 | s242190240 | Accepted | from collections import Counter
N = int(input())
S = input()
MOD = 10**9 + 7
A = [0]*26
for e in S:
A[ord(e)-97] += 1
ans = 1
for e in A:
ans *= e+1
ans %= MOD
print((ans-1)%MOD)
|
p03262 | s584705254 | Accepted | from math import *
N,X=map(int,input().split())
x=sorted([X]+list(map(int,input().split())))
d=[abs(x[i+1]-x[i]) for i in range(N)]
ans=0
for i in range(N):
ans=gcd(ans,d[i])
print(ans) |
p04043 | s734326065 | Accepted | s = input().split()
s.sort()
if s[0] == '5' and s[1] == '5' and s[2] == '7':
print('YES')
else:
print('NO') |
p02888 | s412645192 | Accepted | import bisect
def resolve():
n = int(input())
l = sorted(list(map(int,input().split())))
ans = 0
for a in range(n):
for b in range(a+1,n):
c = bisect.bisect_left(l,l[a]+l[b])
if c > b:
ans += c-b-1
else:
pass
print(ans)
reso... |
p03219 | s536778702 | Accepted | #113_A
X,Y=map(int,input().split())
print(X+Y//2) |
p03327 | s643224430 | Accepted | n = int(input())
if n < 1000:
print("ABC")
else:
print("ABD") |
p04030 | s679321463 | Accepted | # coding: utf-8
s = input().rstrip()
stk = []
for i in s:
if i == "B":
if len(stk) > 0:
stk.pop()
else:
stk.append(i)
print("".join(stk))
|
p02796 | s776568276 | Accepted | import sys
N = int(sys.stdin.readline().rstrip())
sec = []
for _ in range(N):
x, l = map(int, sys.stdin.readline().rstrip().split())
sec.append((x - l, x + l))
sec = sorted(sec, key=lambda x: x[1])
r = -10**10
ans = 0
for s, t in sec:
if r <= s:
ans += 1
r = t
print(ans) |
p03524 | s345215044 | Wrong Answer | #!/usr/bin/env python3
S = list(input())
if len((set(S))) == 1 and len(S)!=1:
print('NO')
exit()
a_count = S.count('a')
b_count = S.count('b')
c_count = S.count('c')
if a_count == b_count or a_count == c_count or b_count == c_count:
print('YES')
elif a_count != b_count and a_count != c_count and a_count ... |
p03612 | s607836467 | Accepted | def main():
N = int(input())
P = [int(x) for x in input().split()]
cnt = 0
i = 0
for i in range(N):
if P[i] == i+1:
if i+1 >= N:
P[i],P[i-1] = P[i-1],P[i]
else:
P[i],P[i+1] = P[i+1],P[i]
cnt += 1
print(cnt)
if __name__ ... |
p03087 | s834988034 | Wrong Answer | n,q = map(int,input().split())
S = input()
for _ in range(q):
l,r = map(int,input().split())
A = S[l:r+1]
cnt = A.count('AC')
print(cnt)
|
p03437 | s769243279 | Accepted | import bisect, collections, copy, heapq, itertools, math, string, sys
input = lambda: sys.stdin.readline().rstrip()
sys.setrecursionlimit(10**7)
INF = float('inf')
def I(): return int(input())
def F(): return float(input())
def SS(): return input()
def LI(): return [int(x) for x in input().split()]
def LI_(): return [... |
p03075 | s639689508 | Accepted | def main():
array = []
a = int(input())
for _ in range(4):
array.append(int(input()))
k = int(input())
for p in array:
if p - a > k:
print(":(")
exit()
print("Yay!")
if __name__ == "__main__":
main()
|
p02571 | s540791587 | Accepted | s = input()
t = input()
lens = len(s)
lent = len(t)
total = 100000000
for i in range(lens-lent+1):
count = 0
for j in range(lent):
if s[i+j]!=t[j]:
count+=1
total = min(total,count)
if total == 100000000:
print(lent)
else:
print(total)
|
p03037 | s350786842 | Wrong Answer | n,m = map(int,input().split())
mn = 10**9
mx = -1
for i in range(m):
l,r = map(int,input().split())
if l > mx:
mx = l
if r < mn:
mn = r
print(abs(mx-mn)+1)
|
p03779 | s056219379 | Accepted | x = int(input())
num = 0
i = 0
while num < x:
i += 1
num += i
if (num - x) < i:
print(i) |
p03475 | s854490212 | Accepted | n = int(input())
L = [list(map(int, input().split())) for _ in range(n-1)]
for i in range(n-1):
t = 0
for j in range(i, n-1):
if t <= L[j][1]:
s = L[j][1]
else:
if t % L[j][2]:
s = t + L[j][2] - (t % L[j][2])
else:
s = t
... |
p02802 | s246202303 | Accepted | N,M=map(int,input().split())
ps_dic={}
for i in range(M):
pi,si=input().split()
if pi not in ps_dic:
ps_dic[pi]=[si]
else:
ps_dic[pi].append(si)
#print(ps_dic)
total_ac=0
total_wa=0
for p in ps_dic:
num_wa=0
for s in ps_dic[p]:
if s == "WA":
num_wa+=1
elif s == "AC":
total_ac+=... |
p03627 | s061916176 | Accepted | N = int(input())
A = list(map(int, input().split()))
A.sort(reverse=True)
a = [0] * 2
i = j = 0
while i < N - 1:
if A[i] == A[i + 1]:
a[j] = A[i]
i += 1
j += 1
if j == 2:
break
i += 1
print(a[0] * a[1])
|
p03160 | s519576239 | Accepted | #Frog1
n=int(input())
h=list(map(int,input().split()))
Min=0
dp={}
for val in range(n):
if(val==0):
dp[val]=0
if(val==1):
dp[val]=abs(h[0]-h[1])
elif(val>=2):
dp[val]=min(abs(h[val]-h[val-1])+dp[val-1],abs(h[val]-h[val-2])+dp[val-2])
print(dp[n-1])
|
p03252 | s612590991 | Accepted | s = input()
t = input()
ds = {}
dt = {}
ret = True
for i in range(len(s)):
cs = s[i]
ct = t[i]
ccs = ds.get(cs, 0)
cct = dt.get(ct, 0)
if ccs == 0:
ds[cs] = ct
elif ccs == ct:
pass
else:
ret = False
break
if cct == 0:
dt[ct] = cs
elif cct == cs:
pass
else:
... |
p02814 | s976078180 | Wrong Answer |
def main():
n, m = map(int, input().split())
aa = list(map(int, input().split()))
from fractions import gcd
from functools import reduce
def lcm(x, y):
return x * y // gcd(x, y)
l = reduce(lcm, aa)
count = (m - l//2 + 1) // l + 1
print(count)
if __name__ == "__main__":
... |
p02918 | s598703350 | Wrong Answer | N, K = map(int, input().split())
S = list(input()+"X")
temp = S[0]
cnt = 1
c_cnt = 1
ans = 0
for i in range(1, N+1):
if temp == S[i]:
cnt += 1
else:
ans += cnt - 1
cnt = 1
c_cnt += 1
temp = S[i]
#print(ans, cnt, c_cnt, temp)
#最後の余計な分
c_cnt -= 1
if c_cnt//2 < K:
ans += (c_cnt//2) * 2
elif... |
p02854 | s892353464 | Wrong Answer | N = int(input())
A = list(map(int, input().split()))
ans = 10**8
for i in range(N-1):
bar1 = (A[0:i+1])
bar2 = (A[i+1:])
if abs(sum(bar2) - sum(bar1)) <= ans:
ans = abs(sum(bar2) - sum(bar1))
print(ans) |
p03998 | s889993363 | Accepted | a=input()
b=input()
c=input()
s="a"
for i in range(len(a)+len(b)+len(c)):
if s=="a" and len(a)>0:
s=a[0]
a=a[1:]
elif s=="a" and len(a)==0:
print("A")
exit()
elif s=="b" and len(b)>0:
s=b[0]
b=b[1:]
elif s=="b" and len(b)==0:
print("B")
exit()
elif s=="c" and len(c)>0:
s=c[... |
p03250 | s105907456 | Wrong Answer | a,b,c = map(int, raw_input().split(' '))
print max(10*a + b, 10*b + c) |
p03632 | s920578014 | Wrong Answer | a, b, c, d = map(int, input().split())
if b < c :
print(0)
exit()
if a == 0 and b > c and b < d:
print(b - c)
exit()
if a < c and d < b:
print(d - c)
exit()
|
p02602 | s000409376 | Accepted | import sys
sys.setrecursionlimit(1000000)
import bisect
import math
import collections
import heapq
def solve(N, K, As):
ans = []
for i in range(N-K):
left_a = As[i]
right_a = As[i+K]
if left_a < right_a:
ans.append("Yes")
else:
ans.append("No")
r... |
p04012 | s797777535 | Wrong Answer | w = input()
for i in range(ord('a'), ord('z') + 1):
c = str(i)
if w.count(c) % 2 == 1:
print('No')
break
else:
print('Yes')
|
p03075 | s173665792 | Accepted | min_x = 123
max_x = 0
for _ in range(5):
x = int(input())
if x <= min_x:
min_x = x
if x >= max_x:
max_x = x
k = int(input())
if k < max_x-min_x:
print(":(")
else:
print("Yay!") |
p02682 | s467643531 | Accepted | a, b, c, k = map(int, input().split())
sum = 0
if k > a:
sum += a
k -= a
if k > b:
k -= b
if k > c:
sum -= c
else:
sum -= k
else:
sum += k
print(sum) |
p02989 | s386834034 | Wrong Answer | N=int(input())
d=[int(s) for s in input().split(" ")]
d.sort()
if (N//2)%2==0:
print(0)
else:
K=d[(N//2)]-d[N//2-1]
print(K) |
p02832 | s247644380 | Wrong Answer | N=int(input())
a=list(map(int,input().split()))
ans=0
l=1
for i in a:
if i!=l:
ans+=1
else:
l+=1
if ans==0:
print("-1")
else:
print(ans) |
p03408 | s367382353 | Accepted | n=int(input())
s=list(input() for i in range(n))
m=int(input())
t=list(input() for j in range(m))
l=list(set(s))
ans=max(0,max(s.count(l[k])-t.count(l[k]) for k in range(len(l))))
print(ans) |
p03126 | s463396803 | Accepted | N,M = map(int,input().split())
l = [list(map(int,input().split())) for i
in range(N)]
for i in range(N):
del l[i][0]
for i in range(N-1):
a = set(l[i])&set(l[i+1])
l[i+1] = a
if N==1:
print(len(l[0]))
else:
print(len(a)) |
p04019 | s734103899 | Accepted | import collections
def main():
s = list(input())
c = collections.Counter(s)
keys = list(c.keys())
print("Yes" if ((keys.count("S") == 0 and keys.count("N") == 0) or (keys.count("S") == 1 and keys.count("N") == 1)) and (
(keys.count("E") == 0 and keys.count("W") == 0) or (keys.count("E") == 1 a... |
p02689 | s825887793 | Wrong Answer | NM =input().split()
N = int(NM[0])
M = int(NM[1])
H = input().split()
Nout = [1] * N
for i in range(M):
road = input().split()
if float(H[int(road[0]) - 1]) < float(H[int(road[1]) - 1]):
Nout[int(road[0]) - 1] = 0
else:
Nout[int(road[1]) - 1] = 0
def calc():
j = 0
for i in Nout:
j += i
return j
print(calc()... |
p03435 | s669298713 | Accepted | c=[list(map(int,input().split())) for _ in range(3)]
for i in range(3):
for j in range(3):
if c[i][j]!=c[i][(j+1)%3]+c[(i+1)%3][j]-c[(i+1)%3][(j+1)%3]:
print('No')
exit()
print('Yes') |
p03565 | s409520142 | Wrong Answer | S = input()
T = input()
ans = []
for index, s in enumerate(S):
if s == '?' or s == T[0]:
if index+len(T)-1 > len(S)-1:
break
for indexs, t in enumerate(T):
if S[index+indexs] != t and S[index+indexs] != '?':
break
else:
ans.append(S[0:index]+T+S[index+len(T):])
print(ans)
i... |
p02677 | s133179039 | Accepted | import math
# A, B, H, M = 3, 4, 9, 0
A, B, H, M = map(int, input().split())
deg = 0
deg += 5.5 * M
deg -= 30 * H
print(math.sqrt(A**2 + B**2 - 2*A*B* math.cos(math.radians(abs(deg))))) |
p02859 | s059800959 | Wrong Answer | r = int(input())
x = int (3.14 * (r ** 2) / 3.14)
print(x) |
p02582 | s548876607 | Accepted | S=list(input())
ans=0
for i in range(len(S)):
if ans==0 and S[i]=="R":
ans=1
for i in range(len(S)-1):
if S[i]=="R" and S[i+1]=="R":
ans+=1
print(ans)
|
p03407 | s972265912 | Accepted | a,b,c=map(int,input().split())
if a+b>=c:
print('Yes')
else:
print('No') |
p02823 | s564976848 | Wrong Answer | N,A,B=map(int,input().split())
if((A-B)%2==0):
print(abs(A-B)//2)
else:
print(min(B-1,N-A-1)) |
p04045 | s115385419 | Wrong Answer | n,k = map(int,input().split())
if k == 0:
print(n)
exit()
dislike = list(map(int,input().split()))
ref = [0,1,2,3,4,5,6,7,8,9,0]
for i in range(10):
while ref[i] in dislike:
ref[i] = (ref[i]+1)%10
ans = ''
for i in str(n):
ans += str(ref[int(i)])
if int(ans)<n:
ans = str(ref[1])+str(ref[0])*len(str(n))... |
p03071 | s093655412 | Accepted | a,b=map(int,input().split())
c=0
for i in range(2):
if a>=b:
c+=a
a-=1
else:
c+=b
b-=1
print(c)
|
p02792 | s002658222 | Accepted | import sys
from pprint import pprint
def solve(n):
c = [[0 for i in range(10)] for j in range(10)]
for i in range(1, n+1):
str_i = str(i)
len_i = len(str_i)
c[int(str_i[len_i-1])][int(str_i[0])] += 1
ans = 0
for i in range(10):
for j in range(10):
ans += c[i]... |
p03351 | s460174177 | Accepted | a,b,c,d=map(int,input().split())
flag=False
if abs(a-c)<=d:
flag=True
elif abs(a-b)<=d and abs(c-b)<=d:
flag=True
if flag:
print("Yes")
else:
print("No") |
p03962 | s233822081 | Accepted | l = list(set(list(map(int, input().split()))))
print(len(l)) |
p03095 | s845817514 | Accepted | import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")
n = int(input())
s = input()
from collections import Counter
c = Counter(s)
M = 10**9+7
ans = 1
for k,v in c.items():
ans *= (v+1)
ans %= M
ans -= 1
print(ans%M) |
p02711 | s350719303 | Accepted | n = int(input())
s = list(str(n))
if s[0]=="7" or s[1]=="7" or s[2]=="7":
print("Yes")
else:
print("No") |
p02866 | s678588518 | Accepted | n = int(input())
D = list(map(int, input().split()))
if D[0] != 0:
print(0)
exit()
A = [0]*n
for i in range(n):
A[D[i]] += 1
#print(A)
if A[0] != 1:
print(0)
exit()
ans = 1
mod = 998244353
for i in range(1, n):
ans *= A[i-1]**A[i]
ans %= mod
print(ans)
|
p03379 | s613439037 | Wrong Answer | N = int(input())
X = list(map(int, input().split()))
X_sort = sorted(X)
# print(X_sort)
middle_left = X_sort[N//2-1]
middle_right = X_sort[N//2]
# print(middle_left, middle_right)
for idx, x in enumerate(X):
if idx <= N//2-1:
if middle_right != x:
print(middle_right)
else:
... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.