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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
s248647245 | p03566 | u654470292 | 1587662120 | Python | PyPy3 (2.4.0) | py | Runtime Error | 179 | 38444 | 988 | import sys
from collections import *
import heapq
import math
from math import gcd
import bisect
import copy
from itertools import permutations,accumulate,combinations,product
def input():
return sys.stdin.readline()[:-1]
def ruiseki(lst):
return [0]+list(accumulate(lst))
mod=pow(10,9)+7
al=[chr(ord('a') + i) f... |
s604647141 | p03566 | u989345508 | 1585055818 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3192 | 1226 | import heapq
n=int(input())
inf=10000000000000
ans=[[-1,-1] for i in range(n)]
ans[-1][1],ans[0][0]=0,0
t=list(map(int,input().split()))
v=list(map(int,input().split()))
v2=[]
for i in range(n):
heapq.heappush(v2,(v[i],i))
def next(y,wh):
global ans,n
ansi=inf
if wh:
r1,r2=range(y[1]-1,-1,-1),r... |
s644968413 | p03566 | u706929073 | 1581296775 | Python | Python (3.4.3) | py | Runtime Error | 59 | 4648 | 418 | n = int(input())
t = [2 * int(i) for i in input().split()]
v = [2 * int(i) for i in input().split()]
su = sum(t)
a = [min(i, su - i) for i in range(su + 1)]
cnt = 0
for t_i, v_i in zip(t, v):
for i in range(cnt, cnt + t_i + 1):
a[i] = min(a[i], v_i)
cnt += t_i
for i in range(su):
a[i + 1] = min(a... |
s722773086 | p03566 | u706929073 | 1581296698 | Python | Python (3.4.3) | py | Runtime Error | 26 | 4624 | 416 | n = int(input())
t = [2 * int(i) for i in input().split()]
v = [2 * int(i) for i in input().split()]
su = sum(t)
a = [min(i, su - i) for i in range(su + 1)]
cnt = 0
for t_i, v_i in zip(t, v):
for i in range(cnt, cnt + t_i + 1):
a[i] = min(a[i], v)
cnt += t_i
for i in range(su):
a[i + 1] = min(a[i... |
s596634954 | p03566 | u706929073 | 1581296598 | Python | Python (3.4.3) | py | Runtime Error | 22 | 3696 | 404 | n = int(input())
t = list(map(int, input().split()))
v = list(map(int, input().split()))
su = sum(t)
a = [min(i, su - i) for i in range(su + 1)]
cnt = 0
for t_i, v_i in zip(t, v):
for i in range(cnt, cnt + t_i + 1):
a[i] = min(a[i], v)
cnt += t_i
for i in range(su):
a[i + 1] = min(a[i + 1], a[i] ... |
s384441451 | p03566 | u585704797 | 1576960879 | Python | PyPy3 (2.4.0) | py | Runtime Error | 172 | 38456 | 572 | N=int(input())
T=[0]+[int(x) for x in str(input()).split()]+[0]
V=[0]+[int(x) for x in str(input()).split()]+[0]
time=0
t=[0]
for i in T:
time+=i
t.append(time)
ans=0
for j in range(0,2*time):
m2=100000000
m1=100000000
t1=j/2
t2=(j+1)/2
print(t1,t2)
for i in range(N+2):
a=t[i]
b=t[i+1]
c=V[i]
if... |
s088273567 | p03566 | u919025034 | 1576736634 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 665 | N=int(input())
T=list(map(int,input().split()))
V=list(map(int,input().split()))
V.append(0)
for i in range(N-1,-1,-1):
v=V[i+1]
t=T[i]
V[i]=min(V[i],v+t)
v=0
ans=0
for i in range(N):
t_p=T[i]
v_p=V[i]
v_a=V[i+1]
if v_p==v_a:
if v==v_p:
ans+=t_p*v_p
v=v_a
elif v_a-v>=t_p:
ans... |
s522267118 | p03566 | u263830634 | 1565660371 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3188 | 1022 | N = int(input())
t = [0] + list(map(int, input().split()))
v = [0] + list(map(int, input().split()))
max_speed_from_left = [0] * (N + 1) #index i = t[i] とt[i + 1]の間
max_speed_from_right = [0] * (N + 1) #index i = t[i] とt[i + 1]の間
for i in range(1, N):
start = max_speed_from_left[i - 1]
max_speed_from_left[i] =... |
s853417466 | p03566 | u367130284 | 1556246052 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 256 | n=int(input())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
ans=0
if n==1:
if a[0]>=b[0]*2:
print(b[0]**2+b[0]*(a[0]-b[0]*2))
else:
print(a[0]/2**2)
else:
for i in range(n):
if i==n-1:
|
s262512965 | p03566 | u367130284 | 1556245989 | Python | Python (3.4.3) | py | Runtime Error | 19 | 2940 | 256 | n=int(input())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
ans=0
if n==1:
if a[0]>=b[0]*2:
print(b[0]**2+b[0]*(a[0]-b[0]*2))
else:
print(a[0]/2**2)
else:
for i in range(n):
if i==n-1:
|
s939254722 | p03566 | u367130284 | 1556245984 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3060 | 256 | n=int(input())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
ans=0
if n==1:
if a[0]>=b[0]*2:
print(b[0]**2+b[0]*(a[0]-b[0]*2))
else:
print(a[0]/2**2)
else:
for i in range(n):
if i==n-1:
|
s984070882 | p03566 | u029169777 | 1555994125 | Python | Python (3.4.3) | py | Runtime Error | 201 | 14540 | 1472 | import numpy as np
N=int(input())
t=list(map(int,input().split()))
v=list(map(int,input().split()))
tsum=np.sum(t)
print(tsum)
Ruisekit=[t[0]]
for i in range(1,N):
Ruisekit.append(t[i]+Ruisekit[i-1])
print(Ruisekit)
downstart=[]
for i in range(N-1):
if v[i]>v[i+1]:
downstart.append(t[i]-(v[i]-v[i+1... |
s760351097 | p03566 | u367130284 | 1554672475 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3064 | 255 | n=int(input())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
ans=0
if n==1:
if a[0]>=b[0]*2:
print(b[0]**2+b[0]*(a[0]-b[0]*2))
else:
print(a[0]/2**2)
else:
for i in range(n):
if i==n-1:
|
s287906065 | p03566 | u943004959 | 1552585575 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 474 | itertools import chain
n = int(input())
ts = list(map(int, input().split()))
vs = list(map(int, input().split()))
va = list(chain.from_iterable([v] * (2 * t) for t, v in zip(ts, vs)))
va = [min(v1, v2) for v1, v2 in zip([0] + va, va + [0])]
lt = len(va)
pv = 0
for ct in range(1, lt):
va[ct] = pv = min(va[c... |
s790093730 | p03566 | u099566485 | 1551393090 | Python | Python (3.4.3) | py | Runtime Error | 21 | 3316 | 677 | #076-D
def IL(): return list(map(int,input().split()))
def SL(): return input().split()
def I(): return int(input())
def S(): return list(input())
n=I()
t=IL()
v=IL()
c=[[0,0,0]]
for i in range(n):
l=c[-1][0]
r=l+t[i]
v=v[i]
c.append([l,r,v])
c.append([c[-1][1],c[-1][1],0])
def f(a):
vmax=1000
... |
s654952043 | p03566 | u690536347 | 1535479381 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 435 | from itertools import accumulate as ac
o=[]
f=lambda l,r,v:lambda x:v if l<=x<=r else v+(l-x) if 0<=x<=l else v+(x-r)
v=lambda s:min(map(lambda x:x(s),o))
o.extend([f(0,0,0)])
n=int(input())
*a,=map(int,input().split())
*b,=map(int,input().split())
*c,=ac([0]+a)
for (i,(t,v)) in enumerate(zip(a,b)):
o.extend([f(c[i... |
s662813034 | p03566 | u668726177 | 1520032282 | Python | PyPy3 (2.4.0) | py | Runtime Error | 173 | 38640 | 508 | import numpy as np
def speed(t, v, l, r):
if t < l:
return v + l - t
if l <= t <= r:
return v
if r < t:
return v + t - r
n = int(input())
ts = np.cumsum(np.array([0] + list(map(int, input().split()))))
vs = list(map(int, input().split()))
conditions = [(0, 0, 0)] + [(vs[i], ts[i], ... |
s235292006 | p03566 | u590048048 | 1516545633 | Python | Python (3.4.3) | py | Runtime Error | 1403 | 18492 | 1895 |
from collections import deque
def upperlimit(ts, vs):
"""
return value f gives speed limit at time t
"""
xs = [(-100, 0)]
t = 0
for s, v in zip(ts, vs):
xs.append((t, v))
t += s
xs.append((t, 0))
#print(xs)
"""xs has time of start, instead of end"""
""" ach... |
s140270339 | p03566 | u018679195 | 1511887062 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 515 | n = int(raw_input())
times = map(int, raw_input().split())
speeds = map(int, raw_input().split())
#print(times, speeds)
dst = 0
s = 0
for i in range(n):
#loop over each section of time
for j in range(times[i]):
#j is in 100 1 sec intervals
if (s < speeds[i]):
s+= 1
dst... |
s497061401 | p03566 | u353919145 | 1511886995 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 516 | n = int(raw_input())
times = map(int, raw_input().split())
speeds = map(int, raw_input().split())
print(times, speeds)
dst = 0
s = 0
for i in range(n):
#loop over each section of time
for j in range(times[i]):
#j is in 100 1 sec intervals
if (s < speeds[i]):
s+= 1
dst ... |
s566939258 | p03566 | u322422986 | 1509595681 | Python | Python (3.4.3) | py | Runtime Error | 2104 | 3444 | 577 | n = int(input())
t = list(map(int, input().split()))
v = list(map(int, input().split()))
T = sum(t)
def f(l, r, v, x):
maxv = 0
if 0 <= x and x < l:
maxv = v + l - x
elif l <= x and x <= r:
maxv = v
else:
maxv = v + x - r
return maxv
def vel(x):
minv = f(0, 0, 0, x)
minv = min(minv, f(T, T, 0, x))
l = ... |
s940808989 | p03566 | u322422986 | 1509595585 | Python | Python (3.4.3) | py | Runtime Error | 2104 | 3444 | 595 | n = int(input())
t = list(map(int, input().split()))
v = list(map(int, input().split()))
T = sum(t)
def f(l, r, v, x):
maxv = 0
if 0 <= x and x < l:
maxv = v + l - x
elif l <= x and x <= r:
maxv = v
else:
maxv = v + x - r
return maxv
def vel(x):
minv = f(0, 0, 0, x)
minv = min(minv, f(T, T, 0, x))
l = ... |
s667811595 | p03566 | u432780056 | 1509509744 | Python | Python (2.7.6) | py | Runtime Error | 12 | 2696 | 3343 | def get_distance_and_next_speed(current_speed, max_speed, time, next_max_speed):
#CASE 1: /---- or -----(CAN REACH THE MAX SPEED) AND THE NEXT MAX SPEED IS EQUAL TO OR BIGGER THAN CURRENT MAX SPEED
if max_speed <= next_max_speed and max_speed >= current_speed and max_speed - current_speed <= time:
#max_speed - curr... |
s725381810 | p03566 | u327466606 | 1509421064 | Python | Python (3.4.3) | py | Runtime Error | 2104 | 3064 | 558 | from itertools import chain
double = lambda c: int(c)*2
N = int(input())
T = tuple(map(double,input().split()))
V = tuple(map(double,input().split()))
dp = [0]
for t,v_max,vf_max in zip(T,V,chain(V[1:],(0,))):
ndp = [0]*(min(vf_max,v_max)+1)
for vf in range(len(ndp)):
vi_min = max(0,vf-t)
vi_max ... |
s998129072 | p03566 | u162612857 | 1509305347 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 984 | n = int(input())
tt = list(map(int, input().split()))
v = list(map(int, input().split()))
time = sum(tt);
border = [0] *(n+1)
start_v = [0] *(n+1)
end_v = [0] *(n+1)
temp = 0
for i in range(n):
temp += tt[i]
border[i+1] = temp
start_v[i] = v[i]
end_v[i+1] = v[i]
t = 0
idx = 0
ans = 0
vlast = 0
v0 = 0
# print ... |
s477132438 | p03566 | u112902287 | 1509244784 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 1226 | n = int(input())
t = [None] + list(map(int, input().split())) + [None]
v = [0] + list(map(int, input().split())) + [0]
distance = 0
for i in range(1, n+1):
former_speed = v[i-1]
current_speed = v[i]
next_speed = v[i+1]
if current_speed >= next_speed:
end = current_speed - next_speed
if... |
s942552553 | p03566 | u346308892 | 1509244780 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 718 |
N=int(input())
T=spaceinput()
v=spaceinput()
Tmax=0
for i in range(N):
Tmax+=(T[i])
#mv=[0]*(Tmax+1)
mv={}
frange=[x for x in range(2*Tmax+1)]
k=0
sT=T[0]
d=0.5
mv[0]=0
for t in [x/2 for x in range(1,2*Tmax)]:
if sT<t:
k+=1
if k<len(T):
sT+=T[k]
else:
break... |
s076071681 | p03566 | u424270557 | 1509244509 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 1097 | def solve(t1,v1,t2,v2,vmax):
if v1 > vmax or v2 > vmax:
return -inf
if t2-t1 < abs(v2-v1):
return -inf
vmax_theory = min(v1,v2)+((t2-t1)+abs(v2-v1))/2.0
area1 = (vmax_theory-min(v1,v2))**2
area2 = (abs(v1-v2))**2/2.0
area3 = (t2-t1)*min(v1,v2)
if vmax_theory < vmax:
return area1-area2+area3
... |
s343318352 | p03566 | u424270557 | 1509244449 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 1059 | def solve(t1,v1,t2,v2,vmax):
if v1 > vmax or v2 > vmax:
return -inf
if t2-t1 < abs(v2-v1):
return -inf
vmax_theory = min(v1,v2)+((t2-t1)+abs(v2-v1))/2.0
area1 = (vmax_theory-min(v1,v2))**2
area2 = (abs(v1-v2))**2/2.0
area3 = (t2-t1)*min(v1,v2)
if vmax_theory < vmax:
return area1-area2+area3
... |
s106322383 | p03566 | u607081325 | 1509241819 | Python | Python (3.4.3) | py | Runtime Error | 2104 | 3064 | 723 |
N = int(input())
T= list(map(int,input().split()))
V = list(map(int,input().split()))
T.append(0)
V.append(0)
T_sum= []
tmp_sum = 0
for t in T:
tmp_sum+=t
T_sum.append(tmp_sum)
n=0
_range =1000000
def check(t,n,v):
max_a = 1
for i in range(n+1,N+1):
max_speed_i = V[i]
time_i = T_su... |
s170297506 | p03566 | u607081325 | 1509241812 | Python | Python (3.4.3) | py | Runtime Error | 2104 | 3064 | 722 |
N = int(input())
T= list(map(int,input().split()))
V = list(map(int,input().split()))
T.append(0)
V.append(0)
T_sum= []
tmp_sum = 0
for t in T:
tmp_sum+=t
T_sum.append(tmp_sum)
n=0
_range =100000
def check(t,n,v):
max_a = 1
for i in range(n+1,N+1):
max_speed_i = V[i]
time_i = T_sum... |
s914546507 | p03567 | u469315559 | 1601396766 | Python | Python (3.8.2) | py | Runtime Error | 25 | 8840 | 241 | #include <bits/stdc++.h>
using namespace std;
int main(){
string S;
cin>>S;
for(int i=0;i<S.length()-1;i++){
if(S.at(i)=='A' && S.at(i+1)=='C'){
cout<<"Yes"<<endl;
return 0;
}
}
cout<<"No"<<endl;
return 0;
}
|
s367645894 | p03567 | u368796742 | 1599161851 | Python | Python (3.8.2) | py | Runtime Error | 27 | 8924 | 40 | print("YES" if "AC" in input() else "NO) |
s818144693 | p03567 | u121698457 | 1598506049 | Python | Python (3.8.2) | py | Runtime Error | 29 | 8984 | 57 | S = input()
if "AC" in S:
print('Yes')
else
print('No') |
s288419913 | p03567 | u397953026 | 1596824705 | Python | Python (3.8.2) | py | Runtime Error | 26 | 8892 | 61 | s = input()
if s in "AC":
print("Yes")
else:
print("No") |
s933998089 | p03567 | u598684283 | 1595743416 | Python | Python (3.8.2) | py | Runtime Error | 26 | 9104 | 166 | s = input()
flag = 0
for i in range(len(s)):
if s[i] == "A":
if s[i + 1] == "C":
flag = 1
if flag == 1:
print("Yes")
else:
print("No") |
s959637025 | p03567 | u813098295 | 1592835286 | Python | Python (3.8.2) | py | Runtime Error | 29 | 9064 | 90 | print("Yes" if any([input()[i:i + 2] == "AC" for i in range(len(input()) - 1)]) else "No") |
s896736958 | p03567 | u119982001 | 1589615017 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 105 | S = input()
for i in range(len(S)):
if S[i] == 'A' ans S[i+1]:
print('Yes')
exit()
print('No') |
s478395814 | p03567 | u119982001 | 1589614845 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 105 | S = input()
for i in range(len(S)):
if S[i] == 'A' ans S[i+1]:
print('Yes')
exit()
print('No') |
s424159804 | p03567 | u760961723 | 1585364216 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 138 | S = input()
ans =0
for i in (len(S)-1):
if (S[i] == "A") and (S[i+1] =="C"):
ans = 1
if ans == 1:
print("Yes")
else:
print("No") |
s207461633 | p03567 | u760961723 | 1585364161 | Python | Python (3.4.3) | py | Runtime Error | 20 | 2940 | 138 | S = input()
ans =0
for i in (len(S)-1):
if (S[i] == "A") and (S[i+1] =="C"):
ans = 1
if ans ==1:
print("Yes")
else:
print("No") |
s956385987 | p03567 | u374802266 | 1579753712 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 117 | s=input()
for i in range(len(s)-1):
if s[i]=="A" anf s[i+1]=="C":
print('Yes')
exit()
print('No') |
s968978189 | p03567 | u623819879 | 1578877193 | Python | PyPy3 (2.4.0) | py | Runtime Error | 172 | 38256 | 40 | print('YNeos'[['AC' not in input()]::2]) |
s387479636 | p03567 | u577914737 | 1577811289 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 60 | a = input()
if 'AC' in s:
print('Yes')
else:
print('No') |
s382302124 | p03567 | u994988729 | 1576967366 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 38 | print("Yes") "AC" in input() else "No" |
s809765582 | p03567 | u774160580 | 1575500149 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3060 | 116 | S = input()
for i in range(len(S) - 1):
if S[i, i + 1] == "AC":
print("Yes")
exit()
print("No")
|
s123428093 | p03567 | u369039955 | 1574910983 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 25 | print(if 'AC' in input()) |
s482290115 | p03567 | u762420987 | 1574443485 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 119 | S = input()
for _ in range(S - 1):
if S[_:_ + 2] == "AC":
print("Yes")
break
else:
print("No")
|
s135449183 | p03567 | u940061594 | 1573487162 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 187 | #Can you get AC?
S = input()
p = 0
for i in range(n-1):
if S[i:i+2] == "AC":
print("Yes")
p = p + 1
break
else:
continue
if p == 0:
print("No") |
s439490286 | p03567 | u940061594 | 1573486940 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 187 | #Can you get AC?
S = input()
p = 0
for i in range(n-1):
if S[i:i+2] == "AC":
print("Yes")
p = p + 1
break
else:
continue
if p == 0:
print("No") |
s571362992 | p03567 | u022832318 | 1573484490 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 58 | s=input()
if 'AC' in S:
print("Yes")
else:
print("No") |
s947110875 | p03567 | u676029460 | 1571627000 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 135 | s = input()
ok = False
for i in (len(s)-1):
if (s[i]=='A' and s[i+1]=='C'):
ok = True
if ok:
print('Yes')
else :
print('No') |
s239801768 | p03567 | u871596687 | 1569094799 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 130 | s = input()
for i in range(len(s)-1):
if s[i] == "A" and s[i+1] == "C":
print("Yes")
else:
print("No")
|
s956128487 | p03567 | u871596687 | 1569094728 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 111 | s = input()
for i in range(len(s)-1):
if s[i][i+1] == "AC":
print("Yes")
else:
print("No")
|
s602902610 | p03567 | u871596687 | 1569094698 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 110 | s = input()
for i in range(len(s)-1)
if s[i][i+1] == "AC":
print("Yes")
else:
print("No")
|
s077062056 | p03567 | u399721252 | 1566356306 | Python | PyPy3 (2.4.0) | py | Runtime Error | 181 | 38256 | 119 | s = input()
ans = "No"
for i in range(len(s)-1):
if s[i] == "A" and s[i+1] == "C":
ans = "Yes"
break
print(ans) |
s478915577 | p03567 | u569272329 | 1560913430 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 266 | #include <iostream>
#include <string>
using namespace std;
int main()
{
string str;
cin >> str;
if (str.find('A') == (str.rfind('C') + 1))
{
cout << "Yes" << endl;
}
else
{
cout << "No" << endl;
}
return 0;
} |
s101905854 | p03567 | u960997735 | 1558827714 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 269 | #include <bits/stdc++.h>
using namespace std;
int main(){
string S;
cin >> S;
for(int i=0;i<S.size()-1;i++){
if(S.substr(i,2) == "AC"){
cout << "Yes" << endl;
return 0;
}
}
cout << "No" << endl;
} |
s269450085 | p03567 | u912862653 | 1558155216 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 130 | def solve():
S = input()
for i in range(len(S)-1):
if S[i:i+2]=='AC':
print('Yes')
return
print('No')
return
solve() |
s407122367 | p03567 | u163320134 | 1555243783 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 156 | ソースコード
Copy
Copy
s=input()
flag=False
for i in range(len(s)-1):
if s[i:i+2]=='AC':
flag=True
if flag:
print('Yes')
else:
print('No') |
s103677020 | p03567 | u859897687 | 1553864001 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 32 | print('YNeos'['AC'in input()::2] |
s020152746 | p03567 | u379692329 | 1553283896 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 120 | S = input()
flag = False
for i in range(4):
if S[i:i+2] == "AC"
flag = True
print("Yes" if flag else "No") |
s124158946 | p03567 | u367130284 | 1551618196 | Python | Python (3.4.3) | py | Runtime Error | 19 | 2940 | 64 | print(3**int(input())-2**sum(~int(s)%2for s in input().split())) |
s857888238 | p03567 | u367130284 | 1551609525 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 65 | print(3**int(input())-2**sum(~int(s)%2 for s in input().split())) |
s289087325 | p03567 | u785578220 | 1551583301 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 67 | a=input()
if “AC” in a:
print(“Yes”)
else:print(“No”) |
s165455219 | p03567 | u940102677 | 1541630401 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 107 | s = int(input())
l = []
for i in range(len(s)-1):
l.append(s[i:i+2])
print("Yes" if "AC" in l else "No") |
s414655850 | p03567 | u898651494 | 1536944873 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 1990 | #include <iostream>
#include <fstream>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <algorithm>
#include <numeric>
#include <functional>
#include <string>
#include <vector>
#include <bitset>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <deque>
using namespace std;
using ... |
s012711592 | p03567 | u667084803 | 1511759455 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3060 | 118 | N=int(input())
A=list(map(int,input().split()))
even=0
for i in range(N):
if A[i]%2==0: even+=1
print(3**N-2**even) |
s584901759 | p03567 | u857605629 | 1511609605 | Python | Python (2.7.6) | py | Runtime Error | 10 | 2568 | 51 | print "Yes" if raw_input.find("AC") else print "No" |
s540463800 | p03567 | u411537765 | 1509727595 | Python | Python (3.4.3) | py | Runtime Error | 27 | 3892 | 444 | import string
ALPHABETS = string.ascii_lowercase
s = input()
N = len(s)
MAX = 2 * 10 ** 5
a = [0] * (N + 1)
for i, c in enumerate(s):
idx = ALPHABETS.index(c)
a[i+1] = a[i] ^ (2 ** idx)
opt = [0] * (N + 1)
dp = {}
dp[0] = 0
for i in range(1, N + 1):
dp[a[i]] = min(dp.get(a[i], MAX), min([dp.get(a[i] ^ 2 ... |
s926183314 | p03567 | u729417323 | 1509688912 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 400 | # --*-coding:utf-8-*--
def f(str):
s = {}
s[0] = 0
pat = 0
bits = [2**i for i in range(26)]
lenOfStr = len(str)
for c in str:
pat ^= bits[ord(c)-97]
s[pat] = min(
min(s.get(pat^bit, lenOfStr) + 1 for bit in bits),
s.get(pat, lenOfStr))
if pat == 0... |
s067549165 | p03567 | u411537765 | 1509419189 | Python | Python (3.4.3) | py | Runtime Error | 25 | 3768 | 518 | import string
ALPHABETS = string.ascii_lowercase
def is_avairable(a):
return bin(a).count('1') <= 1
s = input()
N = len(s)
a = [0] * (N + 1)
for i, c in enumerate(s):
idx = ALPHABETS.index(c)
a[i+1] = a[i] ^ (2 ** idx)
opt = [0] * (N + 1)
dp = [2 * (10 ** 5) + 1] * (2 ** 26)
dp[0] = 0
for i in range(1,... |
s868148918 | p03567 | u351426847 | 1509238229 | Python | Python (2.7.6) | py | Runtime Error | 11 | 2572 | 335 | # -*- coding: utf-8 -*-
if __name__ == '__main__':
N = raw_input()
A = map(int, raw_input().split())
c_total = 1
c_odd = 1
for a in A:
if a != 1 or a != 100:
c_total *= 3
else:
c_total *= 2
if a % 2 == 0 and a != 100:
c_odd *= 2
print c... |
s557033456 | p03567 | u833990553 | 1509212420 | Python | Python (2.7.6) | py | Runtime Error | 14 | 2568 | 62 | N = input()
if 'AC' in N:
print 'Yes'
else:
print 'No' |
s645514844 | p03567 | u351426847 | 1509170195 | Python | Python (2.7.6) | py | Runtime Error | 17 | 2816 | 307 | # coding: utf-8
# 自分の得意な言語で
# Let's チャレンジ！！
if __name__ == '__main__':
S = input()
flg = True
for index in range(len(S) - 1):
if S[index]+S[index+1] == 'AC':
print 'Yes'
flg = False
break
if flg:
print 'No'
|
s849051723 | p03567 | u351426847 | 1509169628 | Python | Python (2.7.6) | py | Runtime Error | 11 | 2568 | 186 | # coding: utf-8
# 自分の得意な言語で
# Let's チャレンジ！！
if __name__ == '__main__':
S = input()
if 'AC' in S:
print 'Yes'
else:
print 'No'
|
s527232095 | p03567 | u560670090 | 1509032194 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 102 | a = list(map(int, input().split()))
a.sort(key=int)
if a[0] == a[1]:
print(a[2])
else:
print(a[0]) |
s970818857 | p03567 | u560670090 | 1509032067 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 102 | a = list(map(int, input().split()))
a.sort(key=int)
if a[0] == a[1]:
print(a[2])
else:
print(a[0]) |
s080581680 | p03567 | u482969053 | 1508991042 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 159 | N = int(input())
A = list(map(int, input().split()))
odd_cand = 1
ans = 1
for i in A:
if i%2==0:
odd_cand *= 2
ans *= 3
print(ans - odd_cand) |
s044004601 | p03567 | u017172546 | 1508726149 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 16 | printf("Hello"); |
s723019922 | p03567 | u667024514 | 1508725108 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 58 | a = input()
if "AC" in a:
print("Yes")
elif:
print("No") |
s135858546 | p03567 | u667024514 | 1508724943 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 212 | a = input()
if len a[0]=A and len a[1]=C:
print("Yes")
elif len a[1]=A and len a[2]=C:
print("Yes")
elif len a[2]=A and len a[3]=C:
print("Yes")
elif len a[3]=A and len a[4]=C:
print("Yes")
elif:
print("No") |
s331734898 | p03567 | u291111534 | 1508724716 | Python | PyPy2 (5.6.0) | py | Runtime Error | 34 | 27756 | 49 | s=input()
print "Yes" if s.count("AC") else "No"
|
s728868351 | p03567 | u667024514 | 1508724662 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 212 | a = input()
if len a[0]=A and len a[1]=C:
print("Yes")
elif len a[1]=A and len a[2]=C:
print("Yes")
elif len a[2]=A and len a[3]=C:
print("Yes")
elif len a[3]=A and len a[4]=C:
print("Yes")
elif:
print("No") |
s868762830 | p03567 | u653860865 | 1508722546 | Python | Python (2.7.6) | py | Runtime Error | 11 | 2568 | 65 | ans=input()
if ans.find!=-1:
print "Yes"
else:
print "No" |
s046057921 | p03567 | u497285470 | 1508722449 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 209 | import itertools
inputs = input()
N = int(inputs)
inputs = input().split()
A = map(lambda x: int(x), inputs)
count = 1
for i in A:
if i % 2 == 0:
count = count * 2
print(3**N - count ) |
s150281680 | p03567 | u476044037 | 1508722103 | Python | Python (3.4.3) | py | Runtime Error | 22 | 3060 | 93 | if "AC" in input() == True:
print("Yes")
else:
print("No")if "AC" in input() == True: |
s744637745 | p03567 | u255122982 | 1508721231 | Python | Python (3.4.3) | py | Runtime Error | 20 | 2940 | 153 | a=input("");
flag=False;
for i in xrange(0,len(a)-2):
if a[i]=='A' and a[i+1]=='C':
flag=True;
if flag==True:
print("Yes");
else:
print("No");
|
s378464611 | p03567 | u255122982 | 1508721043 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 147 | a=input("")
flag=False
for i in xrange(0,len(a)-2):
if a[i]=='A' and a[i+1]=='C':
flag=True
if flag==True:
print("Yes")
else:
print("No") |
s302209141 | p03567 | u540307496 | 1508720802 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 233 | S = str(input())
Slist = list(S)
flag = False
for i in range(len(Slist)-1):
st = Slist[i] + Slist[i+1]
if(st == "AC" and flag == False):
prinSSFGt('Yes')
flag = True
if(flag == False):
print('No')
|
s170351405 | p03567 | u140672616 | 1508720612 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 57 | if "AC" in input():
print("Yes")
else
print("No") |
s296287355 | p03567 | u603253967 | 1508720611 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 342 | #!/usr/bin/env python
import sys
from typing import List
def main(arg: List[str]):
s = input()
i = "AC" in s
if i:
print("Yes")
else:
print("No")
# print(123)
# b = [int(a) for a in input().split(" ")]
# print(b)
# [input() for a in range(3)]
if __name__ == "__main__... |
s118016962 | p03567 | u497285470 | 1508720590 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 182 | inputs = input()
x = list(inputs)
flag = False
for i in range(len(x) - 1):
if x[i] == 'A' and x[i+1] == 'C'
flag = True
if flag:
print('Yes')
else:
print('No') |
s979252626 | p03567 | u497285470 | 1508720545 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 210 | inputs = input()
inputs = list(inputs)
flag = False
for i in range(len(inputs) - 1):
if inputs[i] == 'A' and inputs[i+1] == 'C'
flag = True
if flag:
print('Yes')
else:
print('No') |
s430370558 | p03567 | u327466606 | 1508720535 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 53 | print(‘Yes’ if ‘AC’ in input() else ‘No’) |
s274659040 | p03567 | u925364229 | 1508720517 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 78 | #! usr/bin/env python3
# A :
S = input()
if "AC" in S:
print("Yes")
else: |
s650101819 | p03568 | u350093546 | 1596798400 | Python | PyPy3 (7.3.0) | py | Runtime Error | 98 | 74560 | 138 | n=int(input())
n=3**n
a=list(map(int,input().split()))
a=[2 if i%2==0 for i in a else 1]
cnt=1
for i in a:
cnt*=i
print(n-cnt)
|
s222253131 | p03568 | u394731058 | 1594479897 | Python | Python (3.8.2) | py | Runtime Error | 24 | 9092 | 294 | import sys
input = sys.stdin.readline
def main():
ans = 0
n = int(input())
A = list(map(int, input().split()))
allB = exc = 1
for i in n:
allB *= 3
if i%2 == 0:
exc *= 2
ans = allB - exc
print(ans)
if __name__ == '__main__':
main() |
s167511029 | p03568 | u088863512 | 1594329894 | Python | Python (3.8.2) | py | Runtime Error | 26 | 8824 | 2385 | #ifndef LOCAL
#pragma GCC optimize("O3")
#include <bits/stdc++.h>
#else
#include <iostream>
#include <iomanip>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <memory>
#include <cctype>
#include <cstring>
#include <vector>
#include <list>
#include <queue>
#include <deque>
#include <st... |
s476084414 | p03568 | u274635633 | 1591090330 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 114 | n=map(int,input().split())
a=list(map(int,input().split()))
x=0
for i in a:
if i%2==0:
x+=1
print(3**n-2**x) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.