problem_id stringclasses 428 values | submission_id stringlengths 10 10 | status stringclasses 2 values | code stringlengths 5 816 |
|---|---|---|---|
p02993 | s681828386 | Wrong Answer | s = input()
if len([i for i in range(len(s)-1) if s[i]==s[i+1]]) == len(s)-1:
print('Good')
else:
print('Bad')
|
p02882 | s989292778 | Accepted | import math
a,b,x = map(int,input().split())
if x <= a*a*b/2:
print(90-math.degrees(math.atan2(2*x/(a*b),b)))
elif x > a*a*b/2:
print(math.degrees(math.atan2(2*b-(2*x/(a**2)),a))) |
p03437 | s557972271 | Wrong Answer | import math
input = str(input()).split(" ")
for index in range(len(input)):
input[index] = int(input[index])
x = input[0]
y = input[1]
def test(x, y):
for index in range(2, y + 1):
if (x * index % y != 0):
return x * index
return -1
print(test(x,y))
|
p03131 | s850708385 | Accepted | K ,A, B = map(int,input().split())
if B - A <= 2 or K <= A: #δΊ€ζγγ¦γε’γγγͺγorγιγγγΉγ±γγγ«δΊ€ζγ§γγͺγ
ans = K + 1
else:
n = K - (A + 1)
n_loop = n // 2
n_tataku = n % 2
ans = B + n_loop * (B-A) + n_tataku
print(ans)
|
p02783 | s555003471 | Accepted | H, A = map(int,input().split())
if H % A == 0:
print(H // A)
else:
print((H // A) + 1)
|
p02681 | s332090353 | Wrong Answer | # -*- coding: <encoding name> -*-
import sys
input = sys.stdin.readline
input = sys.stdin.buffer.readline
def RD(): return sys.stdin.read()
def II(): return int(input())
def MI(): return map(int,input().split())
def LI(): return list(map(int,input().split()))
def TI(): return tuple(map(int,input().split()))
def RN(N): return [input().strip() for i in range(N)]
def main():
S = input()
T = input()
Tl = T[:-1]
if Tl == S:
print("Yes")
else:
print("No")
if __name__ == "__main__":
main() |
p03239 | s725362661 | Accepted | n,t = map(int,input().split())
c = [list(map(int,input().split())) for i in range(n)]
p = []
for i in range(n):
if c[i][1] <= t:
p.append(c[i][0])
if len(p) == 0:
print('TLE')
else:
p.sort()
print(p[0]) |
p02600 | s661505199 | Wrong Answer | X = int(input())
if (400 <= X) and (X < 599):
print(8)
if (600 <= X) and (X < 799):
print(7)
if (800 <= X) and (X < 999):
print(6)
if (1000 <= X) and (X < 1199):
print(5)
if (1200 <= X) and (X < 1399):
print(4)
if (1400 <= X) and (X < 1599):
print(3)
if (1600 <= X) and (X < 1799):
print(2)
if (1800 <= X) and (X < 1999):
print(1)
|
p02970 | s639648409 | Wrong Answer | N, D = map(int, input().split())
ans = N // (2*D+1)
ans += 1
print(ans)
|
p02608 | s988045401 | Wrong Answer | n = int(input())
ans = [0]*(10**4+1)
for x in range(10**2+1):
for y in range(10**2+1):
for z in range(10**2+1):
i = x*x + y*y + z*z + x*y + x*z + y*z
if i <= 10**4:
ans[i] += 1
else:
break
for i in range(1,n+1):
print(ans[i]) |
p03797 | s622584626 | Wrong Answer | #scc puzzle
n,m=map(int,input().split())
#nγs,mγο½γ§γγ
if n>2*m:
print(m)
else:
#n<=2*m
print(n+((m-2*n)//4)) |
p03827 | s843629343 | Accepted | N = int(input())
S = str(input())
x = 0
m = 0
for i in range(N):
if S[i]=="I":
x += 1
else:
x -= 1
if x>=m:
m = x
print(m) |
p03478 | s895283175 | Accepted | """
author : halo2halo
date : 24, Jan, 2020
"""
import sys
# import itertools
# import numpy as np
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)
N, A, B = map(int, readline().split())
ans = 0
for i in range(N + 1):
s = 0
t = i
while t:
s += t % 10
t = t // 10
if A <= s <= B:
ans += i
print(ans)
|
p03699 | s577379756 | Accepted | N,*S = map(int,open(0).read().split())
ans =sum(S)
if ans%10 !=0:
print(ans)
else:
S = sorted(S)
for s in S:
if s%10 != 0:
print(ans-s)
exit()
print(0)
|
p02688 | s420057812 | Wrong Answer | # coding=utf-8
if __name__ == '__main__':
N, K = map(int, input().split())
sunuke = [0] * N
print(sunuke)
for i in range(K):
D = int(input())
li = list(map(int, input().split()))
for j in range(D):
sunuke[li[j] - 1] += 1
#print(sunuke)
print(sunuke.count(0))
|
p02696 | s953691331 | Accepted | A, B, N = map(int, input().split())
x = min(B - 1, N)
print(A * x // B - A * (x // B)) |
p02646 | s591755743 | Wrong Answer | a,b=map(int,input().split())
c,d=map(int,input().split())
e=int(input())
if c-a<=e*(b-d):
print('YES')
else:
print('NO') |
p02700 | s353062508 | Accepted | #https://atcoder.jp/contests/abc164/tasks/abc164_b
A,B,C,D = map(int,input().split())
Senkou_N,Senkou_Amari = divmod(C,B)
if Senkou_Amari != 0:
Senkou_N += 1
Koukou_N,Koukou_Amari = divmod(A,D)
if Koukou_Amari != 0:
Koukou_N += 1
if Senkou_N <= Koukou_N:
print("Yes")
else:
print("No") |
p03487 | s436584831 | Wrong Answer | n = int(input())
a = list(map(int, input().split()))
a.sort()
ans = 0
i = 0
while i < len(a)-1:
cnt = 1
while a[i] == a[i+1]:
cnt += 1
i += 1
if i == len(a)-1:
break
if cnt > a[i]:
ans += cnt - a[i]
elif cnt < a[i]:
ans += cnt
i += 1
print(ans) |
p03695 | s046197365 | Accepted | n = int(input())
A = list(map(int,input().split()))
c=[0]*8
maxc=0
for a in A:
if a>=3200:
maxc+=1
else:
c[a//400]=1
minc = c.count(1)
ans = minc+maxc
print(max(minc,1),ans)
|
p03836 | s866221870 | Wrong Answer | sx, sy, tx, ty = map(int, input().split())
x = tx - sx
y = ty - sy
ans = ''
ans += 'R'*x
ans += 'U'*y
ans += 'L'*x
ans += 'D'*-x
ans += 'DR'
ans += 'R'*x
ans += 'U'*y
ans += 'UL'
ans += 'UL'
ans += 'L'*x
ans += 'D'*-x
ans += 'DR'
print(ans) |
p04011 | s249613945 | Wrong Answer | n=input()
k=input()
x=input()
y=input()
if n>k:
print (k*x) + (n-k)*y
else:
print k*n |
p02879 | s893998942 | Accepted | a, b = map(int, input().split())
print(a * b if (a < 10 and b < 10) else -1) |
p03264 | s700356615 | Wrong Answer | print(int(input())**2//2/2) |
p02693 | s716808208 | Accepted | K = int(input())
A, B = input().split()
if int(A) % K ==0 or int(B) % K ==0:
print("OK")
elif int(A) // K == int(B)//K:
print("NG")
else:
print("OK") |
p02760 | s201880574 | Wrong Answer | al = [list(map(int, input().split())) for i in range(3)]
n = int(input())
b = [int(input()) for i in range(n)]
ans = 'No'
for i in b:
for l in range(3):
if i in al[l]:
al[l][al[l].index(i)]=0
if al[0][0]+al[1][1]+al[2][2]==0 or al[0][2]+al[1][1]+al[2][0]==0:
ans = 'Yes'
else:
for l in al:
if sum(l)==0:
ans = 'Yes'
break
print(ans) |
p02687 | s873743308 | Accepted | #!/usr/bin/env python3
ABC = "ABC"
ARC = "ARC"
def solve(S: str):
if S == ABC:
return ARC
else:
return ABC
def main():
S = input().strip()
answer = solve(S)
print(answer)
if __name__ == "__main__":
main()
|
p04033 | s277337856 | Wrong Answer | import numpy as np
a,b = map(int,(input().split()))
if a == 0 or b == 0 or (a <0 and b > 0):
print("Zero")
elif a > 0:
print("Positive")
else:
print("Negative")
|
p02708 | s160170647 | Accepted | N,K = list(map(int, input().split()))
ans = 0
for i in range(K,N+2):
ans += (N-(i-1))*i + 1
if ans > 10**9 + 7:
ans = ans % (10**9 + 7)
print(ans) |
p03632 | s584200438 | Accepted | a, b, c, d = list(map(int, input().split()))
def overlap(a, b):
if max(a[0], b[0]) > min(a[1], b[1]):
return [0, 0]
return [max(a[0], b[0]), min(a[1], b[1])]
ans = overlap([a, b], [c, d])
print(ans[1] - ans[0]) |
p03126 | s717937147 | Accepted | N,M=map(int,input().split())
h={i for i in range(1,M+1)}
for _ in range(N):
a=list(map(int,input().split()))
a=set(a[1:])
h&=a
print(len(h)) |
p03386 | s182112364 | Wrong Answer | a, b, k = map(int, input().split())
ans = set()
k = min(k,b-a)
for i in range(a, a+k):
ans.add(i)
for i in range(b, b - k, -1):
ans.add(i)
ans=sorted(list(ans))
for i in (ans):
print(i)
|
p03293 | s533239473 | Accepted | s = input()
t = input()
for i in range(len(s)):
s1 = s[len(s)-i-1:] + s[:(len(s)-i-1)]
if (s1 == t):
print("Yes")
break
else:
if(i == (len(s)-1)):
print("No") |
p03095 | s720106022 | Wrong Answer | N=int(input())
S=input()
p=10**9+7
from collections import defaultdict
D=defaultdict(int)
num=0
ans=0
dp=[0]*N
dp[0]=2
D[S[0]]+=1
for i in range(1,N):
s=S[i]
if D[s]>=1:
dp[i]=(dp[i-1]+dp[i-1]//(D[s]+1))%p
#print(D[s])
D[s]+=1
else:
dp[i]=dp[i-1]*2%p
D[s]+=1
#print(dp)
print(dp[-1]-1) |
p03037 | s841639948 | Accepted | n,m = map(int, input().split())
lmax = 0
rmin = int(1e10)
for _ in range(m):
l,r = map(int, input().split())
lmax = max(l, lmax)
rmin = min(r, rmin)
ans = max(0, rmin - lmax + 1)
print(ans)
|
p03243 | s303653945 | Accepted | n = input()
hendred = n[0]
jadgeNumString = n[0]*3
jadgeNum = int(jadgeNumString)
if int(n) <= jadgeNum:
print(jadgeNum)
else:
print(jadgeNum + 111) |
p03145 | s796620467 | Wrong Answer | p,q,r=map(int,input().split())
print(p*q/2) |
p03543 | s257376646 | Accepted | a,b,c,d = input()
print("Yes" if a==b==c or b==c==d else "No") |
p03013 | s665287001 | Accepted | n,m=map(int,input().split())
broken=[]
for i in range(m):
broken.append(int(input()))
b=set(broken)
l=[1]
for j in range(1,n+1):
if j in b:
l.append(0)
elif j==1:
l.append(1)
else:
l.append(l[j-2]+l[j-1])
print(l[n]%(10**9+7)) |
p02695 | s651126883 | Accepted | import itertools
n,m,q=map(int, input().split())
S = []
for i in range(q):
a,b,c,d=map(int, input().split())
S.append([a,b,c,d])
tl=itertools.combinations_with_replacement(range(1,m+1),n)
ans = 0
for l in tl:
t = 0
for a,b,c,d in S:
if l[b-1]-l[a-1] == c:
t += d
ans = max(ans,t)
print(ans) |
p03659 | s398868943 | Wrong Answer | N=int(input())
a=list(map(int,input().split()))
S=sum(a[1:])
SS=a[0]
mi=abs(S-SS)
for i in range(1,N-1):
if mi>=abs(S-SS-2*a[i]):
S=S-a[i]
SS=SS+a[i]
mi=abs(S-SS)
print(mi)
|
p03324 | s326271607 | Wrong Answer | D, N = map(int, input().split())
print(int(str(N) + '00' * D) if N != 100 else int(str(N) + '00' * D) + 1)
|
p03637 | s011009345 | Accepted | n=int(input())
a=list(map(int,input().split()))
b,c,d=0,0,0
for i in a:
if i%4==0:
b+=1
elif i%2==0:
c+=1
else:
d+=1
if c==0 and b>=d-1:
print("Yes")
elif b>=d:
print("Yes")
else:
print("No") |
p03774 | s347090298 | Accepted | n,m = map(int,input().split())
abl = []
for _ in range(n):
a,b = map(int,input().split())
abl.append((a,b))
cdl = []
for _ in range(m):
c,d = map(int,input().split())
cdl.append((c,d))
for a,b in abl:
ans = float("inf")
log = -1
for idx, (c,d) in enumerate(cdl):
tmp = abs(a-c) + abs(b-d)
if ans > tmp:
ans = tmp
log = idx+1
print(log)
|
p02772 | s707197138 | Accepted | n = int(input())
l = list(map(int, input().split()))
cnt = 0
for i in range(n):
if l[i] % 2 == 0:
if l[i] % 3 == 0:
cnt += 1
elif l[i] % 5 == 0:
cnt += 1
else:
print("DENIED")
quit()
print("APPROVED")
|
p03013 | s419676590 | Accepted | n,m=map(int,input().split())
a=[int(input()) for i in range(m)]
mod=10**9+7
dp=[0]*(n+2)
for i in a:
dp[i]=-1
dp[0]=1
for i in range(n):
if dp[i]==-1:continue
if dp[i+1]!=-1:
dp[i+1]=(dp[i+1]+dp[i])%mod
if dp[i+2]!=-1:
dp[i+2]=(dp[i+2]+dp[i])%mod
print(dp[-2])
#print(dp) |
p03471 | s933305705 | Accepted | N, Y = map(int, input().split())
for x in range(min(Y // 10000 + 1, N + 1)):
for y in range(min(Y // 5000 + 1, N + 1)):
r = Y - x * 10000 - y * 5000
if r >= 0 and r // 1000 == N - x - y:
print(x, y, r // 1000)
exit()
print(-1, -1, -1) |
p03011 | s167371385 | Wrong Answer | try:
n=list(map(int, input().strip().split()))
lis1=[]
for i in range(0,len(n)):
for a in range(0,len(n)):
if n[i]!=n[a]:
z=int(n[a]+n[i])
lis1.append(str(z))
print(min(lis1))
except:
print('')
|
p02719 | s334168970 | Accepted | import sys
from math import sqrt
from collections import Counter, defaultdict
input = sys.stdin.readline
def I():
return int(input())
def MI():
return map(int, input().split())
def LI():
return list(MI())
def LIN(n: int):
return [I() for _ in range(n)]
inf = float("inf")
mod = 10 ** 9 + 7
def main():
n, k = MI()
mod = n % k
if mod > abs(mod - k):
print(abs(mod - k))
else:
print(mod)
pass
if __name__ == "__main__":
main()
|
p03261 | s331585727 | Accepted |
def solve():
N = int(input())
wlist = [input() for i in range(N)]
s = set(wlist)
if len(wlist) != len(s):
print("No")
exit()
else:
last = wlist[0][-1]
for i in range(1, N):
ini = wlist[i][0]
if last != ini:
print("No")
exit()
last = wlist[i][-1]
print("Yes")
if __name__ == "__main__":
solve()
|
p02582 | s288346982 | Accepted | S = input()
count = S.count('R')
if count == 0 or count == 1 or count == 3:
print(count)
else:
if S == 'RSR':
print(1)
else:
print(2) |
p02912 | s546685442 | Accepted | import heapq
n, m = map(int, input().split())
a = list(map(int, input().split()))
a = list(map(lambda x: x*(-1), a))
heapq.heapify(a)
for i in range(m):
max_item = heapq.heappop(a) * -1
heapq.heappush(a, (max_item // 2) * -1)
print(sum(a) * -1)
|
p02602 | s128367840 | Accepted | n, k = map(int, input().split())
A = list(map(int, input().split()))
for i in range(n - k):
if A[i] < A[i + k]:
print('Yes')
else:
print('No') |
p02727 | s830699396 | Accepted | x,y,a,b,c = map(int, input().split())
p = list(map(int, input().split()))
q = list(map(int, input().split()))
r = list(map(int, input().split()))
p.sort()
q.sort()
r.sort()
ans = p[-x:]+q[-y:]
ans.sort()
for i in range(min(len(ans), len(r))):
R = r.pop()
if ans[i]<=R:
ans[i]=R
else:
break
print(sum(ans))
|
p02951 | s142853650 | Accepted | a,b,c = map(int,input().split())
ans = c-(a-b)
if ans >= 0:
print(ans)
else:
print(0) |
p02842 | s352043184 | Wrong Answer | N = int(input())
for i in range(N):
price = int(i * 1.08)
if(price == N):
print(i)
exit()
print(":(") |
p03962 | s683019202 | Accepted | a,b,c = map(int,input().split())
print(len(set([a, b, c]))) |
p03069 | s338272600 | Accepted | n = int(input())
s = input()
migi = s.count(".")
hidari = 0
ans = migi
for i in range(n):
if s[i] == "#":
hidari += 1
elif s[i] == ".":
migi -= 1
ans = min(ans,hidari+migi)
print(ans) |
p03556 | s086616238 | Wrong Answer | n = int(input())
i = 1
while i ** 2 < n:
i += 1
print(i ** 2) |
p02665 | s986450793 | Wrong Answer | n = int(input())
a = list(map(int, input().split()))
if a[0] != 0: print(-1); exit()
s = [0] * (n+2)
for i in range(n+1)[::-1]:
s[i] = s[i+1]+a[i]
x = 1
ans = 0
for i in range(n+1):
ans += x
x -= a[i]
if x <= 0 and i != n: print(-1); exit()
if x == s[i]: continue
if x*2 > s[i+1]: x = s[i+1]
else: x *= 2
print(ans) |
p03282 | s996600419 | Accepted | S = input()
K = int(input())
ones = 0
inf = None
for c in S:
if c=='1':
ones += 1
else:
inf = c
break
if K <= ones:
print('1')
else:
print(inf) |
p03951 | s000220629 | Accepted | n = int(input())
s = input()
t = input()
ans = s+t
for i in range(n):
if s[i] == t[0]:
if s[i:] == t[:n-i]:
ans = s[:i]+t
break
print(len(ans)) |
p03494 | s077024137 | Accepted | n = int(input())
a = list(map(int,input().split()))
ans = 0
def check_all():
global a,n
for i in range(n):
if a[i]%2!=0:
return False
return True
while check_all():
ans += 1
for i in range(n):
a[i] //= 2
print(ans) |
p02627 | s390099450 | Accepted | a = input()
if str.isupper(a) == True:
print('A')
else:
print('a')
|
p04005 | s146216347 | Accepted | from itertools import *
A,B,C = map(int,input().split())
ans = 10**18
if A%2 == 0 or B%2 == 0 or C%2 == 0:
ans = 0
else:
for i,j in combinations([A,B,C],2):
ans = min(ans,i*j)
print(ans) |
p02947 | s579003295 | Accepted | #!/usr/bin/env python
# coding: utf-8
# In[12]:
import collections
# In[10]:
N = int(input())
s = []
for _ in range(N):
s.append(input())
# In[30]:
ans = 0
mydict = {}
for i in range(N):
tmp = "".join(sorted(s[i]))
if tmp not in mydict:
mydict[tmp] = 1
else:
ans += mydict[tmp]
mydict[tmp] += 1
print(ans)
|
p03481 | s730365177 | Wrong Answer | import sys
input = sys.stdin.readline
import math
X,Y=map(int,input().split())
print(1 + math.floor(math.log2(Y/X)))
|
p03487 | s376133495 | Accepted | n = int(input())
a = list(map(int, input().split()))
cnt = dict()
for ai in a:
if ai not in cnt.keys():
cnt[ai] = 1
else:
cnt[ai] += 1
ans = 0
for k in cnt.keys():
if cnt[k] > k:
ans += cnt[k] - k
elif cnt[k] < k:
ans += cnt[k]
print(ans)
|
p02862 | s442146843 | Accepted | from math import factorial as fac
x,y=map(int,input().split())
a=(2*y-x)/3
b=(2*x-y)/3
mod=10**9+7
if a>=0 and b>=0 and a==int(a) and b==int(b):
a=int(a)
b=int(b)
a1=1
a2=1
n3=10**9+7
for i in range(a):
a1*=a+b-i
a2*=i+1
a1%=n3
a2%=n3
a2=pow(a2,n3-2,n3)
print((a1*a2)%n3)
else:
print(0) |
p02831 | s090928599 | Accepted |
a,b=list(map(int,input().split()))
from fractions import gcd
res=a*b/gcd(a,b)
print(int(res))
|
p03821 | s811568774 | Accepted | def main():
N = int(input())
nums_list = [list(map(int, input().split())) for _ in range(N)]
nums_list.reverse()
cnt = 0
for a, b in nums_list:
cnt += (b - (a + cnt)) % b
print(cnt)
if __name__ == '__main__':
main()
|
p02793 | s413547060 | Accepted | import math
import fractions
MOD=1000000007
n=int(input())
a=list(map(int,input().split()))
x=1
ans=0
for i in a:
x=x*i//fractions.gcd(x,i)
for i in a:
ans=ans+x//i
print(ans%MOD,'\n') |
p02700 | s518029136 | Wrong Answer | A, B, C, D = map(int, input().split())
t = C /B
a = A /D
if t <= a+1 :
ans = "Yes"
if A % D == 0 and C % B ==0:
ans = "Yes"
elif A % D == 0:
ans = "No"
else:
ans = "Yes"
else:
ans = "No"
print(ans) |
p02783 | s075929122 | Accepted | h, a = map(int, input().split())
if h % a == 0:
print(h//a)
else:
print(h//a + 1) |
p03254 | s469750284 | Wrong Answer | n,x=map(int,input().split())
a=sorted(list(map(int,input().split())))
ans=0
for i in range(n):
if x>=a[i]:
ans+=1
x-=a[i]
else:
break
if ans == n:
if x!=0:
ans-=1
print(x)
print(ans) |
p03351 | s312132623 | Wrong Answer | a, b, c, d = map(int, input().split())
if abs (a - c) <= d:
print('Yes')
elif abs(a - b) <= d:
print('Yes')
elif abs(b - c) <= d:
print('Yes')
else:
print('No') |
p03721 | s216543578 | Accepted | n,k = map(int,input().split())
A = []
for _ in range(n):
A.append(list(map(int,input().split())))
A.sort(key=lambda x: x[0])
cnt = 0
while k>0:
k-=A[cnt][1]
cnt+=1
print(A[cnt-1][0])
|
p02918 | s885540399 | Accepted | N, K=map(int, input().split())
S=input()
A=[]
tmp=1
for i in range(1,N):
if S[i-1]==S[i]:
tmp+=1
else:
A.append(tmp)
tmp=1
A.append(tmp)
ans=sum(A)-len(A)+(K)*2
if ans<N-1:
print(ans)
else: print(N-1) |
p02584 | s211968333 | Wrong Answer | X, K, D = map(int, input().split())
if K <= abs(X // D):
print(abs(X) - D * K)
elif (K - abs(X // D)) % 2 == 0:
print(abs(X) % D)
else:
print(D - abs(X) % D) |
p03699 | s811068102 | Accepted | n = int(input())
s = list(int(input()) for _ in range(n))
s.sort()
if all(num % 10 == 0 for num in s):
print(0)
else:
if sum(s) % 10 == 0:
for num in s:
if num % 10 != 0:
print(sum(s) - num)
break
else:
print(sum(s)) |
p03339 | s065964164 | Accepted | n = int(input())
s = input()
now = 0
for i in range(1, n):
if s[i] == "E":
now += 1
ans = now
for i in range(1, n):
if s[i] == "E":
now -= 1
if s[i-1] == "W":
now += 1
ans = min(ans, now)
print(ans) |
p03038 | s602772231 | Accepted | n,m=map(int,input().split())
a=list(map(int,input().split()))
rep=[]
for i in range(m):
b,c=map(int,input().split())
rep.append([c,b])
rep.sort(reverse=True)
Card=[0]*n
cnt=0
fg=0
while fg<n and cnt<m:
tt=0
while tt<rep[cnt][1] and fg+tt <n :
Card[fg+tt]=rep[cnt][0]
tt+=1
fg+=tt
cnt+=1
ans=a+Card
ans.sort(reverse=True)
tmp=0
for i in range(n):
tmp+=ans[i]
print(tmp) |
p02952 | s404448218 | Wrong Answer | n=int(input())
t=0
for i in range(n):
l=len(str(i))
if l%2!=0:
t+=1
print(t)
|
p02817 | s057173106 | Accepted | S, T = input().split()
print(T + S)
|
p02660 | s822193618 | Wrong Answer | n = int(input())
m = n
c = 0
for i in range(2,n+1):
if m % i == 0:
m /= i
c += 1
elif m < i:
break
print(c) |
p03360 | s541211225 | Wrong Answer | A, B, C = map(int, input().split())
K = int(input())
print(max(A, B, C)**K + A + B + C - max(A, B, C)) |
p03672 | s478433827 | Accepted | s=input()
ans = 0
for i in range(len(s)//2):
if s[:i]==s[i:i*2]:
ans=i*2
print(ans) |
p02584 | s790680893 | Wrong Answer | x,k,d=map(int,input().split())
if (x-(k*d))>0:
print((x-(k*d)))
elif (x-(k*d))==0:
print(0)
else:
k1=0
a=(x-(k1*d))
while a>=0:
k1+=1
a=(x-(k1*d))
print(abs(a-0)) |
p02570 | s065126200 | Wrong Answer | d,t,s=map(int,input().split())
if 1000//15>=s:
if 1000//15==0 and 1000%15==0:
print('Yes')
else:
print('No')
else:
print('Yes') |
p02697 | s711118014 | Accepted | n,m = map(int, input().split())
if n % 2 == 1:
a = 1
b = n - 1
for i in range(m):
print(a,b)
a += 1
b -= 1
else:
a = n // 2
b = a + 1
nn = (n//2) // 2
for i in range(m):
print(a, b)
if i == nn - 1:
a -= 1
b += 2
else:
a -= 1
b += 1 |
p02952 | s034434978 | Wrong Answer | m = int(input())
n = len(str(m))
if n == 1:
print(n)
elif n == 2:
print(9)
elif n == 3:
ans = 9 + m - 99
print(ans)
elif n == 4:
ans = 999 - 99 + 9
print(ans)
elif n == 5:
ans = m - 9999 + 999 - 99 + 9
elif n == 6:
print(90909)
|
p03211 | s060014424 | Wrong Answer | s = input()
n = len(s)
ans = 10000
for i in range(n-3):
x = int(s[i:i+3])
ans = min(ans, abs(753-x))
print(ans) |
p02719 | s705111682 | Wrong Answer | import sys
import math
n, k = map(int, input().split())
if k == 1:
print(0)
sys.exit()
pre=n-math.floor(n/k)*k
while 1:
if pre <= abs(pre-k):
print(pre)
sys.exit()
pre = abs(pre - k) |
p03680 | s324433900 | Accepted | n = int(input())
a = [0]
tmp = [int(input()) for _ in range(n)]
a = a + tmp
r = -1
cnt = 1
next = a[1]
while cnt < n:
if next == 2:
r = cnt
break
else:
next = a[next]
cnt += 1
print(r) |
p03137 | s538776232 | Wrong Answer | N, M = map(int, input().split())
X = list(map(int, input().split()))
X.sort()
diff = []
for i in range(M-1):
diff.append(abs(X[i+1] - X[i]))
diff.sort()
print(sum(diff[:-(N-1)]))
|
p03127 | s167073653 | Wrong Answer | N=int(input())
A=list(map(int, input().split()))
if len(set(A))==1:
print(A[0])
exit()
#A=sorted(A, reverse=True)
alleven=True
for i in range(N):
if A[i]%2==1:
alleven=False
if alleven:
print(2)
else:
print(1) |
p02630 | s850234966 | Accepted | N = int(input())
A = list(map(int, input().split()))
Q = int(input())
ans = sum(A)
from collections import Counter
A = Counter(A)
for i in range(Q):
B, C = map(int, input().split())
try:
var = A[B]
ans += var*(C-B)
A.pop(B)
try:
A[C] += var
except:
A[C] = var
print(ans)
except:
print(ans) |
p03681 | s442541520 | Accepted | import bisect,copy,heapq,string
from collections import *
from math import *
from itertools import *
import sys
sys.setrecursionlimit(10 ** 6)
def input() : return sys.stdin.readline().strip()
def INT() : return int(input())
def MAP() : return map(int,input().split())
def LIST() : return list(MAP())
n, m = MAP()
tmp = 1
for i in range(1,min(n,m)+1):
tmp = tmp * i % (10**9+7)
if n == m:
ans = tmp**2*2 % (10**9+7)
elif abs(n-m) == 1:
ans = tmp**2*max(n,m) % (10**9+7)
else:
ans = 0
print(ans) |
p03481 | s414214715 | Accepted | x, y = map(int, input().split())
ans = 0
while x <= y:
x *= 2
ans += 1
print(ans) |
p03861 | s188554333 | Accepted | a, b, x = map(int, input().split())
print(b // x - (a - 1) // x)
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.