problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p03681 | s152386929 | Wrong Answer | from math import factorial as f
n, m = (int(i) for i in input().split())
if n == m:
print((f(n) * f(m) * 2) % (10 ^ 9 + 7))
elif abs(n - m) == 1:
print((f(n) * f(m)) % (10 ^ 9 + 7))
else:
print(0) |
p02948 | s401085285 | Accepted | import heapq
n,m=map(int,input().split())
ab=[[] for _ in range(m+1)]
for i in range(n):
a,b=map(int,input().split())
if a<=m:
ab[a].append(-b)
cand=[]
heapq.heapify(cand)
ans=0
for i in range(1,m+1):
for j in range(len(ab[i])):
heapq.heappush(cand,ab[i][j])
if len(cand)>0:
ans-=heapq.heappop(cand)... |
p03417 | s556585601 | Wrong Answer | import sys
N, M = list(map(int, input().split()))
if N == M == 1:
print(1)
elif N == 1 or M == 1:
print(max(max(N, M)-2, 0))
sys.exit()
N = max(0, N-2)
M = max(0, M-2)
print(N*M) |
p02576 | s973074265 | Accepted | import math
n, x, t = map(int, input().split())
print(math.ceil(n / x) * t) |
p03679 | s834832287 | Accepted | X, A, B = map(int, input().split())
if - A + B <= 0:
print('delicious')
elif - A + B <= X:
print('safe')
else:
print('dangerous') |
p02933 | s289802694 | Accepted | A = int(input())
S = input()
if A >= 3200:
print(S)
else:
print('red') |
p02718 | s084786875 | Accepted | n,m = map(int, input().split())
a = list(map(int,input().split()))
count = 0
for i in range(n):
if a[i] >= sum(a) / (4*m):
count += 1
if count >= m:
print('Yes')
else:
print('No') |
p02659 | s008820497 | Wrong Answer | A, B = map(float, input().split())
print(int(A*B))
|
p02767 | s321220155 | Accepted | import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
def input(): return sys.stdin.readline().rstrip()
def main():
N=int(input())
X=list(map(int,input().split()))
ans=INF
for i in range(1,101):
tmp=0
for n in X:
tmp+=(n-i)**2
ans=min(ans,tmp)
print(ans)... |
p02787 | s378062447 | Accepted | H, N = map(int, input().split())
AB=[]
for _ in range(N):
AB.append(list(map(int, input().split())))
Max_A = max(a for a, b in AB)
# print(Max_A)
dp = [10 ** 18] * (H + Max_A)
dp[0] = 0
for i in range(1, H + Max_A):
dp[i] = min(dp[i - a] + b for a, b in AB)
print(min(dp[H:]))
|
p03416 | s690883709 | Wrong Answer | A, B = map(str, input().split())
l = list(range(int(A), int(B)))
c = 0
for i in l:
t = str(i)
if t[0] == t[4] and t[1] == t[3]:
c += 1
print(c) |
p02706 | s760241784 | Wrong Answer | x, y = map(int,input().split())
arr = list(map(int, input().split()[:y]))
s = 0
for i in arr:
s += i
re = x - s
if re > 0:
print(re)
else:
print(-1) |
p02759 | s186878647 | Accepted | n = int(input())
if(n%2 == 0):print(int(n/2))
else:print(int(n/2)+1) |
p02829 | s644769427 | Accepted | a = int(input())
b = int(input())
print(6-a-b) |
p02866 | s163246854 | Accepted | n = int(input())
d = list(map(int, input().split()))
a = [0] * n
for i in range(n):
a[d[i]] += 1
if a[0] == 1 and d[0] == 0:
ans = 1
for i in range(1, n):
ans *= a[i-1]**a[i]
ans %= 998244353
print(ans)
else:
print(0) |
p02621 | s098508628 | Accepted | #!/usr/bin/env python3
a = int(input())
print(a + a**2 + a**3) |
p02608 | s850803691 | Accepted | n = int(input())
ans = [0] * (10**5)
for x in range(1,100):
for y in range(1,100):
for z in range(1,100):
ans[x**2 + y**2 + z**2 + x*y + y*z + z*x] += 1
for i in range(1,n+1):
print(ans[i])
|
p02658 | s678354413 | Wrong Answer |
_ = input()
N = [int(v) for v in input().split()]
s = 1
for n in N:
s *= n
if s > 10**18:
break
print(s if s <= 10**18 else -1) |
p02582 | s851236584 | Wrong Answer | st = input()
if st[0] == st[1] and st[0] == st[2] and st[0] == "R":
print(3)
elif (st[0] == st[1] and st[0] == "R") or (st[1] == st[2] and st[1] == "R"):
print(2)
else:
print(1)
|
p02787 | s124641959 | Accepted | H, N = map(int, input().split())
lst = []
ctr = 0
ans = [float("inf") for _ in range(H + 1)]
ans[0] = 0
for _ in range(N):
A, B = map(int, input().split())
lst.append([A, B])
lst.sort(key = lambda x : x[0])
for i in range(1, len(ans)):
for j in range(N):
ans[i] = min(ans[i], ans[i - min(i, lst[j][0])] + lst[j][... |
p02879 | s278298137 | Accepted | a, b = map(int, input().split())
if 9 >= a >= 1 and 9 >= b >= 1:
print(a * b)
else:
print(-1) |
p04033 | s010413184 | Wrong Answer | a, b = map(int, input().split())
if a <= 0 <= b:
print("Zero")
exit()
if a < 0 and b < 0:
print("Positive" if (b - a + 1) % 2 == 0 else "negative")
exit()
print("Positive") |
p03293 | s102205798 | Wrong Answer | import collections
S = input()
T = input()
s = collections.Counter(S)
t = collections.Counter(T)
if s == t:
print('Yes')
else:
print('No')
|
p03693 | s853085408 | Accepted | x = input()
y = x.split()
r = int(y[0])
g = int(y[1])
b = int(y[2])
A = 100*r+10*g+b
if A%4 == 0:
print('YES')
else:
print('NO') |
p02684 | s265559514 | Accepted | N,K = map(int,input().split())
A = list(map(lambda x:int(x)-1,input().split()))
F = [False]*N
L = []
cnt = 0
ans = -1
x = 0
first = -1
while 1:
if first==x:break
if cnt==K:
ans = x
break
if F[x]:
if first==-1:
first = x
L.append(x)
F[x]=True
cnt += 1
... |
p03146 | s479119657 | Wrong Answer | a=[int(input())]
for i in range(1000000):
n=a[i]
if n%2==0:
a.append(n/2)
else:
a.append(3*n+1)
if a[i+1]==4:
print(i+5)
break |
p02819 | s691219850 | Accepted | x=int(input())
i=0
while True:
for j in range(2,x+i+1):
if j==x+i:
print(j) #ans
quit()
break
elif (x+i)%j==0 and j!=1:
break
i+=1 |
p02594 | s666021567 | Wrong Answer | def switch(temp):
if temp>=30:
print("Yes")
else:
print("No") |
p03437 | s557929761 | Wrong Answer | x,y=map(int,input().split())
if (x*10)%y != 0:
print(x*10)
else:
print(-1) |
p03474 | s948158764 | Wrong Answer | a,b = map(int,input().split())
s = input()
lst = s.split("-")
#print(lst)
if len(lst[0]) == a and len(lst[1]) == b:
print("Yes")
else:
print("no") |
p03997 | s966374627 | Wrong Answer | a = int(input())
b = int(input())
h = int(input())
print((a + b) / 2 * h) |
p02756 | s815081169 | Accepted | s = input()
n = int(input())
t = ''
for i in range(n):
q = input().split()
if len(q) == 1:
t, s = s, t
elif len(q) == 3:
if q[1] == '1':
t += q[2]
elif q[1] == '2':
s += q[2]
t = t[::-1]
print(t + s) |
p02570 | s719931769 | Wrong Answer | D, T, S = input().split()
d = int(D)
t = int(T)
s = int(S)
if (d // s) > t:
print('No')
else:
print('Yes')
|
p03719 | s530013900 | Accepted | a,b,c = map(int, input().split())
if a <= c and c <= b:
print('Yes')
else:
print('No')
|
p02577 | s047454029 | Accepted | n = int(input())
result = sum(list(map(int, str(n))))
if result % 9 == 0:
print('Yes')
else:
print('No') |
p02957 | s206299782 | Accepted | A,B=map(int,input().split())
if A>B:
A,B=B,A
if (A+B)%2==0:
print((A+B)//2)
else:
print('IMPOSSIBLE')
|
p02717 | s588068348 | Wrong Answer | ans = list(map(int,input().split()))
print(ans[2],ans[1],ans[0])
|
p03774 | s881256941 | Accepted | def resolve():
n, m = map(int, input().split())
a, b = [-1]*n, [-1]*n
c, d = [-1]*m, [-1]*m
ans = []
for i in range(n):
a[i], b[i] = map(int, input().split())
for i in range(m):
c[i], d[i] = map(int, input().split())
for i in range(n):
low_i = -1
low_v = float('inf')
for j in range(m):
v = abs(a[i] ... |
p02833 | s406865819 | Wrong Answer | x=int(input())
s=0
if x%2==0:
p=10
while(p<x):
s+=x//p
p*=5
print(s) |
p03799 | s487852157 | Accepted | N,M = map(int,input().split())
if 2*N > M:
print(M//2)
else:
M -= 2*N
print(N+M//4) |
p03548 | s955427531 | Accepted | X,Y,Z = (int(T) for T in input().split())
print((X-Z)//(Y+Z)) |
p02606 | s538630380 | Accepted | L,R,d=map(int,input().split())
ans=0
for i in range(L,R+1):
if i%d==0:
ans+=1
print(ans) |
p02818 | s986358454 | Wrong Answer | A, B, K = map(int, input().split())
if A >= K:
print(str(A - K) + " " + str(B))
else:
print("0 " + str(B + A - K))
|
p02606 | s250944456 | Accepted | l,r,d=map(int,input().split())
ok=0
for i in range(l,r+1):
if i%d==0:
ok += 1
print(ok) |
p02688 | s827478658 | Wrong Answer | import numpy as np
N,K=(int(x) for x in input().split())
A=[]
l=[]
for i in range(K):
#d = int(input(''))
#for j in range(d):
#l_ = int(input(''))
#l.append(l_)
l=[int(x) for x in input().split()]
A.append(l)
a=np.zeros((N, K))
for i in range (len(A)):
for j in range(len(A[i])):
... |
p03000 | s200319718 | Accepted | n,x = map(int,input().split())
l = list(map(int,input().split()))
count = 1
x1 = 0
for i in range(n):
if x1 + l[i] <= x:
count += 1
x1 += l[i]
else:
print(count)
exit()
print(count)
|
p02576 | s255603214 | Accepted | a,b,c=map(int, input().split())
print(((a+b-1)//b)*c) |
p03076 | s169461795 | Accepted | x=[int(input()) for _ in range(5)]
rem=[]
for i in range(5):
if x[i]%10 != 0:
rem.append(10-x[i]%10)
else:
rem.append(0)
a=x[0] + rem[0]
b=x[1] + rem[1]
c=x[2] + rem[2]
d=x[3] + rem[3]
e=x[4] + rem[4]
print(a+b+c+d+e-max(rem[0],rem[1],rem[2],rem[3],rem[4])) |
p02988 | s859831000 | Accepted | n = int(input())
p = list(map(int, input().split()))
count = 0
for i in range(1, n-1):
if sorted([p[i-1], p[i], p[i+1]])[1] == p[i]:
count += 1
print(count)
|
p02947 | s737464164 | Accepted | # coding: utf-8
N = int(input())
ans = 0
d = {}
for i in range(N):
s = list(input())
s.sort()
s = "".join(s)
if s not in d.keys():
d[s] = 1
else:
d[s] += 1
# print(d)
for key in d.keys():
ans += d[key] * (d[key] - 1) // 2
print(ans) |
p03017 | s414552508 | Wrong Answer | n,a,b,c,d=map(int,input().split())
s="0"+input()
x=s[a:c+1]
y=s[b:d+1]
if "##" in s[a:c+1]:
print("No")
exit()
if "##" in s[b:d+1]:
print("No")
exit()
if c>d:
if not "..." in s[b-1:d]:
print("No")
exit()
print("Yes") |
p02982 | s165798442 | Accepted | n, d = map(int, input().split())
x = [list(map(int, input().split())) for i in range(n)]
ans = 0
for i in range(n-1):
for j in range(i+1, n):
count = 0
for y in range(d):
count += abs(x[i][y]-x[j][y])**2
if (count**0.5) % 1 == 0:
ans += 1
print(ans)
|
p03371 | s085980222 | Wrong Answer | a, b, c, x, y = [int(i) for i in input().split()]
ans = 10**18
for i in range(min(x, y)*2 + 1):
ans = min(ans, c * i*2 + (x - i//2) * a + (y - i//2) * b)
print(ans)
|
p03994 | s927497228 | Accepted | s = list(input())
k = int(input())
for i in range(len(s)):
if s[i] == "a":
continue
c = ord(s[i]) - ord("a")
if k >= (26 - c):
k -= 26 - c
s[i] = "a"
s[-1] = chr(((ord(s[-1]) - ord("a")) + k) % 26 + ord("a"))
print("".join(s))
|
p03416 | s237500387 | Accepted | A, B=map(int, input().split())
ans=0
for i in range(A,B+1):
tmps=str(i)
if tmps[0]==tmps[4] and tmps[1]==tmps[3]:
ans+=1
print(ans) |
p03013 | s275779215 | Wrong Answer | n,m=map(int,input().split())
a=[int(input()) for _ in range(m)]
dp=[0]*(n+1)
dp[0]=1
dp[1]=1
for i in range(1,n+1):
if i in a:
dp[i]=0
elif i in a and i+1 in a:
print(0)
exit()
else:
dp[i]=dp[i-2]+dp[i-1]
print(dp[n]%1000000007) |
p03274 | s810372180 | Accepted | import numpy as np
N, K = map(int, input().split())
X = np.array(list(map(int, input().split())))
arr = X[K - 1:] - X[:-K + 1]
arr1 = arr + np.abs(X[:-K + 1])
arr2 = arr + np.abs(X[K - 1:])
if len(arr) == 0:
print(0)
else:
ans = min(arr1.min(), arr2.min())
print(ans)
|
p02829 | s456511662 | Wrong Answer | A = input()
B = input()
if A == 1 and B == 2:
print 3
elif A == 2 and B == 3:
print 1
else:
print 2
|
p03944 | s998847943 | Accepted | W, H, N = map(int, input().split())
x1, x2, y1, y2 = 0, W, 0, H
for _ in range(N):
x, y, a = map(int, input().split())
if a == 1:
x1 = max(x1, x)
elif a == 2:
x2 = min(x2, x)
elif a == 3:
y1 = max(y1, y)
elif a == 4:
y2 = min(y2, y)
print(max(0, (y2 - y1)) * max(0, (... |
p02548 | s730865876 | Accepted | import math
n = int(input())
ans = 0
for i in range(1, n):
ans += math.floor((n-1) / i)
print(ans) |
p03695 | s028915947 | Wrong Answer | colorMaxIdx = 8
rates = [False] * colorMaxIdx
overRed = 0
N = int(input())
people = list(map(int, input().split()))
for i in people:
idx = i // 400
if idx >= 8:
overRed += 1
else:
rates[idx] = True
maxColorNum = rates.count(
True)+overRed if rates.count(True)+overRed <= 8 else 8
print(st... |
p02948 | s970905050 | Accepted | import sys
input = sys.stdin.readline
N, M = map(int, input().split())
AB = sorted([list(map(int, input().split())) for _ in range(N)], key=lambda x: x[1])[::-1]
plan = [i for i in range(M+1)]
ans = 0
for a, b in AB:
i = a
while i < (M + 1) and plan[i] != i:
plan[i] += 1
i = plan[i] -1
if i... |
p02833 | s382555646 | Accepted | n = int(input())
if n%2==1:
print(0)
else:
a = 0
x = n//2
while x//5>0:
x //= 5
a += x
print(a) |
p03061 | s184200612 | Wrong Answer | from math import gcd
from functools import reduce
N = int(input())
A = sorted(map(int, input().split(' ')))
base = reduce(gcd, A)
rest = 1
ans = A[0]
if ans == base:
ans = A[1]
rest -= 1
A = A[1:]
for a in A[1:]:
b = gcd(ans, a)
if b == base and rest > 0:
rest -= 1
else:
ans ... |
p03293 | s305612085 | Wrong Answer | s = input()
t = input()
for i in range(len(s)):
compstr = s[i:] + s[0:i]
if compstr == t:
print("yes", end="")
exit()
print("no", end="")
|
p02612 | s402101335 | Accepted | n=int(input())
res=0
cont=1
while n>0:
n=n-(1000*cont)
print(abs(n)) |
p02583 | s191677826 | Wrong Answer |
import itertools
N = input()
t = map(int,input().split())
cnt = 0
list = itertools.combinations(t,3)
for i in list:
if i[0]+i[1]>i[2] and i[1]+i[2]>i[0] and i[2]+i[0]>i[1] and i[0]!=i[1] and i[1]!=i[2] and i[2]!=i[0]:
cnt += 1
print(i)
print(cnt) |
p03633 | s291812749 | Wrong Answer | def main():
from builtins import int, map, list, print
from fractions import gcd
import sys
sys.setrecursionlimit(10 ** 6)
input = sys.stdin.readline
input_number = (lambda: int(input()))
N = input_number()
ans = 1
for i in range(N):
T = input_number()
ans = ans * T... |
p02897 | s481622941 | Accepted | N = int(input())
if N % 2 == 0 :
print(0.5)
else : print( (N+1)//2 /N) |
p03254 | s707356214 | Accepted | n,x = map(int,input().split())
a = list(map(int,input().split()))
a.sort()
ans = 0
for i in range(n):
if x >= a[i]:
ans += 1
x -= a[i]
if x > 0 and ans >= n:
ans -= 1
print(ans) |
p02818 | s249023139 | Accepted | def main():
a,b,k = map(int,input().split())
if a >= k:
a-=k
else:
b -= (k - a)
a = 0
if b < 0:
b = 0
print(str(a)+" "+str(b))
main() |
p03377 | s934288969 | Accepted | cat, cd, t = map(int, input().split())
f = False
if cat <= t and cd > 0 and cat + cd >= t:
f = True
print("YES") if f else print("NO") |
p02621 | s998433683 | Wrong Answer | a = int(input())
print(a + a * 2 + a ** 3) |
p03852 | s254118043 | Wrong Answer | s=input().replace("eraser","").replace("erase","").replace("dreamer","").replace("dream","")
if s:
print("NO")
else:
print("YES") |
p03625 | s118088565 | Wrong Answer | import collections
n=int(input())
a=list(map(int,input().split()))
c=collections.Counter(a)
x,y=0,0
b=list(set(a))[::-1]
for i in b:
if c[i]>3:
print(i**2)
exit()
elif c[i]>1:
y=i if x>0 and y==0 else y
x=i if x==0 else x
if x*y>0:
print(x*y)
exit()
print(x*y) |
p03617 | s400058706 | Accepted | q, h, s, d = map(int, input().split())
n = int(input())
cst1 = min(s,2*h, 4*q)
cst2 = min(d, 2*cst1)
print(n//2*cst2+n%2*cst1) |
p02724 | s698479648 | Wrong Answer | inp = int(input())
add = int(inp / 500) * 1000
add += ((inp % 100) % 5) * 5
print(add) |
p02693 | s501729478 | Accepted | k = int(input())
a,b = map(int,input().split())
if b//k-a//k > 0 or a%k == 0 or b%k == 0:
print('OK')
else:
print('NG') |
p02778 | s751332254 | Wrong Answer | print('*' * len(input())) |
p03254 | s755168520 | Accepted | n, x = map(int,input().split())
a = list(map(int,input().split()))
a = sorted(a)
count = 0
for i in a:
if x - i >= 0:
x -= i
count += 1
else:
break
if x != 0:
count -= 1 if count == n else 0
print(count) |
p02705 | s415615559 | Accepted | R = float(input())
print(2*3.14159*R) |
p02598 | s784012774 | Accepted | import sys
input = sys.stdin.readline
N, K = map(int, input().split())
A = list(map(int, input().split()))
lb, ub = 0, 10**9
while ub - lb > 1:
m = (lb + ub) // 2
cnt = 0
for i in range(N):
cnt += (A[i] + m - 1) // m - 1
if cnt <= K:
ub = m
else:
lb = m
print(ub) |
p03239 | s416455966 | Accepted | import sys
INPUT = lambda: sys.stdin.readline().rstrip()
MAP = lambda: map(int, INPUT().split())
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
def main():
N, T = MAP()
ans = INF
for i in range(N):
c, t = MAP()
if t <= T: ans = min(ans, c)
print("TLE" if ans == INF else ans)
i... |
p02795 | s723523124 | Accepted | import math
H = int(input())
W = int(input())
N = int(input())
print(math.ceil(N/max(H,W))) |
p02842 | s715440946 | Wrong Answer | # N=1079
N=int(input())
a=N*100/108
b=(N+1)*100/108
if a+1 <b:
print(int(round(a+0.5)))
else:
print(":(")
|
p03721 | s610110207 | Accepted | n,k = map(int,input().split())
l = [0]*(10**5+1)
for i in range(n):
ai,bi = map(int,input().split())
l[ai]+=bi
for index,i in enumerate(l):
if i:
k-=i
if k<=0:
break
print(index) |
p03524 | s203535397 | Wrong Answer | from collections import Counter
S = input()
d = Counter(S)
na = 0 if "a" not in d.keys() else d["a"]
nb = 0 if "b" not in d.keys() else d["b"]
nc = 0 if "c" not in d.keys() else d["c"]
if abs(na - nb) <= 1 and abs(nc - na) <= 1 and abs(nb - nc) <= 1:
print("Yes")
else:
print("No")
|
p03633 | s720397528 | Accepted | import math
n = int(input())
t = list(int(input()) for i in range(n))
s = t[0]
for i in range(1,n):
s = s * t[i] // math.gcd(s,t[i])
print(s) |
p03681 | s402836322 | Accepted | def factorial(n):
ans = 1
for i in range(2, n + 1):
ans = ans * i % 1000000007
return ans
N, M = map(int, input().split())
MAD = 10**9+7
if abs(N-M) >= 2:
print(0)
elif N == M:
print((2*factorial(N)*factorial(M)) % MAD)
else:
print((factorial(N)*factorial(M)) % MAD)
|
p03672 | s102933141 | Accepted | s = input()
ans = 0
for i in range(1,len(s)):
x = s[:-i]
if len(x)%2 == 0:
if x[:len(x)//2] == x[len(x)//2:]:
ans = len(x)
print (ans)
exit()
|
p03360 | s553191481 | Wrong Answer | data = list(map(int, input().split()))
k = int(input())
if k == 1:
print( sum(data) + max(data) ** k )
else:
print( sum(data) + max(data) ** k - max(data) )
|
p02924 | s182406473 | Accepted | n = int(input())-1
print(n*(n+1)//2) |
p02665 | s499294448 | Accepted | import sys
msg = sys.stdin.readlines()
n = int(msg[0])
a = list(map(int,msg[1].split()))
tot = 0
b = [0 for i in range(n+1)]
for i in range(n+1):
b[i] = (1<<i)-2*tot;
tot = 2*tot+a[i];
if tot > (1<<i):
print(-1)
exit(0)
nb = 0
crt = 0;
for i in range(n,-1,-1):
crt = min(crt+a[i],b[i])
nb += crt;
print... |
p02819 | s322621669 | Accepted | x = int(input()) # 素数
ans = -1
if x == 2: ans = 2
for i in range(x, x+10**5+1):
f = True
for j in range(2, int(x**0.5)):
if i%j==0:
f = False
break
if f:
ans = i
break
print(ans) |
p02645 | s034795796 | Accepted | print(input()[:3]) |
p03017 | s500046025 | Accepted | N, A, B, C, D = map(int, input().split())
S = str(input())
if C < D:
if '##' in S[min(A, B):D]:
print('No')
else:
print('Yes')
elif C > D:
if '##' in S[min(A, B):C]:
print('No')
else:
# ここの添字は図を書いて理解してください
if '...' in S[B - 2:D + 1]:
print('Yes')
... |
p03457 | s607823314 | Accepted | N = int(input())
travels = [[0, 0, 0]]
travels += [list(map(int, input().split())) for _ in range(N)]
flag = True
for i in range(N):
cnt = 0
cnt += abs(travels[i+1][1] - travels[i][1])
cnt += abs(travels[i+1][2] - travels[i][2])
time = travels[i+1][0] - travels[i][0]
if time < cnt or (time-cnt) % 2 ... |
p03146 | s402406376 | Accepted | s = int(input())
ans = [s]
while True:
if s%2 ==0:
s = s//2
else:
s = 3*s + 1
if s in ans:
break
else:
ans.append(s)
print(len(ans)+1) |
p02761 | s081409269 | Accepted | n, m = map(int, input().split())
sc = [tuple(map(int, input().split())) for j in range(m)]
for i in range(10**n):
if len(str(i)) == n and all(str(i)[s - 1] == str(c) for s, c in sc):
print(i)
break
else:
print(-1) |
p03854 | s236476538 | Accepted | s = input()[::-1]
n = len(s)
l = 0
ok = True
while l <n:
ok_list = ["maerd","remaerd","resare","esare"]
if s[l:l+5] in ok_list:
l +=5
elif s[l:l+6] in ok_list:
l+=6
elif s[l:l+7] in ok_list:
l+=7
else:
ok = False
break
if ok:print('YES')
else:print('NO')
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.