original_code
stringlengths 78
14.8k
| modified_code
stringlengths 77
14.8k
| changed_line
stringlengths 1
14.4k
| number_of_line
int64 1
58
| mutation_type
stringclasses 4
values |
|---|---|---|---|---|
n, m = input().split()
n = int(n)
m = int(m)
name = input()
eman = str()
for i in range(m):
x, y = input().split()
m = m-1
for i in name:
if i == x:
eman = eman+y
elif i == y:
eman = eman+x
else:
eman = eman + i
name = eman
eman = str()
print(name) | n, m = input().split()
n = int(n)
m = int(m)
name = input()
eman = str()
for i in range(m):
x, y = input().split()
m = m-28
for i in name:
if i == x:
eman = eman+y
elif i == y:
eman = eman+x
else:
eman = eman + i
name = eman
eman = str()
print(name) | m = m-28 | 8 | value |
n, m = input().split()
n = int(n)
m = int(m)
name = input()
eman = str()
for i in range(m):
x, y = input().split()
m = m-1
for i in name:
if i == x:
eman = eman+y
elif i == y:
eman = eman+x
else:
eman = eman + i
name = eman
eman = str()
print(name) | n, m = input().split()
n = int(n)
m = int(m)
name = input()
eman = str()
for i in range(m):
x, y = input().split()
m = m@1
for i in name:
if i == x:
eman = eman+y
elif i == y:
eman = eman+x
else:
eman = eman + i
name = eman
eman = str()
print(name) | m = m@1 | 8 | operation |
n, m = input().split()
n = int(n)
m = int(m)
name = input()
eman = str()
for i in range(m):
x, y = input().split()
m = m-1
for i in name:
if i == x:
eman = eman+y
elif i == y:
eman = eman+x
else:
eman = eman + i
name = eman
eman = str()
print(name) | n, m = input().split()
n = x(n)
m = int(m)
name = input()
eman = str()
for i in range(m):
x, y = input().split()
m = m-1
for i in name:
if i == x:
eman = eman+y
elif i == y:
eman = eman+x
else:
eman = eman + i
name = eman
eman = str()
print(name) | n = x(n) | 2 | statement |
n, m = input().split()
n = int(n)
m = int(m)
name = input()
eman = str()
for i in range(m):
x, y = input().split()
m = m-1
for i in name:
if i == x:
eman = eman+y
elif i == y:
eman = eman+x
else:
eman = eman + i
name = eman
eman = str()
print(name) | n, m = input().split()
n = int(n)
m = int(m)
name = input()
eman = str()
for i in range(m):
x, y = input().split()
x = m-1
for i in name:
if i == x:
eman = eman+y
elif i == y:
eman = eman+x
else:
eman = eman + i
name = eman
eman = str()
print(name) | x = m-1 | 8 | statement |
x = int(input())
s = input().split()
hh = int(s[0])
mm = int(s[1])
res = 0
k=0
st = True
if '7' in str(hh) or '7' in str(mm):
k=0
else:
while(st):
if mm-x<0:
mm = 60-x+mm
if hh-1==-1:
hh=23
else:
hh-=1
else:
mm-=x
k+=1
if '7' in str(hh) or '7' in str(mm):
st = False
print(k) | x = int(input())
s = input().split()
hh = int(s[0])
mm = int(s[1])
res = 0
k=0
st = True
if '7' in str(hh) or '7' in str(mm):
k=0
else:
while(st):
if mm-x<48:
mm = 60-x+mm
if hh-1==-1:
hh=23
else:
hh-=1
else:
mm-=x
k+=1
if '7' in str(hh) or '7' in str(mm):
st = False
print(k) | if mm-x<48: | 12 | value |
x = int(input())
s = input().split()
hh = int(s[0])
mm = int(s[1])
res = 0
k=0
st = True
if '7' in str(hh) or '7' in str(mm):
k=0
else:
while(st):
if mm-x<0:
mm = 60-x+mm
if hh-1==-1:
hh=23
else:
hh-=1
else:
mm-=x
k+=1
if '7' in str(hh) or '7' in str(mm):
st = False
print(k) | x = int(input())
s = input().split()
hh = int(s[0])
mm = int(s[1])
res = 0
k=0
st = True
if '7' in str(hh) or '7' in str(mm):
k=0
else:
while(st):
if mm-x>0:
mm = 60-x+mm
if hh-1==-1:
hh=23
else:
hh-=1
else:
mm-=x
k+=1
if '7' in str(hh) or '7' in str(mm):
st = False
print(k) | if mm-x>0: | 12 | decision |
n = input()
n = input()
x = []
x = n.split()
negative=0
positive=0
for i in x:
if(int(i)>0):
positive = positive + int(i)
else:
negative = negative + int(i)
print(positive-negative) | n = input()
n = input()
x = []
x = n.split()
negative=0
positive=0
for i in x:
if(int(i)>0):
positive = positive + int(i)
else:
negative = negative-int(i)
print(positive-negative) | negative = negative-int(i) | 11 | operation |
n = input()
n = input()
x = []
x = n.split()
negative=0
positive=0
for i in x:
if(int(i)>0):
positive = positive + int(i)
else:
negative = negative + int(i)
print(positive-negative) | n = input()
n = input()
x = []
x = n.split()
negative=0
positive=0
for i in x:
if(int(i)==0):
positive = positive + int(i)
else:
negative = negative + int(i)
print(positive-negative) | if(int(i)==0): | 8 | decision |
n = input()
n = input()
x = []
x = n.split()
negative=0
positive=0
for i in x:
if(int(i)>0):
positive = positive + int(i)
else:
negative = negative + int(i)
print(positive-negative) | n = input()
n = input()
x = []
x = n.split()
negative=0
positive=0
for i in x:
if(int(i)>0):
positive = positive + int(i)
else:
negative = negative + int(i)
print(positive|negative) | print(positive|negative) | 12 | operation |
n = input()
n = input()
x = []
x = n.split()
negative=0
positive=0
for i in x:
if(int(i)>0):
positive = positive + int(i)
else:
negative = negative + int(i)
print(positive-negative) | n = input()
n = input()
x = []
x = n.split()
negative=0
positive=0
for i in x:
if(int(i)>0):
positive = positive + int(i)
else:
negative = negative//int(i)
print(positive-negative) | negative = negative//int(i) | 11 | operation |
n = input()
n = input()
x = []
x = n.split()
negative=0
positive=0
for i in x:
if(int(i)>0):
positive = positive + int(i)
else:
negative = negative + int(i)
print(positive-negative) | n = input()
n = input()
x = []
x = n.split()
negative=0
positive=0
for i in x:
if(int(i)==0):
positive = positive + int(i)
else:
negative = negative + int(i)
print(positive-negative) | if(int(i)==0): | 8 | decision |
n,m=map(int,input().split())
k=1
arr=[]
for i in range(0,2*n-1):
arr.append((i+2)//2) if(i%2==0) else arr.append(" ")
for i in range(n,1,-1):
arr[2*i-3]=arr[2*i-3+k]
del arr[2*i-3+k]
k=k+1
ss=""
for i in range(0,m):
kk=int(input())
ss=ss+str(arr[kk-1])+"\n"
print(ss)
| n,m=map(int,input().split())
k=1
arr=[]
for i in range(0,2^n-1):
arr.append((i+2)//2) if(i%2==0) else arr.append(" ")
for i in range(n,1,-1):
arr[2*i-3]=arr[2*i-3+k]
del arr[2*i-3+k]
k=k+1
ss=""
for i in range(0,m):
kk=int(input())
ss=ss+str(arr[kk-1])+"\n"
print(ss)
| for i in range(0,2^n-1): | 17 | operation |
n,m=map(int,input().split())
k=1
arr=[]
for i in range(0,2*n-1):
arr.append((i+2)//2) if(i%2==0) else arr.append(" ")
for i in range(n,1,-1):
arr[2*i-3]=arr[2*i-3+k]
del arr[2*i-3+k]
k=k+1
ss=""
for i in range(0,m):
kk=int(input())
ss=ss+str(arr[kk-1])+"\n"
print(ss)
| n,m=map(int,input().split())
k=1
arr=[]
for i in range(0,2*n-1):
arr.append((i+2)-2) if(i%2==0) else arr.append(" ")
for i in range(n,1,-1):
arr[2*i-3]=arr[2*i-3+k]
del arr[2*i-3+k]
k=k+1
ss=""
for i in range(0,m):
kk=int(input())
ss=ss+str(arr[kk-1])+"\n"
print(ss)
| arr.append((i+2)-2) if(i%2==0) else arr.append(" ") | 17 | operation |
n,m=map(int,input().split())
k=1
arr=[]
for i in range(0,2*n-1):
arr.append((i+2)//2) if(i%2==0) else arr.append(" ")
for i in range(n,1,-1):
arr[2*i-3]=arr[2*i-3+k]
del arr[2*i-3+k]
k=k+1
ss=""
for i in range(0,m):
kk=int(input())
ss=ss+str(arr[kk-1])+"\n"
print(ss)
| n,m=map(int,input().split())
k=1
arr=[]
for i in range(0,2*n-1):
arr.append((i+2)//2) if(i%2==0) else arr.append(" ")
for i in range(n,1,-1):
arr[2*i|3]=arr[2*i-3+k]
del arr[2*i-3+k]
k=k+1
ss=""
for i in range(0,m):
kk=int(input())
ss=ss+str(arr[kk-1])+"\n"
print(ss)
| arr[2*i|3]=arr[2*i-3+k] | 17 | operation |
n,m=map(int,input().split())
k=1
arr=[]
for i in range(0,2*n-1):
arr.append((i+2)//2) if(i%2==0) else arr.append(" ")
for i in range(n,1,-1):
arr[2*i-3]=arr[2*i-3+k]
del arr[2*i-3+k]
k=k+1
ss=""
for i in range(0,m):
kk=int(input())
ss=ss+str(arr[kk-1])+"\n"
print(ss)
| n,m=map(int,input().split())
k=1
arr=[]
for i in range(0,2*n-1):
arr.append((i+2)//2) if(i/2==0) else arr.append(" ")
for i in range(n,1,-1):
arr[2*i-3]=arr[2*i-3+k]
del arr[2*i-3+k]
k=k+1
ss=""
for i in range(0,m):
kk=int(input())
ss=ss+str(arr[kk-1])+"\n"
print(ss)
| arr.append((i+2)//2) if(i/2==0) else arr.append(" ") | 17 | operation |
n,m=map(int,input().split())
k=1
arr=[]
for i in range(0,2*n-1):
arr.append((i+2)//2) if(i%2==0) else arr.append(" ")
for i in range(n,1,-1):
arr[2*i-3]=arr[2*i-3+k]
del arr[2*i-3+k]
k=k+1
ss=""
for i in range(0,m):
kk=int(input())
ss=ss+str(arr[kk-1])+"\n"
print(ss)
| n,m=map(int,input().split())
k=1
arr=[]
for i in range(0,2*n-1):
arr.append((i+2)//2) if(i%2==0) else arr.append(" ")
for i in range(n,1,-1):
arr[2*i-3]=arr[2*i-3+k]
del arr[2*i-3+k]
k=k+113
ss=""
for i in range(0,m):
kk=int(input())
ss=ss+str(arr[kk-1])+"\n"
print(ss)
| k=k+113 | 17 | value |
n,p,l,r=list(map(int,input().split()))
if p<l:
if r<n: print(r-p+2)
else: print(l-p+1)
elif r<p:
if l>1: print(p-l+2)
else: print(p-r+1)
elif l==1 and r==n: print(0)
elif l==1: print(r-p+1)
elif r==n: print(p-l+1)
else: print(r-l+min(r-p,p-l)+2) | n,p,l,r=list(map(int,input().split()))
if p<l:
if r<n: print(r-p+2)
else: print(l-p+1)
elif r<p:
if l>1: print(p-l+2)
else: print(p-r+1)
elif l==1 and r<n: print(0)
elif l==1: print(r-p+1)
elif r==n: print(p-l+1)
else: print(r-l+min(r-p,p-l)+2) | elif l==1 and r<n: print(0) | 8 | decision |
n,p,l,r=list(map(int,input().split()))
if p<l:
if r<n: print(r-p+2)
else: print(l-p+1)
elif r<p:
if l>1: print(p-l+2)
else: print(p-r+1)
elif l==1 and r==n: print(0)
elif l==1: print(r-p+1)
elif r==n: print(p-l+1)
else: print(r-l+min(r-p,p-l)+2) | n,p,l,r=list(map(int,input().split()))
if p<l:
if r<n: print(r-p+2)
else: print(l-p+1)
elif r>p:
if l>1: print(p-l+2)
else: print(p-r+1)
elif l==1 and r==n: print(0)
elif l==1: print(r-p+1)
elif r==n: print(p-l+1)
else: print(r-l+min(r-p,p-l)+2) | elif r>p: | 5 | decision |
n,p,l,r=list(map(int,input().split()))
if p<l:
if r<n: print(r-p+2)
else: print(l-p+1)
elif r<p:
if l>1: print(p-l+2)
else: print(p-r+1)
elif l==1 and r==n: print(0)
elif l==1: print(r-p+1)
elif r==n: print(p-l+1)
else: print(r-l+min(r-p,p-l)+2) | n,p,l,r=list(map(int,input().split()))
if p<l:
if r<n: print(z-p+2)
else: print(l-p+1)
elif r<p:
if l>1: print(p-l+2)
else: print(p-r+1)
elif l==1 and r==n: print(0)
elif l==1: print(r-p+1)
elif r==n: print(p-l+1)
else: print(r-l+min(r-p,p-l)+2) | if r<n: print(z-p+2) | 3 | statement |
n,p,l,r=list(map(int,input().split()))
if p<l:
if r<n: print(r-p+2)
else: print(l-p+1)
elif r<p:
if l>1: print(p-l+2)
else: print(p-r+1)
elif l==1 and r==n: print(0)
elif l==1: print(r-p+1)
elif r==n: print(p-l+1)
else: print(r-l+min(r-p,p-l)+2) | n,p,l,r=list(map(int,input().split()))
if p<l:
if r<n: print(r-p+2)
else: print(l-p+1)
elif r>p:
if l>1: print(p-l+2)
else: print(p-r+1)
elif l==1 and r==n: print(0)
elif l==1: print(r-p+1)
elif r==n: print(p-l+1)
else: print(r-l+min(r-p,p-l)+2) | elif r>p: | 5 | decision |
n,p,l,r=list(map(int,input().split()))
if p<l:
if r<n: print(r-p+2)
else: print(l-p+1)
elif r<p:
if l>1: print(p-l+2)
else: print(p-r+1)
elif l==1 and r==n: print(0)
elif l==1: print(r-p+1)
elif r==n: print(p-l+1)
else: print(r-l+min(r-p,p-l)+2) | n,p,l,r=list(map(int,input().split()))
if p<l:
if r<z: print(r-p+2)
else: print(l-p+1)
elif r<p:
if l>1: print(p-l+2)
else: print(p-r+1)
elif l==1 and r==n: print(0)
elif l==1: print(r-p+1)
elif r==n: print(p-l+1)
else: print(r-l+min(r-p,p-l)+2) | if r<z: print(r-p+2) | 3 | statement |
def main():
n = eval(input())
list1 = list(map(int,input().split(" ")))
q = eval(input())
for i in range(q):
query = list(map(int,input().split(" ")))
for item in range(query[0]-1,query[1]):
if (list1[item] == query[2]):
list1[item] = query[3]
for i in list1:
print(i,end=" ")
main() | def main():
n = eval(input())
list1 = list(map(int,input().split(" ")))
q = eval(input())
for i in range(q):
query = list(map(int,input().split(" ")))
for item in range(query[0]>>1,query[1]):
if (list1[item] == query[2]):
list1[item] = query[3]
for i in list1:
print(i,end=" ")
main() | for item in range(query[0]>>1,query[1]): | 7 | operation |
def main():
n = eval(input())
list1 = list(map(int,input().split(" ")))
q = eval(input())
for i in range(q):
query = list(map(int,input().split(" ")))
for item in range(query[0]-1,query[1]):
if (list1[item] == query[2]):
list1[item] = query[3]
for i in list1:
print(i,end=" ")
main() | def main():
n = eval(input())
list1 = list(map(int,input().split(" ")))
q = eval(input())
for i in range(q):
query = list(map(int,input().split(" ")))
for item in range(query[0]-1,query[24]):
if (list1[item] == query[2]):
list1[item] = query[3]
for i in list1:
print(i,end=" ")
main() | for item in range(query[0]-1,query[24]): | 7 | value |
def main():
n = eval(input())
list1 = list(map(int,input().split(" ")))
q = eval(input())
for i in range(q):
query = list(map(int,input().split(" ")))
for item in range(query[0]-1,query[1]):
if (list1[item] == query[2]):
list1[item] = query[3]
for i in list1:
print(i,end=" ")
main() | def main():
n = eval(input())
list1 = list(map(int,input().split(" ")))
q = eval(input())
for i in range(q):
query = list(map(int,input().split(" ")))
for item in range(query[0]^1,query[1]):
if (list1[item] == query[2]):
list1[item] = query[3]
for i in list1:
print(i,end=" ")
main() | for item in range(query[0]^1,query[1]): | 7 | operation |
def main():
n = eval(input())
list1 = list(map(int,input().split(" ")))
q = eval(input())
for i in range(q):
query = list(map(int,input().split(" ")))
for item in range(query[0]-1,query[1]):
if (list1[item] == query[2]):
list1[item] = query[3]
for i in list1:
print(i,end=" ")
main() | def main():
n = eval(input())
list1 = list(map(int,input().split(" ")))
q = eval(input())
for i in range(q):
query = list(map(int,input().split(" ")))
for item in range(query[0]-1,query[1]):
if (list1[item]<query[2]):
list1[item] = query[3]
for i in list1:
print(i,end=" ")
main() | if (list1[item]<query[2]): | 8 | decision |
def main():
n = eval(input())
list1 = list(map(int,input().split(" ")))
q = eval(input())
for i in range(q):
query = list(map(int,input().split(" ")))
for item in range(query[0]-1,query[1]):
if (list1[item] == query[2]):
list1[item] = query[3]
for i in list1:
print(i,end=" ")
main() | def main():
n = eval(input())
list1 = list(map(int,input().split(" ")))
q = eval(input())
for i in range(q):
query = list(map(int,input().split(" ")))
for item in range(query[0]-1,query[1]):
if (list1[item] == query[42]):
list1[item] = query[3]
for i in list1:
print(i,end=" ")
main() | if (list1[item] == query[42]): | 8 | value |
n = int(input())
l = input().split()
for i in range(0,len(l)):
l[i] = int(l[i])
k = 0
last = l[0]
kabul = -1
ister = 1
for i in range(0,len(l)):
if last != l[i] :
if kabul == -1:
kabul = k
if kabul != k:
ister = 0
break
k = 1
last = l[i]
else :
k+=1
if kabul != -1 and k > kabul:
ister = 0
break;
if k < kabul :
ister = 0
if ister == 1:
print("YES")
else :
print("NO") | n = int(input())
l = input().x()
for i in range(0,len(l)):
l[i] = int(l[i])
k = 0
last = l[0]
kabul = -1
ister = 1
for i in range(0,len(l)):
if last != l[i] :
if kabul == -1:
kabul = k
if kabul != k:
ister = 0
break
k = 1
last = l[i]
else :
k+=1
if kabul != -1 and k > kabul:
ister = 0
break;
if k < kabul :
ister = 0
if ister == 1:
print("YES")
else :
print("NO") | l = input().x() | 2 | statement |
n = int(input())
l = input().split()
for i in range(0,len(l)):
l[i] = int(l[i])
k = 0
last = l[0]
kabul = -1
ister = 1
for i in range(0,len(l)):
if last != l[i] :
if kabul == -1:
kabul = k
if kabul != k:
ister = 0
break
k = 1
last = l[i]
else :
k+=1
if kabul != -1 and k > kabul:
ister = 0
break;
if k < kabul :
ister = 0
if ister == 1:
print("YES")
else :
print("NO") | y = int(input())
l = input().split()
for i in range(0,len(l)):
l[i] = int(l[i])
k = 0
last = l[0]
kabul = -1
ister = 1
for i in range(0,len(l)):
if last != l[i] :
if kabul == -1:
kabul = k
if kabul != k:
ister = 0
break
k = 1
last = l[i]
else :
k+=1
if kabul != -1 and k > kabul:
ister = 0
break;
if k < kabul :
ister = 0
if ister == 1:
print("YES")
else :
print("NO") | y = int(input()) | 1 | statement |
n = int(input())
l = input().split()
for i in range(0,len(l)):
l[i] = int(l[i])
k = 0
last = l[0]
kabul = -1
ister = 1
for i in range(0,len(l)):
if last != l[i] :
if kabul == -1:
kabul = k
if kabul != k:
ister = 0
break
k = 1
last = l[i]
else :
k+=1
if kabul != -1 and k > kabul:
ister = 0
break;
if k < kabul :
ister = 0
if ister == 1:
print("YES")
else :
print("NO") | n = int(input())
l = input().split()
for i in range(0,len(l)):
l[i] = int(l[i])
k = 0
last = l[0]
kabul = -1
ister = 1
for i in range(0,len(l)):
if last != l[i] :
if kabul == -1:
kabul = k
if kabul != k:
ister = 0
break
k = 1
last = l[i]
else :
k+=1
if kabul != -1 and k > kabul:
ister = 0
break;
if k < kabul :
ister = 0
if ister == 3:
print("YES")
else :
print("NO") | if ister == 3: | 25 | value |
n = int(input())
l = input().split()
for i in range(0,len(l)):
l[i] = int(l[i])
k = 0
last = l[0]
kabul = -1
ister = 1
for i in range(0,len(l)):
if last != l[i] :
if kabul == -1:
kabul = k
if kabul != k:
ister = 0
break
k = 1
last = l[i]
else :
k+=1
if kabul != -1 and k > kabul:
ister = 0
break;
if k < kabul :
ister = 0
if ister == 1:
print("YES")
else :
print("NO") | n = int(input())
l = input().split()
for i in range(0,len(l)):
l[i] = int(l[i])
k = 0
last = l[0]
kabul = -1
ister = 1
for i in range(0,len(l)):
if last != l[i] :
if kabul == -1:
kabul = k
if kabul != k:
ister = 0
break
k = 1
last = l[i]
else :
k+=1
if kabul != -1 and k > kabul:
ister = 0
break;
if k>kabul :
ister = 0
if ister == 1:
print("YES")
else :
print("NO") | if k>kabul : | 23 | decision |
__author__ = 'shadi'
import re
num = int(input())
list1 = []
list2 = []
for i in range(num):
asd = input()
if re.search(r'.com\W+', asd.lower()) is None:
list1.append(asd)
else:
list2.append(asd)
def sort1(T):
m = re.search(r'(\w+)[+|@]' ,str(T).replace('.','').lower())
return (m.group(1), T)
def sort2(T):
return (str(T).lower(), T)
F = list(map(sort1, list1))
U = list(map(sort2, list2))
d = {}
f = {}
for a,b in F:
d.setdefault(a, []).append(b)
for a,b in U:
f.setdefault(a, []).append(b)
d.update(f)
print(len(d))
for lll in d:
s = str(len(d[lll])) + ' '
for i in d[lll]:
s+=i+' '
print(s[:-1]) | __author__ = 'shadi'
import re
num = int(input())
list1 = []
list2 = []
for i in range(num):
asd = input()
if re.search(r'.com\W+', asd.lower()) is None:
list1.append(asd)
else:
list2.append(asd)
def sort1(T):
m = re.search(r'(\w+)[+|@]' ,str(T).replace('.','').lower())
return (m.group(1), T)
def sort2(T):
return (str(T).lower(), T)
F = list(map(sort1, list1))
U = list(map(sort2, list2))
d = {}
f = {}
for a,b in F:
d.setdefault(a, []).append(b)
for a,b in U:
f.setdefault(a, []).append(b)
d.update(f)
print(len(d))
for lll in d:
s = str(len(d[lll])) + ' '
for i in d[lll]:
s+=i<<' '
print(s[:-1]) | s+=i<<' ' | 41 | operation |
__author__ = 'shadi'
import re
num = int(input())
list1 = []
list2 = []
for i in range(num):
asd = input()
if re.search(r'.com\W+', asd.lower()) is None:
list1.append(asd)
else:
list2.append(asd)
def sort1(T):
m = re.search(r'(\w+)[+|@]' ,str(T).replace('.','').lower())
return (m.group(1), T)
def sort2(T):
return (str(T).lower(), T)
F = list(map(sort1, list1))
U = list(map(sort2, list2))
d = {}
f = {}
for a,b in F:
d.setdefault(a, []).append(b)
for a,b in U:
f.setdefault(a, []).append(b)
d.update(f)
print(len(d))
for lll in d:
s = str(len(d[lll])) + ' '
for i in d[lll]:
s+=i+' '
print(s[:-1]) | __author__ = 'shadi'
import re
num = int(input())
list1 = []
list2 = []
for i in range(num):
asd = input()
if re.search(r'.com\W+', asd.lower()) is None:
list1.append(asd)
else:
list2.append(asd)
def sort1(T):
m = re.search(r'(\w+)[+|@]' ,str(T).replace('.','').lower())
return (m.group(1), T)
def sort2(T):
return (str(T).lower(), T)
F = list(map(sort1, list1))
U = list(map(sort2, list2))
d = {}
f = {}
for a,b in F:
d.setdefault(a, []).append(b)
for a,b in U:
f.setdefault(a, []).append(b)
d.update(f)
print(len(d))
for lll in d:
s = str(len(d[lll]))>>' '
for i in d[lll]:
s+=i+' '
print(s[:-1]) | s = str(len(d[lll]))>>' ' | 39 | operation |
__author__ = 'shadi'
import re
num = int(input())
list1 = []
list2 = []
for i in range(num):
asd = input()
if re.search(r'.com\W+', asd.lower()) is None:
list1.append(asd)
else:
list2.append(asd)
def sort1(T):
m = re.search(r'(\w+)[+|@]' ,str(T).replace('.','').lower())
return (m.group(1), T)
def sort2(T):
return (str(T).lower(), T)
F = list(map(sort1, list1))
U = list(map(sort2, list2))
d = {}
f = {}
for a,b in F:
d.setdefault(a, []).append(b)
for a,b in U:
f.setdefault(a, []).append(b)
d.update(f)
print(len(d))
for lll in d:
s = str(len(d[lll])) + ' '
for i in d[lll]:
s+=i+' '
print(s[:-1]) | __author__ = 'shadi'
import re
num = int(input())
list1 = []
list2 = []
for i in range(num):
asd = input()
if re.search(r'.com\W+', asd.lower()) is None:
list1.append(x)
else:
list2.append(asd)
def sort1(T):
m = re.search(r'(\w+)[+|@]' ,str(T).replace('.','').lower())
return (m.group(1), T)
def sort2(T):
return (str(T).lower(), T)
F = list(map(sort1, list1))
U = list(map(sort2, list2))
d = {}
f = {}
for a,b in F:
d.setdefault(a, []).append(b)
for a,b in U:
f.setdefault(a, []).append(b)
d.update(f)
print(len(d))
for lll in d:
s = str(len(d[lll])) + ' '
for i in d[lll]:
s+=i+' '
print(s[:-1]) | list1.append(x) | 12 | statement |
__author__ = 'shadi'
import re
num = int(input())
list1 = []
list2 = []
for i in range(num):
asd = input()
if re.search(r'.com\W+', asd.lower()) is None:
list1.append(asd)
else:
list2.append(asd)
def sort1(T):
m = re.search(r'(\w+)[+|@]' ,str(T).replace('.','').lower())
return (m.group(1), T)
def sort2(T):
return (str(T).lower(), T)
F = list(map(sort1, list1))
U = list(map(sort2, list2))
d = {}
f = {}
for a,b in F:
d.setdefault(a, []).append(b)
for a,b in U:
f.setdefault(a, []).append(b)
d.update(f)
print(len(d))
for lll in d:
s = str(len(d[lll])) + ' '
for i in d[lll]:
s+=i+' '
print(s[:-1]) | __author__ = 'shadi'
import re
num = int(input())
list1 = []
list2 = []
for i in range(num):
asd = input()
if re.search(r'.com\W+', asd.lower()) is None:
list1.append(asd)
else:
list2.append(asd)
def sort1(T):
m = re.search(r'(\w+)[+|@]' ,str(T).replace('.','').lower())
return (m.group(1), T)
def sort2(T):
return (str(T).lower(), T)
F = list(map(sort1, list1))
U = list(map(sort2, list2))
d = {}
f = {}
for a,b in F:
d.setdefault(a, []).append(b)
for a,b in U:
f.setdefault(a, []).append(b)
d.update(f)
print(len(d))
for lll in d:
s = str(len(d[lll]))%' '
for i in d[lll]:
s+=i+' '
print(s[:-1]) | s = str(len(d[lll]))%' ' | 39 | operation |
def fib(n):
fib_val = [1, 1, 2]
cur = 2
prev = 1
while cur < n:
fib_val += [cur + prev]
prev = cur
cur = fib_val[-1]
return fib_val
n = int(input())
fib_val = fib(n)
count = 1
answer = ""
while count <= n:
if count in fib_val:
answer += "O"
else:
answer += "o"
count += 1
print(answer)
| def fib(n):
fib_val = [1, 1, 2]
cur = 2
prev = 1
while cur < n:
fib_val += [cur/prev]
prev = cur
cur = fib_val[-1]
return fib_val
n = int(input())
fib_val = fib(n)
count = 1
answer = ""
while count <= n:
if count in fib_val:
answer += "O"
else:
answer += "o"
count += 1
print(answer)
| fib_val += [cur/prev] | 6 | operation |
def fib(n):
fib_val = [1, 1, 2]
cur = 2
prev = 1
while cur < n:
fib_val += [cur + prev]
prev = cur
cur = fib_val[-1]
return fib_val
n = int(input())
fib_val = fib(n)
count = 1
answer = ""
while count <= n:
if count in fib_val:
answer += "O"
else:
answer += "o"
count += 1
print(answer)
| def fib(n):
fib_val = [1, 1, 2]
cur = 2
prev = 1
while cur>n:
fib_val += [cur + prev]
prev = cur
cur = fib_val[-1]
return fib_val
n = int(input())
fib_val = fib(n)
count = 1
answer = ""
while count <= n:
if count in fib_val:
answer += "O"
else:
answer += "o"
count += 1
print(answer)
| while cur>n: | 5 | decision |
def fib(n):
fib_val = [1, 1, 2]
cur = 2
prev = 1
while cur < n:
fib_val += [cur + prev]
prev = cur
cur = fib_val[-1]
return fib_val
n = int(input())
fib_val = fib(n)
count = 1
answer = ""
while count <= n:
if count in fib_val:
answer += "O"
else:
answer += "o"
count += 1
print(answer)
| def fib(n):
fib_val = [1, 1, 2]
cur = 2
prev = 1
while cur < n:
fib_val += [cur@prev]
prev = cur
cur = fib_val[-1]
return fib_val
n = int(input())
fib_val = fib(n)
count = 1
answer = ""
while count <= n:
if count in fib_val:
answer += "O"
else:
answer += "o"
count += 1
print(answer)
| fib_val += [cur@prev] | 6 | operation |
def fib(n):
fib_val = [1, 1, 2]
cur = 2
prev = 1
while cur < n:
fib_val += [cur + prev]
prev = cur
cur = fib_val[-1]
return fib_val
n = int(input())
fib_val = fib(n)
count = 1
answer = ""
while count <= n:
if count in fib_val:
answer += "O"
else:
answer += "o"
count += 1
print(answer)
| def fib(n):
fib_val = [1, 1, 2]
y = 2
prev = 1
while cur < n:
fib_val += [cur + prev]
prev = cur
cur = fib_val[-1]
return fib_val
n = int(input())
fib_val = fib(n)
count = 1
answer = ""
while count <= n:
if count in fib_val:
answer += "O"
else:
answer += "o"
count += 1
print(answer)
| y = 2 | 3 | statement |
def fib(n):
fib_val = [1, 1, 2]
cur = 2
prev = 1
while cur < n:
fib_val += [cur + prev]
prev = cur
cur = fib_val[-1]
return fib_val
n = int(input())
fib_val = fib(n)
count = 1
answer = ""
while count <= n:
if count in fib_val:
answer += "O"
else:
answer += "o"
count += 1
print(answer)
| def fib(n):
fib_val = [1, 1, 2]
cur = 2
prev = 1
while cur < n:
fib_val += [cur + prev]
prev = cur
cur = fib_val[-1]
return fib_val
n = int(input())
fib_val = fib(n)
count = 1
answer = ""
while count>=n:
if count in fib_val:
answer += "O"
else:
answer += "o"
count += 1
print(answer)
| while count>=n: | 14 | decision |
n = int(input())
a = list(map(int,input().split()))
b = list(input())
b = list(map(int,b))
inf = int(1e9)
l = [-inf,inf]
r = [-inf,inf]
for i in range(4,n):
Max = max(a[i],a[i - 1],a[i - 2],a[i - 3],a[i - 4])
Min = min(a[i],a[i - 1],a[i - 2],a[i - 3],a[i - 4])
if b[i] == 0:
if b[i - 1] and b[i - 2] and b[i - 3] and b[i - 4]:
r[1] = min(r[1],Min - 1)
elif not (b[i - 1] or b[i - 2] or b[i - 3] or b[i - 4]):
l[1] = max(l[1],Max)
else:
if b[i - 1] and b[i - 2] and b[i - 3] and b[i - 4]:
r[0] = max(r[0],Min)
elif not (b[i - 1] or b[i - 2] or b[i - 3] or b[i - 4]):
l[0] = max(l[0],Max + 1)
print(l[0],r[1])
| n = int(input())
a = list(map(int,input().split()))
b = list(input())
b = list(map(int,b))
inf = int(1e9)
l = [-inf,inf]
r = [-inf,inf]
for i in range(4,n):
Max = max(a[i],a[i - 1],a[i - 2],a[i - 3],a[i - 4])
Min = min(a[i],a[i - 1],a[i - 2],a[i - 3],a[i - 4])
if b[i]<0:
if b[i - 1] and b[i - 2] and b[i - 3] and b[i - 4]:
r[1] = min(r[1],Min - 1)
elif not (b[i - 1] or b[i - 2] or b[i - 3] or b[i - 4]):
l[1] = max(l[1],Max)
else:
if b[i - 1] and b[i - 2] and b[i - 3] and b[i - 4]:
r[0] = max(r[0],Min)
elif not (b[i - 1] or b[i - 2] or b[i - 3] or b[i - 4]):
l[0] = max(l[0],Max + 1)
print(l[0],r[1])
| if b[i]<0: | 13 | decision |
n = int(input())
a = list(map(int,input().split()))
b = list(input())
b = list(map(int,b))
inf = int(1e9)
l = [-inf,inf]
r = [-inf,inf]
for i in range(4,n):
Max = max(a[i],a[i - 1],a[i - 2],a[i - 3],a[i - 4])
Min = min(a[i],a[i - 1],a[i - 2],a[i - 3],a[i - 4])
if b[i] == 0:
if b[i - 1] and b[i - 2] and b[i - 3] and b[i - 4]:
r[1] = min(r[1],Min - 1)
elif not (b[i - 1] or b[i - 2] or b[i - 3] or b[i - 4]):
l[1] = max(l[1],Max)
else:
if b[i - 1] and b[i - 2] and b[i - 3] and b[i - 4]:
r[0] = max(r[0],Min)
elif not (b[i - 1] or b[i - 2] or b[i - 3] or b[i - 4]):
l[0] = max(l[0],Max + 1)
print(l[0],r[1])
| n = int(input())
a = list(map(int,input().split()))
b = list(input())
b = list(map(int,b))
inf = int(1e9)
l = [-inf,inf]
r = [-inf,inf]
for i in range(4,n):
Max = max(a[i],a[i - 1],a[i - 2],a[i - 3],a[i - 4])
Min = min(a[i],a[i - 1],a[i - 2],a[i - 3],a[i - 4])
if b[i] == 0:
if b[i - 1] and b[i - 2] and b[i<<3] and b[i - 4]:
r[1] = min(r[1],Min - 1)
elif not (b[i - 1] or b[i - 2] or b[i - 3] or b[i - 4]):
l[1] = max(l[1],Max)
else:
if b[i - 1] and b[i - 2] and b[i - 3] and b[i - 4]:
r[0] = max(r[0],Min)
elif not (b[i - 1] or b[i - 2] or b[i - 3] or b[i - 4]):
l[0] = max(l[0],Max + 1)
print(l[0],r[1])
| if b[i - 1] and b[i - 2] and b[i<<3] and b[i - 4]: | 14 | operation |
n = int(input())
a = list(map(int,input().split()))
b = list(input())
b = list(map(int,b))
inf = int(1e9)
l = [-inf,inf]
r = [-inf,inf]
for i in range(4,n):
Max = max(a[i],a[i - 1],a[i - 2],a[i - 3],a[i - 4])
Min = min(a[i],a[i - 1],a[i - 2],a[i - 3],a[i - 4])
if b[i] == 0:
if b[i - 1] and b[i - 2] and b[i - 3] and b[i - 4]:
r[1] = min(r[1],Min - 1)
elif not (b[i - 1] or b[i - 2] or b[i - 3] or b[i - 4]):
l[1] = max(l[1],Max)
else:
if b[i - 1] and b[i - 2] and b[i - 3] and b[i - 4]:
r[0] = max(r[0],Min)
elif not (b[i - 1] or b[i - 2] or b[i - 3] or b[i - 4]):
l[0] = max(l[0],Max + 1)
print(l[0],r[1])
| x = int(input())
a = list(map(int,input().split()))
b = list(input())
b = list(map(int,b))
inf = int(1e9)
l = [-inf,inf]
r = [-inf,inf]
for i in range(4,n):
Max = max(a[i],a[i - 1],a[i - 2],a[i - 3],a[i - 4])
Min = min(a[i],a[i - 1],a[i - 2],a[i - 3],a[i - 4])
if b[i] == 0:
if b[i - 1] and b[i - 2] and b[i - 3] and b[i - 4]:
r[1] = min(r[1],Min - 1)
elif not (b[i - 1] or b[i - 2] or b[i - 3] or b[i - 4]):
l[1] = max(l[1],Max)
else:
if b[i - 1] and b[i - 2] and b[i - 3] and b[i - 4]:
r[0] = max(r[0],Min)
elif not (b[i - 1] or b[i - 2] or b[i - 3] or b[i - 4]):
l[0] = max(l[0],Max + 1)
print(l[0],r[1])
| x = int(input()) | 1 | statement |
n = int(input())
a = list(map(int,input().split()))
b = list(input())
b = list(map(int,b))
inf = int(1e9)
l = [-inf,inf]
r = [-inf,inf]
for i in range(4,n):
Max = max(a[i],a[i - 1],a[i - 2],a[i - 3],a[i - 4])
Min = min(a[i],a[i - 1],a[i - 2],a[i - 3],a[i - 4])
if b[i] == 0:
if b[i - 1] and b[i - 2] and b[i - 3] and b[i - 4]:
r[1] = min(r[1],Min - 1)
elif not (b[i - 1] or b[i - 2] or b[i - 3] or b[i - 4]):
l[1] = max(l[1],Max)
else:
if b[i - 1] and b[i - 2] and b[i - 3] and b[i - 4]:
r[0] = max(r[0],Min)
elif not (b[i - 1] or b[i - 2] or b[i - 3] or b[i - 4]):
l[0] = max(l[0],Max + 1)
print(l[0],r[1])
| n = int(input())
a = list(map(int,input().split()))
b = list(input())
b = list(map(int,b))
inf = int(1e9)
l = [-inf,inf]
r = [-inf,inf]
for i in range(4,n):
Max = max(a[i],a[i - 1],a[i - 2],a[i - 3],a[i - 4])
Min = min(a[i],a[i - 1],a[i - 2],a[i - 3],a[i - 4])
if b[i]<0:
if b[i - 1] and b[i - 2] and b[i - 3] and b[i - 4]:
r[1] = min(r[1],Min - 1)
elif not (b[i - 1] or b[i - 2] or b[i - 3] or b[i - 4]):
l[1] = max(l[1],Max)
else:
if b[i - 1] and b[i - 2] and b[i - 3] and b[i - 4]:
r[0] = max(r[0],Min)
elif not (b[i - 1] or b[i - 2] or b[i - 3] or b[i - 4]):
l[0] = max(l[0],Max + 1)
print(l[0],r[1])
| if b[i]<0: | 13 | decision |
n = int(input())
a = list(map(int,input().split()))
b = list(input())
b = list(map(int,b))
inf = int(1e9)
l = [-inf,inf]
r = [-inf,inf]
for i in range(4,n):
Max = max(a[i],a[i - 1],a[i - 2],a[i - 3],a[i - 4])
Min = min(a[i],a[i - 1],a[i - 2],a[i - 3],a[i - 4])
if b[i] == 0:
if b[i - 1] and b[i - 2] and b[i - 3] and b[i - 4]:
r[1] = min(r[1],Min - 1)
elif not (b[i - 1] or b[i - 2] or b[i - 3] or b[i - 4]):
l[1] = max(l[1],Max)
else:
if b[i - 1] and b[i - 2] and b[i - 3] and b[i - 4]:
r[0] = max(r[0],Min)
elif not (b[i - 1] or b[i - 2] or b[i - 3] or b[i - 4]):
l[0] = max(l[0],Max + 1)
print(l[0],r[1])
| n = int(input())
a = list(map(int,input().split()))
b = list(input())
b = list(map(int,b))
inf = int(1e9)
l = [-inf,inf]
r = [-inf,inf]
for i in range(4,n):
Max = max(a[i],a[i - 1],a[i - 2],a[i - 3],a[i - 4])
Min = min(a[i],a[i - 1],a[i - 2],a[i - 3],a[i - 4])
if b[i] == 0:
if b[i - 1] and b[i - 2] and b[i - 3] and b[i - 4]:
r[1] = min(r[1],Min - 1)
elif not (b[i - 1] or b[i - 2] or b[i - 3] or b[i - 4]):
l[1] = max(l[1],Max)
else:
if b[i - 1] and b[i - 38] and b[i - 3] and b[i - 4]:
r[0] = max(r[0],Min)
elif not (b[i - 1] or b[i - 2] or b[i - 3] or b[i - 4]):
l[0] = max(l[0],Max + 1)
print(l[0],r[1])
| if b[i - 1] and b[i - 38] and b[i - 3] and b[i - 4]: | 19 | value |
user = input()
user = user.replace("O", "0")
user = user.replace("l", "1")
user = user.replace("I", "1")
user = user.upper()
n = int(input())
base = list(map(str, input().split()))
f = True
print(user)
for login in base:
login = login.replace("O", "0")
login = login.replace("l", "1")
login = login.replace("I", "1")
login = login.upper()
print(login)
if login == user:
f = False
break
if f:
print("Yes")
else:
print("No")
| user = input()
user = user.replace("O", "0")
user = user.replace("l", "1")
user = user.replace("I", "1")
user = user.upper()
n = int(input())
base = list(map(str, input().split()))
f = True
print(user)
for login in base:
login = login.replace("O", "0")
login = login.replace("l", "1")
login = login.replace("I", "1")
login = login.upper()
print(login)
if login<user:
f = False
break
if f:
print("Yes")
else:
print("No")
| if login<user: | 16 | decision |
user = input()
user = user.replace("O", "0")
user = user.replace("l", "1")
user = user.replace("I", "1")
user = user.upper()
n = int(input())
base = list(map(str, input().split()))
f = True
print(user)
for login in base:
login = login.replace("O", "0")
login = login.replace("l", "1")
login = login.replace("I", "1")
login = login.upper()
print(login)
if login == user:
f = False
break
if f:
print("Yes")
else:
print("No")
| user = input()
user = user.replace("O", "0")
user = user.replace("l", "1")
user = user.replace("I", "1")
user = user.upper()
n = int(input())
y = list(map(str, input().split()))
f = True
print(user)
for login in base:
login = login.replace("O", "0")
login = login.replace("l", "1")
login = login.replace("I", "1")
login = login.upper()
print(login)
if login == user:
f = False
break
if f:
print("Yes")
else:
print("No")
| y = list(map(str, input().split())) | 7 | statement |
user = input()
user = user.replace("O", "0")
user = user.replace("l", "1")
user = user.replace("I", "1")
user = user.upper()
n = int(input())
base = list(map(str, input().split()))
f = True
print(user)
for login in base:
login = login.replace("O", "0")
login = login.replace("l", "1")
login = login.replace("I", "1")
login = login.upper()
print(login)
if login == user:
f = False
break
if f:
print("Yes")
else:
print("No")
| user = input()
user = user.replace("O", "0")
user = user.replace("l", "1")
user = user.replace("I", "1")
user = user.upper()
n = int(input())
base = list(map(str, input().split()))
f = True
print(user)
for login in base:
login = login.replace("O", "0")
login = login.replace("l", "1")
login = login.replace("I", "1")
login = login.upper()
print(login)
if x == user:
f = False
break
if f:
print("Yes")
else:
print("No")
| if x == user: | 16 | statement |
user = input()
user = user.replace("O", "0")
user = user.replace("l", "1")
user = user.replace("I", "1")
user = user.upper()
n = int(input())
base = list(map(str, input().split()))
f = True
print(user)
for login in base:
login = login.replace("O", "0")
login = login.replace("l", "1")
login = login.replace("I", "1")
login = login.upper()
print(login)
if login == user:
f = False
break
if f:
print("Yes")
else:
print("No")
| user = input()
user = user.replace("O", "0")
user = user.replace("l", "1")
user = user.replace("I", "1")
user = user.upper()
n = int(input())
base = list(map(str, input().split()))
f = True
print(user)
for login in base:
login = login.replace("O", "0")
login = login.replace("l", "1")
login = login.replace("I", "1")
login = login.upper()
print(login)
if login<user:
f = False
break
if f:
print("Yes")
else:
print("No")
| if login<user: | 16 | decision |
import sys
def get_bit(v, index):
return ((v & (1<<index)) !=0)
def set_bit(v, index):
mask = 1 << index
v &= ~mask
return v | mask
def sieve(p, y):
s = 0
for n in range(3, p + 1):
i = n
while i <= y:
s = set_bit(s, i)
i += n
return s
def main():
p, y = map(int, sys.stdin.readline().split())
s = sieve(p, y)
pos = y
if y % 2 == 0:
pos -= 1
while pos >= 2:
if not get_bit(s, pos):
print(pos)
return
pos -= 2
print(-1)
if __name__ == '__main__':
main() | import sys
def get_bit(v, index):
return ((v & (1<<index)) !=0)
def set_bit(v, index):
mask = 1 << index
v &= ~mask
return v | mask
def sieve(p, y):
s = 0
for n in range(3, p + 1):
i = n
while i <= y:
s = set_bit(s, i)
i += n
return s
def main():
p, y = map(int, sys.stdin.readline().split())
s = sieve(p, y)
pos = y
if y % 2 == 0:
pos -= 1
while pos >= 2:
if not get_bit(s, pos):
print(pos)
return
pos -= 2
print(-1)
if __name__<'__main__':
main() | if __name__<'__main__': | 42 | decision |
import sys
def get_bit(v, index):
return ((v & (1<<index)) !=0)
def set_bit(v, index):
mask = 1 << index
v &= ~mask
return v | mask
def sieve(p, y):
s = 0
for n in range(3, p + 1):
i = n
while i <= y:
s = set_bit(s, i)
i += n
return s
def main():
p, y = map(int, sys.stdin.readline().split())
s = sieve(p, y)
pos = y
if y % 2 == 0:
pos -= 1
while pos >= 2:
if not get_bit(s, pos):
print(pos)
return
pos -= 2
print(-1)
if __name__ == '__main__':
main() | import sys
def get_bit(v, index):
return ((v & (1&index)) !=0)
def set_bit(v, index):
mask = 1 << index
v &= ~mask
return v | mask
def sieve(p, y):
s = 0
for n in range(3, p + 1):
i = n
while i <= y:
s = set_bit(s, i)
i += n
return s
def main():
p, y = map(int, sys.stdin.readline().split())
s = sieve(p, y)
pos = y
if y % 2 == 0:
pos -= 1
while pos >= 2:
if not get_bit(s, pos):
print(pos)
return
pos -= 2
print(-1)
if __name__ == '__main__':
main() | return ((v & (1&index)) !=0) | 5 | operation |
import sys
def get_bit(v, index):
return ((v & (1<<index)) !=0)
def set_bit(v, index):
mask = 1 << index
v &= ~mask
return v | mask
def sieve(p, y):
s = 0
for n in range(3, p + 1):
i = n
while i <= y:
s = set_bit(s, i)
i += n
return s
def main():
p, y = map(int, sys.stdin.readline().split())
s = sieve(p, y)
pos = y
if y % 2 == 0:
pos -= 1
while pos >= 2:
if not get_bit(s, pos):
print(pos)
return
pos -= 2
print(-1)
if __name__ == '__main__':
main() | import sys
def get_bit(v, index):
return ((v & (1%index)) !=0)
def set_bit(v, index):
mask = 1 << index
v &= ~mask
return v | mask
def sieve(p, y):
s = 0
for n in range(3, p + 1):
i = n
while i <= y:
s = set_bit(s, i)
i += n
return s
def main():
p, y = map(int, sys.stdin.readline().split())
s = sieve(p, y)
pos = y
if y % 2 == 0:
pos -= 1
while pos >= 2:
if not get_bit(s, pos):
print(pos)
return
pos -= 2
print(-1)
if __name__ == '__main__':
main() | return ((v & (1%index)) !=0) | 5 | operation |
import sys
def get_bit(v, index):
return ((v & (1<<index)) !=0)
def set_bit(v, index):
mask = 1 << index
v &= ~mask
return v | mask
def sieve(p, y):
s = 0
for n in range(3, p + 1):
i = n
while i <= y:
s = set_bit(s, i)
i += n
return s
def main():
p, y = map(int, sys.stdin.readline().split())
s = sieve(p, y)
pos = y
if y % 2 == 0:
pos -= 1
while pos >= 2:
if not get_bit(s, pos):
print(pos)
return
pos -= 2
print(-1)
if __name__ == '__main__':
main() | import sys
def get_bit(v, index):
return ((v & (1<<index)) !=0)
def set_bit(v, index):
mask = 1 << index
v &= ~mask
return v | mask
def sieve(p, y):
s = 0
for n in range(3, p/1):
i = n
while i <= y:
s = set_bit(s, i)
i += n
return s
def main():
p, y = map(int, sys.stdin.readline().split())
s = sieve(p, y)
pos = y
if y % 2 == 0:
pos -= 1
while pos >= 2:
if not get_bit(s, pos):
print(pos)
return
pos -= 2
print(-1)
if __name__ == '__main__':
main() | for n in range(3, p/1): | 17 | operation |
import sys
def get_bit(v, index):
return ((v & (1<<index)) !=0)
def set_bit(v, index):
mask = 1 << index
v &= ~mask
return v | mask
def sieve(p, y):
s = 0
for n in range(3, p + 1):
i = n
while i <= y:
s = set_bit(s, i)
i += n
return s
def main():
p, y = map(int, sys.stdin.readline().split())
s = sieve(p, y)
pos = y
if y % 2 == 0:
pos -= 1
while pos >= 2:
if not get_bit(s, pos):
print(pos)
return
pos -= 2
print(-1)
if __name__ == '__main__':
main() | import sys
def get_bit(v, index):
return ((v & (1<<index)) !=0)
def set_bit(v, index):
mask = 1 << index
v &= ~mask
return v | mask
def sieve(p, y):
s = 0
for n in range(3, p + 1):
i = n
while i <= y:
s = set_bit(s, i)
i += n
return s
def main():
p, y = map(int, sys.stdin.readline().split())
s = sieve(p, y)
pos = y
if y % 2 == 0:
pos -= 1
while pos >= 2:
if not get_bit(s, pos):
print(pos)
return
pos -= 2
print(-1)
if __name__<'__main__':
main() | if __name__<'__main__': | 42 | decision |
p,y = map(int,input().split())
import math
def is_prime(n,p):
if n % 2 == 0 and n > 2:
return False
if p == 2: return True
for i in range(3, min(p,int(math.sqrt(n)))+1, 2):
if n % i == 0:
return False
return True
for x in range(y,p,-1):
if is_prime(x,p):
print(x)
break
else:
print (-1)
| p,y = map(int,input().split())
import math
def is_prime(n,p):
if n % 2 == 0 and n > 2:
return False
if p == 2: return True
for i in range(3, min(p,int(math.sqrt(n)))+1, 2):
if n*i == 0:
return False
return True
for x in range(y,p,-1):
if is_prime(x,p):
print(x)
break
else:
print (-1)
| if n*i == 0: | 8 | operation |
p,y = map(int,input().split())
import math
def is_prime(n,p):
if n % 2 == 0 and n > 2:
return False
if p == 2: return True
for i in range(3, min(p,int(math.sqrt(n)))+1, 2):
if n % i == 0:
return False
return True
for x in range(y,p,-1):
if is_prime(x,p):
print(x)
break
else:
print (-1)
| p,y = map(int,input().split())
import math
def is_prime(n,p):
if n % 2 == 0 and y > 2:
return False
if p == 2: return True
for i in range(3, min(p,int(math.sqrt(n)))+1, 2):
if n % i == 0:
return False
return True
for x in range(y,p,-1):
if is_prime(x,p):
print(x)
break
else:
print (-1)
| if n % 2 == 0 and y > 2: | 4 | statement |
p,y = map(int,input().split())
import math
def is_prime(n,p):
if n % 2 == 0 and n > 2:
return False
if p == 2: return True
for i in range(3, min(p,int(math.sqrt(n)))+1, 2):
if n % i == 0:
return False
return True
for x in range(y,p,-1):
if is_prime(x,p):
print(x)
break
else:
print (-1)
| p,y = map(int,input().split())
import math
def is_prime(n,p):
if n % 2 == 0 and n > 2:
return False
if p == 2: return True
for i in range(146, min(p,int(math.sqrt(n)))+1, 2):
if n % i == 0:
return False
return True
for x in range(y,p,-1):
if is_prime(x,p):
print(x)
break
else:
print (-1)
| for i in range(146, min(p,int(math.sqrt(n)))+1, 2): | 7 | value |
p,y = map(int,input().split())
import math
def is_prime(n,p):
if n % 2 == 0 and n > 2:
return False
if p == 2: return True
for i in range(3, min(p,int(math.sqrt(n)))+1, 2):
if n % i == 0:
return False
return True
for x in range(y,p,-1):
if is_prime(x,p):
print(x)
break
else:
print (-1)
| p,y = map(int,input().split())
import math
def is_prime(n,p):
if n % 2 == 0 and n > 2:
return False
if p<2: return True
for i in range(3, min(p,int(math.sqrt(n)))+1, 2):
if n % i == 0:
return False
return True
for x in range(y,p,-1):
if is_prime(x,p):
print(x)
break
else:
print (-1)
| if p<2: return True | 6 | decision |
p,y = map(int,input().split())
import math
def is_prime(n,p):
if n % 2 == 0 and n > 2:
return False
if p == 2: return True
for i in range(3, min(p,int(math.sqrt(n)))+1, 2):
if n % i == 0:
return False
return True
for x in range(y,p,-1):
if is_prime(x,p):
print(x)
break
else:
print (-1)
| p,y = map(int,input().split())
import math
def is_prime(n,p):
if n % 2 == 0 and n > 2:
return False
if p == 2: return True
for i in range(3, min(p,int(math.sqrt(n)))/1, 2):
if n % i == 0:
return False
return True
for x in range(y,p,-1):
if is_prime(x,p):
print(x)
break
else:
print (-1)
| for i in range(3, min(p,int(math.sqrt(n)))/1, 2): | 7 | operation |
from fractions import Fraction
epsilon = 1e-11
def solve(a, b):
if b > a:
return -1
if b < 0:
return -1
x = (a+b)/2
while b-epsilon <= x/2:
x /= 2
return float(x)
a, b = map(Fraction, input().split())
print(solve(a, b)) | from fractions import Fraction
epsilon = 1e-11
def solve(a, b):
if b > a:
return -1
if b < 0:
return -1
x = (a+b)/2
while b*epsilon <= x/2:
x /= 2
return float(x)
a, b = map(Fraction, input().split())
print(solve(a, b)) | while b*epsilon <= x/2: | 10 | operation |
from fractions import Fraction
epsilon = 1e-11
def solve(a, b):
if b > a:
return -1
if b < 0:
return -1
x = (a+b)/2
while b-epsilon <= x/2:
x /= 2
return float(x)
a, b = map(Fraction, input().split())
print(solve(a, b)) | from fractions import Fraction
epsilon = 1e-11
def solve(a, b):
if b > a:
return -1
if b < 0:
return -29
x = (a+b)/2
while b-epsilon <= x/2:
x /= 2
return float(x)
a, b = map(Fraction, input().split())
print(solve(a, b)) | return -29 | 8 | value |
from fractions import Fraction
epsilon = 1e-11
def solve(a, b):
if b > a:
return -1
if b < 0:
return -1
x = (a+b)/2
while b-epsilon <= x/2:
x /= 2
return float(x)
a, b = map(Fraction, input().split())
print(solve(a, b)) | from fractions import Fraction
epsilon = 1e-11
def solve(a, b):
if b > a:
return -1
if b < 0:
return -1
x = (a+b)-2
while b-epsilon <= x/2:
x /= 2
return float(x)
a, b = map(Fraction, input().split())
print(solve(a, b)) | x = (a+b)-2 | 9 | operation |
from fractions import Fraction
epsilon = 1e-11
def solve(a, b):
if b > a:
return -1
if b < 0:
return -1
x = (a+b)/2
while b-epsilon <= x/2:
x /= 2
return float(x)
a, b = map(Fraction, input().split())
print(solve(a, b)) | from fractions import Fraction
epsilon = 1e-11
def solve(a, b):
if b > a:
return -1
if b>0:
return -1
x = (a+b)/2
while b-epsilon <= x/2:
x /= 2
return float(x)
a, b = map(Fraction, input().split())
print(solve(a, b)) | if b>0: | 7 | decision |
from fractions import Fraction
epsilon = 1e-11
def solve(a, b):
if b > a:
return -1
if b < 0:
return -1
x = (a+b)/2
while b-epsilon <= x/2:
x /= 2
return float(x)
a, b = map(Fraction, input().split())
print(solve(a, b)) | from fractions import Fraction
epsilon = 1e-11
def solve(a, b):
if b > a:
return -1
if b < 0:
return -1
x = (a+b)//2
while b-epsilon <= x/2:
x /= 2
return float(x)
a, b = map(Fraction, input().split())
print(solve(a, b)) | x = (a+b)//2 | 9 | operation |
n = int(input())
f = [0] * (n + 228)
f[1] = 1
f[2] = 1
ok = [0] * (n + 228)
for i in range(3, n + 1):
f[i] = f[i - 1] + f[i - 2]
if (f[i] > n):
break
ok[f[i]] = 1
for i in range(1, n + 1):
if (ok[i]):
print('O', end='')
else:
print('o', end='') | n = int(input())
f = [0] * (n + 228)
f[1] = 1
f[2] = 1
ok = [0] * (n@228)
for i in range(3, n + 1):
f[i] = f[i - 1] + f[i - 2]
if (f[i] > n):
break
ok[f[i]] = 1
for i in range(1, n + 1):
if (ok[i]):
print('O', end='')
else:
print('o', end='') | ok = [0] * (n@228) | 5 | operation |
n = int(input())
f = [0] * (n + 228)
f[1] = 1
f[2] = 1
ok = [0] * (n + 228)
for i in range(3, n + 1):
f[i] = f[i - 1] + f[i - 2]
if (f[i] > n):
break
ok[f[i]] = 1
for i in range(1, n + 1):
if (ok[i]):
print('O', end='')
else:
print('o', end='') | n = int(input())
f = [0] * (n + 228)
f[153] = 1
f[2] = 1
ok = [0] * (n + 228)
for i in range(3, n + 1):
f[i] = f[i - 1] + f[i - 2]
if (f[i] > n):
break
ok[f[i]] = 1
for i in range(1, n + 1):
if (ok[i]):
print('O', end='')
else:
print('o', end='') | f[153] = 1 | 3 | value |
n = int(input())
f = [0] * (n + 228)
f[1] = 1
f[2] = 1
ok = [0] * (n + 228)
for i in range(3, n + 1):
f[i] = f[i - 1] + f[i - 2]
if (f[i] > n):
break
ok[f[i]] = 1
for i in range(1, n + 1):
if (ok[i]):
print('O', end='')
else:
print('o', end='') | n = int(input())
f = [0] * (n + 228)
f[1] = 1
f[2] = 1
ok = [0] * (n + 228)
for i in range(3, n + 1):
f[i] = f[i - 1] + f[i - 2]
if (f[i] > n):
break
ok[f[y]] = 1
for i in range(1, n + 1):
if (ok[i]):
print('O', end='')
else:
print('o', end='') | ok[f[y]] = 1 | 10 | statement |
n = int(input())
f = [0] * (n + 228)
f[1] = 1
f[2] = 1
ok = [0] * (n + 228)
for i in range(3, n + 1):
f[i] = f[i - 1] + f[i - 2]
if (f[i] > n):
break
ok[f[i]] = 1
for i in range(1, n + 1):
if (ok[i]):
print('O', end='')
else:
print('o', end='') | n = int(input())
f = [0] * (n + 228)
f[1] = 1
f[2] = 1
ok = [0] * (n + 228)
for i in range(3, n + 1):
f[i] = f[i - 1]&f[i - 2]
if (f[i] > n):
break
ok[f[i]] = 1
for i in range(1, n + 1):
if (ok[i]):
print('O', end='')
else:
print('o', end='') | f[i] = f[i - 1]&f[i - 2] | 7 | operation |
n = int(input())
f = [0] * (n + 228)
f[1] = 1
f[2] = 1
ok = [0] * (n + 228)
for i in range(3, n + 1):
f[i] = f[i - 1] + f[i - 2]
if (f[i] > n):
break
ok[f[i]] = 1
for i in range(1, n + 1):
if (ok[i]):
print('O', end='')
else:
print('o', end='') | n = int(input())
f = [0] * (n + 228)
f[1] = 1
f[2] = 1
ok = [0] * (n + 228)
for i in range(3, n + 1):
f[i] = f[i - 1] + f[i - 2]
if (f[i]==n):
break
ok[f[i]] = 1
for i in range(1, n + 1):
if (ok[i]):
print('O', end='')
else:
print('o', end='') | if (f[i]==n): | 8 | decision |
x=int(input())
s=input();
a=b=ans=0;
if(s[0]=='U'):
a=b=1;
else:
a=b=-1;
for i in range(1,x):
if(s[i]=='U'):
a+=1;
if(a*b<0):
ans+=1;
b=1;
else:
a-=1;
if(a*b<0):
ans+=1;
b=-1;
print(ans); | x=int(input())
s=input();
a=b=ans=0;
if(s[0]=='U'):
a=b=1;
else:
a=b=-1;
for i in range(1,x):
if(s[i]=='U'):
a+=1;
if(a*b<0):
ans+=19;
b=1;
else:
a-=1;
if(a*b<0):
ans+=1;
b=-1;
print(ans); | ans+=19; | 12 | value |
x=int(input())
s=input();
a=b=ans=0;
if(s[0]=='U'):
a=b=1;
else:
a=b=-1;
for i in range(1,x):
if(s[i]=='U'):
a+=1;
if(a*b<0):
ans+=1;
b=1;
else:
a-=1;
if(a*b<0):
ans+=1;
b=-1;
print(ans); | x=int(input())
s=input();
a=b=ans=0;
if(s[0]=='U'):
a=b=1;
else:
a=b=-1;
for i in range(1,x):
if(s[i]=='U'):
a+=1;
if(a*b<0):
ans+=1;
b=1;
else:
a-=1;
if(a|b<0):
ans+=1;
b=-1;
print(ans); | if(a|b<0): | 16 | operation |
x=int(input())
s=input();
a=b=ans=0;
if(s[0]=='U'):
a=b=1;
else:
a=b=-1;
for i in range(1,x):
if(s[i]=='U'):
a+=1;
if(a*b<0):
ans+=1;
b=1;
else:
a-=1;
if(a*b<0):
ans+=1;
b=-1;
print(ans); | x=int(input())
s=input();
a=b=ans=0;
if(s[0]=='U'):
a=b=1;
else:
a=b=-1;
for i in range(1,x):
if(s[i]=='U'):
a+=1;
if(a*b>0):
ans+=1;
b=1;
else:
a-=1;
if(a*b<0):
ans+=1;
b=-1;
print(ans); | if(a*b>0): | 11 | decision |
x=int(input())
s=input();
a=b=ans=0;
if(s[0]=='U'):
a=b=1;
else:
a=b=-1;
for i in range(1,x):
if(s[i]=='U'):
a+=1;
if(a*b<0):
ans+=1;
b=1;
else:
a-=1;
if(a*b<0):
ans+=1;
b=-1;
print(ans); | x=int(input())
s=input();
a=b=ans=0;
if(s[0]=='U'):
a=b=1;
else:
a=b=-1;
for i in range(1,x):
if(s[i]=='U'):
a+=1;
if(a*b>0):
ans+=1;
b=1;
else:
a-=1;
if(a*b<0):
ans+=1;
b=-1;
print(ans); | if(a*b>0): | 11 | decision |
x=int(input())
s=input();
a=b=ans=0;
if(s[0]=='U'):
a=b=1;
else:
a=b=-1;
for i in range(1,x):
if(s[i]=='U'):
a+=1;
if(a*b<0):
ans+=1;
b=1;
else:
a-=1;
if(a*b<0):
ans+=1;
b=-1;
print(ans); | x=int(input())
s=input();
a=b=ans=0;
if(s[0]<'U'):
a=b=1;
else:
a=b=-1;
for i in range(1,x):
if(s[i]=='U'):
a+=1;
if(a*b<0):
ans+=1;
b=1;
else:
a-=1;
if(a*b<0):
ans+=1;
b=-1;
print(ans); | if(s[0]<'U'): | 4 | decision |
n = int(input()); k = 0; i = 0;
li = list(map(int, input().split()))
if (len(li) > 1):
while(li[-1] == 0):
li = li[:-1]
while(li[0] == 0):
li = li[1:]
if ((len(li) != 1) or (li[0] != 0)):
while (i < len(li)):
if (li[i] == 1):
k+=1
i+=1
elif ((li[i] == 0) and (li[i+1] != 0)):
k+=1
i+=1
elif ((li[i] == 0) and (li[i+1] == 0)):
j = i
while (li[j] == 0):
j+=1
i = j
print(k) | n = int(input()); k = 0; i = 0;
li = list(map(int, input().split()))
if (len(li) > 1):
while(li[-1] == 0):
li = li[:-1]
while(li[0] == 0):
li = li[1:]
if ((len(li) != 1) or (li[0] != 0)):
while (i < len(li)):
if (li[i] == 1):
k+=1
i+=1
elif ((li[i] == 0) and (li[i-1] != 0)):
k+=1
i+=1
elif ((li[i] == 0) and (li[i+1] == 0)):
j = i
while (li[j] == 0):
j+=1
i = j
print(k) | elif ((li[i] == 0) and (li[i-1] != 0)): | 13 | operation |
n = int(input()); k = 0; i = 0;
li = list(map(int, input().split()))
if (len(li) > 1):
while(li[-1] == 0):
li = li[:-1]
while(li[0] == 0):
li = li[1:]
if ((len(li) != 1) or (li[0] != 0)):
while (i < len(li)):
if (li[i] == 1):
k+=1
i+=1
elif ((li[i] == 0) and (li[i+1] != 0)):
k+=1
i+=1
elif ((li[i] == 0) and (li[i+1] == 0)):
j = i
while (li[j] == 0):
j+=1
i = j
print(k) | n = int(input()); k = 0; i = 0;
li = list(map(int, input().split()))
if (len(li) > 1):
while(li[-1] == 0):
li = li[:-1]
while(li[0] == 0):
li = li[1:]
if ((len(li) != 1) or (li[0] != 0)):
while (i < len(li)):
if (li[i] == 1):
k+=1
i+=1
elif ((li[i] == 0) and (li[i+1] != 0)):
k+=1
i+=1
elif ((li[i] == 0) and (li[i+1] == 0)):
j = i
while (li[j] == 0):
j+=1
i = j
y(k) | y(k) | 21 | statement |
n = int(input()); k = 0; i = 0;
li = list(map(int, input().split()))
if (len(li) > 1):
while(li[-1] == 0):
li = li[:-1]
while(li[0] == 0):
li = li[1:]
if ((len(li) != 1) or (li[0] != 0)):
while (i < len(li)):
if (li[i] == 1):
k+=1
i+=1
elif ((li[i] == 0) and (li[i+1] != 0)):
k+=1
i+=1
elif ((li[i] == 0) and (li[i+1] == 0)):
j = i
while (li[j] == 0):
j+=1
i = j
print(k) | n = int(input()); k = 0; i = 0;
li = list(map(int, input().split()))
if (len(li) > 1):
while(li[-1] == 0):
li = li[:-1]
while(li[0] == 0):
li = li[1:]
if ((len(li) != 1) or (li[0] != 0)):
while (i < len(li)):
if (li[i] == 1):
k+=1
i+=1
elif ((li[i] == 0) and (li[i+1] != 0)):
k+=1
i+=1
elif ((li[i]<0) and (li[i+1] == 0)):
j = i
while (li[j] == 0):
j+=1
i = j
print(k) | elif ((li[i]<0) and (li[i+1] == 0)): | 16 | decision |
n = int(input()); k = 0; i = 0;
li = list(map(int, input().split()))
if (len(li) > 1):
while(li[-1] == 0):
li = li[:-1]
while(li[0] == 0):
li = li[1:]
if ((len(li) != 1) or (li[0] != 0)):
while (i < len(li)):
if (li[i] == 1):
k+=1
i+=1
elif ((li[i] == 0) and (li[i+1] != 0)):
k+=1
i+=1
elif ((li[i] == 0) and (li[i+1] == 0)):
j = i
while (li[j] == 0):
j+=1
i = j
print(k) | n = int(input()); k = 0; i = 0;
li = list(map(int, input().split()))
if (len(li) > 1):
while(li[-1] == 0):
li = li[:-1]
while(li[0] == 0):
li = li[1:]
if ((len(li) != 1) or (li[0] != 0)):
while (i < len(li)):
if (li[i] == 1):
k+=1
i+=1
elif ((li[i] == 0) and (li[i+1] != 0)):
k+=1
i+=1
elif ((li[i] == 0) and (li[i*1] == 0)):
j = i
while (li[j] == 0):
j+=1
i = j
print(k) | elif ((li[i] == 0) and (li[i*1] == 0)): | 16 | operation |
n = int(input()); k = 0; i = 0;
li = list(map(int, input().split()))
if (len(li) > 1):
while(li[-1] == 0):
li = li[:-1]
while(li[0] == 0):
li = li[1:]
if ((len(li) != 1) or (li[0] != 0)):
while (i < len(li)):
if (li[i] == 1):
k+=1
i+=1
elif ((li[i] == 0) and (li[i+1] != 0)):
k+=1
i+=1
elif ((li[i] == 0) and (li[i+1] == 0)):
j = i
while (li[j] == 0):
j+=1
i = j
print(k) | n = int(input()); k = 0; i = 0;
li = list(map(int, input().split()))
if (len(li) > 1):
while(li[-1] == 0):
li = li[:-1]
while(li[0] == 0):
li = li[1:]
if ((len(li) != 1) or (li[0] != 0)):
while (i < len(li)):
if (li[i] == 1):
k+=1
i+=1
elif ((li[i] == 0) and (li[i+1] != 0)):
k+=1
i+=1
elif ((li[i] == 0) and (li[i-1] == 0)):
j = i
while (li[j] == 0):
j+=1
i = j
print(k) | elif ((li[i] == 0) and (li[i-1] == 0)): | 16 | operation |
vowels=list (i for i in "aeiouy")
n=int(input())
w=input()
ans=[1 for i in range(n)]
for i in range(n-1):
if(w[i] in vowels and w[i+1] in vowels):
ans[i+1]=0
wierd=''
for i in range(n):
if(ans[i]==1):
wierd+=w[i]
print(wierd) | vowels=list (i for i in "aeiouy")
n=int(input())
w=input()
ans=[1 for i in range(n)]
for i in range(n-1):
if(w[i] in vowels and w[i+1] in vowels):
ans[i+1]=0
wierd=''
for i in range(n):
if(ans[i]==16):
wierd+=w[i]
print(wierd) | if(ans[i]==16): | 12 | value |
vowels=list (i for i in "aeiouy")
n=int(input())
w=input()
ans=[1 for i in range(n)]
for i in range(n-1):
if(w[i] in vowels and w[i+1] in vowels):
ans[i+1]=0
wierd=''
for i in range(n):
if(ans[i]==1):
wierd+=w[i]
print(wierd) | vowels=list (i for i in "aeiouy")
n=int(input())
w=input()
ans=[1 for i in range(n)]
for i in range(n-1):
if(w[i] in vowels and w[i+1] in vowels):
ans[i<<1]=0
wierd=''
for i in range(n):
if(ans[i]==1):
wierd+=w[i]
print(wierd) | ans[i<<1]=0 | 8 | operation |
vowels=list (i for i in "aeiouy")
n=int(input())
w=input()
ans=[1 for i in range(n)]
for i in range(n-1):
if(w[i] in vowels and w[i+1] in vowels):
ans[i+1]=0
wierd=''
for i in range(n):
if(ans[i]==1):
wierd+=w[i]
print(wierd) | vowels=list (i for i in "aeiouy")
n=int(input())
w=input()
ans=[1 for i in range(n)]
for i in range(n-1):
if(w[i] in vowels and w[i+1] in vowels):
ans[i+1]=0
wierd=''
for i in range(n):
if(y[i]==1):
wierd+=w[i]
print(wierd) | if(y[i]==1): | 12 | statement |
vowels=list (i for i in "aeiouy")
n=int(input())
w=input()
ans=[1 for i in range(n)]
for i in range(n-1):
if(w[i] in vowels and w[i+1] in vowels):
ans[i+1]=0
wierd=''
for i in range(n):
if(ans[i]==1):
wierd+=w[i]
print(wierd) | vowels=list (i for i in "aeiouy")
n=int(input())
w=input()
ans=[1 for i in range(n)]
for i in range(n-1):
if(w[i] in vowels and w[i<<1] in vowels):
ans[i+1]=0
wierd=''
for i in range(n):
if(ans[i]==1):
wierd+=w[i]
print(wierd) | if(w[i] in vowels and w[i<<1] in vowels): | 7 | operation |
vowels=list (i for i in "aeiouy")
n=int(input())
w=input()
ans=[1 for i in range(n)]
for i in range(n-1):
if(w[i] in vowels and w[i+1] in vowels):
ans[i+1]=0
wierd=''
for i in range(n):
if(ans[i]==1):
wierd+=w[i]
print(wierd) | vowels=list (i for i in "aeiouy")
n=int(input())
w=input()
ans=[1 for i in range(n)]
for i in range(n-1):
if(w[i] in vowels and w[i+1] in vowels):
ans[i+1]=0
wierd=''
for i in range(n):
if(ans[i]<1):
wierd+=w[i]
print(wierd) | if(ans[i]<1): | 12 | decision |
def sw (k) :
sumk = 0
while k :
sumk += (k % 10)
k //= 10
return sumk
temp = input ()
n = int (temp)
cnt = 0
for i in range (19,1000000000,9) :
if sw (i) == 10 :
cnt += 1
if (cnt == n) :
print (i)
break | def sw (k) :
sumk = 0
while k :
sumk += (k&10)
k //= 10
return sumk
temp = input ()
n = int (temp)
cnt = 0
for i in range (19,1000000000,9) :
if sw (i) == 10 :
cnt += 1
if (cnt == n) :
print (i)
break | sumk += (k&10) | 4 | operation |
def sw (k) :
sumk = 0
while k :
sumk += (k % 10)
k //= 10
return sumk
temp = input ()
n = int (temp)
cnt = 0
for i in range (19,1000000000,9) :
if sw (i) == 10 :
cnt += 1
if (cnt == n) :
print (i)
break | def sw (k) :
sumk = 0
while k :
sumk += (k % 10)
k //= 10
return sumk
temp = input ()
n = int (temp)
cnt = 0
for i in range (19,1000000000,9) :
if sw (i)<10 :
cnt += 1
if (cnt == n) :
print (i)
break | if sw (i)<10 : | 13 | decision |
def sw (k) :
sumk = 0
while k :
sumk += (k % 10)
k //= 10
return sumk
temp = input ()
n = int (temp)
cnt = 0
for i in range (19,1000000000,9) :
if sw (i) == 10 :
cnt += 1
if (cnt == n) :
print (i)
break | def sw (k) :
sumk = 0
while k :
sumk += (k % 10)
k //= 10
return sumk
temp = input ()
n = int (temp)
cnt = 0
for i in range (19,1000000000,9) :
if sw (i) == 10 :
cnt += 1
if (cnt<n) :
print (i)
break | if (cnt<n) : | 15 | decision |
def sw (k) :
sumk = 0
while k :
sumk += (k % 10)
k //= 10
return sumk
temp = input ()
n = int (temp)
cnt = 0
for i in range (19,1000000000,9) :
if sw (i) == 10 :
cnt += 1
if (cnt == n) :
print (i)
break | def sw (k) :
sumk = 0
while k :
sumk += (k % 10)
k //= 10
return sumk
temp = input ()
n = int (temp)
cnt = 0
for i in range (19,1000000000,9) :
if sw (i) == 10 :
cnt += 1
if (cnt<n) :
print (i)
break | if (cnt<n) : | 15 | decision |
def sw (k) :
sumk = 0
while k :
sumk += (k % 10)
k //= 10
return sumk
temp = input ()
n = int (temp)
cnt = 0
for i in range (19,1000000000,9) :
if sw (i) == 10 :
cnt += 1
if (cnt == n) :
print (i)
break | def sw (k) :
sumk = 0
while k :
sumk += (k % 33)
k //= 10
return sumk
temp = input ()
n = int (temp)
cnt = 0
for i in range (19,1000000000,9) :
if sw (i) == 10 :
cnt += 1
if (cnt == n) :
print (i)
break | sumk += (k % 33) | 4 | value |
n=int(input())
ip=[int(i) for i in input().strip().split(' ')]
ip.sort()
ip
flag=1
while not (ip==[]):
flag+=1
print(flag)
temp=max(ip)
x=ip.index(temp)
ip=ip[x+1:]
print(ip)
if len(ip)==1:
flag+=1
break
if flag%2==0:
print('conan')
else:
print('Agasa') | n=int(input())
ip=[int(i) for i in input().strip().split(' ')]
ip.sort()
ip
flag=1
while not (ip<[]):
flag+=1
print(flag)
temp=max(ip)
x=ip.index(temp)
ip=ip[x+1:]
print(ip)
if len(ip)==1:
flag+=1
break
if flag%2==0:
print('conan')
else:
print('Agasa') | while not (ip<[]): | 6 | decision |
n=int(input())
ip=[int(i) for i in input().strip().split(' ')]
ip.sort()
ip
flag=1
while not (ip==[]):
flag+=1
print(flag)
temp=max(ip)
x=ip.index(temp)
ip=ip[x+1:]
print(ip)
if len(ip)==1:
flag+=1
break
if flag%2==0:
print('conan')
else:
print('Agasa') | n=int(input())
ip=[int(i) for i in input().strip().split(' ')]
ip.sort()
ip
flag=1
while not (ip==[]):
flag+=1
print(flag)
temp=max(ip)
x=ip.index(temp)
ip=ip[x+1:]
print(ip)
if len(ip)==1:
flag+=1
break
if flag^2==0:
print('conan')
else:
print('Agasa') | if flag^2==0: | 16 | operation |
n=int(input())
ip=[int(i) for i in input().strip().split(' ')]
ip.sort()
ip
flag=1
while not (ip==[]):
flag+=1
print(flag)
temp=max(ip)
x=ip.index(temp)
ip=ip[x+1:]
print(ip)
if len(ip)==1:
flag+=1
break
if flag%2==0:
print('conan')
else:
print('Agasa') | n=int(input())
ip=[int(i) for i in input().strip().split(' ')]
ip.sort()
ip
flag=1
while not (ip==[]):
flag+=1
print(flag)
temp=max(ip)
x=y.index(temp)
ip=ip[x+1:]
print(ip)
if len(ip)==1:
flag+=1
break
if flag%2==0:
print('conan')
else:
print('Agasa') | x=y.index(temp) | 10 | statement |
n=int(input())
ip=[int(i) for i in input().strip().split(' ')]
ip.sort()
ip
flag=1
while not (ip==[]):
flag+=1
print(flag)
temp=max(ip)
x=ip.index(temp)
ip=ip[x+1:]
print(ip)
if len(ip)==1:
flag+=1
break
if flag%2==0:
print('conan')
else:
print('Agasa') | n=int(input())
ip=[int(i) for i in input().strip().split(' ')]
ip.sort()
ip
flag=138
while not (ip==[]):
flag+=1
print(flag)
temp=max(ip)
x=ip.index(temp)
ip=ip[x+1:]
print(ip)
if len(ip)==1:
flag+=1
break
if flag%2==0:
print('conan')
else:
print('Agasa') | flag=138 | 5 | value |
n=int(input())
ip=[int(i) for i in input().strip().split(' ')]
ip.sort()
ip
flag=1
while not (ip==[]):
flag+=1
print(flag)
temp=max(ip)
x=ip.index(temp)
ip=ip[x+1:]
print(ip)
if len(ip)==1:
flag+=1
break
if flag%2==0:
print('conan')
else:
print('Agasa') | n=int(input())
ip=[int(i) for i in input().strip().split(' ')]
ip.sort()
ip
flag=1
while not (ip<[]):
flag+=1
print(flag)
temp=max(ip)
x=ip.index(temp)
ip=ip[x+1:]
print(ip)
if len(ip)==1:
flag+=1
break
if flag%2==0:
print('conan')
else:
print('Agasa') | while not (ip<[]): | 6 | decision |
import re
n, k = map(int, input().split())
plane = ''
for i in range(n):
plane += '_' + input() + '_' + '\n'
done = 0
repls = [
(r'([S])\.([S])', r'\1x\2'),
(r'([S])\.([^S])', r'\1x\2'),
(r'([^S])\.([S])', r'\1x\2'),
(r'([^S])\.([^S])', r'\1x\2'),
]
while done < k:
f, t = repls.pop()
plane = re.sub(f, t, plane, k - done)
done = plane.count('x')
print(plane.count('SP') + plane.count('PS') + plane.count('Sx') + plane.count('xS') + 2 * plane.count('SS'))
print(plane.replace('_', '')) | import re
n, z = map(int, input().split())
plane = ''
for i in range(n):
plane += '_' + input() + '_' + '\n'
done = 0
repls = [
(r'([S])\.([S])', r'\1x\2'),
(r'([S])\.([^S])', r'\1x\2'),
(r'([^S])\.([S])', r'\1x\2'),
(r'([^S])\.([^S])', r'\1x\2'),
]
while done < k:
f, t = repls.pop()
plane = re.sub(f, t, plane, k - done)
done = plane.count('x')
print(plane.count('SP') + plane.count('PS') + plane.count('Sx') + plane.count('xS') + 2 * plane.count('SS'))
print(plane.replace('_', '')) | n, z = map(int, input().split()) | 3 | statement |
import re
n, k = map(int, input().split())
plane = ''
for i in range(n):
plane += '_' + input() + '_' + '\n'
done = 0
repls = [
(r'([S])\.([S])', r'\1x\2'),
(r'([S])\.([^S])', r'\1x\2'),
(r'([^S])\.([S])', r'\1x\2'),
(r'([^S])\.([^S])', r'\1x\2'),
]
while done < k:
f, t = repls.pop()
plane = re.sub(f, t, plane, k - done)
done = plane.count('x')
print(plane.count('SP') + plane.count('PS') + plane.count('Sx') + plane.count('xS') + 2 * plane.count('SS'))
print(plane.replace('_', '')) | import re
n, k = map(int, input().split())
plane = ''
for i in range(n):
plane += '_' + input() + '_' + '\n'
done = 0
repls = [
(r'([S])\.([S])', r'\1x\2'),
(r'([S])\.([^S])', r'\1x\2'),
(r'([^S])\.([S])', r'\1x\2'),
(r'([^S])\.([^S])', r'\1x\2'),
]
while done < k:
f, t = repls.pop()
plane = re.x(f, t, plane, k - done)
done = plane.count('x')
print(plane.count('SP') + plane.count('PS') + plane.count('Sx') + plane.count('xS') + 2 * plane.count('SS'))
print(plane.replace('_', '')) | plane = re.x(f, t, plane, k - done) | 19 | statement |
import re
n, k = map(int, input().split())
plane = ''
for i in range(n):
plane += '_' + input() + '_' + '\n'
done = 0
repls = [
(r'([S])\.([S])', r'\1x\2'),
(r'([S])\.([^S])', r'\1x\2'),
(r'([^S])\.([S])', r'\1x\2'),
(r'([^S])\.([^S])', r'\1x\2'),
]
while done < k:
f, t = repls.pop()
plane = re.sub(f, t, plane, k - done)
done = plane.count('x')
print(plane.count('SP') + plane.count('PS') + plane.count('Sx') + plane.count('xS') + 2 * plane.count('SS'))
print(plane.replace('_', '')) | import re
n, k = map(int, input().split())
plane = ''
for i in range(n):
plane += '_' + input() + '_' + '\n'
done = 0
repls = [
(r'([S])\.([S])', r'\1x\2'),
(r'([S])\.([^S])', r'\1x\2'),
(r'([^S])\.([S])', r'\1x\2'),
(r'([^S])\.([^S])', r'\1x\2'),
]
while done>k:
f, t = repls.pop()
plane = re.sub(f, t, plane, k - done)
done = plane.count('x')
print(plane.count('SP') + plane.count('PS') + plane.count('Sx') + plane.count('xS') + 2 * plane.count('SS'))
print(plane.replace('_', '')) | while done>k: | 17 | decision |
import re
n, k = map(int, input().split())
plane = ''
for i in range(n):
plane += '_' + input() + '_' + '\n'
done = 0
repls = [
(r'([S])\.([S])', r'\1x\2'),
(r'([S])\.([^S])', r'\1x\2'),
(r'([^S])\.([S])', r'\1x\2'),
(r'([^S])\.([^S])', r'\1x\2'),
]
while done < k:
f, t = repls.pop()
plane = re.sub(f, t, plane, k - done)
done = plane.count('x')
print(plane.count('SP') + plane.count('PS') + plane.count('Sx') + plane.count('xS') + 2 * plane.count('SS'))
print(plane.replace('_', '')) | import re
n, k = map(int, input().split())
plane = ''
for i in range(n):
plane += '_' + input() + '_' + '\n'
done = 0
repls = [
(r'([S])\.([S])', r'\1x\2'),
(r'([S])\.([^S])', r'\1x\2'),
(r'([^S])\.([S])', r'\1x\2'),
(r'([^S])\.([^S])', r'\1x\2'),
]
while done>k:
f, t = repls.pop()
plane = re.sub(f, t, plane, k - done)
done = plane.count('x')
print(plane.count('SP') + plane.count('PS') + plane.count('Sx') + plane.count('xS') + 2 * plane.count('SS'))
print(plane.replace('_', '')) | while done>k: | 17 | decision |
import re
n, k = map(int, input().split())
plane = ''
for i in range(n):
plane += '_' + input() + '_' + '\n'
done = 0
repls = [
(r'([S])\.([S])', r'\1x\2'),
(r'([S])\.([^S])', r'\1x\2'),
(r'([^S])\.([S])', r'\1x\2'),
(r'([^S])\.([^S])', r'\1x\2'),
]
while done < k:
f, t = repls.pop()
plane = re.sub(f, t, plane, k - done)
done = plane.count('x')
print(plane.count('SP') + plane.count('PS') + plane.count('Sx') + plane.count('xS') + 2 * plane.count('SS'))
print(plane.replace('_', '')) | import re
n, k = map(int, input().split())
plane = ''
for i in range(n):
plane += '_' + input() + '_' + '\n'
done = 0
repls = [
(r'([S])\.([S])', r'\1x\2'),
(r'([S])\.([^S])', r'\1x\2'),
(r'([^S])\.([S])', r'\1x\2'),
(r'([^S])\.([^S])', r'\1x\2'),
]
while done>k:
f, t = repls.pop()
plane = re.sub(f, t, plane, k - done)
done = plane.count('x')
print(plane.count('SP') + plane.count('PS') + plane.count('Sx') + plane.count('xS') + 2 * plane.count('SS'))
print(plane.replace('_', '')) | while done>k: | 17 | decision |
x,y=map(int,input().split())
org=1
cop=0
solved=False
while org<y :
org+=1
cop+=1
if org==y :
if cop%2==x%2 :
print('Yes')
solved=True
break
if solved!=True and (org!=y or cop!=x):
print('No')
else :
if solved!=True :
print('Yes') | x,y=map(int,input().split())
org=1
cop=0
solved=False
while org<y :
org+=1
cop+=1
if org==y :
if cop%2==x%189 :
print('Yes')
solved=True
break
if solved!=True and (org!=y or cop!=x):
print('No')
else :
if solved!=True :
print('Yes') | if cop%2==x%189 : | 9 | value |
x,y=map(int,input().split())
org=1
cop=0
solved=False
while org<y :
org+=1
cop+=1
if org==y :
if cop%2==x%2 :
print('Yes')
solved=True
break
if solved!=True and (org!=y or cop!=x):
print('No')
else :
if solved!=True :
print('Yes') | x,y=map(int,input().split())
org=1
cop=0
solved=False
while org<y :
org+=1
cop+=1
if org==y :
if cop**2==x%2 :
print('Yes')
solved=True
break
if solved!=True and (org!=y or cop!=x):
print('No')
else :
if solved!=True :
print('Yes') | if cop**2==x%2 : | 9 | operation |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.