buggy stringlengths 1 618k | fixed stringlengths 16 618k | buggy_submission_id stringlengths 10 10 | fixed_submission_id stringlengths 10 10 | problem_id stringlengths 6 6 | lang stringclasses 1
value | buggy_verdict stringclasses 2
values |
|---|---|---|---|---|---|---|
a={}
_,q=map(int,input().split())
for i in range(q):
b,c=map(int,input().split())
if b in a:a[b]+=c
else:a[b]=c
d=max(a.items(),key=lambda x:x[1])
if list(a.values()).count(d[1])>1:
e={}
for i in a:
if a[i]==d[1]:e[i]=d[1]
print(*min(e.items(),key=lambda x:x[0]))
... | n,q=list(map(int, input().split()))
c=[0 for _ in range(n + 1)]
b=[0,0]
for _ in range(q):
a,v=map(int, input().split())
c[a]+=v
if b[0]==a and v>0:b[1]+=v
elif b[0]==a:mx=max(c[0:]);b[0],b[1]=min([i for i, value in enumerate(c) if value == mx]),mx
elif b[1]<c[a]:b[0],b[1]=a,c[a]
elif b[1]==c[a]... | s410305327 | s914146979 | p00099 | python | Time Limit Exceeded |
for _ in [0]*int(input()):
s=input()
if s[1]=='\'':
a=s[2:-1].split('#')
print(['NA','A'][set(a[0])==set(a[1])=={'='} and len(set(a))==1])
else:
s=s[2:-2]
print(['NA','B'][len(s)==2*s.count('Q=')]) | for _ in [0]*int(input()):
s=input()
a='NA'
if s[:2]==">'" and s[-1]=='~' and '#' in s:
s=s[2:-1].split('#')
a=[a,'A'][set(s[0])==set(s[1])=={'='} and len(set(s))==1]
elif s[:2]=='>^' and s[-2:]=='~~':
s=s[2:-2]
a=['NA','B'][len(s)==2*s.count('Q=') and len(s)>0]
print... | s754242452 | s150922946 | p00139 | python | Runtime Error |
for _ in [0]*int(input()):
s=input()
if s[:2]=='>\'' and s[-1]=='~':
a=s[2:-1].split('#')
print(['NA','A'][set(a[0])==set(a[1])=={'='} and len(set(a))==1])
elif s[:2]=='>^' and s[-2:]=='~~':
s=s[2:-2]
print(['NA','B'][len(s)==2*s.count('Q=')]) | for _ in [0]*int(input()):
s=input()
a='NA'
if s[:2]==">'" and s[-1]=='~' and '#' in s:
s=s[2:-1].split('#')
a=[a,'A'][set(s[0])==set(s[1])=={'='} and len(set(s))==1]
elif s[:2]=='>^' and s[-2:]=='~~':
s=s[2:-2]
a=['NA','B'][len(s)==2*s.count('Q=') and len(s)>0]
print... | s493043244 | s150922946 | p00139 | python | Runtime Error |
def score(x):
s=0;t=1
for _ in[0]*10:
a=2;b=3
if x[t]==10:a=1
elif x[t]+x[t+1]!=10:b=2
s+=sum(x[t:t+b]);t+=a
return x[0],s
while 1:
n=int(input())
if n==0:break
A=sorted([score(map(int,input().split())) for _ in [0]*n])
for a,b in sorted(A,key=lambda x:-x[1])... | def score(x):
s=0;t=1
for _ in[0]*10:
a=2;b=3
if x[t]==10:a=1
elif x[t]+x[t+1]!=10:b=2
s+=sum(x[t:t+b]);t+=a
return x[0],s
while 1:
n=int(input())
if n==0:break
A=sorted([score(list(map(int,input().split()))) for _ in [0]*n])
for a,b in sorted(A,key=lambda x:... | s178499488 | s858285669 | p00152 | python | Runtime Error |
n=1000000
p=[1]*(n+1)
p[0],p[1]=0,0
for i in range(2,int(n**0.5)+1):
if p[i]:
for j in range(i*i,n,i):
p[j]=0
while 1:
l=int(input())
if l==0:break
ans=-l
while l:
l-=1
a,m=map(int,input().split())
ans+=sum(p[max(1,a-m)-1:min(n,a+m)])
print(ans) | import bisect
n=1000000
p=[1]*(n+1)
p[0],p[1]=0,0
for i in range(2,int(n**0.5)+1):
if p[i]:
for j in range(i*i,n+1,i):
p[j]=0
p=[i for i in range(n+1) if p[i]==1]
while 1:
n=int(input())
ans=-n
if n==0:break
while n:
n-=1
a,m=map(int,input().split())
... | s135803162 | s783878756 | p00165 | python | Time Limit Exceeded |
n=1000000
p=[1]*(n+1)
pr=[]
p[0],p[1]=0,0
for i in range(2,int(n**0.5)+1):
if p[i]:
for j in range(i*i,n,i):
p[j]=0
for i in range(2,n):
if p[i]:
pr.append(int(i))
while 1:
l=int(input())
if l==0:break
ans=-l
while l:
l-=1
a,m=map(int,input().s... | import bisect
n=1000000
p=[1]*(n+1)
p[0],p[1]=0,0
for i in range(2,int(n**0.5)+1):
if p[i]:
for j in range(i*i,n+1,i):
p[j]=0
p=[i for i in range(n+1) if p[i]==1]
while 1:
n=int(input())
ans=-n
if n==0:break
while n:
n-=1
a,m=map(int,input().split())
... | s367054544 | s783878756 | p00165 | python | Time Limit Exceeded |
while 1:
l,r=0,int(input())
a=[int(input()) for _ in range(r)]
r-=1;c=0
k=int(input())
while l<=r:
c+=1
m=(l+r)//2
if a[m]==k:break
if a[m]<k:l=m+1
else:r=m-1
print(c) | while 1:
l,r=0,int(input())
if r==0:break
a=[int(input()) for _ in range(r)]
r-=1;c=0
k=int(input())
while l<=r:
c+=1
m=(l+r)//2
if a[m]==k:break
if a[m]<k:l=m+1
else:r=m-1
print(c) | s177622560 | s996478971 | p00188 | python | Runtime Error |
while 1:
n=int(input())
if n=='0': break
for _ in range(n):
a=list(map(int,input().split()))
c=sum(a)
if sum(a[:2])/2>=90 or c/3>=80 or 100 in a: b='A'
elif c/3>=70 or (c/3>=50 and (a[0]>=80 or a[1]>=80)): b='B'
else: b='C'
print(b) | while 1:
n=int(input())
if n==0: break
for _ in range(n):
a=list(map(int,input().split()))
c=sum(a)
if sum(a[:2])>179 or c>239 or 100 in a: b='A'
elif c>209 or (c>149 and max(a[:2])>79): b='B'
else: b='C'
print(b) | s922236017 | s698782122 | p00218 | python | Runtime Error |
while 1:
m,n=map(int,input().split())
if m==0:break
a,i,c=[i+1 for i in range(m)],1,0
while i<=n:
b,f=input(),0
if i%15==0:
if b!='FizzBuzz':
del a[c]
f=1
elif i%5==0:
if b!='Buzz':
del a[c]
f... | while 1:
m,n=map(int,input().split())
if m==0:break
a,i,c=list(range(1,m+1)),0,0
while i<n:
i+=1
b,f=input(),0
if m<2:continue
if i%15==0:
if b!='FizzBuzz':
del a[c]
f=1
elif i%5==0:
if b!='Buzz':
... | s840257413 | s148607084 | p00221 | python | Runtime Error |
while 1:
m,n=map(int,input().split())
if m==0:break
a,i,c=[i+1 for i in range(m)],1,0
while i<=n:
b,f=input(),0
if m==1:continue
if i%15==0:
if b!='FizzBuzz':
del a[c]
f=1
elif i%5==0:
if b!='Buzz':
d... | while 1:
m,n=map(int,input().split())
if m==0:break
a,i,c=list(range(1,m+1)),0,0
while i<n:
i+=1
b,f=input(),0
if m<2:continue
if i%15==0:
if b!='FizzBuzz':
del a[c]
f=1
elif i%5==0:
if b!='Buzz':
... | s501074490 | s148607084 | p00221 | python | Runtime Error |
while 1:
m,n=map(int,input().split())
if m==0:break
a,i,c=[i+1 for i in range(m)],0,0
while i<n:
i+=1
b,f=input(),0
if m==1:continue
if i%15==0:
if b!='FizzBuzz':
del a[c]
f=1
elif i%5==0:
if b!='Buzz':
... | while 1:
m,n=map(int,input().split())
if m==0:break
a,i,c=list(range(1,m+1)),0,0
while i<n:
i+=1
b,f=input(),0
if m<2:continue
if i%15==0:
if b!='FizzBuzz':
del a[c]
f=1
elif i%5==0:
if b!='Buzz':
... | s786988722 | s148607084 | p00221 | python | Runtime Error |
while 1:
m,n=map(int,input().split())
if m==0:break
a,i,c=[i+1 for i in range(m)],0,0
while i<n:
i+=1
b,f=input(),0
if len(a)==1:continue
if i%15==0:
if b!='FizzBuzz':
del a[c]
f=1
elif i%5==0:
if b!='Buzz':
... | while 1:
m,n=map(int,input().split())
if m==0:break
a,i,c=list(range(1,m+1)),0,0
while i<n:
i+=1
b,f=input(),0
if m<2:continue
if i%15==0:
if b!='FizzBuzz':
del a[c]
f=1
elif i%5==0:
if b!='Buzz':
... | s178071871 | s148607084 | p00221 | python | Runtime Error |
while 1:
m,n=map(int,input().split())
if m==0:break
a,i,c=list(range(1,m+1)),0,0
while i<n:
i+=1
b,f=input(),0
if m<2:continue
if i%15==0:
if b!='FizzBuzz':
del a[c]
f=1
elif i%5==0:
if b!='Buzz':
... | while 1:
m,n=map(int,input().split())
if m==0:break
a,i,c=list(range(1,m+1)),0,0
while i<n:
i+=1
b,f=input(),0
if m<2:continue
if i%15==0:
if b!='FizzBuzz':
del a[c]
f=1
elif i%5==0:
if b!='Buzz':
... | s512311929 | s148607084 | p00221 | python | Runtime Error |
n=10000000
p=[1]*(n+1)
p[0],p[1]=0,0
for i in range(2,int(n**0.5)+1):
if p[i]:
for j in range(i*i,n+1,i):
p[j]=0
#p=[i for i in range(n+1) if p[i]==1]
while 1:
n=int(input())
if n==0: break
for i in range(n,2,-1):
if (p[i],p[i-2],p[i-6],p[i-8])==(1,1,1,1):
... | n=10000000
p=[1]*(n+1)
p[0],p[1]=0,0
for i in range(2,int(n**0.5)+1):
if p[i]:
for j in range(i*i,n+1,i):
p[j]=0
#p=[i for i in range(n+1) if p[i]==1]
while 1:
n=int(input())
if n==0: break
if n<19:print(13)
else:
for i in range((n+1)//10*10-1,2,-10):
... | s995132775 | s552988048 | p00222 | python | Time Limit Exceeded |
import re
class c(int):
global p
def __add__(self,n):
return c((int(self)+int(n))%p)
def __sub__(self,n):
return c((int(self)-int(n))%p)
def __mul__(self,n):
return c((int(self)*int(n))%p)
def __truediv__(self,n):
if n==0:raise ZeroDivisionError
return self*(i... | import re
class c(int):
global p
def __add__(self,n):
return c((int(self)+int(n))%p)
def __sub__(self,n):
return c((int(self)-int(n))%p)
def __mul__(self,n):
return c((int(self)*int(n))%p)
def __truediv__(self,n):
if n==0:raise ZeroDivisionError
return self*po... | s936980257 | s280818524 | p00259 | python | Time Limit Exceeded |
while 1:
n,k=map(int,input().split())
if n==0:break
a=[int(input()) for _ in range(k)]
m=sum(a)
for i in range(n-k):
a.append(int(input()))
m=max(m,sum(a[-k:]))
print(m) | import queue
while 1:
n,k=map(int,input().split())
if n==0:break
a=queue.deque(int(input()) for _ in range(k))
m=b=sum(a)
for i in range(n-k):
c=a.popleft()
d=int(input())
a.append(d)
b+=d-c
m=max(b,m)
print(m) | s563268869 | s076656742 | p00439 | python | Time Limit Exceeded |
import queue
while 1:
n,k=map(int,input().split())
if n==0:break
a=queue.deque(int(input()) for _ in range(k))
m=sum(a)
for i in range(n-k):
a.popleft()
a.append(int(input()))
m=max(m,sum(a))
print(m) | import queue
while 1:
n,k=map(int,input().split())
if n==0:break
a=queue.deque(int(input()) for _ in range(k))
m=b=sum(a)
for i in range(n-k):
c=a.popleft()
d=int(input())
a.append(d)
b+=d-c
m=max(b,m)
print(m) | s055820180 | s076656742 | p00439 | python | Time Limit Exceeded |
import bisect
while 1:
n,m=map(int,input().split())
if n==0:break
s,a=[],[0]*(n+1)
for i in range(1,n+1):
a[i]=int(input())
for j in range(i+1):
if a[i]+a[j]<=m:s+=[a[i]+a[j]]
else:break
s.sort()
print(max(i+s[bisect.bisect_right(s,m-i)-1]for i in s)) | import bisect
while 1:
n,m=map(int,input().split())
if n==0:break
s=[]
a=[0]+sorted([int(input()) for _ in range(n)])
for i in range(n+1):
for j in a[i:]:
if a[i]+j>m:break
s+=[a[i]+j]
s.sort()
print(max(i+s[bisect.bisect_right(s,m-i)-1]for i in s)) | s485453304 | s318698908 | p00452 | python | Time Limit Exceeded |
import itertools
while 1:
n,m,s=map(int,input().split())
if n==0:break
dp=[[0 for _ in range(s+2)] for _ in range(n*n+1)]
dp[0][0]=1
for i,j in itertools.product(range(1,m+1),range(n*n,0,-1)):
for k in range(i,s+1):
dp[j][k]=(dp[j][k]+dp[j-1][k-i])%100000
print(dp[n*n][s]) | import itertools
while 1:
n,m,s=map(int,input().split())
if n==0:break
dp=[[0 for _ in range(s+1)] for _ in range(n*n+1)]
dp[0][0]=1
for i,j in itertools.product(range(1,n*n+1),range(s+1)):
if j>=i:dp[i][j]+=dp[i-1][j-i]+dp[i][j-i]
if j-m>=1:dp[i][j]-=dp[i-1][j-m-1]
dp[i][j]%... | s512983755 | s212992019 | p00460 | python | Time Limit Exceeded |
dp=[0]+[1<<20]*10000
n=int(input())
for i in range(1,n):
a=int(input())
for j in range(i//2+1):
dp[j],dp[i-j]=map(min,[(dp[j],dp[i-j]+a),(dp[i-j],dp[j]+a)])
print(dp[n//2]) | dp=[0]+[1<<20]*10000
n=int(input())
for i in range(1,n):
a=int(input())
for j in range(i//2+1):
if dp[j]>dp[i-j]+a:dp[j]=dp[i-j]+a
if dp[i-j]>dp[j]+a:dp[i-j]=dp[j]+a
print(dp[n//2]) | s751708361 | s965833590 | p00473 | python | Runtime Error |
dp=[0]+[1<<20]*10000
n=int(input())
for i in range(1,n+1):
a=int(input())
for j in range(i//2+1):
dp[j],dp[i-j]=map(min,[(dp[j],dp[i-j]+a),(dp[i-j],dp[j]+a)])
print(dp[n//2]) | dp=[0]+[1<<20]*10000
n=int(input())
for i in range(1,n):
a=int(input())
for j in range(i//2+1):
if dp[j]>dp[i-j]+a:dp[j]=dp[i-j]+a
if dp[i-j]>dp[j]+a:dp[i-j]=dp[j]+a
print(dp[n//2]) | s383823053 | s965833590 | p00473 | python | Runtime Error |
dp=[0]+[1<<20]*10000
n=int(input())
for i in range(1,n):
try:a=int(input())
except:break
for j in range(i//2+1):
dp[j],dp[i-j]=map(min,[(dp[j],dp[i-j]+a),(dp[i-j],dp[j]+a)])
print(dp[n//2]) | dp=[0]+[1<<20]*10000
n=int(input())
for i in range(1,n):
a=int(input())
for j in range(i//2+1):
if dp[j]>dp[i-j]+a:dp[j]=dp[i-j]+a
if dp[i-j]>dp[j]+a:dp[i-j]=dp[j]+a
print(dp[n//2]) | s525745808 | s965833590 | p00473 | python | Runtime Error |
dp=[0]+[1<<20]*10000
n=int(input())
for i in range(1,n+1):
try:a=int(input())
except:break
for j in range(i//2+1):
dp[j],dp[i-j]=map(min,[(dp[j],dp[i-j]+a),(dp[i-j],dp[j]+a)])
print(dp[n//2]) | dp=[0]+[1<<20]*10000
n=int(input())
for i in range(1,n):
a=int(input())
for j in range(i//2+1):
if dp[j]>dp[i-j]+a:dp[j]=dp[i-j]+a
if dp[i-j]>dp[j]+a:dp[i-j]=dp[j]+a
print(dp[n//2]) | s901927841 | s965833590 | p00473 | python | Runtime Error |
import sys
dp=[0]+[1<<20]*10000
n=int(input())
a=list(map(int,sys.stdin.readlines()))
for i in range(1,len(a)):
for j in range(i//2+1):
dp[j],dp[i-j]=map(min,[(dp[j],dp[i-j]+a[i-1]),(dp[i-j],dp[j]+a[i-1])])
print(dp[n//2]) | dp=[0]+[1<<20]*10000
n=int(input())
for i in range(1,n):
a=int(input())
for j in range(i//2+1):
if dp[j]>dp[i-j]+a:dp[j]=dp[i-j]+a
if dp[i-j]>dp[j]+a:dp[i-j]=dp[j]+a
print(dp[n//2]) | s876130401 | s965833590 | p00473 | python | Runtime Error |
import sys
dp=[0]+[1<<20]*10000
n=int(input())
a=list(map(int,sys.stdin.readlines()))
for i in range(1,n):
for j in range(i//2+1):
dp[j],dp[i-j]=map(min,[(dp[j],dp[i-j]+a[i-1]),(dp[i-j],dp[j]+a[i-1])])
print(dp[n//2]) | dp=[0]+[1<<20]*10000
n=int(input())
for i in range(1,n):
a=int(input())
for j in range(i//2+1):
if dp[j]>dp[i-j]+a:dp[j]=dp[i-j]+a
if dp[i-j]>dp[j]+a:dp[i-j]=dp[j]+a
print(dp[n//2]) | s377828182 | s965833590 | p00473 | python | Runtime Error |
#???????????±???????????\????????°????????£?????????????
import sys
dp = [0] + [1 << 20] * 10000
n = int(input())
a = list(map(int, sys.stdin.readlines()))
if len(a)==n:a.pop()
for i in range(1, n) :
for j in range(i//2+1):
dp[j], dp[i - j] = map(min, [(dp[j], dp[i - j] + a[i - 1]), (dp[i - j], dp[j] + a[i - 1])])
p... | dp=[0]+[1<<20]*10000
n=int(input())
for i in range(1,n):
a=int(input())
for j in range(i//2+1):
if dp[j]>dp[i-j]+a:dp[j]=dp[i-j]+a
if dp[i-j]>dp[j]+a:dp[i-j]=dp[j]+a
print(dp[n//2]) | s762863200 | s965833590 | p00473 | python | Runtime Error |
dp=[0]+[1<<20]*10000
n=int(input())
for i in range(1,n):
a=int(input())
for j in range(i//2+1):
dp[j],dp[i-j]=map(min,[(dp[j],dp[i-j]+a),(dp[i-j],dp[j]+a)])
print(dp[n//2])
try:raise RuntimeError
except:exit() | dp=[0]+[1<<20]*10000
n=int(input())
for i in range(1,n):
a=int(input())
for j in range(i//2+1):
if dp[j]>dp[i-j]+a:dp[j]=dp[i-j]+a
if dp[i-j]>dp[j]+a:dp[i-j]=dp[j]+a
print(dp[n//2]) | s342568110 | s965833590 | p00473 | python | Runtime Error |
dp=[0]+[1<<20]*10000
n=int(input())
for i in range(1,n):
a=int(input())
for j in range(i//2+1):
dp[j],dp[i-j]=map(min,[(dp[j],dp[i-j]+a),(dp[i-j],dp[j]+a)])
print(dp[n//2])
exit() | dp=[0]+[1<<20]*10000
n=int(input())
for i in range(1,n):
a=int(input())
for j in range(i//2+1):
if dp[j]>dp[i-j]+a:dp[j]=dp[i-j]+a
if dp[i-j]>dp[j]+a:dp[i-j]=dp[j]+a
print(dp[n//2]) | s885014037 | s965833590 | p00473 | python | Runtime Error |
dp=[0]+[1<<20]*10000
n=int(input())
c=0
for i in range(1,n):
if c==n-1:break
a=int(input())
c+=1
for j in range(i//2+1):
dp[j],dp[i-j]=map(min,[(dp[j],dp[i-j]+a),(dp[i-j],dp[j]+a)])
print(dp[n//2]) | dp=[0]+[1<<20]*10000
n=int(input())
for i in range(1,n):
a=int(input())
for j in range(i//2+1):
if dp[j]>dp[i-j]+a:dp[j]=dp[i-j]+a
if dp[i-j]>dp[j]+a:dp[i-j]=dp[j]+a
print(dp[n//2]) | s742683095 | s965833590 | p00473 | python | Runtime Error |
c,d=map(int,input().split())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
e=0;i=0
while i<d-e:
p=i;q=0
for j in range(c):
if a[j]==b[p]:q+=1;p+=1
e=max(e,q)
i+=1
print(e) | s=list(map(int,input().split()))
if len(s)>1:c=s[0];d=s[1]
else:c=s[0];d=int(input())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
e=0;i=0
while i<d-e:
p=i;q=0
for j in range(c):
if a[j]==b[p]:q+=1;p+=1
e=max(e,q)
i+=1
print(e) | s432954913 | s723702478 | p00495 | python | Runtime Error |
s=map(int,input().split())
if len(s)==2:c=s[0];d=s[1]
else:c=s[0];d=int(input())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
e=0;i=0
while i<d-e:
p=i;q=0
for j in range(c):
if a[j]==b[p]:q+=1;p+=1
e=max(e,q)
i+=1
print(e) | s=list(map(int,input().split()))
if len(s)>1:c=s[0];d=s[1]
else:c=s[0];d=int(input())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
e=0;i=0
while i<d-e:
p=i;q=0
for j in range(c):
if a[j]==b[p]:q+=1;p+=1
e=max(e,q)
i+=1
print(e) | s383995171 | s723702478 | p00495 | python | Runtime Error |
try:c,d=int(input().split())
except:d=int(input())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
e=0;i=0
while i<d-e:
p=i;q=0
for j in range(c):
if a[j]==b[p]:q+=1;p+=1
e=max(e,q)
i+=1
print(e) | s=list(map(int,input().split()))
if len(s)>1:c=s[0];d=s[1]
else:c=s[0];d=int(input())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
e=0;i=0
while i<d-e:
p=i;q=0
for j in range(c):
if a[j]==b[p]:q+=1;p+=1
e=max(e,q)
i+=1
print(e) | s922854014 | s723702478 | p00495 | python | Runtime Error |
try:c,d=map(int,input().split())
except:d=int(input())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
e=0;i=0
while i<d-e:
p=i;q=0
for j in range(c):
if a[j]==b[p]:q+=1;p+=1
e=max(e,q)
i+=1
print(e) | s=list(map(int,input().split()))
if len(s)>1:c=s[0];d=s[1]
else:c=s[0];d=int(input())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
e=0;i=0
while i<d-e:
p=i;q=0
for j in range(c):
if a[j]==b[p]:q+=1;p+=1
e=max(e,q)
i+=1
print(e) | s800005462 | s723702478 | p00495 | python | Runtime Error |
try:c,d=map(int,input().split())
except:c,d=5000;input()
a=list(map(int,input().split()))
b=list(map(int,input().split()))
e=0;i=0
while i<d-e:
p=i;q=0
for j in range(c):
if a[j]==b[p]:q+=1;p+=1
e=max(e,q)
i+=1
print(e) | s=list(map(int,input().split()))
if len(s)>1:c=s[0];d=s[1]
else:c=s[0];d=int(input())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
e=0;i=0
while i<d-e:
p=i;q=0
for j in range(c):
if a[j]==b[p]:q+=1;p+=1
e=max(e,q)
i+=1
print(e) | s867638355 | s723702478 | p00495 | python | Runtime Error |
a=[['\'',',','.','!','?'],
['a','b','c','A','B','C'],
['d','e','f','D','E','F'],
['g','h','i','G','H','I'],
['j','k','l','J','K','L'],
['m','n','o','M','N','O'],
['p','q','r','s','P','Q','R','S'],
['t','u','v','T','U','V'],
['w','x','y','z','W','X','Y','Z']]
while 1:
try:b=input()+'@'
ex... | a=[['\'',',','.','!','?'],
['a','b','c','A','B','C'],
['d','e','f','D','E','F'],
['g','h','i','G','H','I'],
['j','k','l','J','K','L'],
['m','n','o','M','N','O'],
['p','q','r','s','P','Q','R','S'],
['t','u','v','T','U','V'],
['w','x','y','z','W','X','Y','Z']]
while 1:
try:b=input()+'@'
ex... | s030028078 | s010968028 | p00589 | python | Time Limit Exceeded |
while 1:
n=int(input())
if n==0:break
a=0
for i in range(1,n//2):a+=(n+2*i-1)//(2*i)-1
print(8*(2*n-1+a)) | while 1:
n=int(input())
if n==0:break
a=0;i=1;b=n//2
while i*i<b:a+=((b-1)//i+1)-i-1;i+=1
a=(a+b-1)*2+i
print(8*(a+n)) | s303342762 | s066893188 | p00612 | python | Time Limit Exceeded |
dp=[.0]*100001
dp[1]=1.
for i in range(2,100001):
a,b,j=.5,1,1
while j<i and b> 1e-5:
dp[i]+=b*(1-a)*(j+dp[i-j-1])
b*=al;a/=2;j+=1
dp[i]+=i*b
while 1:
n=int(input())
if n==0:break
print(dp[n]) | dp=[.0]*100001
dp[1]=1.
for i in range(2,100001):
a,b,j=.5,1,1
while j<i and b>1e-15:
dp[i]+=b*(1-a)*(j+dp[i-j-1])
b*=a;a/=2;j+=1
dp[i]+=i*b
while 1:
n=int(input())
if n==0:break
print(dp[n]) | s267841020 | s068220498 | p00642 | python | Runtime Error |
while 1:
n,s=map(int,input().split())
if not n:break
a=sorted([int(input()) for _ in range(n)],reverse=1)
b=0
try:
for i in range(n):
for j in range(i+1,n):
if a[i]+a[j]>s:b+=1
else:raise Exception;pass
except:pass
print(b) | while 1:
n,s=map(int,input().split())
if n==0:break
r=[0]*101
for _ in [0]*n:r[int(input())]+=1
a=0
for i in range(101):
if i*2>s:a+=(r[i]**2-r[i])//2
a+=r[i]*sum(r[j] for j in range(max(i+1,s+1-i),101))
print(a) | s590014657 | s734147149 | p00670 | python | Time Limit Exceeded |
while 1:
n,s=map(int,input().split())
if not n:break
a=sorted([int(input()) for _ in range(n)],reverse=1)
b=0
for i in range(n):
try:
for j in range(i+1,n):
if a[i]+a[j]>s:b+=1
else:raise Exception;break
except:break
print(b) | while 1:
n,s=map(int,input().split())
if n==0:break
r=[0]*101
for _ in [0]*n:r[int(input())]+=1
a=0
for i in range(101):
if i*2>s:a+=(r[i]**2-r[i])//2
a+=r[i]*sum(r[j] for j in range(max(i+1,s+1-i),101))
print(a) | s018976877 | s734147149 | p00670 | python | Time Limit Exceeded |
while 1:
n,s=map(int,input().split())
if not n:break
a=sorted([int(input()) for _ in range(n)],reverse=1)
b=0
for i in range(n):
for j in range(i+1,n):
if a[i]+a[j]>s:b+=1
else:break
if a[i]+a[j]<=s:break
print(b) | while 1:
n,s=map(int,input().split())
if n==0:break
r=[0]*101
for _ in [0]*n:r[int(input())]+=1
a=0
for i in range(101):
if i*2>s:a+=(r[i]**2-r[i])//2
a+=r[i]*sum(r[j] for j in range(max(i+1,s+1-i),101))
print(a) | s837858417 | s734147149 | p00670 | python | Time Limit Exceeded |
def f(x,y):
a[y][x]='0'
for dx,dy in[[-1,0],[1,0],[0,-1],[0,1],[-1,-1],[1,-1],[-1,1],[1,1]]:
dx+=x;dy+=y
if 0<=dx<w and 0<=dy<h and a[dy][dx]=='1':f(dx,dy)
while 1:
w,h=map(int,input().split())
if w==0:break
a=[list(input().split()) for _ in[0]*h];b=0
for i in range(w):
f... | import sys
sys.setrecursionlimit(10000)
def f(x,y):
if 0<=x<w and 0<=y<h and a[y][x]=='1':
a[y][x]='0'
for dx,dy in[[-1,0],[1,0],[0,-1],[0,1],[-1,-1],[1,-1],[-1,1],[1,1]]:f(x+dx,y+dy)
while 1:
w,h=map(int,input().split())
if w==0:break
a=[input().split() for _ in[0]*h];b=0
for i in r... | s428399193 | s105006186 | p00741 | python | Runtime Error |
import sys
sys.setrecursionlimit(1<<32)
def f(x,y):
a[y][x]='0'
for dx,dy in[[-1,0],[1,0],[0,-1],[0,1],[-1,-1],[1,-1],[-1,1],[1,1]]:
dx+=x;dy+=y
if 0<=dx<w and 0<=dy<h and a[dy][dx]=='1':f(dx,dy)
while 1:
w,h=map(int,input().split())
if w==0:break
a=[list(input().split()) for _ in[0]... | import sys
sys.setrecursionlimit(10000)
def f(x,y):
if 0<=x<w and 0<=y<h and a[y][x]=='1':
a[y][x]='0'
for dx,dy in[[-1,0],[1,0],[0,-1],[0,1],[-1,-1],[1,-1],[-1,1],[1,1]]:f(x+dx,y+dy)
while 1:
w,h=map(int,input().split())
if w==0:break
a=[input().split() for _ in[0]*h];b=0
for i in r... | s677201114 | s105006186 | p00741 | python | Runtime Error |
for i in range(2,1201):
for j in range(2,int(i**0.5)+1):
if not i%j:break
else:p+=[i]
dp=[[0]*1200 for _ in range(15)]
dp[0][0]=1
for x,y in enumerate(p):
for i in range(min(x+1,14),0,-1):
for j in range(p[x],1200):
dp[i][j]+=dp[i-1][j-y]
while 1:
n,k=map(int,input().split())... | p=[]
for i in range(2,1121):
for j in range(2,int(i**0.5)+1):
if not i%j:break
else:p+=[i]
dp=[[0]*1121 for _ in range(15)]
dp[0][0]=1
for x,y in enumerate(p):
for i in range(min(x+1,14),0,-1):
for j in range(y,1121):
dp[i][j]+=dp[i-1][j-y]
while 1:
n,k=map(int,input().split(... | s324953152 | s147932943 | p00848 | python | Runtime Error |
while 1:
n=int(input())
if n==0:break
x=y=10
b=[list(map(int,input().split())) for _ in range(n)]
print(b)
for i,j in [input().split() for _ in range(int(input()))]:
for _ in range(int(j)):
if 'N'<=i<='S': y+=1 if i=='N' else -1
else: x+=1 if i=='E' else -1
... | while 1:
n=int(input())
if n==0:break
x=y=10
b=[list(map(int,input().split())) for _ in range(n)]
for i,j in [input().split() for _ in range(int(input()))]:
for _ in range(int(j)):
if 'N'<=i<='S': y+=1 if i=='N' else -1
else: x+=1 if i=='E' else -1
if [x,y... | s876620110 | s575627368 | p01125 | python | Runtime Error |
while 1:
n=int(input())
if n==0:break
x=y=10
b=[list(map(int,input().split())) for _ in range(n)]
for i,j in [input().split() for _ in range(int(input()))]:
for _ in range(int(j)):
if 'N'<=i<='S': y+=1 if i=='N' else -1
else: x+=1 if i=='E' else -1
if [x,y... | while 1:
n=int(input())
if n==0:break
x=y=10
b=[list(map(int,input().split())) for _ in range(n)]
for i,j in [input().split() for _ in range(int(input()))]:
for _ in range(int(j)):
if 'N'<=i<='S': y+=1 if i=='N' else -1
else: x+=1 if i=='E' else -1
if [x,y... | s778957062 | s575627368 | p01125 | python | Runtime Error |
def f(p):
return sum([n for n in range(1,p) if p%n==0])
while 1:
n=int(input())
if n==0:break
m=f(n)
if n==m:print('perfect number')
else: print('deficient number' if n>m else 'abundant number') | def f(p):
ans=1
if p<=5: return 0
for n in range(2,int(p**0.5)+1):
if p%n==0:
if n!=p//n:ans+=n+p//n
else:ans+=n
return ans
while 1:
n=int(input())
if n==0:break
m=f(n)
if n==m:print('perfect number')
else: print('deficient number' if n>m else 'abunda... | s485330596 | s143786049 | p01224 | python | Time Limit Exceeded |
def f(p):
ans=0
for n in range(1,p):
if p%n==0:ans+=n
return ans
while 1:
n=int(input())
if n==0:break
m=f(n)
if n==m:print('perfect number')
else: print('deficient number' if n>m else 'abundant number') | def f(p):
ans=1
if p<=5: return 0
for n in range(2,int(p**0.5)+1):
if p%n==0:
if n!=p//n:ans+=n+p//n
else:ans+=n
return ans
while 1:
n=int(input())
if n==0:break
m=f(n)
if n==m:print('perfect number')
else: print('deficient number' if n>m else 'abunda... | s980805248 | s143786049 | p01224 | python | Time Limit Exceeded |
def f(p):
ans=0
if p<=5: return ans
for n in range(1,int(p/2)+1):
if p%n==0:ans+=n
return ans
while 1:
n=int(input())
if n==0:break
m=f(n)
if n==m:print('perfect number')
else: print('deficient number' if n>m else 'abundant number') | def f(p):
ans=1
if p<=5: return 0
for n in range(2,int(p**0.5)+1):
if p%n==0:
if n!=p//n:ans+=n+p//n
else:ans+=n
return ans
while 1:
n=int(input())
if n==0:break
m=f(n)
if n==m:print('perfect number')
else: print('deficient number' if n>m else 'abunda... | s396759379 | s143786049 | p01224 | python | Time Limit Exceeded |
while 1:
n,a,b=map(int,input().split())
if n==a==b==0:break
c=0;d=[1]*(n+1)
for x in range(a):
for i in range(x*b,n+1,a):d[i]=0
print(sum(d)) | import re
while 1:
n,m=map(int,input().split())
if n==0:break
p=[];s=0
for _ in [0]*n:
n,M=input().replace('*','[0-9]').split()
p.append([re.compile(n),int(M)])
for _ in [0]*m:
l=input()
for n,M in p:
if n.search(l):
s+=M;break
print(s) | s917393934 | s352496570 | p01322 | python | Runtime Error |
x=0
for _ in range(int(input())):
o,y=map(int,input().split())
if o==1:x+=y
elif o==2:x-=y
elif o==3:x*=y
else:x/=y
print(int(x)) | m=10000000019
x=0
def mod(x):return (x%m+m)%m
def pow(x,a):
ret=1
while a:
if(a&1):ret=mod(x*ret)
x=mod(x*x)
a>>=1
return ret
for _ in range(int(input())):
o,y=map(int,input().split())
if o==1:x=(x+y)%m
elif o==2:x=(x-y)%m
elif o==3:x=mod(x*y)
else:x=mod(x*pow(y,... | s161552118 | s074355239 | p01470 | python | Runtime Error |
import itertools
c=0;b=[]
for x in itertools.permutations(input()):
if x not in b and x==x[::-1]:c+=1;b+=[x]
print(c) | import collections
from math import *
s=input()
a=collections.Counter(s)
o=0
for x in a:
if a[x]&1:
o+=1
if o>1:print(0);break
a[x]-=1
else:
b=factorial(len(s)//2)
for x in a.values():
b//=factorial(x//2)
print(b) | s526496996 | s606835345 | p01473 | python | Time Limit Exceeded |
input()
a=list(map(int,input().split()))
m=int(input())
b,c=[list(map(int,input().split())) for _ in [0,0]]
[print(['Yes','No'][sum([j for j in a if j<=b[i]])<c[i]])for i in range(m)] | import bisect
n=int(input())
a=sorted(list(map(int,input().split())))
d=[0]*(n+1)
for i in range(1,n+1):d[i]=d[i-1]+a[i-1]
m=int(input())
b,c=[list(map(int,input().split())) for _ in [0,0]]
[print(['Yes','No'][d[bisect.bisect_right(a,b[i])]<c[i]]) for i in range(m)] | s951048047 | s116742029 | p01767 | python | Time Limit Exceeded |
input()
a=list(map(int,input().split()))
d=[0]*(max(a)+1)
for i in a:d[i]=i*a.count(i)+d[i-1]
m=int(input())
b,c=[list(map(int,input().split())) for _ in [0,0]]
[print(['Yes','No'][d[b[i]]<c[i]])for i in range(m)] | import bisect
n=int(input())
a=sorted(list(map(int,input().split())))
d=[0]*(n+1)
for i in range(1,n+1):d[i]=d[i-1]+a[i-1]
m=int(input())
b,c=[list(map(int,input().split())) for _ in [0,0]]
[print(['Yes','No'][d[bisect.bisect_right(a,b[i])]<c[i]]) for i in range(m)] | s887430733 | s116742029 | p01767 | python | Time Limit Exceeded |
while 1:
s=input()
if s=='#':break
p=0
e=[[],[]]
for x in s:
if x=='b':e[p]+=['b']
elif x=='/':p+=1
else:
for j in range(int(x)):e[p]+=['.']
ans=''
a,b,c,d=map(int,input().split())
e[a-1][b-1],e[c-1][d-1]=e[c-1][d-1],e[a-1][b-1]
for i in range(2):
... | while 1:
s=input()
if '#' in s:break
p=0
e=[[]*2 for _ in range(10)]
for x in s:
if x=='b':e[p]+=['b']
elif x=='/':p+=1
else:e[p]+='.'*int(x)
ans=''
a,b,c,d=map(int,input().split())
e[a-1][b-1],e[c-1][d-1]=e[c-1][d-1],e[a-1][b-1]
for i in range(p+1):
i... | s367307748 | s560604177 | p01846 | python | Runtime Error |
while 1:
s=input()
if s=='#':break
p=0
e=[[],[]]
for x in s:
if x=='b':e[p]+=['b']
elif x=='/':p+=1
else:
for j in range(int(x)):e[p]+=['.']
ans=''
a,b,c,d=map(int,input().split())
e[a-1][b-1]='.'
e[c-1][d-1]='b'
for i in range(2):
if i... | while 1:
s=input()
if '#' in s:break
p=0
e=[[]*2 for _ in range(10)]
for x in s:
if x=='b':e[p]+=['b']
elif x=='/':p+=1
else:e[p]+='.'*int(x)
ans=''
a,b,c,d=map(int,input().split())
e[a-1][b-1],e[c-1][d-1]=e[c-1][d-1],e[a-1][b-1]
for i in range(p+1):
i... | s545174551 | s560604177 | p01846 | python | Runtime Error |
import bisect
a=[]
def f(n,p):
m=-1<<20
x=bisect.bisect_left(a,n)
if a[x]==n:m=1
if a[p]**2>n:return m
if n%a[p]==0:m=f(n//a[p],p)+1
return max(m,f(n,p+1))
for i in range(1,19):
for j in range(1<<i):
b=''
for k in range(i):
if (j//(1<<k))%2:b+='2'
els... | import bisect
import sys
sys.setrecursionlimit(10000)
a=[]
def f(a,bin,n):
if bin>n:return
if bin:a+=[bin]
f(a,bin*10+2,n)
f(a,bin*10+8,n)
def g(n,p):
m=-1<<20
x=bisect.bisect_left(a,n)
if x!=len(a) and a[x]==n:m=1
if a[p]**2>n:return m
if n%a[p]==0:m=g(n//a[p],p)+1
return max(m... | s201330467 | s040508531 | p01869 | python | Runtime Error |
import bisect
a=[]
def f(n,p):
m=-1<<20
x=bisect.bisect_left(a,n)
if a[x]==n and x!=len(a):m=1
if a[p]**2>n:return m
if n%a[p]==0:m=f(n//a[p],p)+1
return max(m,f(n,p+1))
for i in range(1,19):
for j in range(1<<i):
b=''
for k in range(i):
if (j//(1<<k))%2:b+='2'
... | import bisect
import sys
sys.setrecursionlimit(10000)
a=[]
def f(a,bin,n):
if bin>n:return
if bin:a+=[bin]
f(a,bin*10+2,n)
f(a,bin*10+8,n)
def g(n,p):
m=-1<<20
x=bisect.bisect_left(a,n)
if x!=len(a) and a[x]==n:m=1
if a[p]**2>n:return m
if n%a[p]==0:m=g(n//a[p],p)+1
return max(m... | s326533131 | s040508531 | p01869 | python | Runtime Error |
import bisect
a=[]
def f(a,bin,n):
if bin>n:return
if bin:a+=[bin]
f(a,bin*10+2,n)
f(a,bin*10+8,n)
def g(n,p):
m=-1<<20
x=bisect.bisect_left(a,n)
if x!=len(a) and a[x]==n:m=1
if a[p]**2>n:return m
if n%a[p]==0:m=g(n//a[p],p)+1
return max(m,g(n,p+1))
n=int(input())
if n&1:print(... | import bisect
import sys
sys.setrecursionlimit(10000)
a=[]
def f(a,bin,n):
if bin>n:return
if bin:a+=[bin]
f(a,bin*10+2,n)
f(a,bin*10+8,n)
def g(n,p):
m=-1<<20
x=bisect.bisect_left(a,n)
if x!=len(a) and a[x]==n:m=1
if a[p]**2>n:return m
if n%a[p]==0:m=g(n//a[p],p)+1
return max(m... | s324658831 | s040508531 | p01869 | python | Runtime Error |
import bisect
a=[]
def f(a,bin,n):
if bin>n:return
if bin:a+=[bin]
f(a,bin*10+2,n)
f(a,bin*10+8,n)
def g(n,p):
m=-1<<20
x=bisect.bisect_left(a,n)
if x!=len(a) and a[x]==n:m=1
if a[p]**2>n:return m
if n%a[p]==0:m=g(n//a[p],p)+1
return max(m,g(n,p+1))
n=int(input())
if n&1:print(... | import bisect
import sys
sys.setrecursionlimit(10000)
a=[]
def f(a,bin,n):
if bin>n:return
if bin:a+=[bin]
f(a,bin*10+2,n)
f(a,bin*10+8,n)
def g(n,p):
m=-1<<20
x=bisect.bisect_left(a,n)
if x!=len(a) and a[x]==n:m=1
if a[p]**2>n:return m
if n%a[p]==0:m=g(n//a[p],p)+1
return max(m... | s307987195 | s040508531 | p01869 | python | Runtime Error |
import bisect
a=[]
def f(a,bin,n):
if bin>n:return
if bin:a+=[bin]
f(a,bin*10+2,n)
f(a,bin*10+8,n)
def g(n,p):
m=-1<<20
x=bisect.bisect_left(a,n)
if p>len(a):return m
if x!=len(a) and a[x]==n:m=1
if a[p]**2>n:return m
if n%a[p]==0:m=g(n//a[p],p)+1
return max(m,g(n,p+1))
n=i... | import bisect
import sys
sys.setrecursionlimit(10000)
a=[]
def f(a,bin,n):
if bin>n:return
if bin:a+=[bin]
f(a,bin*10+2,n)
f(a,bin*10+8,n)
def g(n,p):
m=-1<<20
x=bisect.bisect_left(a,n)
if x!=len(a) and a[x]==n:m=1
if a[p]**2>n:return m
if n%a[p]==0:m=g(n//a[p],p)+1
return max(m... | s350771477 | s040508531 | p01869 | python | Runtime Error |
t=input();p=input()
for i in range(len(t)):
if t[i:].startwith(p):print(i) | t=input();p=input()
[print(i)for i in range(len(t))if t[i:].startswith(p)] | s126036137 | s347978286 | p02247 | python | Runtime Error |
t=input();p=input()
[print(i)for i in range(len(t))if t[i:].startswith(p)] | s=input();t=input()
[print(x) for x in range(len(s)-len(t)+1) if s[x:x+len(t)]==t] | s613848148 | s322281124 | p02248 | python | Time Limit Exceeded |
t=input();p=input()
[print(i)for i in range(len(t)-len(p)+1)if t[i:].startswith(p)] | s=input();t=input()
[print(x) for x in range(len(s)-len(t)+1) if s[x:x+len(t)]==t] | s213966952 | s322281124 | p02248 | python | Time Limit Exceeded |
a=[]
for _ in range(int(input())):
b=input().split()
if len(b)>1:c=int(b[1])
b=b[0]
if b[0]=='i':a=[c]+a
elif len(b)>10:a=a[1:]
elif len(b)>6:a.pop()
else:
try:a.remove(c)
except:pass
print(*a) | import collections
a=collections.deque()
for _ in range(int(input())):
b=input()
if b[0]=='i':a.appendleft(b[7:])
elif b[6]==' ':
try:a.remove(b[7:])
except:pass
elif len(b)>10:a.popleft()
elif len(b)>6:a.pop()
print(*a) | s611952074 | s308197425 | p02265 | python | Time Limit Exceeded |
import collections
a=collections.deque()
for _ in range(int(input())):
b=input().split()
if len(b)>1:c=int(b[1])
b=b[0]
if b[0]=='i':a.appendleft(c)
elif len(b)>10:a.popleft()
elif len(b)>6:a.pop()
else:
try:a.remove(c)
except:pass
print(*a) | import collections
a=collections.deque()
for _ in range(int(input())):
b=input()
if b[0]=='i':a.appendleft(b[7:])
elif b[6]==' ':
try:a.remove(b[7:])
except:pass
elif len(b)>10:a.popleft()
elif len(b)>6:a.pop()
print(*a) | s238747550 | s308197425 | p02265 | python | Time Limit Exceeded |
a=[]
while 1:
b=input()
if b[2]=='d':break
if b[0]=='i':a+=[int(b[7:])]
else:a.sort();print(a[-1]);a.pop() | from heapq import *
a=[]
while 1:
b=input()
if b[2]=='d':break
if b[0]=='i':heappush(a,-int(b[7:]))
else:print(-heappop(a)) | s568422445 | s948306470 | p02289 | python | Time Limit Exceeded |
a=[]
while 1:
b=input()
if b[2]=='d':break
if b[0]=='i':a+=[int(b[7:])]
else:c=max(a);print(c);a.remove(c) | from heapq import *
a=[]
while 1:
b=input()
if b[2]=='d':break
if b[0]=='i':heappush(a,-int(b[7:]))
else:print(-heappop(a)) | s214697903 | s948306470 | p02289 | python | Time Limit Exceeded |
from math import pi
r=int(input())
print("{} {}".format(r*r*pi,2*pi*r)) | from math import pi
r=float(input())
print("{} {}".format(r*r*pi,2*pi*r)) | s066309110 | s908187800 | p02400 | python | Runtime Error |
input()
a=list(map(int,input().split()))
m=max(a)
i,f=1,0
while i:
for j in a:
if (m*i)%j:break
if j==a[-1]: f=1
if f:break
i+=1
print(m*i) | def gcd(a,b):
while b:a,b=b,a%b
return a
def lcm(a,b):
return a//gcd(a,b)*b
input()
a=list(map(int,input().split()))
b=1
for i in a:
b=lcm(b,i)
print(b) | s134461334 | s879561991 | p02469 | python | Time Limit Exceeded |
n=int(input())
m=n;i=2
while i<=n and m!=1:
if not m%i:
n=n*(i-1)//i
while not m%i:m//=i
i+=1
print(n) | n=m=int(input())
i=2
while i*i<=n:
if n%i==0:
m=m//i*(i-1)
while n%i==0: n//=i
i+=1
if n!=1:m=m//n*(n-1)
print(m) | s095550498 | s094757959 | p02470 | python | Time Limit Exceeded |
n=m=int(input())
i=2
while i<=n and m!=1:
if m%i==0:
n=n*(i-1)//i
while m%i==0: m//=i
i+=1
print(n) | n=m=int(input())
i=2
while i*i<=n:
if n%i==0:
m=m//i*(i-1)
while n%i==0: n//=i
i+=1
if n!=1:m=m//n*(n-1)
print(m) | s385341181 | s094757959 | p02470 | python | Time Limit Exceeded |
input()
s=list(map(int,input().split()))
input()
t=list(map(int,input().split()))
c=0
for x in t:
if x in s:c+=1
print(c) | input()
s=set(list(map(int,input().split())))
input()
t=set(list(map(int,input().split())))
print(len(s&t)) | s098167025 | s487233233 | p02526 | python | Time Limit Exceeded |
def ReversePolishNotation(string):
priority = {"Sentinel": 0, "(": 0, "+": 1, "-": 1, "*": 2, "/": 2}
stack = []
signStack = ["Sentinel"]
inputCountent = string[:-1]
for item in string[:-1]:
if item == "(":
signStack.append(item)
elif item == ")":
while si... | def ReversePolishNotation(string):
priority = {"(": 0, ")": 0, "+": 1, "-": 1, "*": 2, "/": 2}
stack = []
signStack = []
isContinue = False
for item in string[:-1]:
if str.isdigit(item):
if not isContinue:
stack.append(item)
isContinue = True
... | s109811375 | s338953709 | p00109 | python | Runtime Error |
def ReversePolishNotation(string):
priority = {"Sentinel": 0, "(": 0, "+": 1, "-": 1, "*": 2, "/": 2}
stack = []
signStack = ["Sentinel"]
inputCountent = string[:-1]
for item in string[:-1]:
if item == "(":
signStack.append(item)
elif item == ")":
while si... | def ReversePolishNotation(string):
priority = {"(": 0, ")": 0, "+": 1, "-": 1, "*": 2, "/": 2}
stack = []
signStack = []
isContinue = False
for item in string[:-1]:
if str.isdigit(item):
if not isContinue:
stack.append(item)
isContinue = True
... | s048420818 | s338953709 | p00109 | python | Runtime Error |
def ReversePolishNotation(string):
priority = {"Sentinel": 0, "(": 0, "+": 1, "-": 1, "*": 2, "/": 2}
stack = []
signStack = ["Sentinel"]
for item in string[:-1]:
if item == "(":
signStack.append(item)
elif item == ")":
while signStack[-1] != "(":
... | def ReversePolishNotation(string):
priority = {"(": 0, ")": 0, "+": 1, "-": 1, "*": 2, "/": 2}
stack = []
signStack = []
isContinue = False
for item in string[:-1]:
if str.isdigit(item):
if not isContinue:
stack.append(item)
isContinue = True
... | s609592720 | s338953709 | p00109 | python | Runtime Error |
def ReversePolishNotation(string):
priority = {"Sentinel": 0, "(": 0, "+": 1, "-": 1, "*": 2, "/": 2}
stack = []
signStack = ["Sentinel"]
for item in string[:-1]:
if item == "(":
signStack.append(item)
elif item == ")":
while signStack[-1] != "(":
... | def ReversePolishNotation(string):
priority = {"(": 0, ")": 0, "+": 1, "-": 1, "*": 2, "/": 2}
stack = []
signStack = []
isContinue = False
for item in string[:-1]:
if str.isdigit(item):
if not isContinue:
stack.append(item)
isContinue = True
... | s359463605 | s338953709 | p00109 | python | Runtime Error |
def ReversePolishNotation(string):
priority = {"Sentinel": 0, "(": 0, "+": 1, "-": 1, "*": 2, "/": 2}
stack = []
signStack = ["Sentinel"]
for item in string[:-1]:
if item == "(":
signStack.append(item)
elif item == ")":
while signStack[-1] != "(":
... | def ReversePolishNotation(string):
priority = {"(": 0, ")": 0, "+": 1, "-": 1, "*": 2, "/": 2}
stack = []
signStack = []
isContinue = False
for item in string[:-1]:
if str.isdigit(item):
if not isContinue:
stack.append(item)
isContinue = True
... | s877131568 | s338953709 | p00109 | python | Runtime Error |
def ReversePolishNotation(string):
priority = {"Sentinel": 0, "(": 0, "+": 1, "-": 1, "*": 2, "/": 2}
stack = []
signStack = ["Sentinel"]
for item in string[:-1]:
if item == "(":
signStack.append(item)
elif item == ")":
while signStack[-1] != "(":
... | def ReversePolishNotation(string):
priority = {"(": 0, ")": 0, "+": 1, "-": 1, "*": 2, "/": 2}
stack = []
signStack = []
isContinue = False
for item in string[:-1]:
if str.isdigit(item):
if not isContinue:
stack.append(item)
isContinue = True
... | s727218689 | s338953709 | p00109 | python | Runtime Error |
def ReversePolishNotation(string):
priority = {"Sentinel": 0, "(": 0, "+": 1, "-": 1, "*": 2, "/": 2}
stack = []
signStack = ["Sentinel"]
for item in string[:-1]:
if item == "(":
signStack.append(item)
elif item == ")":
while signStack[-1] != "(":
... | def ReversePolishNotation(string):
priority = {"(": 0, ")": 0, "+": 1, "-": 1, "*": 2, "/": 2}
stack = []
signStack = []
isContinue = False
for item in string[:-1]:
if str.isdigit(item):
if not isContinue:
stack.append(item)
isContinue = True
... | s524729517 | s338953709 | p00109 | python | Runtime Error |
import sys
convert = {"1": {"1": "a", "2": "b", "3": "c", "4": "d", "5": "e"},
"2": {"1": "f", "2": "g", "3": "h", "4": "i", "5": "j"},
"3": {"1": "k", "2": "l", "3": "m", "4": "n", "5": "o"},
"4": {"1": "p", "2": "q", "3": "r", "4": "s", "5": "t"},
"5": {"1": "u", "2": "v",... | import sys
convert = {"1": {"1": "a", "2": "b", "3": "c", "4": "d", "5": "e"},
"2": {"1": "f", "2": "g", "3": "h", "4": "i", "5": "j"},
"3": {"1": "k", "2": "l", "3": "m", "4": "n", "5": "o"},
"4": {"1": "p", "2": "q", "3": "r", "4": "s", "5": "t"},
"5": {"1": "u", "2": "v",... | s795500515 | s226097070 | p00127 | python | Runtime Error |
import sys
convert = {"1": {"1": "a", "2": "b", "3": "c", "4": "d", "5": "e"},
"2": {"1": "f", "2": "g", "3": "h", "4": "i", "5": "j"},
"3": {"1": "k", "2": "l", "3": "m", "4": "n", "5": "o"},
"4": {"1": "p", "2": "q", "3": "r", "4": "s", "5": "t"},
"5": {"1": "u", "2": "v",... | import sys
convert = {"1": {"1": "a", "2": "b", "3": "c", "4": "d", "5": "e"},
"2": {"1": "f", "2": "g", "3": "h", "4": "i", "5": "j"},
"3": {"1": "k", "2": "l", "3": "m", "4": "n", "5": "o"},
"4": {"1": "p", "2": "q", "3": "r", "4": "s", "5": "t"},
"5": {"1": "u", "2": "v",... | s007473206 | s226097070 | p00127 | python | Runtime Error |
import heapq
from collections import namedtuple
Data = namedtuple("Data", ("time", "number"))
all_player = []
for _ in range(3):
player = [input().split(" ") for lp in range(8)]
player = [Data(float(time), number) for number, time in player]
heapq.heapify(player)
data = heapq.heappop(player)
pri... | import heapq
from collections import namedtuple
Data = namedtuple("Data", "time number")
all_player = []
for _ in range(3):
player = [input().split(" ") for lp in range(8)]
player = [Data(float(time), number) for number, time in player]
heapq.heapify(player)
data = heapq.heappop(player)
print(da... | s049377538 | s286546461 | p00138 | python | Runtime Error |
import array
import bisect
def is_prime_number(num):
limit = int(num ** 0.5)
for lp in range(3, limit + 1, 2):
if num % lp == 0:
return False
return True
LENGTH = 1000000
prime_number_list = array.array("i", [True] * (LENGTH + 1))
prime_number_list[0] = False
prime_number_list[1] ... | import array
def is_prime_number(num):
limit = int(num ** 0.5)
for lp in range(3, limit + 1, 2):
if num % lp == 0:
return False
return True
LENGTH = 1000000
prime_number_list = array.array("i", [True] * (LENGTH + 1))
prime_number_list[0] = False
prime_number_list[1] = False
for l... | s221621329 | s321654194 | p00185 | python | Runtime Error |
import array
import bisect
def is_prime_number(num):
limit = int(num ** 0.5)
for lp in range(3, limit + 1, 2):
if num % lp == 0:
return False
return True
def binary_search(num_list, num):
left = 0
right = len(num_list)
while left <= right:
mid = (left + right) ... | import array
def is_prime_number(num):
limit = int(num ** 0.5)
for lp in range(3, limit + 1, 2):
if num % lp == 0:
return False
return True
LENGTH = 1000000
prime_number_list = array.array("i", [True] * (LENGTH + 1))
prime_number_list[0] = False
prime_number_list[1] = False
for l... | s322898441 | s321654194 | p00185 | python | Runtime Error |
import sys
nums = []
for line in sys.stdin:
nums.append(line)
for i in range(len(nums)):
input_line = nums[i].split(" ")
a = long(input_line[0])
b = long(input_line[1])
#??¬?´???°?????????
common_div = []
#?????§??¬?´???°
if a < b:
last_num = a
else:
last_num =... | import sys
nums = []
for line in sys.stdin:
nums.append(line)
for i in range(len(nums)):
input_line = nums[i].split(" ")
a = int(input_line[0])
b = int(input_line[1])
if a > b:
num_bigger = a
num_smaller = b
else:
num_bigger = b
num_smaller = a
r = ... | s736152788 | s298594543 | p00005 | python | Runtime Error |
import sys
nums = []
for line in sys.stdin:
nums.append(line)
for i in range(len(nums)):
input_line = nums[i].split(" ")
a = long(input_line[0])
b = long(input_line[1])
#??¬?´???°?????????
common_div = []
#?????§??¬?´???°
if a < b:
last_num = a
else:
last_num =... | import sys
nums = []
for line in sys.stdin:
nums.append(line)
for i in range(len(nums)):
input_line = nums[i].split(" ")
a = int(input_line[0])
b = int(input_line[1])
if a > b:
num_bigger = a
num_smaller = b
else:
num_bigger = b
num_smaller = a
r = ... | s277961873 | s298594543 | p00005 | python | Runtime Error |
import sys
nums = []
for line in sys.stdin:
nums.append(line)
for i in range(len(nums)):
input_line = nums[i].split(" ")
a = int(input_line[0])
b = int(input_line[1])
#??¬?´???°?????????
common_div = []
#?????§??¬?´???°
if a < b:
last_num = a
else:
last_num = b... | import sys
nums = []
for line in sys.stdin:
nums.append(line)
for i in range(len(nums)):
input_line = nums[i].split(" ")
a = int(input_line[0])
b = int(input_line[1])
if a > b:
num_bigger = a
num_smaller = b
else:
num_bigger = b
num_smaller = a
r = ... | s090272782 | s298594543 | p00005 | python | Runtime Error |
while True:
try:
n = int(input())
prime_cnt = 0
for i in range(2, n+1):
cnt = 0
for j in range(1,i):
if i % j == 0:
cnt = cnt + 1
if cnt == 1:
#?´???°
prime_cnt = pri... | #init
max_num = 1000000
is_prime_num = [True for i in range (max_num+1)]
#0, 1 --- not prime number
is_prime_num[0] = False
is_prime_num[1] = False
end = int(max_num ** .5)
for i in range(2, end+1):
if is_prime_num[i]:
for j in range(i*i, max_num+1, i):
is_prime_num[j] = False
while True:
... | s638814286 | s855445569 | p00009 | python | Time Limit Exceeded |
import math
while True:
try:
n = int(input())
prime_cnt = 0
for i in range(2, n+1):
cnt = 0
for j in range(2,i):
if i % j == 0:
cnt = cnt + 1
break
if cnt == 0:
... | #init
max_num = 1000000
is_prime_num = [True for i in range (max_num+1)]
#0, 1 --- not prime number
is_prime_num[0] = False
is_prime_num[1] = False
end = int(max_num ** .5)
for i in range(2, end+1):
if is_prime_num[i]:
for j in range(i*i, max_num+1, i):
is_prime_num[j] = False
while True:
... | s395150686 | s855445569 | p00009 | python | Time Limit Exceeded |
import math
def is_prime_num(in_num):
cnt = 0
if in_num == 2:
return True
elif in_num <= 1:
return False
elif in_num % 2 == 0:
return False
else:
max_num = int(math.sqrt(in_num))
for j in range(3, in_num, 2):
if in_num % j == 0:
cn... | #init
max_num = 1000000
is_prime_num = [True for i in range (max_num+1)]
#0, 1 --- not prime number
is_prime_num[0] = False
is_prime_num[1] = False
end = int(max_num ** .5)
for i in range(2, end+1):
if is_prime_num[i]:
for j in range(i*i, max_num+1, i):
is_prime_num[j] = False
while True:
... | s597594465 | s855445569 | p00009 | python | Time Limit Exceeded |
import math
def is_prime_num(in_num):
cnt = 0
if in_num == 2:
return True
elif in_num <= 1:
return False
elif in_num % 2 == 0:
return False
else:
max_num = int(math.sqrt(in_num)+1)
for j in range(3, max_num, 2):
if in_num % j == 0:
... | #init
max_num = 1000000
is_prime_num = [True for i in range (max_num+1)]
#0, 1 --- not prime number
is_prime_num[0] = False
is_prime_num[1] = False
end = int(max_num ** .5)
for i in range(2, end+1):
if is_prime_num[i]:
for j in range(i*i, max_num+1, i):
is_prime_num[j] = False
while True:
... | s168225984 | s855445569 | p00009 | python | Time Limit Exceeded |
# coding: utf-8
# Here your code !
import math
def is_prime_num(in_num):
cnt = 0
if in_num == 2:
return True
elif in_num <= 1:
return False
elif in_num % 2 == 0:
return False
else:
if pow(2, in_num-1, in_num) == 1:
max_num = int(math.sqrt(in_num... | #init
max_num = 1000000
is_prime_num = [True for i in range (max_num+1)]
#0, 1 --- not prime number
is_prime_num[0] = False
is_prime_num[1] = False
end = int(max_num ** .5)
for i in range(2, end+1):
if is_prime_num[i]:
for j in range(i*i, max_num+1, i):
is_prime_num[j] = False
while True:
... | s558708725 | s855445569 | p00009 | python | Time Limit Exceeded |
# coding: utf-8
# Here your code !
import math
def is_prime_num(in_num):
cnt = 0
if in_num == 2:
return True
elif in_num <= 1:
return False
elif in_num % 2 == 0:
return False
else:
if pow(2, in_num-1, in_num) == 1:
max_num = int(math.sqrt(in_num)+1)
... | #init
max_num = 1000000
is_prime_num = [True for i in range (max_num+1)]
#0, 1 --- not prime number
is_prime_num[0] = False
is_prime_num[1] = False
end = int(max_num ** .5)
for i in range(2, end+1):
if is_prime_num[i]:
for j in range(i*i, max_num+1, i):
is_prime_num[j] = False
while True:
... | s452064417 | s855445569 | p00009 | python | Time Limit Exceeded |
# coding: utf-8
# Here your code !
import math
def is_prime_num(in_num):
cnt = 0
if in_num == 2:
return True
elif in_num <= 1:
return False
elif in_num % 2 == 0:
return False
else:
if pow(2, in_num-1, in_num) == 1:
return True
else:
... | #init
max_num = 1000000
is_prime_num = [True for i in range (max_num+1)]
#0, 1 --- not prime number
is_prime_num[0] = False
is_prime_num[1] = False
end = int(max_num ** .5)
for i in range(2, end+1):
if is_prime_num[i]:
for j in range(i*i, max_num+1, i):
is_prime_num[j] = False
while True:
... | s843541034 | s855445569 | p00009 | python | Time Limit Exceeded |
import math
num_max = 1000000
isPrimeNum = [True for i in range(0,num_max)]
isPrimeNum[0] == False
isPrimeNum[1] == False
for i in range(2, int(math.sqrt(num_max))):
if isPrimeNum[i] == True:
for j in range (i**2, num_max, i):
isPrimeNum[j] = False
num_len = int(input())
cnt = 0
fo... | def isPrimeNum(in_num):
if in_num <= 1:
return False
elif in_num == 2:
return True
elif in_num % 2 == 0:
return False
else:
if pow(2, in_num-1, in_num) == 1:
return True
else:
return False
num_len = int(input())
cnt = 0
for i in range(num... | s822923101 | s050324636 | p02257 | python | Runtime Error |
import math
num_max = 100000
isPrimeNum = [True for i in range(0,num_max)]
isPrimeNum[0] == False
isPrimeNum[1] == False
for i in range(2, int(math.sqrt(num_max))):
if isPrimeNum[i] == True:
for j in range (i**2, num_max, i):
isPrimeNum[j] = False
num_len = int(input())
cnt = 0
for... | def isPrimeNum(in_num):
if in_num <= 1:
return False
elif in_num == 2:
return True
elif in_num % 2 == 0:
return False
else:
if pow(2, in_num-1, in_num) == 1:
return True
else:
return False
num_len = int(input())
cnt = 0
for i in range(num... | s026600103 | s050324636 | p02257 | python | Runtime Error |
import math
num_max = 1000
isPrimeNum = [True for i in range(0,num_max)]
isPrimeNum[0] == False
isPrimeNum[1] == False
for i in range(2, int(math.sqrt(num_max))):
if isPrimeNum[i] == True:
for j in range (i**2, num_max, i):
isPrimeNum[j] = False
num_len = int(input())
cnt = 0
for i... | def isPrimeNum(in_num):
if in_num <= 1:
return False
elif in_num == 2:
return True
elif in_num % 2 == 0:
return False
else:
if pow(2, in_num-1, in_num) == 1:
return True
else:
return False
num_len = int(input())
cnt = 0
for i in range(num... | s230692895 | s050324636 | p02257 | python | Runtime Error |
import math
num_max = 100000
isPrimeNum = [True for i in range(0,num_max+1)]
isPrimeNum[0] == False
isPrimeNum[1] == False
for i in range(2, int(math.sqrt(num_max))):
if isPrimeNum[i] == True:
for j in range (i**2, num_max, i):
isPrimeNum[j] = False
num_len = int(input())
cnt = 0
f... | def isPrimeNum(in_num):
if in_num <= 1:
return False
elif in_num == 2:
return True
elif in_num % 2 == 0:
return False
else:
if pow(2, in_num-1, in_num) == 1:
return True
else:
return False
num_len = int(input())
cnt = 0
for i in range(num... | s468605230 | s050324636 | p02257 | python | Runtime Error |
import math
num_max = 10000000
isPrimeNum = [True for i in range(0,num_max+1)]
isPrimeNum[0] == False
isPrimeNum[1] == False
for i in range(2, int(math.sqrt(num_max))+1):
if isPrimeNum[i] == True:
for j in range (i**2, num_max, i):
isPrimeNum[j] = False
num_len = int(input())
cnt = ... | def isPrimeNum(in_num):
if in_num <= 1:
return False
elif in_num == 2:
return True
elif in_num % 2 == 0:
return False
else:
if pow(2, in_num-1, in_num) == 1:
return True
else:
return False
num_len = int(input())
cnt = 0
for i in range(num... | s556779042 | s050324636 | p02257 | python | Runtime Error |
data_num = int(input())
price = list([0 for i in range(data_num)])
cnt = 0
deff_price = -999999999
for i in range(data_num):
price[i] = int(input())
for i in range(data_num):
for j in range(i+1,data_num):
if price[j]-price[i]>deff_price:
deff_price = price[j]-price[i]
print(str(deff_price)... | data_num = int(input())
cnt = 0
deff_price = -999999999
min_price = 0
tmp_price = 0
for i in range(data_num):
price = int(input())
if i ==0:
min_price = price
elif price - min_price > deff_price:
deff_price = price - min_price
if price < min_price:
min_price = price
prin... | s800241366 | s248325655 | p02258 | python | Time Limit Exceeded |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.