problem_id
stringclasses 428
values | submission_id
stringlengths 10
10
| status
stringclasses 2
values | code
stringlengths 5
816
|
|---|---|---|---|
p03487
|
s845325147
|
Accepted
|
N=int(input())
A=list(map(int, input().split()))
from collections import Counter
B=Counter(A)
ans=0
for k, v in B.items():
if int(k)>v:
ans+=v
else:
ans+=v-int(k)
print(ans)
|
p03427
|
s041160950
|
Wrong Answer
|
n=input()
if len(n)==1:
print(int(n))
elif n[0]!="1" and n[0]!="9":
print((len(n)-1)*9+int(n[0])-1)
elif n[0]=="1":
if all(i=="9" for i in n[1:]):
print((len(n)-1)*9+int(n[0]))
else:
print((len(n)-1)*9)
elif n[0]=="9":
print((len(n)-1)*9+int(n[1])-1)
|
p04030
|
s118268166
|
Wrong Answer
|
S = input()
Z = []
X = len(S)
i = 0
while i < X :
if S[i] == "0":
Z.append(0)
elif S[i] == "1":
Z.append(1)
elif S[i] == "B":
if len(Z)<= 1:
pass
else:
Z.pop()
i += 1
i = 0
X = len(Z)
while i < X:
print(Z[i] , end ="")
i +=1
|
p02730
|
s837016225
|
Wrong Answer
|
wholeString = input()
firstSub = wholeString[0:int((len(wholeString)-1)/2)]
secondSub = wholeString[int(((len(wholeString)+3)/2)-1):]
if len(wholeString) % 2 == 0 or len(wholeString) < 3 or len(wholeString) > 99:
print("No")
if firstSub == firstSub[::-1] and secondSub == secondSub[::-1]:
print("Yes")
else:
print("No")
|
p03293
|
s388047647
|
Accepted
|
s=input()
t=input()
def change(s):
u=str()
for i in range(len(s)):
if i==0:
u+=s[len(s)-1]
else:
u+=s[i-1]
return u
flag=False
if(s==t):
flag=True
for i in range(len(s)-1):
s=change(s)
#print(s)
if(s==t):
flag=True
break
if(flag==False):
print("No")
else:
print("Yes")
|
p02699
|
s209497092
|
Accepted
|
s, w = map(int, input().split())
if s <= w:
print('unsafe')
else:
print('safe')
|
p02629
|
s202062518
|
Accepted
|
n = int(input())
s = 'abcdefghijklmnopqrstuvwxyz'
ans = ''
while n > 0:
n -= 1
q, r = divmod(n, 26)
ans += s[r]
n = q
print(ans[::-1])
|
p03612
|
s854658176
|
Accepted
|
N = int(input())
p = list(map(int, input().split()))
ans = 0
for i in range(N-1):
if p[i] != i+1:
continue
tmp = p[i]
p[i] = p[i+1]
p[i+1] = tmp
ans += 1
if p[N-1] == N:
ans += 1
print(ans)
|
p02731
|
s422558739
|
Accepted
|
l = int(input())
print((l/3)**3)
|
p02657
|
s374847656
|
Accepted
|
import sys
A,B = map(int, sys.stdin.readline().split())
print(A * B)
|
p03067
|
s734995414
|
Accepted
|
a,b,c=map(int,input().split())
if a <=c <=b:
print('Yes')
elif a >= c >= b:
print('Yes')
else:
print('No')
|
p02598
|
s988077311
|
Accepted
|
#abc174_e
n,k=map(int,input().split())
a=[int(i) for i in input().split()]
ok=1001001001
ng=0
def check(x):
cnt=0
for q in a:
cnt+=(q-1)//x
return cnt<=k
while ok-ng>1:
mid=(ok+ng)//2
if check(mid):
ok=mid
else:
ng=mid
print(ok)
|
p03723
|
s934396907
|
Accepted
|
a, b, c = map(int, input().split())
i = 0
while True:
if a % 2 == 1 or b % 2 == 1 or c % 2 == 1:
print(i)
break
elif a == b == c:
print(-1)
break
a_h = a / 2
b_h = b / 2
c_h = c / 2
a = b_h + c_h
b = a_h + c_h
c = a_h + b_h
i += 1
|
p02836
|
s988532749
|
Accepted
|
S = input()
letter = list(S)
if len(S) % 2 != 0:
CentChara = len(S) // 2
del letter[CentChara]
num = int(len(letter) / 2)
count = 0
bakcount = -1
fail = 0
for dif in range(num):
PreChara = letter[count]
BakChara = letter[bakcount]
if PreChara != BakChara:
fail += 1
count += 1
bakcount += -1
print(fail)
|
p02683
|
s867008813
|
Accepted
|
import numpy as np
import itertools
N,M,X = list(map(int, input().split()))
book_matrix = [list(map(int, input().split())) for _ in range(N)]
bit_matrix = itertools.product(range(2), repeat = N)
arr_book_matrix = np.array(book_matrix)
arr_bit_matrix = np.array(list(bit_matrix))
arr_ans_matrix = np.dot(arr_bit_matrix, arr_book_matrix)
ans_matrix = arr_ans_matrix.tolist()
ans = 100000 * 20
for ans_vector in ans_matrix:
if(min(ans_vector[1:]) >= X):
ans = min(ans, ans_vector[0])
if(ans == 100000 * 20):
print(-1)
else:
print(ans)
|
p03720
|
s348963492
|
Accepted
|
N,M = map(int,input().split())
rs = [0]*N
for i in range(M):
a, b = map(int, input().split())
rs[a-1]+=1
rs[b - 1] += 1
for r in rs:
print(r)
|
p02881
|
s308858050
|
Wrong Answer
|
import math
N = int(input())
a = 1
b = 1
ran = int(math.ceil(math.sqrt(N)))
m = 1
for i in range(1,ran):
if N%i == 0:
if i > m:
m = i
print(int(m + N/m -2))
|
p02707
|
s319249850
|
Wrong Answer
|
from collections import Counter
def main():
N=int(input())
A=list(map(int,input().split()))
d=Counter(A)
for i in range(1,N+1):
if i not in d:
print(0)
else:
print(d[1])
if __name__=='__main__':
main()
|
p02675
|
s331625161
|
Accepted
|
N = int(input())
n = N % 10
hon = (2,4,5,7,9)
pon = (0,1,6,8)
bon = (3,)
if n in hon:
print('hon')
elif n in pon:
print('pon')
else:
print('bon')
|
p03251
|
s644118552
|
Accepted
|
n,m,x,y = map(int,input().split())
xl = list(map(int,input().split()))+[x]
yl = list(map(int,input().split()))+[y]
if max(xl)+1<=min(yl):
print("No War")
else:
print("War")
|
p02760
|
s591815659
|
Wrong Answer
|
# Bingo
A = []
for _ in range(3):
A += list(map(int, input().split()))
N = int(input())
for _ in range(N):
b = int(input())
if b in A:
A[A.index(b)] = -1
# check
diag = (sum(A[0::4]) == -3) | (sum(A[2:8:2]) == -3)
rows = (sum(A[:3]) == -3) | (sum(A[4:6]) == -3) | (sum(A[6:]) == -3)
cols = (sum(A[:7:3]) == -3) | (sum(A[1:8:3]) == -3) | (sum(A[2::3]) == -3)
ans = diag | rows | cols
print(['No', 'Yes'][ans])
|
p02831
|
s307475937
|
Accepted
|
from fractions import gcd
A, B = map(int, input().split())
print(A*B//gcd(A,B))
|
p02641
|
s249910142
|
Wrong Answer
|
def main():
x, n = map(int, input().split())
p = list(map(int, input().split()))
_near = -1
for i in range(101):
if i in p:
continue
if abs(_near - x) > abs(i - x):
_near = i
print(_near)
if __name__ == "__main__":
main()
|
p02702
|
s360051641
|
Accepted
|
S = list(map(int, list(input())))
MOD = 2019
mods = [0 for _ in range(2019)]
mods[0] = 1
num = 0
digit = 1
for s in S[::-1]:
num = s * digit + num
num %= MOD
mods[num] += 1
digit = (digit * 10) % MOD
ans = 0
for m in mods:
ans += m * (m - 1) // 2
print(ans)
|
p02971
|
s098851366
|
Accepted
|
n = int(input())
a = [int(input()) for i in range(n)]
b = sorted(a)
for A in a:
if A == b[n - 1]:
print(b[n - 2])
else:
print(b[n - 1])
|
p03639
|
s039360903
|
Accepted
|
N = int(input())
A = list(map(int, input().split()))
resZero = 0
resTwo = 0
odds = 0
for a in A:
if a % 4 == 0:
resZero += 1
continue
elif a % 4 == 2:
resTwo += 1
continue
else:
odds += 1
if resZero - odds >= -1 and resTwo == 0:
print('Yes')
quit()
if resZero - odds >= 0:
print('Yes')
quit()
print('No')
|
p02847
|
s424211578
|
Accepted
|
W = [ "SUN","MON","TUE","WED","THU","FRI","SAT" ]
S = input()
for i in range(len(W)):
if W[i]==S :
break
print( 7-i )
|
p03324
|
s285912260
|
Wrong Answer
|
D,N = map(int, input().split())
cnt = 0
num = 1
while True:
tmp = num
flag = True
for _ in range(D):
if tmp % 100 == 0:
tmp //= 100
else:
flag = False
if flag:
cnt += 1
if cnt == N:
break
num += 1
print(num)
|
p02790
|
s960374029
|
Accepted
|
a, b = map(int, input().split())
ab = int(str(a)*b)
ba = int(str(b)*a)
m = max(ab, ba)
print(str(m))
|
p03474
|
s679240476
|
Accepted
|
A,B =map(int,input().split())
S = input()
if S[A] == '-' and S.count('-') == 1:
print('Yes')
else:
print('No')
|
p02753
|
s817160351
|
Accepted
|
s = input()
if s == 'AAA' or s == 'BBB':
print('No')
else:
print('Yes')
|
p03524
|
s061957916
|
Accepted
|
s = input()
n = len(s)
dic = {}
for i in range(n):
if s[i] in dic:
dic[s[i]] += 1
else:
dic[s[i]] = 1
if len(dic) == 1:
if n == 1:
print('YES')
else:
print('NO')
elif len(dic) == 2:
if n == 2:
print('YES')
else:
print('NO')
else:
maxi = max(dic.values())
mini = min(dic.values())
if maxi - mini <= 1:
print('YES')
else:
print('NO')
|
p03544
|
s019617857
|
Wrong Answer
|
n=int(input())
a=2
b=1
if n==1:
n=2
for i in range(n-1):
nn = a+b
ans=nn
a=b
b=nn
if n==1:
ans = 1
print(ans)
|
p02836
|
s494074876
|
Wrong Answer
|
s = input()
i = len(s) // 2
flont = 0
back = -1
miss = 0
for n in range(i):
if s[flont] != s[back]:
miss += 1
print(miss)
|
p02814
|
s836675726
|
Accepted
|
def count(x):
count = 0
while x % 2 == 0:
x //= 2
count += 1
return count
def lcm(l):
from fractions import gcd
x = l[0]
for i in range(1, len(l)):
x = (x * l[i]) // gcd(x, l[i])
return x
N, M = map(int, input().split())
A = set(map(int, input().split()))
ans = 0
if len(set(map(count, A))) == 1:
T = lcm(list(map(lambda x: x // 2, A)))
ans = -(-(M // T) // 2)
print(ans)
|
p02577
|
s033261879
|
Accepted
|
n = input()
l = []
for i in range(len(n)):
l.append(int(n[i]))
if sum(l)%9 == 0:
print('Yes')
else:
print('No')
|
p03327
|
s587178671
|
Accepted
|
n=int(input())
if n < 1000:
print("ABC")
else:
print("ABD")
|
p04020
|
s028241830
|
Accepted
|
n=int(input())
a=[int(input()) for i in range(n)]
a+=[0]
ans=0
for i in range(n):
pair=a[i]//2
ans+=pair
a[i]-=2*pair
if a[i]>0 and a[i+1]>0:
ans+=1
a[i]-=1
a[i+1]-=1
print(ans)
|
p02719
|
s547889315
|
Accepted
|
n, k = map(int, input().split())
ans1 = n % k
ans2 = abs(ans1 - k)
if ans1 < ans2:
print(ans1)
else:
print(ans2)
|
p03243
|
s513482244
|
Accepted
|
N=int(input())
x=-(-N//111)
print(100*x + 10*x + x)
|
p02860
|
s867208421
|
Accepted
|
N=int(input())
S=str(input())
if N%2==1:
print('No')
else:
if S[:N//2]==S[-N//2:]:
print('Yes')
else:
print('No')
|
p03611
|
s503451560
|
Accepted
|
from collections import defaultdict
def main():
N = int(input())
a = list(map(int, input().split()))
d = defaultdict(int)
for aa in a:
for i in range(-1, 2):
d[aa+i] += 1
ans = 0
for k in d:
if d[k] > ans:
ans = d[k]
print(ans)
if __name__ == "__main__":
main()
|
p02993
|
s304370039
|
Accepted
|
S = input()
if S[0] == S[1] or S[1] == S[2] or S[2] == S[3]:
print('Bad')
else:
print('Good')
|
p03767
|
s903528602
|
Wrong Answer
|
N = int(input())
A = list(map(int, input().split()))
A.sort(reverse=True)
print(A)
sum=0
for i in range(2*N):
if i%2==1:
sum+=A[i]
print(sum)
|
p03073
|
s783833867
|
Accepted
|
def main():
S = list(input())
lenS = len(S)
pt1 = ['0', '1'] * (lenS//2) + ['0']*(lenS%2==1)
pt2 = ['1', '0'] * (lenS//2) + ['1']*(lenS%2==1)
cnt1 = 0; cnt2 = 0
for i in range(lenS):
cnt1 += (pt1[i]!=S[i])
cnt2 += (pt2[i]!=S[i])
print(min(cnt1, cnt2))
if __name__ == "__main__":
main()
|
p02725
|
s098431936
|
Accepted
|
K,N=map(int,input().split())
A=list(map(int,input().split()))
l=[]
A.append(A[0]+K)
for i in range(N):
l.append(A[i+1]-A[i])
print(K-max(l))
|
p03281
|
s104296782
|
Wrong Answer
|
def yakusu(x):
A=[]
for i in range(1,x+1):
if x%i==0:
A.append(i)
return(len(A))
n=int(input())
ans=0
for j in range(1,n+1):
if yakusu(n)==8:
ans+=1
print(ans)
|
p02899
|
s407079485
|
Accepted
|
import numpy as np
N = int(input())
A = list(map(int,input().split()))
print(*(np.argsort(A)+1))
|
p03698
|
s795023056
|
Wrong Answer
|
s = input()
list = []
for i in s:
list.append(i)
for j in list:
if j in s:
print('no')
break
print('yes')
|
p02780
|
s390963338
|
Wrong Answer
|
nk = list(map(int, input().split()))
p = list(map(int, input().split()))
s=0
summo=0
l = []
for i in range(1,1001):
s += i
l.append(s/i)
for i in range(nk[1]):
summo += l[p[i]-1]
now = 0
for i in range(nk[0]-nk[1]):
now = summo-l[p[i]-1]+l[p[nk[1]+i]-3]
if summo<=now:
summo = now
print(summo)
|
p03095
|
s793499891
|
Wrong Answer
|
from collections import Counter
n = int(input())
s = [i for i in input()]
cnt = Counter(s)
l = len(cnt)
val = list(cnt.values())
val = [i + 1 for i in val if i != 1]
ans = 2**(l-len(val))
for vi in val: ans *= vi
print(ans - 1)
|
p02629
|
s999424008
|
Accepted
|
import sys
import math
def II():
return int(sys.stdin.readline())
def LI():
return list(map(int, sys.stdin.readline().split()))
def MI():
return map(int, sys.stdin.readline().split())
def SI():
return sys.stdin.readline().strip()
n = II()
ans = ""
while(n>0):
ans+=chr(96+n%26) if n%26>0 else 'z'
if n%26 == 0:
n//=26
n-=1
else:
n//=26
print(ans[:][::-1])
|
p02602
|
s716319873
|
Wrong Answer
|
N,K=map(int,input().split())
A=list(map(int,input().split()))
S=[1]
P=20988936657440586486151264256610222593863921
for n in range (N):
if n<K:
S.append((A[n]*S[-1])%P)
else:
S.append(((A[n]*S[-1])%P)/A[n-K])
for i in range (K+1,N+1):
if S[i]>S[i-1]:
print('Yes')
else:
print('No')
|
p02779
|
s406523269
|
Wrong Answer
|
from collections import defaultdict
n = int(input())
d = defaultdict(int)
A = list(map(int,input().split()))
for a in A:
if d[a] == 1:
print('No')
exit()
else:
d[a] += 1
print('Yes')
|
p03017
|
s455472191
|
Wrong Answer
|
import re
N, A, B, C, D = map(int, input().split())
S = input()
flag = True
#if re.search(r'##', S[min([A,B]): max([C,D])+1]):
# flag *= False
if C < D:
if re.search(r'\.\.', S[B:C+1]):
flag *= True
else:
flag *= False
else:
if re.search(r'\.\.\.', S[B:D+1]):
flag *= True
else:
flag *= False
print('Yes') if flag else print('No')
|
p03605
|
s418671212
|
Accepted
|
N = str(input())
if N[0] == '9' or N[1] == '9':
print('Yes')
else:
print('No')
|
p03627
|
s913248344
|
Accepted
|
import collections
N = int(input())
A = map(int, input().split())
A_count = dict(collections.Counter(A))
A_countsort = sorted(A_count, reverse=True)
# print(A_countsort)
hen_list = []
for key in A_countsort:
if A_count[key] >= 4:
hen_list.append(key)
hen_list.append(key)
elif A_count[key] >= 2:
hen_list.append(key)
if len(hen_list) >= 2:
print(hen_list[0]*hen_list[1])
else:
print(0)
|
p02697
|
s875139148
|
Accepted
|
n, m = map(int, input().split())
if n % 2 == 1:
for i in range(m):
print(1+i, n-1-i)
else:
for i in range(m):
if i % 2 == 0:
print(n//2-i//2, n//2+1+i//2)
else:
print(1+i//2, n-1-i//2)
|
p02627
|
s540236250
|
Accepted
|
a = input()
if a.islower():
print("a")
else:
print("A")
|
p02624
|
s269789172
|
Accepted
|
n = int(input())
ans = 0
def num_divisors_table(n):
table = [0] * (n + 1)
for i in range(1, n + 1):
for j in range(i, n + 1, i):
table[j] += 1
return table
t = num_divisors_table(n)
for i in range(1,n+1):
ans += t[i]*i
print(ans)
|
p03309
|
s715520256
|
Wrong Answer
|
import numpy as np
n = int(input())
a = [int(i)- k-1 for k,i in enumerate(input().split())]
ans = 10**9
a = np.array(a,dtype = 'int64')
sum_a = np.sum(a)
var_f = np.floor(sum_a / n)
var_c = np.ceil(sum_a / n)
b = a - int(var_f)
d = a - int(var_c)
c = np.abs(b)
e = np.abs(d)
print(min(np.sum(c),np.sum(e)))
|
p03319
|
s729779216
|
Wrong Answer
|
import math
n,k = map(int, input().split())
a = list(map(int, input().split()))
loc = a.index(1) + 1
upper = math.ceil((n - loc) / (k - 1))
lower = math.ceil((loc - 1) / (k - 1))
print(upper + lower)
|
p02761
|
s667542552
|
Accepted
|
n, m = map(int, input().split())
scs = [tuple(map(int, input().split())) for _ in range(m)]
mi = 0
if 2 <= n:
mi += 10 ** (n - 1)
ma = 10 ** n
ans = -1
for i in range(mi, ma):
st = str(i)
tmp = True
for j in range(m):
if (int(st[scs[j][0] - 1]) != scs[j][1]):
tmp = False
if tmp:
ans = i
break
print(ans)
|
p02583
|
s254943712
|
Wrong Answer
|
N = int(input())
L = list(map(int, input().split()))
L.sort()
cnt = 0
for i in range(N):
Li = L[i]
for j in range(N):
Lj = L[j]
if Li != Lj:
for k in range(N):
Lk = L[k]
if Lk != Lj and Lk != Li:
if Lk < Li + Lj:
cnt += 1
print(cnt)
|
p03109
|
s414331893
|
Accepted
|
s = input()
if int(s[5:7]) <= 4 and int(s[8:10]) <= 30:
print('Heisei')
else:
print('TBD')
|
p02779
|
s441755985
|
Accepted
|
N = int(input())
A = list(map(int, input().split()))
A_set = set(A)
if len(A) == len(A_set):
print('YES')
else:
print('NO')
|
p02712
|
s738757383
|
Wrong Answer
|
# -*- coding: utf-8 -*-
N = int(input())
sum = 266666333332
for i in range(N):
if(i % 3 != 0 and i % 5 != 0):
sum += i
print(sum - 266666333332)
|
p02957
|
s894315731
|
Wrong Answer
|
A, B = map(int, input().split())
if A % 2 != B % 2:
print("IMPOSSIBLE")
elif A >= B:
print(A - int((A + B) / 2))
else:
print(B - int((A + B) / 2))
|
p03773
|
s369149185
|
Accepted
|
A, B = map(int, input().split())
ans = (A+B) % 24
print(ans)
|
p02935
|
s296672706
|
Wrong Answer
|
N = int(input())
a = map(int, input().split())
# N = 3
# a = [200, 300, 500]
s = sorted(a)
t = 0
result = 0
if len(s) == 1:
result = s[0]
for i in range(0, N-1):
if i == N - (N - 1):
result = (t + s[i+1]) / 2
z = (s[i] + s[i+1]) / 2
t = z
print(result)
|
p02983
|
s009599324
|
Accepted
|
L, R = map(int, input().split())
ans = 10 ** 9
for i in range(L, R):
for j in range(i+1, R+1):
tmp = (i*j)%2019
if ans > tmp:
ans = tmp
if ans == 0:
break
else:
continue
break
print(ans)
|
p02744
|
s402998194
|
Accepted
|
n = int(input())
ans_b = []
ans_n = ['a']
s = ['a','b','c','d','e','f','g','h','i','j']
for i in range(1,n):
ans_b = ans_n.copy()
ans_n = []
for j in ans_b:
plus = 1
ans_n.append(j+'a')
while( j.count(s[plus-1]) > 0):
ans_n.append(j+ s[plus])
plus += 1
ans = sorted(ans_n)
for i in ans:
print(i)
|
p03077
|
s761909293
|
Accepted
|
n = int(input())
min = float('inf')
for _ in range(5):
i = int(input())
if min > i:
min = i
if n % min == 0:
ans = n // min + 4
else:
ans = n // min + 5
print(ans)
|
p03254
|
s142438886
|
Accepted
|
N, x = map(int, input().split())
a = list(map(int, input().split()))
a = sorted(a)
M = []
cn = 0
for i in range(N):
x = x - a[i]
if x >= 0 and i != N-1:
cn = cn + 1
elif x < 0:
print(cn)
break
elif i == N-1:
if x == 0:
cn = cn + 1
print(cn)
break
else:
print(cn)
break
|
p02661
|
s800404326
|
Accepted
|
N = int(input())
L = list()
As, Bs= list(),list()
for i in range(N):
A,B = map(int,input().split())
L.append([A,B])
As.append(A)
Bs.append(B)
As.sort()
Bs.sort()
if N % 2 == 0:
mins = (As[N//2] + As[N//2-1]) / 2.0
maxs = (Bs[N//2] + Bs[N//2-1]) / 2.0
print(int((maxs-mins)/0.5)+1)
else:
mins,maxs = As[N//2], Bs[N//2]
print(int(maxs-mins)+1)
|
p03657
|
s859939895
|
Wrong Answer
|
a, b = map(int, input().split())
A = a + b
if A%3== 0:
print('Possible')
else:
print('Impossible')
|
p02987
|
s772900525
|
Accepted
|
def main():
s=input()
flg=0
if s.count(s[0])!=2:
flg=1
s=s.replace(s[0],'')
if len(s)>0 and s.count(s[0])!=2:
flg=1
if flg==1:
print('No')
else:
print('Yes')
main()
|
p03804
|
s919027721
|
Accepted
|
import numpy as np
N,M=map(int,input().split())
A=np.array([list(input()) for _ in range(N)])
B=np.array([list(input()) for _ in range(M)])
bl=False
for i in range(N-M+1):
for j in range(N-M+1):
if (A[i:i+M,j:j+M]==B).all():
bl=True
answer='Yes' if bl else 'No'
print(answer)
|
p02729
|
s340265940
|
Accepted
|
from itertools import combinations
N,M = map(int,input().split())
a= list(combinations(range(N),2))
b= list(combinations(range(M),2))
print(len(a)+len(b))
|
p02922
|
s976661172
|
Accepted
|
import math
A,B = map(int,input().split())
print(math.ceil((B - A) / (A - 1)) + 1)
|
p03136
|
s940604974
|
Wrong Answer
|
number = int(input())
sides = [int(val) for val in input().split(' ')]
print(sum(sides))
print(max(sides))
|
p03672
|
s685323667
|
Accepted
|
s = list(input())
ans = 0
if len(s)%2==0:
s = s[:-2]
else:
s.pop(-1)
while len(s)>0:
if s[0:int(len(s)/2)]==s[int(len(s)/2):len(s)]:
ans = len(s)
break
else:
s = s[:-2]
print(ans)
|
p03126
|
s357371891
|
Accepted
|
n,m = map(int,input().split())
ans = []
l = []
for i in range(n):
if i == 0:
ans = list(map(int,input().split()))
ans.pop(0)
else:
l = list(map(int,input().split()))
l.pop(0)
ans = set(ans) & set(l)
print (len(ans))
|
p03126
|
s392576969
|
Accepted
|
n,m=map(int,input().split())
mist=[0 for i in range(m)]
for j in range(n):
temp=list(map(int,input().split()))
for s in range(1,len(temp)):
mist[temp[s]-1]+=1
ans=sum(1 for x in mist if x==n)
print(ans)
|
p03815
|
s138804218
|
Accepted
|
x = int(input())
ans = (x // 11) * 2
if x % 11 > 6:
ans += 2
elif x % 11:
ans += 1
print(ans)
|
p02677
|
s744703870
|
Wrong Answer
|
import numpy as np
A, B, H, M = map(int, input().split())
a = (30 * (H + M / 60)) % 360
b = (360 * (H + M / 60)) % 360
r = abs(a - b)
deg = r if r < 180 else r - 180
l = 2 * np.sin((np.pi / 180 * deg)/2)
diff = abs(A - B)
ans = diff ** 2 + A * B * (l ** 2)
print(np.sqrt(ans))
|
p03821
|
s144362816
|
Accepted
|
n = int(input())
ab = [list(map(int, input().split())) for _ in range(n)]
ans = 0
for a, b in ab[::-1]:
if (a + ans) % b == 0:
continue
ans += b - (a + ans) % b
print(ans)
|
p03612
|
s501332389
|
Accepted
|
N = int(input())
p = list(map(int, input().split()))
skip = False
ans = 0
for i, a in enumerate(p):
i = i + 1
if skip:
skip = False
continue
if i == a:
ans += 1
skip = True
print(ans)
|
p03076
|
s658329508
|
Wrong Answer
|
import math
a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
s = [a%10,b%10,c%10,d%10,e%10]
g = max(s)
for i in range(len(s)):
if s[i]:
g = min(g,s[i])
k = [a,b,c,d,e]
for i in range(len(k)):
k[i] = math.ceil(k[i]/10)*10
print(sum(k)+g-10)
|
p02731
|
s606105022
|
Accepted
|
l=int(input())
print((l/3)**3)
|
p03971
|
s615001713
|
Wrong Answer
|
n,a,b=map(int,input().split())
s=input()
count_ab=0
count_b=0
for i in range(len(s)):
if s[i]=='c':
print('No')
elif s[i]=='b' and count_b<=b and count_ab<=b:
print('Yes')
count_b+=1
count_ab+=1
elif s[i]=='a' and count_ab<a+b:
print('Yes')
count_ab+=1
else:
print('No')
|
p03543
|
s063202146
|
Accepted
|
N = input()
print("Yes" if N[0]==N[1]==N[2] or N[1]==N[2]==N[3] else "No")
|
p02687
|
s384587055
|
Accepted
|
import sys
readline = sys.stdin.buffer.readline
def even(n): return 1 if n%2==0 else 0
s = readline().rstrip().decode('utf-8')
if s == "ABC":
print("ARC")
else:
print("ABC")
|
p02768
|
s397347700
|
Accepted
|
n, a, b = map(int, input().split())
mod = 10 ** 9 + 7
total = (pow(2, n, mod) - 1) % mod
def fast_nCr(n, r):
upper = 1
for i in range(n - r + 1, n + 1):
upper = upper * i % mod
below = 1
for i in range(1, r + 1):
below = below * i % mod
ans = upper * pow(below, mod - 2, mod) % mod
return ans % mod
A = fast_nCr(n, a)
B = fast_nCr(n, b)
ans = (total - A - B) % mod
print(ans)
|
p03103
|
s586187605
|
Accepted
|
N,M=map(int,input().split())
AB=[[int(i) for i in input().split()] for i in range(N)]
ans=0
m=0
AB.sort()
for i in range(N):
if m==M:
break
if m+AB[i][1]>=M:
for j in range(AB[i][1]):
ans +=AB[i][0]
m +=1
if m==M:
break
else:
ans += AB[i][0]*AB[i][1]
m=m+AB[i][1]
print(ans)
|
p02924
|
s433235016
|
Accepted
|
# -*- coding: utf-8 -*-
n = int(input())
su = n * (n + 1) // 2
print(su - n)
|
p03000
|
s823227967
|
Accepted
|
N,X=map(int,input().split())
L=list(map(int,input().split()))
count=0
dist=0
L.append(0)
i=0
while dist<=X and count<=N:
dist+=L[count]
count+=1
#print(dist)
print(count)
|
p02843
|
s249743783
|
Wrong Answer
|
X=int(input())
N=X//100
for a in range(N):
for b in range(N):
for c in range(N):
for d in range(N):
for e in range(N):
for f in range(N):
if 100*a+101*b+102*c+103*d+104*e+105*f==X:
print('1')
exit()
print('0')
|
p03469
|
s417361503
|
Wrong Answer
|
S = input()
S.replace('2017','2018')
|
p02987
|
s836535400
|
Accepted
|
S = input()
L = []
for i in range(4):
T = "n"
for j in range(len(L)):
if S[i] == L[j][0]:
L[j][1] +=1
T = "y"
if T == "n":
L.append([S[i],1])
if len(L) == 2:
if L[0][1] == L[1][1]:
print("Yes")
else:
print("No")
else:
print("No")
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.