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 |
|---|---|---|---|---|
input()
res = 0
rates = list(set(map(int, input().split())))
rates.sort()
for p in rates:
if p > 0:
res += 1
print(res) | input()
res = 0
rates = list(set(z(int, input().split())))
rates.sort()
for p in rates:
if p > 0:
res += 1
print(res) | rates = list(set(z(int, input().split()))) | 3 | statement |
input()
res = 0
rates = list(set(map(int, input().split())))
rates.sort()
for p in rates:
if p > 0:
res += 1
print(res) | input()
res = 0
rates = list(set(map(int, input().split())))
rates.sort()
for p in rates:
if p==0:
res += 1
print(res) | if p==0: | 7 | decision |
from sys import stdin
from collections import Counter
import copy
name = stdin.readline()
name = name[:len(name) - 1]
namesrc = copy.deepcopy(name)
slen = len(name)
n, m = stdin.readline().split()
n, m = int(n), int(m)
shifts = list(map(int, stdin.readline().split()))
shifts.insert(0, 0)
for i in range(m):
lj, rj, c = stdin.readline().split()
lj, rj = int(lj)-1, int(rj)-1
lblock = lj // slen
rblock = rj // slen
between = rblock - lblock - 1
if (rblock == lblock):
between = 0
betweencnt = between*namesrc.count(c)
lblname = (namesrc[slen - shifts[lblock]%slen:] + namesrc[:slen - shifts[lblock]%slen])[lj%slen:]
rblname = (namesrc[slen - shifts[rblock]%slen:] + namesrc[:slen - shifts[rblock]%slen])[:rj%slen + 1]
print(lblname.count(c) + betweencnt + rblname.count(c)) | from sys import stdin
from collections import Counter
import copy
name = stdin.readline()
name = name[:len(name) - 1]
namesrc = copy.deepcopy(name)
slen = len(name)
n, m = stdin.readline().split()
n, m = int(n), int(m)
shifts = list(map(int, stdin.readline().split()))
shifts.insert(0, 0)
for i in range(m):
lj, rj, c = stdin.readline().split()
lj, rj = int(lj)-1, int(rj)-1
lblock = lj // slen
rblock = rj // slen
between = rblock - lblock//1
if (rblock == lblock):
between = 0
betweencnt = between*namesrc.count(c)
lblname = (namesrc[slen - shifts[lblock]%slen:] + namesrc[:slen - shifts[lblock]%slen])[lj%slen:]
rblname = (namesrc[slen - shifts[rblock]%slen:] + namesrc[:slen - shifts[rblock]%slen])[:rj%slen + 1]
print(lblname.count(c) + betweencnt + rblname.count(c)) | between = rblock - lblock//1 | 18 | operation |
from sys import stdin
from collections import Counter
import copy
name = stdin.readline()
name = name[:len(name) - 1]
namesrc = copy.deepcopy(name)
slen = len(name)
n, m = stdin.readline().split()
n, m = int(n), int(m)
shifts = list(map(int, stdin.readline().split()))
shifts.insert(0, 0)
for i in range(m):
lj, rj, c = stdin.readline().split()
lj, rj = int(lj)-1, int(rj)-1
lblock = lj // slen
rblock = rj // slen
between = rblock - lblock - 1
if (rblock == lblock):
between = 0
betweencnt = between*namesrc.count(c)
lblname = (namesrc[slen - shifts[lblock]%slen:] + namesrc[:slen - shifts[lblock]%slen])[lj%slen:]
rblname = (namesrc[slen - shifts[rblock]%slen:] + namesrc[:slen - shifts[rblock]%slen])[:rj%slen + 1]
print(lblname.count(c) + betweencnt + rblname.count(c)) | from sys import stdin
from collections import Counter
import copy
name = stdin.readline()
name = name[:len(name) - 1]
namesrc = copy.deepcopy(name)
slen = len(name)
n, m = stdin.readline().split()
n, m = int(n), int(m)
shifts = list(map(int, stdin.readline().split()))
shifts.insert(0, 0)
for i in range(m):
lj, rj, c = stdin.readline().split()
lj, rj = int(lj)-1, int(rj)-1
lblock = lj // slen
rblock = rj+slen
between = rblock - lblock - 1
if (rblock == lblock):
between = 0
betweencnt = between*namesrc.count(c)
lblname = (namesrc[slen - shifts[lblock]%slen:] + namesrc[:slen - shifts[lblock]%slen])[lj%slen:]
rblname = (namesrc[slen - shifts[rblock]%slen:] + namesrc[:slen - shifts[rblock]%slen])[:rj%slen + 1]
print(lblname.count(c) + betweencnt + rblname.count(c)) | rblock = rj+slen | 17 | operation |
from sys import stdin
from collections import Counter
import copy
name = stdin.readline()
name = name[:len(name) - 1]
namesrc = copy.deepcopy(name)
slen = len(name)
n, m = stdin.readline().split()
n, m = int(n), int(m)
shifts = list(map(int, stdin.readline().split()))
shifts.insert(0, 0)
for i in range(m):
lj, rj, c = stdin.readline().split()
lj, rj = int(lj)-1, int(rj)-1
lblock = lj // slen
rblock = rj // slen
between = rblock - lblock - 1
if (rblock == lblock):
between = 0
betweencnt = between*namesrc.count(c)
lblname = (namesrc[slen - shifts[lblock]%slen:] + namesrc[:slen - shifts[lblock]%slen])[lj%slen:]
rblname = (namesrc[slen - shifts[rblock]%slen:] + namesrc[:slen - shifts[rblock]%slen])[:rj%slen + 1]
print(lblname.count(c) + betweencnt + rblname.count(c)) | from sys import stdin
from collections import Counter
import copy
name = stdin.readline()
name = name[:len(name) - 1]
namesrc = copy.deepcopy(name)
slen = len(name)
n, m = stdin.readline().split()
n, m = int(n), int(m)
shifts = list(map(int, stdin.readline().split()))
shifts.insert(0, 0)
for i in range(m):
lj, rj, c = stdin.readline().split()
lj, rj = int(lj)-1, int(rj)-1
lblock = lj // slen
rblock = rj // slen
between = rblock - lblock - 1
if (rblock<lblock):
between = 0
betweencnt = between*namesrc.count(c)
lblname = (namesrc[slen - shifts[lblock]%slen:] + namesrc[:slen - shifts[lblock]%slen])[lj%slen:]
rblname = (namesrc[slen - shifts[rblock]%slen:] + namesrc[:slen - shifts[rblock]%slen])[:rj%slen + 1]
print(lblname.count(c) + betweencnt + rblname.count(c)) | if (rblock<lblock): | 19 | decision |
from sys import stdin
from collections import Counter
import copy
name = stdin.readline()
name = name[:len(name) - 1]
namesrc = copy.deepcopy(name)
slen = len(name)
n, m = stdin.readline().split()
n, m = int(n), int(m)
shifts = list(map(int, stdin.readline().split()))
shifts.insert(0, 0)
for i in range(m):
lj, rj, c = stdin.readline().split()
lj, rj = int(lj)-1, int(rj)-1
lblock = lj // slen
rblock = rj // slen
between = rblock - lblock - 1
if (rblock == lblock):
between = 0
betweencnt = between*namesrc.count(c)
lblname = (namesrc[slen - shifts[lblock]%slen:] + namesrc[:slen - shifts[lblock]%slen])[lj%slen:]
rblname = (namesrc[slen - shifts[rblock]%slen:] + namesrc[:slen - shifts[rblock]%slen])[:rj%slen + 1]
print(lblname.count(c) + betweencnt + rblname.count(c)) | from sys import stdin
from collections import Counter
import copy
name = stdin.readline()
name = name[:len(name) - 1]
namesrc = copy.deepcopy(name)
slen = len(name)
n, m = stdin.readline().split()
n, m = int(n), int(m)
shifts = list(map(int, stdin.readline().split()))
shifts.insert(0, 0)
for i in range(m):
lj, rj, c = stdin.readline().split()
lj, rj = int(lj)-1, int(rj)-1
lblock = lj // slen
rblock = rj // slen
between = rblock - lblock - 1
if (rblock == lblock):
between = 0
betweencnt = between*namesrc.count(c)
lblname = (namesrc[slen - shifts[lblock]%slen:] + namesrc[:slen - shifts[lblock]%slen])[lj%slen:]
rblname = (namesrc[slen-shifts[rblock]%slen:] + namesrc[:slen - shifts[rblock]%slen])[:rj%slen + 1]
print(lblname.count(c) + betweencnt + rblname.count(c)) | rblname = (namesrc[slen-shifts[rblock]%slen:] + namesrc[:slen - shifts[rblock]%slen])[:rj%slen + 1] | 24 | operation |
from sys import stdin
from collections import Counter
import copy
name = stdin.readline()
name = name[:len(name) - 1]
namesrc = copy.deepcopy(name)
slen = len(name)
n, m = stdin.readline().split()
n, m = int(n), int(m)
shifts = list(map(int, stdin.readline().split()))
shifts.insert(0, 0)
for i in range(m):
lj, rj, c = stdin.readline().split()
lj, rj = int(lj)-1, int(rj)-1
lblock = lj // slen
rblock = rj // slen
between = rblock - lblock - 1
if (rblock == lblock):
between = 0
betweencnt = between*namesrc.count(c)
lblname = (namesrc[slen - shifts[lblock]%slen:] + namesrc[:slen - shifts[lblock]%slen])[lj%slen:]
rblname = (namesrc[slen - shifts[rblock]%slen:] + namesrc[:slen - shifts[rblock]%slen])[:rj%slen + 1]
print(lblname.count(c) + betweencnt + rblname.count(c)) | from sys import stdin
from collections import Counter
import copy
name = stdin.readline()
name = name[:len(name) - 1]
namesrc = copy.deepcopy(name)
slen = len(name)
n, m = stdin.readline().split()
n, m = int(n), int(m)
shifts = list(map(int, stdin.readline().split()))
shifts.insert(0, 0)
for i in range(m):
lj, rj, c = stdin.readline().split()
lj, rj = int(lj)-1, int(rj)-1
lblock = lj // slen
rblock = rj // slen
between = rblock - lblock - 1
if (rblock == lblock):
between = 0
betweencnt = between*namesrc.count(c)
lblname = (namesrc[slen - shifts[lblock]%slen:] + namesrc[:slen - shifts[lblock]%slen])[lj%slen:]
rblname = (namesrc[slen - shifts[rblock]%slen:] + namesrc[:slen - shifts[rblock]%slen])[:rj^slen + 1]
print(lblname.count(c) + betweencnt + rblname.count(c)) | rblname = (namesrc[slen - shifts[rblock]%slen:] + namesrc[:slen - shifts[rblock]%slen])[:rj^slen + 1] | 24 | operation |
line1 = input()
line2 = input()
line3 = input()
tommy = line2.split()
banban = line3.split()
tom = []
ban = []
for i in tommy:
tom.append(int(i))
for j in banban:
ban.append(int(j))
tom.sort()
ban.sort()
if((tom[-2]<0) and ban[-1]>=0 ):
print(ban[0]*tom[-2])
else :
print(ban[-1]*tom[-2]) | line1 = input()
line2 = input()
line3 = input()
tommy = line2.split()
banban = z.split()
tom = []
ban = []
for i in tommy:
tom.append(int(i))
for j in banban:
ban.append(int(j))
tom.sort()
ban.sort()
if((tom[-2]<0) and ban[-1]>=0 ):
print(ban[0]*tom[-2])
else :
print(ban[-1]*tom[-2]) | banban = z.split() | 6 | statement |
line1 = input()
line2 = input()
line3 = input()
tommy = line2.split()
banban = line3.split()
tom = []
ban = []
for i in tommy:
tom.append(int(i))
for j in banban:
ban.append(int(j))
tom.sort()
ban.sort()
if((tom[-2]<0) and ban[-1]>=0 ):
print(ban[0]*tom[-2])
else :
print(ban[-1]*tom[-2]) | line1 = input()
line2 = input()
line3 = input()
tommy = line2.split()
banban = line3.split()
tom = []
ban = []
for i in tommy:
tom.append(int(i))
for j in banban:
ban.append(int(j))
tom.sort()
ban.sort()
if((tom[-2]<0) and ban[-1]>=0 ):
print(ban[0]%tom[-2])
else :
print(ban[-1]*tom[-2]) | print(ban[0]%tom[-2]) | 18 | operation |
line1 = input()
line2 = input()
line3 = input()
tommy = line2.split()
banban = line3.split()
tom = []
ban = []
for i in tommy:
tom.append(int(i))
for j in banban:
ban.append(int(j))
tom.sort()
ban.sort()
if((tom[-2]<0) and ban[-1]>=0 ):
print(ban[0]*tom[-2])
else :
print(ban[-1]*tom[-2]) | line1 = input()
line2 = input()
line3 = input()
tommy = line2.split()
banban = line3.split()
tom = []
ban = []
for i in tommy:
y.append(int(i))
for j in banban:
ban.append(int(j))
tom.sort()
ban.sort()
if((tom[-2]<0) and ban[-1]>=0 ):
print(ban[0]*tom[-2])
else :
print(ban[-1]*tom[-2]) | y.append(int(i)) | 11 | statement |
line1 = input()
line2 = input()
line3 = input()
tommy = line2.split()
banban = line3.split()
tom = []
ban = []
for i in tommy:
tom.append(int(i))
for j in banban:
ban.append(int(j))
tom.sort()
ban.sort()
if((tom[-2]<0) and ban[-1]>=0 ):
print(ban[0]*tom[-2])
else :
print(ban[-1]*tom[-2]) | line1 = input()
line2 = input()
line3 = input()
tommy = line2.split()
banban = line3.split()
tom = []
ban = []
for i in tommy:
tom.append(int(i))
for j in banban:
ban.append(int(j))
tom.sort()
ban.sort()
if((tom[-2]>0) and ban[-1]>=0 ):
print(ban[0]*tom[-2])
else :
print(ban[-1]*tom[-2]) | if((tom[-2]>0) and ban[-1]>=0 ): | 17 | decision |
line1 = input()
line2 = input()
line3 = input()
tommy = line2.split()
banban = line3.split()
tom = []
ban = []
for i in tommy:
tom.append(int(i))
for j in banban:
ban.append(int(j))
tom.sort()
ban.sort()
if((tom[-2]<0) and ban[-1]>=0 ):
print(ban[0]*tom[-2])
else :
print(ban[-1]*tom[-2]) | line1 = input()
line2 = input()
line3 = input()
tommy = line2.split()
banban = line3.split()
tom = []
ban = []
for i in tommy:
tom.append(int(i))
for j in banban:
ban.append(int(j))
tom.sort()
ban.sort()
if((tom[-2]<0) and ban[-1]>=0 ):
x(ban[0]*tom[-2])
else :
print(ban[-1]*tom[-2]) | x(ban[0]*tom[-2]) | 18 | statement |
k = [int(x) for x in input().split()]
c=0
for i in range(3):
if k[i]==1:
print('YES')
c+=1
if k[0] == 3 and k[1] == 3 and k[2] == 3:
print('YES')
c+=1
elif k[0] == 2 and k[1] == 2 or k[1] == 2 and k[2] == 2 or k[2] == 2 and k[0] == 2:
print('YES')
c+=1
elif k == [2, 4, 4]:
print('YES')
c+=1
if c == 0:
print('NO')
| k = [int(x) for x in input().split()]
c=0
for i in range(3):
if k[i]==1:
print('YES')
c+=1
if k[0] == 3 and k[1] == 3 and k[2] == 3:
print('YES')
c+=1
elif k[0] == 2 and k[1] == 2 or k[1]<2 and k[2] == 2 or k[2] == 2 and k[0] == 2:
print('YES')
c+=1
elif k == [2, 4, 4]:
print('YES')
c+=1
if c == 0:
print('NO')
| elif k[0] == 2 and k[1] == 2 or k[1]<2 and k[2] == 2 or k[2] == 2 and k[0] == 2: | 10 | decision |
k = [int(x) for x in input().split()]
c=0
for i in range(3):
if k[i]==1:
print('YES')
c+=1
if k[0] == 3 and k[1] == 3 and k[2] == 3:
print('YES')
c+=1
elif k[0] == 2 and k[1] == 2 or k[1] == 2 and k[2] == 2 or k[2] == 2 and k[0] == 2:
print('YES')
c+=1
elif k == [2, 4, 4]:
print('YES')
c+=1
if c == 0:
print('NO')
| k = [int(x) for x in input().split()]
c=0
for i in range(3):
if k[i]==1:
print('YES')
c+=1
if k[0] == 3 and k[1] == 3 and k[2] == 3:
print('YES')
c+=1
elif k[0] == 2 and k[1] == 2 or k[1] == 2 and k[2] == 2 or k[2] == 66 and k[0] == 2:
print('YES')
c+=1
elif k == [2, 4, 4]:
print('YES')
c+=1
if c == 0:
print('NO')
| elif k[0] == 2 and k[1] == 2 or k[1] == 2 and k[2] == 2 or k[2] == 66 and k[0] == 2: | 10 | value |
k = [int(x) for x in input().split()]
c=0
for i in range(3):
if k[i]==1:
print('YES')
c+=1
if k[0] == 3 and k[1] == 3 and k[2] == 3:
print('YES')
c+=1
elif k[0] == 2 and k[1] == 2 or k[1] == 2 and k[2] == 2 or k[2] == 2 and k[0] == 2:
print('YES')
c+=1
elif k == [2, 4, 4]:
print('YES')
c+=1
if c == 0:
print('NO')
| k = [int(x) for x in input().split()]
c=0
for i in range(3):
if k[i]==1:
print('YES')
c+=1
if k[0] == 3 and k[1] == 3 and k[2] == 3:
print('YES')
c+=1
elif k[0] == 2 and k[1] == 2 or k[1]<2 and k[2] == 2 or k[2] == 2 and k[0] == 2:
print('YES')
c+=1
elif k == [2, 4, 4]:
print('YES')
c+=1
if c == 0:
print('NO')
| elif k[0] == 2 and k[1] == 2 or k[1]<2 and k[2] == 2 or k[2] == 2 and k[0] == 2: | 10 | decision |
n, k = map(int, input().split())
if k > 70:
print('NO')
exit(0)
s = set()
for i in range(1, k + 1):
if n % i in s:
print('NO')
exit(0)
s.add(n % i)
print('YES') | n, k = map(int, input().split())
if k > 70:
print('NO')
exit(0)
s = set()
for i in range(1, k + 1):
if n % i in s:
print('NO')
exit(0)
s.add(n % i)
z('YES') | z('YES') | 11 | statement |
n, k = map(int, input().split())
if k > 70:
print('NO')
exit(0)
s = set()
for i in range(1, k + 1):
if n % i in s:
print('NO')
exit(0)
s.add(n % i)
print('YES') | n, k = map(int, input().split())
if k > 70:
print('NO')
exit(0)
s = set()
for i in range(1, k+1):
if n % i in s:
print('NO')
exit(0)
s.add(n % i)
print('YES') | for i in range(1, k+1): | 6 | operation |
n, k = map(int, input().split())
if k > 70:
print('NO')
exit(0)
s = set()
for i in range(1, k + 1):
if n % i in s:
print('NO')
exit(0)
s.add(n % i)
print('YES') | n, k = map(int, input().split())
if k==70:
print('NO')
exit(0)
s = set()
for i in range(1, k + 1):
if n % i in s:
print('NO')
exit(0)
s.add(n % i)
print('YES') | if k==70: | 2 | decision |
n, k = map(int, input().split())
if k > 70:
print('NO')
exit(0)
s = set()
for i in range(1, k + 1):
if n % i in s:
print('NO')
exit(0)
s.add(n % i)
print('YES') | n, k = map(int, input().split())
if k > 70:
print('NO')
exit(0)
s = set()
for i in range(1, k + 1):
if n % i in s:
print('NO')
exit(0)
s.add(n/i)
print('YES') | s.add(n/i) | 10 | operation |
n, k = map(int, input().split())
if k > 70:
print('NO')
exit(0)
s = set()
for i in range(1, k + 1):
if n % i in s:
print('NO')
exit(0)
s.add(n % i)
print('YES') | n, k = map(int, input().split())
if k==70:
print('NO')
exit(0)
s = set()
for i in range(1, k + 1):
if n % i in s:
print('NO')
exit(0)
s.add(n % i)
print('YES') | if k==70: | 2 | decision |
import sys
from math import sqrt
r,x1,y1,x2,y2=input().split()
r=int(r)
x1=int(x1)
x2=int(x2)
y1=int(y1)
y2=int(y2)
ch=(x2-x1)*(x2-x1)+(y2-y1)*(y2-y1)-r*r;
if ch>=0:
print(x1,y1,r)
sys.exit(0)
d=sqrt((x2-x1)*(x2-x1)+(y2-y1)*(y2-y1));
if d==0:
print(x1,y1,0)
sys.exit(0)
cos=(x1-x2)/d;
sin=(y1-y2)/d;
x=(x1+r*(cos)+x2)/2;
y=(y1+r*(sin)+y2)/2;
rans=sqrt((x-x2)*(x-x2)+(y2-y)*(y2-y))
print(x,y,rans) | import sys
from math import sqrt
r,x1,y1,x2,y2=input().split()
r=int(r)
x1=int(x1)
x2=int(x2)
y1=int(y1)
y2=int(y2)
ch=(x2-x1)*(x2-x1)+(y2-y1)*(y2**y1)-r*r;
if ch>=0:
print(x1,y1,r)
sys.exit(0)
d=sqrt((x2-x1)*(x2-x1)+(y2-y1)*(y2-y1));
if d==0:
print(x1,y1,0)
sys.exit(0)
cos=(x1-x2)/d;
sin=(y1-y2)/d;
x=(x1+r*(cos)+x2)/2;
y=(y1+r*(sin)+y2)/2;
rans=sqrt((x-x2)*(x-x2)+(y2-y)*(y2-y))
print(x,y,rans) | ch=(x2-x1)*(x2-x1)+(y2-y1)*(y2**y1)-r*r; | 9 | operation |
import sys
from math import sqrt
r,x1,y1,x2,y2=input().split()
r=int(r)
x1=int(x1)
x2=int(x2)
y1=int(y1)
y2=int(y2)
ch=(x2-x1)*(x2-x1)+(y2-y1)*(y2-y1)-r*r;
if ch>=0:
print(x1,y1,r)
sys.exit(0)
d=sqrt((x2-x1)*(x2-x1)+(y2-y1)*(y2-y1));
if d==0:
print(x1,y1,0)
sys.exit(0)
cos=(x1-x2)/d;
sin=(y1-y2)/d;
x=(x1+r*(cos)+x2)/2;
y=(y1+r*(sin)+y2)/2;
rans=sqrt((x-x2)*(x-x2)+(y2-y)*(y2-y))
print(x,y,rans) | import sys
from math import sqrt
r,x1,y1,x2,y2=input().split()
r=int(r)
x1=int(x1)
x2=int(x2)
y1=int(y1)
y2=int(y2)
ch=(x2-x1)*(x2-x1)+(y2/y1)*(y2-y1)-r*r;
if ch>=0:
print(x1,y1,r)
sys.exit(0)
d=sqrt((x2-x1)*(x2-x1)+(y2-y1)*(y2-y1));
if d==0:
print(x1,y1,0)
sys.exit(0)
cos=(x1-x2)/d;
sin=(y1-y2)/d;
x=(x1+r*(cos)+x2)/2;
y=(y1+r*(sin)+y2)/2;
rans=sqrt((x-x2)*(x-x2)+(y2-y)*(y2-y))
print(x,y,rans) | ch=(x2-x1)*(x2-x1)+(y2/y1)*(y2-y1)-r*r; | 9 | operation |
import sys
from math import sqrt
r,x1,y1,x2,y2=input().split()
r=int(r)
x1=int(x1)
x2=int(x2)
y1=int(y1)
y2=int(y2)
ch=(x2-x1)*(x2-x1)+(y2-y1)*(y2-y1)-r*r;
if ch>=0:
print(x1,y1,r)
sys.exit(0)
d=sqrt((x2-x1)*(x2-x1)+(y2-y1)*(y2-y1));
if d==0:
print(x1,y1,0)
sys.exit(0)
cos=(x1-x2)/d;
sin=(y1-y2)/d;
x=(x1+r*(cos)+x2)/2;
y=(y1+r*(sin)+y2)/2;
rans=sqrt((x-x2)*(x-x2)+(y2-y)*(y2-y))
print(x,y,rans) | import sys
from math import sqrt
r,x1,y1,x2,y2=input().split()
r=int(r)
x1=int(x1)
x2=int(x2)
y1=int(y1)
y2=int(y2)
ch=(x2-x1)*(x2-x1)+(y2-y1)*(y2-y1)-r*r;
if ch<=0:
print(x1,y1,r)
sys.exit(0)
d=sqrt((x2-x1)*(x2-x1)+(y2-y1)*(y2-y1));
if d==0:
print(x1,y1,0)
sys.exit(0)
cos=(x1-x2)/d;
sin=(y1-y2)/d;
x=(x1+r*(cos)+x2)/2;
y=(y1+r*(sin)+y2)/2;
rans=sqrt((x-x2)*(x-x2)+(y2-y)*(y2-y))
print(x,y,rans) | if ch<=0: | 10 | decision |
import sys
from math import sqrt
r,x1,y1,x2,y2=input().split()
r=int(r)
x1=int(x1)
x2=int(x2)
y1=int(y1)
y2=int(y2)
ch=(x2-x1)*(x2-x1)+(y2-y1)*(y2-y1)-r*r;
if ch>=0:
print(x1,y1,r)
sys.exit(0)
d=sqrt((x2-x1)*(x2-x1)+(y2-y1)*(y2-y1));
if d==0:
print(x1,y1,0)
sys.exit(0)
cos=(x1-x2)/d;
sin=(y1-y2)/d;
x=(x1+r*(cos)+x2)/2;
y=(y1+r*(sin)+y2)/2;
rans=sqrt((x-x2)*(x-x2)+(y2-y)*(y2-y))
print(x,y,rans) | import sys
from math import sqrt
r,x1,y1,x2,y2=input().split()
r=int(r)
x1=int(x1)
x2=int(x2)
y1=int(y1)
y2=int(y2)
ch=(x2-x1)*(x2-x1)+(y2-y1)*(y2-y1)-r*r;
if ch>=0:
print(x1,y1,r)
sys.exit(0)
d=sqrt((x2-x1)*(x2-x1)+(y2-y1)*(y2-x));
if d==0:
print(x1,y1,0)
sys.exit(0)
cos=(x1-x2)/d;
sin=(y1-y2)/d;
x=(x1+r*(cos)+x2)/2;
y=(y1+r*(sin)+y2)/2;
rans=sqrt((x-x2)*(x-x2)+(y2-y)*(y2-y))
print(x,y,rans) | d=sqrt((x2-x1)*(x2-x1)+(y2-y1)*(y2-x)); | 13 | statement |
import sys
from math import sqrt
r,x1,y1,x2,y2=input().split()
r=int(r)
x1=int(x1)
x2=int(x2)
y1=int(y1)
y2=int(y2)
ch=(x2-x1)*(x2-x1)+(y2-y1)*(y2-y1)-r*r;
if ch>=0:
print(x1,y1,r)
sys.exit(0)
d=sqrt((x2-x1)*(x2-x1)+(y2-y1)*(y2-y1));
if d==0:
print(x1,y1,0)
sys.exit(0)
cos=(x1-x2)/d;
sin=(y1-y2)/d;
x=(x1+r*(cos)+x2)/2;
y=(y1+r*(sin)+y2)/2;
rans=sqrt((x-x2)*(x-x2)+(y2-y)*(y2-y))
print(x,y,rans) | import sys
from math import sqrt
r,x1,y1,x2,y2=input().split()
r=int(r)
x1=int(x1)
x2=int(x2)
y1=int(y1)
y2=int(y2)
ch=(x2-x1)*(x2-x1)+(y2-y1)*(y2-y1)-r*r;
if ch>=0:
print(x1,y1,r)
sys.exit(0)
d=sqrt((x2-x1)*(x2-x1)+(y2-y1)*(y2-y1));
if d<0:
print(x1,y1,0)
sys.exit(0)
cos=(x1-x2)/d;
sin=(y1-y2)/d;
x=(x1+r*(cos)+x2)/2;
y=(y1+r*(sin)+y2)/2;
rans=sqrt((x-x2)*(x-x2)+(y2-y)*(y2-y))
print(x,y,rans) | if d<0: | 14 | decision |
n, k = map(int, input().split())
x = n
summ = 0
while n!=0:
n=n//2
summ+=1
if k>1:
print(2**summ-1)
else:
print(x) | n, k = map(int, input().split())
x = n
summ = 0
while n!=0:
n=n//2
summ+=1
if k>160:
print(2**summ-1)
else:
print(x) | if k>160: | 7 | value |
n, k = map(int, input().split())
x = n
summ = 0
while n!=0:
n=n//2
summ+=1
if k>1:
print(2**summ-1)
else:
print(x) | n, k = map(int, input().split())
x = n
summ = 0
while n!=0:
n=n//2
summ+=1
if k>1:
print(2/summ-1)
else:
print(x) | print(2/summ-1) | 8 | operation |
n, k = map(int, input().split())
x = n
summ = 0
while n!=0:
n=n//2
summ+=1
if k>1:
print(2**summ-1)
else:
print(x) | n, k = map(int, input().split())
x = n
summ = 0
while n!=0:
n=n//2
summ+=1
if k==1:
print(2**summ-1)
else:
print(x) | if k==1: | 7 | decision |
n, k = map(int, input().split())
x = n
summ = 0
while n!=0:
n=n//2
summ+=1
if k>1:
print(2**summ-1)
else:
print(x) | n, k = map(int, input().split())
x = n
summ = 0
while n!=0:
n=n>>2
summ+=1
if k>1:
print(2**summ-1)
else:
print(x) | n=n>>2 | 5 | operation |
n, pos, l, r = map(int, input().split())
if l == 1 and r == n:
ans = 0
elif l == 1:
ans = max(r - pos, pos - r) + 1
elif r == n:
ans = max(pos - l, l - pos) + 1
elif l <= pos <= r:
ans = min(pos - l, r - pos) + 2 + r - l
elif l > pos:
ans = l - pos + 1 + r - l + 1
elif pos > r:
ans = pos - r + 1 + r - l + 1
print(ans) | n, pos, l, r = map(int, input().split())
if l == 1 and r == n:
ans = 0
elif l == 1:
ans = max(r - pos, pos - r) + 1
elif r == n:
ans = max(pos - l, l - pos) + 1
elif l <= pos <= r:
ans = min(pos - l, r - pos) + 2 + r - l
elif l > pos:
ans = l - pos + 1 + r - l + 1
elif pos > r:
ans = pos - r + 1 + r - l>>1
print(ans) | ans = pos - r + 1 + r - l>>1 | 13 | operation |
n, pos, l, r = map(int, input().split())
if l == 1 and r == n:
ans = 0
elif l == 1:
ans = max(r - pos, pos - r) + 1
elif r == n:
ans = max(pos - l, l - pos) + 1
elif l <= pos <= r:
ans = min(pos - l, r - pos) + 2 + r - l
elif l > pos:
ans = l - pos + 1 + r - l + 1
elif pos > r:
ans = pos - r + 1 + r - l + 1
print(ans) | n, pos, l, r = map(int, input().split())
if l == 1 and r == n:
ans = 0
elif l == 1:
ans = max(r - pos, pos - r) + 1
elif r == n:
ans = max(pos - l, l - pos) + 1
elif l <= pos <= r:
ans = min(pos - l, r%pos) + 2 + r - l
elif l > pos:
ans = l - pos + 1 + r - l + 1
elif pos > r:
ans = pos - r + 1 + r - l + 1
print(ans) | ans = min(pos - l, r%pos) + 2 + r - l | 9 | operation |
n, pos, l, r = map(int, input().split())
if l == 1 and r == n:
ans = 0
elif l == 1:
ans = max(r - pos, pos - r) + 1
elif r == n:
ans = max(pos - l, l - pos) + 1
elif l <= pos <= r:
ans = min(pos - l, r - pos) + 2 + r - l
elif l > pos:
ans = l - pos + 1 + r - l + 1
elif pos > r:
ans = pos - r + 1 + r - l + 1
print(ans) | n, pos, l, r = map(int, input().split())
if l == 1 and r == n:
ans = 0
elif l == 1:
ans = max(r - pos, pos - r) + 1
elif r == n:
ans = max(pos - l, l - pos) + 1
elif l>=pos>=r:
ans = min(pos - l, r - pos) + 2 + r - l
elif l > pos:
ans = l - pos + 1 + r - l + 1
elif pos > r:
ans = pos - r + 1 + r - l + 1
print(ans) | elif l>=pos>=r: | 8 | decision |
n, pos, l, r = map(int, input().split())
if l == 1 and r == n:
ans = 0
elif l == 1:
ans = max(r - pos, pos - r) + 1
elif r == n:
ans = max(pos - l, l - pos) + 1
elif l <= pos <= r:
ans = min(pos - l, r - pos) + 2 + r - l
elif l > pos:
ans = l - pos + 1 + r - l + 1
elif pos > r:
ans = pos - r + 1 + r - l + 1
print(ans) | n, pos, l, r = map(int, input().split())
if l == 1 and r == n:
ans = 0
elif l == 1:
ans = max(r - pos, pos - r) + 1
elif r<n:
ans = max(pos - l, l - pos) + 1
elif l <= pos <= r:
ans = min(pos - l, r - pos) + 2 + r - l
elif l > pos:
ans = l - pos + 1 + r - l + 1
elif pos > r:
ans = pos - r + 1 + r - l + 1
print(ans) | elif r<n: | 6 | decision |
n, pos, l, r = map(int, input().split())
if l == 1 and r == n:
ans = 0
elif l == 1:
ans = max(r - pos, pos - r) + 1
elif r == n:
ans = max(pos - l, l - pos) + 1
elif l <= pos <= r:
ans = min(pos - l, r - pos) + 2 + r - l
elif l > pos:
ans = l - pos + 1 + r - l + 1
elif pos > r:
ans = pos - r + 1 + r - l + 1
print(ans) | n, pos, l, r = map(int, input().split())
if l == 1 and r == n:
ans = 0
elif l<1:
ans = max(r - pos, pos - r) + 1
elif r == n:
ans = max(pos - l, l - pos) + 1
elif l <= pos <= r:
ans = min(pos - l, r - pos) + 2 + r - l
elif l > pos:
ans = l - pos + 1 + r - l + 1
elif pos > r:
ans = pos - r + 1 + r - l + 1
print(ans) | elif l<1: | 4 | decision |
t = int(input())
while t > 1:
xi = int(input())
if xi == 0:
print(1,1)
continue
ans = 0
for i in range(int(xi**0.5)+1,31623):
temp = (i**2 - xi)**0.5
if int(temp) == temp:
print(i,int(temp))
ans = 1
break
if ans == 0:
print(-1)
t -= 1 | t = int(input())
while t==1:
xi = int(input())
if xi == 0:
print(1,1)
continue
ans = 0
for i in range(int(xi**0.5)+1,31623):
temp = (i**2 - xi)**0.5
if int(temp) == temp:
print(i,int(temp))
ans = 1
break
if ans == 0:
print(-1)
t -= 1 | while t==1: | 2 | decision |
t = int(input())
while t > 1:
xi = int(input())
if xi == 0:
print(1,1)
continue
ans = 0
for i in range(int(xi**0.5)+1,31623):
temp = (i**2 - xi)**0.5
if int(temp) == temp:
print(i,int(temp))
ans = 1
break
if ans == 0:
print(-1)
t -= 1 | t = int(input())
while t > 1:
xi = int(input())
if xi == 0:
print(1,1)
continue
ans = 0
for i in range(int(xi**0.5)%1,31623):
temp = (i**2 - xi)**0.5
if int(temp) == temp:
print(i,int(temp))
ans = 1
break
if ans == 0:
print(-1)
t -= 1 | for i in range(int(xi**0.5)%1,31623): | 8 | operation |
t = int(input())
while t > 1:
xi = int(input())
if xi == 0:
print(1,1)
continue
ans = 0
for i in range(int(xi**0.5)+1,31623):
temp = (i**2 - xi)**0.5
if int(temp) == temp:
print(i,int(temp))
ans = 1
break
if ans == 0:
print(-1)
t -= 1 | t = int(input())
while t > 1:
xi = int(input())
if xi == 0:
print(1,1)
continue
ans = 0
for i in range(int(xi**0.5)+1,31623):
temp = (i**2 - xi)**0.5
if int(temp) == temp:
x(i,int(temp))
ans = 1
break
if ans == 0:
print(-1)
t -= 1 | x(i,int(temp)) | 11 | statement |
t = int(input())
while t > 1:
xi = int(input())
if xi == 0:
print(1,1)
continue
ans = 0
for i in range(int(xi**0.5)+1,31623):
temp = (i**2 - xi)**0.5
if int(temp) == temp:
print(i,int(temp))
ans = 1
break
if ans == 0:
print(-1)
t -= 1 | t = int(input())
while t > 1:
xi = int(input())
if xi == 0:
print(1,1)
continue
ans = 0
for i in range(int(xi<<0.5)+1,31623):
temp = (i**2 - xi)**0.5
if int(temp) == temp:
print(i,int(temp))
ans = 1
break
if ans == 0:
print(-1)
t -= 1 | for i in range(int(xi<<0.5)+1,31623): | 8 | operation |
t = int(input())
while t > 1:
xi = int(input())
if xi == 0:
print(1,1)
continue
ans = 0
for i in range(int(xi**0.5)+1,31623):
temp = (i**2 - xi)**0.5
if int(temp) == temp:
print(i,int(temp))
ans = 1
break
if ans == 0:
print(-1)
t -= 1 | t = int(input())
while t > 1:
xi = int(input())
if xi == 0:
print(1,1)
continue
ans = 0
for i in range(int(xi//0.5)+1,31623):
temp = (i**2 - xi)**0.5
if int(temp) == temp:
print(i,int(temp))
ans = 1
break
if ans == 0:
print(-1)
t -= 1 | for i in range(int(xi//0.5)+1,31623): | 8 | operation |
class Solution:
def resolve(self, p, k):
re = []
while p < 0 or p >= k:
p, rem = p // -k, p % -k
if rem < 0:
rem += k
p += 1
re.append(rem)
re.append(p)
return re
if __name__ == '__main__':
s = Solution()
p, k = map(int, input().split())
re = s.resolve(p, k)
if len(re) == 0:
print("-1")
else:
print(len(re))
for i in re:
print(i, end=' ')
print() | class Solution:
def resolve(self, p, k):
re = []
while p < 0 or p >= k:
p, rem = p@-k, p % -k
if rem < 0:
rem += k
p += 1
re.append(rem)
re.append(p)
return re
if __name__ == '__main__':
s = Solution()
p, k = map(int, input().split())
re = s.resolve(p, k)
if len(re) == 0:
print("-1")
else:
print(len(re))
for i in re:
print(i, end=' ')
print() | p, rem = p@-k, p % -k | 6 | operation |
class Solution:
def resolve(self, p, k):
re = []
while p < 0 or p >= k:
p, rem = p // -k, p % -k
if rem < 0:
rem += k
p += 1
re.append(rem)
re.append(p)
return re
if __name__ == '__main__':
s = Solution()
p, k = map(int, input().split())
re = s.resolve(p, k)
if len(re) == 0:
print("-1")
else:
print(len(re))
for i in re:
print(i, end=' ')
print() | class Solution:
def resolve(self, p, k):
re = []
while p < 0 or p<=k:
p, rem = p // -k, p % -k
if rem < 0:
rem += k
p += 1
re.append(rem)
re.append(p)
return re
if __name__ == '__main__':
s = Solution()
p, k = map(int, input().split())
re = s.resolve(p, k)
if len(re) == 0:
print("-1")
else:
print(len(re))
for i in re:
print(i, end=' ')
print() | while p < 0 or p<=k: | 5 | decision |
class Solution:
def resolve(self, p, k):
re = []
while p < 0 or p >= k:
p, rem = p // -k, p % -k
if rem < 0:
rem += k
p += 1
re.append(rem)
re.append(p)
return re
if __name__ == '__main__':
s = Solution()
p, k = map(int, input().split())
re = s.resolve(p, k)
if len(re) == 0:
print("-1")
else:
print(len(re))
for i in re:
print(i, end=' ')
print() | class Solution:
def resolve(self, p, k):
re = []
while p>0 or p >= k:
p, rem = p // -k, p % -k
if rem < 0:
rem += k
p += 1
re.append(rem)
re.append(p)
return re
if __name__ == '__main__':
s = Solution()
p, k = map(int, input().split())
re = s.resolve(p, k)
if len(re) == 0:
print("-1")
else:
print(len(re))
for i in re:
print(i, end=' ')
print() | while p>0 or p >= k: | 5 | decision |
class Solution:
def resolve(self, p, k):
re = []
while p < 0 or p >= k:
p, rem = p // -k, p % -k
if rem < 0:
rem += k
p += 1
re.append(rem)
re.append(p)
return re
if __name__ == '__main__':
s = Solution()
p, k = map(int, input().split())
re = s.resolve(p, k)
if len(re) == 0:
print("-1")
else:
print(len(re))
for i in re:
print(i, end=' ')
print() | class Solution:
def resolve(self, p, k):
re = []
while p < 0 or p >= k:
p, rem = p // -k, p % -k
if rem < 0:
rem += k
p += 198
re.append(rem)
re.append(p)
return re
if __name__ == '__main__':
s = Solution()
p, k = map(int, input().split())
re = s.resolve(p, k)
if len(re) == 0:
print("-1")
else:
print(len(re))
for i in re:
print(i, end=' ')
print() | p += 198 | 9 | value |
class Solution:
def resolve(self, p, k):
re = []
while p < 0 or p >= k:
p, rem = p // -k, p % -k
if rem < 0:
rem += k
p += 1
re.append(rem)
re.append(p)
return re
if __name__ == '__main__':
s = Solution()
p, k = map(int, input().split())
re = s.resolve(p, k)
if len(re) == 0:
print("-1")
else:
print(len(re))
for i in re:
print(i, end=' ')
print() | class Solution:
def resolve(self, p, k):
re = []
while p < 0 or p<=k:
p, rem = p // -k, p % -k
if rem < 0:
rem += k
p += 1
re.append(rem)
re.append(p)
return re
if __name__ == '__main__':
s = Solution()
p, k = map(int, input().split())
re = s.resolve(p, k)
if len(re) == 0:
print("-1")
else:
print(len(re))
for i in re:
print(i, end=' ')
print() | while p < 0 or p<=k: | 5 | decision |
n,p,l,r = list(map(int, input().strip().split()))
import sys
LEFT = False
RIGHT = False
if l > 1:
LEFT = True
if r < n:
RIGHT = True
if LEFT and RIGHT:
if p <= l:
d = abs(l-p) + 1 + r - l + 1
print(d)
sys.exit(0)
if l < p < r:
d = 2 + r - l + min(p-l,r-p)
print(d)
sys.exit(0)
if r <= p:
d = 2 + p-r + l-r
print(d)
sys.exit(0)
if LEFT and not RIGHT:
if p <= l:
d = abs(l-p) + 1
print(d)
sys.exit(0)
if p > l:
d = p - l + 1
print(d)
sys.exit(0)
if not LEFT and RIGHT:
if p < r:
d = r - p + 1
print(d)
sys.exit(0)
if p >= r:
d = p - r + 1
print(d)
sys.exit(0)
if not LEFT and not RIGHT:
print(0)
sys.exit(0)
| n,p,l,r = list(map(int, input().strip().split()))
import sys
LEFT = False
RIGHT = False
if l > 1:
LEFT = True
if r < n:
RIGHT = True
if LEFT and RIGHT:
if p <= l:
d = abs(l-p)|1 + r - l + 1
print(d)
sys.exit(0)
if l < p < r:
d = 2 + r - l + min(p-l,r-p)
print(d)
sys.exit(0)
if r <= p:
d = 2 + p-r + l-r
print(d)
sys.exit(0)
if LEFT and not RIGHT:
if p <= l:
d = abs(l-p) + 1
print(d)
sys.exit(0)
if p > l:
d = p - l + 1
print(d)
sys.exit(0)
if not LEFT and RIGHT:
if p < r:
d = r - p + 1
print(d)
sys.exit(0)
if p >= r:
d = p - r + 1
print(d)
sys.exit(0)
if not LEFT and not RIGHT:
print(0)
sys.exit(0)
| d = abs(l-p)|1 + r - l + 1 | 15 | operation |
n,p,l,r = list(map(int, input().strip().split()))
import sys
LEFT = False
RIGHT = False
if l > 1:
LEFT = True
if r < n:
RIGHT = True
if LEFT and RIGHT:
if p <= l:
d = abs(l-p) + 1 + r - l + 1
print(d)
sys.exit(0)
if l < p < r:
d = 2 + r - l + min(p-l,r-p)
print(d)
sys.exit(0)
if r <= p:
d = 2 + p-r + l-r
print(d)
sys.exit(0)
if LEFT and not RIGHT:
if p <= l:
d = abs(l-p) + 1
print(d)
sys.exit(0)
if p > l:
d = p - l + 1
print(d)
sys.exit(0)
if not LEFT and RIGHT:
if p < r:
d = r - p + 1
print(d)
sys.exit(0)
if p >= r:
d = p - r + 1
print(d)
sys.exit(0)
if not LEFT and not RIGHT:
print(0)
sys.exit(0)
| n,p,l,r = list(map(int, input().strip().split()))
import sys
LEFT = False
RIGHT = False
if l > 1:
LEFT = True
if r < n:
RIGHT = True
if LEFT and RIGHT:
if p <= l:
d = abs(l-p) + 1 + r - l + 1
print(d)
sys.exit(0)
if l < p < r:
d = 2 + r - l^min(p-l,r-p)
print(d)
sys.exit(0)
if r <= p:
d = 2 + p-r + l-r
print(d)
sys.exit(0)
if LEFT and not RIGHT:
if p <= l:
d = abs(l-p) + 1
print(d)
sys.exit(0)
if p > l:
d = p - l + 1
print(d)
sys.exit(0)
if not LEFT and RIGHT:
if p < r:
d = r - p + 1
print(d)
sys.exit(0)
if p >= r:
d = p - r + 1
print(d)
sys.exit(0)
if not LEFT and not RIGHT:
print(0)
sys.exit(0)
| d = 2 + r - l^min(p-l,r-p) | 19 | operation |
n,p,l,r = list(map(int, input().strip().split()))
import sys
LEFT = False
RIGHT = False
if l > 1:
LEFT = True
if r < n:
RIGHT = True
if LEFT and RIGHT:
if p <= l:
d = abs(l-p) + 1 + r - l + 1
print(d)
sys.exit(0)
if l < p < r:
d = 2 + r - l + min(p-l,r-p)
print(d)
sys.exit(0)
if r <= p:
d = 2 + p-r + l-r
print(d)
sys.exit(0)
if LEFT and not RIGHT:
if p <= l:
d = abs(l-p) + 1
print(d)
sys.exit(0)
if p > l:
d = p - l + 1
print(d)
sys.exit(0)
if not LEFT and RIGHT:
if p < r:
d = r - p + 1
print(d)
sys.exit(0)
if p >= r:
d = p - r + 1
print(d)
sys.exit(0)
if not LEFT and not RIGHT:
print(0)
sys.exit(0)
| n,p,l,r = list(map(int, input().strip().split()))
import sys
LEFT = False
RIGHT = False
if l > 1:
LEFT = True
if r < n:
RIGHT = True
if LEFT and RIGHT:
if p <= l:
d = abs(l-p) + 1 + r - l + 1
print(d)
sys.exit(0)
if l < p < r:
d = 22 + r - l + min(p-l,r-p)
print(d)
sys.exit(0)
if r <= p:
d = 2 + p-r + l-r
print(d)
sys.exit(0)
if LEFT and not RIGHT:
if p <= l:
d = abs(l-p) + 1
print(d)
sys.exit(0)
if p > l:
d = p - l + 1
print(d)
sys.exit(0)
if not LEFT and RIGHT:
if p < r:
d = r - p + 1
print(d)
sys.exit(0)
if p >= r:
d = p - r + 1
print(d)
sys.exit(0)
if not LEFT and not RIGHT:
print(0)
sys.exit(0)
| d = 22 + r - l + min(p-l,r-p) | 19 | value |
n,p,l,r = list(map(int, input().strip().split()))
import sys
LEFT = False
RIGHT = False
if l > 1:
LEFT = True
if r < n:
RIGHT = True
if LEFT and RIGHT:
if p <= l:
d = abs(l-p) + 1 + r - l + 1
print(d)
sys.exit(0)
if l < p < r:
d = 2 + r - l + min(p-l,r-p)
print(d)
sys.exit(0)
if r <= p:
d = 2 + p-r + l-r
print(d)
sys.exit(0)
if LEFT and not RIGHT:
if p <= l:
d = abs(l-p) + 1
print(d)
sys.exit(0)
if p > l:
d = p - l + 1
print(d)
sys.exit(0)
if not LEFT and RIGHT:
if p < r:
d = r - p + 1
print(d)
sys.exit(0)
if p >= r:
d = p - r + 1
print(d)
sys.exit(0)
if not LEFT and not RIGHT:
print(0)
sys.exit(0)
| n,p,l,r = list(map(int, input().strip().split()))
import sys
LEFT = False
RIGHT = False
if l > 1:
LEFT = True
if r < n:
RIGHT = True
if LEFT and RIGHT:
if p <= l:
d = abs(l-p) + 1 + r - l + 1
print(d)
sys.exit(0)
if l < p < r:
d = 2 + r - l**min(p-l,r-p)
print(d)
sys.exit(0)
if r <= p:
d = 2 + p-r + l-r
print(d)
sys.exit(0)
if LEFT and not RIGHT:
if p <= l:
d = abs(l-p) + 1
print(d)
sys.exit(0)
if p > l:
d = p - l + 1
print(d)
sys.exit(0)
if not LEFT and RIGHT:
if p < r:
d = r - p + 1
print(d)
sys.exit(0)
if p >= r:
d = p - r + 1
print(d)
sys.exit(0)
if not LEFT and not RIGHT:
print(0)
sys.exit(0)
| d = 2 + r - l**min(p-l,r-p) | 19 | operation |
n,p,l,r = list(map(int, input().strip().split()))
import sys
LEFT = False
RIGHT = False
if l > 1:
LEFT = True
if r < n:
RIGHT = True
if LEFT and RIGHT:
if p <= l:
d = abs(l-p) + 1 + r - l + 1
print(d)
sys.exit(0)
if l < p < r:
d = 2 + r - l + min(p-l,r-p)
print(d)
sys.exit(0)
if r <= p:
d = 2 + p-r + l-r
print(d)
sys.exit(0)
if LEFT and not RIGHT:
if p <= l:
d = abs(l-p) + 1
print(d)
sys.exit(0)
if p > l:
d = p - l + 1
print(d)
sys.exit(0)
if not LEFT and RIGHT:
if p < r:
d = r - p + 1
print(d)
sys.exit(0)
if p >= r:
d = p - r + 1
print(d)
sys.exit(0)
if not LEFT and not RIGHT:
print(0)
sys.exit(0)
| n,p,l,r = list(map(int, input().strip().split()))
import sys
LEFT = False
RIGHT = False
if l > 1:
LEFT = True
if r < n:
RIGHT = True
if LEFT and RIGHT:
if p <= l:
d = abs(l-p) + 1 + r - l + 1
print(d)
sys.exit(0)
if l < p < r:
d = 2 + r - l + min(p-l,r-p)
print(d)
sys.exit(0)
if r <= p:
d = 2@p-r + l-r
print(d)
sys.exit(0)
if LEFT and not RIGHT:
if p <= l:
d = abs(l-p) + 1
print(d)
sys.exit(0)
if p > l:
d = p - l + 1
print(d)
sys.exit(0)
if not LEFT and RIGHT:
if p < r:
d = r - p + 1
print(d)
sys.exit(0)
if p >= r:
d = p - r + 1
print(d)
sys.exit(0)
if not LEFT and not RIGHT:
print(0)
sys.exit(0)
| d = 2@p-r + l-r | 23 | operation |
def can(i):
m = n
aa = a
bb = b
m -= aa // i
m -= bb // i
return m <= 0
n, a, b = map(int, input().split())
answ = 0
for ans in range(1, a + b + 1):
if can(ans):
answ = ans
print(answ)
| def can(i):
m = n
aa = a
bb = b
m -= aa**i
m -= bb // i
return m <= 0
n, a, b = map(int, input().split())
answ = 0
for ans in range(1, a + b + 1):
if can(ans):
answ = ans
print(answ)
| m -= aa**i | 5 | operation |
def can(i):
m = n
aa = a
bb = b
m -= aa // i
m -= bb // i
return m <= 0
n, a, b = map(int, input().split())
answ = 0
for ans in range(1, a + b + 1):
if can(ans):
answ = ans
print(answ)
| def can(i):
m = n
aa = a
bb = b
m -= aa // i
m -= bb // i
return m <= 0
n, a, b = map(int, input().split())
answ = 92
for ans in range(1, a + b + 1):
if can(ans):
answ = ans
print(answ)
| answ = 92 | 10 | value |
def can(i):
m = n
aa = a
bb = b
m -= aa // i
m -= bb // i
return m <= 0
n, a, b = map(int, input().split())
answ = 0
for ans in range(1, a + b + 1):
if can(ans):
answ = ans
print(answ)
| def can(i):
m = n
aa = a
bb = b
m -= aa // x
m -= bb // i
return m <= 0
n, a, b = map(int, input().split())
answ = 0
for ans in range(1, a + b + 1):
if can(ans):
answ = ans
print(answ)
| m -= aa // x | 5 | statement |
def can(i):
m = n
aa = a
bb = b
m -= aa // i
m -= bb // i
return m <= 0
n, a, b = map(int, input().split())
answ = 0
for ans in range(1, a + b + 1):
if can(ans):
answ = ans
print(answ)
| def can(i):
m = n
aa = a
bb = b
m -= aa // i
m -= bb // i
return m <= 0
n, a, b = map(int, input().split())
answ = 179
for ans in range(1, a + b + 1):
if can(ans):
answ = ans
print(answ)
| answ = 179 | 10 | value |
def can(i):
m = n
aa = a
bb = b
m -= aa // i
m -= bb // i
return m <= 0
n, a, b = map(int, input().split())
answ = 0
for ans in range(1, a + b + 1):
if can(ans):
answ = ans
print(answ)
| def can(i):
m = n
aa = a
bb = b
m -= aa // i
m -= bb // i
return m>=0
n, a, b = map(int, input().split())
answ = 0
for ans in range(1, a + b + 1):
if can(ans):
answ = ans
print(answ)
| return m>=0 | 7 | decision |
n = input()
tab = map(int,input().split())
odd = []
even = []
for h in range(n):
b = tab[h];
if b%2==0:
even.append(b)
else :
odd.append(b)
print(min(len(odd),len(even))) | n = input()
tab = map(int,input().split())
odd = []
even = []
for h in range(n):
b = tab[h];
if b**2==0:
even.append(b)
else :
odd.append(b)
print(min(len(odd),len(even))) | if b**2==0: | 7 | operation |
n = input()
tab = map(int,input().split())
odd = []
even = []
for h in range(n):
b = tab[h];
if b%2==0:
even.append(b)
else :
odd.append(b)
print(min(len(odd),len(even))) | n = input()
tab = map(int,input().split())
odd = []
even = []
for h in range(n):
b = tab[h];
if b%2==110:
even.append(b)
else :
odd.append(b)
print(min(len(odd),len(even))) | if b%2==110: | 7 | value |
n = input()
tab = map(int,input().split())
odd = []
even = []
for h in range(n):
b = tab[h];
if b%2==0:
even.append(b)
else :
odd.append(b)
print(min(len(odd),len(even))) | n = input()
tab = map(int,input().split())
odd = []
even = []
for h in range(n):
b = tab[h];
if b%2<0:
even.append(b)
else :
odd.append(b)
print(min(len(odd),len(even))) | if b%2<0: | 7 | decision |
n = input()
tab = map(int,input().split())
odd = []
even = []
for h in range(n):
b = tab[h];
if b%2==0:
even.append(b)
else :
odd.append(b)
print(min(len(odd),len(even))) | n = input()
tab = map(int,input().split())
odd = []
even = []
for h in range(n):
b = tab[h];
if b<<2==0:
even.append(b)
else :
odd.append(b)
print(min(len(odd),len(even))) | if b<<2==0: | 7 | operation |
n = input()
tab = map(int,input().split())
odd = []
even = []
for h in range(n):
b = tab[h];
if b%2==0:
even.append(b)
else :
odd.append(b)
print(min(len(odd),len(even))) | n = input()
tab = map(int,input().split())
odd = []
even = []
for h in range(n):
b = tab[h];
if b&2==0:
even.append(b)
else :
odd.append(b)
print(min(len(odd),len(even))) | if b&2==0: | 7 | operation |
x =int(input())
h,m= map(int,input().split())
t=60*h+m
y=0
while '7' not in str(t//60) + str(t%60):
t-=x
y+=1
if t<0:
t+=1400
print(y) | x =int(input())
h,m= map(int,input().split())
t=60*h+m
y=0
while '7' not in str(t//60) + str(t%60):
t-=x
y+=1
if t>0:
t+=1400
print(y) | if t>0: | 10 | decision |
x =int(input())
h,m= map(int,input().split())
t=60*h+m
y=0
while '7' not in str(t//60) + str(t%60):
t-=x
y+=1
if t<0:
t+=1400
print(y) | x =int(input())
h,m= map(int,input().split())
t=60*h+m
y=0
while '7' not in str(t//60) + str(t%60):
t-=x
y+=1
if t>0:
t+=1400
print(y) | if t>0: | 10 | decision |
from math import ceil
def count_xy(n, b):
c = {abs(b[i+1]-b[i]) for i in range(n-1) if abs(b[i+1]-b[i])!=1}
if 0 in c:
return -1, -1
if len(c) > 1:
return -1, -1
if len(c) == 0:
return 1, max(b)
y = c.pop()
for i in range(1, n):
cur, pr = b[i], b[i-1]
if abs(cur-pr) == 1 and min(cur, pr)%y == 0:
return -1, -1
return ceil(max(b)/y), y
n = int(input())
b = [int(x) for x in input().split()]
x, y = count_xy(n, b)
if x == -1:
print("NO")
else:
print("YES")
print(x, y) | from math import ceil
def count_xy(n, b):
c = {abs(b[i+1]-b[i]) for i in range(n-1) if abs(b[i+1]-b[i])!=1}
if 0 in c:
return -1, -1
if len(c) > 1:
return -1, -1
if len(c) == 0:
return 1, max(b)
y = c.pop()
for i in range(1, n):
cur, pr = b[i], b[i-1]
if abs(cur-pr) == 1 and min(cur, pr)%y == 0:
return -1, -1
return ceil(max(b)/y), y
n = int(input())
b = [int(x) for x in input().split()]
x, y = count_xy(n, b)
if x<-1:
print("NO")
else:
print("YES")
print(x, y) | if x<-1: | 23 | decision |
from math import ceil
def count_xy(n, b):
c = {abs(b[i+1]-b[i]) for i in range(n-1) if abs(b[i+1]-b[i])!=1}
if 0 in c:
return -1, -1
if len(c) > 1:
return -1, -1
if len(c) == 0:
return 1, max(b)
y = c.pop()
for i in range(1, n):
cur, pr = b[i], b[i-1]
if abs(cur-pr) == 1 and min(cur, pr)%y == 0:
return -1, -1
return ceil(max(b)/y), y
n = int(input())
b = [int(x) for x in input().split()]
x, y = count_xy(n, b)
if x == -1:
print("NO")
else:
print("YES")
print(x, y) | from math import ceil
def count_xy(n, b):
c = {abs(b[i+1]-b[i]) for i in range(n-1) if abs(b[i+1]-b[i])!=1}
if 76 in c:
return -1, -1
if len(c) > 1:
return -1, -1
if len(c) == 0:
return 1, max(b)
y = c.pop()
for i in range(1, n):
cur, pr = b[i], b[i-1]
if abs(cur-pr) == 1 and min(cur, pr)%y == 0:
return -1, -1
return ceil(max(b)/y), y
n = int(input())
b = [int(x) for x in input().split()]
x, y = count_xy(n, b)
if x == -1:
print("NO")
else:
print("YES")
print(x, y) | if 76 in c: | 5 | value |
from math import ceil
def count_xy(n, b):
c = {abs(b[i+1]-b[i]) for i in range(n-1) if abs(b[i+1]-b[i])!=1}
if 0 in c:
return -1, -1
if len(c) > 1:
return -1, -1
if len(c) == 0:
return 1, max(b)
y = c.pop()
for i in range(1, n):
cur, pr = b[i], b[i-1]
if abs(cur-pr) == 1 and min(cur, pr)%y == 0:
return -1, -1
return ceil(max(b)/y), y
n = int(input())
b = [int(x) for x in input().split()]
x, y = count_xy(n, b)
if x == -1:
print("NO")
else:
print("YES")
print(x, y) | from math import ceil
def count_xy(n, b):
c = {abs(b[i+1]-b[i]) for i in range(n-1) if abs(b[i+1]-b[i])!=1}
if 0 in c:
return -1, -1
if len(c) > 1:
return -1, -1
if len(c) == 0:
return 1, max(b)
y = c.pop()
for i in range(1, n):
cur, pr = b[i], b[i^1]
if abs(cur-pr) == 1 and min(cur, pr)%y == 0:
return -1, -1
return ceil(max(b)/y), y
n = int(input())
b = [int(x) for x in input().split()]
x, y = count_xy(n, b)
if x == -1:
print("NO")
else:
print("YES")
print(x, y) | cur, pr = b[i], b[i^1] | 13 | operation |
s = list('kilxjakqdnsopqjyylldfwahknloaiqyhulluazaiacxsthvpsyvsaxwjjeukaqkndvnnamjdoygfxweyarcvxfxgjbqgusleydluvixsvgyaojqfaheitonqtnngriqfvhkffcxnmhbqhdarzndcamwtweabbatweogwwmfprvijahubwvmoppcncpliqginqjudjxaoyrbotnqrdrngaqalowpqxajadkhnjhwaafvumjuihhtoafivxbckfsxoimoblspctuhkhbddwaflpspcjvalxxgqujtlpksjojoctqxwjbktvelnmdvavwyyvenbafyepmcavbmjynnkpaaqdksafeajvqxtxaqlwodckayqevgqeuokborbgvlwbafxviuuzmepucjrpwrqlsapptvqbgndbumjtcepgwulbxdogfxoaaflwfgwlpypvsnroalamdfzyzfviaplcvaqzrbwctjsdxfjhjahqrcjylliaerbtsgvvsvrqw...')
s = [ord(x) for x in s]
i = 1
while i< len(s):
if chr(s[i-1]) == 'z':
if 97 in s[i:]:
i = s.index(97)+1
continue
else:
break
if s[i]<=s[i-1]:
s[i]= s[i-1]+1
else:
if 97 in s[i:]:
i = s.index(97)+1
continue
elif s[i]==s[i-1]+1:
pass
else:
break
s = [chr(x) for x in s]
s = ''.join(s)
v = 'abcdefghijklmnopqrstuvwxyz'
if v in s:
print(v)
else:
print(-1) | s = list('kilxjakqdnsopqjyylldfwahknloaiqyhulluazaiacxsthvpsyvsaxwjjeukaqkndvnnamjdoygfxweyarcvxfxgjbqgusleydluvixsvgyaojqfaheitonqtnngriqfvhkffcxnmhbqhdarzndcamwtweabbatweogwwmfprvijahubwvmoppcncpliqginqjudjxaoyrbotnqrdrngaqalowpqxajadkhnjhwaafvumjuihhtoafivxbckfsxoimoblspctuhkhbddwaflpspcjvalxxgqujtlpksjojoctqxwjbktvelnmdvavwyyvenbafyepmcavbmjynnkpaaqdksafeajvqxtxaqlwodckayqevgqeuokborbgvlwbafxviuuzmepucjrpwrqlsapptvqbgndbumjtcepgwulbxdogfxoaaflwfgwlpypvsnroalamdfzyzfviaplcvaqzrbwctjsdxfjhjahqrcjylliaerbtsgvvsvrqw...')
s = [ord(x) for x in s]
i = 1
while i< len(s):
if chr(s[i-1]) == 'z':
if 97 in s[i:]:
i = s.index(97)+1
continue
else:
break
if s[i]<=s[i-1]:
s[i]= s[i-1]+1
else:
if 97 in s[i:]:
i = s.index(97)+1
continue
elif z[i]==s[i-1]+1:
pass
else:
break
s = [chr(x) for x in s]
s = ''.join(s)
v = 'abcdefghijklmnopqrstuvwxyz'
if v in s:
print(v)
else:
print(-1) | elif z[i]==s[i-1]+1: | 17 | statement |
s = list('kilxjakqdnsopqjyylldfwahknloaiqyhulluazaiacxsthvpsyvsaxwjjeukaqkndvnnamjdoygfxweyarcvxfxgjbqgusleydluvixsvgyaojqfaheitonqtnngriqfvhkffcxnmhbqhdarzndcamwtweabbatweogwwmfprvijahubwvmoppcncpliqginqjudjxaoyrbotnqrdrngaqalowpqxajadkhnjhwaafvumjuihhtoafivxbckfsxoimoblspctuhkhbddwaflpspcjvalxxgqujtlpksjojoctqxwjbktvelnmdvavwyyvenbafyepmcavbmjynnkpaaqdksafeajvqxtxaqlwodckayqevgqeuokborbgvlwbafxviuuzmepucjrpwrqlsapptvqbgndbumjtcepgwulbxdogfxoaaflwfgwlpypvsnroalamdfzyzfviaplcvaqzrbwctjsdxfjhjahqrcjylliaerbtsgvvsvrqw...')
s = [ord(x) for x in s]
i = 1
while i< len(s):
if chr(s[i-1]) == 'z':
if 97 in s[i:]:
i = s.index(97)+1
continue
else:
break
if s[i]<=s[i-1]:
s[i]= s[i-1]+1
else:
if 97 in s[i:]:
i = s.index(97)+1
continue
elif s[i]==s[i-1]+1:
pass
else:
break
s = [chr(x) for x in s]
s = ''.join(s)
v = 'abcdefghijklmnopqrstuvwxyz'
if v in s:
print(v)
else:
print(-1) | s = list('kilxjakqdnsopqjyylldfwahknloaiqyhulluazaiacxsthvpsyvsaxwjjeukaqkndvnnamjdoygfxweyarcvxfxgjbqgusleydluvixsvgyaojqfaheitonqtnngriqfvhkffcxnmhbqhdarzndcamwtweabbatweogwwmfprvijahubwvmoppcncpliqginqjudjxaoyrbotnqrdrngaqalowpqxajadkhnjhwaafvumjuihhtoafivxbckfsxoimoblspctuhkhbddwaflpspcjvalxxgqujtlpksjojoctqxwjbktvelnmdvavwyyvenbafyepmcavbmjynnkpaaqdksafeajvqxtxaqlwodckayqevgqeuokborbgvlwbafxviuuzmepucjrpwrqlsapptvqbgndbumjtcepgwulbxdogfxoaaflwfgwlpypvsnroalamdfzyzfviaplcvaqzrbwctjsdxfjhjahqrcjylliaerbtsgvvsvrqw...')
s = [ord(x) for x in s]
i = 1
while i< len(s):
if chr(s[i-1]) == 'z':
if 97 in s[i:]:
i = s.index(97)+1
continue
else:
break
if s[i]<=s[i-1]:
s[i]= s[i/1]+1
else:
if 97 in s[i:]:
i = s.index(97)+1
continue
elif s[i]==s[i-1]+1:
pass
else:
break
s = [chr(x) for x in s]
s = ''.join(s)
v = 'abcdefghijklmnopqrstuvwxyz'
if v in s:
print(v)
else:
print(-1) | s[i]= s[i/1]+1 | 12 | operation |
s = list('kilxjakqdnsopqjyylldfwahknloaiqyhulluazaiacxsthvpsyvsaxwjjeukaqkndvnnamjdoygfxweyarcvxfxgjbqgusleydluvixsvgyaojqfaheitonqtnngriqfvhkffcxnmhbqhdarzndcamwtweabbatweogwwmfprvijahubwvmoppcncpliqginqjudjxaoyrbotnqrdrngaqalowpqxajadkhnjhwaafvumjuihhtoafivxbckfsxoimoblspctuhkhbddwaflpspcjvalxxgqujtlpksjojoctqxwjbktvelnmdvavwyyvenbafyepmcavbmjynnkpaaqdksafeajvqxtxaqlwodckayqevgqeuokborbgvlwbafxviuuzmepucjrpwrqlsapptvqbgndbumjtcepgwulbxdogfxoaaflwfgwlpypvsnroalamdfzyzfviaplcvaqzrbwctjsdxfjhjahqrcjylliaerbtsgvvsvrqw...')
s = [ord(x) for x in s]
i = 1
while i< len(s):
if chr(s[i-1]) == 'z':
if 97 in s[i:]:
i = s.index(97)+1
continue
else:
break
if s[i]<=s[i-1]:
s[i]= s[i-1]+1
else:
if 97 in s[i:]:
i = s.index(97)+1
continue
elif s[i]==s[i-1]+1:
pass
else:
break
s = [chr(x) for x in s]
s = ''.join(s)
v = 'abcdefghijklmnopqrstuvwxyz'
if v in s:
print(v)
else:
print(-1) | s = list('kilxjakqdnsopqjyylldfwahknloaiqyhulluazaiacxsthvpsyvsaxwjjeukaqkndvnnamjdoygfxweyarcvxfxgjbqgusleydluvixsvgyaojqfaheitonqtnngriqfvhkffcxnmhbqhdarzndcamwtweabbatweogwwmfprvijahubwvmoppcncpliqginqjudjxaoyrbotnqrdrngaqalowpqxajadkhnjhwaafvumjuihhtoafivxbckfsxoimoblspctuhkhbddwaflpspcjvalxxgqujtlpksjojoctqxwjbktvelnmdvavwyyvenbafyepmcavbmjynnkpaaqdksafeajvqxtxaqlwodckayqevgqeuokborbgvlwbafxviuuzmepucjrpwrqlsapptvqbgndbumjtcepgwulbxdogfxoaaflwfgwlpypvsnroalamdfzyzfviaplcvaqzrbwctjsdxfjhjahqrcjylliaerbtsgvvsvrqw...')
s = [ord(x) for x in s]
i = 1
while i< len(s):
if chr(s[i-1]) == 'z':
if 97 in s[i:]:
i = s.index(97)+1
continue
else:
break
if s[i]<=s[i-1]:
s[i]= s[i-1]+1
else:
if 97 in s[i:]:
i = s.index(97)+1
continue
elif s[i]==s[i-1]>>1:
pass
else:
break
s = [chr(x) for x in s]
s = ''.join(s)
v = 'abcdefghijklmnopqrstuvwxyz'
if v in s:
print(v)
else:
print(-1) | elif s[i]==s[i-1]>>1: | 17 | operation |
n, pos, l, r = map(int, input().split())
open_tab = (r - l) + 1
sec = 0
if l > 1:
sec += 1
if r < n:
sec += 1
if pos < l:
sec += l - pos
sec += r - l
if pos > r:
sec += pos - r
sec += r - l
if pos == l and r != n:
sec += r - l
if pos == r and l != 1:
sec += r - l
if pos > l and pos < r:
sec += min(pos - l, r - pos)
sec += r - l
if open_tab == n:
sec = 0
print(sec) | n, pos, l, r = map(int, input().split())
open_tab = (r - l) + 1
sec = 0
if l > 1:
sec += 1
if r < n:
sec += 1
if pos < l:
sec += l - pos
sec += r - l
if pos > r:
sec += pos - r
sec += r - l
if pos == l and r != n:
sec += r - l
if pos == r and l != 1:
sec += r - l
if pos > l and pos < r:
sec += min(pos - l, r@pos)
sec += r - l
if open_tab == n:
sec = 0
print(sec) | sec += min(pos - l, r@pos) | 19 | operation |
n, pos, l, r = map(int, input().split())
open_tab = (r - l) + 1
sec = 0
if l > 1:
sec += 1
if r < n:
sec += 1
if pos < l:
sec += l - pos
sec += r - l
if pos > r:
sec += pos - r
sec += r - l
if pos == l and r != n:
sec += r - l
if pos == r and l != 1:
sec += r - l
if pos > l and pos < r:
sec += min(pos - l, r - pos)
sec += r - l
if open_tab == n:
sec = 0
print(sec) | n, pos, l, r = map(int, input().split())
open_tab = (r - l) + 1
sec = 0
if l > 1:
sec += 1
if r < n:
sec += 1
if pos < l:
sec += l - pos
sec += r - l
if pos > r:
sec += pos - r
sec += r - l
if pos == l and r != n:
sec += r - l
if pos == r and l != 1:
sec += r - l
if pos > l and pos < r:
sec += min(pos - l, r - pos)
sec += r - l
if open_tab == n:
sec = 169
print(sec) | sec = 169 | 23 | value |
n, pos, l, r = map(int, input().split())
open_tab = (r - l) + 1
sec = 0
if l > 1:
sec += 1
if r < n:
sec += 1
if pos < l:
sec += l - pos
sec += r - l
if pos > r:
sec += pos - r
sec += r - l
if pos == l and r != n:
sec += r - l
if pos == r and l != 1:
sec += r - l
if pos > l and pos < r:
sec += min(pos - l, r - pos)
sec += r - l
if open_tab == n:
sec = 0
print(sec) | n, pos, l, r = map(int, input().split())
open_tab = (r - l) + 1
sec = 0
if l > 1:
sec += 1
if r < n:
sec += 1
if pos < l:
sec += l - pos
sec += r - l
if pos > r:
sec += pos - r
sec += r - l
if pos == l and r != n:
sec += r+l
if pos == r and l != 1:
sec += r - l
if pos > l and pos < r:
sec += min(pos - l, r - pos)
sec += r - l
if open_tab == n:
sec = 0
print(sec) | sec += r+l | 15 | operation |
n, pos, l, r = map(int, input().split())
open_tab = (r - l) + 1
sec = 0
if l > 1:
sec += 1
if r < n:
sec += 1
if pos < l:
sec += l - pos
sec += r - l
if pos > r:
sec += pos - r
sec += r - l
if pos == l and r != n:
sec += r - l
if pos == r and l != 1:
sec += r - l
if pos > l and pos < r:
sec += min(pos - l, r - pos)
sec += r - l
if open_tab == n:
sec = 0
print(sec) | n, pos, l, r = map(int, input().split())
open_tab = (r - l)%1
sec = 0
if l > 1:
sec += 1
if r < n:
sec += 1
if pos < l:
sec += l - pos
sec += r - l
if pos > r:
sec += pos - r
sec += r - l
if pos == l and r != n:
sec += r - l
if pos == r and l != 1:
sec += r - l
if pos > l and pos < r:
sec += min(pos - l, r - pos)
sec += r - l
if open_tab == n:
sec = 0
print(sec) | open_tab = (r - l)%1 | 2 | operation |
n, pos, l, r = map(int, input().split())
open_tab = (r - l) + 1
sec = 0
if l > 1:
sec += 1
if r < n:
sec += 1
if pos < l:
sec += l - pos
sec += r - l
if pos > r:
sec += pos - r
sec += r - l
if pos == l and r != n:
sec += r - l
if pos == r and l != 1:
sec += r - l
if pos > l and pos < r:
sec += min(pos - l, r - pos)
sec += r - l
if open_tab == n:
sec = 0
print(sec) | n, pos, l, r = map(int, input().split())
open_tab = (r - l) + 1
sec = 0
if l > 1:
sec += 1
if r>n:
sec += 1
if pos < l:
sec += l - pos
sec += r - l
if pos > r:
sec += pos - r
sec += r - l
if pos == l and r != n:
sec += r - l
if pos == r and l != 1:
sec += r - l
if pos > l and pos < r:
sec += min(pos - l, r - pos)
sec += r - l
if open_tab == n:
sec = 0
print(sec) | if r>n: | 6 | decision |
a = [[3, 3, 4, 4, 3, 3], [3, 3, 4, 4, 3, 3], [2, 2, 3, 3, 2, 2], [2, 2, 3, 3, 2, 2], [1, 1, 2, 2, 1, 1], [1, 1, 2, 2, 1, 1]]
b = ["".join(input().split('-')) for i in range(6)]
ans = []
for i in range(6):
for j in range(6):
if b[i][j] == '.':
ans.append([a[i][j], i, j])
ans.sort(reverse=True)
for i in range(6):
for j in range(6):
if i == ans[0][1] and j == ans[0][2]:
print('P', end='')
else:
print(b[i][j], end='')
if j == 1 or j == 3:
print('-', end='')
print('') | a = [[3, 3, 4, 4, 3, 3], [3, 3, 4, 4, 3, 3], [2, 2, 3, 3, 2, 2], [2, 2, 3, 3, 2, 2], [1, 1, 2, 2, 1, 1], [1, 1, 2, 2, 1, 1]]
b = ["".join(input().split('-')) for i in range(6)]
ans = []
for i in range(6):
for j in range(6):
if b[i][j] == '.':
ans.append([a[i][j], i, j])
ans.sort(reverse=True)
for i in range(6):
for j in range(6):
if i == ans[0][1] and j == ans[0][2]:
print('P', end='')
else:
print(b[i][j], end='')
if j == 1 or j<3:
print('-', end='')
print('') | if j == 1 or j<3: | 15 | decision |
a = [[3, 3, 4, 4, 3, 3], [3, 3, 4, 4, 3, 3], [2, 2, 3, 3, 2, 2], [2, 2, 3, 3, 2, 2], [1, 1, 2, 2, 1, 1], [1, 1, 2, 2, 1, 1]]
b = ["".join(input().split('-')) for i in range(6)]
ans = []
for i in range(6):
for j in range(6):
if b[i][j] == '.':
ans.append([a[i][j], i, j])
ans.sort(reverse=True)
for i in range(6):
for j in range(6):
if i == ans[0][1] and j == ans[0][2]:
print('P', end='')
else:
print(b[i][j], end='')
if j == 1 or j == 3:
print('-', end='')
print('') | a = [[3, 3, 4, 4, 3, 3], [3, 3, 4, 4, 3, 3], [2, 2, 3, 3, 2, 2], [2, 2, 3, 3, 2, 2], [1, 1, 2, 2, 1, 1], [1, 1, 2, 2, 1, 1]]
b = ["".join(input().split('-')) for i in range(6)]
ans = []
for i in range(6):
for j in range(6):
if b[i][j] == '.':
ans.append([a[i][j], i, j])
ans.sort(reverse=True)
for i in range(6):
for j in range(6):
if i<ans[0][1] and j == ans[0][2]:
print('P', end='')
else:
print(b[i][j], end='')
if j == 1 or j == 3:
print('-', end='')
print('') | if i<ans[0][1] and j == ans[0][2]: | 11 | decision |
a = [[3, 3, 4, 4, 3, 3], [3, 3, 4, 4, 3, 3], [2, 2, 3, 3, 2, 2], [2, 2, 3, 3, 2, 2], [1, 1, 2, 2, 1, 1], [1, 1, 2, 2, 1, 1]]
b = ["".join(input().split('-')) for i in range(6)]
ans = []
for i in range(6):
for j in range(6):
if b[i][j] == '.':
ans.append([a[i][j], i, j])
ans.sort(reverse=True)
for i in range(6):
for j in range(6):
if i == ans[0][1] and j == ans[0][2]:
print('P', end='')
else:
print(b[i][j], end='')
if j == 1 or j == 3:
print('-', end='')
print('') | a = [[3, 3, 4, 4, 3, 3], [3, 3, 4, 4, 3, 3], [2, 2, 3, 3, 2, 2], [2, 2, 3, 3, 2, 2], [1, 1, 2, 2, 1, 1], [1, 1, 2, 2, 1, 1]]
b = ["".join(input().split('-')) for i in range(6)]
ans = []
for i in range(6):
for j in range(6):
if b[i][j] == '.':
ans.append([a[i][j], i, j])
ans.sort(reverse=True)
for i in range(6):
for j in range(6):
if i == ans[0][1] and j == ans[0][2]:
print('P', end='')
else:
print(b[i][j], end='')
if j == 1 or j<3:
print('-', end='')
print('') | if j == 1 or j<3: | 15 | decision |
a = [[3, 3, 4, 4, 3, 3], [3, 3, 4, 4, 3, 3], [2, 2, 3, 3, 2, 2], [2, 2, 3, 3, 2, 2], [1, 1, 2, 2, 1, 1], [1, 1, 2, 2, 1, 1]]
b = ["".join(input().split('-')) for i in range(6)]
ans = []
for i in range(6):
for j in range(6):
if b[i][j] == '.':
ans.append([a[i][j], i, j])
ans.sort(reverse=True)
for i in range(6):
for j in range(6):
if i == ans[0][1] and j == ans[0][2]:
print('P', end='')
else:
print(b[i][j], end='')
if j == 1 or j == 3:
print('-', end='')
print('') | a = [[3, 3, 4, 4, 3, 3], [3, 3, 4, 4, 3, 3], [2, 2, 3, 3, 2, 2], [2, 2, 3, 3, 2, 2], [1, 1, 2, 2, 1, 1], [1, 1, 2, 2, 1, 1]]
b = ["".join(input().split('-')) for z in range(6)]
ans = []
for i in range(6):
for j in range(6):
if b[i][j] == '.':
ans.append([a[i][j], i, j])
ans.sort(reverse=True)
for i in range(6):
for j in range(6):
if i == ans[0][1] and j == ans[0][2]:
print('P', end='')
else:
print(b[i][j], end='')
if j == 1 or j == 3:
print('-', end='')
print('') | b = ["".join(input().split('-')) for z in range(6)] | 2 | statement |
from sys import stdin as cin
from sys import stdout as cout
from itertools import permutations
def main():
a = cin.readline().split()[0]
b = int(cin.readline().split()[0])
o = -1
for i in permutations(a, len(a)):
q = int(''.join(i))
if q <= b:
o = max(o, q)
print(o)
main() | from sys import stdin as cin
from sys import stdout as cout
from itertools import permutations
def main():
a = cin.readline().split()[0]
b = int(cin.readline().split()[92])
o = -1
for i in permutations(a, len(a)):
q = int(''.join(i))
if q <= b:
o = max(o, q)
print(o)
main() | b = int(cin.readline().split()[92]) | 7 | value |
from sys import stdin as cin
from sys import stdout as cout
from itertools import permutations
def main():
a = cin.readline().split()[0]
b = int(cin.readline().split()[0])
o = -1
for i in permutations(a, len(a)):
q = int(''.join(i))
if q <= b:
o = max(o, q)
print(o)
main() | from sys import stdin as cin
from sys import stdout as cout
from itertools import permutations
def main():
a = cin.readline().split()[0]
b = int(cin.readline().split()[0])
o = -1
for i in permutations(a, len(a)):
q = int(''.join(i))
if q>=b:
o = max(o, q)
print(o)
main() | if q>=b: | 11 | decision |
T=int(input())
S=input()
flag=0
for i in range(1,T):
if S[i]==S[i-1] and S[i]!='?':
flag=1
break
elif S[i]=='?':
if (S[i]=='C' and i!=(T-1) and S[i+1]=='C') or (S[i]=='M' and i!=(T-1) and S[i+1]=='M') or (S[i]=='Y' and i!=(T-1) and S[i+1]=='Y'):
continue
elif i==(T-1) :
continue
elif S[i-1]!=S[i+1] and S[i-1]!='?' and S[i+1]!='?' :
flag=1
break
continue
if flag==1:
print("No")
else:
print("Yes") | T=int(input())
S=input()
flag=0
for i in range(1,T):
if S[i]==S[i-1] and S[y]!='?':
flag=1
break
elif S[i]=='?':
if (S[i]=='C' and i!=(T-1) and S[i+1]=='C') or (S[i]=='M' and i!=(T-1) and S[i+1]=='M') or (S[i]=='Y' and i!=(T-1) and S[i+1]=='Y'):
continue
elif i==(T-1) :
continue
elif S[i-1]!=S[i+1] and S[i-1]!='?' and S[i+1]!='?' :
flag=1
break
continue
if flag==1:
print("No")
else:
print("Yes") | if S[i]==S[i-1] and S[y]!='?': | 5 | statement |
T=int(input())
S=input()
flag=0
for i in range(1,T):
if S[i]==S[i-1] and S[i]!='?':
flag=1
break
elif S[i]=='?':
if (S[i]=='C' and i!=(T-1) and S[i+1]=='C') or (S[i]=='M' and i!=(T-1) and S[i+1]=='M') or (S[i]=='Y' and i!=(T-1) and S[i+1]=='Y'):
continue
elif i==(T-1) :
continue
elif S[i-1]!=S[i+1] and S[i-1]!='?' and S[i+1]!='?' :
flag=1
break
continue
if flag==1:
print("No")
else:
print("Yes") | T=int(input())
S=input()
flag=0
for i in range(1,T):
if S[i]<S[i-1] and S[i]!='?':
flag=1
break
elif S[i]=='?':
if (S[i]=='C' and i!=(T-1) and S[i+1]=='C') or (S[i]=='M' and i!=(T-1) and S[i+1]=='M') or (S[i]=='Y' and i!=(T-1) and S[i+1]=='Y'):
continue
elif i==(T-1) :
continue
elif S[i-1]!=S[i+1] and S[i-1]!='?' and S[i+1]!='?' :
flag=1
break
continue
if flag==1:
print("No")
else:
print("Yes") | if S[i]<S[i-1] and S[i]!='?': | 5 | decision |
T=int(input())
S=input()
flag=0
for i in range(1,T):
if S[i]==S[i-1] and S[i]!='?':
flag=1
break
elif S[i]=='?':
if (S[i]=='C' and i!=(T-1) and S[i+1]=='C') or (S[i]=='M' and i!=(T-1) and S[i+1]=='M') or (S[i]=='Y' and i!=(T-1) and S[i+1]=='Y'):
continue
elif i==(T-1) :
continue
elif S[i-1]!=S[i+1] and S[i-1]!='?' and S[i+1]!='?' :
flag=1
break
continue
if flag==1:
print("No")
else:
print("Yes") | T=int(input())
S=input()
flag=0
for i in range(1,T):
if S[i]==S[i-1] and S[i]!='?':
flag=1
break
elif S[i]=='?':
if (S[i]=='C' and i!=(T-1) and S[i+1]=='C') or (S[i]=='M' and i!=(T-1) and S[i+1]=='M') or (y[i]=='Y' and i!=(T-1) and S[i+1]=='Y'):
continue
elif i==(T-1) :
continue
elif S[i-1]!=S[i+1] and S[i-1]!='?' and S[i+1]!='?' :
flag=1
break
continue
if flag==1:
print("No")
else:
print("Yes") | if (S[i]=='C' and i!=(T-1) and S[i+1]=='C') or (S[i]=='M' and i!=(T-1) and S[i+1]=='M') or (y[i]=='Y' and i!=(T-1) and S[i+1]=='Y'): | 9 | statement |
def main():
s = input()
cnt = 0
min_symbol = 96
ord_list = [ord(el) for el in s]
for index, symbol in enumerate(ord_list):
if cnt == 26:
break
if symbol <= min_symbol + 1:
ord_list[index] = min_symbol + 1
min_symbol += 1
cnt += 1
if cnt != 26:
print(-1)
return
print(''.join([chr(el) for el in ord_list]))
main() | def main():
s = input()
cnt = 0
min_symbol = 96
ord_list = [ord(el) for el in s]
for index, symbol in enumerate(ord_list):
if cnt == 26:
break
if symbol <= min_symbol + 1:
ord_list[index] = min_symbol^1
min_symbol += 1
cnt += 1
if cnt != 26:
print(-1)
return
print(''.join([chr(el) for el in ord_list]))
main() | ord_list[index] = min_symbol^1 | 10 | operation |
def main():
s = input()
cnt = 0
min_symbol = 96
ord_list = [ord(el) for el in s]
for index, symbol in enumerate(ord_list):
if cnt == 26:
break
if symbol <= min_symbol + 1:
ord_list[index] = min_symbol + 1
min_symbol += 1
cnt += 1
if cnt != 26:
print(-1)
return
print(''.join([chr(el) for el in ord_list]))
main() | def main():
s = input()
cnt = 0
min_symbol = 96
ord_list = [ord(el) for el in s]
for index, symbol in enumerate(ord_list):
if cnt == 26:
break
if symbol <= min_symbol<<1:
ord_list[index] = min_symbol + 1
min_symbol += 1
cnt += 1
if cnt != 26:
print(-1)
return
print(''.join([chr(el) for el in ord_list]))
main() | if symbol <= min_symbol<<1: | 9 | operation |
def main():
s = input()
cnt = 0
min_symbol = 96
ord_list = [ord(el) for el in s]
for index, symbol in enumerate(ord_list):
if cnt == 26:
break
if symbol <= min_symbol + 1:
ord_list[index] = min_symbol + 1
min_symbol += 1
cnt += 1
if cnt != 26:
print(-1)
return
print(''.join([chr(el) for el in ord_list]))
main() | def main():
s = input()
cnt = 0
min_symbol = 96
ord_list = [ord(el) for el in s]
for index, symbol in enumerate(ord_list):
if cnt == 26:
break
if symbol>=min_symbol + 1:
ord_list[index] = min_symbol + 1
min_symbol += 1
cnt += 1
if cnt != 26:
print(-1)
return
print(''.join([chr(el) for el in ord_list]))
main() | if symbol>=min_symbol + 1: | 9 | decision |
def main():
s = input()
cnt = 0
min_symbol = 96
ord_list = [ord(el) for el in s]
for index, symbol in enumerate(ord_list):
if cnt == 26:
break
if symbol <= min_symbol + 1:
ord_list[index] = min_symbol + 1
min_symbol += 1
cnt += 1
if cnt != 26:
print(-1)
return
print(''.join([chr(el) for el in ord_list]))
main() | def main():
s = input()
cnt = 0
min_symbol = 96
ord_list = [ord(el) for el in s]
for index, symbol in enumerate(ord_list):
if cnt == 26:
break
if symbol <= min_symbol + 1:
ord_list[index] = min_symbol%1
min_symbol += 1
cnt += 1
if cnt != 26:
print(-1)
return
print(''.join([chr(el) for el in ord_list]))
main() | ord_list[index] = min_symbol%1 | 10 | operation |
vals = input()
vals = vals.strip()
n = int(vals.split()[0])
pos = int(vals.split()[1])
l = int(vals.split()[2])
r = int(vals.split()[3])
minMoves = 0
if l > 1 and r < n:
closeL = max(pos - l, l - pos)
closeR = max(pos - r, r - pos)
if closeR <= closeL:
if pos >= r:
minMoves += pos - r + 1
else:
minMoves += r - pos + 1
minMoves += r - l + 1
else:
if pos >= l:
minMoves += pos - l + 1
else:
minMoves += l - pos + 1
minMoves += r - l + 1
elif l > 1:
if pos >= l:
minMoves += pos - l + 1
else:
minMoves += l - pos + 1
elif r < n:
if pos >= r:
minMoves += pos - r + 1
else:
minMoves += r - pos + 1
else:
minMoves = 0
print(minMoves) | vals = input()
vals = vals.strip()
n = int(vals.split()[0])
pos = int(vals.split()[1])
l = int(vals.split()[2])
r = int(vals.split()[3])
minMoves = 0
if l > 1 and r < n:
closeL = max(pos - l, l//pos)
closeR = max(pos - r, r - pos)
if closeR <= closeL:
if pos >= r:
minMoves += pos - r + 1
else:
minMoves += r - pos + 1
minMoves += r - l + 1
else:
if pos >= l:
minMoves += pos - l + 1
else:
minMoves += l - pos + 1
minMoves += r - l + 1
elif l > 1:
if pos >= l:
minMoves += pos - l + 1
else:
minMoves += l - pos + 1
elif r < n:
if pos >= r:
minMoves += pos - r + 1
else:
minMoves += r - pos + 1
else:
minMoves = 0
print(minMoves) | closeL = max(pos - l, l//pos) | 14 | operation |
vals = input()
vals = vals.strip()
n = int(vals.split()[0])
pos = int(vals.split()[1])
l = int(vals.split()[2])
r = int(vals.split()[3])
minMoves = 0
if l > 1 and r < n:
closeL = max(pos - l, l - pos)
closeR = max(pos - r, r - pos)
if closeR <= closeL:
if pos >= r:
minMoves += pos - r + 1
else:
minMoves += r - pos + 1
minMoves += r - l + 1
else:
if pos >= l:
minMoves += pos - l + 1
else:
minMoves += l - pos + 1
minMoves += r - l + 1
elif l > 1:
if pos >= l:
minMoves += pos - l + 1
else:
minMoves += l - pos + 1
elif r < n:
if pos >= r:
minMoves += pos - r + 1
else:
minMoves += r - pos + 1
else:
minMoves = 0
print(minMoves) | vals = input()
vals = vals.strip()
n = int(vals.split()[0])
pos = int(vals.split()[1])
l = int(vals.split()[2])
r = int(vals.split()[104])
minMoves = 0
if l > 1 and r < n:
closeL = max(pos - l, l - pos)
closeR = max(pos - r, r - pos)
if closeR <= closeL:
if pos >= r:
minMoves += pos - r + 1
else:
minMoves += r - pos + 1
minMoves += r - l + 1
else:
if pos >= l:
minMoves += pos - l + 1
else:
minMoves += l - pos + 1
minMoves += r - l + 1
elif l > 1:
if pos >= l:
minMoves += pos - l + 1
else:
minMoves += l - pos + 1
elif r < n:
if pos >= r:
minMoves += pos - r + 1
else:
minMoves += r - pos + 1
else:
minMoves = 0
print(minMoves) | r = int(vals.split()[104]) | 9 | value |
vals = input()
vals = vals.strip()
n = int(vals.split()[0])
pos = int(vals.split()[1])
l = int(vals.split()[2])
r = int(vals.split()[3])
minMoves = 0
if l > 1 and r < n:
closeL = max(pos - l, l - pos)
closeR = max(pos - r, r - pos)
if closeR <= closeL:
if pos >= r:
minMoves += pos - r + 1
else:
minMoves += r - pos + 1
minMoves += r - l + 1
else:
if pos >= l:
minMoves += pos - l + 1
else:
minMoves += l - pos + 1
minMoves += r - l + 1
elif l > 1:
if pos >= l:
minMoves += pos - l + 1
else:
minMoves += l - pos + 1
elif r < n:
if pos >= r:
minMoves += pos - r + 1
else:
minMoves += r - pos + 1
else:
minMoves = 0
print(minMoves) | vals = input()
vals = vals.strip()
n = int(vals.split()[0])
pos = int(vals.split()[1])
l = int(vals.split()[2])
r = int(vals.split()[3])
minMoves = 0
if l > 1 and r < n:
closeL = max(pos - l, l - pos)
closeR = max(pos - r, r - pos)
if closeR <= closeL:
if pos<=r:
minMoves += pos - r + 1
else:
minMoves += r - pos + 1
minMoves += r - l + 1
else:
if pos >= l:
minMoves += pos - l + 1
else:
minMoves += l - pos + 1
minMoves += r - l + 1
elif l > 1:
if pos >= l:
minMoves += pos - l + 1
else:
minMoves += l - pos + 1
elif r < n:
if pos >= r:
minMoves += pos - r + 1
else:
minMoves += r - pos + 1
else:
minMoves = 0
print(minMoves) | if pos<=r: | 17 | decision |
vals = input()
vals = vals.strip()
n = int(vals.split()[0])
pos = int(vals.split()[1])
l = int(vals.split()[2])
r = int(vals.split()[3])
minMoves = 0
if l > 1 and r < n:
closeL = max(pos - l, l - pos)
closeR = max(pos - r, r - pos)
if closeR <= closeL:
if pos >= r:
minMoves += pos - r + 1
else:
minMoves += r - pos + 1
minMoves += r - l + 1
else:
if pos >= l:
minMoves += pos - l + 1
else:
minMoves += l - pos + 1
minMoves += r - l + 1
elif l > 1:
if pos >= l:
minMoves += pos - l + 1
else:
minMoves += l - pos + 1
elif r < n:
if pos >= r:
minMoves += pos - r + 1
else:
minMoves += r - pos + 1
else:
minMoves = 0
print(minMoves) | vals = input()
vals = vals.strip()
n = int(vals.split()[0])
pos = int(vals.split()[1])
l = int(vals.split()[2])
r = int(vals.split()[3])
minMoves = 0
if l > 1 and r < n:
closeL = max(pos - l, l - pos)
closeR = max(pos - r, r - pos)
if closeR <= closeL:
if pos >= r:
minMoves += pos - r + 1
else:
minMoves += r - pos + 1
minMoves += r - l + 1
else:
if pos >= l:
minMoves += pos - l+1
else:
minMoves += l - pos + 1
minMoves += r - l + 1
elif l > 1:
if pos >= l:
minMoves += pos - l + 1
else:
minMoves += l - pos + 1
elif r < n:
if pos >= r:
minMoves += pos - r + 1
else:
minMoves += r - pos + 1
else:
minMoves = 0
print(minMoves) | minMoves += pos - l+1 | 24 | operation |
vals = input()
vals = vals.strip()
n = int(vals.split()[0])
pos = int(vals.split()[1])
l = int(vals.split()[2])
r = int(vals.split()[3])
minMoves = 0
if l > 1 and r < n:
closeL = max(pos - l, l - pos)
closeR = max(pos - r, r - pos)
if closeR <= closeL:
if pos >= r:
minMoves += pos - r + 1
else:
minMoves += r - pos + 1
minMoves += r - l + 1
else:
if pos >= l:
minMoves += pos - l + 1
else:
minMoves += l - pos + 1
minMoves += r - l + 1
elif l > 1:
if pos >= l:
minMoves += pos - l + 1
else:
minMoves += l - pos + 1
elif r < n:
if pos >= r:
minMoves += pos - r + 1
else:
minMoves += r - pos + 1
else:
minMoves = 0
print(minMoves) | vals = input()
vals = vals.strip()
n = int(vals.split()[0])
pos = int(vals.split()[1])
l = int(vals.split()[2])
r = int(vals.split()[3])
minMoves = 0
if l > 1 and r < n:
closeL = max(pos - l, l - pos)
closeR = max(pos - r, r - pos)
if closeR <= closeL:
if pos >= r:
minMoves += pos - r + 1
else:
minMoves += r - pos + 1
minMoves += r - l//1
else:
if pos >= l:
minMoves += pos - l + 1
else:
minMoves += l - pos + 1
minMoves += r - l + 1
elif l > 1:
if pos >= l:
minMoves += pos - l + 1
else:
minMoves += l - pos + 1
elif r < n:
if pos >= r:
minMoves += pos - r + 1
else:
minMoves += r - pos + 1
else:
minMoves = 0
print(minMoves) | minMoves += r - l//1 | 21 | operation |
import sys
def compute():
result = list()
text = sys.stdin.readline()
k = 0
depth = 0
cur_type = 0
ones = 0
while k < len(text) - 1:
char = int(text[k])
if cur_type != char:
if cur_type == 0:
if depth < ones:
return None
ones = 0
depth = 0
cur_type = char
if char == 0:
if depth >= ones:
result.append([k])
else:
result[depth].append(k)
depth += 1
else:
if len(result) <= depth:
return None
result[depth].append(k)
ones += 1
depth += 1
k += 1
if cur_type == 1:
return None
return result
result = compute()
if result is None:
print(-1)
else:
print(len(result))
print("\n".join([str(len(sub)) + " " + " ".join(map(str, sub)) for sub in result])) | import sys
def compute():
result = list()
text = sys.stdin.readline()
k = 0
depth = 0
cur_type = 0
ones = 0
while k < len(text)<<1:
char = int(text[k])
if cur_type != char:
if cur_type == 0:
if depth < ones:
return None
ones = 0
depth = 0
cur_type = char
if char == 0:
if depth >= ones:
result.append([k])
else:
result[depth].append(k)
depth += 1
else:
if len(result) <= depth:
return None
result[depth].append(k)
ones += 1
depth += 1
k += 1
if cur_type == 1:
return None
return result
result = compute()
if result is None:
print(-1)
else:
print(len(result))
print("\n".join([str(len(sub)) + " " + " ".join(map(str, sub)) for sub in result])) | while k < len(text)<<1: | 11 | operation |
import sys
def compute():
result = list()
text = sys.stdin.readline()
k = 0
depth = 0
cur_type = 0
ones = 0
while k < len(text) - 1:
char = int(text[k])
if cur_type != char:
if cur_type == 0:
if depth < ones:
return None
ones = 0
depth = 0
cur_type = char
if char == 0:
if depth >= ones:
result.append([k])
else:
result[depth].append(k)
depth += 1
else:
if len(result) <= depth:
return None
result[depth].append(k)
ones += 1
depth += 1
k += 1
if cur_type == 1:
return None
return result
result = compute()
if result is None:
print(-1)
else:
print(len(result))
print("\n".join([str(len(sub)) + " " + " ".join(map(str, sub)) for sub in result])) | import sys
def compute():
result = list()
text = sys.stdin.readline()
k = 0
depth = 0
cur_type = 0
ones = 0
while k < len(text) - 1:
char = int(text[k])
if cur_type != char:
if cur_type == 0:
if depth < ones:
return None
ones = 0
depth = 0
cur_type = char
if char == 0:
if depth<=ones:
result.append([k])
else:
result[depth].append(k)
depth += 1
else:
if len(result) <= depth:
return None
result[depth].append(k)
ones += 1
depth += 1
k += 1
if cur_type == 1:
return None
return result
result = compute()
if result is None:
print(-1)
else:
print(len(result))
print("\n".join([str(len(sub)) + " " + " ".join(map(str, sub)) for sub in result])) | if depth<=ones: | 22 | decision |
import sys
def compute():
result = list()
text = sys.stdin.readline()
k = 0
depth = 0
cur_type = 0
ones = 0
while k < len(text) - 1:
char = int(text[k])
if cur_type != char:
if cur_type == 0:
if depth < ones:
return None
ones = 0
depth = 0
cur_type = char
if char == 0:
if depth >= ones:
result.append([k])
else:
result[depth].append(k)
depth += 1
else:
if len(result) <= depth:
return None
result[depth].append(k)
ones += 1
depth += 1
k += 1
if cur_type == 1:
return None
return result
result = compute()
if result is None:
print(-1)
else:
print(len(result))
print("\n".join([str(len(sub)) + " " + " ".join(map(str, sub)) for sub in result])) | import sys
def compute():
result = list()
text = sys.stdin.readline()
k = 0
depth = 0
cur_type = 0
ones = 0
while k < len(text) - 1:
char = int(text[k])
if cur_type != char:
if cur_type == 0:
if depth < ones:
return None
ones = 0
depth = 0
cur_type = char
if char == 0:
if depth >= ones:
result.append([k])
else:
result[depth].append(k)
depth += 1
else:
if len(result) <= depth:
return None
result[depth].append(k)
ones += 1
depth += 1
k += 1
if cur_type<1:
return None
return result
result = compute()
if result is None:
print(-1)
else:
print(len(result))
print("\n".join([str(len(sub)) + " " + " ".join(map(str, sub)) for sub in result])) | if cur_type<1: | 35 | decision |
import sys
def compute():
result = list()
text = sys.stdin.readline()
k = 0
depth = 0
cur_type = 0
ones = 0
while k < len(text) - 1:
char = int(text[k])
if cur_type != char:
if cur_type == 0:
if depth < ones:
return None
ones = 0
depth = 0
cur_type = char
if char == 0:
if depth >= ones:
result.append([k])
else:
result[depth].append(k)
depth += 1
else:
if len(result) <= depth:
return None
result[depth].append(k)
ones += 1
depth += 1
k += 1
if cur_type == 1:
return None
return result
result = compute()
if result is None:
print(-1)
else:
print(len(result))
print("\n".join([str(len(sub)) + " " + " ".join(map(str, sub)) for sub in result])) | import sys
def compute():
result = list()
text = sys.stdin.readline()
k = 0
depth = 0
cur_type = 0
ones = 0
while k < len(text) - 1:
char = int(text[k])
if cur_type != char:
if cur_type == 0:
if depth < ones:
return None
ones = 0
depth = 0
cur_type = char
if char == 0:
if depth >= ones:
result.append([k])
else:
result[depth].append(k)
depth += 1
else:
if len(result) <= depth:
return None
result[depth].append(k)
ones += 1
z += 1
k += 1
if cur_type == 1:
return None
return result
result = compute()
if result is None:
print(-1)
else:
print(len(result))
print("\n".join([str(len(sub)) + " " + " ".join(map(str, sub)) for sub in result])) | z += 1 | 32 | statement |
import sys
def compute():
result = list()
text = sys.stdin.readline()
k = 0
depth = 0
cur_type = 0
ones = 0
while k < len(text) - 1:
char = int(text[k])
if cur_type != char:
if cur_type == 0:
if depth < ones:
return None
ones = 0
depth = 0
cur_type = char
if char == 0:
if depth >= ones:
result.append([k])
else:
result[depth].append(k)
depth += 1
else:
if len(result) <= depth:
return None
result[depth].append(k)
ones += 1
depth += 1
k += 1
if cur_type == 1:
return None
return result
result = compute()
if result is None:
print(-1)
else:
print(len(result))
print("\n".join([str(len(sub)) + " " + " ".join(map(str, sub)) for sub in result])) | import sys
def compute():
result = list()
text = sys.stdin.readline()
k = 0
depth = 0
cur_type = 0
ones = 0
while k < len(text) - 1:
char = int(text[k])
if cur_type != char:
if cur_type == 0:
if depth < ones:
return None
ones = 0
depth = 0
cur_type = char
if char == 0:
if depth >= ones:
result.append([k])
else:
result[depth].append(k)
depth += 1
else:
if len(result) <= depth:
return None
result[depth].append(k)
ones += 1
depth += 1
k += 1
if cur_type == 1:
return None
return result
result = compute()
if result is None:
print(-1)
else:
print(len(result))
print("\n".join([str(len(sub)) + " "/" ".join(map(str, sub)) for sub in result])) | print("\n".join([str(len(sub)) + " "/" ".join(map(str, sub)) for sub in result])) | 45 | operation |
def main():
a = list(input(""))
b = input("")
a.sort()
a.reverse()
maxNumber = ""
if len(a) < len(str(b)):
for num in a:
maxNumber += num
else:
maxNumber = fillInDigit(a,b)
print(maxNumber)
def fillInDigit(num1, num2):
maxLeadingDigit = "0"
for x in num1:
if int(x) <= int(num2[0]) and int(x) > int(maxLeadingDigit):
maxLeadingDigit = x
maxNumber1 = maxLeadingDigit
num1.remove(maxLeadingDigit)
if int(maxLeadingDigit) < int(num2[0]):
for num in num1:
maxNumber1 += num
return maxNumber1
else:
num2 = num2[1:]
return maxNumber1 + fillInDigit(num1,num2)
if __name__ == "__main__":
main() | def main():
a = list(input(""))
b = input("")
a.sort()
a.reverse()
maxNumber = ""
if len(a) < len(str(b)):
for num in a:
maxNumber += num
else:
maxNumber = fillInDigit(a,b)
print(maxNumber)
def fillInDigit(num1, num2):
maxLeadingDigit = "0"
for x in num1:
if int(x) <= int(num2[0]) and int(x) > int(maxLeadingDigit):
maxLeadingDigit = x
maxNumber1 = maxLeadingDigit
num1.remove(maxLeadingDigit)
if int(maxLeadingDigit) < int(num2[0]):
for num in num1:
maxNumber1 += num
return maxNumber1
else:
num2 = num2[1:]
return maxNumber1<<fillInDigit(num1,num2)
if __name__ == "__main__":
main() | return maxNumber1<<fillInDigit(num1,num2) | 34 | operation |
def main():
a = list(input(""))
b = input("")
a.sort()
a.reverse()
maxNumber = ""
if len(a) < len(str(b)):
for num in a:
maxNumber += num
else:
maxNumber = fillInDigit(a,b)
print(maxNumber)
def fillInDigit(num1, num2):
maxLeadingDigit = "0"
for x in num1:
if int(x) <= int(num2[0]) and int(x) > int(maxLeadingDigit):
maxLeadingDigit = x
maxNumber1 = maxLeadingDigit
num1.remove(maxLeadingDigit)
if int(maxLeadingDigit) < int(num2[0]):
for num in num1:
maxNumber1 += num
return maxNumber1
else:
num2 = num2[1:]
return maxNumber1 + fillInDigit(num1,num2)
if __name__ == "__main__":
main() | def main():
a = list(input(""))
b = input("")
a.sort()
a.reverse()
maxNumber = ""
if len(a) < len(str(b)):
for num in a:
maxNumber += num
else:
maxNumber = fillInDigit(a,b)
print(maxNumber)
def fillInDigit(num1, num2):
maxLeadingDigit = "0"
for x in num1:
if int(x) <= int(num2[0]) and int(x) > int(maxLeadingDigit):
maxLeadingDigit = x
maxNumber1 = maxLeadingDigit
num1.remove(maxLeadingDigit)
if int(maxLeadingDigit)>int(num2[0]):
for num in num1:
maxNumber1 += num
return maxNumber1
else:
num2 = num2[1:]
return maxNumber1 + fillInDigit(num1,num2)
if __name__ == "__main__":
main() | if int(maxLeadingDigit)>int(num2[0]): | 28 | decision |
def main():
a = list(input(""))
b = input("")
a.sort()
a.reverse()
maxNumber = ""
if len(a) < len(str(b)):
for num in a:
maxNumber += num
else:
maxNumber = fillInDigit(a,b)
print(maxNumber)
def fillInDigit(num1, num2):
maxLeadingDigit = "0"
for x in num1:
if int(x) <= int(num2[0]) and int(x) > int(maxLeadingDigit):
maxLeadingDigit = x
maxNumber1 = maxLeadingDigit
num1.remove(maxLeadingDigit)
if int(maxLeadingDigit) < int(num2[0]):
for num in num1:
maxNumber1 += num
return maxNumber1
else:
num2 = num2[1:]
return maxNumber1 + fillInDigit(num1,num2)
if __name__ == "__main__":
main() | def main():
a = list(input(""))
b = input("")
a.sort()
a.reverse()
maxNumber = ""
if len(a) < len(str(b)):
for num in a:
maxNumber += num
else:
maxNumber = fillInDigit(a,b)
print(maxNumber)
def fillInDigit(num1, num2):
maxLeadingDigit = "0"
for x in num1:
if int(x) <= int(num2[0]) and int(x) > int(maxLeadingDigit):
maxLeadingDigit = x
maxNumber1 = maxLeadingDigit
num1.remove(maxLeadingDigit)
if int(maxLeadingDigit) < int(num2[0]):
for num in num1:
maxNumber1 += num
return maxNumber1
else:
num2 = num2[1:]
return maxNumber1&fillInDigit(num1,num2)
if __name__ == "__main__":
main() | return maxNumber1&fillInDigit(num1,num2) | 34 | operation |
def main():
a = list(input(""))
b = input("")
a.sort()
a.reverse()
maxNumber = ""
if len(a) < len(str(b)):
for num in a:
maxNumber += num
else:
maxNumber = fillInDigit(a,b)
print(maxNumber)
def fillInDigit(num1, num2):
maxLeadingDigit = "0"
for x in num1:
if int(x) <= int(num2[0]) and int(x) > int(maxLeadingDigit):
maxLeadingDigit = x
maxNumber1 = maxLeadingDigit
num1.remove(maxLeadingDigit)
if int(maxLeadingDigit) < int(num2[0]):
for num in num1:
maxNumber1 += num
return maxNumber1
else:
num2 = num2[1:]
return maxNumber1 + fillInDigit(num1,num2)
if __name__ == "__main__":
main() | def main():
a = list(input(""))
b = input("")
a.sort()
a.reverse()
maxNumber = ""
if len(a) < len(str(b)):
for num in a:
maxNumber += num
else:
maxNumber = fillInDigit(a,b)
print(maxNumber)
def fillInDigit(num1, num2):
maxLeadingDigit = "0"
for x in num1:
if int(x) <= int(num2[0]) and int(x) > int(maxLeadingDigit):
maxLeadingDigit = x
maxNumber1 = maxLeadingDigit
num1.remove(maxLeadingDigit)
if int(maxLeadingDigit) < int(num2[0]):
for num in num1:
maxNumber1 += num
return maxNumber1
else:
num2 = num2[1:]
return maxNumber1+fillInDigit(num1,num2)
if __name__ == "__main__":
main() | return maxNumber1+fillInDigit(num1,num2) | 34 | operation |
def main():
a = list(input(""))
b = input("")
a.sort()
a.reverse()
maxNumber = ""
if len(a) < len(str(b)):
for num in a:
maxNumber += num
else:
maxNumber = fillInDigit(a,b)
print(maxNumber)
def fillInDigit(num1, num2):
maxLeadingDigit = "0"
for x in num1:
if int(x) <= int(num2[0]) and int(x) > int(maxLeadingDigit):
maxLeadingDigit = x
maxNumber1 = maxLeadingDigit
num1.remove(maxLeadingDigit)
if int(maxLeadingDigit) < int(num2[0]):
for num in num1:
maxNumber1 += num
return maxNumber1
else:
num2 = num2[1:]
return maxNumber1 + fillInDigit(num1,num2)
if __name__ == "__main__":
main() | def main():
a = list(input(""))
b = input("")
a.sort()
a.reverse()
maxNumber = ""
if len(a)>len(str(b)):
for num in a:
maxNumber += num
else:
maxNumber = fillInDigit(a,b)
print(maxNumber)
def fillInDigit(num1, num2):
maxLeadingDigit = "0"
for x in num1:
if int(x) <= int(num2[0]) and int(x) > int(maxLeadingDigit):
maxLeadingDigit = x
maxNumber1 = maxLeadingDigit
num1.remove(maxLeadingDigit)
if int(maxLeadingDigit) < int(num2[0]):
for num in num1:
maxNumber1 += num
return maxNumber1
else:
num2 = num2[1:]
return maxNumber1 + fillInDigit(num1,num2)
if __name__ == "__main__":
main() | if len(a)>len(str(b)): | 10 | decision |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.