s_id stringlengths 10 10 | p_id stringlengths 6 6 | u_id stringlengths 10 10 | date stringlengths 10 10 | language stringclasses 1
value | original_language stringclasses 11
values | filename_ext stringclasses 1
value | status stringclasses 1
value | cpu_time stringlengths 1 5 | memory stringlengths 1 7 | code_size stringlengths 1 6 | code stringlengths 1 539k |
|---|---|---|---|---|---|---|---|---|---|---|---|
s317648417 | p03490 | u316879128 | 1514145138 | Python | Python (2.7.6) | py | Runtime Error | 11 | 2568 | 304 | string = raw_input()
x_,y_ = map(int, raw_input().split())
face = 0
for c in string:
if c == "F":
if face == 0:
x += 1
elif face == 1:
y += 1
elif face == 2:
x -= 1
elif face == 3:
y -= 1
elif c == "T":
face = (face + 1)%4
if x == x_ and y == y_:
print "YES"
else:
print "NO" |
s504046568 | p03490 | u651663683 | 1513901037 | Python | Python (3.4.3) | py | Runtime Error | 180 | 31320 | 511 | inp=list(map(len,input().split("T")))
inx,iny=list(map(int,input().split()))
memo={}
def tg(g,n,t):
g.sort()
g.reverse()
def tn(g,n,t):
if (tuple(g),n,t) in memo:
return memo[(tuple(g),n,t)]
if g==[]:
if n==t:
return True
else:
return False
if n<t:
z=tn(g[1:],n+g[0],t)
memo[(tuple(g),n,t... |
s705165010 | p03490 | u651663683 | 1513898810 | Python | Python (3.4.3) | py | Runtime Error | 2121 | 296780 | 444 | inp=list(map(len,input().split("T")))
inx,iny=list(map(int,input().split()))
memo={}
def tg(g,n,t):
if (tuple(g),n,t) in memo:
return memo[(tuple(g),n,t)]
if g==[]:
if n==t:
return True
else:
return False
if tg(g[1:],n+g[0],t)or tg(g[1:],n-g[0],t):
memo[(tuple(g),n,t)]=True
return True
else:
memo[... |
s616768729 | p03490 | u651663683 | 1513898488 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3188 | 355 | inp=list(map(len,input().split("T")))
inx,iny=list(map(int,input().split()))
memo={}
def tg(g,n,t):
if (g,n,t) in memo:
return memo[(g,n,t)]
if tg(g[1:],n+g[0],t)or tg(g[1:],n-g[0],t):
memo[(g,n,t)]=True
return True
else:
memo[(g,n,t)]=False
return False
if tg(inp[1::2],0,iny)and tg(inp[2::2],inp[0],inx):... |
s204335103 | p03490 | u268210555 | 1513539291 | Python | PyPy2 (5.6.0) | py | Runtime Error | 36 | 28396 | 314 | def f(m, s, g):
v, t = {s}, set()
for i in m:
for j in v:
t.update((j+i, j-i))
v, t = t, set()
return g in v
s = input()
x, y = map(int, input().split())
m = list(map(len, s.split('T')))
if f(m[::2][1::], m[0], x) and f(m[1::2], 0, y):
print('Yes')
else:
print('No') |
s713483866 | p03490 | u160414758 | 1513496843 | Python | Python (3.4.3) | py | Runtime Error | 2135 | 505580 | 1183 | import sys,collections
sys.setrecursionlimit(10**7)
def Is(): return [int(x) for x in sys.stdin.readline().split()]
def S(): return input()
s = S()
gx,gy = Is()
xlis,ylis = [],[]
x,y = 0,0
h = 0
for e in s:
if e == "F":
if h == 0:
x += 1
else:
y += 1
else:
if h... |
s358017893 | p03490 | u160414758 | 1513496742 | Python | Python (3.4.3) | py | Runtime Error | 1335 | 503916 | 1179 | import sys,collections
sys.setrecursionlimit(10**7)
def Is(): return [int(x) for x in sys.stdin.readline().split()]
def S(): return input()
s = S()
gx,gy = Is()
xlis,ylis = [],[]
x,y = 0,0
h = 0
for e in s:
if e == "F":
if h == 0:
x += 1
else:
y += 1
else:
if h... |
s237369051 | p03490 | u667084803 | 1513482051 | Python | PyPy3 (2.4.0) | py | Runtime Error | 1032 | 282888 | 1250 | S=str(input())
S=S[:len(S)-1]
s=list(S)
x,y=map(int,input().split())
fora=0
side=[]
updw=[]
while s[0]=="F":
fora+=1
s.pop(0)
if len(s)==0:break
flag=1#1のとき横向き、-1のときたて向き
step=0
while s:
if s[0]=="T":
s.pop(0)
if step:
if flag==-1: updw+=[step]
else: side+=[step]
flag=flag*(-1)
step=0... |
s957836330 | p03490 | u667084803 | 1513481978 | Python | Python (3.4.3) | py | Runtime Error | 2119 | 243828 | 1235 | S=str(input())
s=list(S)
x,y=map(int,input().split())
fora=0
side=[]
updw=[]
while s[0]=="F":
fora+=1
s.pop(0)
if len(s)==0:break
flag=1#1のとき横向き、-1のときたて向き
step=0
while s:
if s[0]=="T":
s.pop(0)
if step:
if flag==-1: updw+=[step]
else: side+=[step]
flag=flag*(-1)
step=0
else:
s.... |
s314394599 | p03490 | u667084803 | 1513481813 | Python | PyPy3 (2.4.0) | py | Runtime Error | 1028 | 283016 | 1214 | S=str(input())
s=list(S)
x,y=map(int,input().split())
fora=0
side=[]
updw=[]
while s[0]=="F":
fora+=1
s.pop(0)
flag=1#1のとき横向き、-1のときたて向き
step=0
while s:
if s[0]=="T":
s.pop(0)
if step:
if flag==-1: updw+=[step]
else: side+=[step]
flag=flag*(-1)
step=0
else:
s.pop(0)
step+=1
... |
s862359115 | p03490 | u667084803 | 1513481652 | Python | PyPy3 (2.4.0) | py | Runtime Error | 1982 | 589832 | 1239 | S=str(input())
s=list(S)
x,y=map(int,input().split())
fora=0
side=[]
updw=[]
while s[0]=="F":
fora+=1
s.pop(0)
flag=1#1のとき横向き、-1のときたて向き
step=0
while s:
if s[0]=="T":
s.pop(0)
if step:
if flag==-1: updw+=[step]
else: side+=[step]
flag=flag*(-1)
step=0
else:
s.pop(0)
step+=1
... |
s585442254 | p03490 | u667084803 | 1513481361 | Python | Python (3.4.3) | py | Runtime Error | 2121 | 270068 | 1237 | S=input()
S=S[:len(S)-1]
s=list(S)
x,y=map(int,input().split())
fora=0
side=[]
updw=[]
while s[0]=="F":
fora+=1
s.pop(0)
if len(s)==0: break
flag=1#1のとき横向き、-1のときたて向き
step=0
while s:
if s[0]=="T":
s.pop(0)
if flag==-1: updw+=[step]
else: side+=[step]
flag=flag*(-1)
step=0
else:
s.pop(0)... |
s292220515 | p03490 | u667084803 | 1513481095 | Python | PyPy3 (2.4.0) | py | Runtime Error | 737 | 173192 | 1233 | S=input()
S=S[:len(S)-1]
s=list(S)
x,y=map(int,input().split())
fora=0
side=[]
updw=[]
while s[0]=="F":
fora+=1
s.pop(0)
if len(s)==0: break
flag=1#1のとき横向き、-1のときたて向き
step=0
while s:
if s[0]=="T":
s.pop(0)
if flag==-1: updw+=[step]
else: side+=[step]
flag=flag*(-1)
step=0
else:
s.pop(0)... |
s521171629 | p03490 | u667084803 | 1513480847 | Python | PyPy3 (2.4.0) | py | Runtime Error | 2151 | 773896 | 1232 | S=input()
S=S[:len(S)-1]
s=list(S)
x,y=map(int,input().split())
fora=0
side=[]
updw=[]
while s[0]=="F":
fora+=1
s.pop(0)
flag=1#1のとき横向き、-1のときたて向き
step=0
while s:
if s[0]=="T":
s.pop(0)
if flag==-1: updw+=[step]
else: side+=[step]
flag=flag*(-1)
step=0
else:
s.pop(0)
step+=1
if le... |
s913028805 | p03490 | u667084803 | 1513480520 | Python | PyPy3 (2.4.0) | py | Runtime Error | 2151 | 774280 | 1222 | S=str(input())
s=list(S)
x,y=map(int,input().split())
fora=0
side=[]
updw=[]
while s[0]=="F":
fora+=1
s.pop(0)
flag=1#1のとき横向き、-1のときたて向き
step=0
while s:
if s[0]=="T":
s.pop(0)
if flag==-1: updw+=[step]
else: side+=[step]
flag=flag*(-1)
step=0
else:
s.pop(0)
step+=1
if len(s)==0:
... |
s039553880 | p03490 | u667084803 | 1513480167 | Python | Python (3.4.3) | py | Runtime Error | 2130 | 440696 | 1253 | import sys
S=str(input())
s=list(S)
x,y=map(int,input().split())
fora=0
side=[]
updw=[]
side_p=[]
updw_p=[]
while s[0]=="F":
fora+=1
s.pop(0)
flag=1#1のとき横向き、-1のときたて向き
step=0
while s:
if s[0]=="T":
s.pop(0)
if flag==-1: updw+=[step]
else: side+=[step]
flag=flag*(-1)
step=0
else:
s.pop(0)
... |
s252314969 | p03490 | u893209854 | 1513480027 | Python | PyPy3 (2.4.0) | py | Runtime Error | 344 | 100848 | 619 | s = input().strip()
gx, gy = map(int, (input().split()))
flag = False
def dd(x, y, d, s):
global flag
if len(s) == 0:
if x == gx and y == gy:
flag = True
else:
if s[0] == 'F':
if d == 0:
dd(x+1, y, d, s[1:])
elif d == 1:
d... |
s998017691 | p03490 | u803848678 | 1513479936 | Python | Python (3.4.3) | py | Runtime Error | 2104 | 4668 | 1566 | import copy
s = input()
X, Y = list(map(int, input().split()))
#少なくとも、右にx,↑にy進まなきゃいけない
# Fはくっつけられる
# s < 8000 よって N^2くらいならok
# Tが1回→左右 2回→前か後ろ 3回→左右
# この性質から、左右は左右のみで考えればいい
# x方向の数字N個をつかって、xを作成する 足し引きのみ 2^N xを加えて0にできるかどうか
s += "T"
now = 1
# 1はx方向、-1はy方向とする
start = 0
go = 0
x = []
y = []
for i in s:
if i == "T":... |
s702224418 | p03490 | u057916330 | 1513479899 | Python | Python (3.4.3) | py | Runtime Error | 2116 | 138632 | 1472 | s = input()
x, y = map(int, input().split())
move = s.split('T')
yoko, tate = [], []
for i in range(len(move)):
if i % 2 == 0:
yoko.append(len(move[i]))
else:
tate.append(len(move[i]))
class DFS:
def __init__(self, arr, start, goal):
self.arr = arr
self.start = start
... |
s167862524 | p03490 | u482770395 | 1513479650 | Python | Python (3.4.3) | py | Runtime Error | 2104 | 4084 | 1059 | S_ = input()
S = []
for i in S_:
S.append(i)
S.append("T")
x, y = map(int, input().split())
x_array = []
y_array = []
isX = True
cnt = 0
def x_canArrive(rob_x, i):
if i == len(x_array):
if rob_x == x:
return True
else:
return False
else:
if x_canArrive(rob_x ... |
s623244045 | p03490 | u057916330 | 1513479032 | Python | Python (3.4.3) | py | Runtime Error | 2112 | 138824 | 1268 | s = input()
x, y = map(int, input().split())
move = s.split('T')
yoko, tate = [], []
for i in range(len(move)):
if i % 2 == 0:
yoko.append(len(move[i]))
else:
tate.append(len(move[i]))
class DFS:
def __init__(self, arr, goal):
self.arr = arr
self.goal = goal
self.m... |
s678389631 | p03490 | u803848678 | 1513478928 | Python | Python (3.4.3) | py | Runtime Error | 2104 | 4664 | 1481 | import copy
s = input()
X, Y = list(map(int, input().split()))
#少なくとも、右にx,↑にy進まなきゃいけない
# Fはくっつけられる
# s < 8000 よって N^2くらいならok
# Tが1回→左右 2回→前か後ろ 3回→左右
# この性質から、左右は左右のみで考えればいい
# x方向の数字N個をつかって、xを作成する 足し引きのみ 2^N xを加えて0にできるかどうか
s += "T"
now = 1
# 1はx方向、-1はy方向とする
start = 0
go = 0
x = []
y = []
for i in s:
if i == "T":... |
s480033401 | p03490 | u803848678 | 1513478831 | Python | Python (3.4.3) | py | Runtime Error | 2104 | 4668 | 1474 | import copy
s = input()
X, Y = list(map(int, input().split()))
#少なくとも、右にx,↑にy進まなきゃいけない
# Fはくっつけられる
# s < 8000 よって N^2くらいならok
# Tが1回→左右 2回→前か後ろ 3回→左右
# この性質から、左右は左右のみで考えればいい
# x方向の数字N個をつかって、xを作成する 足し引きのみ 2^N xを加えて0にできるかどうか
s += "T"
now = 1
# 1はx方向、-1はy方向とする
start = 0
go = 0
x = []
y = []
for i in s:
if i == "T":... |
s195792756 | p03490 | u803848678 | 1513478793 | Python | Python (3.4.3) | py | Runtime Error | 2104 | 4664 | 1470 | import copy
s = input()
X, Y = list(map(int, input().split()))
#少なくとも、右にx,↑にy進まなきゃいけない
# Fはくっつけられる
# s < 8000 よって N^2くらいならok
# Tが1回→左右 2回→前か後ろ 3回→左右
# この性質から、左右は左右のみで考えればいい
# x方向の数字N個をつかって、xを作成する 足し引きのみ 2^N xを加えて0にできるかどうか
s += "T"
now = 1
# 1はx方向、-1はy方向とする
start = 0
go = 0
x = []
y = []
for i in s:
if i == "T":... |
s385531456 | p03490 | u803848678 | 1513478334 | Python | Python (3.4.3) | py | Runtime Error | 2104 | 4668 | 1337 | import copy
s = input()
X, Y = list(map(int, input().split()))
#少なくとも、右にx,↑にy進まなきゃいけない
# Fはくっつけられる
# s < 8000 よって N^2くらいならok
# Tが1回→左右 2回→前か後ろ 3回→左右
# この性質から、左右は左右のみで考えればいい
# x方向の数字N個をつかって、xを作成する 足し引きのみ 2^N xを加えて0にできるかどうか
s += "T"
now = 1
# 1はx方向、-1はy方向とする
go = 0
x = []
y = []
for i in s:
if i == "T":
i... |
s292055391 | p03490 | u039623862 | 1513478173 | Python | Python (3.4.3) | py | Runtime Error | 41 | 4212 | 876 | s = [len(x) for x in input().split('T')]
x, y = map(int, input().split())
len_s = len(s)
sx = [s[i] for i in range(len_s) if i % 2 == 0]
sy = [s[i] for i in range(len_s) if i % 2 == 1]
x -= sx[0]
sx = sx[1:]
def is_reachable(p, s):
origin = 8
if origin+p < 0:
return False
n = len(s)
... |
s768689406 | p03490 | u057916330 | 1513478121 | Python | Python (3.4.3) | py | Runtime Error | 2104 | 4188 | 891 | s = input()
x, y = map(int, input().split())
move = s.split('T')
yoko, tate = [], []
for i in range(len(move)):
if i % 2 == 0:
yoko.append(len(move[i]))
else:
tate.append(len(move[i]))
class DFS:
def __init__(self, arr, goal):
self.arr = arr
self.goal = goal
# self... |
s110402759 | p03490 | u692632484 | 1513478108 | Python | Python (3.4.3) | py | Runtime Error | 42 | 4724 | 1214 | s=input()+"T"
x,y=[int(i) for i in input().split()]
dx=[]
dy=[]
dir_is_X=True
step=0
for char in s:
if char=='F':
step+=1
else:
if dir_is_X:
dx.append(step)
dir_is_X=False
step=0
el... |
s411028205 | p03490 | u803848678 | 1513478007 | Python | Python (3.4.3) | py | Runtime Error | 2104 | 4672 | 1765 | import copy
s = input()
X, Y = list(map(int, input().split()))
#少なくとも、右にx,↑にy進まなきゃいけない
# Fはくっつけられる
# s < 8000 よって N^2くらいならok
# Tが1回→左右 2回→前か後ろ 3回→左右
# この性質から、左右は左右のみで考えればいい
# x方向の数字N個をつかって、xを作成する 足し引きのみ 2^N xを加えて0にできるかどうか
s += "T"
now = 1
# 1はx方向、-1はy方向とする
go = 0
x = []
y = []
for i in s:
if i == "T":
i... |
s387747025 | p03490 | u667084803 | 1513477987 | Python | Python (3.4.3) | py | Runtime Error | 2104 | 3188 | 854 | import sys
s=str(input())
s=list(s)
x,y=map(int,input().split())
fora=0
side=[]
updw=[]
while s[0]=="F":
fora+=1
s.pop(0)
flag=1#1のとき横向き、-1のときたて向き
step=0
while s:
if s[0]=="T":
s.pop(0)
if flag==-1: updw+=[step]
else: side+=[step]
flag=flag*(-1)
step=0
else:
s.pop(0)
if len(s)==0:
... |
s162547602 | p03490 | u039623862 | 1513477731 | Python | Python (3.4.3) | py | Runtime Error | 2131 | 444404 | 795 | s = [len(x) for x in input().split('T')]
x, y = map(int, input().split())
len_s = len(s)
sx = [s[i] for i in range(len_s) if i%2 == 0]
sy = [s[i] for i in range(len_s) if i%2 == 1]
x -= sx[0]
sx = sx[1:]
def is_reachable(p, s):
origin = 8000
n = len(s)
reachable = [[False for _ in range(origin*2+1)] for i... |
s976643571 | p03490 | u039623862 | 1513477679 | Python | Python (3.4.3) | py | Runtime Error | 42 | 4212 | 792 | s = [len(x) for x in input().split('T')]
x, y = map(int, input().split())
len_s = len(s)
sx = [s[i] for i in range(len_s) if i%2 == 0]
sy = [s[i] for i in range(len_s) if i%2 == 1]
x -= sx[0]
sx = sx[1:]
def is_reachable(p, s):
origin = 8
n = len(s)
reachable = [[False for _ in range(origin*2+1)] for i in... |
s966196401 | p03490 | u057916330 | 1513477482 | Python | Python (3.4.3) | py | Runtime Error | 2104 | 4188 | 619 | s = input()
x, y = map(int, input().split())
move = s.split('T')
yoko, tate = [], []
for i in range(len(move)):
if i % 2 == 0:
yoko.append(len(move[i]))
else:
tate.append(len(move[i]))
def dfs(i, arr, pos, goal):
if i == len(arr):
return pos == goal
ret1 = dfs(i + 1, arr, pos ... |
s113144147 | p03491 | u368780724 | 1577847128 | Python | PyPy3 (2.4.0) | py | Runtime Error | 185 | 44636 | 984 | import sys
readline = sys.stdin.readline
class Node:
def __init__(self, sigma, depth):
self.end = False
self.child = [None] * sigma
self.depth = depth
def __setitem__(self, i, x):
self.child[i] = x
def __getitem__(self, i):
return self.child[i]
class Trie():
def... |
s900602390 | p03491 | u368780724 | 1577842801 | Python | PyPy3 (2.4.0) | py | Runtime Error | 168 | 38384 | 727 | import sys
readline = sys.stdin.readline
N, L = map(int, readline().split())
node = set([1])
for _ in range(N):
S = list(map(int, readline().strip()))
ls = len(S)
pre = 1
for s in S:
vn = 2*pre + s
... |
s458976358 | p03491 | u892251744 | 1577775322 | Python | PyPy3 (2.4.0) | py | Runtime Error | 671 | 135900 | 2164 | def main():
import sys
from collections import defaultdict
input = sys.stdin.readline
mod = 10**10+7
mod2 = 10**10+9
mod3 = 998244353
N, L = map(int, input().split())
dic = defaultdict(int)
dic2 = defaultdict(int)
dic3 = defaultdict(int)
h_list = []
h2_list = []
h3_l... |
s713517676 | p03491 | u892251744 | 1577774554 | Python | PyPy3 (2.4.0) | py | Runtime Error | 458 | 80724 | 2162 | def main():
import sys
from collections import defaultdict
input = sys.stdin.readline
mod = 10**9+7
mod2 = 10**9+9
mod3 = 998244353
N, L = map(int, input().split())
dic = defaultdict(int)
dic2 = defaultdict(int)
dic3 = defaultdict(int)
h_list = []
h2_list = []
h3_lis... |
s402418885 | p03491 | u892251744 | 1577767212 | Python | PyPy3 (2.4.0) | py | Runtime Error | 683 | 191068 | 743 | def main():
import sys
from collections import defaultdict
input = sys.stdin.readline
N, L = map(int, input().split())
dic = defaultdict(int)
for _ in range(N):
s = input().rstrip('\n')
for i in range(len(s)):
print(s)
dic[s[:i+1]] = 1
g = 0
key ... |
s479683900 | p03491 | u102461423 | 1563204849 | Python | Python (3.4.3) | py | Runtime Error | 101 | 7028 | 1188 | import sys
input = sys.stdin.readline
from collections import deque
N,M = map(int,input().split())
words = [deque(input().rstrip()) for _ in range(N)]
# 深さLのfull treeの小さい方を計算してみる
def G_small():
G = [0] * 100
G_cum = [0] * 100
G[0] = 1
G_cum[0] = 1
for n in range(1,100):
can_make = set(G_cu... |
s846754209 | p03491 | u343675824 | 1517654357 | Python | Python (3.4.3) | py | Runtime Error | 331 | 53692 | 806 | N, L = map(int, input().split())
class Node:
def __init__(self, depth=0):
self.parent = None
self.children = {}
self.depth = depth
def add(self, n):
self.children[n] = Node(self.depth+1)
def has(self, n):
return n in self.children
t = Node()
for i in range(N):
s ... |
s382143771 | p03491 | u225528554 | 1513743557 | Python | Python (3.4.3) | py | Runtime Error | 1876 | 134780 | 1434 | def main():
N,L = map(int,input().split())
if N==1:
print("Alice")
exit()
keys = []
count = 0
for i in range(N):
s = input()
#merge node:
while len(s)>0:
if s[-1]=='1' and s[:-1]+'0' in keys:
keys.remove(s[:-1]+'0')
... |
s563080492 | p03491 | u315078622 | 1513584456 | Python | Python (3.4.3) | py | Runtime Error | 313 | 50448 | 1387 | class TrieNode:
def __init__(self, char):
self.char = char
self.nextnode = dict()
self.is_indict = False
class Trie:
def __init__(self, charset):
self.charset = charset
self.root = TrieNode('')
def add(self, a_str):
node = self.root
for i, char in e... |
s308220379 | p03491 | u340781749 | 1513555354 | Python | Python (3.4.3) | py | Runtime Error | 374 | 127692 | 536 | import sys
sys.setrecursionlimit(100000)
def dfs(cur, dep=0):
if cur == -1:
x = l - dep
return x & -x
return dfs(trie[cur][0], dep + 1) ^ dfs(trie[cur][1], dep + 1)
n, l = map(int, input().split())
trie = [[-1, -1] for _ in range(100001)]
idx = 1
for s in (input() for _ in range(n)):
cu... |
s487422927 | p03491 | u340781749 | 1513554347 | Python | Python (3.4.3) | py | Runtime Error | 403 | 127692 | 536 | import sys
sys.setrecursionlimit(100000)
def dfs(cur, dep=0):
if cur == -1:
x = l - dep
return x & -x
return dfs(trie[cur][0], dep + 1) ^ dfs(trie[cur][1], dep + 1)
n, l = map(int, input().split())
trie = [[-1, -1] for _ in range(100001)]
idx = 1
for s in (input() for _ in range(n)):
cu... |
s139749652 | p03493 | u227777103 | 1601497271 | Python | Python (3.8.2) | py | Runtime Error | 28 | 9144 | 110 | num_list = list(map(int, input().split()))
count = 0
for i in range(3):
count += num_list[i]
print(count)
|
s048305878 | p03493 | u179411549 | 1601473437 | Python | PyPy3 (7.3.0) | py | Runtime Error | 88 | 68700 | 29 | s = input()
print(s.count(1)) |
s162689388 | p03493 | u667694979 | 1601438063 | Python | Python (3.8.2) | py | Runtime Error | 26 | 9076 | 135 | N=int(input())
A=list(map(int,input().split()))
count=0
while all(a%2==0 for a in A):
A=[a//2 for a in A]
count+=1
print(count) |
s752374637 | p03493 | u843482581 | 1600740177 | Python | Python (3.8.2) | py | Runtime Error | 25 | 9004 | 125 | s = map(input())
count = 0
if s[0] == '1':
count += 1
if s[1] == '1':
count +=1
if s[2] == '1':
count += 1
print(count) |
s778275895 | p03493 | u140839783 | 1600546296 | Python | Python (3.8.2) | py | Runtime Error | 19 | 9120 | 140 | s = input()
a, b, c = int(s[0]),int(s[1]),int(s[2])
count = 0
if a == 1:
count+=1
if b == 1:
count+=1
if C == 1:
count+=1
print(count) |
s033660446 | p03493 | u552719748 | 1600399422 | Python | Python (3.8.2) | py | Runtime Error | 21 | 9116 | 304 | num = int(input())
nu_list = [int(v) for v in input().split()]
count = 0
#print(nu_list)
bool = True
while bool == True:
for i in range(len(nu_list)):
if nu_list[i] % 2 != 0:
bool = False
break
else:
nu_list[i] = nu_list[i] // 2
if bool == True:
count += 1
print(count) |
s720271760 | p03493 | u968762428 | 1600386928 | Python | Python (3.8.2) | py | Runtime Error | 23 | 8976 | 61 | a,b,c = (int(x) for x in input() . split())
print(a + b + c) |
s552152856 | p03493 | u022745965 | 1600264040 | Python | Python (3.8.2) | py | Runtime Error | 22 | 9116 | 323 | n = int(input())
a = list(map(int, input().split()))
count = 0
exist_odd = False
while exist_odd == False:
for i in range(n):
if a[i] % 2 != 0:
exist_odd = True
if n != i:
count -= 1
break
else:
a[i] = a[i] / 2
count += 1
print(cou... |
s766740836 | p03493 | u022745965 | 1600263921 | Python | Python (3.8.2) | py | Runtime Error | 24 | 9088 | 322 | n = int(input())
a = list(map(int,input().split()))
count = 0
exist_odd = False
while exist_odd == False:
for i in range(n):
if a[i] % 2 != 0:
exist_odd = True
if n != i:
count -= 1
break
else:
a[i] = a[i] / 2
count += 1
print(coun... |
s174189149 | p03493 | u022745965 | 1600263378 | Python | Python (3.8.2) | py | Runtime Error | 23 | 9124 | 497 | n = int(input())
a = list(map(int, input().split()))
count = 0
# list a[i]が偶数かどうかをチェック。ループはとりあえず省略する
exist_odd = False
# in_if = 0
# in_for = 0
# in_while = 0
while exist_odd == False:
for i in range(n):
if a[i] % 2 != 0:
exist_odd = True
if n != i:
count -= 1
... |
s244416516 | p03493 | u006782785 | 1600035860 | Python | Python (3.8.2) | py | Runtime Error | 26 | 9084 | 47 | a,b,c = map(int,input().split())
print(a+b+c)
|
s148061527 | p03493 | u963963908 | 1600034821 | Python | Python (3.8.2) | py | Runtime Error | 31 | 9028 | 151 | def d(n):
while n%2 == 0:
n /= 2
ans += 1
return ans
n = int(input())
a = map(int,input().split())
t = min(list(map(d,a)))
print(t)
|
s760612170 | p03493 | u963963908 | 1600034736 | Python | Python (3.8.2) | py | Runtime Error | 21 | 9084 | 155 | def d(n):
while n%2 == 0:
n /= 2
ans += 1
return ans
n = int(input())
a = map(int,input().split())
ans = min(list(map(d,a)))
print(ans)
|
s856226898 | p03493 | u963963908 | 1600032469 | Python | Python (3.8.2) | py | Runtime Error | 27 | 8928 | 92 | n = input()
def sum(n):
s = str(n)
a = list(map(int, s))
return sum(a)
print(sum(n))
|
s211761942 | p03493 | u963963908 | 1600031937 | Python | Python (3.8.2) | py | Runtime Error | 26 | 8976 | 37 | a,b,c = map(int.input())
print(a+b+c) |
s394418799 | p03493 | u300651214 | 1600010904 | Python | Python (3.8.2) | py | Runtime Error | 23 | 9012 | 31 | a = input()
print(a.count('1')
|
s905701558 | p03493 | u300651214 | 1600010877 | Python | Python (3.8.2) | py | Runtime Error | 23 | 8920 | 37 | a = list(input())
print(a.count('1')
|
s640620830 | p03493 | u847033024 | 1600002304 | Python | Python (3.8.2) | py | Runtime Error | 19 | 9008 | 29 | a = input()
print(a.count(1)) |
s680140266 | p03493 | u382209062 | 1599941736 | Python | Python (3.8.2) | py | Runtime Error | 24 | 9100 | 156 | N, K = map(int, input().split())
*A, = map(int, input().split())
d = [0]*(N+1)
for a in A:
d[a] += 1
d.sort()
d.reverse()
print(sum(d[K:]))
|
s551974600 | p03493 | u382209062 | 1599941285 | Python | PyPy3 (7.3.0) | py | Runtime Error | 102 | 74752 | 156 | N, K = map(int, input().split())
*A, = map(int, input().split())
d = [0]*(N+1)
for a in A:
d[a] += 1
d.sort()
d.reverse()
print(sum(d[K:]))
|
s788101236 | p03493 | u382209062 | 1599941084 | Python | PyPy3 (7.3.0) | py | Runtime Error | 137 | 74008 | 153 | N, K = map(int, input().split())
*A, = map(int, input().split())
d = [0]*(N+1)
for a in A:
d[a] += 1
d.sort()
d.reverse()
print(sum(d[K:]))
|
s043813799 | p03493 | u317508154 | 1599873933 | Python | Python (3.8.2) | py | Runtime Error | 28 | 8956 | 29 | s = input()
print(s.count(1)) |
s594596526 | p03493 | u317508154 | 1599873887 | Python | Python (3.8.2) | py | Runtime Error | 26 | 8948 | 55 | a, b, c = map(int, input(),split(''))
print(a + b+ c) |
s531690088 | p03493 | u317508154 | 1599873854 | Python | Python (3.8.2) | py | Runtime Error | 24 | 8908 | 51 | a b c = map(int, input(),split(''))
print(a + b+ c) |
s560512572 | p03493 | u536642030 | 1599761129 | Python | Python (3.8.2) | py | Runtime Error | 26 | 8980 | 188 | n = int(input())
a = list(map(int, input().split()))
b = [bin(i)[2:] for i in a]
c = [0] * n
for i,v in enumerate(b):
for j in v[::-1]:
if j == '0':
c[i] += 1
print(min(c))
|
s996188784 | p03493 | u361672814 | 1599750598 | Python | Python (3.8.2) | py | Runtime Error | 26 | 8804 | 79 | s = input()
cnt = 0
for i in s:
if s[] == 1:
cnt+=1
else:
cnt = cnt |
s425579729 | p03493 | u601592822 | 1599695031 | Python | Python (3.8.2) | py | Runtime Error | 23 | 9040 | 196 | N = int(input())
A = list(map(int,input().split()))
cnt = 0
while True:
check = sum([n % 2 for n in A])
if check == 0:
A = [n/2 for n in A]
cnt += 1
else:
break
print(cnt) |
s802364719 | p03493 | u078214750 | 1599543177 | Python | Python (3.8.2) | py | Runtime Error | 28 | 8980 | 31 | s = input()
print(s.sount('1')) |
s449832665 | p03493 | u870492748 | 1599520514 | Python | Python (3.8.2) | py | Runtime Error | 21 | 9108 | 380 | S=int(input())
if S[0]==0 and S[1]==0 and S[2]==0:
print('0')
elif S[0]==1 and S[1]==0 and S[2]==0:
print('1')
elif S[0]==0 and S[1]==1 and S[2]==0:
print('1')
elif S[0]==0 and S[1]==0 and S[2]==1:
print('1')
elif S[0]==1 and S[1]==1 and S[2]==0:
print('2')
elif S[0]==0 and S[1]==1 and S[2]==1:
print('2')
elif S[... |
s962711829 | p03493 | u870492748 | 1599517467 | Python | Python (3.8.2) | py | Runtime Error | 28 | 8940 | 290 | s1,s2,s3=map(int,input().split())
if s1,s2,s3==0,0,0:
print('0')
elif s1,s2,s3==1,0,0:
print('1')
elif s1,s2,s3==0,1,0:
print('1')
elif s1,s2,s3==0,0,1:
print('1')
elif s1,s2,s3==1,1,0:
print('2')
elif s1,s2,s3==1,0,1:
print('2')
elif s1,s2,s3==0,1,1:
print('2')
else:
print('3') |
s336767474 | p03493 | u183803097 | 1599342689 | Python | PyPy3 (7.3.0) | py | Runtime Error | 90 | 74684 | 125 | from sys import stdin
a = [int(x) for x in list(stdin.readline())]
y = 0
for x in a:
if x == 1:
y += 1
print(y) |
s864201974 | p03493 | u183803097 | 1599342515 | Python | Python (3.8.2) | py | Runtime Error | 26 | 9180 | 125 | from sys import stdin
a = [int(x) for x in list(stdin.readline())]
y = 0
for x in a:
if x == 1:
y += 1
print(y) |
s407651798 | p03493 | u183803097 | 1599342478 | Python | Python (3.8.2) | py | Runtime Error | 21 | 9160 | 125 | from sys import stdin
a = [int(x) for x in list(stdin.readline())]
y = 0
for x in a:
if x == 1:
y += 1
print(y) |
s507417215 | p03493 | u710949411 | 1599191732 | Python | Python (3.8.2) | py | Runtime Error | 25 | 8976 | 248 | n = input().split()
a = list(map(int, input().split() ))
count = 0
while(True):
T = False
for i in range(len(a)):
if a[i]%2 != 0:
T=True
a[i] = a[i] / 2
if T:
break
count+=1
print(count)
|
s841767441 | p03493 | u710949411 | 1599173531 | Python | Python (3.8.2) | py | Runtime Error | 20 | 8924 | 342 | n = input().split()
a = list(map(int, input().split()))
b = 0
c = []
count = 0
while(True):
T = False
for i in range(len(a)):
if a[i]%2 != 0 :
T = True
if T:
break
for i in range(len(a)):
b = a[i] / 2
c.append(b)
a = c
co... |
s727121398 | p03493 | u194090201 | 1598938407 | Python | Python (3.8.2) | py | Runtime Error | 23 | 8944 | 79 | a = list(input())
count = 0
for i in a:
if a[i] == 1: count += 1
print(count) |
s366313125 | p03493 | u010777300 | 1598892201 | Python | Python (3.8.2) | py | Runtime Error | 27 | 9084 | 58 | s = int(input())
print(int(s[1]) + int(s[2]) + int(s[3]))
|
s167795280 | p03493 | u010777300 | 1598892105 | Python | Python (3.8.2) | py | Runtime Error | 26 | 9064 | 42 | s = int(input())
print(s[1] + s[2] + s[3]) |
s732264897 | p03493 | u957275485 | 1598729216 | Python | Python (3.8.2) | py | Runtime Error | 22 | 9156 | 99 | N,X = map(int,input().split())
mi=[int(input()) for _ in range(N)]
print(N+(X-sum(mi))//min(mi)) |
s276582583 | p03493 | u074220993 | 1598690459 | Python | Python (3.8.2) | py | Runtime Error | 28 | 8916 | 39 | s = input()
ans = s.count(1)
print(ans) |
s958489435 | p03493 | u078214750 | 1598661928 | Python | Python (3.8.2) | py | Runtime Error | 23 | 8992 | 23 | print(input().count(1)) |
s404397622 | p03493 | u972795791 | 1598661382 | Python | Python (3.8.2) | py | Runtime Error | 27 | 8980 | 216 | N = input()
A = list(map(int,input().split()))
c = 0
d = -1
while c>d:
d+=1
for i in A:
if i%2 == 0:
continue
else :
print(c)
break
else :
A=list(map(lambda x :x/2,A))
c += 1
|
s257785322 | p03493 | u309120194 | 1598633980 | Python | Python (3.8.2) | py | Runtime Error | 23 | 9084 | 31 | S = list(input())
print(sum(S)) |
s272442317 | p03493 | u855057563 | 1598453579 | Python | Python (3.8.2) | py | Runtime Error | 21 | 9004 | 144 | s=input()
if s="111":
print(3)
elif s="110" or "101" or "011":
print(2)
elif s="100" or "010" or "001":
print(1)
else s="000":
print(0)
|
s883923150 | p03493 | u855057563 | 1598453516 | Python | Python (3.8.2) | py | Runtime Error | 25 | 9008 | 135 | s=input()
if s="111":
print(3)
elif s="110" or "101" or "011":
print(2)
elif s="100" or "010" or "001":
print(1)
else:
print(0) |
s853679088 | p03493 | u957275485 | 1598412809 | Python | Python (3.8.2) | py | Runtime Error | 25 | 8936 | 45 | inp = map(str,input())
print(inp.count(1))
|
s409811952 | p03493 | u905551271 | 1598364643 | Python | Python (3.8.2) | py | Runtime Error | 28 | 8904 | 110 | s = string(input())
counter = 0
for i in range(3):
print(s[i])
if s[i]==1:
counter+=1
print(counter) |
s206557230 | p03493 | u905551271 | 1598363874 | Python | Python (3.8.2) | py | Runtime Error | 27 | 9048 | 95 | s = string(input())
counter = 0
for i in range(3):
if s[i]==1:
counter+=1
print(counter) |
s847683339 | p03493 | u905551271 | 1598363542 | Python | Python (3.8.2) | py | Runtime Error | 29 | 8960 | 122 | S = map(int, input().split())
c = 0
if S%10 == 1:
c += 1
if S//100 == 1:
c += 1
if (S//10)%10 == 1:
c += 1
print(c) |
s650572355 | p03493 | u957275485 | 1598239177 | Python | Python (3.8.2) | py | Runtime Error | 25 | 8948 | 96 | % input ex."101"
masu = input()
i=0
out=0
while i< len(masu):
out+=masu[i]
print(out)
|
s702526137 | p03493 | u296463304 | 1598220684 | Python | Python (3.8.2) | py | Runtime Error | 24 | 8904 | 173 | # coding= utf-8
lol=input("")
S1=int(lol[0:0])
S2=int(lol[1:1])
S3=int(lol[2:2])
Ss=[S1,S2,S3]
cnt=0
Ss.sort()
for 1 in Ss:
cnt += 1
del Ss[0]
else:
print(cnt)
break |
s264326016 | p03493 | u296463304 | 1598220557 | Python | Python (3.8.2) | py | Runtime Error | 19 | 9060 | 164 | # coding= utf-8
lol=input("")
S1=int(lol[0:0])
S2=int(lol[1:1])
S3=int(lol[2:2])
Ss=[S1,S2,S3]
cnt=0
Ss.sort()
if 1 in Ss:
cnt += 1
del Ss[0]
else:
print(cnt) |
s662469967 | p03493 | u074294554 | 1598159722 | Python | Python (3.8.2) | py | Runtime Error | 26 | 8884 | 53 | s = input()
ans = 0
if s=1:
ans += "1"
print(ans) |
s362141621 | p03493 | u703180353 | 1597951282 | Python | Python (3.8.2) | py | Runtime Error | 26 | 8956 | 29 | s = input()
print(count('1')) |
s294043417 | p03493 | u696469748 | 1597781049 | Python | Python (3.8.2) | py | Runtime Error | 24 | 9004 | 57 | s = input()
ans = 0
ans += [int(i) for i in s]
print(ans) |
s217548320 | p03493 | u696469748 | 1597780906 | Python | Python (3.8.2) | py | Runtime Error | 24 | 9048 | 50 | s = input()
ans += [int(i) for i in s]
print(ans) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.