problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p03352 | s541810178 | Accepted | #!/usr/bin/env python3
def main():
X = int(input())
A = []
for b in range(1, 1000):
for p in range(2, 1000):
if b**p <= X:
A.append(b**p)
else:
break
print(max(A))
main() |
p03612 | s083301557 | Accepted | from itertools import count
with open(0) as f:
N, *p = map(int, f.read().split())
p.append(N+1)
ans = 0
for i in count(0):
if i == N:
break
if p[i] == i+1:
p[i] = p[i+1]
p[i+1] = i+1
ans += 1
print(ans) |
p02881 | s353673424 | Accepted | N=int(input())
move=10**12
for n in range(1,int(N**.5)+1):
if N%n==0:
move=min(move,N//n+n-2)
print(move) |
p02725 | s692996658 | Accepted | a,b = map(int,input().split())
aaa = [int(i) for i in input().split()]
aaa.append(aaa[0] + a)
result = [c1 - c0 for c0,c1 in zip(aaa,aaa[1:])]
print(a - max(result)) |
p02571 | s598436039 | Accepted | S = input()
T = input()
lstS = list(S)
lstT = list(T)
difMin = 1000
for i in range(len(lstS)-len(lstT)+1):
dif = 0
for j in range(len(lstT)):
if(lstT[j] != lstS[i+j]):
dif += 1
if(dif < difMin):
difMin = dif
print(difMin) |
p03038 | s404491466 | Wrong Answer | import sys
f=lambda:map(int,sys.stdin.readline().split())
n,m=f()
l=sorted(f())
s=[]
t=0
for i in range(m):
b,c=f()
if t+b>n:
s+=[c]*(n-t)
t=n
break
s+=[c]*b
t+=b
s.sort(reverse=1)
a=0
for i in range(n):
if i<t: a+=max(l[i],s[i])
else: a+=l[i]
print(a) |
p04045 | s524523152 | Wrong Answer | n, k = map(int, input().split())
d = list(map(int, input().split()))
digit = [str(i) for i in range(10) if not i in d]
ans = []
stack = [i for i in digit]
while stack:
s = stack.pop()
if int(s) >= n:
ans.append(s)
else:
for i in digit:
if len(i+s) <= len(str(n)):
stack.append(i+s)
if len(ans... |
p03495 | s067322222 | Accepted | from collections import Counter
n,k = map(int,input().split())
a_ls = list(map(int, input().split()))
c = Counter(a_ls)
value_ls = list(c.values())
value_ls.sort(reverse=True)
ans = 0
for i in range(k, len(value_ls)):
ans += value_ls[i]
print(ans)
|
p03997 | s523721554 | Accepted | a=int(input())
b=int(input())
h=int(input())
print(int((a+b)*h/2)) |
p03795 | s240812448 | Wrong Answer | N = int(input())
ans = 1
for i in range(1, N+1):
ans *= i
ans %= (10**9 + 7)
print(ans) |
p02897 | s693469472 | Accepted | N = int(input())
if N % 2 == 1:
print((N//2+1)/N)
else:
print(0.5) |
p02689 | s464624775 | Wrong Answer | N, M = map(int,input().split())
H = list(map(int,input().split()))
dic = {}
for i in range(M):
A, B = map(int,input().split())
H_max = max(H[A-1],H[B-1])
H_min = min(H[A-1],H[B-1])
if H_max in dic.keys():
dic[H_max] += 1
elif not(H[A-1] == H[B-1]):
dic[H_max] = 1
if H_min in dic... |
p03644 | s549506106 | Accepted | print(2**(len(bin(int(input())))-3)) |
p02988 | s461442277 | Accepted | n = int(input())
p = list(map(int, input().split()))
ans = 0
for i in range(n - 2):
if(max(p[i : i+3]) > p[i+1] and min(p[i : i+3]) < p[i+1]):
ans += 1
print(ans)
|
p03241 | s437557177 | Accepted | # -*- coding: utf-8 -*-
N, M = map(int, input().split(' '))
ret = 1
for i in range(1, int(M**0.5)+1):
if M % i == 0 and i * N <= M:
ret = max(ret, i)
j = M//i
if M % j == 0 and j * N <= M:
ret = max(ret, j)
# exit()
print(ret)
|
p03624 | s658284762 | Accepted | A="abcdefghijklmnopqrstuvwxyz"
S=input()
S=sorted(set(S))
for i in range(len(S)):
if S[i]!=A[i]:
print(A[i])
exit()
if len(S)<len(A):
print(A[len(S)])
exit()
print("None") |
p02842 | s795736429 | Accepted | import math
N = int(input())
downer = math.ceil(N/1.08)
upper = math.floor((N+1)/1.08-0.0000000001)
A = [i for i in range(downer,upper+1)]
for i in range(len(A)):
if math.floor(A[i]*1.08) == N:
print(A[i])
exit()
print(':(') |
p03478 | s114584689 | Accepted | n,a,b=map(int, input().split())
tmp=0
ans=0
for i in range(n+1):
for j in range(len(str(i))):
tmp+=int(str(i)[j])
if tmp>=a and tmp<=b:
ans+=i
tmp=0
print(ans) |
p03474 | s440069225 | Accepted | a,b=map(int,input().split())
s=input()
s1=s[:a]
s2=s[(a+1):]
if s1.isdecimal()==True and s2.isdecimal()==True and s[a]=="-":
print("Yes")
else:
print("No")
|
p04011 | s123228170 | Accepted | def resolve():
n=int(input())
k=int(input())
x=int(input())
y=int(input())
if n<k:
print(n*x)
else:
print(k*x+(n-k)*y)
resolve() |
p03639 | s332774793 | Accepted | N = int(input())
A = list(map(int, input().split()))
cnt_4 = 0
cnt_2 = 0
for a in A:
if a % 4 == 0:
cnt_4 += 1
elif a % 2 == 0:
cnt_2 += 1
cnt = N - 2*cnt_4 - cnt_2
if cnt_4 > 0 and N % 2 == 1:
cnt -= 1
if cnt <= 0:
print("Yes")
else:
print("No") |
p03493 | s446572798 | Accepted | print(input().count('1')) |
p02608 | s847786175 | Wrong Answer | n = int(input())
ans = [0 for _ in range(10050)]
for i in range(1, 105):
for j in range(1, 105):
for k in range(1, 105):
v = i * i + j * j + k * k + i * j + j * k + k * j
if v < 10050:
ans[v] += 1
for i in range(n):
print(ans[i + 1])
|
p03759 | s040663061 | Accepted | a, b, c = list(map(int, input().split()))
print("YES") if b - a == c - b else print("NO") |
p03095 | s313579086 | Accepted | MOD = 10 ** 9 + 7
cnt = [1 for _ in range(26)]
n = int(input())
string = input()
for s in string:
cnt[ord(s) - 97] += 1
ans = 1
for num in cnt:
ans *= num
ans %= MOD
print((ans - 1) % MOD) |
p02843 | s108111930 | Wrong Answer | x = int(input())
a = [100, 101, 102, 103, 104, 105]
for i in range(200, x + 1):
for j in range(100, int(i / 2 + 1)):
if j in a and i - j in a:
a.append(i)
continue
print(int(a[-1] == x))
|
p03779 | s922579404 | Accepted | X = int(input())
i = 0
while i <= X:
c = (i*(i+1)) / 2
if c >= X:
print(i)
break
i += 1 |
p03759 | s768495354 | Wrong Answer | a,b,c=map(int,input().split())
if (b-a)==(c-b):
print("Yes")
else:
print("No") |
p03264 | s193352348 | Accepted | k = int(input())
print((k//2)**2 if k%2==0 else ((k//2)+1)*(k//2)) |
p02946 | s624129083 | Accepted | k,x = map(int,input().split())
for i in range(x-k+1, k+x):
print(i, end = ' ') |
p02933 | s480214125 | Accepted | a = int(input())
s = input()
if a >= 3200:
print(s)
else:
print('red')
|
p02767 | s861188792 | Accepted | n = int(input())
X = list(map(int, input().split()))
ans = 10 ** 9
xmin = min(X)
xmax = max(X)
for i in range(xmin, xmax + 1):
tmp = 0
for j in range(n):
tmp += (X[j] - i) ** 2
ans = min(ans, tmp)
print(ans) |
p03359 | s676179818 | Accepted | a, b = map(int, input().split())
if a>b:
print(a-1)
else:
print(a)
|
p03352 | s924052089 | Accepted | x = int(input())
ans_list = [1]
for i in range(2,x+1):
cnt = 2
while True:
tmp = i ** cnt
if tmp > x:
break
ans_list += [tmp]
cnt += 1
ans_list.sort()
for i in ans_list[::-1]:
if i <= x:
print(i)
break
|
p02714 | s822868784 | Accepted | n=int(input())
s=input()
p=s.count('R')*s.count('G')*s.count('B')
for j in range(1,n-1):
for i in range(1,min(j,n-j-1)+1):
x,y,z=s[j-i],s[j],s[j+i]
if x!=y and y!=z and z!=x:
p-=1
print(p) |
p02866 | s038073457 | Wrong Answer | n = int(input())
D = tuple(map(int, input().split()))
maxd = max(D)
mod = 998244353
cd = [0] * (maxd+1)
for d in D:
cd[d] += 1
if 0 in cd or cd[0] > 1:
print(0)
else:
pre_nodes = 1
ans = 1
for i in range(1, maxd+1):
nodes = cd[i]
ans *= pow(pre_nodes, nodes, mod)
ans %= mod
... |
p02787 | s679149146 | Accepted | h, n = list(map(int, input().split()))
ab = [list(map(int, input().split())) for _ in range(n)]
dp = [0] * (h+max(a for a,b in ab))
for i in range(1, len(dp)):
dp[i] = min(dp[i-a]+b for a, b in ab)
print(min(dp[h:]))
|
p02723 | s787203081 | Accepted | S=input()
if S[2]==S[3] and S[4]==S[5]:
print("Yes")
else:
print("No") |
p02743 | s956001169 | Accepted | a,b,c =map(int,input().split())
if 4*a*b < (c-a-b) ** 2 and c-a-b > 0:
print("Yes")
else:
print("No")
|
p02726 | s318126222 | Accepted | N, X, Y = map(int, input().split())
distance = [0] * (N)
for i in range(1, N + 1):
for j in range(i + 1, N + 1):
d = j - i
b = abs(j - Y) + 1 + abs(X - i)
distance[min(b, d)] += 1
for i in distance[1:]:
print(i) |
p03838 | s327426972 | Accepted | a,b = map(int,input().split())
ans = abs(abs(a)-abs(b))
if a*b<0:ans+=1
if b<a<0 or 0<b<a:ans+=2
if a==0 and b<0:ans+=1
if b==0 and 0<a:ans+=1
print(ans) |
p02701 | s043416257 | Wrong Answer | list = []
n = int(input())
for i in range(n):
words = str(input())
if words in list:
list.append(words)
else:
n -= 1
print(n) |
p03632 | s059569592 | Accepted | A, B, C, D = map(int, input().split())
ans = min(B, D)-max(A, C)
print(max(ans, 0))
|
p02726 | s546603335 | Wrong Answer | # print('input >>')
N, X, Y = map(int,(input().split()))
ans = [0] * N
for i in range(1, N+1):
for j in range(i, N+1):
choku = j-i
tanraku = abs(X-i) + abs(Y-j) + 1
print((i,j), choku, tanraku)
ans[min(choku, tanraku)] += 1
# print('-----output-----')
for ans_e in ans[1:]:
prin... |
p02761 | s301032417 | Accepted | n,m = map(int, input().split())
s=[]
for i in range(m):
s.append(list(map(int, input().split())))
for i in range(1000):
if len(str(i)) != n:
continue
for si in s:
if len(str(i)) < si[0]:
break
if str(i)[si[0]-1] != str(si[1]):
break
else:
print(i)
break
else:
print(-1)
|
p03062 | s569830598 | Accepted | n = int(input())
a = [int(_) for _ in input().split()]
aa = [abs(_) for _ in a]
ans = 0
cnt = 0
for i in a:
if i < 0:
cnt += 1
ans += abs(i)
if cnt % 2 == 0:
print(ans)
else:
ans -= abs(min(aa)) * 2
print(ans) |
p03377 | s503750007 | Accepted | a, b, x = map(int, input().split())
print('YES' if a <= x <= a + b else 'NO') |
p02786 | s988786316 | Accepted | h = int(input())
ans = 0
count = 1
while h >= 1:
h/=2
ans += count
count*=2
print(ans)
#print(count)
#if(ans==1099511627775):
# print('T') |
p03211 | s366541332 | Accepted | s = int(input())
x = []
while True:
d = s % 10
x.append(d)
s //= 10
if s == 0:
break
n = len(x)
m = 10000
for i in range(n-2):
y = abs((x[n-1-i] - 7) * 100 + (x[n-1-i-1] - 5) * 10 + x[n-1-i-2] - 3)
if y < m:
m = y
print(m)
|
p03067 | s188868289 | Accepted | *s, t = map(int, input().split())
s.sort()
f = False
for i in range(s[0],s[1]+1):
if i == t:
f = True
print("Yes") if f else print("No") |
p03633 | s089993119 | Wrong Answer | N = int(input())
T = [int(input()) for i in range(N)]
max_T = max(T)
i = 1
while 1:
flg = 0
for t in T:
if max_T % t:
flg = 1#割り切れなかったらフラグを立てる
if not flg:
print(max_T)
exit()
i += 1
max_T *= i |
p03696 | s601985717 | Accepted | n = int(input())
s = input()
l = 0
r = 0
for si in s:
if si == "(":
l += 1
else:
if l == 0:
r += 1
else:
l -= 1
print("("*r + s + ")"*l) |
p03001 | s760912606 | Accepted | W,H,x,y = map(float,input().split())
if W/2 == x and H/2 == y:
print(W*H/2,1)
else:
print(W*H/2,0) |
p03994 | s775704184 | Accepted | s, k = input(), int(input())
ans = []
a = ord('z') + 1
for i in s:
if k == 0:
ans.append(ord(i))
elif 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=''... |
p03705 | s879356228 | Wrong Answer | N = list(map(int,input().split()))
M = (N[2] - N[1]) * (N[0] - 2) + 1
if N[0] == 1:
print(0)
elif N[0] == 2:
print(1)
elif N[1] > N[2]:
print(0)
else:
print(M) |
p02577 | s918510098 | Wrong Answer | n=int(input())
ans=n%9
if n!=0 and (ans==0 or ans==9):
print("Yes")
else:
print("No") |
p03077 | s388269617 | Wrong Answer | import math
n=int(input())
l=[int(input()) for i in range(5)]
sum=0
w=n
for i in range(4):
c=math.ceil((w/l[i]))
sum+=c
w=w-(c-1)*l[i+1]+w%l[i]
if w==0:
w=l[i]
print(sum+math.ceil(w/l[4])) |
p03107 | s032730353 | Accepted | S=input()
stack=[]
count=0
for s in S:
if not stack:
stack.append(s)
elif stack[-1]!=s:
stack.pop()
count+=2
else:
stack.append(s)
print(count) |
p03001 | s717965143 | Accepted | w, h, x, y = map(int, input().split())
a = w*h/2
if w/2 == x and h/2 == y:
b = 1
else:
b = 0
print(a,b) |
p03146 | s761647916 | Wrong Answer | s = int(input())
lis = [s]
def func(n):
if n%2 == 0:
return n//2
else:
return 3*n+1
while func(s) !=1:
s = func(s)
lis.append(s)
print(len(lis)+2) |
p02696 | s635769301 | Accepted | import math
A, B, N = list(map(int, input().split()))
if B-1 >= N:
num = N
else:
num = B-1
print(math.floor(A*num/B)-A*math.floor(num/B))
|
p03438 | s352726012 | Wrong Answer | def main():
N = int(input())
A = [int(i) for i in input().split()]
B = [int(i) for i in input().split()]
A.sort()
B.sort()
D = [b-a for a, b in zip(A, B)]
D_p = sum(d for d in D if d > 0)
D_n = sum(-d for d in D if d < 0)
print("Yes" if D_p >= 2*D_n else "No")
if __name__ == '__mai... |
p03041 | s539042217 | Accepted | n,k = map(int,input().split())
s = list(input())
s[k-1] = s[k-1].lower()
print(''.join(s)) |
p03013 | s474605286 | Accepted | # coding: utf-8
import sys
input = sys.stdin.readline
N,M=map(int,input().split())
A=[0]*M
dp=[-1]*(N+1)
for i in range(M):
tmp=int(input())
dp[tmp]=0
#print(dp)
dp[0]=1
dp[1]=0 if dp[1]==0 else 1
for i in range(2,N+1):
if dp[i]!=0:
dp[i]=dp[i-1]+dp[i-2]
print(dp[N]%(10**9+7)) |
p03778 | s551917758 | Accepted | w,a,b = map(int,input().split())
if a <= b <= a+w or b <= a <= b+w:
print(0)
elif a < b:
print(b-a-w)
else:
print(a - b - w) |
p03481 | s527819694 | Accepted | x, y = map(int, input().split())
ans = 1
n = x
while n * 2 <= y:
ans += 1
n *= 2
print(ans) |
p02766 | s152992423 | Accepted | n,k = map(int,input().split())
ans = 0
while n != 0:
n = int(n / k)
ans += 1
print(ans)
|
p03469 | s759688879 | Wrong Answer | s_17 = list(input())
# print(s_17)
s_17[3] = 8
print(*s_17) |
p03286 | s065376391 | Wrong Answer | n = int(input())
lst = []
while (n!=0):
r = int(n%2)
if(r<0):
r += 2
lst.append(r)
n = (n-r)/(-2)
for i in range(len(lst)):
print(lst[-1-i],end="")
print() |
p03285 | s055207894 | Wrong Answer | N = int(input())
ans = 'No'
X = N % 4
Y = N % 7
if X % 7 == 0 or Y % 4 == 0:
ans = 'Yes'
print(ans)
|
p02699 | s466870481 | Wrong Answer | s, w = map(int, input().split())
if s >= w:
print('safe')
else:
print('unsafe') |
p02598 | s180225513 | Wrong Answer | import sys
input = sys.stdin.readline
import math
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
N, K = MI()
mylist = LI()
length = len(mylist)
high = max(mylist)+1
low = 0
mid = (high + low) / 2
while high - low >= 0.001:
temp = 0
fo... |
p03076 | s991976798 | Accepted | l = []
for i in range(5):
x = input()
l.append([int(x[-1]), int(x)])
l.sort()
ans = 0
flag = True
for l1, l2 in l:
if l1 == 0:
ans += l2
elif flag:
ans += l2
flag = False
else:
ans += ((l2//10) + 1) * 10
print(ans) |
p02832 | s701146723 | Accepted | def main():
N = int(input())
A = [int(a) for a in input().split()]
idx = 1
cnt = 0
for i in range(N):
if A[i] == idx:
idx += 1
cnt += 1
if cnt == 0:
print(-1)
else:
print(N-cnt)
if __name__ == "__main__":
main() |
p03478 | s438602187 | Wrong Answer | N, A, B = list(map(int, input().split()))
res = 0
for i in range(N+1):
if A <= sum([int(s) for s in str(i)]) <=B:
res += 1
print(res) |
p03328 | s623166177 | Accepted | # B - Stone Monument
a, b = map(int, input().split())
diff = b - a
height = (1 + diff) * diff // 2
print(height - b)
|
p02727 | s983716990 | Accepted | X,Y,A,B,C = map(int, input().split())
P = [int(i) for i in input().split()]
Q = [int(i) for i in input().split()]
R = [int(i) for i in input().split()]
P.sort(reverse = True)
Q.sort(reverse = True)
R.sort(reverse = True)
PQ = P[:X] + Q[:Y]
PQ.sort()
for i in range(min(X+Y, C)):
if PQ[i] < R[i]:
PQ[i] = ... |
p03645 | s887478350 | Accepted | N,M = map(int,input().split())
I = set()
n = set()
for i in range(M):
a,b = map(int,input().split())
if a == 1:
I.add(b)
if b == N:
n.add(a)
if I & n == set():
print("IMPOSSIBLE")
else:
print("POSSIBLE") |
p02627 | s086456648 | Wrong Answer | a = input()
if 'a'< a[0] :
print("A")
else:
print("a") |
p03067 | s155991271 | Accepted | a,b,c=map(int,input().split())
if a>c>b or a<c<b:
print("Yes")
else:
print("No")
|
p03556 | s004175910 | Accepted | N = int(input())
print(int(N**0.5)**2) |
p03103 | s292023724 | Accepted | n,m=map(int,input().split())
lst=[list(map(int,input().split())) for i in range(n)]
lst.sort(key=lambda x:x[0])
ans=0
for i in lst:
ans+=min(m,i[1])*i[0]
m-=i[1]
if m<=0:
break
print(ans)
|
p02924 | s813052622 | Accepted | def main():
n = int(input())
print(n*(n-1)//2)
if __name__ == '__main__':
main()
|
p03360 | s907891277 | Accepted | a,b,c,=map(int,input().split())
k=int(input())
while k>0:
if max(a,b,c)==c:
c=2*c
k-=1
elif max(a,b,c)==b:
b=2*b
k-=1
else:
a=2*a
k-=1
print(sum([a,b,c])) |
p03386 | s475216936 | Accepted | a, b, k = map(int, input().split())
for x in range(a, min(b+1, a+k)):
print(x)
for x in range(max(a+k, b-k+1), b+1):
print(x)
|
p03038 | s278326540 | Accepted | n,m = map(int,input().split())
a = list(map(int,input().split()))
l = [list(map(int,input().split())) for i in range(m)]
l = list(sorted(l,reverse=True,key=lambda x: x[1]))
b,c = [list(i) for i in zip(*l)]
d = [0] * n
x = min(n,sum(b))
y = 0
while x > 0:
x -= 1
d[x] = c[y]
b[y] -= 1
if b[y] == 0:
... |
p03555 | s084046308 | Accepted | c1 = input()
c2 = input()
if (c1 == c2[::-1]) and (c2 == c1[::-1]):
print('YES')
else:
print('NO')
|
p02917 | s817067328 | Accepted | n = int(input())
b = list(map(int,input().split()))
ANS = []
ANS.append(b[0])
for i in range(1, n - 1):
ANS.append(min(b[i - 1], b[i]))
ANS.append(b[n-2])
print(sum(ANS)) |
p03617 | s404600540 | Accepted | def main():
q, h, s, d = map(int, input().split())
n = int(input())
min_1 = min(q*4, h*2, q*2+h, s)
min_2 = min(min_1*2, d)
print((n % 2)*min_1 + (n // 2)*min_2)
if __name__ == '__main__':
main()
|
p03106 | s138008006 | Wrong Answer | a,b,k = map(int,input().split())
i = 100
j = 0
while True:
i -= 1
if a % i == 0 and b % i == 0:
j += 1
if j == k:
print(i)
break |
p03106 | s549765473 | Accepted | a, b, k = list(map(int, input().split()))
la = []
lb = []
for i in range(1, a+1):
if a % i == 0:
la.append(i)
sa = set(la)
lsa = list(sa)
lsas = sorted(lsa)
for j in lsas:
if b % j == 0:
lb.append(j)
s = set(lb)
lsb = list(s)
lsbs = sorted(lsb)
pri... |
p03449 | s982057990 | Accepted | N = int(input())
A1 = list(map(int, input().split()))
A2 = list(map(int, input().split()))
ans1 = []
ans2 = []
for x in range(N):
if x == 0:
ans1.append(A1[x])
ans2.append(A1[x] + A2[x])
else:
ans1.append(ans1[x - 1] + A1[x])
ans2.append(max(ans1[x], ans2[x - 1]) + A2[x])
print(... |
p03146 | s550162666 | Accepted | s=int(input())
if s==1 or s==2:
print(4)
else:
i=1
while s!=1:
i+=1
if s%2==0:
s/=2
else:
s=s*3+1
print(i+1)
|
p03317 | s549670032 | Accepted | #!python3
# input
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
def main():
s = N - K
k = K - 1
ans = 1
ans += s // k
if s % k != 0:
ans += 1
print(ans)
if __name__ == "__main__":
main()
|
p03814 | s026264519 | Wrong Answer | s = str(input())
Alst = []
Zlst = []
for i in range(len(s)):
if s[i]=='A':
Alst.append(i)
elif s[i]=='Z':
Zlst.append(i)
print(max(Zlst)-min(Alst)) |
p02817 | s117013936 | Accepted | a,b=map(str,input().split())
print(b+a) |
p02726 | s652707103 | Accepted | n,x,y = map(int,input().split())
x -= 1
y -= 1
cnt = [0]*n
for i in range(n):
for j in range(i+1,n):
d = min(j-i,abs(x-i)+1+abs(j-y))
#print(d,end=' ')
cnt[d] += 1
for i in range(1,n):
print(cnt[i])
|
p02582 | s055100971 | Accepted | s = input()
if s.count('S') == 0:
print(3)
elif s[:2] == 'RR' or s[1:3] == 'RR':
print(2)
elif s[0] == 'R' and s[2] == 'R':
print(1)
elif s.count('R') == 1:
print(1)
else:
print(0)
|
p02761 | s801835169 | Wrong Answer | n, m = map(int, input().split())
numbers = [0]*n
existence = False
for _ in range(m):
s, c = map(int, input().split())
if c > numbers[s-1]:
numbers[s-1] = c
if s == 1:
if c != 0 or n == 1:
existence = True
if existence:
print(*numbers, sep='')
else:
print(-1)
|
p02582 | s725383011 | Wrong Answer | s = input()
count, final = 0, 0
for i in s:
if i == "R": count += 1
elif i == "S":
if count > final: final, count = count, 0
print(final)
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.