problem_id
stringclasses 428
values | submission_id
stringlengths 10
10
| status
stringclasses 2
values | code
stringlengths 5
816
|
|---|---|---|---|
p03487
|
s083200188
|
Accepted
|
N=int(input())
a=list(map(int,input().split()))
a.sort()
c=1
ans=0
for i in range(N-1):
if a[i]==a[i+1]:
c+=1
if c>a[i]:
ans+=1
else:
if c<a[i]:
ans+=c
c=1
else:
c=1
if c<a[N-1]:
ans+=c
print(ans)
|
p02631
|
s395516718
|
Accepted
|
N = int(input())
A = list(map(int, input().split()))
tmp = 0
for a in A:
tmp ^= a
ans = [0] * N
for i in range(N):
ans[i] = tmp ^ A[i]
print (*ans)
|
p02836
|
s308768787
|
Accepted
|
s = input()
n = len(s)
c = 0
for i in range(n // 2):
if s[i] != s[-i -1]:
c = c + 1
print(c)
|
p03486
|
s609888306
|
Accepted
|
s = input()
t = input()
ls = sorted(list(s))
lt = sorted(list(t),reverse=True)
os = [ord(x) for x in ls]
ot = [ord(x) for x in lt]
for i in range(min(len(s),len(t))):
if os[i] < ot[i]:
print('Yes')
break
elif os[i] > ot[i]:
print('No')
break
else:
if len(s) < len(t):
print('Yes')
else:
print('No')
|
p03359
|
s171572369
|
Wrong Answer
|
a, b = map(int, input().split())
print(min(a, b))
|
p03544
|
s655248354
|
Accepted
|
n = int(input())
lucas = [2, 1] + [0] * (n - 1)
for i in range(2, n + 1):
lucas[i] = lucas[i - 1] + lucas[i - 2]
print(lucas[n])
|
p02783
|
s927895809
|
Accepted
|
h,a=map(int,input().split())
if h%a==0:
print(int(h/a))
else:
print(int(h/a+1))
|
p02951
|
s066100876
|
Wrong Answer
|
a,b,c = map(int,input().split())
print(c-(a-b))
|
p02910
|
s358016819
|
Wrong Answer
|
S = input().split()
if S[1::2] == "R" or S[1::2] == "U" or S[1::2] == "D" :
print("Yes")
else :
print("No")
|
p04031
|
s376730978
|
Accepted
|
N = int(input())
a = [int(i) for i in input().split()]
ans = float("inf")
for i in range(-100, 101):
ans = min(sum([(n - i)** 2 for n in a]), ans)
print(ans)
|
p02994
|
s309330927
|
Accepted
|
N,L=map(int,input().split())
A=L
if L<=0 and L-1+N>=0:
A=0
elif L<=0:
A=L+N-1
print(N*(N-1)//2+L*N-A)
|
p02693
|
s222531676
|
Accepted
|
K = int(input())
A, B = list(map(int, input().split()))
ans = "NG"
for i in range(A, B + 1):
if i % K == 0:
ans = "OK"
print(ans)
|
p03449
|
s950868826
|
Wrong Answer
|
n = input()
a = [list(map(int,raw_input().split())) for i in range(2)]
x = 0
y = 0
total = a[0][0]
while 1:
right = sum([a[y][i] for i in range(x+1,n)])+a[1][n-1] if x != n-1 else 0
down = sum([a[1][i] for i in range(x,n)])
if right > down:
x += 1
total += a[y][x]
else:
total += down
break
print total
|
p02606
|
s157051131
|
Accepted
|
L, R, d = map(int, input().split())
if L % d != 0:
L += d - (L % d)
if R % 2 == 1:
R -= L % d
if L > R:
print(0)
else:
print((R - L)//d + 1)
|
p02866
|
s659909826
|
Accepted
|
N = int(input())
D = list(map(int, input().split()))
if D[0] != 0:
print(0)
exit()
c = {}
for i in D:
if i in c:
c[i] += 1
else:
c[i] = 1
if c[0] != 1:
print(0)
exit()
result = 1
for i in range(1, max(D) + 1):
if i not in c:
print(0)
exit()
result *= pow(c[i - 1], c[i], 998244353)
result %= 998244353
print(result)
|
p03944
|
s182437772
|
Accepted
|
w, h, n = map(int, input().split())
x1 = [0]
x2 = [w]
y1 = [0]
y2 = [h]
for i in range(n):
x, y, a = map(int, input().split())
if a == 1:
x1.append(x)
elif a == 2:
x2.append(x)
elif a == 3:
y1.append(y)
elif a == 4:
y2.append(y)
left = max(x1)
right = min(x2)
bottom = max(y1)
top = min(y2)
ans =max(0, right - left)*max(0, top - bottom)
print(ans)
|
p03351
|
s708843317
|
Wrong Answer
|
a, b, c, d = map(int, input().split())
if 2 * d >= abs(c - a):
print('Yes')
else:
print('No')
|
p03699
|
s152956491
|
Wrong Answer
|
N = int(input())
S = sorted([int(input()) for n in range(N)])
a = sum(S)
n = 0
while a%10==0 and a!=0:
a-=S[n]
n+=1
print(a)
|
p02547
|
s326896680
|
Accepted
|
n=int(input())
d1=[]
d2=[]
f=0
for i in range(n):
x,y=map(int, input().split())
d1.append(x)
d2.append(y)
for i in range(2,n):
if d1[i]==d2[i] and d1[i-1]==d2[i-1] and d1[i-2]==d2[i-2] :
f=1
if f==1:
print('Yes')
else:
print('No')
|
p02995
|
s138199074
|
Accepted
|
def resolve():
A, B, C, D = map(int, input().split())
d = D
c = C
gcd = 0
while gcd == 0:
if d % c == 0:
gcd = c
else:
e = d%c
d = c
c = e
lcm = C*D//gcd
A = A-1
print((B-B//C-B//D+B//lcm)-(A-A//C-A//D+A//lcm))
resolve()
|
p03455
|
s273380725
|
Accepted
|
a, b = map(int, input().split())
if int(a*b%2) == 1:
print('Odd')
else:
print('Even')
|
p03106
|
s964123901
|
Accepted
|
from fractions import gcd
a, b, k = map(int, input().split())
def make_divisors(n):
divisors = []
for i in range(1, int(n ** 0.5) + 1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n // i)
divisors.sort()
print(divisors[len(divisors) - k])
make_divisors(gcd(a, b))
|
p03994
|
s564553412
|
Accepted
|
def solve():
s = list(input())
K = int(input())
for i in range(len(s)):
distToA = (ord('z')+1 - ord(s[i])) % 26
if distToA <= K:
s[i] = 'a'
K -= distToA
else:
s[-1] = chr(ord(s[-1]) + K%26)
print("".join(s))
if __name__ == '__main__':
solve()
|
p03632
|
s863731760
|
Wrong Answer
|
A, B, C, D = map(int, input().split())
if A < C and B > C:
print(min(B, D) - C)
elif A > C and B > C:
print(min(B, D) - A)
else:
print(0)
|
p04031
|
s884085967
|
Accepted
|
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)
############ ---- Input Functions ---- ############
def in_int():
return (int(input()))
def in_list():
return (list(map(int, input().split())))
def in_str():
s = input()
return (list(s[:len(s) - 1]))
def in_ints():
return (map(int, input().split()))
n = in_int()
a = in_list()
av= sum(a)//n
ans = 0
p = 0
for xx in a:
p += (xx-av)*(xx-av)
ans = p
p = 0
for xx in a:
p += (xx-av-1)*(xx-av-1)
ans = min(ans, p)
print(ans)
|
p03067
|
s772196946
|
Wrong Answer
|
a, b, c = map(int, input().split())
print("Yes" if max(a, b, c) == b or min(a, b, c) == b else "NO")
|
p03644
|
s787539243
|
Wrong Answer
|
N = int(input())
count = 0
if N == 1:
print(1)
elif N == 2 or N == 3:
print(2)
else:
even = [i for i in range(2, N+1, 2)]
while len(even) >1:
i = 0
count +=1
while i < len(even):
if even[i]%2 == 0:
even[i] = even[i]/2
i +=1
else:
del even[i]
i +=1
print(2**count)
|
p02570
|
s746371054
|
Wrong Answer
|
input_line = list(input().split())
input_line = [int(n) for n in input_line]
[D, T, S] = input_line
condition = D >= T*S
if condition:
print("No")
else:
print("Yes")
|
p02708
|
s577553533
|
Wrong Answer
|
MOD = 10 ** 9 + 7
n, k = map(int, input().split())
def calc(a):
smallest = a * (a-1) / 2
largest = smallest + a * (n-a+1)
return largest - smallest + 1
ans = 0
for a in range(k, n+2):
ans += calc(a)
ans %= MOD
print(ans)
|
p03062
|
s167022555
|
Accepted
|
n = int(input())
A = tuple(map(int, input().split()))
cnt = 0
zero = False
for a in A:
if a < 0:
cnt += 1
elif a == 0:
zero = True
if cnt%2 == 0 or zero:
print(sum(map(abs, A)))
else:
A = sorted(map(abs, A))
print(sum(A) - 2*A[0])
|
p03434
|
s478312790
|
Wrong Answer
|
a = list(map(int,input().split()))
ans = max(a) -min(a)
print(ans)
|
p03163
|
s485583597
|
Wrong Answer
|
import numpy as np
n,W,*wv=map(int,open(0).read().split())
w=np.array(wv[::2])
v=np.array(wv[1::2])
dp=np.zeros([n+1,W+1],dtype=int)
for i in range(1,n+1):
now=np.zeros(W+1,dtype=int)
print(dp[i-1],now)
now[w[i-1]:]=dp[i-1][:-w[i-1]]+v[i-1]
print(dp[i-1],now)
dp[i]=np.maximum(dp[i-1],now)
print(dp[-1][-1])
|
p02732
|
s308623046
|
Wrong Answer
|
from collections import Counter
n = int(input())
a = map(int, input().split())
counter = Counter()
for ai in a:
counter[ai] += 1
for ai in a:
print(max(0, counter[ai]))
|
p03680
|
s580734806
|
Accepted
|
from collections import defaultdict
N = int(input())
a = [int(input()) for _ in range(N)]
d = defaultdict(int)
for i, e in enumerate(a, 1):
d[i] = e
count = 1
tmp = d[1]
if tmp == 2:
print(1)
exit()
while count <= N:
v = d[tmp]
count += 1
if v == 2:
print(count)
exit()
tmp = v
print(-1)
|
p03695
|
s224550152
|
Accepted
|
def main():
N = int(input())
A = [int(_)//400 for _ in input().split()]
U = [a for a in A if a < 8]
O = N - len(U)
print(max(1, len(set(U))), len(set(U)) + O)
return
if __name__ == '__main__':
main()
|
p02768
|
s739843591
|
Accepted
|
n,a,b=map(int,input().split())
m=10**9+7
def com(n,k,m):
p,q=1,1
for i in range(n-k+1,n+1):
p*=i
p%=m
for i in range(1,k+1):
q*=i
q%=m
return p*pow(q,m-2,m)%m
ca,cb=com(n,a,m),com(n,b,m)
ans=(pow(2,n,m)-1-ca-cb)%m
print(ans)
|
p02613
|
s635068278
|
Accepted
|
n=int(input())
s=[]
for i in range(n):
s.append(input())
print('AC x {}'.format(s.count('AC')))
print('WA x {}'.format(s.count('WA')))
print('TLE x {}'.format(s.count('TLE')))
print('RE x {}'.format(s.count('RE')))
|
p03351
|
s715301365
|
Accepted
|
# -*- coding: utf-8 -*-
a, b, c, d = map(int, input().split())
a_b = abs(a-b)
a_c = abs(a-c)
b_c = abs(b-c)
if a_c <= d or (a_b <= d and b_c <= d):
print('Yes')
else:
print('No')
|
p02713
|
s744482785
|
Wrong Answer
|
import math
# math.gcd(x,y)
K = int(input())
ans = 0
for i in range(K):
for j in range(K):
for k in range(K):
ans += math.gcd(math.gcd(i, j), k)
print(ans)
|
p02983
|
s894366290
|
Accepted
|
def solve(L, R):
minmod = float('inf')
for i in range(L, R):
for j in range(i + 1, R + 1):
minmod = min((i * j) % 2019, minmod)
if minmod == 0:
return minmod
return minmod
L, R = map(int, input().split(' '))
print(solve(L, R))
|
p03252
|
s009683060
|
Accepted
|
from collections import Counter
s=input()
t=input()
if Counter(Counter(s).values()) == Counter(Counter(t).values()):
print('Yes')
else:
print('No')
|
p02910
|
s256031465
|
Wrong Answer
|
S = list(input())
n = len(S)
cnt=0
for i in range(int(n/2)):
if S[2*i]=='L' or S[2*i+1]=='R':
print('No')
cnt+=1
break
else:
continue
if cnt == 0:
print('Yes')
|
p03494
|
s905933045
|
Accepted
|
n = int(input())
A = list(map(int, input().split()))
count = 0
while all(a%2==0 for a in A):
A = [a/2 for a in A]
count+=1
print(count)
|
p02724
|
s576407318
|
Wrong Answer
|
x = int(input())
Y = [500, 100, 50, 5, 1]
ans = 0
for i in Y:
if i == 500:
ans += (x // i)*1000
elif i == 5:
ans += (x // i)*5
x -= (x//i)*i
if x == 0:
break
print(ans)
|
p03457
|
s830416401
|
Wrong Answer
|
N = int(input())
t=[0]*(N+1); x=[0]*(N+1); y=[0]*(N+1)
t_diff=0; x_diff=0; y_diff=0
for i in range(1,N+1):
t[i], x[i], y[i] = map(int, input().split())
# print(t, x, y)
for i in range(N):
t_diff = t[i+1]-t[i]
x_diff = abs(x[i+1]-x[i])
y_diff = abs(y[i+1]-y[i])
if t_diff%2 != (x_diff+y_diff)%2 or t[-1] < (x[-1]+y[-1]):
print("No")
exit()
print("Yes")
|
p02547
|
s565491231
|
Accepted
|
import sys
n = int(input())
ans = 0
flag = False
for i in range(n):
d1,d2 = map(int,input().split())
if d1 == d2:
ans += 1
else:
ans = 0
if ans == 3:
flag = True
if flag == True:
print("Yes")
else:
print("No")
|
p03061
|
s870845491
|
Wrong Answer
|
N = int(input())
A = list(map(int,input().split()))
if N==2: print(max(A));exit()
from math import gcd
L = {}
R = {}
L[0] = A[0]
R[N-1] = A[-1]
ans = 0
for i in range(1,N):
L[i] = gcd(L[i-1],A[i])
R[N-i-1] = gcd(R[N-i],A[N-i-1])
for i in range(2,N):
ans = max(ans,gcd(L[i-2],R[i]))
ans = max(ans,R[1])
ans = max(ans,L[N-1])
ans = max(ans,R[0])
print(ans)
|
p03137
|
s122999566
|
Accepted
|
N,M = map(int,input().split())
X = list(map(int,input().split()))
X.sort()
ans = 0
if M > N:
dist = []
for i in range(1,M):
dist.append(abs(X[i]-X[i-1]))
dist.sort()
for i in range(M-N):
ans += dist[i]
print(ans)
|
p02772
|
s926467850
|
Accepted
|
n = int(input())
A = list(map(int, input().split()))
for i in range(len(A)):
if A[i] %2 == 0:
if A[i]%3 != 0 and A[i]%5 != 0:
print("DENIED")
exit()
else:
pass
else:
pass
print("APPROVED")
|
p02689
|
s508811362
|
Accepted
|
N,M=map(int,input().split())
H=list(map(int,input().split()))
ans=[1 for i in range(N)]
for i in range(M):
A,B=map(int,input().split())
if H[A-1]>H[B-1]:
if H[A-1]!=0:
ans[B-1]=0
elif H[A-1]<H[B-1]:
if H[B-1]!=0:
ans[A-1]=0
else:
ans[A-1]=0
ans[B-1]=0
print(ans.count(1))
|
p02754
|
s213969682
|
Accepted
|
N, A, B = map(int, input().split())
ans = N // (A + B) * A
rem = N % (A + B)
ans += min(rem, A)
print(ans)
|
p03293
|
s886136657
|
Accepted
|
s = input()
t = input()
n = len(s)
for i in range(n):
if t[i:]+t[:i] == s:
print('Yes')
exit()
print('No')
|
p03038
|
s210448594
|
Wrong Answer
|
n,m=[int(x) for x in input().rstrip().split()]
a=[int(x) for x in input().rstrip().split()]
a.sort(reverse=True)
d=[]
bc=[]
for i in range(m):
b,c=[int(x) for x in input().rstrip().split()]
bc.append([b,c])
cnt=0
for b,c in bc:
d.extend([c]*b)
cnt+=b
if n<cnt:
break
d.sort(reverse=True)
a+=d
a.sort(reverse=True)
print(sum(a[:n]))
|
p03407
|
s387572398
|
Accepted
|
a,b,c=map(int,input().split())
print('Yes') if a+b>=c else print('No')
|
p03673
|
s081211579
|
Accepted
|
N=int(input())
*A,=map(int,input().split())
if N%2==0:
print(' '.join(map(str,A[1::2][::-1]+A[::2])))
else:
print(' '.join(map(str,A[::2][::-1]+A[1::2])))
|
p03711
|
s399286759
|
Accepted
|
# 入力 : 数字2つ
x, y = map(int, input().split())
# 出力 x, y が同一のグループに属しているか判定してください。
list1 = [1, 3, 5, 7, 8, 10, 12]
list2 = [4, 6, 9, 11]
list3 = [2]
if x in list1 and y in list1:
print("Yes")
elif x in list2 and y in list2:
print("Yes")
elif x in list3 and y in list3:
print("Yes")
else :
print("No")
|
p03073
|
s198704804
|
Wrong Answer
|
s= str(input())
ans = 0
for i in range(len(s)):
if i // 2 == 0:
if s[i] == '0':
ans += 1
else:
if s[i] == '1':
ans += 1
print(min (ans,len(s)-ans))
|
p03719
|
s206616888
|
Wrong Answer
|
a,b,c=map(int,input().split())
if a<=b<=c:
print('Yes')
else:
print('No')
|
p03416
|
s202778193
|
Accepted
|
a, b = map(int, input().split())
cnt = 0
for i in range(a, b+1):
s = str(i)
if(s == s[::-1]):
cnt += 1
print(cnt)
|
p04033
|
s988843473
|
Accepted
|
a,b =map(int, input().split())
if b < 0:
if (b-a+1)%2 == 0:
print('Positive')
else:
print('Negative')
elif b >= 0 and a <= 0:
print('Zero')
else:
print('Positive')
|
p03797
|
s935236488
|
Wrong Answer
|
s, c = map(int, input().split())
ans = 0
if s == 1 and c == 1:
print(ans)
exit()
if 2*s >= c:
ans += s
else:
ans += s+ ( c - 2*s )//4
print(ans)
|
p02888
|
s808501840
|
Wrong Answer
|
# -*- coding: utf-8 -*-
N = int(input())
L = list(map(int, input().split()))
#
lim = 10**3 * 2
nums = [0 for _ in range(lim + 1)]
for l in L:
nums[l] += 1
for i in range(1, lim + 1):
nums[i] += nums[i-1]
L.sort()
ans = 0
for i in range(N):
l1 = L[i]
for j in range(i+1, N):
l2 = L[j]
l3_max = (l1 + l2) - 1
ans += nums[l3_max] - nums[l2]
print(ans)
|
p02753
|
s580550058
|
Wrong Answer
|
s = input().split()
n = 0
for i in range(len(s) - 1):
if s[i] != s[i + 1]:
n += 1
if n >= 1:
print('Yes')
else:
print('No')
|
p02664
|
s735966547
|
Wrong Answer
|
t = list(map(str,input()))
tmpP = 0
cnt = 0
for i in t:
cnt += 1
if i == "?":
if tmpP == 1:
t[cnt-1] = "D"
tmpP = 0
else:
t[cnt-1] = "P"
tmpP += 1
elif i == "P":
tmpP += 1
else:
tmpP = 0
print("".join(t))
|
p02994
|
s868816210
|
Wrong Answer
|
n,l = map(int,input().split())
n_l = [0]*n
for i in range(n):
n_l[i] = l + (i+1) - 1
n_l_min = min(n_l)
if n_l_min < 0 :
print(sum(n_l)-max(n_l))
exit()
print(sum(n_l)-n_l_min)
#print(n_l)
|
p03852
|
s038206700
|
Wrong Answer
|
c = input()
p = "aeiou"
c = "i"
if c in p:
print("vowel")
else:
print("consonant")
|
p02596
|
s799377891
|
Accepted
|
K = int(input())
num = 0
cnt = 0
ans = -1
for i in range(K):
num = num*10 +7
cnt += 1
if num%K != 0:
num = num%K
else:
ans = cnt
break
print(ans)
|
p02577
|
s179370158
|
Accepted
|
N=input()
ans=0
for i in N:
ans=ans+int(i)
if ans%9 == 0:
print("Yes")
exit()
print("No")
|
p02829
|
s648508660
|
Accepted
|
a= int(input())
b= int(input())
c= 6
print(c-(a+b))
|
p02683
|
s084950888
|
Accepted
|
import numpy as np
import itertools
N,M,X=map(int,input().split())
arr=[list(map(int,input().split())) for _ in range(N)]
ans=9999999999
V=list(itertools.product([0,1], repeat=N))
for v in V:
cost=0
C=[0]*M
for n in range(N):
if v[n]==1:
cost += arr[n][0]
for j in range(1,M+1):
C[j-1] += arr[n][j]
if min(C) >= X:
ans=min(ans,cost)
if ans == 9999999999:
print(-1)
else:
print(ans)
|
p02854
|
s719783988
|
Accepted
|
#!/usr/bin/env python3
n, *a = map(int, open(0).read().split())
r = [a[0]]
for i in range(1, n):
r.append(r[i - 1] + a[i])
print(min(abs(2 * i - r[-1]) for i in r))
|
p03206
|
s514530733
|
Accepted
|
dic ={25:"Christmas",24:"Christmas Eve",23:"Christmas Eve Eve",22:"Christmas Eve Eve Eve"}
print(dic[int(input())])
|
p03767
|
s404181339
|
Accepted
|
n = int(input())
A = sorted(list(map(int, input().split())))[::-1]
print(sum(a for a in A[1:2*n:2]))
|
p04031
|
s523076854
|
Accepted
|
N = int(input())
A = list(map(int, input().split()))
ave = round(sum(A)/N)
all_cost = 0
for a in A:
cost = (ave - a) ** 2
all_cost += cost
print(all_cost)
|
p03001
|
s498619518
|
Accepted
|
W, H, x, y = map(int, input().split())
print(W*H/2, int(x == W/2 and y == H/2))
|
p03250
|
s331123153
|
Wrong Answer
|
a,b,c=map(int,input().split())
print(b*10+c+a)
|
p02773
|
s342856533
|
Accepted
|
from collections import Counter
N = int(input())
S = [input() for _ in range(N)]
c = Counter(S)
m = max(c.values())
ans = sorted([k for k,v in c.items() if m==v])
[print(k) for k in ans]
|
p02572
|
s316987366
|
Accepted
|
import sys
MOD = 10**9 + 7
N = int(input())
As = list(map(int, input().split()))
sumA = 0
for A in As:
sumA += A
sumA %= MOD
#print('# sumA:', sumA, file=sys.stderr)
ans = sumA * sumA % MOD
for A in As:
ans -= A * A % MOD
ans %= MOD
#print('# ans:', ans, file=sys.stderr)
inv2 = pow(2, MOD-2, MOD)
ans *= inv2
ans %= MOD
print(ans)
|
p03705
|
s650037817
|
Accepted
|
N, A, B = map(int, input().split())
print(max(0, A + B * (N - 1) - (A * (N - 1) + B) + 1))
|
p02639
|
s847583682
|
Accepted
|
_input = input().split(" ")
for _i in range(5):
if _input[_i] == "0":
print(_i + 1)
|
p03434
|
s389014379
|
Accepted
|
from sys import stdin
n = int(stdin.readline().rstrip())
data = stdin.readline().rstrip().split()
data = sorted(data, key=int, reverse=True)
alice_total=0
bob_total=0
for i in range(0, n):
if i % 2 == 0:
alice_total = alice_total + int(data[i])
else:
bob_total = bob_total + int(data[i])
print(alice_total - bob_total)
|
p02642
|
s636566957
|
Accepted
|
from collections import Counter
n = int(input())
aa = tuple(sorted(map(int, input().split())))
cnt = Counter(aa)
amax = max(aa)
af = [False] * (amax + 1)
ans = 0
for i in range(n):
x = aa[i]
if af[x]:
continue
while x <= amax:
af[x] = True
x += aa[i]
if cnt[aa[i]] == 1:
ans += 1
print(ans)
|
p02631
|
s440313724
|
Wrong Answer
|
n = int(input())
a = list(map(int, input().split()))
b = [0 for i in range(n)]
A = 0
for i in range(n):
A = A ^ a[i]
for i in range(n):
b[i] = A ^ a[i]
print(b)
|
p03804
|
s719640998
|
Wrong Answer
|
n,m = map(int,input().split())
A = []
B = []
for i in range(n):
a_ = input()
A.append(a_)
for i in range(m):
b_ = input()
B.append(b_)
b = 0
for a in A:
if b == m:
break
if "o" in list(a.replace(B[b],"o")):
b += 1
if b == m:
print("Yes")
else:
print("No")
|
p04011
|
s160706755
|
Accepted
|
N = int(input())
K = int(input())
X = int(input())
Y = int(input())
if N <= K:
print(N*X)
else:
print(K*X+Y*(N-K))
|
p02833
|
s359156394
|
Wrong Answer
|
import sys
n = int(input())
if n % 2 == 1:
print("0")
sys.exit()
m = n/2
count = 0
i = 1
while m >= 5 ** i:
count += (m // (5 ** i))
i += 1
print(int(count))
|
p02600
|
s192474442
|
Accepted
|
X=int(input())
a=0
if 400<=X<=599:
a=8
elif 600<=X<=799:
a=7
elif 800<=X<=999:
a=6
elif 1000<=X<=1199:
a=5
elif 1200<=X<=1399:
a=4
elif 1400<=X<=1599:
a=3
elif 1600<=X<=1799:
a=2
elif 1800<=X<=1999:
a=1
print(a)
|
p03239
|
s769268824
|
Accepted
|
N,T=map(int,input().split())
cost=10001
ans=-1
for i in range(N):
c,t=map(int,input().split())
if t<=T and c<cost:
cost=c
ans=cost
if ans==-1:
print('TLE')
else:
print(ans)
|
p02578
|
s674460512
|
Accepted
|
#!/usr/bin/env python
# -*- coding: utf-8 -*-
def main():
N = int(input())
A = list(map(int, input().split()))
arr = A[0]
ans = 0
for i in A:
ans += abs(arr - i) if i <= arr else 0
arr = max(arr, i)
print(ans)
if __name__ == "__main__":
main()
|
p02594
|
s805995864
|
Accepted
|
X = input()
X = int(X)
if X >= 30:
print('Yes')
else:
print('No')
|
p02766
|
s635145623
|
Accepted
|
a = input().split()
a=[int(i) for i in a]
n,k=a[0],a[1]
r=0
b=1
while r<1:
if n>=k**b:
b=b+1
else:
r=1
print(b)
|
p03385
|
s898600458
|
Accepted
|
S = input()
S = sorted(S)
if S == list("abc"):
print("Yes")
else:print("No")
|
p02696
|
s045252888
|
Wrong Answer
|
a, b, n = map(int, input().split())
print(int(a*n/b) - a*int(n/b))
|
p03077
|
s561750722
|
Wrong Answer
|
#!/usr/bin/env python3
n, a, b, c, d, e = [int(input()) for _ in range(6)]
ans = (n-1)//min(a, b, c, d)+1 + 4
print(ans)
|
p04031
|
s797195013
|
Wrong Answer
|
import math
n = int(input())
x = list(map(int, input().split()))
num = math.ceil(sum(x)/n)
cost=0
for i in range(n):
cost += (x[i]-num)*(x[i]-num)
print(cost)
|
p02584
|
s828290736
|
Wrong Answer
|
x,k,d=map(int,input().split())
num_moved = x // d
num_remained = k - num_moved
if num_remained >= 0:
now = x % d
else:
now = x - d*k
#now = x % d
if num_remained % 2 == 0:
result = abs(now)
else:
tmpa = now + d
tmpb = now - d
if abs(tmpa) > abs(tmpb):
result = abs(tmpb)
else:
result = abs(tmpa)
print(result)
|
p02615
|
s032838687
|
Accepted
|
n = int(input())
a = list(map(int,input().split()))
a.sort(reverse=True)
ans = a[0]
for i in range(2,n):
ans += a[i//2]
print(ans)
|
p02583
|
s252562110
|
Accepted
|
n=input()
l=sorted(map(int,input().split()))
n=len(l)
if n<3:
print(0)
exit()
c=0
for i in range(n-2):
for j in range(i,n-1):
for k in range(j,n):
if l[i]==l[j]:
continue
if l[j]==l[k]:
continue
if l[i]+l[j]>l[k]:
c+=1
print(c)
|
p03281
|
s162632629
|
Accepted
|
n=int(input())
#n,m=map(int,input().split())
#hl=list(map(int,input().split()))
#l=[list(map(int,input().split())) for i in range(n)]
def divnum(n):
res=0
for i in range(1,n+1):
if n%i==0:
res+=1
if res==8:
return True
else:
return False
count=0
for i in range(1,n+1):
if i%2!=0 and divnum(i):
count+=1
print(count)
|
p03695
|
s938487411
|
Accepted
|
N = int(input())
A = sorted(map(int, input().split()))
colors = [0] * 9
for a in A:
idx = a // 400
if idx >= 8:
idx = 8
colors[idx] += 1
ans = 0
for i in range(8):
if colors[i] > 0:
ans += 1
max_ans = ans
if colors[8] > 0:
max_ans += colors[8]
if ans == 0 and max_ans > 0:
ans += 1
print(ans, max_ans)
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.