problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p02922 | s719995442 | Accepted | a,b = map(int,input().split())
s = 1
cnt = 0
while (s < b):
s = (s-1) + a
cnt += 1
print(cnt) |
p04030 | s690016762 | Accepted | from collections import deque
s = input()
ans = deque([])
for c in s:
if c=='0':
ans.append('0')
if c=='1':
ans.append('1')
if c=='B' and len(ans)!=0:
del ans[-1]
print(''.join(ans)) |
p03408 | s950619722 | Accepted | n=int(input())
s=[input() for i in range(n)]
m=int(input())
t=[input() for i in range(m)]
a=0
for i in set(s):
a=max(s.count(i)-t.count(i),a)
print(a)
|
p02743 | s902033772 | Accepted | #!/usr/bin/python3
# -*- coding: utf-8 -*-
import math
a, b, c = map(int, input().split())
if 0 < (c - a - b) and 4 * a * b < (c - a - b)**2:
print("Yes")
else:
print("No") |
p02690 | s238782561 | Accepted | X = int(input())
for a in range(-500, 500):
for b in range(-500, 500):
if (a**5)-(b**5) == X:
print(a, b)
exit(0)
|
p03061 | s916829340 | Wrong Answer | import math
from itertools import accumulate
n = int(input())
a = list(map(int, input().split()))
fromleft = list(accumulate(a, math.gcd))
a.reverse()
fromright = list(accumulate(a, math.gcd))
fromright.reverse()
a.reverse()
gcd = []
gcd.append(fromright[1])
for i in range(1, n-1):
gcd.append(math.gcd(fromleft[i-1], fromright[i+1]))
print(i, fromright[i-1], fromleft[i+1])
gcd.append(fromleft[n-2])
if n == 2:
print(max(a[1], a[0]))
else:
print(max(gcd))
|
p03705 | s001701886 | Accepted | N, A, B = map(int, input().split())
ans = (N - 2) * B - (N - 2) * A + 1
ans = max(ans, 0)
print(ans) |
p02719 | s114712226 | Accepted | N, K = map(int,input().split())
N_list = [N,K]
if K == 1:
print(0)
elif N>K:
print(min(N%K,abs(N%K-K)))
elif N == K:
print(0)
else:
print(min(N,abs(N-K)))
|
p02923 | s588346336 | Wrong Answer | N = int(input())
H = list(map(int, input().split()))
diff_H = []
for i in range(1, len(H)):
diff_H += [H[i] - H[i - 1]]
longest = 0
streak = 0
for d_h in diff_H:
if d_h <= 0:
streak += 1
else:
longest = max(streak, longest)
streak = 0
print(longest)
|
p02548 | s857314740 | Accepted | s=0
n=int(input())
for i in range(1,n):
if n%i==0:
s+=n//i-1
else:
s+=n//i
print(s) |
p03281 | s776506056 | Accepted | N = int(input())
ans =[]
for i in range(1,N+1,2):
count = 0
for j in range(1,i+1):
if i % j ==0:
count += 1
if count== 8:
ans.append(i)
print(len(ans)) |
p03087 | s049890194 | Accepted | n, q = map(int, input().split())
s = input()
acc = [0]
sum = 0
for i in range(n-1):
# if s[i:i+2] == "AC":
if s[i] == "A" and s[i+1] == "C":
acc.append(acc[-1] + 1)
else:
acc.append(acc[-1])
for _ in range(q):
l, r = map(int, input().split())
print(acc[r-1] - acc[l-1])
|
p03804 | s763109614 | Accepted | n, m = map(int, input().split())
A = [input() for _ in range(n)]
B = [input() for _ in range(m)]
for idx_row in range(n - m + 1):
for idx_col in range(n - m + 1):
is_ans = True
for B_row_offset in range(m):
if A[idx_row + B_row_offset][idx_col:idx_col + m] != B[B_row_offset]:
is_ans = False
if is_ans:
print('Yes')
exit()
print('No')
|
p03679 | s718315986 | Accepted | # ABC 065: A – Expired?
x, a, b = [int(s) for s in input().split()]
if a - b >= 0:
print('delicious')
elif b - a <= x:
print('safe')
else:
print('dangerous') |
p02797 | s776687156 | Wrong Answer | n, k, s = map(int, input().split())
a = [-1 for i in range(n)]
for i in range(k):
a[i] = s
print(" ".join(map(str,a))) |
p03289 | s242563850 | Accepted | import sys
S = input()
count = 0
for i in range(len(S)):
if i == 0 and S[i] != "A":
print("WA")
sys.exit()
if i == len(S)-1 and count != 1:
print("WA")
sys.exit()
if i != 0 and i != len(S)-2 and S[i].isupper() and S[i] != "C":
print("WA")
sys.exit()
if i >= 2 and i <= len(S)-2 and S[i] == "C":
count += 1
print("AC")
|
p02727 | s301222834 | Wrong Answer | x,y,a,b,c = map(int,input().split())
parr = list(map(int,input().split()))
qarr = list(map(int,input().split()))
rarr = list(map(int,input().split()))
parr.sort(reverse=True)
qarr.sort(reverse=True)
rarr.sort(reverse=True)
parr = parr[:x]
qarr = qarr[:y]
tmparr = parr + rarr
tmparr.sort(reverse=True)
count = sum(tmparr[:x])
pidx = 0
for i in range(x):
if parr[pidx] == tmparr[i]:
pidx += 1
tmparr = qarr + rarr[(x-pidx):]
tmparr.sort(reverse=True)
count += sum(tmparr[:y])
print(count) |
p03720 | s651994441 | Wrong Answer | N, M = map(int,input().split())
a = []
for i in range(M):
K,S = map(int, input().split())
a.append(K)
a.append(S)
print(a)
for i in range(N):
print(a.count(i+1)) |
p02818 | s435368825 | Wrong Answer | A, B, K = [int(i) for i in input().split()]
a = max(A - K, 0)
k = max(K - A, 0)
b = B - k
print("{} {}".format(a, b))
|
p03041 | s698256660 | Accepted |
n, k = map(int, input().split())
S = list(input())
S[k-1] = str.lower(S[k-1])
print("".join(S)) |
p03331 | s103153040 | Accepted | N = int(input())
if N%10 == 0:
print(10)
else:
l = []
for i in range(6):
l.append(int(N%10))
N /= 10
print(sum(l)) |
p03548 | s432184345 | Accepted | x, y, z = list(map(int, input().split()))
print((x - z) // (y + z))
|
p02760 | s302462427 | Accepted | a=open(0).read().split();print('YNeos'[all(t-set(map(a.index,a[10:]))for t in({0,1,2},{0,3,6},{0,4,8},{1,4,7},{2,4,6},{2,5,8},{3,4,5},{6,7,8}))::2]) |
p02768 | s572725749 | Accepted | def comb(n, r, p):
numer = 1
denom = 1
for i in range(n-r+1, n+1):
numer = numer * i % p
for i in range(1, r+1):
denom = denom * i % p
return numer * pow(denom, p-2, p)
def main():
p = pow(10, 9) + 7
n, a, b = map(int, input().split())
print(((pow(2, n, p) - comb(n, a, p) - comb(n, b, p) - 1)) % p)
if __name__ == "__main__":
main() |
p02621 | s516293786 | Accepted | a = int(input())
print(a+a**2+a**3) |
p02783 | s265874199 | Accepted | import math
a,b = map(int,input().split())
print(math.ceil(a/b)) |
p03328 | s248390848 | Wrong Answer | a,b=map(int,input().split())
num,ans=[0],0
for i in range(1,1000):
num.append(num[-1]+i)
if num[-1]>=a:
ans=num[-1]-a
break
print(ans) |
p03493 | s218955100 | Wrong Answer | N=list(input())
N.count('1') |
p02854 | s550869289 | Accepted | from itertools import accumulate
n = int(input())
a = list(map(int, input().split()))
l = list(accumulate(a))
x = 10 ** 10
for i in range(n-1):
x = min(x, abs(l[i]*2-l[-1]))
print(x) |
p02711 | s659741768 | Accepted | N = input()
print("Yes" if "7" in N else "No") |
p02577 | s328910115 | Accepted | n = input()
s = 0
for i in range(len(n)):
s += int(n[i])
if s % 9 == 0:
print('Yes')
else:
print('No') |
p03434 | s198638669 | Wrong Answer | N = int(input()) #入力値
M = str(input())
A = M.split()
print (A[1])
Bob=0
Alice=0
A.reverse() #入力した値ソート
print(A)
for i in range(0,N):
if i % 2 == 0: # Bobが偶数なら実行
Alice=Alice+int(A[i])
else:
Bob=Bob+int(A[i])
print(Alice-Bob) |
p02687 | s560114755 | Wrong Answer | S = input()
print("ARC") |
p03951 | s656559682 | Accepted | N = int(input())
s = input()
t = input()
for i in range(N, 0, -1):
if s[-i:] == t[:i]:
print(N * 2 - i)
exit()
print(2 * N) |
p03219 | s587842936 | Wrong Answer | x,y = map(int,input().split())
print(x+y/2) |
p02572 | s272192472 | Wrong Answer | a=int(input())
b = list(map(int, input().split()))
b.sort()
S=0
c=sum(b)
for i in range(0,a):
S=S+b[i]*(c-b[i])
print(S % (10**9+7))
|
p03037 | s889011608 | Accepted | import sys
input = lambda: sys.stdin.readline().rstrip()
def main():
n, m = map(int, input().split())
L, R = 1, n
for _ in range(m):
l, m = map(int, input().split())
if l > L: L = l
if m < R: R = m
if R-L+1 < 0:
print(0)
else:
print(R-L+1)
if __name__ == '__main__':
main() |
p03681 | s837215603 | Accepted | # C - Reconciled?
import math
N, M = map(int,input().split())
S = math.factorial(min(N,M)) % 1000000007
ans = 0
if abs(N-M) > 1:
ans = 0
elif abs(N-M) == 1:
ans = S*S*max(N,M)
else:
ans = S*S*2
ans = ans % 1000000007
print(ans)
|
p02700 | s338133857 | Accepted | import math
stMap = map(int, input().split())
st = list(stMap)
if (math.ceil(st[0] / st[3]) >= math.ceil(st[2] / st[1])):
print('Yes')
else:
print('No') |
p02702 | s233514812 | Accepted | s = list(input())
s.reverse()
r = [0 for _ in range(2019)]
p = 0
for i in range(len(s)):
p += pow(10, i, 2019) * int(s[i])
p %= 2019
r[p] += 1
ans = 0
for i in r:
if i >= 2:
ans += ((i - 1) * i) // 2
ans += r[0]
print(ans) |
p02773 | s915932299 | Wrong Answer | n = int(input())
dic = {}
for _ in range(n):
s = input()
if dic.get(s) == None:
dic[s] = 1
else:
dic[s] += 1
m = max(dic.items())
l = []
for v in dic.items():
if v[1] == m[1]:
l.append(v[0])
sortl = sorted(l)
for i in range(len(sortl)):
print(sortl[i]) |
p03817 | s319492569 | Accepted | d,m=divmod(int(input()),11);print(2*d+(m>0)+(m>6)) |
p03723 | s965913493 | Wrong Answer | A,B,C = map(int,input().split())
ans = 0
if A == B == C:
print(-1)
else:
while A % 2 == 0 and B % 2 == 0 and C % 2 == 0:
n_A = (B + C) / 2
n_B = (A + C) / 2
n_C = (B + C) / 2
A = n_A
B = n_B
C = n_C
ans += 1
print(ans) |
p02843 | s178044886 | Accepted | x = int(input())
n = x//100
if x % 100 > n * 5:
print("0")
else:
print("1")
|
p04030 | s785051194 | Wrong Answer | if __name__ == '__main__':
s = input()
ans = []
for c in s:
if c == '0':
ans.insert(0, '0')
elif c == '1':
ans.insert(0, '1')
elif c == 'B':
del ans[0:1]
ans = ''.join(ans)
print(ans) |
p03419 | s085346495 | Wrong Answer | N, M = map(int, input().split())
if N == 1:
print(M - 2)
elif M == 1:
print(N - 2)
elif M > 2 and N > 2:
print((M - 2) * (N - 2))
else:
print(0)
|
p03041 | s964980923 | Accepted | def main():
N, K = map(int, input().split())
S = list(input())
S[K-1] = S[K-1].lower()
print("".join(S))
if __name__ == "__main__":
main() |
p03317 | s400562988 | Wrong Answer | import math
n, k = map(int,input().split())
input()
print(int(math.ceil((n - 1)//(k - 1))))
|
p03043 | s162530932 | Accepted | N, K = map(int, input().split())
p = 0
for i in range(1, N + 1):
a = i
n = 1
while n * a < K:
n *= 2
t = 1/n * 1/N
p += t
print(p) |
p03251 | s439090317 | Accepted | import sys
n, m, X, Y = map(int, sys.stdin.readline().split())
*x, = map(int, sys.stdin.readline().split())
*y, = map(int, sys.stdin.readline().split())
def main():
return 'No War' if max(X, max(x)) < min(Y, min(y)) else 'War'
if __name__ == '__main__':
ans = main()
print(ans) |
p02612 | s597709943 | Wrong Answer | a = int(input())
print(1000 - a % 1000)
|
p03645 | s024427969 | Accepted | n,m=map(int,input().split())
side1=set()
side2=set()
for i in range(m):
a,b=map(int,input().split())
if a==1:
side1.add(b)
elif b==n:
side2.add(a)
print(("" if side1 & side2 else "IM")+"POSSIBLE") |
p02939 | s697550927 | Accepted | S=input()
ans=0
tmp=''
pre=''
for i in S:
tmp+=i
if pre!=tmp:
pre=tmp
tmp=''
ans+=1
print(ans) |
p02862 | s201935089 | Wrong Answer | X, Y = map(int, input().split())
a, b = divmod(2*X-Y, 3)
c, d = divmod(2*Y-X, 3)
if (not b == d == 0) or (2*a < c) or (2*c < a):
print(0)
else:
m, n = 1, 1
mod = 10**9+7
for i in range(1, min(a, c)+1):
m = (m * (a+c-i+1)) % mod
n = (n * i) % mod
ans = (m * pow(n, mod-2, mod)) % mod
print(ans) |
p03386 | s335171324 | Wrong Answer | a,b,k=map(int,input().split())
for i in range(a,min(b+1,a+k)):
print(i)
for i in range(max(a,b-k+1),b+1):
print(i) |
p03107 | s578711601 | Accepted | S = list(input())
A = 0
B = 0
for s in S:
if s == '0':
A += 1
else:
B += 1
print(min(A,B)*2) |
p03860 | s457350414 | Accepted | a, b, c = input().split()
print("A" + b[0] + "C") |
p03386 | s518499495 | Wrong Answer | s=input().split()
i=int(s[0])
j=int(s[1])
k=int(s[2])
a=[]
for l in range(k):
if i+l<=j:
a.append(str(i+l))
else:
break
b=int(a[-1])
if b>=i-k and b<i:
for l in range(1,i-b+1):
if b+l<=j:
a.append(str(b+l))
elif b<i-k:
for l in range(k-1,-1,-1):
if j-l<=j:
a.append(str(j-l))
print(*a)
|
p02621 | s959623640 | Wrong Answer | n=int(input())
List=[2 for x in range(n+1)]
List[0]=0
List[1]=1
ans=1
for x in range(2,n+1):
for y in range(2*x,n+1,x):
List[y]+=1
ans+=x*List[x]
print(ans) |
p02629 | s407138647 | Accepted | N = int(input())
ans = ''
while N > 0:
N -= 1
ans += chr(ord('a') + N % 26)
N //= 26
print(ans[::-1])
|
p02639 | s710217111 | Accepted | x=list(map(int,input().split()))
if x[0]==0:
print(1)
elif x[1]==0:
print(2)
elif x[2]==0:
print(3)
elif x[3]==0:
print(4)
elif x[4]==0:
print(5) |
p03359 | s414913143 | Wrong Answer | a,b=map(int,input().split())
print(min(a,b)) |
p03730 | s877479237 | Accepted | a, b, c = map(int, input().split())
ans = 'NO'
for i in range(1, 10*10):
if a * i % b == c:
ans = 'YES'
break
print(ans) |
p02973 | s219940653 | Accepted | import bisect
n = int(input())
a = [int(input()) for i in range(n)][::-1]
color_num = [a[0]]
for i in range(1, n):
if a[i] >= color_num[-1]:
color_num.append(a[i])
else:
temp = bisect.bisect_right(color_num, a[i])
color_num[temp] = a[i]
print(len(color_num)) |
p03261 | s606081052 | Accepted | import sys
def dupchk(seq):
return len(seq) != len(set(seq))
arrw = []
N = int(input())
for i in range(0,N):
W = str(input())
arrw.append(W)
if dupchk(arrw) == False:
for i in range(0,N-1):
if arrw[i][-1] != arrw[i+1][0]:
print("No")
sys.exit()
print("Yes")
else:
print("No") |
p02718 | s893106837 | Accepted | n,m=map(int,raw_input().split())
a=sorted(map(int,raw_input().split()))
print 'No' if 4*m*a[n-m]<sum(a) else 'Yes'
|
p02817 | s989249974 | Accepted | S,T = input().split()
print(T,S,sep='') |
p02548 | s570548233 | Accepted | n=int(input())
ans=0
p=10**6
for i in range(1,n+1):
ans+=n//i
if n%i==0:
ans-=1
print(ans) |
p02922 | s057846262 | Wrong Answer | A, B = map(int, input().split())
count = 1
i = A
while i < B:
count += 1
i = count * A - (count - 1)
print(count) |
p03127 | s634375504 | Wrong Answer | import sys
f = sys.stdin
n = int(f.readline())
a = list(map(int, f.readline().split()))
a.sort()
ans = a[0]
for i in range(n-1):
if a[i] == a[i+1]:
continue
if a[i]%2 == 0:
if a[i] == 2:
ans = 2
break
continue
if a[i]%2 == 1:
ans = 1
break
print(ans) |
p03994 | s329237494 | Accepted | s, k = input(), int(input())
ans = []
a = ord('z') + 1
for i in s:
if a - ord(i) <= k and i != 'a':
k -= a - ord(i)
ans.append(ord('a'))
else:
ans.append(ord(i))
ans[-1] += k % 26
if ans[-1] >= a:
ans[-1] -= 26
print(*map(chr, ans), sep='')
|
p04044 | s959423417 | Wrong Answer | n,l = map(int, input().split())
Li = []
i = 0
while i<n:
li = list(input())
li.sort()
Li.append("".join(li))
i += 1
else:
Li.sort()
print("".join(Li)) |
p02623 | s392154366 | Wrong Answer | x = input().split()
y = input().split()
z = input().split()
s = 0
for nn in range(2000000):
if int(x[2]) < 0:
break
if int(y[0]) <= int(z[0]) :
x[2] = int(x[2]) - int(y[0])
del y[0]
y.append(1000000001)
s += 1
else:
x[2] = int(x[2]) - int(z[0])
del z[0]
z.append(1000000001)
s += 1
print(s-1) |
p02768 | s836218692 | Wrong Answer | def combi(n, r):
p = 1
for i in range(1, r+1):
p = p * (n-i+1) // i
return p
n, a, b = [int(n) for n in input().split()]
c = 0
m = 0
d = 10**9+7
if n%2==0:
for i in range(0, n//2):
print(i)
c = c + combi(n,i) * 2
c += combi(n, n//2)
else:
for i in range(0, n//2+1):
c = c + combi(n,i) * 2
m += combi(n, a)
m += combi(n, b)
m += 1
print((c-m)%d) |
p02818 | s535667894 | Accepted | a, b, k = map(int,input().split())
if a + b < k:
a = 0
b = 0
elif a < k:
b = b + a - k
a = 0
else:
a = a - k
print(a,b) |
p03274 | s518313902 | Wrong Answer | n, k = map(int, input().split())
a = list(map(int, input().split()))
#from numpy import sign
#import numpy as np
out = float('Inf')
for i in range(0, n - k + 1):
ans = abs(a[i] - a[i + k - 1]) + abs(min(a[i], a[i + k - 1]))
out = min(out, ans)
print(out) |
p02629 | s258704620 | Accepted | n = int(input())
alphabet = list("abcdefghijklmnopqrstuvwxyz")
if n <= 26:
print(alphabet[n-1])
else:
ans = ""
while(True):
q, mod = divmod(n, 26)
if mod == 0:
q -= 1
ans = "z" + ans
else:
ans = alphabet[mod-1] + ans
if q < 1:
break
n = q
print(ans) |
p03331 | s331468074 | Wrong Answer | def ii():return int(input())
def iim():return map(int,input().split())
def iil():return list(map(int,input().split()))
def ism():return map(str,input().split())
def isl():return list(map(str,input().split()))
n = ii()
ans = 100
def colsum(s):
ret = 0
for i in s:
ret += int(i)
return ret
for i in range(n):
cand = colsum(str(i))+colsum(str(n-i))
ans = min(cand,ans)
print(ans) |
p02829 | s372193270 | Accepted | a = int(input())
b = int(input())
if a == 1:
if b == 2:
print(3)
elif b == 3:
print(2)
elif a == 2:
if b==1:
print(3)
elif b==3:
print(1)
elif a==3:
if b==1:
print(2)
elif b== 2:
print(1) |
p03345 | s573650208 | Accepted | a,b,c,k=map(int,input().split())
res=0
if k%2==1:res=b-a
else:res=a-b
if(res<10**18):
print(res)
exit()
else:
print("unfair")
exit()
|
p03555 | s627988389 | Accepted |
c1=input()
c2=input()
if c1[0]+c1[1]+c1[2] == c2[2]+c2[1]+c2[0]:
print("YES")
else:
print("NO") |
p02854 | s160707582 | Accepted | from collections import deque
N = int(input())
A = list(map(int, input().split()))
A = deque(A)
left = 0
right = 0
while len(A) > 1:
if (left <= right):
left += A.popleft()
else:
right += A.pop()
if left < right:
left += A.pop()
else:
right += A.pop()
print(max(left, right) - min(left, right))
|
p03371 | s801924824 | Accepted | A,B,C,X,Y=map(int,input().split())
price=0
if A+B>C+C:
minXY=min(X,Y)
price+=minXY*C*2
X-=minXY
Y-=minXY
if A>C+C:
price+=X*2*C
X=0
else:
price+=A*X
X=0
if B>C+C:
price+=Y*2*C
Y=0
else:
price+=B*Y
Y=0
print(price) |
p02778 | s612897968 | Wrong Answer | a = input()
if a:
print("X"*len(a)) |
p03360 | s952475904 | Accepted | def main():
ABC = list(map(int, input().split()))
K = int(input())
ABC.sort()
m = ABC.pop()
mK = m*(2**K)
ans = sum(ABC) + mK
print(ans)
if __name__ == "__main__":
main()
|
p03038 | s242894590 | Accepted | n, m = map(int, input().split())
A = list(map(int, input().split()))
B = [[] for _ in range(m)]
for i in range(m):
B[i] = list(map(int, input().split()))
B.sort(key=lambda x: -x[1])
_A = []
cnt = 0
for i in range(m):
_A.extend([B[i][1]]*B[i][0])
cnt += B[i][0]
if cnt > n:
break
A += _A
A.sort(reverse=True)
print(sum(A[:n])) |
p02786 | s848717834 | Wrong Answer | H = int(input())
cnt = 1
while H > 2:
cnt += 1
H = H/2
print(H)
H = 2 ** (cnt-1)
print('new:', H)
cnt = H
two = H
while two/2 > 1:
cnt += two//2
two = two//2
print(int(cnt+1))
|
p03475 | s671716210 | Wrong Answer | n=int(input())
a=[list(map(int,input().split())) for _ in range(n-1)]
def arrive(time,now):
time=(time+a[now][2]-1)//a[now][2]*a[now][2]+a[now][0]
if now==n-2:
return time
else:
return arrive(time,now+1)
for i in range(n-1):
print(arrive(a[i][1],i))
print(0) |
p02689 | s763416871 | Accepted | n,m = map(int,input().split())
h = list(map(int,input().split()))
ans = []
for i in range(m):
a,b = map(int,input().split())
if h[a-1] < h[b-1]:
if not a-1 in ans:
ans.append(a-1)
elif h[a-1] > h[b-1]:
if not b-1 in ans:
ans.append(b-1)
else:
if not a-1 in ans:
ans.append(a-1)
if not b-1 in ans:
ans.append(b-1)
print(n-len(ans))
|
p02582 | s964368981 | Wrong Answer | I=input()
count = 0
if I[0] == "R":
if I [1] == "R":
if I[2] == "R":
print(3)
else:
print(2)
else:
print(1)
else:
if I[1] == "S":
if I[2] == "S": print(2)
else:
print(1)
else:
print(0) |
p02792 | s898985200 | Wrong Answer | n=int(input())
a=0
for i in range(1,n+1):
for j in range(i,n+1):
if str(i)[0]==str(j)[-1] and str(j)[0]==str(i)[-1]:
a+=1
print(a) |
p02842 | s335774081 | Accepted | from math import floor, ceil
n = int(input())
f = floor(n/1.08)
c = ceil(n/1.08)
n2 = floor(f*1.08)
n3 = floor(c*1.08)
if n == n2:
print(f)
elif n == n3:
print(c)
else:
print(':(') |
p03103 | s522875007 | Wrong Answer | N, M = map(int, input().split())
store_list = {}
for _ in range(N):
A, B = map(int, input().split())
store_list[A] = B
store_list = sorted(store_list.items(), key=lambda x:x[0])
ans = 0
for A,B in store_list:
num = min(M, B)
ans += A * num
M -= num
if M == 0:
break
print(ans) |
p03644 | s149366491 | Wrong Answer | n = int(input())
ans=0
for i in range(n):
if i%2==0:
ans+=1
print(ans) |
p02785 | s764569759 | Accepted | n,k=map(int,input().split())
h=list(map(int,input().split()))
hh=sorted(h)
if(n<=k):
print(0)
else:
print(sum(hh[:(n-k)])) |
p03061 | s521252072 | Accepted | from fractions import gcd
N, = map(int, input().split())
X = list(map(int, input().split()))
rs = [0] * N
for i in range(N-1, 0, -1):
rs[i-1] = gcd(rs[i], X[i])
ls = [0] * N
for i in range(N-1):
ls[i+1] = gcd(ls[i], X[i])
s = 0
for i in range(N):
s = max(s, gcd(ls[i], rs[i]))
print(s)
|
p02713 | s815069071 | Accepted | k=int(input())
from math import gcd
gcd_sum=[0]*201
ans=0
for i in range(1,k+1):
for j in range(1,k+1):
gcd_sum[i]+=gcd(i,j)
for a in range(1,k+1):
for b in range(1,k+1):
g=gcd(a,b)
ans += gcd_sum[g]
print(ans) |
p03994 | s352709163 | Wrong Answer | S = input()
K = int(input())
rest = K
oz = ord('z')
oa = ord('a')
ans = list(S)
for ci in range(len(S)):
check = oz - ord(S[ci]) + 1
if rest >= check:
ans[ci] = 'a'
rest -= check
if rest >= 0:
for i in range(rest%26):
if oz == ord(ans[-1]):
ans[-1] = 'a'
else:
ans[-1] = chr(ord(ans[-1])+1)
print("".join(ans))
|
p03632 | s323563023 | Wrong Answer | i = list(map(int, input().split()))
A=i[0]
B=i[1]
C=i[2]
D=i[3]
if(C-B>=0 or A-D>=0):
print(0)
elif(A<D):
print(B-C)
else:
print(D-A) |
p03035 | s387714375 | Accepted | import sys
a, b = map(int, sys.stdin.readline().split())
def main():
if a >= 13: c = b
elif a >= 6: c = b // 2
else: c = 0
print(c)
if __name__ == '__main__':
main() |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.