problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p02731 | s044586461 | Accepted | l=int(input())
print((l/3)**3) |
p02706 | s556767692 | Accepted | n, m = map(int, input().split())
a = [int(i) for i in input().split()]
ans = n - sum(a)
if ans >= 0:
print(ans)
else:
print(-1) |
p03838 | s560958878 | Accepted | import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
x, y = map(int, input().split())
if x<y:
diff = abs(abs(x)-abs(y))
if x*y>=0:
print(diff)
exit()
else:
print(diff+1)
exit()
if y<x:
diff = abs(abs(x)-abs(y))
if x*y>0:
print(diff+2)
else:
print(diff+1)
|
p03328 | s311137770 | Accepted | import sys
a,b=map(int,input().split())
c=b-a
ans=0
for i in range(1,c+1,1):
ans+=i
ans-=b
print(ans)
|
p03711 | s838334819 | Wrong Answer | a = map(int, input().split())
input_list = list(a)
group_a = [1, 3, 5, 7, 8, 10, 12]
group_b = [4, 6, 9, 11]
group_c = [2]
list_of_list = [group_a, group_b, group_c]
count_match = 0
for list_i in list_of_list:
if input_list in list_i:
count_match += 1
break
if count_match == 1:
print('Yes')
else:
print('No')
|
p02665 | s064075072 | Wrong Answer | n = int(input())
a = list(map(int, input().split()))
if a[0] == 1:
if n == 0:
print(1)
else:
print(-1)
else:
lefts = [sum(a)]
for i in range(1, len(a)):
lefts.append(lefts[-1] - a[i])
b = [0] * (n + 1)
b[0] = 1
for i in range(1, n + 1):
b[i] = min(b[i-1] * 2 - a[i], lefts[i])
if min(b) < 0:
print(-1)
else:
print(sum(b) + sum(a))
|
p02873 | s729271759 | Wrong Answer | S = input()
n = len(S) + 1
num = [0] * n
for i in range(n-1):
if S[i] == '<':
num[i + 1] = max(num[i] + 1, num[i + 1])
for i in range(n - 2, 0, -1):
if S[i] == '>':
num[i] = max(num[i + 1] + 1, num[i])
print(sum(num)) |
p03208 | s494073288 | Accepted | # ans
N, K = map(int, input().split())
H = [int(input()) for i in range(N)]
H.sort()
print(min(H[i+K-1] - H[i] for i in range(N-K+1))) |
p02790 | s737201832 | Wrong Answer | a , b = map(int,input().split())
s = max(a,b)
t = min(a,b)
k = 0
for i in range(1,s+1):
k += t*(10**i)
print(k) |
p02987 | s250152480 | Accepted | s=input()
if s.count(s[0])==2:
if s[1]==s[2] or s[1]==s[3] or s[2]==s[3]:
print("Yes")
else:
print("No")
else:
print("No") |
p03997 | s570599506 | Accepted | a=input()
b=input()
h=input()
print((int(a)+int(b))*int(h)//2) |
p03075 | s864248792 | Accepted | a = int(input())
b = int(input())
c = int(input())
d = int(input())
e = int(input())
k = int(input())
if e-a <= k:
print("Yay!")
else:
print(":(") |
p02713 | s377923493 | Accepted | #https://atcoder.jp/contests/abc162/tasks/abc162_c
# -*- coding: utf-8 -*-
import math
ans = 0
K = int(input())
for i in range(1,K+1):
for j in range(1,K+1):
tmp = math.gcd(i,j)
for k in range(1,K+1):
ans += math.gcd(tmp,k)
print(ans) |
p02793 | s479003911 | Accepted | def gcd(a,b):
while b:a,b=b,a%b
return a
def lcm(a,b):return a*b//gcd(a,b)
mod=10**9+7
n=int(input())
a=list(map(int,input().split()))
l=a[0]
for i in range(1,n):
l=lcm(l,a[i])
l%=mod
ans=0
for i in range(n):
ans+=l*pow(a[i],mod-2,mod)
ans%=mod
print(ans) |
p03696 | s584717571 | Accepted | # solution
import io
import math
data = int(input())
inin = input()
a1 = 0
a2 = 0
for i in range(data):
if inin[i] == '(':
a1 += 1
else:
if a1 > 0:
a1 -= 1
else:
a2 += 1
print('('*a2+inin+')'*a1)
|
p03239 | s909728776 | Accepted | import bisect,collections,copy,heapq,itertools,math,string
import sys
def S(): return sys.stdin.readline().rstrip()
def M(): return map(int,sys.stdin.readline().rstrip().split())
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())
N, T = M()
ans = 100000
for _ in range(N):
c, t = M()
if t <= T:
ans = min(ans, c)
if ans == 100000:
print('TLE')
else:
print(ans) |
p03329 | s219820070 | Accepted | N=int(input())
inf=100000
dp=[inf for _ in range(N+1)]
dp[0]=0
for n in range(1,N+1):
num=100000
i=0
j=0
while 9**(i+1)<=n:
i+=1
while 6**(j+1)<=n:
j+=1
for k in range(i+1):
num=min(num,dp[n-9**k]+1)
for k in range(j+1):
num=min(num,dp[n-6**k]+1)
dp[n]=min(dp[n],num)
print(dp[N]) |
p03814 | s013290042 | Accepted | S = input()
s = S.index('A')
e = [i for i, x in enumerate(S) if x == 'Z']
print(max(e) - s + 1) |
p03624 | s981900239 | Accepted | S = input()
for c in "abcdefghijklmnopqrstuvwxyz":
if c not in S:
print(c)
break
else:
print("None")
|
p02633 | s890865136 | Wrong Answer | x=int(input())
print(int(360/x)) |
p03067 | s726812004 | Accepted | import sys
readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)
def main():
A, B, C = map(int, readline().split())
if (A < C < B) or (B < C < A):
print("Yes")
else:
print("No")
if __name__ == '__main__':
main()
|
p02700 | s015922137 | Wrong Answer | a,b,c,d = map(int,input().split())
import math
k = math.ceil(c/b)
l = math.ceil(a/d)
if k >= l:
print('Yes')
else:
print('No') |
p03680 | s566927887 | Accepted | N = int(input())
la = list()
for i in range(N):
la.append(int(input()))
lnum = [0]*N
i = 1
cnt = 0
while lnum[i-1] == 0 and i != 2:
lnum[i-1] += 1
i = la[i-1]
cnt += 1
if i == 2:
print(cnt)
else:
print("-1") |
p02601 | s727008522 | Accepted | a, b, c = map(int, input().split())
k = int(input())
while b <= a:
k -= 1
b *= 2
while c <= b:
k -= 1
c *= 2
print("Yes" if k>=0 else "No") |
p02909 | s017822732 | Wrong Answer | s=input()
l=['Sunny', 'Cloudy', 'Rainy']
print(l.index(s)-1) |
p02765 | s667187326 | Wrong Answer | N,R=map(int,input().split())
if N<10:
print(R-100*(10-N))
else:
print(R)
|
p02552 | s091555715 | Accepted | if input() == "1":
print(0)
else:
print(1) |
p03219 | s561647816 | Wrong Answer | x,y = map(int,input().split())
print(x + y/2) |
p03037 | s680619430 | Wrong Answer | n,m = map(int,input().split())
MIN = 0
MAX = 10**5
for i in range(m):
l,r = map(int,input().split())
MIN = MIN if MIN > l else l
MAX = MAX if MAX < r else r
if MIN > n:
print(0)
else:
MAX = MAX if MAX <= n else n
print(MAX-MIN+1) |
p02621 | s453704230 | Wrong Answer | n = int(input()) % 1000
print(1000 - n if n else 0)
|
p04012 | s846829688 | Accepted | w = input()
ws = set(w)
for i in ws:
if w.count(i)%2 == 1:
print('No')
exit()
print('Yes')
|
p03485 | s095159812 | Wrong Answer | a, b = map(int,input().split())
c = a+b
ans = (c+1)/2
print(ans) |
p03380 | s069899158 | Accepted | n=int(input())
a=list(map(int,input().split()))
a.sort()
y=a[-1]
diff=10**9+2
for i in a[:-1]:
diff=min(diff,max(i,y-i))
x=-1
for i in a[:-1]:
if max(i,y-i)==diff:
x=i
break
print(y,x)
|
p02681 | s005541643 | Wrong Answer | s = input()
t = input()
t2 =t.strip(t[-1])
if(t2 == s):
print("Yes")
else:
print("No") |
p02642 | s116035143 | Wrong Answer | n = int(input())
a = list(map(int, input().split()))
a.sort()
cnt = [0] * ((10 ** 6) + 1)
for elem in a:
cnt[elem] += 1
unique = []
for i in range((10 ** 6) + 1):
if cnt[i] == 1:
unique.append(i)
cnt = [0] * ((10 ** 6) + 1)
for elem in unique:
for m in range(elem * 2, (10 ** 6) + 1, elem):
cnt[m] = 1
ans = 0
for elem in unique:
if cnt[elem] == 0:
ans += 1
print(ans)
|
p02724 | s218791969 | Accepted | X = int(input())
x = int(X / 500)
Y = X % 500
y = int(Y / 5)
print(1000 * x + 5 * y) |
p03282 | s792117741 | Accepted | S = input()
K = int(input())
ans = 1
for i in range(K):
if (S[i] != '1'):
ans = int(S[i])
break
print(ans) |
p02819 | s812395033 | Accepted | X=int(input())
while any(X%i==0 for i in range(2,X)):X+=1
print(X) |
p03479 | s189468251 | Accepted | x,y=map(int,input().split())
cnt=1
while True:
x*=2
if x>y:
break
else:
cnt+=1
print(cnt)
|
p02946 | s447596909 | Accepted | k,x=map(int,input().split())
ans=[i for i in range(x-(k-1), x+(k-1)+1)]
print(*ans,sep=' ') |
p03448 | s457150772 | Wrong Answer | x=int(input())
y=int(input())
z=int(input())
result=int(input())
count=0
for i in range(x):
for j in range(y):
for k in range(z):
if i*500+j*100+k*50==result:
count+=1
print(count) |
p03951 | s845974964 | Accepted | def main():
n = int(input())
s, t = input(), input()
for i in range(n, -1, -1):
u = s[-i:]
v = t[:i]
if u == v:
ans = 2 * n - i
print(ans)
break
else:
print(2 * n)
if __name__ == '__main__':
main()
|
p02682 | s879429932 | Accepted | a,b,c,k=map(int,input().split())
ct=k
result = 0
if a>0:
if ct>a:
result=1*a
elif a>=ct:
result=1*ct
ct=k-a
if ct>0 and b>0:
ct=ct-b
if ct>0 and c>0:
result=result+(-1*ct)
print(result) |
p02785 | s215269312 | Wrong Answer | n,k=map(int,input().split())
hp=list(map(int,input().split()))
sorted(hp)
re=sum(hp[:n-k])
print(re)
|
p02866 | s909491922 | Accepted | n = int(input())
d = list(map(int, input().split()))
l = [0]*(max(d)+1)
for i in d:
l[i] += 1
if d[0] != 0 or l[0] != 1:
print(0)
exit()
ans = 1
for i in range(1, len(l)):
ans *= l[i-1]**l[i]
print(ans%998244353) |
p02843 | s977887016 | Accepted | x = int(input())
dp = [0]*(x+105)
dp[0] = 1
for i in range(x):
for j in range(6):
dp[i+100+j] = dp[i+100+j] | dp[i]
print(dp[x]) |
p03471 | s025930444 | Wrong Answer | n, y = map(int, input().split())
count = 0
for i in range(n+1):
for j in range(n+1):
k = n - i - j
if 0<=k<=2000 and 10000*i + 5000*j + 1000*k == y :
print(i, j, k)
count += 1
break
if count == 0:
print(-1,-1,-1) |
p03011 | s620700937 | Accepted | a = list(map(int,input().split()))
print(sum(sorted(a)[0:2]))
|
p02836 | s321470063 | Accepted | S = input()
result = 0
# 入力例1なら3文字目まで
for i in range(len(S) // 2):
# sの1(2番目)がsの最後尾と一緒ならカウント
if S[i] != S[-(i + 1)]:
result += 1
print(result) |
p04034 | s652567049 | Accepted | N,M = map(int,input().split())
C = {i:[0,1] for i in range(1,N+1)}
C[1] = [1,1]
for _ in range(M):
x,y = map(int,input().split())
if C[x][0]==1:
C[y][0]=1
C[y][1] += 1
C[x][1] -= 1
if C[x][1]==0:
C[x][0]=0
cnt = 0
for i in range(1,N+1):
if C[i][0]==1:
cnt += 1
print(cnt) |
p02847 | s185467428 | Wrong Answer | # A - Can't Wait for Holiday
# 曜日入力
S = input()
if S == 'SUN':
print(7)
elif S == 'MON':
print(1)
elif S == 'TUE':
print(2)
elif S == 'WED':
print(3)
elif S == 'THU':
print(4)
elif S == 'FRI':
print(5)
elif S == 'SAT':
print(6) |
p03069 | s463497267 | Accepted | n=int(input())
s=input()
ans=10**9
w=[0]*n
b=[0]*n
cw,cb=0,0
for i in range(n):
if s[i]==".":
cw+=1
else:
cb+=1
w[i]=cw
b[i]=cb
for i in range(n):
ans=min(ans,b[i]+w[-1]-w[i])
ans=min(ans,b[-1],w[-1])
print(ans)
|
p02693 | s883666397 | Wrong Answer | K = int(input())
A, B = [int(i) for i in input().split()]
if B - A >= K:
print("Yes")
else:
print("No")
|
p02556 | s484872196 | Accepted | n = int(input())
point = []
for _ in range(n):
point.append((tuple(map(int, input().split()))))
point = list(set(point))
point = sorted(point)
if len(point) == 1: print(0)
else:
d1 = max([(x+y) for x,y in point])- min([(x+y) for x,y in point])
d2 = max([(x-y) for x,y in point]) - min([(x-y) for x,y in point])
print(max(d1,d2)) |
p02663 | s802860578 | Accepted | h1,m1,h2,m2,k = map(int,input().split())
H_min = (h2-h1)*60
M_min = m2-m1
time = H_min + M_min
ans = time - k
print(ans) |
p03860 | s352141625 | Wrong Answer | a,x,c = input().split()
X = x[0]
list = ['A',X,'C']
ans = ','.join(list)
print(ans) |
p03161 | s405907335 | Accepted | import sys
n, k = map(int, sys.stdin.readline().strip('\n').split())
h = list(map(int, sys.stdin.readline().strip('\n').split()))
dp = [float('inf') for _ in range(n)]
dp[0] = 0
for i in range(1, n):
for j in range(k+1):
if i-j>=0: dp[i] = min(dp[i], dp[i-j] + abs(h[i-j]-h[i]))
print(dp[n-1]) |
p02916 | s817447812 | Accepted | N = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = list(map(int, input().split()))
before_a = -2
ans = 0
for a in A:
ans += B[a - 1]
if before_a + 1 == a:
ans += C[a - 2]
before_a = a
print(ans) |
p02995 | s162672925 | Wrong Answer | a,b,c,d=list(map(int,input().split()))
import math
def yakusuu(n):
return n//c+n//d-n//(c*d/math.gcd(c,d))
print(int(b-a+1-(yakusuu(b)-yakusuu(a-1))))
|
p02627 | s578642694 | Accepted | alpha = input()
if alpha.isupper():
print('A')
else:
print('a') |
p03639 | s908874189 | Accepted | N=int(input())
a=map(int,input().split())
c=0
d=0
e=0
f=0
for i in a:
if i%4==0:
c=c+1
elif i%2==0:
d=d+1
e=N-c-d
if d==0:
if (c+1)>=e:
print('Yes')
else:
print('No')
else:
if c>=e:
print('Yes')
else:
print('No') |
p03814 | s149305253 | Accepted | s = input()
num = len(s)
A = s.find("A")
Z = s.rfind("Z")
ans = Z - A + 1
print(ans)
|
p03211 | s298592218 | Accepted | S = input()
min = 1000
for i in range(len(S) - 2):
x = int(S[i:i+3])
x = abs(753 - x)
if min > x:
min = x
print(min) |
p02996 | s836849240 | Accepted | N = int(input())
job = [[0]*2 for i in range(N)]
time = 0
for i in range(N):
l = list(map(int, input().split()))
job[i][0], job[i][1] = l[1], l[0]
job = sorted(job)
for i in range(N):
time += job[i][1]
if time > job[i][0]:
print("No")
break
elif i == N-1:
print("Yes") |
p03071 | s511224225 | Accepted | a, b = map(int, input().split())
ans = 0
for i in range(2):
if a < b:
ans += b
b -= 1
else:
ans += a
a -= 1
print(ans) |
p02817 | s551783812 | Accepted | s,t=input().split()
print(t+s) |
p02947 | s703969542 | Wrong Answer | from collections import Counter
n=int(input())
List=[list(input()) for i in range(n)]
ans=0
for i in range(n-1):
List1=Counter(List[i])
for j in range(1,n):
List2=Counter(List[j])
if List1==List2:
ans+=1
print(int(ans/2)) |
p02952 | s475556407 | Wrong Answer | N = int(input())
a=0
cnt = 0
num = N
while 10<=num:
num/=10;a+=1
if a%2==0:
for i in range(10**a,N+1):
cnt += 1
if 4 < a:
print(cnt + 90909)
elif 2 < a:
print(cnt + 909)
else:
print(cnt + 9)
|
p02572 | s845249933 | Accepted | MOD = 10**9+7
N = int(input())
A = list(map(int, input().split()))
A_sum = sum(A)
r = 0
for i, a in enumerate(A):
x = A[i]*(A_sum - a)
r = (r+x) % MOD
# print(r)
r = (r * pow(2, MOD-2, MOD)) % MOD
print(r) |
p02820 | s331069034 | Accepted | N,K = map(int,input().split())
R,S,P = map(int,input().split())
T = input()
score = 0
last_lst = [""]*K
for i in range(N):
if T[i] == last_lst[i%K]:
last_lst[i%K] = ""
continue
else:
if T[i] == "r":
score += P
elif T[i] == "p":
score += S
else:
score += R
last_lst[i%K] = T[i]
print(score) |
p03495 | s409535309 | Accepted | import sys
from collections import Counter
def main():
n, k = map(int, input().split())
a = tuple(map(int, input().split()))
col = max(0, len(set(a)) - k)
if col == 0:
print(0)
sys.exit()
ac = Counter(a)
acl = ac.most_common()[::-1]
acll = [ace[1] for ace in acl[:col]]
r = sum(acll)
print(r)
if __name__ == '__main__':
main()
|
p03760 | s362419451 | Accepted | o=input()
e=input()+' '
print((''.join(['{}{}'.format(a,b) for a,b in zip(o,e)])).replace(' ',''))
|
p02595 | s810730094 | Accepted | N,D = map(int,input().split())
ans = 0
for i in range(N):
x,y = map(int,input().split())
if x*x+y*y <= D*D:
ans += 1
print(ans) |
p02818 | s399175401 | Wrong Answer | #!/usr/bin/env python3
A, B, K = map(int, input().split())
if A >= K:
print(A - K, B)
else:
print(0, A + B - K) |
p03059 | s704807787 | Accepted | A,B,T = map(int,input().split())
print("{}".format((T//A)*B)) |
p02717 | s540369588 | Wrong Answer | input_line = input().split(" ")
X=input_line[0]
Y=input_line[1]
Z=input_line[2]
ram=X
X=Y
Y=ram
ram=X
X=Z
Z=ram
input_line=' '.join(input_line)
print(input_line) |
p02627 | s683712469 | Wrong Answer | s=input()
if s.islower():
print("A")
else:
print("a") |
p02754 | s359560699 | Wrong Answer | N,A,B=map(int, input().split())
ans=(N-N%(A+B))*A/(A+B)+min(A,N%(A+B))
print(ans)
|
p02994 | s445431846 | Wrong Answer | N,L=map(int,input().split())
ans=0
if L>0:
for i in range(L+1,L+N):
ans+= i
elif L<0 and N+L>=0:
for i in range(L,L+N):
ans+=i
elif L<0 and N+L<=0:
for i in range(L,L+N-1):
ans +=i
print(ans) |
p02697 | s531321861 | Accepted | N, M = map(int, input().split())
d = (N-1)//2
ans = []
ans.append((1, 1+d))
while True:
a = ans[-1][0]+1
b = ans[-1][1]-1
if a>=b:
break
ans.append((a, b))
d2 = d-1
ans.append((2+d, 2+d+d2))
while True:
a = ans[-1][0]+1
b = ans[-1][1]-1
if a>=b:
break
ans.append((a, b))
for a, b in ans[:M]:
print(a, b) |
p03012 | s137297943 | Accepted | num = int(input())
weight = list(map(int, input().split()))
d = []
for i in range(len(weight)):
d.append(abs(sum(weight[:i])-sum(weight[i:])))
print(min(d)) |
p02646 | s434343717 | Accepted | import sys
def input(): return sys.stdin.readline().rstrip()
def main():
A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())
if W >= V:
print('NO')
elif abs((A - B) / (W - V)) <= T:
print('YES')
else:
print('NO')
if __name__ == '__main__':
main()
|
p03493 | s748053225 | Wrong Answer | import random
a = input()
print(random.randint(0,3)) |
p03524 | s682253601 | Accepted | S = input()
a = S.count('a')
b = S.count('b')
c = S.count('c')
n = len(S)//3
k = len(S)-n*3
if a >= n and b >= n and c >= n:
if k == 2 and max(a-n,b-n,c-n) == 2:
print('NO')
else:
print('YES')
else:
print('NO')
|
p03435 | s185052948 | Accepted | c = [[] for _ in range(3)]
for i in range(3):
c[i] = list(map(int,(input().split())))
a1 = c[1][0] - c[0][0]
a2 = c[2][0] - c[0][0]
b1 = c[0][1] - c[0][0]
b2 = c[0][2] - c[0][0]
if c[1][1]-c[0][0] == a1+b1 and c[2][1]-c[0][0] == a2+b1 and c[1][2]-c[0][0] == a1+b2 and c[2][2]-c[0][0] == a2+b2:
print("Yes")
else:
print("No") |
p02793 | s689425516 | Accepted | import fractions
from functools import reduce
n=int(input())
numbers=list(map(int,input().split()))
def lcm_base(x, y):
return (x * y) // fractions.gcd(x, y)
def lcm_list(numbers):
return reduce(lcm_base, numbers, 1)
l=0
x=lcm_list(numbers)
for i in range(n):
l+=(x//numbers[i])
print(l%(10**9+7))
|
p02596 | s813364810 | Accepted | K = int(input())
if (K%2==0)or(K%5==0):
print(-1)
else:
x = 7
i = 1
x %= K
while (x!=0)or(i>=10**7):
x += (7%K) * pow(10,i,K)
x %= K
i += 1
if i<10**7:
print(i)
else:
print(-1) |
p02771 | s151341944 | Accepted | *X, = map(int, input().split())
if len(set(X)) == 2:
print('Yes')
else:
print('No')
|
p03262 | s467037937 | Accepted | from collections import defaultdict
from collections import deque
import itertools
import math
def readInt():
return int(input())
def readInts():
return list(map(int, input().split()))
def readChar():
return input()
def readChars():
return input().split()
n,x = readInts()
xs = readInts()
xs.append(x)
xs.sort()
ans = xs[1]-xs[0]
for i in range(n):
ans = math.gcd(ans,xs[i+1]-xs[i])
print(ans) |
p03475 | s323430188 | Wrong Answer | n=int(input())
c=[]
s=[]
f=[]
for i in range(n-1):
C,S,F=map(int,input().split())
c.append(C)
s.append(S)
f.append(F)
for i in range(n-1):
tmp=s[i]
while i<n-1:
if tmp<=s[i]:
a=s[i]
elif tmp>s[i]:
a=tmp+(tmp-s[i])%f[i]
tmp=a+c[i]
i+=1
print(tmp)
print(0) |
p02732 | s425412476 | Accepted | n = int(input())
a = [int(i) for i in input().split()]
nC2 = [0 for i in range(n + 1)]
for i in range(2, n + 1):
nC2[i] = i * (i - 1) // 2
cnt = [0]*n
for i in a:
cnt[i - 1] += 1
res = 0
for i in cnt:
res += nC2[i]
for i in a:
print(res - nC2[cnt[i - 1]] + nC2[cnt[i - 1] - 1])
|
p03160 | s461340359 | Wrong Answer | n = int(input())
l = list(map(int, input().split()))
diff = 0
prev = l[0]
i = 1
while(i < n-1):
diff += abs(prev-min(l[i],l[i+1]))
prev = min(l[i],l[i+1])
if(prev == l[i]):
i += 1
else:
i += 2
print(diff) |
p02948 | s081432283 | Wrong Answer | import sys
input = sys.stdin.readline
N, M = map(int, input().split())
BA = []
for _ in range(N):
ab = list(map(int, input().split()))
a = ab[0]
b = ab[1]
BA.append((b,a))
BA.sort(reverse=True)
now = 0
ans = 0
for ba in BA:
a, b = ba[1], ba[0]
if a > M - now:
continue
ans += b
now += 1
print(ans)
|
p03951 | s666154921 | Wrong Answer | N=int(input())
s=input()
t=input()
i=0
count=0
while i<=N-1:
if s[-i-1]==t[i]:
count+=1
i+=1
else:
break
ans=s[:N-count]+t
print(ans) |
p04019 | s152803402 | Accepted | s = input()
flag = [0, 0]
if ("N" in s and "S" in s) or ("N" not in s and "S" not in s):
flag[0] = 1
if ("W" in s and "E" in s) or ("W" not in s and "E" not in s):
flag[1] = 1
if sum(flag) == 2:
print("Yes")
else:
print("No") |
p03730 | s052479562 | Accepted | A, B, C = map(int, input().split())
count = 1
while B > count:
if A * count % B == C:
print("YES")
exit(0)
count += 1
print("NO") |
p03625 | s513076513 | Accepted | from collections import Counter
input()
ans = []
for i, j in Counter(map(int, input().split())).items():
if j >= 4:
ans.append(i)
if j >= 2:
ans.append(i)
if len(ans) >= 2:
ans.sort()
print(ans[-1] * ans[-2])
else:
print(0)
|
p03127 | s893829381 | Accepted | N = int(input())
A = list(map(int, input().split()))
def gcd(x, y):
while y:
x, y = y, x % y
return x
answer = A[0]
for i in range(1, N):
answer = gcd(A[i], answer)
print(answer) |
p02742 | s977570042 | Accepted | H, W = map(int, input().split())
if H==1 or W==1:
print(1)
else:
print((H*W+1)//2) |
p03371 | s389104190 | Accepted | a,b,c,x,y=map(int,input().split())
ans=a*x+b*y
if x>y:
p=2*y*c+(x-y)*min(a,2*c)
ans=min(ans,p)
if x<=y:
p=2*x*c+(y-x)*min(b,2*c)
ans=min(ans,p)
print(ans)
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.