problem_id stringclasses 428 values | submission_id stringlengths 10 10 | status stringclasses 2 values | code stringlengths 5 816 |
|---|---|---|---|
p02615 | s630184363 | Wrong Answer | import heapq
def solve(n, a):
a = sorted(a, reverse=True)
ans = sum(a[:1])
que = [(-a[1], -a[0])]
heapq.heapify(que)
for i in range(2, n):
x, y = heapq.heappop(que)
ans += min(-x, -y)
heapq.heappush(que, (-a[i], x))
heapq.heappush(que, (-a[i], y))
return ans
n = int(input())
a = list(map(int, input().split()))
print(solve(n, a)) |
p02973 | s832152540 | Accepted |
from bisect import *
def resolve():
N = int(input())
A = [int(input()) for i in range(N)]
A.reverse()
B =[A[0]]
A=A[1:]
for i in A:
if i >= B[-1]:
B.append(i)
continue
point = bisect_right(B,i)
B[point]=i
print(len(B))
if __name__ == "__main__":
resolve() |
p02760 | s097628219 | Accepted | A1 = [int(_) for _ in input().split()]
A2 = [int(_) for _ in input().split()]
A3 = [int(_) for _ in input().split()]
P = [A1, A2, A3]
for i in range(3):
P.append([A1[i], A2[i], A3[i]])
P.append([A1[0], A2[1], A3[2]])
P.append([A1[2], A2[1], A3[0]])
N = int(input())
B = []
for i in range(N):
b = int(input())
B.append(b)
for p in P:
if len(set(p) & set(B)) == 3:
print('Yes')
break
else:
print('No')
|
p02689 | s968062173 | Wrong Answer | n, m = map(int, input().split())
h = list(map(int, input().split()))
l = [0] * n
for i in range(m):
a, b = map(int, input().split())
l[a-1] = max(h[a-1], h[b-1])
l[b-1] = max(h[a-1], h[b-1])
s = set(l)
if 0 in s:
print(len(s) - 1)
else:
print(len(s))
|
p03380 | s415498852 | Accepted | import bisect
n=input()
a=sorted(map(int,input().split()))
m=a[-1]
q=bisect.bisect_right(a,m/2)
p=q-1
if abs(m/2-a[p])>abs(m/2-a[q]):print(m,a[q])
else:print(m,a[p]) |
p03986 | s182318940 | Wrong Answer | X=input()
a=X
if len(X)<=100000:
while 'ST' in a:
a=a.replace('ST','',int(1e5))
print(len(a)) |
p02970 | s967828163 | Accepted | N, D = map(int, input().split())
ans = 0
while N > 0:
N -= 2*D + 1
ans += 1
print(ans) |
p03345 | s430951529 | Accepted | a, b, c, k = map(int, input().split())
flg = 0
if a - b > 0 and k % 2 == 0 or a-b < 0 and k % 2 == 0:
flg = 1
elif a - b < 0 and k % 2 == 1 or a-b > 0 and k % 2 == 1:
flg = -1
if abs(a-b) > 10 ** 18:
print("Unfair")
else:
print((a-b)*flg) |
p04019 | s659466253 | Accepted | s = list(input())
if len(set(s)) == 4:
print('Yes')
elif len(set(s)) == 2:
if ('S' in s and 'N' in s) or ('E' in s and 'W' in s):
print('Yes')
else:
print('No')
else:
print('No') |
p03695 | s897920438 | Wrong Answer | is_alive = [0]*8#各ランク
N = int(input())
a = list(map(int,input().split()))
count_over=0
for i in range(0,N,1):
if a[i]>=3200:
count_over +=1
else:
is_alive[a[i]//400]=1
print(max(0,sum(is_alive)),min(sum(is_alive)+count_over,8)) |
p03633 | s865162245 | Accepted | from fractions import gcd
def lcm(x, y):
return (x * y) // gcd(x, y)
def solve():
N = int(input())
ans = int(input())
for _ in range(N - 1):
ans = lcm(ans, int(input()))
print(ans)
if __name__ == '__main__':
solve()
|
p03219 | s087806154 | Accepted | #!/usr/bin/env python3
a, b = map(int, input().split())
print(int(a + b / 2)) |
p03910 | s618090650 | Accepted | n = int(input())
score = 0
i = 0
ans_list = []
while score < n:
i += 1
score += i
ans_list.append(i)
if score == n:
for k in range(len(ans_list)):
print(ans_list[k])
else:
ans_list.remove(score - n)
for k in range(len(ans_list)):
print(ans_list[k]) |
p03474 | s926759749 | Wrong Answer | x,y=map(int, input().split())
S=input()
if len(S)==x+y and S[x]=='-':
print('Yes')
else:
print('No') |
p03160 | s371386633 | Accepted | import sys
import io
def main():
f = sys.stdin.buffer
n = int(f.readline())
h = list(map(int, f.readline().split()))
p0, p1 = 0, abs(h[1] - h[0])
for i in range(2, n):
p2 = min(p1 + abs(h[i] - h[i - 1]), p0 + abs(h[i] - h[i - 2]))
p0 = p1
p1 = p2
print(p1)
if __name__ == "__main__":
main()
|
p02633 | s326465970 | Accepted | import argparse
import collections
import logging.config
import sys
import csv
import numpy as np
def tstr(n):
total = n
cnt = 1
while total%360 != 0:
# print (str(cnt) + "," + str(total))
cnt += 1
total += n
return (cnt)
def main():
N = int(input())
print (tstr(N))
if __name__ == '__main__':
main()
|
p03035 | s787293059 | Accepted | #! python3
# solve127A.py
age,cost = map(int,input().split())
if age <= 5:
cost = 0
elif 6 <= age <= 12:
cost = cost//2
elif 7 <= age:
cost = cost
print(cost) |
p03773 | s440026209 | Wrong Answer | a, b = list(map(int, input().split()))
ans = a + b if a + b <= 24 else a + b - 24
print(ans)
|
p03799 | s773356479 | Accepted | N, M = map(int, input().split())
M = M//2
if N>=M:
print(M)
else:
print((N+M)//2) |
p03544 | s798632949 | Wrong Answer | N = int(input())
A =[2,1]
if N <= 2:
print(A[N-1])
exit()
for i in range(2,N):
A.append(A[i-1]+A[i-2])
print(A[-1]) |
p02708 | s803484102 | Wrong Answer | def culc(n, k):
return k*(-2*k**2+3*n*k+(3*n+8))//6
N, K = map(int, input().split())
MOD = 10**9 + 7
print(culc(N, N+1)-culc(N, K-1)%MOD) |
p02939 | s425798261 | Accepted |
S = input()
ans = 0
prev,now = "",""
for i in range(len(S)):
now += S[i]
if now != prev:
ans += 1
prev,now = now,""
print(ans)
|
p04034 | s859207723 | Wrong Answer | n, m = map(int, input().split())
A = [[1, 0]] + [[0, 1] for _ in range(n-1)]
for _ in range(m):
x, y = map(lambda x: int(x)-1, input().split())
if sum(A[x]) == 1:
if A[x][0] == 1:
A[x][0] -= 1
A[y][0] += 1
else:
A[x][1] -= 1
A[y][1] += 1
else:
A[x][1] -= 1
A[y][0] += 1
print(sum(a[0] > 0 for a in A))
|
p02879 | s004049604 | Accepted | a,b = map(int,input().split())
if 0<a<10 and 0<b<10:
print(a*b)
else:
print(-1) |
p02801 | s445646056 | Wrong Answer | from sys import stdin
input = stdin.readline()
alpha = 'abcdefghijklmnopqrstuvwxyz'
# alpha = [i for i in alpha]
flag = False
for i in alpha:
if flag:
print(i)
flag =False
if i == input:
flag = True |
p03407 | s752835491 | Accepted | a,b,c = map(int, input().split())
if a+b >= c :
print("Yes")
else:
print("No") |
p03012 | s343383655 | Wrong Answer | N = int(input())
WL = list(map(int, input().split()))
ALLweight = sum(WL)
HALFweight = ALLweight / 2
OVERweight = 0
for i in range(N):
OVERweight += WL[i]
if OVERweight >= HALFweight:
print(abs((ALLweight-OVERweight)-OVERweight))
exit() |
p02743 | s121552778 | Accepted | from decimal import Decimal, getcontext
getcontext().prec = 1000
a, b, c = map(Decimal, input().split())
print("Yes" if a+b+Decimal(2)*((a*b)**Decimal(0.5)) < c else "No")
|
p03109 | s946665341 | Accepted | y,m,d=[int(i) for i in input().split('/')]
if y<2019:
print('Heisei')
elif 2019<y:
print('TBD')
else:
if m<4:
print('Heisei')
elif 4<m:
print('TBD')
else:
if d<=30:
print('Heisei')
else:
print('TBD')
|
p03293 | s078075886 | Wrong Answer | s = list(input())
t = list(input())
for _ in range(len(s)-1):
if s == t:
print("Yes")
quit()
else:
end = s.pop(0)
s.append(end)
print("No")
|
p02994 | s723084696 | Wrong Answer | n, l = map(int, input().split())
a = list([k + l for k in range(n)])
sum_ = sum(a)
min_ = float("inf")
for j in range(n):
min_ = min(min_, abs(a[j]))
print(sum_ - min_)
|
p03042 | s235343604 | Wrong Answer | def main():
S = input()
a = S[0:2]
b = S[2:4]
if (int(a) >= 13 and int(b) >= 13) or (a == "00" and b == "00"):
ans = "NA"
elif (int(a) >= 13 and b == "00") or (int(b) >= 13 and a == "00"):
ans = "NA"
elif int(a) >= 13:
ans = "YYMM"
elif int(b) >= 13:
ans = "MMYY"
else:
ans = "AMBIGUOUS"
print(ans)
if __name__ == "__main__":
main() |
p02707 | s830779255 | Accepted | import collections
N = int(input())
A = list(map(int, input().split()))
c = collections.Counter(A)
for i in range(1, N+1):
print(c[i]) |
p03107 | s221595617 | Accepted | S = input()
num0 = S.count("0")
num1 = S.count("1")
print(2*min(num0, num1)) |
p03672 | s024462394 | Accepted | import sys
S = list(input())
nS = S
i = 0
while len(nS) > 2:
i += 1
lns = len(S) - 2*i
nS = S[:lns]
nS1 = "".join(nS[:lns//2])
nS2 = "".join(nS[lns//2:])
if nS1 == nS2:
print(len(nS))
sys.exit()
print(1) |
p02548 | s545547240 | 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 = input_int()
ans = 0
for i in range(1, n):
ans += (n - 1) // i
print(ans)
return
if __name__ == "__main__":
main()
|
p03795 | s147297758 | Wrong Answer | n = int(input())
x = n * 800
y = n / 20
ans = int(x) - int(y*200)
print(str(ans)) |
p02801 | s409784818 | Accepted | c = input()
num2alpha = lambda x: chr(x+64)
alpha2num = lambda y: ord(y) - ord('A') + 1
print(num2alpha(alpha2num(c) + 1))
|
p03062 | s723193459 | Accepted | #!/usr/bin/env python3
from functools import reduce
def II(): return int(input())
def MII(): return map(int, input().split())
def LII(): return list(map(int, input().split()))
def main():
N = II()
A = LII()
mn = 10 ** 9
n = 0
ans = 0
for a in A:
ans += abs(a)
mn = min(mn, abs(a))
if a < 0:
n += 1
if n % 2 == 0:
print(ans)
else:
print(ans - 2 * mn)
if __name__ == '__main__':
main()
|
p02879 | s057362611 | Wrong Answer | a, b = map(int,input().split())
if a * b > 81:
print(-1)
else:
print(a * b) |
p04045 | s323124777 | Accepted | import sys
input = sys.stdin.readline
def main():
N, K = [int(x) for x in input().split()]
D = [int(x) for x in input().split()]
Dset = set(D)
for i in range(N, 1000000):
for j in str(i):
if int(j) in Dset:
break
else:
print(i)
return
if __name__ == '__main__':
main()
|
p02730 | s982413339 | Wrong Answer | S=input()
N=len(S)
r_S=S[::-1]
c1=int((N-1)/2)
c2=int((N+3)/2)
S1=S[:c1]
r_S1=S1[::-1]
S2=S[(c2-1):]
r_S2=S2[::-1]
#kaibun hantei
if S1==r_S1 and S1==r_S1 and S2==r_S2:
print("Yes")
else:
print("No") |
p02785 | s225559260 | Accepted | a, b = map(int, input().split())
c = list(map(int, input().split()))
c = sorted(c, reverse=True)
d = 1
ans = 0
for i in c:
if(d<=b):
d+=1
else:ans+=i
#print(i)
print(ans) |
p02681 | s569794387 | Accepted | S = input()
T = input()
for i, s in enumerate(S):
if s != T[i]:
print("No")
break
else:
print("Yes")
|
p02633 | s228811126 | Accepted | import math
import sys
sys.setrecursionlimit(10 ** 6)
INF = float("inf")
MOD = 10 ** 9 + 7
def input():
return sys.stdin.readline().strip()
def main():
X = int(input())
lcm = X * 360 // math.gcd(X, 360)
ans = lcm // X
print(ans)
if __name__ == "__main__":
main()
|
p02699 | s612827322 | Wrong Answer | a, b = map(int, input().split())
print("unsafe" if (a < b) else "safe") |
p03986 | s092223286 | Wrong Answer | from sys import stdin
def main():
input = stdin.readline
x = input()
s = 0
count = 0
for cur in x:
if cur == "S":
s += 1
else:
if s != 0:
s -= 1
else:
count += 2
print(count)
if __name__ == '__main__':
main()
|
p02608 | s855603922 | Accepted | n=int(input())
ans=[0]*(n+1)
r=int(n**0.5)+1
for x in range(1,r):
for y in range(1,r):
for z in range(1,r):
t=x**2+y**2+z**2+x*y+y*z+z*x
if t <= n:
ans[t]+=1
for i in ans[1:]:
print(i)
|
p02687 | s742956103 | Wrong Answer | s = input()
if s == "ABC":
print("ARC")
if s == "ARC":
print("ABC") |
p02873 | s047753451 | Accepted | S=input()
N=len(S)+1
l=[0]*N
for i in range(N-1):
if S[i]=="<":
l[i+1]=l[i]+1
for i in range(N-2,-1,-1):
if S[i]==">":
l[i]=max(l[i+1]+1,l[i])
print(sum(l)) |
p02706 | s795423242 | Wrong Answer | import math
N,M = map(int,input().split())
A = list(map(int,input().split()))
A_sum = sum(A)
print(N-A_sum)
|
p03162 | s468957811 | Wrong Answer | n = int(input())
happy = 0
yesterday = -1
for i in range(n):
M = 0
do = list(map(int, input().split()))
for j in range(3):
if j != yesterday and M < do[j]:
M = do[j]
today = j
elif j != yesterday and M == do[j]:
today = -1
happy += M
yesterday = today
print(happy) |
p02771 | s941763342 | Wrong Answer | a, b, c = map(int, input().split())
list = (0, b - a, c - a)
cnt = 0
for i in list:
if i == 0:
cnt += 1
if cnt == 2:
print('Yes')
else:
print('No')
|
p03059 | s463729302 | Accepted | def main():
A, B, T = map(int, input().split())
print((T // A) * B)
if __name__ == '__main__':
main() |
p02707 | s322855714 | Wrong Answer | N = int(input())
A = list(map(int,input().split()))
print(A.count(i+1) for i in range(N))
|
p02747 | s054269830 | Wrong Answer |
input_line = input()
Line = list(input_line)
flag = 0
for i in Line:
# print(i)
if i == "h" and flag == 0:
flag = 1
elif i == "i" and flag ==1:
flag = 0
else:
flag = 2
print("No")
if flag == 1:
print("No")
elif flag == 0:
print("Yes")
|
p03377 | s538180726 | Accepted | A, B, X = list(map(int,input().split()))
print('YES' if A <= X < A+B else 'NO') |
p02595 | s604330972 | Accepted | from numpy import*
x,y=loadtxt(open(0)).T
print(sum(x*x+y*y<=y[0]**2)) |
p02963 | s553817243 | Accepted | L = 10 ** 9
N = int(input())
y = (N - 1) // L + 1
x = (-N) % L
print(0, 0, L, 1, x, y) |
p03407 | s200426464 | Wrong Answer | A, B, C = map(int, input().split())
print('Yes' if A+2*B>=C else 'No') |
p03971 | s737242981 | Wrong Answer | N,A,B = map(int,input().split())
S = list(input())
ans = []
df = 0
f = 0
for i in range(N):
s = S[i]
if s == 'c':
ans.append('No')
continue
elif s == 'a':
df += 1
if df < A:
ans.append('Yes')
else:
ans.append('No')
elif s == 'b':
df += 1
f += 1
if df < A and f <= B:
ans.append('Yes')
else:
ans.append('No')
print('\n'.join(ans))
|
p02795 | s567727171 | Accepted | h = int(input())
w = int(input())
n = int(input())
if w>=h:
print( -(-n//w) )
else:
print( -(-n//h) ) |
p02705 | s335108601 | Wrong Answer | n = int(input())
print(3.1415 * n) |
p03352 | s446091947 | Accepted | X = int(input())
ans = 1
for b in range(1,X):
for p in range(2,10):
if b**p<=X:
ans = max(ans,b**p)
print(ans) |
p03827 | s598955132 | Wrong Answer | n=input();s=input();print(sum([[-1,1][i=='I'] for i in s])+1) |
p02829 | s803171457 | Wrong Answer | a = int(input())
b = int(input())
if (a == 1 and b == 2) or (a == 2 and b == 1):
print(3)
elif (a == 1 and b == 3) or (a == 3 and b == 1):
print(2)
elif (a == 2 and b == 3) or (a == 2 or b == 3):
print(1) |
p03037 | s342142975 | Accepted | N, M = map(int, input().split())
L, R = [0]*M, [0]*M
for i in range(M):
L[i],R[i] = map(int, input().split())
a, b = max(L), min(R)
if a<=b:
print(b-a+1)
else:
print(0) |
p03487 | s892872721 | Wrong Answer | from collections import Counter
N = int(input())
A = map(int, input().split())
C = Counter(A)
cnt = 0
for key, value in C.items():
cnt += min(value, abs(key - value))
print(cnt)
|
p03612 | s828201005 | Wrong Answer | n = int(input())
p = list(map(int,input().split()))
i = 1
res = 0
while i < n-1:
if p[i-1] == i:
res += 1
i += 1
i += 1
print(res) |
p03479 | s767767210 | Accepted | def Multiple_Gift(x , y):
ans = 1
while x < y:
if x * 2 <= y:
ans += 1
x = x * 2
return ans
def main():
x , y = map(int , input().split())
print(Multiple_Gift(x , y))
if __name__ == '__main__':
main()
|
p03645 | s976496106 | Wrong Answer | import sys
inint = lambda: int(sys.stdin.readline())
inintm = lambda: map(int, sys.stdin.readline().split())
inintl = lambda: list(inintm())
instrm = lambda: map(str, sys.stdin.readline().split())
instrl = lambda: list(instrm())
n, m = inintm()
ship = []
t = 0
for _ in range(m):
a, b = inintm()
ship.append([a, b])
if a == 1:
t = b
if t == 0:
print("IMPOSSIBLE")
exit()
for i in ship:
if i[0] == t and i[1] == n:
print("POSSIBLE")
exit()
print("IMPOSSIBLE")
|
p02765 | s939093084 | Accepted | n,r=map(int,input().split())
if n>=10:
print(r)
else:
print(r+(10-n)*100) |
p02676 | s247386019 | Wrong Answer | K = int(input())
S = input().lower()
if len(S) < K:
print(S)
elif len(S) > K:
print(f"{S[0:K]}{'...'}")
|
p03745 | s455851899 | Accepted | n = int(input())
a = list(map(int, input().split()))
up = False
down = False
ans = 1
for i in range(1, n):
if up:
if a[i] < a[i-1]:
ans += 1
up = False
elif down:
if a[i] > a[i-1]:
ans += 1
down = False
else:
if a[i] > a[i-1]:
up = True
elif a[i] < a[i-1]:
down = True
print(ans) |
p02900 | s635807163 | Accepted | from math import gcd
def factorization(N):
res=[]
for i in range(2,int(N**(1/2))+2):
if not N%i:
r=0
while not N%i:
N//=i
r+=1
res.append((i,r))
if N>1:
res.append((N,1))
return res
a,b=map(int,input().split())
g=gcd(a,b)
print(1+len(factorization(g))) |
p02705 | s671862912 | Accepted | r = int(input())
print(3.1415*2*r)
|
p03126 | s755787890 | Accepted | n, m = map(int, input().split())
k = []
for i in range(n):
a = list(map(int, input().split()))
k.append(a)
ans = [0]*m
for i in range(n):
for j in range(1,k[i][0]+1):
ans[k[i][j]-1] += 1
print(ans.count(n)) |
p02726 | s701989407 | Wrong Answer | N, X, Y = map(int, input().split())
d = {}
for i in range(1, N):
for j in range(i + 1, N + 1):
if j >= Y and i <= X:
d[(i, j)] = min(j - i - (Y - X) + 1, j - i)
elif i <= X:
d[(i, j)] = min(j - i, 2 * Y - i - j)
else:
d[(i, j)] = j - i
ans = [0] * (N - 1)
for k, v in d.items():
ans[v - 1] += 1
for v in ans:
print(v) |
p03721 | s152029718 | Wrong Answer | from collections import defaultdict
n, k = map(int, input().split())
dd = defaultdict(int)
for _ in range(n):
a, b = map(int, input().split())
dd[a] += b
cnt = 0
for key, v in dd.items():
cnt += v
if k <= cnt:
print(key)
break |
p03160 | s107783922 | Wrong Answer | def main():
n = int(input())
h = list(map(int, input().split()))
# dpテーブル作成,スタート地点のdpテーブルの値は0にする
dp =[10**5] * n
dp[0] = 0
dp[1] = abs(h[0] - h[1])
for i in range(2,n):
dp[i] = min([dp[i], dp[i-1]+abs(h[i-1]-h[i]), dp[i-2]+abs(h[i-2]-h[i])])
print(dp[n-1])
if __name__ == "__main__":
main() |
p03779 | s690789949 | Accepted | x = int(input())
a = 1
now = 0
while True:
now += a
a += 1
if now >= x:
print(a - 1)
exit() |
p02628 | s937668348 | Accepted | n,k = map(int,input().split())
p = sorted(list(map(int,input().split())))
print(sum(p[:k]))
|
p02725 | s615582254 | Wrong Answer | k, n = map(int , input().split())
lis = list(map(int,input().split()))
mi = [min(lis)] * n
li = [x - y for (x, y) in zip(lis, mi)]
ans1 = 0
for i in range(n - 1):
ans1 += li[(i + 1)] - li[i]
chuten = k / 2
for i,j in enumerate(li):
if j > chuten:
li[i] = j - k
li.sort()
ans2 = 0
for i in range(n - 1):
ans2 += li[(i + 1)] - li[i]
print(min(ans1, ans2))
|
p02982 | s138709669 | Accepted | import sys
import numpy as np
n, d, *x = map(int, sys.stdin.read().split())
x = np.array(x, dtype=np.int64).reshape(n, d)
def main():
cnt = 0
for i in range(n-1):
for j in range(i+1, n):
dist = np.sqrt(((x[i] - x[j]) ** 2).sum())
if dist == int(dist):
cnt += 1
return cnt
if __name__ == '__main__':
ans = main()
print(ans) |
p03437 | s952737284 | Accepted | X,Y = map(int, input().split())
if X%Y == 0:
print(-1)
else:
i = 1
while 1:
if X*i > 10**18:
print(-1)
break
elif X*i%Y!=0:
print(X*i)
break
else:
i+= 1 |
p03145 | s791930998 | Wrong Answer | AB,BC,CU = input().split()
AB = int(AB)
BC = int(BC)
CU = int(CU)
area = (AB * BC )/ 2
print(area) |
p02779 | s046237605 | Wrong Answer | n = int(input())
a = list(map(int, input().split()))
d = {}
for x in a:
d[x] = d.get(x, 0) + 1
t = max(d.values())
print("Yes") if t == 1 else print("No")
|
p03760 | s308299036 | Wrong Answer | O = input()
#atcoderbeginnercontest
E = input()
#atcoderregularcontest
S = []
if len(O) == len(E):
for i in range(len(O)):
S.append(O[i] + E[i])
else:
for i in range(len(E)):
S.append(O[i] + E[i])
S.append(O[-1])
print("".join(S)) |
p03345 | s262240400 | Wrong Answer | A,B,C,K=map(int, input().split())
ans=0
ans=B-A if K %2==0 else A-B
if ans > 10**18:
print('Unfair')
else:
print(ans) |
p03612 | s864766428 | Accepted | N = int(input())
P = list(map(int, input().split()))
count = 0
for i, p in enumerate(P):
if p == i+1 and i == N-1:
count += 1
elif p == i+1:
count += 1
P[i] = P[i+1]
P[i+1] = p
print(count) |
p03699 | s119227055 | Accepted | n=int(input())
s=[int(input()) for _ in range(n)]
sum=0
for i in s:
sum+=i
if sum%10!=0:
print(sum)
exit()
s.sort()
for i in s:
if i%10!=0:
sum-=i
print(sum)
exit()
print(0)
|
p02792 | s010370231 | Accepted | N=int(input())
memo=[[0 for _ in range(10)] for _ in range(10)]
for i in range(1, N+1):
memo[i//(10**(len(str(i))-1))][i%10]+=1
ans=0
for i in range(10):
for j in range(10):
ans+=memo[i][j]*memo[j][i]
print(ans) |
p02910 | s879741401 | Accepted | # Tap Dance
# input
S = input()
# solve
cond1 = sum([s == 'L' for s in S[::2]])
cond2 = sum([s == 'R' for s in S[1::2]])
# output
if cond1 == 0 and cond2 == 0:
print('Yes')
else:
print('No')
|
p02778 | s750987619 | Accepted | print('x'*len(input())) |
p02783 | s913841200 | Wrong Answer | h, a = map(int, input().split())
n = 0
while h <= 0 :
h - a
n += 1
print(n) |
p02754 | s668007446 | Wrong Answer | n, a, b = map(int, input().split())
c = a + b
if c < n:
a += n-c
print(a) |
p03487 | s535321294 | Wrong Answer | from collections import defaultdict
from collections import deque
from collections import Counter
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 = readInt()
c = Counter(readInts())
ans = 0
for i in c:
if c[i]-i>0:
ans+=c[i]-i
else:
ans+=min(i-c[i],c[i])
print(ans) |
p02820 | s707362856 | Accepted | n, k = map(int, input().split())
r, s, p = map(int, input().split())
t = input()
table = [-1 for i in range(len(t) + k)]
count = 0
for i in range(len(t)):
if table[i-k] != -1 and table[i-k] == t[i]:
continue
elif t[i] == "r":
count += p
table[i] = "r"
elif t[i] == "s":
count += r
table[i] = "s"
elif t[i] == "p":
count += s
table[i] = "p"
print(count) |
p02694 | s492827588 | Accepted | import math
money = 100
x = int(input())
i = 0
while money < x:
money = math.floor(money*1.01)
i += 1
print(i) |
p02695 | s457721499 | Accepted | #import sys
#import numpy as np
import math
#from fractions import Fraction
import itertools
from collections import deque
from collections import Counter
#import heapq
#from fractions import gcd
#input=sys.stdin.readline
import bisect
n,m,q=map(int,input().split())
l=[i for i in range(1,m+1)]
ab=[list(map(int,input().split())) for _ in range(q)]
ans=0
for res in itertools.combinations_with_replacement(l, n):
ans_r=0
for i in range(q):
a,b,c,d=ab[i]
if c==res[b-1]-res[a-1]:
ans_r+=d
ans=max(ans,ans_r)
print(ans) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.