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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
s773864435 | p03480 | u762557532 | 1567134207 | Python | Python (3.4.3) | py | Runtime Error | 63 | 6380 | 405 | S = input()
## 0を基準として、0と1の境目を調べる
boundary = []
pre_state = '0'
for i in range(len(S)):
if S[i] != pre_state:
boundary.append(i)
pre_state = S[i]
else:
if S[-1] == '1':
boundary.append(len(S))
## 答えは、端から一番遠い境目
lst = []
for i in range(len(boundary)):
lst.append(max(boundary[i], len(S)-boundary[i]... |
s358125715 | p03480 | u163320134 | 1566667181 | Python | Python (3.4.3) | py | Runtime Error | 35 | 3188 | 124 | s=input()
l=len(s)
ans=10**18
for i in range(l-1):
if s[i]!=s[i+1]:
tmp=max(i+1,n-i-1)
ans=min(ans,tmp)
print(ans) |
s909113554 | p03480 | u558242240 | 1566325942 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 173 | #s = input()
"""
s = '101'
s = '100000000'
s = '00001011'
"""
k = len(s)
for i in range(1, len(s)):
if s[i-1] != s[i+1]:
k = min(k, max(i, len(s)-i))
print(k)
|
s387338445 | p03480 | u332906195 | 1566020428 | Python | Python (3.4.3) | py | Runtime Error | 84 | 5200 | 176 | S = input()
b = []
for i in range(len(S) - 1):
if S[i:i + 2] == "01" or S[i:i + 2] == "10":
b.append(len(S) - (i + 1) if i < len(S) // 2 else i + 1)
print(min(b))
|
s342090435 | p03480 | u095266283 | 1565470855 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 1778 |
/**
* purpose :
* author : kyomukyomupurin
* created :
**/
// input/output
#include <iostream>
#include <fstream>
#include <sstream>
// container class
#include <array>
#include <deque>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <... |
s910113109 | p03480 | u638057737 | 1564949993 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3188 | 134 | S = input()
L = len(s)
ans = L
for i in range(L - 1):
if S[i] != S[i+1]:
ans = min(max(L - i - 1, i + 1),ans)
print(ans)
|
s888924153 | p03480 | u280978334 | 1562695422 | Python | Python (3.4.3) | py | Runtime Error | 53 | 5208 | 144 | S = input()
length = len(S)
temp = []
for i in range(1,length):
if S[i] != S[i-1]:
temp.append(max(i , length - i))
print(min(temp)) |
s450762813 | p03480 | u644778646 | 1562524926 | Python | PyPy3 (2.4.0) | py | Runtime Error | 177 | 39280 | 456 | S = input()
ans = 0
if len(S) % 2 == 0:
ans = len(S)//2
c = ans
t = S[ans]
for i in range(len(S)//2-1,-1,-1):
if S[i] == S[c] and S[i] == t:
ans += 1
c += 1
else:
break
else:
ans = len(S)//2
c = ans+1
t = S[ans+1]
for i in range(len(S)... |
s909417496 | p03480 | u986254798 | 1562524184 | Python | Python (2.7.6) | py | Runtime Error | 44 | 7428 | 139 | s = raw_input()
length = len(s)
T = []
for i in range(length-1):
if s[i] != s[i+1]:
T.append(max(i+1, length-(i+1)))
print min(T) |
s035336044 | p03480 | u986254798 | 1562523654 | Python | Python (2.7.6) | py | Runtime Error | 43 | 7428 | 139 | s = raw_input()
length = len(s)
T = []
for i in range(length-1):
if s[i] != s[i+1]:
T.append(max(i+1, length-(i+1)))
print min(T) |
s978669669 | p03480 | u037430802 | 1559507013 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 244 | s = input()
if len(s) == 1:
tmp = []
for i in range(len(s)-1):
if s[i] != s[i+1]:
tmp.append(max(i+1,len(s)-(i+1)))
if len(tmp) == 0:
#元から全部同じ
print(len(s))
else:
print(min(tmp)) |
s290463992 | p03480 | u037430802 | 1559506639 | Python | Python (3.4.3) | py | Runtime Error | 63 | 5184 | 141 | s = input()
tmp = []
for i in range(len(s)-1):
if s[i] != s[i+1]:
tmp.append(max(i+1,len(s)-(i+1)))
print(max(tmp)) |
s660359804 | p03480 | u969190727 | 1559048202 | Python | Python (3.4.3) | py | Runtime Error | 54 | 5200 | 116 | s=input()
n=len(s)
ss=s[0]
C=[]
for i in range(1,n):
if s[i]!=ss:
C.append(max(i,n-i))
ss=s[i]
print(min(C)) |
s167191946 | p03480 | u360116509 | 1557802802 | Python | Python (3.4.3) | py | Runtime Error | 2103 | 3380 | 333 | def main():
s = input()
if len(s) % 2 == 1:
sl = len(s) // 2 + 1
else:
sl = len(s) // 2
ss = s[-sl:sl]
for i in range(sl, len(s) + 1):
ss = s[-i - 1] + ss + s[i]
if ss.count('0') == len(ss) or ss.count('1') == len(ss):
continue
print(i)
ret... |
s330718076 | p03480 | u361243145 | 1556497824 | Python | Python (3.4.3) | py | Runtime Error | 86 | 3188 | 183 | # coding=utf-8
S = int(input())
# 0と1の個数のうち、大きい方
cnt = 0
for i in range(len(S)):
if S[i] == "0":
cnt += 1
cnt = max(cnt, len(S) - cnt)
print(cnt)
|
s016954783 | p03480 | u391731808 | 1556329898 | Python | Python (3.4.3) | py | Runtime Error | 37 | 3188 | 348 | S = input()
l = len(S)
if l%2:
c = S[l//2]
for i in range(1,l//2+1):
if S[l//2-i] != c or S[l//2 + i] != c:
break
else:
i += 1
print(l//2+i)
else:
c = S[l//2]
for i in range(l//2+1):
if S[l//2-i] != c or S[l//2 - 1 + i] != c:
break
else:
... |
s988287433 | p03480 | u497046426 | 1555221118 | Python | Python (3.4.3) | py | Runtime Error | 63 | 5200 | 240 | S = input()
n = len(S)
if n == 1:
print(1)
else:
prev = None
cand = []
for i in range(n):
if i != 0:
if S[i] != prev:
cand.append(max(i, n-i))
prev = S[i]
print(min(cand)) |
s810570234 | p03480 | u497046426 | 1555221004 | Python | Python (3.4.3) | py | Runtime Error | 60 | 5200 | 178 | S = input()
n = len(S)
prev = None
cand = []
for i in range(n):
if i != 0:
if S[i] != prev:
cand.append(max(i, n-i))
prev = S[i]
print(min(cand)) |
s798682292 | p03480 | u729133443 | 1554439010 | Python | PyPy3 (2.4.0) | py | Runtime Error | 206 | 41296 | 79 | s=input();n=len(s);print(min(n*(s[i-1]==s[i])or max(i,n-i)for i in range(1,n))) |
s656725973 | p03480 | u729133443 | 1554438971 | Python | Python (3.4.3) | py | Runtime Error | 56 | 3188 | 79 | s=input();n=len(s);print(min(n*(s[i-1]==s[i])or max(i,n-i)for i in range(1,n))) |
s270033946 | p03480 | u729133443 | 1554438751 | Python | PyPy3 (2.4.0) | py | Runtime Error | 198 | 39920 | 75 | s=input();n=len(s);print(min(max(i,n-i*(s[i-1]!=s[i]))for i in range(1,n))) |
s844712861 | p03480 | u729133443 | 1554438639 | Python | Python (3.4.3) | py | Runtime Error | 61 | 3188 | 75 | s=input();n=len(s);print(min(max(i,n-i*(s[i-1]!=s[i]))for i in range(1,n))) |
s849619523 | p03480 | u619458041 | 1552625416 | Python | Python (3.4.3) | py | Runtime Error | 29 | 3188 | 547 | import sys
def main():
input = sys.stdin.readline
S = str(input().strip())
if len(S) % 2 == 1:
mid = (len(S) - 1) // 2
for i in range(mid):
if S[mid] != S[mid + i] or S[mid] != S[mid -i]:
ans = mid + i
break
else:
midr = len(S) // 2
... |
s158860814 | p03480 | u619458041 | 1552622217 | Python | Python (3.4.3) | py | Runtime Error | 61 | 4084 | 878 | import sys
def main():
input = sys.stdin.readline
S = str(input().strip())
z = []
o = []
i = 0
while i < len(S):
j = i + 1
while j < len(S) and S[i] == S[j]:
j += 1
if S[i] == '0':
z.append(j-i)
else:
o.append(j-i)
i ... |
s834455080 | p03480 | u745087332 | 1550890111 | Python | Python (3.4.3) | py | Runtime Error | 46 | 3188 | 153 | s = input()
n = len(s)
k = 0
tmp = set()
while len(tmp) < 2:
tmp.add(s[n // 2 + k])
tmp.add(s[(n - 1) // 2 - k])
k += 1
print(n // 2 + k - 1) |
s642453294 | p03480 | u864197622 | 1549183714 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 170 | = input()
t = s[len(s)//2]
j = len(s)//2
i = len(s)-j-1
ans = j
while i >= 0:
if s[i] != t or s[j] != t:
break
ans += 1
i -= 1
j += 1
print(ans) |
s264529443 | p03480 | u175034939 | 1548392073 | Python | Python (3.4.3) | py | Runtime Error | 79 | 5752 | 268 | s = list(input())
sums = sum([int(ss) for ss in s])
if len(s) == 1:
print(1)
elif sums == len(s):
print(len(s))
else:
a = []
for i in range(len(s)-1):
if s[i] != s[i+1]:
a.append(max(i+1, len(s)-i-1))
print(min(a)) |
s800230328 | p03480 | u175034939 | 1548390437 | Python | Python (3.4.3) | py | Runtime Error | 2104 | 4764 | 203 | s = list(input())
if s == '1':
print(1)
else:
a = []
for i in range(len(s)-1):
if s[i] != s[i+1]:
a.append(max(len(s[:i+1]), len(s[i+1:])))
print(min(a)) |
s904258738 | p03480 | u832039789 | 1545016874 | Python | Python (3.4.3) | py | Runtime Error | 53 | 5312 | 138 | s = input()
n = len(s)
res = []
for i,(a,b) in enumerate(zip(s,s[1:])):
if a != b:
res.append(max(i+1,n-1-i))
print(min(res))
|
s907696641 | p03480 | u920299620 | 1541883675 | Python | Python (3.4.3) | py | Runtime Error | 38 | 3316 | 327 | import sys
s=input()
len_s=len(s)
if(len_s==1):
print(1)
sys.exit()
if(len_s%2==1):
l=len_s//2
r=l
else:
r=len_s//2
l=r-1
saisyo=s[l]
if(s[l]==s[r]):
while(saisyo==s[l-1] and saisyo==s[r+1]):
l-=1
r+=1
if(l==0):
break
else:
r=l
print( (len_s + r-l ... |
s842530785 | p03480 | u920299620 | 1541883448 | Python | Python (3.4.3) | py | Runtime Error | 38 | 3188 | 272 | s=input()
len_s=len(s)
if(len_s%2==1):
l=len_s//2
r=l
else:
r=len_s//2
l=r-1
saisyo=s[l]
if(s[l]==s[r]):
while(saisyo==s[l-1] and saisyo==s[r+1]):
l-=1
r+=1
if(l<0):
break
else:
r=l
print( (len_s + r-l +1)//2) |
s414618579 | p03480 | u920299620 | 1541883322 | Python | Python (3.4.3) | py | Runtime Error | 41 | 3188 | 249 | s=input()
len_s=len(s)
if(len_s%2==1):
l=len_s//2
r=l
else:
r=len_s//2
l=r-1
saisyo=s[l]
if(s[l]==s[r]):
while(saisyo==s[l-1] and saisyo==s[r+1] and 0<=l-1):
l-=1
r+=1
else:
r=l
print( (len_s + r-l +1)//2)
|
s205077403 | p03480 | u170201762 | 1540413184 | Python | Python (3.4.3) | py | Runtime Error | 62 | 5184 | 119 | S = input()
T = []
for i in range(len(S)-1):
if S[i] != S[i+1]:
T.append(max(i+1,len(S)-i-1))
print(min(T)) |
s495409852 | p03480 | u631277801 | 1540404716 | Python | Python (3.4.3) | py | Runtime Error | 87 | 3444 | 1297 | import sys
stdin = sys.stdin
sys.setrecursionlimit(10**5)
def li(): return map(int, stdin.readline().split())
def li_(): return map(lambda x: int(x)-1, stdin.readline().split())
def lf(): return map(float, stdin.readline().split())
def ls(): return stdin.readline().split()
def ns(): return stdin.readline().rstrip(... |
s175801644 | p03480 | u761320129 | 1539859320 | Python | Python (3.4.3) | py | Runtime Error | 39 | 3316 | 298 | S = input()
N = len(S)
center_i = N//2
center = S[center_i]
ans = N//2 + N%2
if N%2==0 and center != S[center_i+1]:
print(ans)
exit()
l = center_i - 1
r = center_i + 1 + (N%2==0)
while l >= 0:
if not (S[l] == center == S[r]):
break
l -= 1
r += 1
ans += 1
print(ans) |
s108142527 | p03480 | u536113865 | 1538855073 | Python | Python (3.4.3) | py | Runtime Error | 52 | 5208 | 119 | s = input()
n = len(s)
t = []
for i in range(1, n):
if s[i] != s[i-1]:
t.append(max(i, n-i))
print(min(t)) |
s881337299 | p03480 | u284854859 | 1533349300 | Python | Python (3.4.3) | py | Runtime Error | 58 | 5900 | 122 | s=list(input())
a = []
n=len(s)
for i in range(n-1):
if s[i]!= s[i+1]:
a.append(max(i+1,n-i-1))
print(min(a)) |
s352375577 | p03480 | u467736898 | 1528837463 | Python | Python (3.4.3) | py | Runtime Error | 33 | 3188 | 147 | S = input()
n = len(S)
ans = n//2
c = S[ans]
while ans <= n:
if c == S[ans] == S[-ans-1]:
ans += 1
else:
break
print(ans)
|
s171625637 | p03480 | u255001744 | 1526584815 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3188 | 196 | S = input()
# s = S[0]
temp_T = 100000
for i in range(len(S)-1):
if(S[i+1] != s[i]):
judge = max(i+1,len(S)-(i+1))
temp_T = min(judge, temp_T)
s = S[i]
print(temp_T)
|
s125064559 | p03480 | u255001744 | 1526584106 | Python | Python (3.4.3) | py | Runtime Error | 61 | 3188 | 186 | S = input()
s = S[0]
temp_T = 100000
for i in range(1, len(S)+1):
if(S[i] != s):
judge = max(i,len(S)-i)
temp_T = min(judge, temp_T)
s = S[i]
print(temp_T)
|
s290097943 | p03480 | u811202694 | 1525363274 | Python | Python (3.4.3) | py | Runtime Error | 71 | 5880 | 237 | s = list(input())
n = len(s)
if n == 1:
print(1)
exit()
big = []
for i, prev_c in enumerate(s):
if i == len(s)-1:
break
next_c = s[i+1]
if next_c != prev_c:
big.append(max(i, n-i))
print(min(big))
|
s075542657 | p03480 | u811202694 | 1525362964 | Python | Python (3.4.3) | py | Runtime Error | 75 | 5868 | 197 | s = list(input())
big = []
for i, prev_c in enumerate(s):
if i == len(s)-1:
break
next_c = s[i+1]
if next_c != prev_c:
big.append(max(i, len(s)-1-i))
print(min(big))
|
s564038233 | p03480 | u061732150 | 1520472882 | Python | Python (3.4.3) | py | Runtime Error | 2104 | 3596 | 709 | def sokutei(s):
b = [1,]
for t in range(1, len(s)):
if s[t] == s[t-1]:
b[-1] += 1
else:
b.append(1)
return max(b)
def main():
S = input()
B = sokutei(S)
for K in range(len(S), 1, -1):
a = [1,]
for i in range(len(S) - K):
s = "... |
s582049297 | p03480 | u222841610 | 1519531715 | Python | Python (3.4.3) | py | Runtime Error | 21 | 3572 | 1093 | import collections as col
s = input()
x,y = map(int,input().split())
col.Counter(s)
lr_check = True
ud_count = []
lr_count = []
F_count = 0
def dlr(i, p):
global lr_count
if i == 0:
if p == lr_count[0]:
return 1
else:
return 0
else:
return dlr(i-1,p+lr_count[... |
s522712185 | p03480 | u621935300 | 1519178000 | Python | Python (2.7.6) | py | Runtime Error | 32 | 4228 | 304 | S=raw_input()
N=len(S)
n=len(S)/2
if N%2==1: c=n # c:center
cnt=0
for i in range(1,n+1):
if N%2==1:
if S[c-i]==S[c+i]==S[c]:
cnt=1+2*i
pass
else:
if i==n:
cnt+=1
break
else:
if S[n-i]==S[n+i]:
cnt=2*n
else:
break
if N%2==1:
print max(n+1,cnt)
else:
print max(n, cnt)
|
s965312907 | p03480 | u621935300 | 1519090554 | Python | Python (2.7.6) | py | Runtime Error | 24 | 2820 | 192 | S=raw_input()
c=[]
cnt=0
for i in S:
if i=="0":
cnt+=1
else:
if cnt!=0:
c.append(cnt)
cnt=0
else:
if cnt!=0:
c.append(cnt)
if len(c)==1:
print c[0]
else:
print max(c)+1
|
s795097418 | p03480 | u480847874 | 1517179572 | Python | Python (3.4.3) | py | Runtime Error | 639 | 3532 | 290 | def main():
S = input()
N = len(S)
for k in range(N - 1, (N // 2) - 1, -1):
first = S[0:k]
union = k * 2 - N
cut = first[-union:-1] + first[-1]
if '1' in cut and '0' in cut:
continue
else:
return print(k)
main()
|
s998641390 | p03480 | u480847874 | 1517179161 | Python | Python (3.4.3) | py | Runtime Error | 673 | 3536 | 293 | def main():
S = input()
N = len(S)
for k in range(N - 1, N // 2 - 1, -1):
first = S[0:k]
union = k * 2 - len(S)
cut = first[-union:-1] + first[-1]
if '1' in cut and '0' in cut:
continue
else:
return print(k)
main()
|
s096633465 | p03480 | u000349418 | 1516412409 | Python | Python (3.4.3) | py | Runtime Error | 85 | 5404 | 237 | S=input()
if len(S)==1:
print('1')
else:
k=0
L=[]
while k < (len(S)-1):
if S[k] != S[k+1]:
L.append(max(k+1,len(S)-k-1))
k += 1
else:
k += 1
L.sort()
print(L[0]) |
s949333779 | p03480 | u000349418 | 1516412290 | Python | Python (3.4.3) | py | Runtime Error | 83 | 5396 | 233 | S=input()
if len(S)==1:
print('1')
else:
k=0
L=[]
while k < (len(S)-1):
if S[k] != S[k+1]:
L.append(max(k,len(S)-k))
k += 1
else:
k += 1
L.sort()
print(L[0]) |
s198480219 | p03480 | u743272507 | 1516385017 | Python | Python (3.4.3) | py | Runtime Error | 47 | 5212 | 104 | s = input()
l = len(s)
limit = [max(i+1,l-i-1) for i in range(l-1) if s[i] != s[i+1]]
print(min(limit))
|
s124778598 | p03480 | u850664243 | 1515364544 | Python | Python (3.4.3) | py | Runtime Error | 69 | 5184 | 151 | S = input()
tempT = []
T = 0
for i in range(0,len(S)-1):
if S[i] != S[i+1]:
tempT.append(max([i+1,len(S)-(i+1)]))
T = min(tempT)
print(T) |
s015049917 | p03480 | u910288980 | 1515166015 | Python | Python (3.4.3) | py | Runtime Error | 129 | 4092 | 697 | s = input()
def func(k):
cnt = 0
buf = 0
arr = [0 for _ in s]
arr.append(0)
for i in range(len(s)) :
if arr[i] == 1 :
cnt -= 1
buf += 1
if (i+1 is not len(s)) and s[i] == s[i+1] :
continue
val = (int(s[i]) + cnt + buf)%2
if val == ... |
s004320311 | p03480 | u846150137 | 1514577847 | Python | Python (3.4.3) | py | Runtime Error | 80 | 3316 | 122 | l=input()
n=len(l)
for i in range(1,n):
x = n
nx=0
if l[i-1] != l[i]:
nx = max(i, n-i)
x = min(x,nx)
print(x) |
s329037491 | p03480 | u545503667 | 1514151759 | Python | Python (3.4.3) | py | Runtime Error | 71 | 5184 | 134 | S = input().strip()
Ks = []
for i in range(len(S)-1):
if S[i] != S[i+1]:
Ks.append(max(i+1, len(S)-i-1))
print(min(Ks))
|
s678233715 | p03480 | u882831132 | 1514143152 | Python | Python (3.4.3) | py | Runtime Error | 52 | 5184 | 84 | s=input()
print(min([max(i+1,len(s)-i-1) for i in range(len(s)-1) if s[i]!=s[i+1]])) |
s482013854 | p03480 | u799613351 | 1514135436 | Python | Python (3.4.3) | py | Runtime Error | 1114 | 3452 | 157 | S = input()
import math
N = len(S)
for i in range(math.ceil(N/2), N):
if S[N-i:i] == '0'*(i-(N-i)) or S[N-i:i] == '1'*(i-(N-i)):
K = i
print(K)
|
s532236738 | p03480 | u695429668 | 1514134678 | Python | Python (3.4.3) | py | Runtime Error | 67 | 4084 | 409 | # coding:utf-8
S = input()
s_len = len(S)
s = [int(i) for i in S]
def reverse(A, L, R):
for i in range(R-L+1):
if A[L-1+i] == 0:
A[L-1+i] = 1
else:
A[L-1+i] = 0
return A
s_count = {}
for x in s:
if x not in s_count:
s_count[x] = 0
s_count[x] += 1... |
s423192117 | p03480 | u125205981 | 1514127562 | Python | Python (3.4.3) | py | Runtime Error | 26 | 3188 | 285 | def main():
S = input()
len_ = len(S)
if not S.count('0'):
print(len_)
return
k = (len_ + 1) // 2
for i in range(len_ // 2):
l = S[k - 1 - i]
r = S[k]
if l != r or k + 1 == len_:
break
print(k + i)
main()
|
s310226144 | p03480 | u499384645 | 1514094955 | Python | Python (3.4.3) | py | Runtime Error | 46 | 3188 | 327 | import math,sys
s=input()
k=math.ceil(len(s)/2)-1
if(s=='0'):
print(0)
sys.exit()
elif(s=='1'):
print(1)
sys.exit()
for i in range(int(math.ceil(len(s)/2))):
# print(k+i,k-i)
if(s[k+1] == s[k-1] and k-i == 0):
k=k+i
elif(s[k+i] == s[k-i]):
continue
else:
k=k+i
p... |
s974724460 | p03480 | u499384645 | 1514094737 | Python | Python (3.4.3) | py | Runtime Error | 44 | 3188 | 291 | import math,sys
s=input()
k=math.ceil(len(s)/2)-1
for i in range(int(math.ceil(len(s)/2))):
# print(k+i,k-i)
if(s[k+1] == s[k-1] and k-i == 0):
print(k+i)
sys.exit()
elif(s[k+i] == s[k-i]):
continue
else:
print(k+i)
sys.exit()
print(k) |
s785190555 | p03480 | u705038083 | 1514092546 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 735 | def main():
s = input()
max_k = 0
#バラバラ
slist = []
for i in range(len(s)):
slist.append(s[i:i+1])
for k in range(len(slist)):
tmplist = slist
judge = testmethod(tmplist, k)
if judge == 0:
max_k = k
print(max_k)
def testmethod(list, k)... |
s122863752 | p03480 | u705038083 | 1514092247 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 732 | def main():
s = input()
max_k = 0
#バラバラ
slist = []
for i in range(len(s)):
slist.append(s[i:i+1])
for k in range(len(slist)):
tmplist = slist
judge = testmethod(tmplist, k)
if judge == 0:
max_k = k
print(max_k)
def testmethod(list, k)... |
s846118660 | p03480 | u952708174 | 1514092227 | Python | Python (3.4.3) | py | Runtime Error | 52 | 5204 | 304 | def d_WideFlip(S):
n = len(S)
T = [] # 解説pdfにおけるT(S)の定義と同じもの
for k in range(n - 1):
if S[k] != S[k + 1]:
T.append(max(k + 1, n - (k + 1))) # 設問の文字列は1-indexedのため
T = min(T)
return T
S = input()
print(d_WideFlip(S)) |
s757985525 | p03480 | u705038083 | 1514092157 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 689 | def main():
s = input()
max_k = 0
#バラバラ
slist = []
for i in range(len(s)):
slist.append(s[i:i+1])
for k in range(len(slist)):
tmplist = slist
judge = testmethod(tmplist, k)
if judge == 0:
max_k = k
print(max_k)
def testmethod(list, k)... |
s666604731 | p03480 | u705038083 | 1514091828 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 689 | def main():
s = input()
max_k = 0
#バラバラ
slist = []
for i in range(len(s)):
slist.append(s[i:i+1])
for k in range(len(slist)):
tmplist = slist
judge = testmethod(tmplist, k)
if judge == 0:
max_k = k
print(max_k)
def testmethod(list, k)... |
s414170325 | p03480 | u705038083 | 1514091797 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 728 | def main():
s = input()
max_k = 0
#バラバラ
slist = []
for i in range(len(s)):
slist.append(s[i:i+1])
for k in range(len(slist)):
tmplist = slist
judge = testmethod(tmplist, k)
if judge == 0:
max_k = k
print(max_k)
def testmethod(list, k)... |
s212181172 | p03480 | u705038083 | 1514091674 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3188 | 663 | def main():
s = input()
max_k = 0
#バラバラ
slist = []
for i in range(len(s)):
slist.append(s[i:i+1])
for k in range(len(slist)):
judge = testmethod(slist, k)
if judge == 0:
max_k = k
print(max_k)
def testmethod(list, k):
for i in range(... |
s302638316 | p03480 | u705038083 | 1514091443 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 723 | import pandas as pd
def main():
s = input()
max_k = 0
#バラバラ
slist = []
for i in range(len(s)):
slist.append(s[i:i+1])
for k in range(len(slist)):
judge = testmethod(slist, k)
if judge == 0:
max_k = k
print(max_k)
def testmethod(list, k):
... |
s878917141 | p03480 | u425177436 | 1514091322 | Python | Python (3.4.3) | py | Runtime Error | 44 | 5204 | 79 | S=input()
N=len(S)
print(min([max(i,N-i) for i in range(1,N) if S[i-1]!=S[i]])) |
s278701561 | p03480 | u425177436 | 1514091255 | Python | Python (3.4.3) | py | Runtime Error | 45 | 3188 | 77 | S=input()
N=len(S)
print(min(max(i,N-i) for i in range(1,N) if S[i-1]!=S[i])) |
s122138416 | p03480 | u705038083 | 1514091250 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 609 |
s = input()
max_k = 0
#バラバラ
slist = []
for i in range(len(s)):
slist.append(s[i:i+1])
for k in range(len(slist)):
judge = testmethod(slist, k)
if judge == 0:
max_k = k
print(max_k)
def testmethod(list, k):
for i in range(0, len(list) - k):
target = list[i:i+k]
... |
s095937161 | p03480 | u225528554 | 1514089477 | Python | Python (3.4.3) | py | Runtime Error | 62 | 5904 | 246 | if __name__=="__main__":
l = list(input())
N = len(l)
if N==1:
print(1)
exit()
results = []
for i in range(0,N-1):
if not l[i]==l[i+1]:
results.append(max(i+1,N-i-1))
print(min(results)) |
s552169674 | p03480 | u225528554 | 1514089125 | Python | Python (3.4.3) | py | Runtime Error | 57 | 5908 | 201 | if __name__=="__main__":
l = list(input())
N = len(l)
results = []
for i in range(0,N-1):
if not l[i]==l[i+1]:
results.append(max(i+1,N-i-1))
print(min(results)) |
s412835269 | p03480 | u225528554 | 1514088969 | Python | Python (3.4.3) | py | Runtime Error | 56 | 5900 | 234 | if __name__=="__main__":
l = list(input())
N = len(l)
pre = l[0]
results = []
for i in range(1,N):
if not l[i]==pre:
pre = l[i]
results.append(max(i+1,N-i-1))
print(min(results)) |
s457498795 | p03480 | u432780056 | 1514086981 | Python | Python (2.7.6) | py | Runtime Error | 25 | 2692 | 455 | s = raw_input()
n = len(s)
if not n & 1:
l = n / 2 - 1
r = n / 2
res = n / 2
while r < n and l >= 0 and s[l] == s[r]:
l -= 1
r += 1
res += 1
print res
else:
l = n / 2 - 1
r = n / 2 + 1
res = n / 2 + 1
if s[n / 2] != s[l] or s[n / 2] != s[r]:
print res
... |
s381414293 | p03480 | u275488119 | 1514086784 | Python | Python (3.4.3) | py | Runtime Error | 69 | 4092 | 484 | s = input()
lst = []
add_lst = []
n = 0
for i in range(len(s)):
if i == 0 or s[i] == s[i-1]:
n +=1
else:
lst.append(n)
n = 1
lst.append(n)
for i in range(len(lst) - 1):
add_lst.append(lst[i] + lst[i + 1])
f=0
if len(lst) > 2:
f =min(add_lst)
elif len(lst) == 2:
f=max(lst)
... |
s394472069 | p03480 | u858136677 | 1514086685 | Python | Python (3.4.3) | py | Runtime Error | 86 | 3708 | 537 | s = input()
table = []
n = len(s)
i = 0
k = 0
counter = 1
while i <= n-1:
if s[i] == s[i+1]:
counter += 1
i += 1
else:
break
counter1 = 1
while k <= n-1:
if s[n-k-1] == s[n-k-2]:
counter1 += 1
k += 1
else:
break
while i < n-k-2:
t = 1
counter2 = 1
while t <= n:
if s[i] != s[i+t]:
counter2 +=... |
s739352046 | p03480 | u497046426 | 1514086585 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3188 | 242 | # スペース区切りの整数の入力
bit = map(str, input().split())
length = len(bit)
num0 = 0
num1 = 0
for i in range(length):
if bit[i] == '0':
num0 += 1
else:
num1 += 1
K = max(num0, num1)
print(K) |
s578608023 | p03480 | u813098295 | 1514086472 | Python | Python (2.7.6) | py | Runtime Error | 71 | 6488 | 871 | s = raw_input()
max0, max1 = -1, -1
cnt = 0
L = []
t = ""
for i in range(len(s)):
if i == 0:
t += s[i]
elif s[i] == "0" and s[i-1] == "0":
t += s[i]
elif s[i] == "0" and s[i-1] == "1":
L.append(len(t))
max1 = max(max1, len(t))
t = "0"
cnt += 1
elif s... |
s323985135 | p03480 | u448407332 | 1514086438 | Python | Python (3.4.3) | py | Runtime Error | 1218 | 389872 | 780 | s = input()
n = len(s)
def inverse(x):
if x == 1:
return 0
return 1
def calc(string):
ptn = [1]
flag = string[0]
for i in range(1, len(string)):
if flag != string[i]:
flag = string[i]
ptn.append(1)
else:
ptn[-1] += 1
return ptn
def f... |
s731354059 | p03480 | u858136677 | 1514086327 | Python | Python (3.4.3) | py | Runtime Error | 85 | 3708 | 536 | s = input()
table = []
n = len(s)
i = 0
k = 0
counter = 1
while i <= n-1:
if s[i] == s[i+1]:
counter += 1
i += 1
else:
break
counter1 = 1
while k <= n-1:
if s[n-k-1] == s[n-k-2]:
counter1 += 1
k += 1
else:
break
while i < n-k-2:
t = 1
counter2 = 1
while t <= n:
if s[i] != s[i+t]:
counter2 +=... |
s680700652 | p03480 | u762471013 | 1514086218 | Python | Python (3.4.3) | py | Runtime Error | 56 | 3188 | 321 | S=input()
minSeq=100000
seq=[]
tmpSeq=1
for i in range(1,len(S)):
if(S[i]==S[i-1]):
tmpSeq+=1
if not(i==len(S)-1):
continue
if tmpSeq not in seq:
seq.append(tmpSeq)
tmpSeq=1
if max(seq)==1:
print(seq[0]*2)
elif len(seq)==2:
print(max(seq))
else:
print(min(seq)... |
s160880566 | p03480 | u667024514 | 1514086155 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3956 | 136 | s = list(input())
one = list.count("1")
zero = list.count("0")
ans = []
ans.append(one)
ans.append(zero)
ans = sorted(ans)
print(ans[0]) |
s440173149 | p03480 | u942788644 | 1514085887 | Python | Python (2.7.6) | py | Runtime Error | 11 | 2568 | 30 | mx = max(mx, min(i, len(l)-x)) |
s090001980 | p03480 | u813098295 | 1514085587 | Python | Python (2.7.6) | py | Runtime Error | 63 | 6020 | 710 | s = raw_input()
max0, max1 = -1, -1
cnt = 0
t = ""
for i in range(len(s)):
if i == 0:
t += s[i]
elif s[i] == "0" and s[i-1] == "0":
t += s[i]
elif s[i] == "0" and s[i-1] == "1":
max1 = max(max1, len(t))
t = "0"
cnt += 1
elif s[i] == "1" and s[i-1] == "1":
... |
s156670365 | p03480 | u952708174 | 1514085429 | Python | Python (3.4.3) | py | Runtime Error | 42 | 4724 | 257 | def d_WideFlip(S):
import re
from collections import Counter
d = Counter(S)
zero = d['0']
one_continue = re.findall(r'1+', S)
one_continue = len(max(one_continue))
return max(zero, one_continue)
S = input()
print(d_WideFlip(S)) |
s143814343 | p03480 | u275488119 | 1514085346 | Python | Python (3.4.3) | py | Runtime Error | 2109 | 15692 | 811 | s = input()
import numpy as np
lst = []
add_lst = []
n = 0
for i in range(len(s)):
if i == 0 or s[i] == s[i-1]:
n +=1
else:
lst.append(n)
n = 1
lst.append(n)
for i in range(len(lst) - 1):
add_lst.append(lst[i] + lst[i + 1])
add_lst.append(lst[len(lst) - 1])
max0 = 100000
while Tru... |
s354409204 | p03480 | u201660334 | 1514084805 | Python | Python (3.4.3) | py | Runtime Error | 42 | 3188 | 604 | S =str(input())
if len(S) % 2 == 1:
a = 1
b = int((len(S) - 1) / 2)
while True:
if b - a < 0:
break
if S[b] == S[b + a] and S[b] == S[b - a]:
a = a + 1
else:
break
c = a + b
print(c)
else:
d = 0
e = int(len(S) / 2 - 1)
f = S[e]
... |
s922481972 | p03480 | u590211278 | 1514084725 | Python | Python (3.4.3) | py | Runtime Error | 53 | 4092 | 1189 | s = input()
ss = []
key = s[0]
cnt = 1
for i in range(1,len(s)):
if key == s[i]:
cnt += 1
else:
ss.append(cnt)
key = s[i]
cnt = 1
ss.append(cnt)
ans = 0
maxs = max(ss)
#print(ss)
# 端かどうかの判定。端ならそのまま。
if len(ss)==1 or len(ss)==2:
ans = maxs
elif max(ss[1:len(ss)-2]) < maxs a... |
s890142927 | p03480 | u494209838 | 1514084617 | Python | Python (3.4.3) | py | Runtime Error | 968 | 23092 | 538 | # -*- coding: utf-8 -*-
import numpy as np
S = [int(x) for x in list(input())]
if len(S)==1:
print(1)
elif len(S)==2:
if S[0] == S[1]:
print(2)
else:
print(1)
else:
for i in range(len(S)):
if S[i] == S[i+1]:
pass
else:
f = i + 1
... |
s089380394 | p03480 | u494209838 | 1514084477 | Python | Python (3.4.3) | py | Runtime Error | 1603 | 23332 | 520 | # -*- coding: utf-8 -*-
import numpy as np
S = [int(x) for x in list(input())]
if len(S)==1:
print(1)
elif len(S)==2:
if S[0] == S[1]:
print(2)
else:
print(1)
else:
for i in range(len(S)):
if S[i] == S[i+1]:
pass
else:
f = i + 1
... |
s554919374 | p03480 | u201660334 | 1514084179 | Python | Python (3.4.3) | py | Runtime Error | 39 | 3188 | 524 | S =str(input())
if len(S) % 2 == 1:
a = 1
b = int((len(S) - 1) / 2)
while True:
if S[b] == S[b + a] and S[b] == S[b - a]:
a = a + 1
else:
break
c = a + b
print(c)
else:
d = 0
e = int(len(S) / 2 - 1)
f = S[e]
while True:
if S[e + 1] == f... |
s431810692 | p03480 | u590211278 | 1514084046 | Python | Python (3.4.3) | py | Runtime Error | 114 | 4092 | 679 | s = input()
ss = []
key = s[0]
cnt = 1
for i in range(1,len(s)):
if key == s[i]:
cnt += 1
else:
ss.append(cnt)
key = s[i]
cnt = 1
ss.append(cnt)
ans = 0
maxs = max(ss)
#print(ss)
# 端かどうかの判定。端ならそのまま。
if len(ss)==2:
ans = maxs
elif max(ss[1:len(ss)-1]) < maxs and ss[0] != ss... |
s898894144 | p03480 | u201660334 | 1514083939 | Python | Python (3.4.3) | py | Runtime Error | 40 | 3188 | 520 | S =str(input())
if len(S) % 2 == 1:
a = 1
b = int((len(S) - 1) / 2)
while True:
if S[b] == S[b + a] and S[b] == S[b - a]:
a = a + 1
else:
break
c = a + b
print(c)
else:
d = 1
e = int(len(S) / 2 - 1)
f = S[e]
while True:
if S[e + 1] == f... |
s557853441 | p03480 | u839857256 | 1514083640 | Python | Python (3.4.3) | py | Runtime Error | 43 | 3572 | 297 | s = input()
key = s[0]
count = 1
c_list = []
for i in range(1, len(s)):
if key == s[i]:
count += 1
else:
c_list.append(count)
key = s[i]
count = 1
if count > 1:
c_list.append(count)
ans = max(c_list)
if max(c_list) < len(s)/2:
ans += 1
print(ans)
|
s237789632 | p03480 | u590211278 | 1514083522 | Python | Python (3.4.3) | py | Runtime Error | 45 | 3956 | 489 | s = input()
ss = []
key = s[0]
cnt = 1
for i in range(1,len(s)):
if key == s[i]:
cnt += 1
else:
ss.append(cnt)
key = s[i]
cnt = 1
ss.append(cnt)
ans = 0
maxs = max(ss)
#print(ss)
# 端かどうかの判定。端ならそのまま。
if len(ss)==2:
ans = maxs
elif max(ss[1:len(s)-1]) < maxs and ss[0] != ss[... |
s203560989 | p03480 | u502314533 | 1514083184 | Python | PyPy3 (2.4.0) | py | Runtime Error | 179 | 39408 | 82 | S = input()
p = S.count("0")
if p > len(S) - p:
print(p)
else:
print(S-p) |
s443646238 | p03480 | u808427016 | 1514083158 | Python | Python (3.4.3) | py | Runtime Error | 199 | 101396 | 415 | import sys
def solve(s, cache={}):
if s in cache:
return cache[s]
n = len(s)
if n == 1:
return 1
if s == "0" * n or s == "1" * n:
return n
r1 = solve("0" + s[1:-1])
r2 = solve("1" + s[1:-1])
r3 = solve(s[1:-1] + "0")
r4 = solve(s[1:-1] + "1")
r = max(r1, r2, ... |
s903782991 | p03480 | u502314533 | 1514083145 | Python | PyPy3 (2.4.0) | py | Runtime Error | 197 | 39408 | 77 | S = input()
p = S.count("0")
if p > S - p:
print(p)
else:
print(S-p) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.