problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p02946 | s020935265 | Accepted | K, X = map(int, input().split())
for i in range(X - K + 1, X + K):
print(i,end = " ") |
p02691 | s975855273 | Wrong Answer | n = int(input())
a_l = list(map(int,input().split()))
count = 0
for i in range(n):
for j in range(i+1,n):
if (j-i) == abs(a_l[j-1] - a_l[i-1]):
count += 1
print(count)
|
p02988 | s651852710 | Accepted | n = int(input())
P = list(map(int,input().split()))
ans = 0
for i in range(1,n-1):
pl = P[i-1:i+2]
pl.sort()
p = P[i]
if pl[1] == p:
ans += 1
print(ans) |
p03017 | s121371858 | Accepted | n,a,b,c,d=map(int,input().split())
s=input()
# a->c, b->d
# a<b
if c>d:
if '...' in s[b-2:d+1]:
if '##' in s[a:c]:
print('No')
exit()
else:
print('No')
exit()
else:
if '##' in s[a:c]:
print('No')
exit()
if '##' in s[b:d]:
print('No')
exit()
print('Yes')
|
p02665 | s116971904 | Accepted | N = int(input())
A = list(map(int, input().split()))
node = 1
# 作成しなければならない葉の残りの数
leaf = sum(A)
max_node = 1
judge = True
ans = 0
for i, a in enumerate(A):
ans += node
leaf -= a
if node < a+1 and leaf > 0:
judge = False
break
# 次の深さのノード
max_node = (node - a) * 2
node = min(leaf,... |
p03407 | s533282908 | Wrong Answer | a, b, c = (int(_) for _ in input().split())
print('Yes' if a + b <= c else 'No') |
p03035 | s562299107 | Accepted | a,b = map(int,input().split())
if a >= 13:
print(b)
elif 6<=a<=12:
print(b//2)
else:
print(0) |
p03994 | s517904021 | Wrong Answer | s=input()
l=len(s)
k=int(input())
z=''
for i in range(l):
t=123-ord(s[i])
if t<=k:
z+='a'
k-=t
else:
z+=s[i]
v=ord(z[l-1])-97+k
z=z[:l-1]+chr(v%26+97)
print(z) |
p02820 | s838310084 | Wrong Answer | n, k = map(int, input().split())
r, s, p = map(int, input().split())
t = list(input())
table = { "r": p, "s": r, "p": s }
score = [0] * n
for i in range(n):
if i-k < 0:
score[i] = table[t[i]]
continue
if score[i-k] != 0 and score[i-k] == table[t[i]]:
score[i] = 0
else:
score... |
p03679 | s704261091 | Wrong Answer | X, A, B = map(int, input().split())
if B < A:
print("delicious")
elif B <= (X + A):
print("safe")
elif B >= (X + A + 1):
print("dangerous")
|
p03695 | s277819994 | Accepted | li=[0]*8
o=0
n,*a=map(int,open(0).read().split())
for i in a:
if i>=3200:o+=1
else:li[i//400]=1
if sum(li)==0:print(1,min(o,8))
else:print(sum(li),(sum(li)+o)) |
p02742 | s247747665 | Accepted | h,w = map(int, input().split())
if (h == 1) or (w == 1):
print(1)
elif (h*w)%2==0:
print(int((h*w)/2))
else:
print(int(((h*w)+1)/2)) |
p03471 | s139238279 | Accepted | n, y = map(int, input().split())
for a in range(n+1):
for b in range(n+1-a):
c = n-a-b
total = 10000*a + 5000*b + 1000*c
if total==y:
print("{0} {1} {2}".format(a,b,c))
exit()
print("-1 -1 -1") |
p03359 | s362618037 | Accepted | a,b = map(int,input().split())
if a <= b: print(a)
else: print(a-1)
|
p02657 | s392329732 | Wrong Answer | s = input().split()
float(s[0]) * float(s[1])
|
p03779 | s141457847 | Wrong Answer | X = int(input())
i = 0
while X > 0:
i += 1
if X-i >= i + 1 or X == i:
X -= i
print(i) |
p03545 | s519935948 | Accepted | abcd = list(input())
abcd = [int(i) for i in abcd]
for i in range(2**3):
bag=["+"]*3
#print("pattern {}: ".format(i), end="")
for j in range(3):
if ((i>>j) & 1):
bag[j]="-"
#print(bag)
s=abcd[0]
for ii in range(len(bag)):
if bag[ii] == "+":
s+=abcd[ii+1]
else:
s-=abcd[ii+1]
... |
p03011 | s270962674 | Accepted | p,q,r = map(int,input().split())
print(min([p+q,q+r,r+p]))
|
p02813 | s613100114 | Accepted | import math
import itertools
N = int(input())
p = [int(x) for x in input().split()]
q = [int(x) for x in input().split()]
a = []
for i in range(1,N+1):
a.append(i)
junn = list(itertools.permutations(a))
flag = 0
for i in range(math.factorial(N)):
if p == list(junn[i]):
pp = i
if flag == 1:
... |
p03797 | s982710712 | Accepted | n, m = map(int, input().split())
if n * 2 >= m:
print(m//2)
exit()
else:
m -= n * 2
print(n + (m // 4)) |
p02753 | s858525564 | Accepted | #バスが運行するかどうか Yes 運航する
S=input()
if S[0]==S[1] and S[0]==S[2]:
print("No")
else:
print("Yes") |
p02707 | s680809210 | Accepted | n = int(input())
a = [0]
a.extend(list(map(int,input().split())))
nums = [0]*(n+1)
for i in a:
nums[i] += 1
ans = '\n'.join(map(str,nums[1:]))
print(ans) |
p03607 | s584421816 | Accepted | import collections
N = int(input())
A = [0]*N
for i in range(N):
A[i] = int(input())
#print(collections.Counter(A))
c = collections.Counter(A)
count = 0
for i in c:
count+=c[i]%2
print(count) |
p03698 | s434351866 | Wrong Answer | s = input()
word = []
for i in s:
if (i not in word):
word.append(i)
else:
print('no')
print('yes')
|
p02682 | s562153780 | Accepted | A,B,C,K = map(int,input().split())
ans = 0
if A >= K:
print(K)
elif A<K and A+B>K:
print(A)
else:
print(2*A+B-K) |
p03705 | s785817371 | Wrong Answer | n,a,b = map(int,input().split())
k = a - b + 1 + n
ans = 1
for i in range(n):
ans *= (k-i)
for i in range(n):
ans = ans//(n-i)
print(ans)
|
p02768 | s034975795 | 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)... |
p03711 | s275216567 | Accepted | x,y = [int(i) for i in input().split()]
a = [1,3,5,7,8,10,12]
b = [4,6,9,11]
c = [2]
if x in a and y in a:
print('Yes')
elif x in b and y in b:
print('Yes')
else:
print('No') |
p02922 | s703705942 | Accepted | A,B=map(int,input().split())
total=0
i=0
if B==1:
print(0)
else:
while B>total:
i+=1
total=A*i-(i-1)
print(i) |
p02838 | s245371843 | Wrong Answer | import numpy as np
n = int(input())
a = list(map(int,input().split()))
a = np.array(a,dtype=np.int64)
point = 0
mod = 10**9+7
b = [((a>>i)&1).sum() for i in range(61)]
c = [n-b[i] for i in range(61)]
point = 0
for i in range(61):
point += 2**i*b[i]*c[i]%mod
print(point%mod) |
p03077 | s911587908 | Accepted | import math
n = int(input())
base = [int(input()) for i in range(5)]
time = math.ceil(n / base[0])
base_min = base[0]
for i in range(1,5):
if base_min <= base[i]:
time = time + 1
elif base[i] < base_min:
time = time + math.ceil( (n - base[i]*(math.ceil(n/base_min)-1) )/base[i])
base_min = base[i]
pr... |
p02681 | s740136094 | Accepted | S = list(input())
T = list(input())
T.pop(-1)
if S==T:
print("Yes")
else:
print("No") |
p02793 | s024945100 | Wrong Answer | MOD = 10**9+7
N = int(input())
A = list(map(int,input().split()))
def GCD(x,y):
if y==0:
return x
return GCD(y,x%y)
lcm = 1
for i in A:
lcm = lcm*i*pow(GCD(lcm,i),MOD-2,MOD)
ans = 0
for i in A:
ans += lcm*pow(i,MOD-2,MOD)
ans %= MOD
print(ans) |
p03136 | s341554808 | Wrong Answer | N = int(input())
List = [int(i) for i in input().split(" ")]
Max = max(List)
l = 0
for i in range(N):
if List[i]!=Max:
l+=List[i]
if Max<l:
print("Yes")
else:
print("No") |
p02780 | s417994071 | Accepted | N,K=map(int,input().split())
p=list(map(int,input().split()))
ans=(sum(p[0:K])+K)/2
temp=ans
for i in range(1,N-K+1):
temp-=(p[i-1]+1)/2
temp+=(p[i+K-1]+1)/2
if temp>ans:
ans=temp
print(ans) |
p02946 | s198111892 | Accepted | k,x = map(int,input().split())
start = x-k+1
for i in range(start,start+2*k-1,1):
print(i,end=" ") |
p02843 | s883201285 | Accepted | X = int(input())
a = X // 100
r = X % 100
ans = '1' if r <= 5*a else '0'
print(ans) |
p03035 | s293878503 | Accepted | a,b = map(int,input().split())
if a>12:
ans = b
elif a>5:
ans = b//2
else:
ans = 0
print(ans)
|
p03086 | s995059505 | Accepted | S=input()
ans=0
temp=0
l=['A','C','G','T']
for i in range(len(S)):
if S[i] in l:
temp+=1
ans=max(temp,ans)
else:
temp=0
print(ans) |
p03943 | s152185448 | Wrong Answer | a,b,c = map(int ,input().split())
if a == b+c or b == a+c or c == a+b:
print("YES")
else :
print("NO") |
p04005 | s259832158 | Wrong Answer | A,B,C = map(int,input().split())
if A%2==0 or B%2==0 or C%2==0:
print(0)
else:
cmin = ((A+1)//2-A//2)*B*C
cmin = min(cmin,((B+1)//2-B//2)*A*C)
Cmin = min(cmin,((C+1)//2-C//2)*B*A)
print(cmin) |
p02642 | s366411649 | Wrong Answer | import sys
from itertools import groupby
readline = sys.stdin.buffer.readline
a = map(int, readline().split())
b = list(map(int, readline().split()))
b.sort(reverse=True)
print(b)
x = len(b)
c = [(k, len(list(L))) for k, L in groupby(b)]
# print(c)
for i, v in enumerate(c):
if v[1] > 1:
x -= v[1]
break
fo... |
p03910 | s807574563 | Accepted | # coding: utf-8
N=int(input())
s=0
A=[]
for i in range(1,N+1):
s+=i
A.append(i)
if s>=N:
l=i
break
d=s-N
#d_=l+1-d
#print(A)
for a in A:
if a!=d:
print(a)
|
p03986 | s169841716 | Accepted | x=input()
ans=len(x)
p=0
for i in x:
if i=="S":
p+=1
if p>0 and i=="T":
p-=1
ans-=2
print(ans) |
p04020 | s658253378 | Accepted | N = int(input())
a = [int(input()) for _ in range(N)]
ans = 0
for i in range(N):
cnt, mod = divmod(a[i], 2)
ans += cnt
if i < N - 1 and a[i + 1] != 0:
a[i + 1] += mod
print(ans) |
p02933 | s224558512 | Wrong Answer | n=int(input())
s=input()
if n>=3200:
print("red")
else:
print(s) |
p02790 | s038855849 | Wrong Answer | a, b = input().split()
atxt, btxt = "", ""
for i in range(int(b)):
atxt += a
for i in range(int(a)):
btxt += a
if atxt <= btxt:
print(atxt)
else:
print(btxt) |
p03038 | s071556309 | Wrong Answer | import bisect
N,M=map(int, input().split() )
A=list(map(int, input().split() ))
B=[0]*M
C=[0]*M
A.sort()
for i in range(M):
B[i],C[i]=map(int, input().split() )
for j in range( B[i] ):
A[j] = max(A[j],C[i])
print(sum(A))
|
p02818 | s771537792 | Accepted | a,b,k = map(int,input().split())
taka = a
aoki = b
recur = k
if taka>=k:
print("{} {}".format(taka-k,aoki))
elif k>=taka and (aoki+taka)>=k:
print("{} {}".format(0,aoki-(k-taka)))
elif (aoki+ taka)<=k:
print("0 0")
|
p03087 | s720809527 | Wrong Answer | n, q = map(int, input().split())
s = input()
count = 0
for i in range(q):
l, r = map(int, input().split())
count += s[l-1:r].count('AC')
print(count) |
p02959 | s379512555 | Accepted | N = int(input())
A = [int(i) for i in input().split()]
B = [int(i) for i in input().split()]
B.append(0)
ans = 0
for i in range(N+1):
taosukazu1 = min(A[i],B[i])
B[i] -= taosukazu1
A[i] -= taosukazu1
ans += taosukazu1
if B[i] > 0:
taosukazu2 = min(A[i+1],B[i])
B[i] -= taosukazu2
A[i+1] -= taosuka... |
p02772 | s074564253 | Accepted | n = int(input())
a = list(map(int, input().split()))
for i in a:
if not i%2:
if i%3==0 or i%5==0:
pass
else:
print("DENIED")
break
else:
print("APPROVED")
|
p03472 | s837737218 | Wrong Answer | import sys
import math
n,h = map(int,input().split())
a = [0 for i in range(n)]
b = [0 for i in range(n)]
for i in range(n) :
a[i],b[i] = map(int,input().split())
b.sort(reverse=True)
|
p04029 | s661949543 | Accepted | N = int(input())
print(N * (N + 1) // 2) |
p02823 | s639532737 | Wrong Answer | n,a,b = map(int, input().split())
if (b-a)%2 == 0:
print(((b-a)//2))
else:
print(min(a-1,n-b)+1+(b-a-1//2)) |
p02939 | s810519536 | Wrong Answer | s=input()
n=len(s)
for i in range(n-1):
if s[i]==s[i+1]:
n-=1
print(n+1) |
p02618 | s809679984 | Accepted | D = int(input())
C = list(map(int, input().split()))
SS = [list(map(int, input().split())) for i in range(D)]
for i in range(365):
print(9)
|
p03286 | s621493979 | Wrong Answer | import sys
from collections import deque
sys.setrecursionlimit(10 ** 6)
def input(): return sys.stdin.readline().rstrip()
N = int(input())
l = deque()
while N != 0:
x = (-2) ** len(l)
y = (-2) * x
if abs(N) % abs(y) != 0:
N -= x
l.appendleft('1')
else:
l.appendleft('0')
prin... |
p02691 | s590251169 | Accepted | n =int(input())
ls = list(map(int,input().split()))
d = [[0,0] for i in range(n)]
for i in range(n):
if i-ls[i]>=0:
d[i-ls[i]][1]+=1
if i+ls[i]<n:
d[i+ls[i]][0]+=1
ans = 0
for a,b in d:
ans += a*b
print(ans) |
p02817 | s368203408 | Accepted | S,T = input().split()
print(T + S)
|
p02755 | s768986212 | Wrong Answer | #ABC158
a,b = map(int,input().split())
tax_a = a/0.08
if int(tax_a*0.1) == b:
ans = tax_a-1
if int(ans*0.1) == b and int(ans*0.8) == a:
print(int(ans))
else:
print(int(tax_a))
else:
print('-1') |
p03077 | s095878163 | Accepted | import math
n = int(input())
ma = 0
for i in range(5):
a = int(input())
if ma < math.ceil(n/a):
ma = math.ceil(n/a)
print(ma+4)
|
p02577 | s663665969 | Wrong Answer | #abc176b
N=input()
s=0
for i in range(len(N)):
s+=int(N[i])
print(s)
if s%9==0:
print('Yes')
else:
print('No')
|
p03611 | s258280778 | Accepted | from collections import Counter
N = int(input())
A = list(map(int, input().split()))
B = []
for a in A:
B.append(a-1)
B.append(a)
B.append(a+1)
C = Counter(B)
print(C.most_common()[0][1]) |
p03360 | s452994577 | Wrong Answer | a,b,c=map(int,input().split())
k=int(input())
print(a+b+c-max(a,b,c)+max(a,b,c)*2*k) |
p03127 | s620926668 | Accepted | from fractions import gcd
def solve():
N = int(input())
A = [int(i) for i in input().split()]
a = A[0]
for i in range(1, N):
# 先頭をとって、gcdを繰り返していく
a = gcd(a, A[i])
print(a)
if __name__ == "__main__":
solve()
|
p03469 | s205625422 | Accepted | S = input ()
Z = S.replace('2017', '2018')
print (Z) |
p03105 | s156942593 | Accepted | a,b,c=map(int,input().split())
print(min(b//a,c)) |
p02935 | s544768948 | Accepted | n = input()
m = list(map(int,input().split()))
answer = 0
while len(m) > 1:
m.sort()
answer = (m.pop(0)+m.pop(0)) / 2
m.append(answer)
print(m[0]) |
p02556 | s328314029 | Wrong Answer | N=int(input())
a = []
b = []
for i in range(N):
x,y=map(int,input().split())
a.append(abs(x+y))
b.append(abs(x-y))
A = max(a)-min(a)
B = max(b)-min(b)
print(max(A,B)) |
p02819 | s284001077 | Accepted | import math
def isPrime(y):
if y == 2 or y == 3:
return True
for i in range(2, int(math.sqrt(y)) + 2):
if y % i == 0:
return False
return True
x = int(input())
while not isPrime(x):
x += 1
print(x) |
p03524 | s099393955 | Accepted | s = list(map(str,input()))
from collections import Counter
l = Counter(s)
abc = [l["a"],l["b"],l["c"]]
mx = max(abc)
mi = min(abc)
md = sum(abc)-mx-mi
if mx-mi == 1 or mx-mi == 0:
print("YES")
else:
print("NO") |
p02743 | s380345940 | Accepted | from math import sqrt
# map(int,input().split())
a,b,c = map(int,input().split())
if (c-a-b>0)and(4*a*b < (c-a-b)*(c-a-b)):
print("Yes")
else:
print("No") |
p02987 | s918883792 | Wrong Answer | s=input()
for i in range(3):
if s[i]==s[i+1]:
print('Bad')
break
else:
print('Good') |
p03486 | s018205131 | Accepted | s=sorted(input())
t=sorted(input())[::-1]
print("Yes" if s<t else "No") |
p02847 | s560714590 | Wrong Answer | s=str(input())
if s=="SAT":
print("1\ntoday is",s,"tomorrow is sunday")
elif s=="MON":
print("7\ntoday is",s,"after 7 days is sunday")
elif s=="TUE":
print("6\ntoday is",s,"after 6 days is sunday")
elif s=="WED":
print("5\ntoday is",s,"after 5 days is sunday")
elif s=="THU":
print("4\ntoday is",s,"a... |
p02629 | s171459993 | Wrong Answer | N=int(input())
lista=["a","b","c","d","e","f","g","h","i","j","k","l","m","n"
,"o","p","q","r","s","t","u","v","w","x","y","z"]
amari=[]
ans=""
while N!=0:
(x,y)=divmod(N,26)
amari.append(y)
N=x
for i in amari[::-1]:
ans+=lista[i-1]
print(ans) |
p03854 | s624895203 | Accepted | data = input()
tmp = data.replace('eraser', '')
tmp = tmp.replace('erase', '')
tmp = tmp.replace('dreamer', '')
tmp = tmp.replace('dream', '')
if tmp == '':
print('YES')
exit()
print('NO') |
p02572 | s792037727 | Wrong Answer | N = int(input())
As = list(map(int, input().split()))
S = 0
T = 0
for i in range(N):
S += As[i]
T += As[i] * As[i]
# print(S)
# print(T)
A = S*S % 1000000007
B = T % 1000000007
print(int(((A - B) % 1000000007) / 2) % 1000000007) |
p02924 | s841456225 | Accepted | n = int(input())
print(n*(n-1)//2) |
p03557 | s791780622 | Wrong Answer | import bisect
N =int(input())
A =sorted(list(map(int,input().split())))
B =sorted(list(map(int,input().split())))
C =sorted(list(map(int,input().split())))
counter = 0
for i in range(len(B)):
Ind_A = bisect.bisect(A,B[i])
if A[Ind_A-1] == B[i]:
Ind_A -= 1
Ind_C = bisect.bisect(C,B[i])
num_C = le... |
p02681 | s118346945 | Wrong Answer | from sys import *
def test(s,t):
for i,j in zip(s,t):
if i != j:
return "No"
return "Yes"
s = stdin.readline()
t = stdin.readline()
print(test(s,t)) |
p03059 | s714756758 | Wrong Answer | A,B,T = map(int,input().split())
time = 0
cnt = 0
while time < T + 0.5:
time += A
cnt += B
print(cnt) |
p02570 | s275028442 | Accepted | d,t,s=map(int,input().split())
if d-(s*t)<=0:
print("Yes")
else:
print("No") |
p02608 | s941849808 | Accepted | n = int(input())
import math
lim = math.ceil(math.sqrt(n))
l = [0]*n
for x in range(1, lim):
for y in range(1, lim):
for z in range(1, lim):
i = (x+y+z)**2 - (x*y + y*z + z*x)
if (0<i) and (i<n+1):
l[i-1] += 1
for i in l:
print(i) |
p03407 | s263994611 | Wrong Answer | A,B,C= map(int, input().split())
# A = int(input())
# B = int(input())
# C = int(input())
# X = input()
print("Yes" if (A * 2 + B * 2) >= C else "No") |
p03607 | s614113707 | Accepted | N = int(input())
A = set()
for _ in range(N):
a = input()
if a in A:
A.remove(a)
else:
A.add(a)
print(len(A)) |
p02713 | s104496546 | Accepted | from math import gcd
def main():
K = int(input())
ans = 0
for i in range(1,K+1):
for j in range(1,K+1):
for k in range(1,K+1):
ans += gcd(gcd(i,j),k)
print(ans)
if __name__ == "__main__":
main() |
p02547 | s815750085 | Wrong Answer | l=[]
n=int(input())
for _ in range(n):
a=list(map(int,input().split()))
l.append(a)
flag=0
for i in range(1,n-1):
if l[i-1][0]==l[i-1][1] and l[i][0]==l[i][1] and l[i+1][0]==l[i+1][1]:
flag=1
break
if flag==1:
print("YES")
else:
print("NO") |
p03274 | s326781209 | Accepted | N,K=map(int,input().split())
x=list(map(int,input().split()))
ans=float('inf')
for i in range(N-K+1):
ans=min(ans,abs(x[i])+abs(x[i+K-1]-x[i]),abs(x[i+K-1])+abs(x[i+K-1]-x[i]))
print(ans) |
p02993 | s391201371 | Accepted | s = int(input())
a = [0]*4
a[0] = s//1000
s = s-a[0]*1000
a[1] = s//100
s = s-a[1]*100
a[2] = s//10
s = s-a[2]*10
a[3] = s
if(a[0]==a[1] or a[1]==a[2] or a[2]==a[3]):
print("Bad")
else:
print("Good") |
p03730 | s587826110 | Accepted | a,b,c = map(int, input().split())
ans = "NO"
for i in range(1, b+1):
if (a*i) % b == c:
ans = "YES"
break
print(ans) |
p02996 | s044372416 | Wrong Answer | import sys
jobs = []
for _ in range(int(input())):
a, b = [int(i) for i in input().split()]
if b - a < 0:
print("No")
sys.exit()
jobs.append((a, b, b - a + 1))
jobs.sort(key=lambda j: j[1])
curr_jour = 0
for j in jobs:
if curr_jour > j[2]:
print("No")
sys.exit()
cu... |
p02792 | s735141574 | Wrong Answer | from numpy import zeros
N = 25
A = zeros((10,10))
for i in range(1,N+1):
a = int(str(i)[0])
b = int(str(i)[-1])
A[a][b] += 1
cnt = 0
for _ in range(1,N+1):
a = int(str(_)[0])
b = int(str(_)[-1])
cnt += A[b][a]
print(int(cnt)) |
p03419 | s200707508 | Accepted | N,M = map(int,input().split())
if N == 1:
cn = 1
else:
cn = N-2
if M == 1:
cm = 1
else:
cm = M-2
if N == 1 and M == 1:
print(1)
else:
print(cm*cn) |
p03146 | s073576343 | Accepted | s=int(input())
a=[s]+[0]*1000000
if s%2==0:
a[1]=s//2
else:
a[1]=3*s+1
#print(a)
i=1
while a[i] not in a[:i]:
if a[i]%2==1:
a[i+1]=3*a[i]+1
else:
a[i+1]=a[i]//2
i+=1
print(i+1)
|
p04030 | s555081620 | Wrong Answer | keys = input()
r = ''
for k in keys:
if k == 0:
r += '0'
elif k == '1':
r += '1'
elif k == 'B':
r = r[:len(r)-1]
print(r)
|
p03328 | s883749522 | Wrong Answer |
a,b=map(int,input().split())
k = b-a
al = 0
for i in range(k):
al += i
print(b-al) |
p03284 | s835025228 | Accepted | # coding: utf-8
# https://atcoder.jp/contests/abc105
# 12:25-
def main():
n, k = map(int, input().split())
if n % k == 0:
return 0
else:
return 1
print(main())
|
p03835 | s009393966 | Wrong Answer | k,s=map(int,input().split(" "))
count=0
for i in range(k):
for j in range(k):
for k in range(k):
if i + j + k == s:
count += 1
print(count) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.