problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p02959 | s038019989 | Wrong Answer | N = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
count = 0
for i in range(N):
if B[i] > A[i] + A[i+1]:
count += A[i] + A[i+1]
A[i+1] = 0
else:
count += B[i]
print(count) |
p03827 | s333487927 | Accepted | a,b=[input() for i in range(2)]
p=0
ans=0
for i in b:
if i =='I':
p+=1
elif i =='D' and p>0:
p-=1
else:
p-=1
if ans<p:
ans=p
print(ans) |
p03252 | s115373142 | Accepted | S = input()
T = input()
N = len(S)
dict_S = {}
dict_T = {}
for i in range(N):
# print("dict_S: {}".format(dict_S))
# print("dict_T: {}".format(dict_T))
if S[i] in dict_S:
if dict_S[S[i]] != T[i]:
print("No")
exit()
if T[i] in dict_T:
if dict_T[T[i]] != S[i]:
print("No")
exit()
dict_S[S[i]] = T[i]
dict_T[T[i]] = S[i]
print("Yes")
|
p03126 | s603477615 | Wrong Answer | n,m=map(int,input().split())
a=list(map(int,input().split()))
a=a[1:]
for i in range(n-1):
x=list(map(int,input().split()))
x=x[1:]
for j in a:
if j not in x:
a.remove(j)
print(len(a)) |
p03971 | s140381310 | Accepted | n, a, b = list(map(int, input().split()))
s = input()
qualified = 0
qualified_oversea = 0
for i, symbol in enumerate(s):
if symbol == 'c':
print("No")
elif symbol == 'a':
if qualified < a + b:
print("Yes")
qualified += 1
else:
print("No")
elif symbol == 'b':
if qualified < a + b and qualified_oversea < b:
print("Yes")
qualified += 1
qualified_oversea += 1
else:
print("No")
|
p02768 | s135865002 | Accepted | n, a, b = map(int, input().split())
mod = 10**9+7
c = pow(2,n,mod)
def nCr(n, r, mod):
r = min(r, n-r)
numer = denom = 1
for i in range(1, r+1):
numer = numer * (n+1-i) % mod
denom = denom * i % mod
return numer * pow(denom, mod-2, mod) % mod
c -= 1
aa = nCr(n,a,mod)
bb = nCr(n,b,mod)
c -= (aa+bb)
print (c%mod)
|
p02814 | s636915704 | Accepted | import sys
import fractions
def lcm(a, b):
return abs(a*b) // fractions.gcd(a, b)
n,m=map(int,input().split())
a=list(map(int,input().split()))
c=2
while a[0]%c==0:
c=c*2
c=c//2
fail=0
for i in range(n):
if a[i]%c!=0:
fail=1
if a[i]%(2*c)==0:
fail=1
if fail==1:
print(0)
sys.exit()
A=1
for i in range(n):
A=lcm(A,a[i])
print(2*m//A-2*m//(2*A)) |
p04045 | s203685541 | Accepted | n,k=map(int,input().split())
d=set(input().split())
while True:
if len(set(str(n))&d) != 0:
n+=1
else:
print(n)
break
|
p03611 | s376412066 | Wrong Answer | import numpy as np
N = int(input())
A = np.array(input().split(), dtype = np.int32)
print(A)
counter = np.bincount(A)
B = counter.copy()
B[1:] += counter[:-1]
B[:-1] += counter[1:]
ans = B.max()
print(ans) |
p03469 | s871503202 | Accepted | s = input()
print(s[:3]+"8"+s[4:]) |
p03339 | s116136587 | Wrong Answer | n = int(input())
s = input()
right_w = 0
right_E = 0
left_E = 0
left_W = 0
ans = len(s)
for i in s:
if i == "W":
right_w += 1
else:
right_E += 1
for i in range(len(s)):
tmp = s[i]
tmp_ans = left_W+ right_E
if tmp_ans < ans:
ans = tmp_ans
if tmp == 'W':
right_w -= 1
left_W += 1
else:
right_E -= 1
left_E += 1
print(ans) |
p02767 | s550253358 | Accepted |
if __name__ == '__main__':
n = int(input())
x = list(map(int, input().split()))
p = []
for i in range(100):
cnt = 0
for j in range(n):
cnt = cnt + (x[j]-i)**2
p.append(cnt)
print(sorted(p)[0])
|
p02627 | s837523295 | Wrong Answer | x = input()
X = x.upper()
if x == X:
print('A')
else:
print('B')
|
p02645 | s479726683 | Accepted | S = input()
print(S[:3]) |
p02622 | s289007640 | Accepted | s = str(input())
t = str(input())
count=0
for i in range(len(s)):
if s[i] != t[i]:
count+=1
print(count) |
p02796 | s114133774 | Accepted | import sys
input = sys.stdin.readline
n = int(input())
L = [list(map(int,input().split())) for i in range(n)]
A= []
for i in range(n):
A.append([L[i][0]-L[i][1], L[i][0]+L[i][1]])
A.sort(key=lambda x:x[1])
m = -float("inf")
ans = 0
for i in range(n):
if m > A[i][0]:
ans += 1
else:
m = A[i][1]
print(n-ans) |
p02897 | s944373520 | Wrong Answer | print(2 / int(input()))
|
p03644 | s548066119 | Accepted | N=int(input())
for i in (64,32,16,8,4,2,1):
if i <= N:
print(i)
break
|
p04034 | s167994132 | Accepted | n, m = map(int, input().split())
a = [1]*n
ans_box = [False]*n
ans_box[0] = True
for _ in range(m):
x, y = map(int, input().split())
x -= 1
y -= 1
a[x] -= 1
a[y] += 1
if ans_box[x]:
if a[x] == 0:
ans_box[x] = False
ans_box[y] = True
print(ans_box.count(True))
|
p02933 | s924779935 | Accepted | n = int(input())
s = input()
if n < 3200:
s = 'red'
print(s) |
p03345 | s033557568 | Wrong Answer | A,B,C,K = map(int,input().split())
print( ((-1)**(K-1))*(B-A) ) |
p02717 | s902518799 | Accepted | a,b,c = map(int,input().split())
a,b = b,a
a,c = c,a
print(a,b,c) |
p02882 | s809210162 | Accepted | import math
a, b, x = map(int,input().split())
if 2 *x <= a ** 2 * b:
p1 = a * b ** 2
p2 = 2 * x
else:
p1 = 2 * (a ** 2 * b - x)
p2 = a ** 3
sit = math.atan(p1 / p2)
print(math.degrees(sit))
|
p02860 | s553642793 | Wrong Answer | n = int(input())
s = input()
if n%2==1:
print('No')
exit(0)
if s[:n//2] == s[:-n//2]:
print('Yes')
else:
print('No') |
p02665 | s550586209 | Accepted | N = int(input())
A = [int(x) for x in input().split()]
SUM = sum(A)
ans = 0
for i in range(N+1):
SUM -= A[i]
if i == 0:
res = min(1 - A[0], SUM)
else:
res = min(2*B-A[i], SUM)
if res < 0:
ans = -1
break
ans = ans + res + A[i]
B = res
print(ans) |
p02766 | s021758138 | Wrong Answer | import math
N, K = input().split(" ")
print(math.ceil(math.log(int(N),int(K)))) |
p02613 | s856827705 | Accepted | import sys
input=sys.stdin.readline
n=int(input())
ac,wa,tle,re=0,0,0,0
for _ in range(n):
s=input().rstrip()
if s=='AC':
ac+=1
elif s=='WA':
wa+=1
elif s=='TLE':
tle+=1
else:
re+=1
print('AC x %d' % ac)
print('WA x %d' % wa)
print('TLE x %d' % tle)
print('RE x %d' % re)
|
p02772 | s079061974 | Wrong Answer | n = int(input())
a = list(map(int, input().split()))
judge = True
for i in range(n-1):
if a[i]%2 == 0:
if(a[i]%3 != 0 and a[i]%5 != 0):
judge = False
break
if judge:
print('APPROVED')
else:
print('DENIED') |
p02829 | s394751153 | Accepted | print(6-int(input())-int(input())) |
p03282 | s391560013 | Wrong Answer | s=input()
k=int(input())
for i in range(len(s)):
if i+1==k:
break
exit()
if s[i]!="1":
print(s[i])
exit()
print(1) |
p02743 | s819029500 | Wrong Answer | a,b,c=map(int,input().split())
print("Yes" if a*b+b*c+c*a<(a**2+b**2+c**2)/2 else "No") |
p03605 | s140782675 | Wrong Answer | N = input()
if "9" in N:
print( "YES" )
else:
print( "NO" ) |
p02743 | s667101819 | Accepted | n = list(map(int,input().split()))
if n[0]*-1+n[1]*-1+n[2]>0:
if (n[0]*-1+n[1]*-1+n[2])**2 > 4*n[0]*n[1]:
print("Yes")
else:
print("No")
else:
print("No")
|
p02917 | s424966075 | Accepted | n = int(input())
b = list(map(int , input().split()))
a = [b[0]] + b
for i in range(1 , n - 1):
a[i] = min(b[i - 1] , b[i])
print(sum(a)) |
p03623 | s689403217 | Wrong Answer | x, a, b = map(int, input().split())
print('B' if abs(b-x) < abs(b-a) else 'A') |
p03962 | s447208767 | Wrong Answer | a,b,c = map(int,input().split())
if a != b != c:
print(3)
if a == b and a != c and b != c:
print(2)
if b == c and b != a and c != a:
print(2)
if a == b == c:
print(1) |
p03605 | s942930573 | Wrong Answer | n = input()
if n[0] == 9 or n[1] == 9:
print("Yes")
else:
print("No") |
p02835 | s517390879 | Accepted | a = list(map(int, input().split()))
print('bust' if sum(a) >= 22 else 'win')
|
p03243 | s842347403 | Accepted | N = int(input())
for i in range(N,1000):
i = str(i)
if i[0] == i[1] and i[1] == i[2] and i[2] == i[0]:
ans = i
break
print(i) |
p02690 | s180283297 | Accepted | X = int(input())
for A in range(1000):
for B in range(-1000, 1000):
if A ** 5 - B ** 5 == X:
print(A, B)
exit() |
p02642 | s515313867 | Accepted | N = int(input())
A = list(map(int, input().split()))
A.sort()
A_max = A[-1]
checked = [False] * (A_max+1)
ans = 0
for i in range(N):
if i < N-1:
if A[i] == A[i+1]:
for j in range(A[i], A_max+1, A[i]):
checked[j] = True
if checked[A[i]]:
pass
else:
ans += 1
for j in range(A[i], A_max+1, A[i]):
checked[j] = True
print(ans)
|
p02963 | s299896111 | Wrong Answer | def resolve():
'''
code here
'''
S = int(input())
a, b = divmod(S, 10**9)
x2 = 10**9 - b
y2 = (S+x2) // (10**9)
print(0,0, 10**9, 1, x2, y2)
if __name__ == "__main__":
resolve()
|
p02866 | s061600125 | Wrong Answer | from collections import Counter
MOD = 998244353
N = int(input())
D = [int(i) for i in input().split()]
counter = Counter(D)
# print("counter: {}".format(counter))
ans = 1
count = 0
for i, item in enumerate(sorted(counter.items(), key=lambda x: x[0])):
# print("ans: {}".format(ans))
# print("i: {}, item: {}".format(i, item))
if i != item[0]:
ans = 0
break
if i == 0:
count = item[1]
else:
ans *= count ** item[1]
count = item[1]
print(ans % MOD)
|
p02631 | s513898468 | Wrong Answer | n = int(input())
list = [int(i) for i in input().split()]
total = 0
ans = []
for i in range(n):
total = total ^ list[i]
print(total)
for j in range(n):
ans.append(str(total^list[j]))
print(" ".join(ans))
|
p03478 | s020925410 | Accepted | n,a,b=map(int,input().split())
ans=0
for i in range(1,n+1):
im=i
count=[]
for j in range(37):
count.append(i%10)
i=i//10
csum=sum(count)
if a<=csum and csum<=b:
#print(csum)
ans+=im
print(ans) |
p02819 | s175664514 | Wrong Answer | X = int(input())
for i in range(1, int(X**0.5)+1):
if X/i == X//i:
X += 1
continue
else:
print(X)
|
p03695 | s369201902 | Accepted | N=int(input())
a=list(map(int,input().split()))
mi=0
ma=0
l=[]
count=0
for i in range(N):
if a[i]<3200:
l.append(a[i]//400)
else:
count=count+1
print(max(1,len(set(l))),max(1,len(set(l))+count))
|
p03163 | s861672234 | Wrong Answer | n,w=map(int,input().split())
wv=[list(map(int,input().split())) for _ in range(n)]
dp=[[0]*(w+1) for _ in range(n+1)]
for i in range(1,n+1):
for j in range(1,w+1):
if wv[i-1][0]+j>w:
dp[i][j]=dp[i-1][j]
else:
dp[i][j]=max(dp[i-1][j],dp[i-1][j-wv[i-1][0]]+wv[i-1][1])
print(max(max(dp))) |
p02665 | s546649500 | Accepted | n,*a=map(int,open(0).read().split())
A=sum(a)
ans=1
now=1
for i in a:
A-=i
now=min((now-i)*2,A)
ans+=now
if now<0:
print(-1)
exit()
print(ans) |
p03815 | s791201740 | Wrong Answer | N = int(input())
num = N // 11
res = 0
k = 0
res = num * 2
k = num * 11
if N % 11 == 0:
pass
else:
res += 1
k += 5
if k < N:
res += 1
k += 6
print(res) |
p02792 | s836588955 | Accepted | N = int(input())
counter = [[0]*10 for _ in range(10)]
# 先頭末尾の組み合わせを数える
for i in range(1,N+1):
x = str(i)
counter[int(x[0])][int(x[-1])] += 1
ans = 0
# (先頭末尾)と(末尾先頭)の組み合わせ
for i in range(10):
for j in range(10):
ans += counter[i][j] * counter[j][i]
print(ans) |
p02755 | s960248447 | Accepted | def main():
A, B = map(int, input().split())
for i in range(1, 2000):
if int(i*0.08) == A and int(i*0.1) == B:
print(i)
return
print(-1)
if __name__ == "__main__":
main()
|
p03351 | s183186049 | Accepted | a,b,c,d=map(int,input().split())
print("Yes" if ((abs(a-b)<=d and (abs(c-b)<=d)) or abs(c-a)<=d) else "No")
|
p04043 | s020047591 | Wrong Answer | A,B,C = map(int, input().split())
if (A == 5 and B == 5 and C == 7) or (A == 5 and B == 7 and C == 5) or (A == 7 and B == 5 and C == 5):
print('Yes')
else:
print('No')
|
p03696 | s332005260 | Wrong Answer | n = int(input())
a = input()
cr = 0
cl = 0
ans = a
for i in range(n):
if a[i] == "(":
cl += 1
elif a[i] == ")":
cr += 1
if cl == 0 and cr != 0:
ans = "(" + ans
cr -= 1
if cl != 0 and cr != 0:
if cr >= cl:
cr -= cl
cl -= cl
else:
cr -= cr
cl -= cr
if cl != 0:
for i in range(cl):
ans = ans+")"
print(ans) |
p03632 | s514616367 | Accepted | a,b,c,d = map(int, input().split())
alice = set(i for i in range(a,b+1))
bob = set(j for j in range(c,d+1))
s = alice & bob
print(max(len(alice & bob) - 1, 0)) |
p02847 | s609712247 | Accepted | # coding: utf-8
import sys
import math
import collections
import itertools
INF = 10 ** 10
MOD = 10 ** 9 + 7
def input() : return sys.stdin.readline().strip()
def gcd(x, y) : return y if x % y == 0 else gcd(y, x % y)
def lcm(x, y) : return (x * y) // gcd(x, y)
def I() : return int(input())
def LI() : return [int(x) for x in input().split()]
def RI(N) : return [int(input()) for _ in range(N)]
def LRI(N) : return [[int(x) for x in input().split()] for _ in range(N)]
def PL(L) : print(*L, sep="\n")
weeks = ["SUN","MON","TUE","WED","THU","FRI","SAT"]
S = input()
d = weeks.index(S)
print(7 - d)
|
p02767 | s092080039 | Wrong Answer | P=int(input())
X=list(map(int,input().split()))
l=[]
for j in range(min(X)-1,max(X)):
ans = [(i-j)**2 for i in X ]
l.append(sum(ans))
print(min(l)) |
p02820 | s215161093 | Accepted | N,K = map(int,input().split())
R,S,P = map(int,input().split())
T = list(input())
Pred = []
dp = []
for i in range(K,N):
if(T[i] == T[i-K]):
T[i] = 'x'
else:
continue
x = T.count('r')
y = T.count('s')
z = T.count('p')
print(P * x + R * y + S * z)
|
p03720 | s465819848 | Wrong Answer | import numpy as np
N,M = list(map(int,input().split()))
a = np.array([input().split() for i in range(M)])
a = [int(i) for i in a.reshape(-1)]
all_type = set(a)
for i in all_type:
print(a.count(i)) |
p02613 | s232201090 | Accepted | N=int(input())
S=[input() for i in range(N)]
C0=str(S.count("AC"))
C1=str(S.count("WA"))
C2=str(S.count("TLE"))
C3=str(S.count("RE"))
print("AC x "+C0)
print("WA x "+C1)
print("TLE x "+C2)
print("RE x "+C3) |
p02554 | s612222751 | Accepted | mod = 10**9+7
N = int(input())
a = 1
b = 1
c = 1
for _ in range(N):
a *= 10
b *= 9
c *= 8
a %= mod
b %= mod
c %= mod
ans = (a -2*b + c)%mod
print(ans) |
p03243 | s801632378 | Accepted | n=int(input())
if n<=111:
print(111)
elif n<=222:
print(222)
elif n<=333:
print(333)
elif n<=444:
print(444)
elif n<=555:
print(555)
elif n<=666:
print(666)
elif n<=777:
print(777)
elif n<=888:
print(888)
else:
print(999) |
p03719 | s486014598 | Accepted | A,B,C=map(int,input().split())
if (A<=C)and(C<=B):
print("Yes")
else:
print("No") |
p03282 | s149050113 | Wrong Answer | s = list(input())
k = int(input())
if len(s) <= 1:
print(s[0])
else:
if s[0] == '1':
print(s[1])
else:
print(s[0])
|
p03524 | s698352521 | Wrong Answer | from collections import Counter
s=Counter(input())
print("NO") |
p03319 | s563891085 | Accepted | n,k = map(int,input().split())
x = n-k
if x%(k-1) == 0:
print(x//(k-1)+1)
else:
print(x//(k-1)+2) |
p03284 | s080403112 | Accepted | n,k=map(int,input().split())
if n%k==0:
print('0')
else:
print('1') |
p02645 | s449103721 | Wrong Answer | # -*- coding: utf-8 -*-
_in = input()
# if True:
# print(_in)
# else:
# print(_in)
print(_in[0:2])
|
p03077 | s021909896 | Accepted | n=int(input())
min1=11**15
for i in range(5):
a=int(input())
min1=min(min1,a)
print(-(-n//min1)+4)
#切り上げ |
p03328 | s207061697 | Wrong Answer | a, b = map(int, input().split())
for k in range(1, 1000):
x = (((k-1)*k*b - k*(k+1)*a)/2)/(b-a)
if x % 1 == 0:
print(int(x))
break |
p03377 | s432496412 | Wrong Answer | a, b, c = map(int, input().split())
if b>=c and (a <= c):
print("YES")
else:
print("NO") |
p02765 | s677121085 | Accepted | if __name__ == '__main__':
N, R = map(int, input().split())
if N < 10:
R += 100 * (10-N)
print(R) |
p02843 | s479160269 | Accepted | x = int(input())
if x >= 2000:
print(1)
else:
n = x // 100
d = x % 100
if n * 5 >= d:
print(1)
else:
print(0) |
p02888 | s880622575 | Accepted | import sys
from bisect import bisect_left
input = sys.stdin.readline
def main():
N = int(input())
L = list(map(int, input().split()))
L.sort()
ans = 0
for i in range(N - 2):
a = L[i]
for j in range(i + 1, N - 1):
k = bisect_left(L, a + L[j])
ans += (k - 1 - j)
print(ans)
if __name__ == "__main__":
main()
|
p03711 | s702235732 | Wrong Answer | x,y=map(int,input().split())
group_A=[1,3,5,7,8,10,12]
group_B=[4,6,9,11]
if x in group_A ==True and y in group_A ==True:
print("Yes")
elif x in group_B == True and y in group_B ==True:
print("Yes")
else:
print("No") |
p02923 | s646092499 | Accepted | N = int(input())
H_list = list(map(int, input().split()))
con_cnt = 0
max_con = 0
for i in range(1, N):
if H_list[i-1]>=H_list[i]:
con_cnt += 1
else:
if max_con < con_cnt:
max_con = con_cnt
con_cnt = 0
if max_con < con_cnt:
max_con = con_cnt
print(max_con) |
p04030 | s293729302 | Wrong Answer | s = input()
x = ""
for i in range(len(s) - 1):
if s[i] == "0" and s[i+1] != "B":
x += "0"
elif s[i] == "1" and s[i+1] != "B":
x += "1"
if s[-1] == "0":
x += "0"
elif s[-1] == "1":
x += "1"
print(x) |
p03385 | s451702510 | Accepted | print("YNeos"[len(set(input()))!=3::2]) |
p02775 | s163681241 | Wrong Answer | N = input()
ret = 0
up = 0
for r in N[::-1]:
m = int(r)
ret += min(10 - m, m)
if (10 - m) < m:
up = 1
print(ret + up)
|
p02725 | s578543606 | Accepted | #create date: 2020-03-28 21:04
import sys
stdin = sys.stdin
def ns(): return stdin.readline().rstrip()
def ni(): return int(ns())
def na(): return list(map(int, stdin.readline().split()))
def main():
k, n = na()
a = na()
lmax = a[0] + (k-a[-1])
for ai, aj in zip(a[0:-1], a[1:]):
lmax = max(lmax, (aj-ai))
print(k-lmax)
if __name__ == "__main__":
main() |
p03556 | s916818523 | Accepted | N=int(input())
for i in range(int(N**0.5)+1):
if N>=i**2:
ans=i**2
else:
break
print(ans) |
p03624 | s787372778 | Accepted | s = input()
s = set(s)
for i in range(ord('a'), ord('z') + 1):
t = chr(i)
if t not in s:
print(t)
break
else:
print('None') |
p02888 | s109686150 | Accepted | from bisect import *
N = int(input())
L = sorted(map(int,input().split()))
a = 0
for i in range(N):
for j in range(i+1,N):
a+=bisect_left(L,L[i]+L[j])-(j+1)
print(a) |
p02996 | s924244585 | Wrong Answer | N = int(input())
A = []
for i in range(N):
A.append(list(map(int, input().split())))
A.sort(key=lambda x: (x[1], x[0]))
gokei = 0
for i in A:
gokei += i[0]
if gokei > i[1]:
print("No")
else:
print("Yes") |
p02957 | s385548308 | Accepted | A,B=map(int,input().split())
if (A+B)%2==0:
print(int((A+B)/2))
else:
print("IMPOSSIBLE") |
p02843 | s986405871 | Wrong Answer | x = input()
x = '000'+x
z = x[:-2]
y = x[-2:]
s = 0
z = int(z)
y = int(y)
L = []
for i in range(1,15):
s +=5
if s>=y and z>=i:
print(1)
exit()
if z>=20:
print(1)
exit()
print(0) |
p02951 | s377915894 | Wrong Answer | print(-eval(input().replace(' ','-')))
|
p03838 | s161816627 | Accepted | x, y = map(int, input().split())
if x*y>=0:
if x<y:
print(y-x)
else:
print(x-y+2 if x*y>0 else x-y+1)
else:
print(abs(abs(x)-abs(y))+1) |
p03625 | s300451421 | Wrong Answer | def main():
_ = int(input())
A = [int(i) for i in input().split()]
from collections import Counter
c = Counter(A)
li = [(k, v) for k, v in c.items() if v >= 2]
if li and li[0][1] >= 4:
print(li[0][0] * li[0][0])
elif len(li) <= 1:
print(0)
else:
print(li[0][0] * li[1][0])
if __name__ == '__main__':
main()
|
p02756 | s850708480 | Accepted | from collections import deque
S = input()
Q = int(input())
S = deque(S)
flg_reverse = False
for q in range(Q):
_ = input()
if _[0] == '1':
flg_reverse = flg_reverse ^ True
else:
_T, _F, _C = _.split()
if (_F == '1') ^ flg_reverse:
S.appendleft(_C)
else:
S.append(_C)
S = list(S)
# reverseの部分を対応
if flg_reverse:
S.reverse()
print(''.join(S)) |
p02705 | s450632583 | Accepted | import math
r = int(input())
print(2 * r * math.pi) |
p03043 | s518903509 | Wrong Answer | from fractions import Fraction
N , K = list(map(int,input().split()))
denom_list = []
Z=0
def detame_keisan( N , K , i ):
kijun = K
score = i
count = 0
while score < kijun:
count += 1
score = ( score * 2 )
print(count)
return N * (2 ** count)
for i in range( 1,N+1 ):
X = detame_keisan( N , K , i)
denom_list.append( X )
for item in denom_list:
#Z += 1/item
Z += Fraction(1, item)
#print( Z)
print( float( Z.numerator / Z.denominator )) |
p02744 | s046616844 | Accepted | N = int(input())
X = [chr(ord('a') + i) for i in range(N)]
first_presence = {x: i for x, i in zip(X, list(range(N)))}
R = ['a']
for i in range(1, N):
next_r = []
for r in R:
max_s = max(r)
for x in X[:first_presence[max_s] + 2]:
next_r.append(r + x)
R = next_r
ans = R
ans.sort()
print(*ans, sep="\n")
|
p03760 | s519165097 | Accepted | o = input()
e = input()
if len(o)==len(e):
for i in range(len(o)):
print(o[i]+e[i],end="")
else:
for i in range(len(o)-1):
print(o[i]+e[i],end="")
print(o[-1]) |
p03041 | s807321757 | Accepted | N, K = map(int, input().split())
S = str(input())
K -= 1
print(S[:K] + S[K].lower() + S[K + 1:]) |
p03073 | s555659620 | Wrong Answer | s = list(input())
n = len(s)
s1 = [0]*n
s2 = [1]*n
for i in range(1,n,2):
s1[i] = 1
s2[i] = 0
count1 = 0
count2 = 0
for i in range(n):
if s[i]!=s1[i]: count1 += 1
if s[i]!=s2[i]: count2 += 1
print(min(count1,count2))
|
p02859 | s377239161 | Wrong Answer |
r = int(input())
s = r*r*3.14
b = s / 3.14
print(int(b)) |
p02642 | s347707991 | Accepted | N = int(input())
A = list(map(int, input().split()))
M = 10**6 + 1
cnt = [0] * M
for a in A:
if cnt[a] != 0:
cnt[a] += 1
continue
for b in range(a, M, a):
cnt[b] += 1
ans = 0
for a in A:
if cnt[a] == 1:ans += 1
print(ans)
|
p02705 | s411453389 | Accepted | pi = 3.141592653589793
r = float(input())
print(2*r*pi) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.