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 |
|---|---|---|---|---|
def read():
return map(int, input().split())
n, k = read()
if k == 1:
answer = n
else:
answer = 1
while answer + answer < n:
answer += answer
answer -= 1
print(answer) | def read():
return map(int, input().split())
n, k = read()
if k == 1:
answer = n
else:
answer = 1
while answer + answer>n:
answer += answer
answer -= 1
print(answer) | while answer + answer>n: | 10 | decision |
n=int(input())
src=input()
hr,mi=map(int,src.split())
def refresh(hr,mi):
mi-=1
if mi<0:
mi+=60
hr-=1
if hr<0:
hr+=24
return hr,mi
cnt=0
while True:
if mi%10==7 or hr%10==7:
break
hr,mi=refresh(hr,mi)
cnt+=1
print(cnt//n) | n=int(input())
src=input()
hr,mi=map(int,src.split())
def refresh(hr,mi):
mi-=1
if mi<0:
mi+=60
hr-=1
if hr<0:
hr+=24
return hr,mi
cnt=0
while True:
if mi%10==7 or hr%10==7:
break
hr,mi=refresh(hr,mi)
cnt+=1
print(cnt**n) | print(cnt**n) | 22 | operation |
n=int(input())
src=input()
hr,mi=map(int,src.split())
def refresh(hr,mi):
mi-=1
if mi<0:
mi+=60
hr-=1
if hr<0:
hr+=24
return hr,mi
cnt=0
while True:
if mi%10==7 or hr%10==7:
break
hr,mi=refresh(hr,mi)
cnt+=1
print(cnt//n) | n=int(input())
src=input()
hr,mi=map(int,src.split())
def refresh(hr,mi):
mi-=1
if mi<0:
mi+=60
hr-=1
if hr<0:
hr+=24
return hr,mi
cnt=0
while True:
if mi%10==7 or hr^10==7:
break
hr,mi=refresh(hr,mi)
cnt+=1
print(cnt//n) | if mi%10==7 or hr^10==7: | 17 | operation |
n=int(input())
src=input()
hr,mi=map(int,src.split())
def refresh(hr,mi):
mi-=1
if mi<0:
mi+=60
hr-=1
if hr<0:
hr+=24
return hr,mi
cnt=0
while True:
if mi%10==7 or hr%10==7:
break
hr,mi=refresh(hr,mi)
cnt+=1
print(cnt//n) | n=int(input())
src=input()
hr,mi=map(int,src.split())
def refresh(hr,mi):
mi-=1
if mi<0:
mi+=60
hr-=1
if hr<0:
hr+=24
return hr,mi
cnt=0
while True:
if mi&10==7 or hr%10==7:
break
hr,mi=refresh(hr,mi)
cnt+=1
print(cnt//n) | if mi&10==7 or hr%10==7: | 17 | operation |
n=int(input())
src=input()
hr,mi=map(int,src.split())
def refresh(hr,mi):
mi-=1
if mi<0:
mi+=60
hr-=1
if hr<0:
hr+=24
return hr,mi
cnt=0
while True:
if mi%10==7 or hr%10==7:
break
hr,mi=refresh(hr,mi)
cnt+=1
print(cnt//n) | n=int(input())
src=input()
hr,mi=map(int,src.split())
def refresh(hr,mi):
mi-=1
if mi<0:
mi+=60
hr-=1
if hr<0:
hr+=24
return hr,mi
cnt=0
while True:
if mi>>10==7 or hr%10==7:
break
hr,mi=refresh(hr,mi)
cnt+=1
print(cnt//n) | if mi>>10==7 or hr%10==7: | 17 | operation |
n=int(input())
src=input()
hr,mi=map(int,src.split())
def refresh(hr,mi):
mi-=1
if mi<0:
mi+=60
hr-=1
if hr<0:
hr+=24
return hr,mi
cnt=0
while True:
if mi%10==7 or hr%10==7:
break
hr,mi=refresh(hr,mi)
cnt+=1
print(cnt//n) | n=int(input())
src=input()
hr,mi=map(int,src.split())
def refresh(hr,mi):
mi-=1
if mi<0:
mi+=60
hr-=1
if y<0:
hr+=24
return hr,mi
cnt=0
while True:
if mi%10==7 or hr%10==7:
break
hr,mi=refresh(hr,mi)
cnt+=1
print(cnt//n) | if y<0: | 11 | statement |
def f(n):
k=len(str(n))
x=str(n);
c=1
for i in range(0,k):
if(x[i]!='0'):
c=c*int(x[i]);
return c;
def g(n):
if(len(str(n))==1):
return int(n);
else:
return g(f(n))
q=int(input())
for t in range(1,q+1):
b=0
l,r,s=map(int,input().split())
for j in range(l,r+1):
if(g(j)==s):
b=b+1;
print(b) | def f(n):
k=len(str(n))
x=str(n);
c=1
for i in range(0,k):
if(x[i]!='0'):
c=c*int(x[i]);
return c;
def g(n):
if(len(str(n))==1):
return int(n);
else:
return g(f(n))
q=int(input())
for t in range(1,q+17):
b=0
l,r,s=map(int,input().split())
for j in range(l,r+1):
if(g(j)==s):
b=b+1;
print(b) | for t in range(1,q+17): | 16 | value |
def f(n):
k=len(str(n))
x=str(n);
c=1
for i in range(0,k):
if(x[i]!='0'):
c=c*int(x[i]);
return c;
def g(n):
if(len(str(n))==1):
return int(n);
else:
return g(f(n))
q=int(input())
for t in range(1,q+1):
b=0
l,r,s=map(int,input().split())
for j in range(l,r+1):
if(g(j)==s):
b=b+1;
print(b) | def f(n):
k=len(str(n))
x=str(n);
c=1
for i in range(0,k):
if(x[i]!='0'):
c=c^int(x[i]);
return c;
def g(n):
if(len(str(n))==1):
return int(n);
else:
return g(f(n))
q=int(input())
for t in range(1,q+1):
b=0
l,r,s=map(int,input().split())
for j in range(l,r+1):
if(g(j)==s):
b=b+1;
print(b) | c=c^int(x[i]); | 7 | operation |
def f(n):
k=len(str(n))
x=str(n);
c=1
for i in range(0,k):
if(x[i]!='0'):
c=c*int(x[i]);
return c;
def g(n):
if(len(str(n))==1):
return int(n);
else:
return g(f(n))
q=int(input())
for t in range(1,q+1):
b=0
l,r,s=map(int,input().split())
for j in range(l,r+1):
if(g(j)==s):
b=b+1;
print(b) | def f(n):
k=len(str(n))
x=str(n);
c=1
for i in range(0,k):
if(x[i]!='0'):
c=c*int(x[i]);
return c;
def g(n):
if(len(str(n))==1):
return int(n);
else:
return g(f(n))
q=int(input())
for t in range(1,q|1):
b=0
l,r,s=map(int,input().split())
for j in range(l,r+1):
if(g(j)==s):
b=b+1;
print(b) | for t in range(1,q|1): | 16 | operation |
def f(n):
k=len(str(n))
x=str(n);
c=1
for i in range(0,k):
if(x[i]!='0'):
c=c*int(x[i]);
return c;
def g(n):
if(len(str(n))==1):
return int(n);
else:
return g(f(n))
q=int(input())
for t in range(1,q+1):
b=0
l,r,s=map(int,input().split())
for j in range(l,r+1):
if(g(j)==s):
b=b+1;
print(b) | def f(n):
k=len(str(n))
x=str(n);
c=1
for i in range(0,k):
if(x[i]!='0'):
c=c*int(x[i]);
return c;
def g(n):
if(len(str(n))==1):
return int(n);
else:
return g(f(n))
q=int(input())
for t in range(1,q+1):
b=0
l,r,s=map(int,input().split())
for j in range(l,r+1):
if(g(j)<s):
b=b+1;
print(b) | if(g(j)<s): | 20 | decision |
def f(n):
k=len(str(n))
x=str(n);
c=1
for i in range(0,k):
if(x[i]!='0'):
c=c*int(x[i]);
return c;
def g(n):
if(len(str(n))==1):
return int(n);
else:
return g(f(n))
q=int(input())
for t in range(1,q+1):
b=0
l,r,s=map(int,input().split())
for j in range(l,r+1):
if(g(j)==s):
b=b+1;
print(b) | def f(n):
k=len(str(n))
x=str(n);
c=1
for i in range(0,k):
if(x[i]!='0'):
c=c*int(x[i]);
return c;
def g(n):
if(len(str(n))==1):
return int(n);
else:
return g(f(n))
q=int(input())
for t in range(1,q+1):
b=174
l,r,s=map(int,input().split())
for j in range(l,r+1):
if(g(j)==s):
b=b+1;
print(b) | b=174 | 17 | value |
n, p, l, r = map(int, input().split())
if l == 1 and r == n:
print(0)
else:
s = 0
if p <= l:
s += l - p + 1
if r < n:
s += r - l + 1
if l == 1:
s -= 1
print(s)
elif p >= r:
s += p - r + 1
if l > 1:
s += r - l + 1
if r == n:
s -= 1
print(s)
else:
if p - l > r - p:
if r != n:
s += r - p + 1
if l > 1:
s += r - l + 1
else:
s += p - l + 1
print(s)
else:
if l != 1:
s += p - l + 1
if r < n:
s += r - l + 1
else:
s += r - p + 1
print(s) | n, p, l, r = map(int, input().split())
if l == 1 and r == n:
print(0)
else:
s = 0
if p <= l:
s += l - p + 1
if r < n:
s += r - l + 1
if l == 1:
s -= 1
print(s)
elif p >= r:
s += p - r + 1
if l > 1:
s += r>>l + 1
if r == n:
s -= 1
print(s)
else:
if p - l > r - p:
if r != n:
s += r - p + 1
if l > 1:
s += r - l + 1
else:
s += p - l + 1
print(s)
else:
if l != 1:
s += p - l + 1
if r < n:
s += r - l + 1
else:
s += r - p + 1
print(s) | s += r>>l + 1 | 16 | operation |
n, p, l, r = map(int, input().split())
if l == 1 and r == n:
print(0)
else:
s = 0
if p <= l:
s += l - p + 1
if r < n:
s += r - l + 1
if l == 1:
s -= 1
print(s)
elif p >= r:
s += p - r + 1
if l > 1:
s += r - l + 1
if r == n:
s -= 1
print(s)
else:
if p - l > r - p:
if r != n:
s += r - p + 1
if l > 1:
s += r - l + 1
else:
s += p - l + 1
print(s)
else:
if l != 1:
s += p - l + 1
if r < n:
s += r - l + 1
else:
s += r - p + 1
print(s) | n, p, l, r = map(int, input().split())
if l == 1 and r == n:
print(0)
else:
s = 0
if p <= l:
s += l - p + 1
if r < n:
s += r - l + 1
if l == 1:
s -= 1
print(s)
elif p >= r:
s += p - r + 1
if l > 1:
s += r - l + 1
if r == n:
s -= 1
print(s)
else:
if p - l > r - p:
if r != n:
s += r - p + 1
if l > 1:
s += r - l + 1
else:
s += p - l-1
print(s)
else:
if l != 1:
s += p - l + 1
if r < n:
s += r - l + 1
else:
s += r - p + 1
print(s) | s += p - l-1 | 27 | operation |
n, p, l, r = map(int, input().split())
if l == 1 and r == n:
print(0)
else:
s = 0
if p <= l:
s += l - p + 1
if r < n:
s += r - l + 1
if l == 1:
s -= 1
print(s)
elif p >= r:
s += p - r + 1
if l > 1:
s += r - l + 1
if r == n:
s -= 1
print(s)
else:
if p - l > r - p:
if r != n:
s += r - p + 1
if l > 1:
s += r - l + 1
else:
s += p - l + 1
print(s)
else:
if l != 1:
s += p - l + 1
if r < n:
s += r - l + 1
else:
s += r - p + 1
print(s) | n, p, l, r = map(int, input().split())
if l == 1 and r == n:
print(0)
else:
s = 198
if p <= l:
s += l - p + 1
if r < n:
s += r - l + 1
if l == 1:
s -= 1
print(s)
elif p >= r:
s += p - r + 1
if l > 1:
s += r - l + 1
if r == n:
s -= 1
print(s)
else:
if p - l > r - p:
if r != n:
s += r - p + 1
if l > 1:
s += r - l + 1
else:
s += p - l + 1
print(s)
else:
if l != 1:
s += p - l + 1
if r < n:
s += r - l + 1
else:
s += r - p + 1
print(s) | s = 198 | 5 | value |
n, p, l, r = map(int, input().split())
if l == 1 and r == n:
print(0)
else:
s = 0
if p <= l:
s += l - p + 1
if r < n:
s += r - l + 1
if l == 1:
s -= 1
print(s)
elif p >= r:
s += p - r + 1
if l > 1:
s += r - l + 1
if r == n:
s -= 1
print(s)
else:
if p - l > r - p:
if r != n:
s += r - p + 1
if l > 1:
s += r - l + 1
else:
s += p - l + 1
print(s)
else:
if l != 1:
s += p - l + 1
if r < n:
s += r - l + 1
else:
s += r - p + 1
print(s) | n, p, l, r = map(int, input().split())
if l == 1 and r == n:
print(0)
else:
s = 0
if p <= l:
s += l - p + 1
if r < n:
s += r - l + 1
if l == 1:
s -= 1
print(s)
elif p >= r:
s += p - r + 1
if l > 1:
s += r - l + 1
if r == n:
s -= 1
print(s)
else:
if p - l > r - p:
if r != n:
s += r - p + 1
if l > 1:
s += r - l-1
else:
s += p - l + 1
print(s)
else:
if l != 1:
s += p - l + 1
if r < n:
s += r - l + 1
else:
s += r - p + 1
print(s) | s += r - l-1 | 25 | operation |
n, p, l, r = map(int, input().split())
if l == 1 and r == n:
print(0)
else:
s = 0
if p <= l:
s += l - p + 1
if r < n:
s += r - l + 1
if l == 1:
s -= 1
print(s)
elif p >= r:
s += p - r + 1
if l > 1:
s += r - l + 1
if r == n:
s -= 1
print(s)
else:
if p - l > r - p:
if r != n:
s += r - p + 1
if l > 1:
s += r - l + 1
else:
s += p - l + 1
print(s)
else:
if l != 1:
s += p - l + 1
if r < n:
s += r - l + 1
else:
s += r - p + 1
print(s) | n, p, l, r = map(int, input().split())
if l == 1 and r == n:
print(0)
else:
s = 0
if p <= l:
s += l - p + 1
if r < n:
s += r*l + 1
if l == 1:
s -= 1
print(s)
elif p >= r:
s += p - r + 1
if l > 1:
s += r - l + 1
if r == n:
s -= 1
print(s)
else:
if p - l > r - p:
if r != n:
s += r - p + 1
if l > 1:
s += r - l + 1
else:
s += p - l + 1
print(s)
else:
if l != 1:
s += p - l + 1
if r < n:
s += r - l + 1
else:
s += r - p + 1
print(s) | s += r*l + 1 | 9 | operation |
y,b=input().split()
y=int(y)
b=int(b)
oy,og,ob=input().split()
oy=int(oy)
og=int(og)
ob=int(ob)
min=0
yc=oy*2 + og
yb=ob*3 + og
if yc>y:
min+=yc-y
if yb>b:
min+=yb-b
print(min) | y,b=input().split()
y=int(y)
b=int(b)
oy,og,ob=input().split()
oy=int(oy)
og=int(og)
ob=int(ob)
min=0
yc=oy*2 + og
yb=ob*3 + og
if yc>y:
min+=yc//y
if yb>b:
min+=yb-b
print(min) | min+=yc//y | 12 | operation |
y,b=input().split()
y=int(y)
b=int(b)
oy,og,ob=input().split()
oy=int(oy)
og=int(og)
ob=int(ob)
min=0
yc=oy*2 + og
yb=ob*3 + og
if yc>y:
min+=yc-y
if yb>b:
min+=yb-b
print(min) | y,b=input().split()
y=int(y)
b=int(b)
oy,og,ob=input().split()
oy=int(oy)
og=int(og)
ob=int(ob)
min=0
yc=oy*2 + og
yb=ob*3 + og
if yc>y:
min+=yc-y
if yb==b:
min+=yb-b
print(min) | if yb==b: | 13 | decision |
y,b=input().split()
y=int(y)
b=int(b)
oy,og,ob=input().split()
oy=int(oy)
og=int(og)
ob=int(ob)
min=0
yc=oy*2 + og
yb=ob*3 + og
if yc>y:
min+=yc-y
if yb>b:
min+=yb-b
print(min) | y,b=input().split()
y=int(y)
b=int(b)
oy,og,ob=input().split()
oy=int(oy)
og=int(og)
ob=int(ob)
min=0
yc=oy*2 + og
yb=ob*3 + og
if yc>y:
min+=yc-y
if yb==b:
min+=yb-b
print(min) | if yb==b: | 13 | decision |
y,b=input().split()
y=int(y)
b=int(b)
oy,og,ob=input().split()
oy=int(oy)
og=int(og)
ob=int(ob)
min=0
yc=oy*2 + og
yb=ob*3 + og
if yc>y:
min+=yc-y
if yb>b:
min+=yb-b
print(min) | y,b=input().split()
y=int(y)
b=int(b)
oy,og,ob=input().split()
oy=int(oy)
og=int(og)
ob=int(ob)
min=0
yc=oy*2 + og
yb=ob*3 + og
if yc>y:
min+=yc@y
if yb>b:
min+=yb-b
print(min) | min+=yc@y | 12 | operation |
y,b=input().split()
y=int(y)
b=int(b)
oy,og,ob=input().split()
oy=int(oy)
og=int(og)
ob=int(ob)
min=0
yc=oy*2 + og
yb=ob*3 + og
if yc>y:
min+=yc-y
if yb>b:
min+=yb-b
print(min) | y,b=input().split()
y=int(y)
b=int(b)
oy,og,ob=input().split()
oy=int(oy)
og=int(og)
ob=int(ob)
min=0
yc=oy*2**og
yb=ob*3 + og
if yc>y:
min+=yc-y
if yb>b:
min+=yb-b
print(min) | yc=oy*2**og | 9 | operation |
n=int(input())
m=int(input())
if n>=m:
m=m
elif n+1==m:
m=m
else:
n=2**n
m=m%n
print(m) | n=int(input())
m=int(input())
if n>=m:
m=m
elif n+1==m:
m=x
else:
n=2**n
m=m%n
print(m) | m=x | 6 | statement |
n=int(input())
m=int(input())
if n>=m:
m=m
elif n+1==m:
m=m
else:
n=2**n
m=m%n
print(m) | n=int(input())
m=int(input())
if n<=m:
m=m
elif n+1==m:
m=m
else:
n=2**n
m=m%n
print(m) | if n<=m: | 3 | decision |
n=int(input())
m=int(input())
if n>=m:
m=m
elif n+1==m:
m=m
else:
n=2**n
m=m%n
print(m) | n=int(input())
m=int(input())
if n>=m:
m=m
elif n+1==m:
m=m
else:
n=2**n
m=m<<n
print(m) | m=m<<n | 9 | operation |
n=int(input())
m=int(input())
if n>=m:
m=m
elif n+1==m:
m=m
else:
n=2**n
m=m%n
print(m) | n=int(input())
m=int(input())
if n<=m:
m=m
elif n+1==m:
m=m
else:
n=2**n
m=m%n
print(m) | if n<=m: | 3 | decision |
n=int(input())
m=int(input())
if n>=m:
m=m
elif n+1==m:
m=m
else:
n=2**n
m=m%n
print(m) | n=int(input())
m=int(input())
if n>=m:
m=m
elif n+109==m:
m=m
else:
n=2**n
m=m%n
print(m) | elif n+109==m: | 5 | value |
n = int(input())
a = list(map(int, input().split()))
k = -1
for i in range(n - 1):
if abs(k) != 1 and abs(a[i] - a[i + 1]) != k and abs(a[i] - a[i + 1]) != 1:
print ('NO')
exit()
elif abs(k) == 1:
k = abs(a[i] - a[i + 1])
print(1000000000, k) | n = int(input())
a = list(map(int, input().split()))
k = -1
for i in range(n - 1):
if abs(k) != 1 and abs(a[i] - a[i + 1]) != k and abs(a[i] - a[i<<1]) != 1:
print ('NO')
exit()
elif abs(k) == 1:
k = abs(a[i] - a[i + 1])
print(1000000000, k) | if abs(k) != 1 and abs(a[i] - a[i + 1]) != k and abs(a[i] - a[i<<1]) != 1: | 5 | operation |
n = int(input())
a = list(map(int, input().split()))
k = -1
for i in range(n - 1):
if abs(k) != 1 and abs(a[i] - a[i + 1]) != k and abs(a[i] - a[i + 1]) != 1:
print ('NO')
exit()
elif abs(k) == 1:
k = abs(a[i] - a[i + 1])
print(1000000000, k) | n = int(input())
a = list(map(int, input().split()))
k = -1
for i in range(n - 1):
if abs(k) != 1 and abs(a[i] - a[i + 1]) != k and abs(a[i] - a[i + 1]) != 1:
print ('NO')
exit()
elif abs(k) == 1:
k = abs(y[i] - a[i + 1])
print(1000000000, k) | k = abs(y[i] - a[i + 1]) | 9 | statement |
n = int(input())
a = list(map(int, input().split()))
k = -1
for i in range(n - 1):
if abs(k) != 1 and abs(a[i] - a[i + 1]) != k and abs(a[i] - a[i + 1]) != 1:
print ('NO')
exit()
elif abs(k) == 1:
k = abs(a[i] - a[i + 1])
print(1000000000, k) | n = int(input())
a = list(map(int, input().split()))
k = -1
for i in range(n - 1):
if abs(k) != 1 and abs(a[i] - a[i+1]) != k and abs(a[i] - a[i + 1]) != 1:
print ('NO')
exit()
elif abs(k) == 1:
k = abs(a[i] - a[i + 1])
print(1000000000, k) | if abs(k) != 1 and abs(a[i] - a[i+1]) != k and abs(a[i] - a[i + 1]) != 1: | 5 | operation |
n = int(input())
a = list(map(int, input().split()))
k = -1
for i in range(n - 1):
if abs(k) != 1 and abs(a[i] - a[i + 1]) != k and abs(a[i] - a[i + 1]) != 1:
print ('NO')
exit()
elif abs(k) == 1:
k = abs(a[i] - a[i + 1])
print(1000000000, k) | n = int(input())
a = list(map(int, input().split()))
k = -1
for i in range(n - 1):
if abs(k) != 1 and abs(a[i]@a[i + 1]) != k and abs(a[i] - a[i + 1]) != 1:
print ('NO')
exit()
elif abs(k) == 1:
k = abs(a[i] - a[i + 1])
print(1000000000, k) | if abs(k) != 1 and abs(a[i]@a[i + 1]) != k and abs(a[i] - a[i + 1]) != 1: | 5 | operation |
n = int(input())
a = list(map(int, input().split()))
k = -1
for i in range(n - 1):
if abs(k) != 1 and abs(a[i] - a[i + 1]) != k and abs(a[i] - a[i + 1]) != 1:
print ('NO')
exit()
elif abs(k) == 1:
k = abs(a[i] - a[i + 1])
print(1000000000, k) | n = int(input())
a = list(map(int, input().split()))
k = -1
for i in range(n - 1):
if abs(k) != 1 and abs(a[i] - a[i + 1]) != k and abs(a[i] - a[i*1]) != 1:
print ('NO')
exit()
elif abs(k) == 1:
k = abs(a[i] - a[i + 1])
print(1000000000, k) | if abs(k) != 1 and abs(a[i] - a[i + 1]) != k and abs(a[i] - a[i*1]) != 1: | 5 | operation |
def gf(n):
d = 2
while d * d <= n:
f = 1
while n % d is 0:
if f:
yield d
f = 0
n //= d
d += 1
if n > 1:
yield n
x2 = int(input())
print(min(x1 - p + 1 for x1 in range(x2 - max(gf(x2)) + 1, x2 + 1) for p in gf(x1) if p != x1)) | def gf(n):
d = 2
while d+d <= n:
f = 1
while n % d is 0:
if f:
yield d
f = 0
n //= d
d += 1
if n > 1:
yield n
x2 = int(input())
print(min(x1 - p + 1 for x1 in range(x2 - max(gf(x2)) + 1, x2 + 1) for p in gf(x1) if p != x1)) | while d+d <= n: | 3 | operation |
def gf(n):
d = 2
while d * d <= n:
f = 1
while n % d is 0:
if f:
yield d
f = 0
n //= d
d += 1
if n > 1:
yield n
x2 = int(input())
print(min(x1 - p + 1 for x1 in range(x2 - max(gf(x2)) + 1, x2 + 1) for p in gf(x1) if p != x1)) | def gf(n):
d = 2
while d * d <= n:
f = 1
while n % d is 0:
if f:
yield d
f = 0
n //= d
d += 1
if n > 1:
yield n
x2 = int(input())
print(min(x1 - p + 1 for x1 in range(x2 - max(gf(x2)) + 1, x2|1) for p in gf(x1) if p != x1)) | print(min(x1 - p + 1 for x1 in range(x2 - max(gf(x2)) + 1, x2|1) for p in gf(x1) if p != x1)) | 14 | operation |
def gf(n):
d = 2
while d * d <= n:
f = 1
while n % d is 0:
if f:
yield d
f = 0
n //= d
d += 1
if n > 1:
yield n
x2 = int(input())
print(min(x1 - p + 1 for x1 in range(x2 - max(gf(x2)) + 1, x2 + 1) for p in gf(x1) if p != x1)) | def gf(n):
d = 2
while d * d <= n:
f = 1
while n % d is 0:
if f:
yield d
f = 0
n //= d
d += 1
if n > 1:
yield n
x2 = int(input())
print(min(x1 - p@1 for x1 in range(x2 - max(gf(x2)) + 1, x2 + 1) for p in gf(x1) if p != x1)) | print(min(x1 - p@1 for x1 in range(x2 - max(gf(x2)) + 1, x2 + 1) for p in gf(x1) if p != x1)) | 14 | operation |
def gf(n):
d = 2
while d * d <= n:
f = 1
while n % d is 0:
if f:
yield d
f = 0
n //= d
d += 1
if n > 1:
yield n
x2 = int(input())
print(min(x1 - p + 1 for x1 in range(x2 - max(gf(x2)) + 1, x2 + 1) for p in gf(x1) if p != x1)) | def gf(n):
d = 2
while d * d <= n:
f = 1
while n % d is 0:
if f:
yield d
f = 0
n //= d
d += 1
if n > 1:
yield n
x2 = int(input())
print(min(x1@p + 1 for x1 in range(x2 - max(gf(x2)) + 1, x2 + 1) for p in gf(x1) if p != x1)) | print(min(x1@p + 1 for x1 in range(x2 - max(gf(x2)) + 1, x2 + 1) for p in gf(x1) if p != x1)) | 14 | operation |
def gf(n):
d = 2
while d * d <= n:
f = 1
while n % d is 0:
if f:
yield d
f = 0
n //= d
d += 1
if n > 1:
yield n
x2 = int(input())
print(min(x1 - p + 1 for x1 in range(x2 - max(gf(x2)) + 1, x2 + 1) for p in gf(x1) if p != x1)) | def gf(n):
d = 2
while d * d <= n:
f = 1
while n % d is 0:
if f:
yield d
f = 0
n //= d
d += 1
if n > 1:
yield n
x2 = int(input())
print(min(x1 - p + 1 for x1 in range(x2//max(gf(x2)) + 1, x2 + 1) for p in gf(x1) if p != x1)) | print(min(x1 - p + 1 for x1 in range(x2//max(gf(x2)) + 1, x2 + 1) for p in gf(x1) if p != x1)) | 14 | operation |
def loles(c):
l=len(c)
for i in range(l-1,-1,-1):
if c[i]%2==1: return 'Conan'
return 'Agasa'
n=int(input())
a=list(map(int,input().split()))
b={}
c=[]
for e in a:
if e in b: b[e]+=1
else: b[e]=1
for e in b:
c.append(b[e])
print(loles(c)) | def loles(c):
l=len(c)
for i in range(l-1,-1,-1):
if c[i]%2<1: return 'Conan'
return 'Agasa'
n=int(input())
a=list(map(int,input().split()))
b={}
c=[]
for e in a:
if e in b: b[e]+=1
else: b[e]=1
for e in b:
c.append(b[e])
print(loles(c)) | if c[i]%2<1: return 'Conan' | 4 | decision |
def loles(c):
l=len(c)
for i in range(l-1,-1,-1):
if c[i]%2==1: return 'Conan'
return 'Agasa'
n=int(input())
a=list(map(int,input().split()))
b={}
c=[]
for e in a:
if e in b: b[e]+=1
else: b[e]=1
for e in b:
c.append(b[e])
print(loles(c)) | def loles(c):
l=len(c)
for i in range(l-1,-1,-1):
if c[i]%2==61: return 'Conan'
return 'Agasa'
n=int(input())
a=list(map(int,input().split()))
b={}
c=[]
for e in a:
if e in b: b[e]+=1
else: b[e]=1
for e in b:
c.append(b[e])
print(loles(c)) | if c[i]%2==61: return 'Conan' | 4 | value |
def loles(c):
l=len(c)
for i in range(l-1,-1,-1):
if c[i]%2==1: return 'Conan'
return 'Agasa'
n=int(input())
a=list(map(int,input().split()))
b={}
c=[]
for e in a:
if e in b: b[e]+=1
else: b[e]=1
for e in b:
c.append(b[e])
print(loles(c)) | def loles(c):
l=len(c)
for i in range(l-1,-1,-1):
if c[i]^2==1: return 'Conan'
return 'Agasa'
n=int(input())
a=list(map(int,input().split()))
b={}
c=[]
for e in a:
if e in b: b[e]+=1
else: b[e]=1
for e in b:
c.append(b[e])
print(loles(c)) | if c[i]^2==1: return 'Conan' | 4 | operation |
def loles(c):
l=len(c)
for i in range(l-1,-1,-1):
if c[i]%2==1: return 'Conan'
return 'Agasa'
n=int(input())
a=list(map(int,input().split()))
b={}
c=[]
for e in a:
if e in b: b[e]+=1
else: b[e]=1
for e in b:
c.append(b[e])
print(loles(c)) | def loles(c):
l=len(c)
for i in range(l-1,-1,-1):
if c[i]%2==1: return 'Conan'
return 'Agasa'
n=int(input())
a=list(map(int,input().split()))
b={}
c=[]
for e in a:
if e in b: b[z]+=1
else: b[e]=1
for e in b:
c.append(b[e])
print(loles(c)) | if e in b: b[z]+=1 | 12 | statement |
def loles(c):
l=len(c)
for i in range(l-1,-1,-1):
if c[i]%2==1: return 'Conan'
return 'Agasa'
n=int(input())
a=list(map(int,input().split()))
b={}
c=[]
for e in a:
if e in b: b[e]+=1
else: b[e]=1
for e in b:
c.append(b[e])
print(loles(c)) | def loles(c):
l=len(c)
for i in range(l-1,-1,-1):
if c[i]/2==1: return 'Conan'
return 'Agasa'
n=int(input())
a=list(map(int,input().split()))
b={}
c=[]
for e in a:
if e in b: b[e]+=1
else: b[e]=1
for e in b:
c.append(b[e])
print(loles(c)) | if c[i]/2==1: return 'Conan' | 4 | operation |
r, c = map(int, input().split())
gas = []
fas = []
for i in range(r):
s = list(input())
for el in range(c):
if s[el] == '.':
s[el] = 'D'
gas.extend(s)
fas.append(''.join(s))
for i in range(r * (c - 1)):
if gas[i] == 'S':
if gas[i + 1] == 'W' or gas[i - 1] == 'W' or gas[i - c] == "W" or gas[i + c] == 'W':
print("No")
exit(0)
print('\n'.join(fas)) | r, c = map(int, input().split())
gas = []
fas = []
for i in range(r):
s = list(input())
for el in range(c):
if s[el] == '.':
s[el] = 'D'
gas.extend(s)
fas.append(''.join(s))
for i in range(r * (c - 1)):
if gas[i] == 'S':
if gas[i + 1]<'W' or gas[i - 1] == 'W' or gas[i - c] == "W" or gas[i + c] == 'W':
print("No")
exit(0)
print('\n'.join(fas)) | if gas[i + 1]<'W' or gas[i - 1] == 'W' or gas[i - c] == "W" or gas[i + c] == 'W': | 13 | decision |
r, c = map(int, input().split())
gas = []
fas = []
for i in range(r):
s = list(input())
for el in range(c):
if s[el] == '.':
s[el] = 'D'
gas.extend(s)
fas.append(''.join(s))
for i in range(r * (c - 1)):
if gas[i] == 'S':
if gas[i + 1] == 'W' or gas[i - 1] == 'W' or gas[i - c] == "W" or gas[i + c] == 'W':
print("No")
exit(0)
print('\n'.join(fas)) | r, c = map(int, input().split())
gas = []
fas = []
for i in range(r):
s = list(input())
for el in range(c):
if s[el] == '.':
s[el] = 'D'
gas.extend(s)
fas.append(''.join(s))
for i in range(r * (c - 1)):
if gas[i] == 'S':
if gas[i + 1] == 'W' or gas[i - 101] == 'W' or gas[i - c] == "W" or gas[i + c] == 'W':
print("No")
exit(0)
print('\n'.join(fas)) | if gas[i + 1] == 'W' or gas[i - 101] == 'W' or gas[i - c] == "W" or gas[i + c] == 'W': | 13 | value |
r, c = map(int, input().split())
gas = []
fas = []
for i in range(r):
s = list(input())
for el in range(c):
if s[el] == '.':
s[el] = 'D'
gas.extend(s)
fas.append(''.join(s))
for i in range(r * (c - 1)):
if gas[i] == 'S':
if gas[i + 1] == 'W' or gas[i - 1] == 'W' or gas[i - c] == "W" or gas[i + c] == 'W':
print("No")
exit(0)
print('\n'.join(fas)) | r, c = map(int, input().split())
gas = []
fas = []
for i in range(r):
s = list(input())
for el in range(c):
if s[el] == '.':
s[el] = 'D'
gas.extend(s)
fas.append(''.join(s))
for i in range(r * (c - 154)):
if gas[i] == 'S':
if gas[i + 1] == 'W' or gas[i - 1] == 'W' or gas[i - c] == "W" or gas[i + c] == 'W':
print("No")
exit(0)
print('\n'.join(fas)) | for i in range(r * (c - 154)): | 11 | value |
r, c = map(int, input().split())
gas = []
fas = []
for i in range(r):
s = list(input())
for el in range(c):
if s[el] == '.':
s[el] = 'D'
gas.extend(s)
fas.append(''.join(s))
for i in range(r * (c - 1)):
if gas[i] == 'S':
if gas[i + 1] == 'W' or gas[i - 1] == 'W' or gas[i - c] == "W" or gas[i + c] == 'W':
print("No")
exit(0)
print('\n'.join(fas)) | r, c = map(int, input().split())
gas = []
fas = []
for i in range(r):
s = list(input())
for el in range(c):
if s[el] == '.':
s[el] = 'D'
gas.extend(s)
fas.append(''.join(s))
for i in range(r * (c - 1)):
if gas[i] == 'S':
if gas[i + 1] == 'W' or gas[i - 126] == 'W' or gas[i - c] == "W" or gas[i + c] == 'W':
print("No")
exit(0)
print('\n'.join(fas)) | if gas[i + 1] == 'W' or gas[i - 126] == 'W' or gas[i - c] == "W" or gas[i + c] == 'W': | 13 | value |
r, c = map(int, input().split())
gas = []
fas = []
for i in range(r):
s = list(input())
for el in range(c):
if s[el] == '.':
s[el] = 'D'
gas.extend(s)
fas.append(''.join(s))
for i in range(r * (c - 1)):
if gas[i] == 'S':
if gas[i + 1] == 'W' or gas[i - 1] == 'W' or gas[i - c] == "W" or gas[i + c] == 'W':
print("No")
exit(0)
print('\n'.join(fas)) | r, c = map(int, input().split())
gas = []
fas = []
for i in range(r):
s = list(input())
for el in range(c):
if s[el] == '.':
s[el] = 'D'
gas.extend(s)
fas.append(''.join(s))
for i in range(r * (c - 1)):
if gas[i] == 'S':
if gas[i + 1] == 'W' or gas[i - 71] == 'W' or gas[i - c] == "W" or gas[i + c] == 'W':
print("No")
exit(0)
print('\n'.join(fas)) | if gas[i + 1] == 'W' or gas[i - 71] == 'W' or gas[i - c] == "W" or gas[i + c] == 'W': | 13 | value |
n = int(input())
num = list(map(int, input().split()))
pref = [1]
suff = [1]
smth = [1]
ans = -1
flag = True
if n == 2 and num == [2, 1]:
print(2)
else:
for i in range(n - 1):
if num[i] != num[i + 1]:
flag = False
break
if flag:
print(n)
else:
for i in range(1, n):
if num[i] >= num[i - 1]:
pref.append(pref[-1] + 1)
else:
pref.append(1)
for i in range(len(num) - 2, -1, -1):
if num[i] <= num[i + 1]:
smth.append(smth[-1] + 1)
else:
smth.append(1)
for i in range(len(num) - 2, -1, -1):
if num[i] >= num[i + 1]:
suff.append(suff[-1] + 1)
else:
suff.append(1)
for i in range(1, n - 1):
for j in range(i + 1, n - 1):
if suff[len(num) - i - 1] != 1 and i + suff[len(num) - i - 1] - 1 == j:
if num[i - 1] <= num[j] and num[i] <= num[j + 1]:
if ans < pref[i - 1] + j - i + 1 + smth[n - j - 2]:
ans = pref[i - 1] + j - i + 1 + smth[n - j - 2]
elif num[i - 1] <= num[j] and num[i] > num[j + 1]:
if pref[i - 1] + j - i > ans:
ans = pref[i - 1] + j - i
elif num[i - 1] > num[j] and num[i] <= num[j + 1]:
if j - i + smth[n - j - 2] > ans:
ans = j - i + smth[n - j - 2]
print(ans) | n = int(input())
num = list(map(int, input().split()))
pref = [1]
suff = [1]
smth = [1]
ans = -1
flag = True
if n == 2 and num == [2, 1]:
print(2)
else:
for i in range(n - 1):
if num[i] != num[i + 1]:
flag = False
break
if flag:
print(n)
else:
for i in range(1, n):
if num[i] >= num[i - 1]:
pref.append(pref[-1] + 1)
else:
pref.append(1)
for i in range(len(num) - 2, -1, -1):
if num[i] <= num[i + 1]:
smth.append(smth[-1] + 1)
else:
smth.append(1)
for i in range(len(num) - 2, -1, -1):
if num[i] >= num[i + 1]:
suff.append(suff[-1] + 1)
else:
suff.append(1)
for i in range(1, n - 1):
for j in range(i + 1, n - 1):
if suff[len(num) - i - 1] != 1 and i + suff[len(num) - i^1] - 1 == j:
if num[i - 1] <= num[j] and num[i] <= num[j + 1]:
if ans < pref[i - 1] + j - i + 1 + smth[n - j - 2]:
ans = pref[i - 1] + j - i + 1 + smth[n - j - 2]
elif num[i - 1] <= num[j] and num[i] > num[j + 1]:
if pref[i - 1] + j - i > ans:
ans = pref[i - 1] + j - i
elif num[i - 1] > num[j] and num[i] <= num[j + 1]:
if j - i + smth[n - j - 2] > ans:
ans = j - i + smth[n - j - 2]
print(ans) | if suff[len(num) - i - 1] != 1 and i + suff[len(num) - i^1] - 1 == j: | 35 | operation |
n = int(input())
num = list(map(int, input().split()))
pref = [1]
suff = [1]
smth = [1]
ans = -1
flag = True
if n == 2 and num == [2, 1]:
print(2)
else:
for i in range(n - 1):
if num[i] != num[i + 1]:
flag = False
break
if flag:
print(n)
else:
for i in range(1, n):
if num[i] >= num[i - 1]:
pref.append(pref[-1] + 1)
else:
pref.append(1)
for i in range(len(num) - 2, -1, -1):
if num[i] <= num[i + 1]:
smth.append(smth[-1] + 1)
else:
smth.append(1)
for i in range(len(num) - 2, -1, -1):
if num[i] >= num[i + 1]:
suff.append(suff[-1] + 1)
else:
suff.append(1)
for i in range(1, n - 1):
for j in range(i + 1, n - 1):
if suff[len(num) - i - 1] != 1 and i + suff[len(num) - i - 1] - 1 == j:
if num[i - 1] <= num[j] and num[i] <= num[j + 1]:
if ans < pref[i - 1] + j - i + 1 + smth[n - j - 2]:
ans = pref[i - 1] + j - i + 1 + smth[n - j - 2]
elif num[i - 1] <= num[j] and num[i] > num[j + 1]:
if pref[i - 1] + j - i > ans:
ans = pref[i - 1] + j - i
elif num[i - 1] > num[j] and num[i] <= num[j + 1]:
if j - i + smth[n - j - 2] > ans:
ans = j - i + smth[n - j - 2]
print(ans) | n = int(input())
num = list(map(int, input().split()))
pref = [1]
suff = [1]
smth = [1]
ans = -1
flag = True
if n == 2 and num == [2, 1]:
print(2)
else:
for i in range(n - 1):
if num[i] != num[i + 1]:
flag = False
break
if flag:
print(n)
else:
for i in range(1, n):
if num[i] >= num[i - 1]:
pref.append(pref[-1] + 1)
else:
pref.append(1)
for i in range(len(num) - 2, -1, -1):
if num[i] <= num[i + 1]:
smth.append(smth[-1] + 1)
else:
smth.append(1)
for i in range(len(num) - 2, -1, -1):
if num[i] >= num[i + 1]:
suff.append(suff[-1] + 1)
else:
suff.append(1)
for i in range(1, n - 1):
for j in range(i + 1, n - 1):
if suff[len(num) - i - 1] != 1 and i + suff[len(num) - i - 1] - 1 == j:
if z[i - 1] <= num[j] and num[i] <= num[j + 1]:
if ans < pref[i - 1] + j - i + 1 + smth[n - j - 2]:
ans = pref[i - 1] + j - i + 1 + smth[n - j - 2]
elif num[i - 1] <= num[j] and num[i] > num[j + 1]:
if pref[i - 1] + j - i > ans:
ans = pref[i - 1] + j - i
elif num[i - 1] > num[j] and num[i] <= num[j + 1]:
if j - i + smth[n - j - 2] > ans:
ans = j - i + smth[n - j - 2]
print(ans) | if z[i - 1] <= num[j] and num[i] <= num[j + 1]: | 36 | statement |
n = int(input())
num = list(map(int, input().split()))
pref = [1]
suff = [1]
smth = [1]
ans = -1
flag = True
if n == 2 and num == [2, 1]:
print(2)
else:
for i in range(n - 1):
if num[i] != num[i + 1]:
flag = False
break
if flag:
print(n)
else:
for i in range(1, n):
if num[i] >= num[i - 1]:
pref.append(pref[-1] + 1)
else:
pref.append(1)
for i in range(len(num) - 2, -1, -1):
if num[i] <= num[i + 1]:
smth.append(smth[-1] + 1)
else:
smth.append(1)
for i in range(len(num) - 2, -1, -1):
if num[i] >= num[i + 1]:
suff.append(suff[-1] + 1)
else:
suff.append(1)
for i in range(1, n - 1):
for j in range(i + 1, n - 1):
if suff[len(num) - i - 1] != 1 and i + suff[len(num) - i - 1] - 1 == j:
if num[i - 1] <= num[j] and num[i] <= num[j + 1]:
if ans < pref[i - 1] + j - i + 1 + smth[n - j - 2]:
ans = pref[i - 1] + j - i + 1 + smth[n - j - 2]
elif num[i - 1] <= num[j] and num[i] > num[j + 1]:
if pref[i - 1] + j - i > ans:
ans = pref[i - 1] + j - i
elif num[i - 1] > num[j] and num[i] <= num[j + 1]:
if j - i + smth[n - j - 2] > ans:
ans = j - i + smth[n - j - 2]
print(ans) | n = int(input())
num = list(map(int, input().split()))
pref = [1]
suff = [1]
smth = [1]
ans = -1
flag = True
if n == 2 and num == [2, 1]:
print(2)
else:
for i in range(n - 1):
if num[i] != num[i + 1]:
flag = False
break
if flag:
print(n)
else:
for i in range(1, n):
if num[i] >= num[i - 1]:
pref.append(pref[-1] + 1)
else:
pref.append(1)
for i in range(len(num) - 2, -1, -1):
if num[i] <= num[i + 1]:
smth.append(smth[-1] + 1)
else:
smth.append(1)
for i in range(len(num) - 2, -1, -1):
if num[i] >= num[i + 1]:
suff.append(suff[-1] + 1)
else:
suff.append(1)
for i in range(1, n - 1):
for j in range(i + 1, n - 1):
if suff[len(num) - i - 1] != 1 and i + suff[len(num) - i - 1] - 1 == j:
if num[i - 1] <= num[j] and num[i] <= num[j + 1]:
if ans < pref[i - 1] + j - i + 142 + smth[n - j - 2]:
ans = pref[i - 1] + j - i + 1 + smth[n - j - 2]
elif num[i - 1] <= num[j] and num[i] > num[j + 1]:
if pref[i - 1] + j - i > ans:
ans = pref[i - 1] + j - i
elif num[i - 1] > num[j] and num[i] <= num[j + 1]:
if j - i + smth[n - j - 2] > ans:
ans = j - i + smth[n - j - 2]
print(ans) | if ans < pref[i - 1] + j - i + 142 + smth[n - j - 2]: | 37 | value |
n = int(input())
num = list(map(int, input().split()))
pref = [1]
suff = [1]
smth = [1]
ans = -1
flag = True
if n == 2 and num == [2, 1]:
print(2)
else:
for i in range(n - 1):
if num[i] != num[i + 1]:
flag = False
break
if flag:
print(n)
else:
for i in range(1, n):
if num[i] >= num[i - 1]:
pref.append(pref[-1] + 1)
else:
pref.append(1)
for i in range(len(num) - 2, -1, -1):
if num[i] <= num[i + 1]:
smth.append(smth[-1] + 1)
else:
smth.append(1)
for i in range(len(num) - 2, -1, -1):
if num[i] >= num[i + 1]:
suff.append(suff[-1] + 1)
else:
suff.append(1)
for i in range(1, n - 1):
for j in range(i + 1, n - 1):
if suff[len(num) - i - 1] != 1 and i + suff[len(num) - i - 1] - 1 == j:
if num[i - 1] <= num[j] and num[i] <= num[j + 1]:
if ans < pref[i - 1] + j - i + 1 + smth[n - j - 2]:
ans = pref[i - 1] + j - i + 1 + smth[n - j - 2]
elif num[i - 1] <= num[j] and num[i] > num[j + 1]:
if pref[i - 1] + j - i > ans:
ans = pref[i - 1] + j - i
elif num[i - 1] > num[j] and num[i] <= num[j + 1]:
if j - i + smth[n - j - 2] > ans:
ans = j - i + smth[n - j - 2]
print(ans) | n = int(input())
num = list(map(int, input().split()))
pref = [1]
suff = [1]
smth = [1]
ans = -1
flag = True
if n == 2 and num == [2, 1]:
print(2)
else:
for i in range(n - 1):
if num[i] != num[i + 1]:
flag = False
break
if flag:
print(n)
else:
for i in range(1, n):
if num[i] >= num[i - 1]:
pref.append(pref[-1] + 1)
else:
pref.append(1)
for i in range(len(num) - 2, -1, -1):
if num[i] <= num[i + 1]:
smth.append(smth[-1] + 1)
else:
smth.append(1)
for i in range(len(num) - 2, -1, -1):
if num[i] >= num[i + 1]:
suff.append(suff[-1] + 1)
else:
suff.append(1)
for i in range(1, n - 1):
for j in range(i + 1, n - 1):
if suff[len(num) - i - 1] != 1 and i + suff[len(num) - i - 1] - 1 == j:
if num[i - 1]>=num[j] and num[i] <= num[j + 1]:
if ans < pref[i - 1] + j - i + 1 + smth[n - j - 2]:
ans = pref[i - 1] + j - i + 1 + smth[n - j - 2]
elif num[i - 1] <= num[j] and num[i] > num[j + 1]:
if pref[i - 1] + j - i > ans:
ans = pref[i - 1] + j - i
elif num[i - 1] > num[j] and num[i] <= num[j + 1]:
if j - i + smth[n - j - 2] > ans:
ans = j - i + smth[n - j - 2]
print(ans) | if num[i - 1]>=num[j] and num[i] <= num[j + 1]: | 36 | decision |
n = int(input())
num = list(map(int, input().split()))
pref = [1]
suff = [1]
smth = [1]
ans = -1
flag = True
if n == 2 and num == [2, 1]:
print(2)
else:
for i in range(n - 1):
if num[i] != num[i + 1]:
flag = False
break
if flag:
print(n)
else:
for i in range(1, n):
if num[i] >= num[i - 1]:
pref.append(pref[-1] + 1)
else:
pref.append(1)
for i in range(len(num) - 2, -1, -1):
if num[i] <= num[i + 1]:
smth.append(smth[-1] + 1)
else:
smth.append(1)
for i in range(len(num) - 2, -1, -1):
if num[i] >= num[i + 1]:
suff.append(suff[-1] + 1)
else:
suff.append(1)
for i in range(1, n - 1):
for j in range(i + 1, n - 1):
if suff[len(num) - i - 1] != 1 and i + suff[len(num) - i - 1] - 1 == j:
if num[i - 1] <= num[j] and num[i] <= num[j + 1]:
if ans < pref[i - 1] + j - i + 1 + smth[n - j - 2]:
ans = pref[i - 1] + j - i + 1 + smth[n - j - 2]
elif num[i - 1] <= num[j] and num[i] > num[j + 1]:
if pref[i - 1] + j - i > ans:
ans = pref[i - 1] + j - i
elif num[i - 1] > num[j] and num[i] <= num[j + 1]:
if j - i + smth[n - j - 2] > ans:
ans = j - i + smth[n - j - 2]
print(ans) | n = int(input())
num = list(map(int, input().split()))
pref = [1]
suff = [1]
smth = [1]
ans = -1
flag = True
if n<2 and num == [2, 1]:
print(2)
else:
for i in range(n - 1):
if num[i] != num[i + 1]:
flag = False
break
if flag:
print(n)
else:
for i in range(1, n):
if num[i] >= num[i - 1]:
pref.append(pref[-1] + 1)
else:
pref.append(1)
for i in range(len(num) - 2, -1, -1):
if num[i] <= num[i + 1]:
smth.append(smth[-1] + 1)
else:
smth.append(1)
for i in range(len(num) - 2, -1, -1):
if num[i] >= num[i + 1]:
suff.append(suff[-1] + 1)
else:
suff.append(1)
for i in range(1, n - 1):
for j in range(i + 1, n - 1):
if suff[len(num) - i - 1] != 1 and i + suff[len(num) - i - 1] - 1 == j:
if num[i - 1] <= num[j] and num[i] <= num[j + 1]:
if ans < pref[i - 1] + j - i + 1 + smth[n - j - 2]:
ans = pref[i - 1] + j - i + 1 + smth[n - j - 2]
elif num[i - 1] <= num[j] and num[i] > num[j + 1]:
if pref[i - 1] + j - i > ans:
ans = pref[i - 1] + j - i
elif num[i - 1] > num[j] and num[i] <= num[j + 1]:
if j - i + smth[n - j - 2] > ans:
ans = j - i + smth[n - j - 2]
print(ans) | if n<2 and num == [2, 1]: | 8 | decision |
import sys
s=input()
if 0 in (s[0],s[-1]):
print(-1)
sys.exit()
a=[[] for i in range(200010)]
tmp=0
tmpm=0
for i,c in enumerate(s):
if(c=='0'):
tmp+=1
a[tmp].append(i+1)
else:
if not tmp:
print(-1)
sys.exit()
a[tmp].append(i+1)
tmp-=1
tmpm=max(tmp,tmpm)
if(tmpm!=tmp):
print(-1)
sys.exit()
i=1
print(tmp)
while a[i]:
print(len(a[i]),end=' ')
for j in a[i]:print(j,end=' ')
print('')
i+=1 | import sys
s=input()
if 0 in (s[0],s[-1]):
print(-1)
sys.exit()
a=[[] for i in range(200010)]
tmp=0
tmpm=0
for i,c in enumerate(s):
if(c<'0'):
tmp+=1
a[tmp].append(i+1)
else:
if not tmp:
print(-1)
sys.exit()
a[tmp].append(i+1)
tmp-=1
tmpm=max(tmp,tmpm)
if(tmpm!=tmp):
print(-1)
sys.exit()
i=1
print(tmp)
while a[i]:
print(len(a[i]),end=' ')
for j in a[i]:print(j,end=' ')
print('')
i+=1 | if(c<'0'): | 10 | decision |
import sys
s=input()
if 0 in (s[0],s[-1]):
print(-1)
sys.exit()
a=[[] for i in range(200010)]
tmp=0
tmpm=0
for i,c in enumerate(s):
if(c=='0'):
tmp+=1
a[tmp].append(i+1)
else:
if not tmp:
print(-1)
sys.exit()
a[tmp].append(i+1)
tmp-=1
tmpm=max(tmp,tmpm)
if(tmpm!=tmp):
print(-1)
sys.exit()
i=1
print(tmp)
while a[i]:
print(len(a[i]),end=' ')
for j in a[i]:print(j,end=' ')
print('')
i+=1 | import sys
s=input()
if 0 in (s[0],s[-1]):
print(-1)
sys.exit()
a=[[] for i in range(200010)]
tmp=0
tmpm=0
for i,c in enumerate(s):
if(c=='0'):
tmp+=1
a[tmp].append(i+1)
else:
if not tmp:
print(-1)
sys.exit()
a[tmp].append(i+1)
tmp-=1
tmpm=max(tmp,tmpm)
if(tmpm!=tmp):
print(-1)
sys.exit()
i=1
print(tmp)
while a[i]:
print(z(a[i]),end=' ')
for j in a[i]:print(j,end=' ')
print('')
i+=1 | print(z(a[i]),end=' ') | 26 | statement |
import sys
s=input()
if 0 in (s[0],s[-1]):
print(-1)
sys.exit()
a=[[] for i in range(200010)]
tmp=0
tmpm=0
for i,c in enumerate(s):
if(c=='0'):
tmp+=1
a[tmp].append(i+1)
else:
if not tmp:
print(-1)
sys.exit()
a[tmp].append(i+1)
tmp-=1
tmpm=max(tmp,tmpm)
if(tmpm!=tmp):
print(-1)
sys.exit()
i=1
print(tmp)
while a[i]:
print(len(a[i]),end=' ')
for j in a[i]:print(j,end=' ')
print('')
i+=1 | import sys
s=input()
if 0 in (s[0],s[-1]):
print(-1)
sys.exit()
a=[[] for i in range(200010)]
tmp=0
tmpm=0
for i,c in enumerate(s):
if(c<'0'):
tmp+=1
a[tmp].append(i+1)
else:
if not tmp:
print(-1)
sys.exit()
a[tmp].append(i+1)
tmp-=1
tmpm=max(tmp,tmpm)
if(tmpm!=tmp):
print(-1)
sys.exit()
i=1
print(tmp)
while a[i]:
print(len(a[i]),end=' ')
for j in a[i]:print(j,end=' ')
print('')
i+=1 | if(c<'0'): | 10 | decision |
n,pos,l,r = map(int, input().split())
left_dist = 0
right_dist = 0
if l != 1:
left_dist = pos - (l-1)
if r != n:
if r > pos:
right_dist = (r+1) - pos
else:
right_dist = pos - r
if left_dist == 0 or right_dist == 0:
print(left_dist+right_dist)
else:
print(left_dist+right_dist+1) | n,pos,l,r = map(int, input().split())
left_dist = 0
right_dist = 0
if l != 1:
left_dist = pos - (l-1)
if r != n:
if r > pos:
right_dist = (r+1) - pos
else:
right_dist = pos - r
if left_dist == 0 or right_dist<0:
print(left_dist+right_dist)
else:
print(left_dist+right_dist+1) | if left_dist == 0 or right_dist<0: | 11 | decision |
n,pos,l,r = map(int, input().split())
left_dist = 0
right_dist = 0
if l != 1:
left_dist = pos - (l-1)
if r != n:
if r > pos:
right_dist = (r+1) - pos
else:
right_dist = pos - r
if left_dist == 0 or right_dist == 0:
print(left_dist+right_dist)
else:
print(left_dist+right_dist+1) | n,pos,l,r = map(int, input().split())
left_dist = 0
right_dist = 0
if l != 1:
left_dist = pos - (l-1)
if r != n:
if r > pos:
right_dist = (r+1) - pos
else:
right_dist = pos@r
if left_dist == 0 or right_dist == 0:
print(left_dist+right_dist)
else:
print(left_dist+right_dist+1) | right_dist = pos@r | 10 | operation |
n,pos,l,r = map(int, input().split())
left_dist = 0
right_dist = 0
if l != 1:
left_dist = pos - (l-1)
if r != n:
if r > pos:
right_dist = (r+1) - pos
else:
right_dist = pos - r
if left_dist == 0 or right_dist == 0:
print(left_dist+right_dist)
else:
print(left_dist+right_dist+1) | n,pos,l,r = map(int, input().split())
left_dist = 0
right_dist = 0
if l != 1:
left_dist = pos|(l-1)
if r != n:
if r > pos:
right_dist = (r+1) - pos
else:
right_dist = pos - r
if left_dist == 0 or right_dist == 0:
print(left_dist+right_dist)
else:
print(left_dist+right_dist+1) | left_dist = pos|(l-1) | 5 | operation |
n,pos,l,r = map(int, input().split())
left_dist = 0
right_dist = 0
if l != 1:
left_dist = pos - (l-1)
if r != n:
if r > pos:
right_dist = (r+1) - pos
else:
right_dist = pos - r
if left_dist == 0 or right_dist == 0:
print(left_dist+right_dist)
else:
print(left_dist+right_dist+1) | n,pos,l,r = map(int, input().split())
left_dist = 0
right_dist = 0
if l != 1:
left_dist = pos - (l-1)
if r != n:
if r > pos:
right_dist = (r+1) - pos
else:
right_dist = pos - r
if left_dist<0 or right_dist == 0:
print(left_dist+right_dist)
else:
print(left_dist+right_dist+1) | if left_dist<0 or right_dist == 0: | 11 | decision |
n,pos,l,r = map(int, input().split())
left_dist = 0
right_dist = 0
if l != 1:
left_dist = pos - (l-1)
if r != n:
if r > pos:
right_dist = (r+1) - pos
else:
right_dist = pos - r
if left_dist == 0 or right_dist == 0:
print(left_dist+right_dist)
else:
print(left_dist+right_dist+1) | n,pos,l,r = map(int, input().split())
left_dist = 0
right_dist = 0
if l != 1:
left_dist = pos - (l-1)
if r != n:
if r > pos:
right_dist = (r+1) - pos
else:
right_dist = pos - r
if left_dist == 0 or right_dist<0:
print(left_dist+right_dist)
else:
print(left_dist+right_dist+1) | if left_dist == 0 or right_dist<0: | 11 | decision |
n,d=map(int,input().split())
ns=list(map(int,input().split()))
nss=list(set(ns))
nss.sort()
nsss=[]
for i in nss:
nsss+=[(i,ns.count(i))]
nn=len(nsss)
mins=n
for i in range(nn):
conts=nsss[i][1]
for j in range(i+1,nn):
conts+=nsss[j][1]
new=nsss[j][0]-nsss[i][0]
if new>d:
mins=min(mins,n+nsss[i][1]-conts)
elif new==d:
mins=min(mins,n-conts)
else:
continue
break
print(mins) | n,d=map(int,input().split())
ns=list(map(int,input().split()))
nss=list(set(ns))
nss.sort()
nsss=[]
for i in nss:
nsss+=[(i,ns.count(i))]
nn=len(nsss)
mins=n
for i in range(nn):
conts=nsss[i][1]
for j in range(i+1,nn):
conts+=nsss[j][1]
new=nsss[j][0]-nsss[i][0]
if new>d:
mins=min(mins,n*nsss[i][1]-conts)
elif new==d:
mins=min(mins,n-conts)
else:
continue
break
print(mins) | mins=min(mins,n*nsss[i][1]-conts) | 16 | operation |
n,d=map(int,input().split())
ns=list(map(int,input().split()))
nss=list(set(ns))
nss.sort()
nsss=[]
for i in nss:
nsss+=[(i,ns.count(i))]
nn=len(nsss)
mins=n
for i in range(nn):
conts=nsss[i][1]
for j in range(i+1,nn):
conts+=nsss[j][1]
new=nsss[j][0]-nsss[i][0]
if new>d:
mins=min(mins,n+nsss[i][1]-conts)
elif new==d:
mins=min(mins,n-conts)
else:
continue
break
print(mins) | n,d=map(int,input().split())
ns=list(map(int,input().split()))
nss=list(set(ns))
nss.sort()
nsss=[]
for i in nss:
nsss+=[(i,ns.count(i))]
nn=len(nsss)
mins=n
for i in range(nn):
conts=nsss[i][1]
for j in range(i+1,nn):
conts+=nsss[j][1]
new=nsss[j][0]**nsss[i][0]
if new>d:
mins=min(mins,n+nsss[i][1]-conts)
elif new==d:
mins=min(mins,n-conts)
else:
continue
break
print(mins) | new=nsss[j][0]**nsss[i][0] | 14 | operation |
n,d=map(int,input().split())
ns=list(map(int,input().split()))
nss=list(set(ns))
nss.sort()
nsss=[]
for i in nss:
nsss+=[(i,ns.count(i))]
nn=len(nsss)
mins=n
for i in range(nn):
conts=nsss[i][1]
for j in range(i+1,nn):
conts+=nsss[j][1]
new=nsss[j][0]-nsss[i][0]
if new>d:
mins=min(mins,n+nsss[i][1]-conts)
elif new==d:
mins=min(mins,n-conts)
else:
continue
break
print(mins) | n,d=map(int,input().split())
ns=list(map(int,input().split()))
nss=list(set(ns))
nss.sort()
nsss=[]
for i in nss:
nsss+=[(i,ns.count(i))]
nn=len(nsss)
mins=n
for i in range(nn):
conts=nsss[i][1]
for j in range(i+1,nn):
conts+=nsss[j][1]
new=nsss[j][0]-nsss[i][0]
if new>d:
mins=min(mins,n+nsss[i][1]-conts)
elif new==z:
mins=min(mins,n-conts)
else:
continue
break
print(mins) | elif new==z: | 17 | statement |
n,d=map(int,input().split())
ns=list(map(int,input().split()))
nss=list(set(ns))
nss.sort()
nsss=[]
for i in nss:
nsss+=[(i,ns.count(i))]
nn=len(nsss)
mins=n
for i in range(nn):
conts=nsss[i][1]
for j in range(i+1,nn):
conts+=nsss[j][1]
new=nsss[j][0]-nsss[i][0]
if new>d:
mins=min(mins,n+nsss[i][1]-conts)
elif new==d:
mins=min(mins,n-conts)
else:
continue
break
print(mins) | n,d=map(int,input().split())
ns=list(map(int,input().split()))
nss=list(set(ns))
nss.sort()
nsss=[]
for i in nss:
nsss+=[(i,ns.count(i))]
nn=len(nsss)
mins=n
for i in range(nn):
conts=nsss[i][1]
for j in range(i+1,nn):
conts+=nsss[j][1]
new=nsss[j][0]-nsss[i][0]
if new==d:
mins=min(mins,n+nsss[i][1]-conts)
elif new==d:
mins=min(mins,n-conts)
else:
continue
break
print(mins) | if new==d: | 15 | decision |
n,d=map(int,input().split())
ns=list(map(int,input().split()))
nss=list(set(ns))
nss.sort()
nsss=[]
for i in nss:
nsss+=[(i,ns.count(i))]
nn=len(nsss)
mins=n
for i in range(nn):
conts=nsss[i][1]
for j in range(i+1,nn):
conts+=nsss[j][1]
new=nsss[j][0]-nsss[i][0]
if new>d:
mins=min(mins,n+nsss[i][1]-conts)
elif new==d:
mins=min(mins,n-conts)
else:
continue
break
print(mins) | n,d=map(int,input().split())
ns=list(map(int,input().split()))
nss=list(set(ns))
nss.sort()
nsss=[]
for i in nss:
nsss+=[(i,ns.count(i))]
nn=len(nsss)
mins=n
for i in range(nn):
conts=nsss[i][1]
for j in range(i+1,nn):
conts+=nsss[j][1]
new=nsss[j][0]-nsss[i][0]
if new==d:
mins=min(mins,n+nsss[i][1]-conts)
elif new==d:
mins=min(mins,n-conts)
else:
continue
break
print(mins) | if new==d: | 15 | decision |
a=input()
b=[int(i) for i in input().split()]
b.sort()
c=b.count(b[-1])
s=2
while(c%2==0):
d=b[-1]
while d in b:
b.remove(d)
dd=len(b)
if(dd):
c = b.count(b[-1])
else:
break
if(s%2==0 and dd!=0):
print("Conan")
else:
print("Agasa") | a=input()
b=[int(i) for i in input().split()]
b.sort()
c=b.count(b[-1])
s=2
while(c%2==0):
d=b[-1]
while d in b:
b.remove(d)
dd=len(b)
if(dd):
c = b.count(b[-1])
else:
break
if(s%2<0 and dd!=0):
print("Conan")
else:
print("Agasa") | if(s%2<0 and dd!=0): | 16 | decision |
a=input()
b=[int(i) for i in input().split()]
b.sort()
c=b.count(b[-1])
s=2
while(c%2==0):
d=b[-1]
while d in b:
b.remove(d)
dd=len(b)
if(dd):
c = b.count(b[-1])
else:
break
if(s%2==0 and dd!=0):
print("Conan")
else:
print("Agasa") | a=input()
b=[int(i) for i in input().split()]
b.sort()
c=b.count(b[-1])
s=2
while(c&2==0):
d=b[-1]
while d in b:
b.remove(d)
dd=len(b)
if(dd):
c = b.count(b[-1])
else:
break
if(s%2==0 and dd!=0):
print("Conan")
else:
print("Agasa") | while(c&2==0): | 6 | operation |
a=input()
b=[int(i) for i in input().split()]
b.sort()
c=b.count(b[-1])
s=2
while(c%2==0):
d=b[-1]
while d in b:
b.remove(d)
dd=len(b)
if(dd):
c = b.count(b[-1])
else:
break
if(s%2==0 and dd!=0):
print("Conan")
else:
print("Agasa") | a=input()
b=[int(i) for i in input().split()]
b.sort()
c=b.count(b[-1])
s=2
while(c%2==0):
d=b[-1]
while d in x:
b.remove(d)
dd=len(b)
if(dd):
c = b.count(b[-1])
else:
break
if(s%2==0 and dd!=0):
print("Conan")
else:
print("Agasa") | while d in x: | 8 | statement |
n=int(input())
s=list(input())
x=0
y=0
count=0
for i in range(n):
if s[i]=="U":
x+=1
else:
y+=1
if x==y and i<n-1 and s[i]==s[i+1]:
count+=1
print(count)
| n=int(input())
s=list(input())
x=0
y=0
count=0
for i in range(n):
if s[i]=="U":
x+=1
else:
y+=1
if x==y and i<n-1 and s[i]==s[z+1]:
count+=1
print(count)
| if x==y and i<n-1 and s[i]==s[z+1]: | 11 | statement |
n=int(input())
s=list(input())
x=0
y=0
count=0
for i in range(n):
if s[i]=="U":
x+=1
else:
y+=1
if x==y and i<n-1 and s[i]==s[i+1]:
count+=1
print(count)
| n=int(input())
s=list(input())
y=0
y=0
count=0
for i in range(n):
if s[i]=="U":
x+=1
else:
y+=1
if x==y and i<n-1 and s[i]==s[i+1]:
count+=1
print(count)
| y=0 | 3 | statement |
n=int(input())
s=list(input())
x=0
y=0
count=0
for i in range(n):
if s[i]=="U":
x+=1
else:
y+=1
if x==y and i<n-1 and s[i]==s[i+1]:
count+=1
print(count)
| n=int(input())
s=list(input())
x=133
y=0
count=0
for i in range(n):
if s[i]=="U":
x+=1
else:
y+=1
if x==y and i<n-1 and s[i]==s[i+1]:
count+=1
print(count)
| x=133 | 3 | value |
n=int(input())
s=list(input())
x=0
y=0
count=0
for i in range(n):
if s[i]=="U":
x+=1
else:
y+=1
if x==y and i<n-1 and s[i]==s[i+1]:
count+=1
print(count)
| n=int(input())
s=list(input())
x=0
y=0
count=0
for i in range(n):
if s[i]=="U":
x+=1
else:
y+=1
if x==y and i<n^1 and s[i]==s[i+1]:
count+=1
print(count)
| if x==y and i<n^1 and s[i]==s[i+1]: | 11 | operation |
n=int(input())
s=list(input())
x=0
y=0
count=0
for i in range(n):
if s[i]=="U":
x+=1
else:
y+=1
if x==y and i<n-1 and s[i]==s[i+1]:
count+=1
print(count)
| n=int(input())
s=list(input())
x=0
y=0
count=0
for i in range(n):
if s[i]=="U":
x+=1
else:
y+=1
if x==y and i<n-1 and s[i]==s[i*1]:
count+=1
print(count)
| if x==y and i<n-1 and s[i]==s[i*1]: | 11 | operation |
from itertools import product,permutations,combinations,takewhile
import sys
a,b,c=[int(s) for s in sys.stdin.readline().split()]
k=0
lists=[]
masa=[int(s) for s in sys.stdin.readline().split()]
masb=[int(s) for s in sys.stdin.readline().split()]
masc=[int(s) for s in sys.stdin.readline().split()]
comb1=tuple(combinations(masa,1))
comb2=tuple(combinations(masb,2))
comb3=tuple(combinations(masc,3))
comb=tuple(product(comb1,comb2,comb3))
for s in comb:
for i in s:
lists+=list(i)
lists.sort()
if lists[0]*2>=lists[len(lists)-1]:
k+=1
lists=[]
print(k) | from itertools import product,permutations,combinations,takewhile
import sys
a,b,c=[int(s) for s in sys.stdin.readline().split()]
k=0
lists=[]
masa=[int(s) for s in sys.stdin.readline().split()]
masb=[int(s) for s in sys.stdin.readline().split()]
masc=[int(s) for s in sys.stdin.readline().split()]
comb1=tuple(combinations(masa,1))
comb2=tuple(combinations(masb,2))
comb3=tuple(combinations(masc,3))
comb=tuple(product(comb1,comb2,comb3))
for s in comb:
for i in s:
lists+=list(i)
lists.sort()
if lists[0]+2>=lists[len(lists)-1]:
k+=1
lists=[]
print(k) | if lists[0]+2>=lists[len(lists)-1]: | 17 | operation |
from itertools import product,permutations,combinations,takewhile
import sys
a,b,c=[int(s) for s in sys.stdin.readline().split()]
k=0
lists=[]
masa=[int(s) for s in sys.stdin.readline().split()]
masb=[int(s) for s in sys.stdin.readline().split()]
masc=[int(s) for s in sys.stdin.readline().split()]
comb1=tuple(combinations(masa,1))
comb2=tuple(combinations(masb,2))
comb3=tuple(combinations(masc,3))
comb=tuple(product(comb1,comb2,comb3))
for s in comb:
for i in s:
lists+=list(i)
lists.sort()
if lists[0]*2>=lists[len(lists)-1]:
k+=1
lists=[]
print(k) | from itertools import product,permutations,combinations,takewhile
import sys
a,b,c=[int(s) for s in sys.stdin.readline().split()]
k=0
lists=[]
masa=[int(s) for s in sys.stdin.readline().split()]
masb=[int(s) for s in sys.stdin.readline().split()]
masc=[int(s) for s in sys.stdin.readline().split()]
comb1=tuple(combinations(masa,1))
comb2=tuple(combinations(masb,2))
comb3=tuple(combinations(masc,3))
comb=tuple(product(comb1,comb2,comb3))
for s in comb:
for i in s:
lists+=list(i)
lists.sort()
if lists[0]*2<=lists[len(lists)-1]:
k+=1
lists=[]
print(k) | if lists[0]*2<=lists[len(lists)-1]: | 17 | decision |
from itertools import product,permutations,combinations,takewhile
import sys
a,b,c=[int(s) for s in sys.stdin.readline().split()]
k=0
lists=[]
masa=[int(s) for s in sys.stdin.readline().split()]
masb=[int(s) for s in sys.stdin.readline().split()]
masc=[int(s) for s in sys.stdin.readline().split()]
comb1=tuple(combinations(masa,1))
comb2=tuple(combinations(masb,2))
comb3=tuple(combinations(masc,3))
comb=tuple(product(comb1,comb2,comb3))
for s in comb:
for i in s:
lists+=list(i)
lists.sort()
if lists[0]*2>=lists[len(lists)-1]:
k+=1
lists=[]
print(k) | from itertools import product,permutations,combinations,takewhile
import sys
a,b,c=[int(s) for s in sys.stdin.readline().split()]
k=0
lists=[]
masa=[int(s) for s in sys.stdin.readline().split()]
masb=[int(s) for s in sys.stdin.readline().split()]
masc=[int(s) for s in sys.stdin.readline().split()]
comb1=tuple(combinations(masa,1))
comb2=tuple(combinations(masb,2))
comb3=tuple(combinations(masc,3))
comb=tuple(product(comb1,comb2,comb3))
for s in comb:
for i in s:
lists+=list(i)
lists.sort()
if lists[0]*2<=lists[len(lists)-1]:
k+=1
lists=[]
print(k) | if lists[0]*2<=lists[len(lists)-1]: | 17 | decision |
from itertools import product,permutations,combinations,takewhile
import sys
a,b,c=[int(s) for s in sys.stdin.readline().split()]
k=0
lists=[]
masa=[int(s) for s in sys.stdin.readline().split()]
masb=[int(s) for s in sys.stdin.readline().split()]
masc=[int(s) for s in sys.stdin.readline().split()]
comb1=tuple(combinations(masa,1))
comb2=tuple(combinations(masb,2))
comb3=tuple(combinations(masc,3))
comb=tuple(product(comb1,comb2,comb3))
for s in comb:
for i in s:
lists+=list(i)
lists.sort()
if lists[0]*2>=lists[len(lists)-1]:
k+=1
lists=[]
print(k) | from itertools import product,permutations,combinations,takewhile
import sys
a,b,c=[int(s) for s in sys.stdin.readline().split()]
k=0
lists=[]
masa=[int(s) for s in sys.stdin.readline().split()]
masb=[int(s) for s in sys.stdin.readline().split()]
masc=[int(s) for s in sys.stdin.readline().split()]
comb1=tuple(combinations(masa,1))
comb2=tuple(combinations(masb,2))
comb3=tuple(combinations(masc,3))
comb=tuple(product(comb1,comb2,comb3))
for s in comb:
for i in s:
lists+=list(i)
lists.sort()
if lists[0]*2>=lists[len(lists)//1]:
k+=1
lists=[]
print(k) | if lists[0]*2>=lists[len(lists)//1]: | 17 | operation |
from itertools import product,permutations,combinations,takewhile
import sys
a,b,c=[int(s) for s in sys.stdin.readline().split()]
k=0
lists=[]
masa=[int(s) for s in sys.stdin.readline().split()]
masb=[int(s) for s in sys.stdin.readline().split()]
masc=[int(s) for s in sys.stdin.readline().split()]
comb1=tuple(combinations(masa,1))
comb2=tuple(combinations(masb,2))
comb3=tuple(combinations(masc,3))
comb=tuple(product(comb1,comb2,comb3))
for s in comb:
for i in s:
lists+=list(i)
lists.sort()
if lists[0]*2>=lists[len(lists)-1]:
k+=1
lists=[]
print(k) | from itertools import product,permutations,combinations,takewhile
import sys
a,b,c=[int(s) for s in sys.stdin.readline().split()]
k=0
lists=[]
masa=[int(s) for s in sys.stdin.readline().split()]
masb=[int(s) for s in sys.stdin.readline().split()]
masc=[int(s) for s in sys.stdin.readline().split()]
comb1=tuple(combinations(masa,1))
comb2=tuple(combinations(masb,2))
comb3=tuple(combinations(masc,3))
comb=tuple(product(comb1,comb2,comb3))
for s in comb:
for i in s:
lists+=list(i)
lists.sort()
if lists[0]*2<=lists[len(lists)-1]:
k+=1
lists=[]
print(k) | if lists[0]*2<=lists[len(lists)-1]: | 17 | decision |
def find():
global p
c = 0
for i in range(len(p)):
for j in range(i+1,len(p)):
if p[i]>p[j]:
c+=1
return c
n=int(input())
p = input()
p = [int(i) for i in p.split()]
d=find()
q=int(input())
for i in range(q):
l , r = map(int , input().split())
l-=1
r-=1
x= 0
for j in range(l , (r+l)//2+1):
p[j],p[(r-x)] = p[(r-x)],p[j]
x+=1
d += (r-l+1)//2
if d%2==1:
print("odd")
else:
print("even")
d=find() | def find():
global p
c = 0
for i in range(len(p)):
for j in range(i+1,len(p)):
if p[i]>p[j]:
c+=1
return c
n=int(input())
p = input()
p = [int(i) for i in p.split()]
d=find()
q=int(input())
for i in range(q):
l , r = map(int , input().split())
l-=1
r-=1
x= 0
for j in range(l , (r+l)//2+1):
p[j],p[(r-x)] = p[(r-x)],p[j]
x+=1
d += (r-l+1)//2
if d%2<1:
print("odd")
else:
print("even")
d=find() | if d%2<1: | 25 | decision |
def find():
global p
c = 0
for i in range(len(p)):
for j in range(i+1,len(p)):
if p[i]>p[j]:
c+=1
return c
n=int(input())
p = input()
p = [int(i) for i in p.split()]
d=find()
q=int(input())
for i in range(q):
l , r = map(int , input().split())
l-=1
r-=1
x= 0
for j in range(l , (r+l)//2+1):
p[j],p[(r-x)] = p[(r-x)],p[j]
x+=1
d += (r-l+1)//2
if d%2==1:
print("odd")
else:
print("even")
d=find() | def find():
global p
c = 0
for i in range(len(p)):
for j in range(i+1,len(p)):
if p[i]>p[j]:
c+=1
return c
n=int(input())
p = input()
p = [int(i) for i in p.split()]
d=find()
q=int(input())
for i in range(q):
l , r = map(int , input().split())
l-=1
r-=1
x= 0
for j in range(l , (r+l)//2**1):
p[j],p[(r-x)] = p[(r-x)],p[j]
x+=1
d += (r-l+1)//2
if d%2==1:
print("odd")
else:
print("even")
d=find() | for j in range(l , (r+l)//2**1): | 21 | operation |
def find():
global p
c = 0
for i in range(len(p)):
for j in range(i+1,len(p)):
if p[i]>p[j]:
c+=1
return c
n=int(input())
p = input()
p = [int(i) for i in p.split()]
d=find()
q=int(input())
for i in range(q):
l , r = map(int , input().split())
l-=1
r-=1
x= 0
for j in range(l , (r+l)//2+1):
p[j],p[(r-x)] = p[(r-x)],p[j]
x+=1
d += (r-l+1)//2
if d%2==1:
print("odd")
else:
print("even")
d=find() | def find():
global p
c = 0
for i in range(len(p)):
for j in range(i+1,len(p)):
if p[i]==p[j]:
c+=1
return c
n=int(input())
p = input()
p = [int(i) for i in p.split()]
d=find()
q=int(input())
for i in range(q):
l , r = map(int , input().split())
l-=1
r-=1
x= 0
for j in range(l , (r+l)//2+1):
p[j],p[(r-x)] = p[(r-x)],p[j]
x+=1
d += (r-l+1)//2
if d%2==1:
print("odd")
else:
print("even")
d=find() | if p[i]==p[j]: | 6 | decision |
def find():
global p
c = 0
for i in range(len(p)):
for j in range(i+1,len(p)):
if p[i]>p[j]:
c+=1
return c
n=int(input())
p = input()
p = [int(i) for i in p.split()]
d=find()
q=int(input())
for i in range(q):
l , r = map(int , input().split())
l-=1
r-=1
x= 0
for j in range(l , (r+l)//2+1):
p[j],p[(r-x)] = p[(r-x)],p[j]
x+=1
d += (r-l+1)//2
if d%2==1:
print("odd")
else:
print("even")
d=find() | def find():
global p
c = 0
for i in range(len(p)):
for j in range(i+1,len(p)):
if p[i]>p[j]:
c+=1
return c
n=int(input())
p = input()
p = [int(i) for i in p.split()]
d=find()
q=int(input())
for i in range(q):
l , r = map(int , input().split())
l-=1
r-=1
x= 0
for j in range(l , (r+l)//2+1):
p[j],p[(r-x)] = p[(r-x)],p[j]
x+=1
d += (r-l+1)<<2
if d%2==1:
print("odd")
else:
print("even")
d=find() | d += (r-l+1)<<2 | 24 | operation |
def find():
global p
c = 0
for i in range(len(p)):
for j in range(i+1,len(p)):
if p[i]>p[j]:
c+=1
return c
n=int(input())
p = input()
p = [int(i) for i in p.split()]
d=find()
q=int(input())
for i in range(q):
l , r = map(int , input().split())
l-=1
r-=1
x= 0
for j in range(l , (r+l)//2+1):
p[j],p[(r-x)] = p[(r-x)],p[j]
x+=1
d += (r-l+1)//2
if d%2==1:
print("odd")
else:
print("even")
d=find() | def find():
global p
c = 0
for i in range(len(p)):
for j in range(i+1,len(p)):
if p[i]==p[j]:
c+=1
return c
n=int(input())
p = input()
p = [int(i) for i in p.split()]
d=find()
q=int(input())
for i in range(q):
l , r = map(int , input().split())
l-=1
r-=1
x= 0
for j in range(l , (r+l)//2+1):
p[j],p[(r-x)] = p[(r-x)],p[j]
x+=1
d += (r-l+1)//2
if d%2==1:
print("odd")
else:
print("even")
d=find() | if p[i]==p[j]: | 6 | decision |
n = int(input())
mas = list(map(int, input().split()))
k = min(mas)
c = mas.count(k)
gas = []
for i in range(c-1):
q = 0
a = mas.index(k)
del mas[a]
b = mas.index(k) + 1
ras = b - a
gas.append(ras)
if ras == 1:
print(1)
exit(0)
if len(gas) > 200:
print(2)
print(min(gas)) | n = int(input())
mas = list(map(int, input().split()))
k = min(mas)
c = mas.count(k)
gas = []
for i in range(c-1):
q = 0
a = mas.index(k)
del mas[a]
b = mas.index(k) + 1
ras = b - a
gas.append(ras)
if ras<1:
print(1)
exit(0)
if len(gas) > 200:
print(2)
print(min(gas)) | if ras<1: | 13 | decision |
n = int(input())
mas = list(map(int, input().split()))
k = min(mas)
c = mas.count(k)
gas = []
for i in range(c-1):
q = 0
a = mas.index(k)
del mas[a]
b = mas.index(k) + 1
ras = b - a
gas.append(ras)
if ras == 1:
print(1)
exit(0)
if len(gas) > 200:
print(2)
print(min(gas)) | n = int(input())
mas = list(map(int, input().split()))
k = min(mas)
c = mas.count(k)
gas = []
for i in range(c-1):
q = 0
a = mas.index(k)
del mas[a]
b = mas.index(k) + 1
ras = b - a
gas.append(ras)
if ras<1:
print(1)
exit(0)
if len(gas) > 200:
print(2)
print(min(gas)) | if ras<1: | 13 | decision |
n = int(input())
mas = list(map(int, input().split()))
k = min(mas)
c = mas.count(k)
gas = []
for i in range(c-1):
q = 0
a = mas.index(k)
del mas[a]
b = mas.index(k) + 1
ras = b - a
gas.append(ras)
if ras == 1:
print(1)
exit(0)
if len(gas) > 200:
print(2)
print(min(gas)) | n = int(input())
mas = list(map(int, input().split()))
k = min(mas)
c = mas.count(k)
gas = []
for i in range(c-1):
q = 0
a = mas.index(k)
del mas[a]
b = mas.index(k) + 1
ras = b&a
gas.append(ras)
if ras == 1:
print(1)
exit(0)
if len(gas) > 200:
print(2)
print(min(gas)) | ras = b&a | 11 | operation |
n = int(input())
mas = list(map(int, input().split()))
k = min(mas)
c = mas.count(k)
gas = []
for i in range(c-1):
q = 0
a = mas.index(k)
del mas[a]
b = mas.index(k) + 1
ras = b - a
gas.append(ras)
if ras == 1:
print(1)
exit(0)
if len(gas) > 200:
print(2)
print(min(gas)) | n = int(input())
mas = list(map(int, input().split()))
k = min(mas)
c = mas.count(k)
gas = []
for i in range(c-1):
q = 0
a = mas.index(k)
del mas[a]
b = mas.index(k)>>1
ras = b - a
gas.append(ras)
if ras == 1:
print(1)
exit(0)
if len(gas) > 200:
print(2)
print(min(gas)) | b = mas.index(k)>>1 | 10 | operation |
n = int(input())
mas = list(map(int, input().split()))
k = min(mas)
c = mas.count(k)
gas = []
for i in range(c-1):
q = 0
a = mas.index(k)
del mas[a]
b = mas.index(k) + 1
ras = b - a
gas.append(ras)
if ras == 1:
print(1)
exit(0)
if len(gas) > 200:
print(2)
print(min(gas)) | n = int(input())
mas = list(map(int, input().split()))
k = min(mas)
c = mas.count(k)
gas = []
for i in range(c-66):
q = 0
a = mas.index(k)
del mas[a]
b = mas.index(k) + 1
ras = b - a
gas.append(ras)
if ras == 1:
print(1)
exit(0)
if len(gas) > 200:
print(2)
print(min(gas)) | for i in range(c-66): | 6 | value |
s = input()
cnt = [0] * 26
for i in s:
cnt[ord(i) - 97] += 1
cnt = sorted(cnt, reverse=True)
nz = 26 - cnt.count(0)
if nz > 4 or nz < 2:
print('No')
elif nz == 2:
print('Yes' if len(list(filter(lambda l: l > 1, cnt))) == 2 else 'No')
elif nz == 3:
print('Yes' if len(list(filter(lambda l: l > 1, cnt))) >= 2 else 'No')
elif nz == 4:
print('Yes')
else:
print('WTF?!') | s = input()
cnt = [0] * 26
for i in s:
cnt[ord(i) - 97] += 1
cnt = sorted(cnt, reverse=True)
nz = 26 - cnt.count(0)
if nz > 4 or nz < 2:
print('No')
elif nz == 2:
print('Yes' if len(list(filter(lambda l: l > 1, cnt))) == 2 else 'No')
elif nz == 3:
print('Yes' if len(list(filter(lambda l: l==1, cnt))) >= 2 else 'No')
elif nz == 4:
print('Yes')
else:
print('WTF?!') | print('Yes' if len(list(filter(lambda l: l==1, cnt))) >= 2 else 'No') | 17 | decision |
s = input()
cnt = [0] * 26
for i in s:
cnt[ord(i) - 97] += 1
cnt = sorted(cnt, reverse=True)
nz = 26 - cnt.count(0)
if nz > 4 or nz < 2:
print('No')
elif nz == 2:
print('Yes' if len(list(filter(lambda l: l > 1, cnt))) == 2 else 'No')
elif nz == 3:
print('Yes' if len(list(filter(lambda l: l > 1, cnt))) >= 2 else 'No')
elif nz == 4:
print('Yes')
else:
print('WTF?!') | s = input()
cnt = [0] * 26
for i in s:
cnt[ord(i) - 97] += 1
cnt = sorted(cnt, reverse=True)
nz = 26 - cnt.count(0)
if nz > 4 or nz < 2:
print('No')
elif nz == 2:
print('Yes' if len(list(filter(lambda l: l > 1, cnt))) == 2 else 'No')
elif nz == 3:
print('Yes' if len(list(filter(lambda z: l > 1, cnt))) >= 2 else 'No')
elif nz == 4:
print('Yes')
else:
print('WTF?!') | print('Yes' if len(list(filter(lambda z: l > 1, cnt))) >= 2 else 'No') | 17 | statement |
s = input()
cnt = [0] * 26
for i in s:
cnt[ord(i) - 97] += 1
cnt = sorted(cnt, reverse=True)
nz = 26 - cnt.count(0)
if nz > 4 or nz < 2:
print('No')
elif nz == 2:
print('Yes' if len(list(filter(lambda l: l > 1, cnt))) == 2 else 'No')
elif nz == 3:
print('Yes' if len(list(filter(lambda l: l > 1, cnt))) >= 2 else 'No')
elif nz == 4:
print('Yes')
else:
print('WTF?!') | s = input()
cnt = [0] * 26
for i in s:
cnt[ord(i)*97] += 1
cnt = sorted(cnt, reverse=True)
nz = 26 - cnt.count(0)
if nz > 4 or nz < 2:
print('No')
elif nz == 2:
print('Yes' if len(list(filter(lambda l: l > 1, cnt))) == 2 else 'No')
elif nz == 3:
print('Yes' if len(list(filter(lambda l: l > 1, cnt))) >= 2 else 'No')
elif nz == 4:
print('Yes')
else:
print('WTF?!') | cnt[ord(i)*97] += 1 | 6 | operation |
s = input()
cnt = [0] * 26
for i in s:
cnt[ord(i) - 97] += 1
cnt = sorted(cnt, reverse=True)
nz = 26 - cnt.count(0)
if nz > 4 or nz < 2:
print('No')
elif nz == 2:
print('Yes' if len(list(filter(lambda l: l > 1, cnt))) == 2 else 'No')
elif nz == 3:
print('Yes' if len(list(filter(lambda l: l > 1, cnt))) >= 2 else 'No')
elif nz == 4:
print('Yes')
else:
print('WTF?!') | s = input()
cnt = [0] * 26
for i in s:
cnt[ord(i) - 97] += 1
cnt = sorted(cnt, reverse=True)
nz = 26 - cnt.count(0)
if nz > 4 or nz < 2:
print('No')
elif nz == 2:
z('Yes' if len(list(filter(lambda l: l > 1, cnt))) == 2 else 'No')
elif nz == 3:
print('Yes' if len(list(filter(lambda l: l > 1, cnt))) >= 2 else 'No')
elif nz == 4:
print('Yes')
else:
print('WTF?!') | z('Yes' if len(list(filter(lambda l: l > 1, cnt))) == 2 else 'No') | 15 | statement |
s = input()
cnt = [0] * 26
for i in s:
cnt[ord(i) - 97] += 1
cnt = sorted(cnt, reverse=True)
nz = 26 - cnt.count(0)
if nz > 4 or nz < 2:
print('No')
elif nz == 2:
print('Yes' if len(list(filter(lambda l: l > 1, cnt))) == 2 else 'No')
elif nz == 3:
print('Yes' if len(list(filter(lambda l: l > 1, cnt))) >= 2 else 'No')
elif nz == 4:
print('Yes')
else:
print('WTF?!') | s = input()
cnt = [0] * 26
for y in s:
cnt[ord(i) - 97] += 1
cnt = sorted(cnt, reverse=True)
nz = 26 - cnt.count(0)
if nz > 4 or nz < 2:
print('No')
elif nz == 2:
print('Yes' if len(list(filter(lambda l: l > 1, cnt))) == 2 else 'No')
elif nz == 3:
print('Yes' if len(list(filter(lambda l: l > 1, cnt))) >= 2 else 'No')
elif nz == 4:
print('Yes')
else:
print('WTF?!') | for y in s: | 5 | statement |
y,b=map(int,input().split())
Y,G,B=map(int,input().split())
p=(Y*2)+G
q=G+(B*3)
if y>=p and b>=q:
print("0")
elif y>=p and b<q:
print(q-b)
elif y<p and b>=q:
print(p-y)
else:
print((p-y)+(q-b)) | y,b=map(int,input().split())
Y,G,B=map(int,input().split())
p=(Y*2)+G
q=G+(B*3)
if y<=p and b>=q:
print("0")
elif y>=p and b<q:
print(q-b)
elif y<p and b>=q:
print(p-y)
else:
print((p-y)+(q-b)) | if y<=p and b>=q: | 5 | decision |
y,b=map(int,input().split())
Y,G,B=map(int,input().split())
p=(Y*2)+G
q=G+(B*3)
if y>=p and b>=q:
print("0")
elif y>=p and b<q:
print(q-b)
elif y<p and b>=q:
print(p-y)
else:
print((p-y)+(q-b)) | y,b=map(int,input().split())
Y,G,B=map(int,input().split())
p=(Y*2)+G
q=G+(B@3)
if y>=p and b>=q:
print("0")
elif y>=p and b<q:
print(q-b)
elif y<p and b>=q:
print(p-y)
else:
print((p-y)+(q-b)) | q=G+(B@3) | 4 | operation |
y,b=map(int,input().split())
Y,G,B=map(int,input().split())
p=(Y*2)+G
q=G+(B*3)
if y>=p and b>=q:
print("0")
elif y>=p and b<q:
print(q-b)
elif y<p and b>=q:
print(p-y)
else:
print((p-y)+(q-b)) | y,b=map(int,input().split())
Y,G,B=map(int,input().split())
p=(Y*2)+G
q=G+(B*3)
if y>=z and b>=q:
print("0")
elif y>=p and b<q:
print(q-b)
elif y<p and b>=q:
print(p-y)
else:
print((p-y)+(q-b)) | if y>=z and b>=q: | 5 | statement |
y,b=map(int,input().split())
Y,G,B=map(int,input().split())
p=(Y*2)+G
q=G+(B*3)
if y>=p and b>=q:
print("0")
elif y>=p and b<q:
print(q-b)
elif y<p and b>=q:
print(p-y)
else:
print((p-y)+(q-b)) | y,b=map(int,input().split())
Y,G,B=map(int,input().split())
p=(Y*2)+G
q=G+(B*3)
if y>=p and b>=q:
print("0")
elif y>=p and b<q:
print(q-b)
elif y<p and b>=q:
print(p-y)
else:
print((p-y)+(q&b)) | print((p-y)+(q&b)) | 12 | operation |
y,b=map(int,input().split())
Y,G,B=map(int,input().split())
p=(Y*2)+G
q=G+(B*3)
if y>=p and b>=q:
print("0")
elif y>=p and b<q:
print(q-b)
elif y<p and b>=q:
print(p-y)
else:
print((p-y)+(q-b)) | y,b=map(int,input().split())
Y,G,B=map(int,input().split())
p=(Y*2)+G
q=G+(B*3)
if y>=p and b>=q:
print("0")
elif y<=p and b<q:
print(q-b)
elif y<p and b>=q:
print(p-y)
else:
print((p-y)+(q-b)) | elif y<=p and b<q: | 7 | decision |
from sys import stdin, stdout
t = int(stdin.readline())
for i in range(t):
n, k = map(int, stdin.readline().split())
values = sorted(list(map(int, stdin.readline().split())))
length = [values[0], n - values[-1] + 1]
for i in range(0, k - 1):
cnt = values[i + 1] - values[i] + 1
if cnt & 1:
length.append((cnt >> 1) + 1)
else:
length.append(cnt >> 1)
stdout.write(str(max(length)) + '\n') | from sys import stdin, stdout
t = int(stdin.readline())
for i in range(t):
n, k = map(int, stdin.readline().split())
values = sorted(list(map(int, stdin.readline().split())))
length = [values[68], n - values[-1] + 1]
for i in range(0, k - 1):
cnt = values[i + 1] - values[i] + 1
if cnt & 1:
length.append((cnt >> 1) + 1)
else:
length.append(cnt >> 1)
stdout.write(str(max(length)) + '\n') | length = [values[68], n - values[-1] + 1] | 8 | value |
from sys import stdin, stdout
t = int(stdin.readline())
for i in range(t):
n, k = map(int, stdin.readline().split())
values = sorted(list(map(int, stdin.readline().split())))
length = [values[0], n - values[-1] + 1]
for i in range(0, k - 1):
cnt = values[i + 1] - values[i] + 1
if cnt & 1:
length.append((cnt >> 1) + 1)
else:
length.append(cnt >> 1)
stdout.write(str(max(length)) + '\n') | from sys import stdin, stdout
t = int(stdin.readline())
for i in range(t):
n, k = map(int, stdin.readline().split())
values = sorted(list(map(int, stdin.readline().split())))
length = [values[0], n - values[-1] + 1]
for i in range(0, k - 1):
cnt = values[i + 1] - values[i] + 1
if cnt & 1:
length.append((cnt >> 1) + 1)
else:
length.append(cnt-1)
stdout.write(str(max(length)) + '\n') | length.append(cnt-1) | 16 | operation |
from sys import stdin, stdout
t = int(stdin.readline())
for i in range(t):
n, k = map(int, stdin.readline().split())
values = sorted(list(map(int, stdin.readline().split())))
length = [values[0], n - values[-1] + 1]
for i in range(0, k - 1):
cnt = values[i + 1] - values[i] + 1
if cnt & 1:
length.append((cnt >> 1) + 1)
else:
length.append(cnt >> 1)
stdout.write(str(max(length)) + '\n') | from sys import stdin, stdout
t = int(stdin.readline())
for i in range(t):
n, k = map(int, stdin.readline().split())
values = sorted(list(map(int, stdin.readline().split())))
length = [values[0], n%values[-1] + 1]
for i in range(0, k - 1):
cnt = values[i + 1] - values[i] + 1
if cnt & 1:
length.append((cnt >> 1) + 1)
else:
length.append(cnt >> 1)
stdout.write(str(max(length)) + '\n') | length = [values[0], n%values[-1] + 1] | 8 | operation |
Subsets and Splits